17 	struct ordered_event *last = oe->last;  in queue_event()  local
22 	oe->last = new;  in queue_event()
26 	if (!last) {  in queue_event()
37 	if (last->timestamp <= timestamp) {  in queue_event()
38 		while (last->timestamp <= timestamp) {  in queue_event()
39 			p = last->list.next;  in queue_event()
45 			last = list_entry(p, struct ordered_event, list);  in queue_event()
47 		list_add_tail(&new->list, &last->list);  in queue_event()
49 		while (last->timestamp > timestamp) {  in queue_event()
50 			p = last->list.prev;  in queue_event()
55 			last = list_entry(p, struct ordered_event, list);  in queue_event()
57 		list_add(&new->list, &last->list);  in queue_event()
164 	u64 last_ts = oe->last ? oe->last->timestamp : 0ULL;  in __ordered_events__flush()
200 		oe->last = NULL;  in __ordered_events__flush()
202 		oe->last = list_entry(head->prev, struct ordered_event, list);  in __ordered_events__flush()
226 		struct ordered_event *first, *last;  in ordered_events__flush()  local
230 		last = oe->last;  in ordered_events__flush()
233 		if (WARN_ONCE(!last || list_empty(head), "empty queue"))  in ordered_events__flush()
237 		oe->next_flush += (last->timestamp - first->timestamp) / 2;  in ordered_events__flush()