Home
last modified time | relevance | path

Searched refs:pqueue_t (Results 1 – 2 of 2) sorted by relevance

/xnu-12377.61.12/osfmk/kern/
H A Dpriority_queue.h669 #define PRIORITY_QUEUE_MAKE_BASE(pqueue_t, pqelem_t) \ argument
672 _priority_queue_destroy(pqueue_t pq, uintptr_t offset, void (^cb)(void *)); \
675 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)
689 #define PRIORITY_QUEUE_MAKE(pqueue_t, pqelem_t) \ argument
692 priority_queue_init(pqueue_t que) \
697 PRIORITY_QUEUE_MAKE_BASE(pqueue_t, pqelem_t)
[all …]
/xnu-12377.61.12/libkern/c++/
H A Dpriority_queue.cpp413 #define PRIORITY_QUEUE_MAKE_IMPL(pqueue_t, queue_t, entry_t) \ argument
415 using pqueue_t = pqueue<queue_t, entry_t>; \
422 pqueue_t::destroy(que, offset, cb); \
428 return pqueue_t::insert(que, elt); \
434 return pqueue_t::remove_root(que, que->pq_root); \
440 return pqueue_t::remove(que, elt); \
446 return pqueue_t::entry_decreased(que, elt); \
452 return pqueue_t::entry_increased(que, elt); \