Lines Matching refs:events
13 events []*Event
45 // The high level idea is as follows. Events within an individual batch are in
49 // that is, events for which all dependencies are already merged. Then we choose
53 func order1007(m map[int][]*Event) (events []*Event, err error) {
64 if b.selected || len(b.events) == 0 {
67 ev := b.events[0]
73 b.events = b.events[1:]
75 // Get rid of "Local" events, they are intended merely for ordering.
86 return nil, fmt.Errorf("no consistent ordering of events possible")
92 events = append(events, f.ev)
100 // At this point we have a consistent stream of events.
103 if !sort.IsSorted(eventList(events)) {
107 // The last part is giving correct timestamps to EvGoSysExit events.
113 // We also can't simply update the timestamp and resort events, because
117 for _, ev := range events {
136 sort.Stable(eventList(events))
218 func order1005(m map[int][]*Event) (events []*Event, err error) {
220 events = append(events, batch...)
222 for _, ev := range events {
232 sort.Sort(eventSeqList(events))
233 if !sort.IsSorted(eventList(events)) {
