Lines Matching refs:root
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
162 * examines the (potentially changed) root cyclic, repeating the
163 * cyclic_expire()/add interval/cyclic_downheap() sequence until the root
167 * shortly after the root cyclic's expiration time.
175 * 1. The root of the heap is always in the 0th element of the heap array
246 * each child), but at most one cache miss at the root. This yields a bound
523 * 6. If the root of the heap has changed, the backend is reprogrammed.
593 * 5. If the cyclic move modified the root of the heap, the backend is
729 * Returns 1 if the upheap propagated to the root, 0 if it did not. This
730 * allows the caller to reprogram the backend only when the root has been
766 * If we just reached the root, we're done.
1032 * Now we have a cyclic in the root slot which isn't in the past;
1705 * If our upheap propagated to the root, we need to
1766 cyc_index_t root;
1849 root = heap[0];
1861 CYC_TRACE0(cpu, CY_HIGH_LEVEL, "remove-root");
1866 * The upheap didn't propagate to the root; if it
1869 CYC_TRACE0(cpu, CY_HIGH_LEVEL, "remove-no-root");
1874 ASSERT(heap[0] == root);
1880 * We're here because we changed the root; we need to reprogram
2002 * The root changed. Reprogram the clock source.
2004 CYC_TRACE0(cpu, CY_HIGH_LEVEL, "reprog-root");
2700 * sufficient privilege to deny service (i.e. its caller is root).