Lines Matching defs:it

107 	 * fit in an unsigned long.  Compute the total and convert it to
116 * case, but it is slightly slower and assumes that hz is integral.
140 * and callers need to check for it.
189 * fix it to have at least minimal value (i.e. if it is less
190 * than the resolution of the clock, round it up.). We don't
223 * True if tsp + usp can be computed without overflow, i.e., if it
250 * Break it into two mutually exclusive and exhaustive cases:
319 * timespecadd, so to avoid overflow it is not enough
336 * True if tsp - usp can be computed without overflow, i.e., if it
362 * Break it into two mutually exclusive and exhaustive cases:
437 * timespecsub, so to avoid overflow it is not enough
460 * itimer_transition(it, now, next, &overruns)
464 * - it: the current state of an itimer (it_value = last expiry
478 itimer_transition(const struct itimerspec *restrict it,
496 if (!timespecisset(&it->it_interval)) {
502 backwards = (timespeccmp(&it->it_value, now, >));
505 KASSERT(it->it_value.tv_sec >= 0);
506 KASSERT(it->it_value.tv_nsec < 1000000000);
507 KASSERT(it->it_interval.tv_sec >= 0);
508 KASSERT(it->it_interval.tv_nsec < 1000000000);
511 KASSERT(it->it_interval.tv_sec >= 0);
512 KASSERT(it->it_interval.tv_nsec >= 0);
516 if (__predict_false(!timespecaddok(&it->it_value,
517 &it->it_interval)))
519 timespecadd(&it->it_value, &it->it_interval, next);
530 __predict_false(!timespec2nsok(&it->it_value)) ||
531 __predict_false(!timespec2nsok(&it->it_interval)))
535 last_val = timespec2ns(&it->it_value);
536 interval = timespec2ns(&it->it_interval);
560 * negative, so subtracting it stays in place or moves
573 * (now_ns == last_val is not possible at this point because it