Lines Matching full:last
19 struct ordered_event *last = oe->last; in queue_event() local
24 oe->last = new; in queue_event()
28 if (!last) { in queue_event()
35 * last event might point to some random place in the list as it's in queue_event()
36 * the last queued event. We expect that the new event is close to in queue_event()
39 if (last->timestamp <= timestamp) { in queue_event()
40 while (last->timestamp <= timestamp) { in queue_event()
41 p = last->list.next; in queue_event()
47 last = list_entry(p, struct ordered_event, list); in queue_event()
49 list_add_tail(&new->list, &last->list); in queue_event()
51 while (last->timestamp > timestamp) { in queue_event()
52 p = last->list.prev; in queue_event()
57 last = list_entry(p, struct ordered_event, list); in queue_event()
59 list_add(&new->list, &last->list); in queue_event()
169 pr_oe_time(oe->last_flush, "last flush, last_flush_type %d\n", in ordered_events__queue()
193 u64 last_ts = oe->last ? oe->last->timestamp : 0ULL; in __ordered_events__flush()
222 oe->last = NULL; in __ordered_events__flush()
224 oe->last = list_entry(head->prev, struct ordered_event, list); in __ordered_events__flush()
252 struct ordered_event *first, *last; in ordered_events__flush() local
256 last = oe->last; in ordered_events__flush()
259 if (WARN_ONCE(!last || list_empty(head), "empty queue")) in ordered_events__flush()
263 oe->next_flush += (last->timestamp - first->timestamp) / 2; in ordered_events__flush()