Home
last modified time | relevance | path

Searched refs:queues (Results 1 – 13 of 13) sorted by relevance

/xnu-12377.41.6/tests/sched/sched_test_harness/shadow_headers/
H A Dsched_prim.c111 circle_queue_init(&rq->queues[i]); in run_queue_init()
129 circle_queue_t queue = &rq->queues[rq->highq]; in run_queue_dequeue()
166 circle_queue_t queue = &rq->queues[thread->sched_pri]; in run_queue_enqueue()
204 circle_queue_t queue = &rq->queues[thread->sched_pri]; in run_queue_remove()
236 circle_queue_t queue = &rq->queues[rq->highq]; in run_queue_peek()
/xnu-12377.41.6/iokit/DriverKit/
H A DIODispatchQueue.iig68 * All blocks submitted to dispatch queues are dequeued in FIFO order.
77 …* @discussion Creates a new dispatch queue object. All queues are currently serial, executing one…
109 * @discussion Returns a pointer to the queues name. Only valid while the queue is retained.
110 * @return C-string pointer in the queues internal storage.
121 * @return C-string pointer in the queues internal storage.
173 …* @brief Log the current execution context with respect to any queues the current thread hol…
/xnu-12377.41.6/osfmk/kern/
H A Dwaitq.h862 #pragma mark wait queues lifecycle
890 #pragma mark port wait queues and port set waitq sets
1050 #pragma mark select wait queues and select port set waitq sets
H A Dsched.h253 circle_queue_head_t queues[NRQS]; /* one for each priority */ member
H A Dsmr.h271 #pragma mark SMR queues
1153 #pragma mark implementation details: SMR queues
H A Dsched_prim.c3991 circle_queue_init(&rq->queues[i]); in run_queue_init()
4010 circle_queue_t queue = &rq->queues[rq->highq]; in run_queue_dequeue()
4049 circle_queue_t queue = &rq->queues[thread->sched_pri]; in run_queue_enqueue()
4090 circle_queue_t queue = &rq->queues[thread->sched_pri]; in run_queue_remove()
4124 circle_queue_t queue = &rq->queues[rq->highq]; in run_queue_peek()
6934 circle_queue_t queue = &runq->queues[queue_index]; in runq_scan()
H A Dwaitq.c368 #pragma mark global wait queues
/xnu-12377.41.6/bsd/net/
H A Dpf_ruleset.c182 TAILQ_INIT(&ruleset->rules[i].queues[0]); in pf_init_ruleset()
183 TAILQ_INIT(&ruleset->rules[i].queues[1]); in pf_init_ruleset()
184 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0]; in pf_init_ruleset()
185 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1]; in pf_init_ruleset()
H A Dpfvar.h1214 struct pf_rulequeue queues[2]; member
/xnu-12377.41.6/doc/vm/
H A Dpageout_scan.md93 or reclaimed page that we remove from one of the inactive/anonymous queues below.
103 The following page queues are eligible to be reclaimed from:
114 - If the queues of interest are all empty, block for 50ms. There is nothing
118 - If the compressor queues are full ("throttled"):
157 page-queues). As such, `pageout_scan` cannot block if the lock is currently
/xnu-12377.41.6/doc/observability/
H A Dmt_stackshot.md25 populating queues of tasks to be put into the stackshot and collecting bits of
29 The other CPUs begin chipping away at the queues, and the main CPU joins
45 there are two, and tasks are sorted between the queues based on their
/xnu-12377.41.6/tools/lldbmacros/
H A Dscheduler.py207 thread_circleq = thread_runq.queues[pri]
590 runq_queue_count = sizeof(runq.queues) // sizeof(runq.queues[0])
593 runq_queue_head = addressof(runq.queues[runq_queue_i])
H A Dkevent.py33 queues = list()