Lines Matching refs:expiration

114  *      cyclic_reprogram()   <-- Reprogram a cyclic's expiration
150 * The cyclics are kept sorted by expiration time in the cyc_cpu's heap. The
151 * heap is keyed by cyclic expiration time, with parents expiring earlier
157 * compares the root cyclic's expiration time to the current time. If the
158 * expiration time is in the past, cyclic_expire() is called on the root
159 * cyclic. Upon return from cyclic_expire(), the cyclic's new expiration time
160 * is derived by adding its interval to its old expiration time, and a
164 * cyclic has an expiration time in the future. This expiration time
167 * shortly after the root cyclic's expiration time.
303 * there must be a one-to-one mapping between a cyclic's expiration at
519 * 3. The current expiration time for the removed cyclic is recorded.
550 * CPU, recording its expiration time in the remove cross call (step (3)
552 * setting its expiration time to the time recorded in the removal. This
558 * Normally, after a cyclic fires, its next expiration is computed from
560 * the next expiration needs to be reprogrammed by the kernel subsystem that
571 * expiration. However, for a lock-level or a low-level cyclic, the
576 * expiration to CY_INFINITY. This effectively moves the cyclic to the
590 * 4. The cyclic expiration is set and the cyclic is moved to its
592 * new expiration is less than or greater than the old one).
753 * We have an expiration time later than our parent; we're
801 * our expiration time against that of our left child.
810 * the expiration times of the children to determine which
816 * We'll now compare our expiration time to its; if
835 * no right child). We'll now compare our expiration time
979 * recompute the expiration. Then, if the interval is
980 * infinity, set the expiration to infinity. This can
1008 * In either case, we set the new expiration time to be the
1010 * expiration time modulo the interval is invariant.
1781 * Grab the current expiration time. If this cyclic is being
1782 * removed as part of a juggling operation, the expiration time
1976 * set to infinity on every expiration. We shorten the search by
2020 cyclic_reprogram_here(cyc_cpu_t *cpu, cyc_index_t ndx, hrtime_t expiration)
2026 ASSERT(expiration > 0);
2031 when.cyt_when = expiration;
3048 cyclic_reprogram(cyclic_id_t id, hrtime_t expiration)
3055 ASSERT(expiration > 0);
3100 cyclic_reprogram_cyclic(cpu, ndx, expiration);
3102 cyclic_reprogram_here(cpu, ndx, expiration);