posix/malloc_debug/heap.cpp

144 	heap_area *	all_areas; // all areas including full ones
248 	heap_area *area = heap->all_areas;
287 		heap_area *area = heap->all_areas;
382 		heap_area *area = heap->all_areas;
488 	heap_area *area = heap->all_areas;
557 	area = heap->all_areas;
560 			panic("base ordering of all_areas list broken\n");
573 			area = heap->all_areas;
712 	// insert this area in the all_areas list so it stays ordered by base
713 	if (heap->all_areas == NULL || heap->all_areas->base < area->base) {
714 		area->all_next = heap->all_areas;
715 		heap->all_areas = area;
717 		heap_area *insert = heap->all_areas;
759 	if (heap->all_areas == area)
760 		heap->all_areas = area->all_next;
762 		heap_area *previous = heap->all_areas;
793 	heap->areas = heap->all_areas = NULL;
1182 	heap_area *area = heap->all_areas;
1184 		// since the all_areas list is ordered by base with the biggest
1395 	heap_area *area = heap->all_areas;
1397 		// since the all_areas list is ordered by base with the biggest
1513 	heap_area *area = heap->all_areas;
1515 		// since the all_areas list is ordered by base with the biggest