47 		struct priority_queue_entry e;  member
55 dump_pqueue_entry(priority_queue_entry_sched_t e, int depth)  in dump_pqueue_entry()  argument
59 	printf("%*s [%02d] %p\n", depth * 4, "", e->key, (void *)e);  in dump_pqueue_entry()
60 	t = pqueue_sched_max_t::unpack_child(e);  in dump_pqueue_entry()
64 	while (e->next) {  in dump_pqueue_entry()
65 		e = e->next;  in dump_pqueue_entry()
66 		dump_pqueue_entry(e, depth);  in dump_pqueue_entry()
153 	    priority_heap_make_comparator(a, b, union test_node, e, {
167 		priority_queue_entry_init(&node->e);
169 		priority_queue_insert(&pq, &node->e);
174 	update_result = priority_queue_entry_increased(&pq, &node->e);
176 	result = priority_queue_max(&pq, union test_node, e);
182 	update_result = priority_queue_entry_decreased(&pq, &node->e);
184 	result = priority_queue_max(&pq, union test_node, e);
195 		result = priority_queue_remove_max(&pq, union test_node, e);
202 	priority_queue_destroy(&pq, union test_node, e, ^(test_node_t n) {