31 	int err = 0;  in pop_verify_heap()
34 	last = values[0];  in pop_verify_heap()
36 	while (heap->nr > 0) {  in pop_verify_heap()
38 			if (last > values[0]) {  in pop_verify_heap()
40 					values[0]);  in pop_verify_heap()
44 			if (last < values[0]) {  in pop_verify_heap()
46 					values[0]);  in pop_verify_heap()
50 		last = values[0];  in pop_verify_heap()
58 	int values[] = { 3, 1, 2, 4, 0x8000000, 0x7FFFFFF, 0,  in test_heapify_all()
59 			 -3, -1, -2, -4, 0x8000000, 0x7FFFFFF };  in test_heapify_all()
78 	for (i = 0; i < heap.nr; i++)  in test_heapify_all()
89 	const int data[] = { 3, 1, 2, 4, 0x80000000, 0x7FFFFFFF, 0,  in test_heap_push()
90 			     -3, -1, -2, -4, 0x80000000, 0x7FFFFFFF };  in test_heap_push()
94 		.nr = 0,  in test_heap_push()
104 	for (i = 0; i < ARRAY_SIZE(data); i++)  in test_heap_push()
121 	const int data[] = { 3, 1, 2, 4, 0x80000000, 0x7FFFFFFF, 0,  in test_heap_pop_push()
122 			     -3, -1, -2, -4, 0x80000000, 0x7FFFFFFF };  in test_heap_pop_push()
126 		.nr = 0,  in test_heap_pop_push()
136 	temp = min_heap ? 0x80000000 : 0x7FFFFFFF;  in test_heap_pop_push()
137 	for (i = 0; i < ARRAY_SIZE(data); i++)  in test_heap_pop_push()
141 	for (i = 0; i < ARRAY_SIZE(data); i++)  in test_heap_pop_push()
146 	heap.nr = 0;  in test_heap_pop_push()
147 	for (i = 0; i < ARRAY_SIZE(data); i++)  in test_heap_pop_push()
151 	for (i = 0; i < ARRAY_SIZE(data); i++) {  in test_heap_pop_push()
162 	int values[] = { 3, 1, 2, 4, 0x8000000, 0x7FFFFFF, 0,  in test_heap_del()
163 			 -3, -1, -2, -4, 0x8000000, 0x7FFFFFF };  in test_heap_del()
176 	for (i = 0; i < ARRAY_SIZE(values) / 2; i++)  in test_heap_del()
183 	for (i = 0; i < heap.nr; i++)  in test_heap_del()
187 	for (i = 0; i < ARRAY_SIZE(values) / 2; i++)  in test_heap_del()
196 	int err = 0;  in test_min_heap_init()
211 	return 0;  in test_min_heap_init()