posix/malloc_debug/heap.cpp

136 	uint32		page_size;
163 	size_t		page_size;
265 	printf("allocator %p: name: %s; page_size: %" B_PRIu32 "; bin_count: %"
267 		"empty_areas: %" B_PRIu32 "\n", heap, heap->name, heap->page_size,
295 				addr_t base = area->base + i * heap->page_size;
343 						* heap->page_size - sizeof(heap_leak_check_info));
390 				addr_t base = area->base + i * heap->page_size;
443 						* heap->page_size - sizeof(heap_leak_check_info));
445 					if (info->size > pageCount * heap->page_size
449 							pageCount, pageCount * heap->page_size);
618 			addr_t pageBase = area->base + page->index * heap->page_size;
621 					|| (addr_t)element >= pageBase + heap->page_size)
665 	uint32 pageCount = size / heap->page_size;
676 	pageCount = area->size / heap->page_size;
791 	heap->page_size = heapClass->page_size;
798 	uint32 count = heap->page_size / heapClass->min_bin_size;
803 		binSize = (heap->page_size / count) & ~(heapClass->bin_alignment - 1);
806 		if (heap->page_size - count * binSize > heapClass->max_waste_per_page)
812 		bin->max_free_count = heap->page_size / binSize;
957 		if (alignment > heap->page_size) {
959 				/ heap->page_size;
960 			step = alignment / heap->page_size;
1027 	uint32 pageCount = (size + heap->page_size - 1) / heap->page_size;
1038 	addr_t address = firstPage->area->base + firstPage->index * heap->page_size;
1039 	heap_add_leak_check_info(address, pageCount * heap->page_size, size);
1094 		address = (void *)(page->area->base + page->index * heap->page_size
1209 		/ heap->page_size];
1220 	addr_t pageBase = area->base + page->index * heap->page_size;
1338 		size_t allocationSize = pageCount * heap->page_size;
1423 		/ heap->page_size];
1443 		maxSize = heap->page_size;
1451 			minSize += heap->page_size;
1452 			maxSize += heap->page_size;
1538 		/ heap->page_size];
1547 	addr_t pageBase = area->base + page->index * heap->page_size;
1591 		size_t allocationSize = pageCount * heap->page_size;