arch/x86/arch_vm.cpp

65 	uint64						base;
77 	bool IsStart() const	{ return range->base == address; }
122 		TRACE_MTRR("  mtrr: %2" B_PRIu32 ": base: %#10" B_PRIx64  ", size: %#10"
123 			B_PRIx64 ", type: %u\n", i, info.base, info.size,
131 add_used_mtrr(uint64 base, uint64 size, uint32 type)
137 	mtrr.base = base;
146 add_mtrrs_for_range(uint64 base, uint64 size, uint32 type)
149 		if ((base & interval) != 0) {
150 			if (!add_used_mtrr(base, interval, type))
152 			base += interval;
157 			if (!add_used_mtrr(base + size - interval, interval, type))
190 			previousEnd = range->base + range->size;
201 					nextStart = nextRange->base;
213 		// Align the range's base and end to the greatest power of two possible.
219 		uint64 rangeBase = range->base;
241 		range->base = rangeBase;
252 			if (range->base >= rangeEnd)
255 			if (range->base + range->size > rangeEnd) {
257 				range->size = range->base + range->size - rangeEnd;
258 				range->base = rangeEnd;
334 		rangePoints[pointCount].address = range->base;
336 		rangePoints[pointCount].address = range->base + range->size;
385 			ranges[rangeCount].size = point->address - ranges[rangeCount].base;
404 				|| previousRange->base + previousRange->size
405 					< activeRange->base) {
407 			ranges[rangeCount].base = point->address;
417 			ranges[i].base, ranges[i].base + ranges[i].size, ranges[i].type);
422 	// has a power of two size and a base address aligned to the size. For
424 	// MTRR-friendliness by aligning a range's base and end address to the
425 	// greatest power of two (base rounded down, end up) such that the extended
466 				ranges[i].base, ranges[i].base + ranges[i].size,
485 			if (!add_mtrrs_for_range(ranges[i].base, ranges[i].size, type))
538 add_memory_type_range(area_id areaID, uint64 base, uint64 size, uint32 type)
565 		B_PRIx64 ", %" B_PRIu32 ")\n", areaID, base, size, type);
572 		if (range->base != base || range->size != size)
585 		range->base = base;
618 			B_PRIx64 ", %" B_PRIu32 ")\n", range->area, range->base,