63 heap_print(const heap_t *heap)  in heap_print()  argument
67 	malloc_printf("vvv heap %p vvv\n", heap);  in heap_print()
68 	if (heap->ph_root == NULL)  in heap_print()
71 	node_print(heap->ph_root, 0);  in heap_print()
73 	for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;  in heap_print()
82 	malloc_printf("^^^ heap %p ^^^\n", heap);  in heap_print()
114 heap_validate(const heap_t *heap)  in heap_validate()  argument
119 	if (heap->ph_root == NULL)  in heap_validate()
122 	nnodes += node_validate(heap->ph_root, NULL);  in heap_validate()
124 	for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;  in heap_validate()
134 		heap_print(heap);  in heap_validate()
140 	heap_t heap;  in TEST_BEGIN()  local
142 	heap_new(&heap);  in TEST_BEGIN()
143 	assert_true(heap_empty(&heap), "Heap should be empty");  in TEST_BEGIN()
144 	assert_ptr_null(heap_first(&heap), "Unexpected node");  in TEST_BEGIN()
149 node_remove(heap_t *heap, node_t *node)  in node_remove()  argument
152 	heap_remove(heap, node);  in node_remove()
158 node_remove_first(heap_t *heap)  in node_remove_first()  argument
160 	node_t *node = heap_remove_first(heap);  in node_remove_first()
172 	heap_t heap;  in TEST_BEGIN()  local
196 			heap_new(&heap);  in TEST_BEGIN()
197 			assert_u_eq(heap_validate(&heap), 0,  in TEST_BEGIN()
206 				heap_insert(&heap, &nodes[k]);  in TEST_BEGIN()
209 					assert_ptr_not_null(heap_first(&heap),  in TEST_BEGIN()
212 				assert_u_eq(heap_validate(&heap), k + 1,  in TEST_BEGIN()
216 			assert_false(heap_empty(&heap),  in TEST_BEGIN()
223 					assert_u_eq(heap_validate(&heap), j - k,  in TEST_BEGIN()
225 					node_remove(&heap, &nodes[k]);  in TEST_BEGIN()
226 					assert_u_eq(heap_validate(&heap), j - k  in TEST_BEGIN()
232 					node_remove(&heap, &nodes[k-1]);  in TEST_BEGIN()
233 					assert_u_eq(heap_validate(&heap), k - 1,  in TEST_BEGIN()
240 					node_t *node = node_remove_first(&heap);  in TEST_BEGIN()
241 					assert_u_eq(heap_validate(&heap), j - k  in TEST_BEGIN()
254 					node_t *node = heap_first(&heap);  in TEST_BEGIN()
255 					assert_u_eq(heap_validate(&heap), j - k,  in TEST_BEGIN()
262 					node_remove(&heap, node);  in TEST_BEGIN()
263 					assert_u_eq(heap_validate(&heap), j - k  in TEST_BEGIN()
272 			assert_ptr_null(heap_first(&heap),  in TEST_BEGIN()
274 			assert_true(heap_empty(&heap), "Heap should be empty");  in TEST_BEGIN()