Lines Matching defs:last
20 struct ordered_event *last = oe->last;
25 oe->last = new;
29 if (!last) {
36 * last event might point to some random place in the list as it's
37 * the last queued event. We expect that the new event is close to
40 if (last->timestamp <= timestamp) {
41 while (last->timestamp <= timestamp) {
42 p = last->list.next;
48 last = list_entry(p, struct ordered_event, list);
50 list_add_tail(&new->list, &last->list);
52 while (last->timestamp > timestamp) {
53 p = last->list.prev;
58 last = list_entry(p, struct ordered_event, list);
60 list_add(&new->list, &last->list);
204 pr_oe_time(oe->last_flush, "last flush, last_flush_type %d\n",
228 u64 last_ts = oe->last ? oe->last->timestamp : 0ULL;
256 oe->last = NULL;
258 oe->last = list_entry(head->prev, struct ordered_event, list);
293 struct ordered_event *first, *last;
297 last = oe->last;
300 if (WARN_ONCE(!last || list_empty(head), "empty queue"))
304 oe->next_flush += (last->timestamp - first->timestamp) / 2;