46 template <typename queue_t, typename entry_t>
52 	compare(queue_t que, entry_t a, entry_t b);
55 template <typename queue_t>
56 struct pqueue_entry_traits<queue_t, priority_queue_entry_t> {
58 	compare(queue_t que, priority_queue_entry_t e1, priority_queue_entry_t e2)  in compare()
64 template <typename queue_t>
65 struct pqueue_entry_traits<queue_t, priority_queue_entry_deadline_t> {
67 	compare(queue_t que __unused,  in compare()
74 template <typename queue_t>
75 struct pqueue_entry_traits<queue_t, priority_queue_entry_sched_t> {
77 	compare(queue_t que __unused,  in compare()
84 template <typename queue_t>
85 struct pqueue_entry_traits<queue_t, priority_queue_entry_stable_t> {
87 	compare(queue_t que __unused,  in compare()
125 template <typename queue_t, typename entry_t>
127 	using entry_traits = pqueue_entry_traits<queue_t, entry_t>;
149 	merge_parent_is_subtree_b(queue_t que, entry_t subtree_a, entry_t subtree_b)  in merge_parent_is_subtree_b()
151 		if (priority_queue_is_max_heap((queue_t)nullptr)) {  in merge_parent_is_subtree_b()
158 	merge_pair_inline(queue_t que, entry_t subtree_a, entry_t subtree_b)  in merge_pair_inline()
189 	merge_pair(queue_t que, entry_t subtree_a, entry_t subtree_b)  in merge_pair()
196 	meld_pair(queue_t que, entry_t elt)  in meld_pair()
262 	sift_down(queue_t que, entry_t elt)  in sift_down()
287 	sift_up(queue_t que, entry_t elt)  in sift_up()
300 	remove_non_root(queue_t que, entry_t elt)  in remove_non_root()
330 	destroy(queue_t que, uintptr_t offset, void (^callback)(void *e))
355 	insert(queue_t que, entry_t elt, bool clear = true)  in insert()
365 	remove_root(queue_t que, entry_t old_root)  in remove_root()
379 	remove(queue_t que, entry_t elt)  in remove()
391 	entry_increased(queue_t que, entry_t elt)  in entry_increased()
401 	entry_decreased(queue_t que, entry_t elt)  in entry_decreased()
413 #define PRIORITY_QUEUE_MAKE_IMPL(pqueue_t, queue_t, entry_t)                    \  argument
415 using pqueue_t = pqueue<queue_t, entry_t>;                                      \
420 _priority_queue_destroy(queue_t que, uintptr_t offset, void (^cb)(void *e))     \
426 priority_queue_insert(queue_t que, entry_t elt)                                 \
432 _priority_queue_remove_root(queue_t que)                                        \
438 priority_queue_remove(queue_t que, entry_t elt)                                 \
444 priority_queue_entry_decreased(queue_t que, entry_t elt)                        \
450 priority_queue_entry_increased(queue_t que, entry_t elt)                        \