250 	if (!t->sched_info.last_queued)  in sched_info_dequeue()
253 	delta = rq_clock(rq) - t->sched_info.last_queued;  in sched_info_dequeue()
254 	t->sched_info.last_queued = 0;  in sched_info_dequeue()
255 	t->sched_info.run_delay += delta;  in sched_info_dequeue()
256 	if (delta > t->sched_info.max_run_delay)  in sched_info_dequeue()
257 		t->sched_info.max_run_delay = delta;  in sched_info_dequeue()
258 	if (delta && (!t->sched_info.min_run_delay || delta < t->sched_info.min_run_delay))  in sched_info_dequeue()
259 		t->sched_info.min_run_delay = delta;  in sched_info_dequeue()
272 	if (!t->sched_info.last_queued)  in sched_info_arrive()
276 	delta = now - t->sched_info.last_queued;  in sched_info_arrive()
277 	t->sched_info.last_queued = 0;  in sched_info_arrive()
278 	t->sched_info.run_delay += delta;  in sched_info_arrive()
279 	t->sched_info.last_arrival = now;  in sched_info_arrive()
280 	t->sched_info.pcount++;  in sched_info_arrive()
281 	if (delta > t->sched_info.max_run_delay)  in sched_info_arrive()
282 		t->sched_info.max_run_delay = delta;  in sched_info_arrive()
283 	if (delta && (!t->sched_info.min_run_delay || delta < t->sched_info.min_run_delay))  in sched_info_arrive()
284 		t->sched_info.min_run_delay = delta;  in sched_info_arrive()
296 	if (!t->sched_info.last_queued)  in sched_info_enqueue()
297 		t->sched_info.last_queued = rq_clock(rq);  in sched_info_enqueue()
310 	unsigned long long delta = rq_clock(rq) - t->sched_info.last_arrival;  in sched_info_depart()