Lines Matching defs:time
133 * Dispatch time in jiffies. This is the estimated time when group
285 * Scale up: linearly scale up according to lapsed time since upgrade. For
723 * time calculated according to previous limit might be invalid. It's
724 * possible the cgroup sleep time is very long and no other cgroups
741 * dispatch time of the first pending child. Returns %true if either timer
762 /* is the next dispatch time in the future? */
845 * If bps are unlimited (-1), then time slice don't get
912 /* Round up to the next throttle slice, wait time must be nonzero */
936 /* Calc approx time to dispatch */
974 /* Calc approx time to dispatch */
982 * This wait time is without taking into consideration the rounding
983 * up we did. Add that time also.
1070 * second time when it eventually gets issued. Set it when a bio
1127 /* Update dispatch time */
1433 * make sure all children has lower idle time threshold and
1863 * limit. Its overflow time is useless for children
1882 * - average think time is more than threshold
1885 unsigned long time;
1888 time = min_t(unsigned long, MAX_IDLE_TIME, 4 * tg->idletime_threshold);
1891 (ktime_get_ns() >> 10) - tg->last_finish_time > time ||
2300 * a long time and slice keeps on extending and trim is not
2301 * called for a long time. Now if limits are reduced suddenly
2304 * time.
2337 * Update @tg's dispatch time and force schedule dispatch if @tg
2362 int op, unsigned long time)
2375 latency[index].total_latency += time;