system/kernel/heap.cpp

124 	heap_area *	areas; // sorted so that the desired area is always first
125 	heap_area *	all_areas; // all areas including full ones
365 dump_allocator(heap_allocator *heap, bool areas, bool bins)
373 	if (areas)
458 		// go through all the pages in all the areas
565 		// go through all the pages in all the areas
702 	// go through all the pages in all the areas
907 	// validate the areas
908 	area = heap->areas;
1064 	if (heap->areas == NULL) {
1067 		heap->areas = area;
1070 		heap_area *lastArea = heap->areas;
1122 	if (heap->areas == area)
1123 		heap->areas = area->next;
1176 	heap->areas = heap->all_areas = NULL;
1226 		area->next = heap->areas;
1229 		heap->areas = area;
1243 			if (heap->areas == area)
1244 				heap->areas = area->next;
1276 		if (heap->areas == area)
1277 			heap->areas = area->next;
1297 			if (heap->areas == insert)
1298 				heap->areas = area;
1336 	heap_area *area = heap->areas;
1446 		heap_area *area = heap->areas;
1453 		// by design there are only areas in the list that still have
1606 				// none of the other areas can contain the address as the list
1738 		area = heap->areas;
1787 				// none of the other areas can contain the address as the list
2240 		// don't even attempt such a huge allocation - use areas instead
2306 		// all add areas