system/kernel/heap.cpp

66 	addr_t			base;
132 	void *		base;
352 		kprintf("\tarea %p: area: %" B_PRId32 "; base: %p; size: %zu; page_count: "
354 			area->area, (void *)area->base, area->size, area->page_count,
466 				addr_t base = area->base + i * heap->page_size;
473 							j++, base += elementSize) {
478 							if ((addr_t)temp == base) {
489 								(void *)base, elementSize);
509 						kprintf("address: %p; size: %lu bytes\n", (void *)base,
574 				addr_t base = area->base + i * heap->page_size;
581 							j++, base += elementSize) {
586 							if ((addr_t)temp == base) {
595 						info = (heap_leak_check_info *)(base + elementSize
601 							&& (address == 0 || base == address)) {
607 									base, info->size, info->caller);
625 					info = (heap_leak_check_info *)(base + pageCount
631 						&& (address == 0 || base == address)) {
637 								base, info->size, info->caller);
711 			addr_t base = area->base + i * heap->page_size;
716 				for (uint32 j = 0; j < elementCount; j++, base += elementSize) {
721 						if ((addr_t)temp == base) {
730 					info = (heap_leak_check_info *)(base + elementSize
754 				info = (heap_leak_check_info *)(base + pageCount
926 		if (lastArea != NULL && lastArea->base < area->base)
927 			panic("base ordering of all_areas list broken\n");
982 			addr_t pageBase = area->base + page->index * heap->page_size;
1023 heap_add_area(heap_allocator *heap, area_id areaID, addr_t base, size_t size)
1025 	heap_area *area = (heap_area *)base;
1028 	base += sizeof(heap_area);
1033 	area->page_table = (heap_page *)base;
1034 	base += pageTableSize;
1038 	area->base = ROUNDUP(base, B_PAGE_SIZE);
1078 	// insert this area in the all_areas list so it stays ordered by base
1079 	if (heap->all_areas == NULL || heap->all_areas->base < area->base) {
1084 		while (insert->all_next && insert->all_next->base > area->base)
1104 		"range %p - %p\n", area->area, heap->name, heap, (void *)area->base,
1105 		(void *)(area->base + area->size));
1150 		"from %s heap %p\n", area->area, (void *)area->base,
1151 		(void *)(area->base + area->size), heap->name, heap);
1158 heap_create_allocator(const char *name, addr_t base, size_t size,
1168 		heap = (heap_allocator *)base;
1169 		base += sizeof(heap_allocator);
1205 		base += heap->bin_count * sizeof(heap_bin);
1212 	heap_add_area(heap, -1, base, size);
1348 			firstValid = (ROUNDUP(area->base, alignment) - area->base)
1427 	addr_t address = firstPage->area->base + firstPage->index * heap->page_size;
1484 		address = (void *)(page->area->base + page->index * heap->page_size
1601 		// since the all_areas list is ordered by base with the biggest
1602 		// base at the top, we need only find the first area with a base
1604 		if (area->base <= (addr_t)address) {
1605 			if ((addr_t)address >= area->base + area->size) {
1625 	heap_page *page = &area->page_table[((addr_t)address - area->base)
1663 		if (((addr_t)address - area->base - page->index
1781 		// since the all_areas list is ordered by base with the biggest
1782 		// base at the top, we need only find the first area with a base
1785 		if (area->base <= (addr_t)address) {
1786 			if ((addr_t)address >= area->base + area->size) {
1806 	heap_page *page = &area->page_table[((addr_t)address - area->base)
2036 heap_init(addr_t base, size_t size)
2040 		sHeaps[i] = heap_create_allocator(sHeapClasses[i].name, base, partSize,
2043 		base += partSize;
2178 		addr_t base = 0;
2181 			(void **)&base, B_ANY_KERNEL_ADDRESS, size, B_FULL_LOCK,
2190 				base, partSize, &sHeapClasses[j], false);
2193 			base += partSize;
2260 		info->base = address;
2391 			&& info->size == areaInfo.size && info->base == areaInfo.address
2444 			&& info->size == areaInfo.size && info->base == areaInfo.address
2447 				- (addr_t)info->base);