system/kernel/heap.cpp

113 	uint32		page_size;
367 	kprintf("allocator %p: name: %s; page_size: %" B_PRIu32 "; bin_count: "
369 		"empty_areas: %" B_PRIu32 "\n", heap, heap->name, heap->page_size,
466 				addr_t base = area->base + i * heap->page_size;
506 					size_t size = pageCount * heap->page_size;
574 				addr_t base = area->base + i * heap->page_size;
626 						* heap->page_size - sizeof(heap_leak_check_info));
711 			addr_t base = area->base + i * heap->page_size;
755 					* heap->page_size - sizeof(heap_leak_check_info));
982 			addr_t pageBase = area->base + page->index * heap->page_size;
985 					|| (addr_t)element >= pageBase + heap->page_size)
1031 	uint32 pageCount = size / heap->page_size;
1042 	pageCount = area->size / heap->page_size;
1174 	heap->page_size = heapClass->page_size;
1185 	uint32 count = heap->page_size / heapClass->min_bin_size;
1190 		binSize = (heap->page_size / count) & ~(heapClass->bin_alignment - 1);
1193 		if (heap->page_size - count * binSize > heapClass->max_waste_per_page)
1199 		bin->max_free_count = heap->page_size / binSize;
1347 		if (alignment > heap->page_size) {
1349 				/ heap->page_size;
1350 			step = alignment / heap->page_size;
1418 	uint32 pageCount = (size + heap->page_size - 1) / heap->page_size;
1427 	addr_t address = firstPage->area->base + firstPage->index * heap->page_size;
1429 	heap_add_leak_check_info(heap, address, pageCount * heap->page_size, size);
1484 		address = (void *)(page->area->base + page->index * heap->page_size
1518 	return heap->total_free_pages * heap->page_size < HEAP_GROW_SIZE / 5;
1626 		/ heap->page_size];
1664 			* heap->page_size) % bin->element_size != 0) {
1807 		/ heap->page_size];
1827 		maxSize = heap->page_size;
1835 			minSize += heap->page_size;
1836 			maxSize += heap->page_size;