21 #define VALIDATE(cond) do { if (!(cond)) { return false; } } while (0)
25 	VALIDATE(c >= right_chunk(h, 0));  in in_bounds()
33 	VALIDATE(chunk_size(h, c) > 0);  in valid_chunk()
57 	struct z_heap_bucket *b = &h->buckets[bidx];  in check_nexts()  local
59 	bool emptybit = (h->avail_buckets & BIT(bidx)) == 0;  in check_nexts()
60 	bool emptylist = b->next == 0;  in check_nexts()
66 	if (b->next != 0) {  in check_nexts()
67 		CHECK(valid_chunk(h, b->next));  in check_nexts()
79 	for (c = right_chunk(h, 0); c < h->end_chunk; c = right_chunk(h, c)) {  in sys_heap_validate()
110 	for (int b = 0; b <= bucket_idx(h, h->end_chunk); b++) {  in sys_heap_validate()  local
111 		chunkid_t c0 = h->buckets[b].next;  in sys_heap_validate()
112 		uint32_t n = 0;  in sys_heap_validate()
114 		check_nexts(h, b);  in sys_heap_validate()
116 		for (c = c0; c != 0 && (n == 0 || c != c0);  in sys_heap_validate()
124 		bool empty = (h->avail_buckets & BIT(b)) == 0;  in sys_heap_validate()
125 		bool zero = n == 0;  in sys_heap_validate()
131 		if (empty && (h->buckets[b].next != 0)) {  in sys_heap_validate()
142 	chunkid_t prev_chunk = 0;  in sys_heap_validate()
144 	for (c = right_chunk(h, 0); c < h->end_chunk; c = right_chunk(h, c)) {  in sys_heap_validate()
163 	for (int b = 0; b <= bucket_idx(h, h->end_chunk); b++) {  in sys_heap_validate()  local
164 		chunkid_t c0 = h->buckets[b].next;  in sys_heap_validate()
165 		int n = 0;  in sys_heap_validate()
167 		if (c0 == 0) {  in sys_heap_validate()
171 		for (c = c0; n == 0 || c != c0; n++, c = next_free_chunk(h, c)) {  in sys_heap_validate()
182 	for (c = right_chunk(h, 0); c < h->end_chunk; c = right_chunk(h, c)) {  in sys_heap_validate()