Home
last modified time | relevance | path

Searched refs:que (Results 1 – 8 of 8) sorted by relevance

/xnu-11215/libkern/c++/
H A Dpriority_queue.cpp67 compare(queue_t que __unused, in compare()
268 insert(que, elt, false); in sift_down()
270 remove_root(que, elt); in sift_down()
271 insert(que, elt, false); in sift_down()
314 new_root = merge_pair(que, que->pq_root, child); in remove_non_root()
315 que->pq_root = new_root; in remove_non_root()
361 return (que->pq_root = merge_pair(que, que->pq_root, elt)) == elt; in insert()
370 que->pq_root = meld_pair(que, new_root); in remove_root()
373 que->pq_root = NULL; in remove_root()
382 remove_root(que, elt); in remove()
[all …]
/xnu-11215/osfmk/kern/
H A Dqueue.h286 elt->prev = que; in enqueue_head()
288 que->next = elt; in enqueue_head()
299 elt->next = que; in enqueue_tail()
302 que->prev = elt; in enqueue_tail()
307 queue_t que) in dequeue_head() argument
312 if (que->next != que) { in dequeue_head()
326 queue_t que) in dequeue_tail() argument
331 if (que->prev != que) { in dequeue_tail()
406 elt->prev = que; in re_queue_head()
408 que->next = elt; in re_queue_head()
[all …]
H A Dpriority_queue.h675 priority_queue_insert(pqueue_t que, pqelem_t elt); \
678 _priority_queue_remove_root(pqueue_t que); \
681 priority_queue_remove(pqueue_t que, pqelem_t elt); \
684 priority_queue_entry_decreased(pqueue_t que, pqelem_t elt); \
687 priority_queue_entry_increased(pqueue_t que, pqelem_t elt)
692 priority_queue_init(pqueue_t que) \
694 __builtin_bzero(que, sizeof(*que)); \
/xnu-11215/iokit/DriverKit/
H A Dqueue_implementation.h286 elt->prev = que; in enqueue_head()
288 que->next = elt; in enqueue_head()
299 elt->next = que; in enqueue_tail()
302 que->prev = elt; in enqueue_tail()
307 queue_t que) in dequeue_head() argument
312 if (que->next != que) { in dequeue_head()
326 queue_t que) in dequeue_tail() argument
331 if (que->prev != que) { in dequeue_tail()
406 elt->prev = que; in re_queue_head()
408 que->next = elt; in re_queue_head()
[all …]
/xnu-11215/osfmk/vm/
H A Dvm_page_internal.h160 vm_page_queue_t que, in vm_page_enqueue_tail() argument
165 old_tail = (vm_page_queue_entry_t)VM_PAGE_UNPACK_PTR(que->prev); in vm_page_enqueue_tail()
166 elt->next = VM_PAGE_PACK_PTR(que); in vm_page_enqueue_tail()
167 elt->prev = que->prev; in vm_page_enqueue_tail()
168 que->prev = old_tail->next = VM_PAGE_PACK_PTR(elt); in vm_page_enqueue_tail()
/xnu-11215/iokit/Kernel/
H A DIOKitDebug.cpp554 queue_head_t * que; in IOTrackingAdd() local
595 que = &queue->sites[crc % queue->numSiteQs]; in IOTrackingAdd()
596 queue_iterate(que, site, IOTrackingCallSite *, link) in IOTrackingAdd()
609 if (queue_end(que, (queue_entry_t) site)) { in IOTrackingAdd()
637 queue_enter_first(que, site, IOTrackingCallSite *, link); in IOTrackingAdd()
H A DIOService.cpp334 #define iterqueue(que, elt) \ argument
335 for (queue_entry_t elt = queue_first(que); \
336 !queue_end(que, elt); \
/xnu-11215/
H A DAPPLE_LICENSE346 parties ont exige que le present contrat et tous les documents