2 * This file is part of the Palacios Virtual Machine Monitor developed
3 * by the V3VEE Project with funding from the United States National
4 * Science Foundation and the Department of Energy.
6 * The V3VEE Project is a joint project between Northwestern University
7 * and the University of New Mexico. You can find out more at
10 * Copyright (c) 2008, Jack Lange <jarusl@cs.northwestern.edu>
11 * Copyright (c) 2008, The V3VEE Project <http://www.v3vee.org>
12 * All rights reserved.
14 * Author: Jack Lange <jarusl@cs.northwestern.edu>
16 * This is free software. You are permitted to use,
17 * redistribute, and modify it as specified in the file "V3VEE_LICENSE".
20 #include <palacios/vmm_mem.h>
21 #include <palacios/vmm.h>
22 #include <palacios/vmm_util.h>
23 #include <palacios/vmm_emulator.h>
24 #include <palacios/vm_guest.h>
26 #include <palacios/vmm_shadow_paging.h>
27 #include <palacios/vmm_direct_paging.h>
32 static int mem_offset_hypercall(struct guest_info * info, uint_t hcall_id, void * private_data) {
33 PrintDebug("V3Vee: Memory offset hypercall (offset=%p)\n",
34 (void *)(info->vm_info->mem_map.base_region.host_addr));
36 info->vm_regs.rbx = info->vm_info->mem_map.base_region.host_addr;
41 static int unhandled_err(struct guest_info * core, addr_t guest_va, addr_t guest_pa,
42 struct v3_mem_region * reg, pf_error_t access_info) {
44 PrintError("Unhandled memory access error\n");
46 v3_print_mem_map(core->vm_info);
48 v3_print_guest_state(core);
53 int v3_init_mem_map(struct v3_vm_info * vm) {
54 struct v3_mem_map * map = &(vm->mem_map);
55 addr_t mem_pages = vm->mem_size >> 12;
57 memset(&(map->base_region), 0, sizeof(struct v3_mem_region));
59 map->mem_regions.rb_node = NULL;
61 // There is an underlying region that contains all of the guest memory
62 // PrintDebug("Mapping %d pages of memory (%u bytes)\n", (int)mem_pages, (uint_t)info->mem_size);
64 // 2MB page alignment needed for 2MB hardware nested paging
65 map->base_region.guest_start = 0;
66 map->base_region.guest_end = mem_pages * PAGE_SIZE_4KB;
68 #ifdef CONFIG_ALIGNED_PG_ALLOC
69 map->base_region.host_addr = (addr_t)V3_AllocAlignedPages(mem_pages, vm->mem_align);
71 map->base_region.host_addr = (addr_t)V3_AllocPages(mem_pages);
74 map->base_region.flags.read = 1;
75 map->base_region.flags.write = 1;
76 map->base_region.flags.exec = 1;
77 map->base_region.flags.base = 1;
78 map->base_region.flags.alloced = 1;
80 map->base_region.unhandled = unhandled_err;
82 if ((void *)map->base_region.host_addr == NULL) {
83 PrintError("Could not allocate Guest memory\n");
87 //memset(V3_VAddr((void *)map->base_region.host_addr), 0xffffffff, map->base_region.guest_end);
89 v3_register_hypercall(vm, MEM_OFFSET_HCALL, mem_offset_hypercall, NULL);
95 void v3_delete_mem_map(struct v3_vm_info * vm) {
96 struct rb_node * node = v3_rb_first(&(vm->mem_map.mem_regions));
97 struct v3_mem_region * reg;
98 struct rb_node * tmp_node = NULL;
101 reg = rb_entry(node, struct v3_mem_region, tree_node);
103 node = v3_rb_next(node);
105 v3_delete_mem_region(vm, reg);
108 V3_FreePage((void *)(vm->mem_map.base_region.host_addr));
112 struct v3_mem_region * v3_create_mem_region(struct v3_vm_info * vm, uint16_t core_id,
113 addr_t guest_addr_start, addr_t guest_addr_end) {
115 struct v3_mem_region * entry = (struct v3_mem_region *)V3_Malloc(sizeof(struct v3_mem_region));
116 memset(entry, 0, sizeof(struct v3_mem_region));
118 entry->guest_start = guest_addr_start;
119 entry->guest_end = guest_addr_end;
120 entry->core_id = core_id;
121 entry->unhandled = unhandled_err;
129 int v3_add_shadow_mem( struct v3_vm_info * vm, uint16_t core_id,
130 addr_t guest_addr_start,
131 addr_t guest_addr_end,
134 struct v3_mem_region * entry = NULL;
136 entry = v3_create_mem_region(vm, core_id,
140 entry->host_addr = host_addr;
142 entry->flags.read = 1;
143 entry->flags.write = 1;
144 entry->flags.exec = 1;
145 entry->flags.alloced = 1;
147 if (v3_insert_mem_region(vm, entry) == -1) {
158 struct v3_mem_region * __insert_mem_region(struct v3_vm_info * vm,
159 struct v3_mem_region * region) {
160 struct rb_node ** p = &(vm->mem_map.mem_regions.rb_node);
161 struct rb_node * parent = NULL;
162 struct v3_mem_region * tmp_region;
166 tmp_region = rb_entry(parent, struct v3_mem_region, tree_node);
168 if (region->guest_end <= tmp_region->guest_start) {
170 } else if (region->guest_start >= tmp_region->guest_end) {
173 if ((region->guest_end != tmp_region->guest_end) ||
174 (region->guest_start != tmp_region->guest_start)) {
175 PrintError("Trying to map a partial overlapped core specific page...\n");
176 return tmp_region; // This is ugly...
177 } else if (region->core_id == tmp_region->core_id) {
179 } else if (region->core_id < tmp_region->core_id) {
187 rb_link_node(&(region->tree_node), parent, p);
194 int v3_insert_mem_region(struct v3_vm_info * vm, struct v3_mem_region * region) {
195 struct v3_mem_region * ret;
198 if ((ret = __insert_mem_region(vm, region))) {
202 v3_rb_insert_color(&(region->tree_node), &(vm->mem_map.mem_regions));
206 for (i = 0; i < vm->num_cores; i++) {
207 struct guest_info * info = &(vm->cores[i]);
209 // flush virtual page tables
210 // 3 cases shadow, shadow passthrough, and nested
212 if (info->shdw_pg_mode == SHADOW_PAGING) {
213 v3_mem_mode_t mem_mode = v3_get_vm_mem_mode(info);
215 if (mem_mode == PHYSICAL_MEM) {
218 for (cur_addr = region->guest_start;
219 cur_addr < region->guest_end;
220 cur_addr += PAGE_SIZE_4KB) {
221 v3_invalidate_passthrough_addr(info, cur_addr);
224 v3_invalidate_shadow_pts(info);
227 } else if (info->shdw_pg_mode == NESTED_PAGING) {
230 for (cur_addr = region->guest_start;
231 cur_addr < region->guest_end;
232 cur_addr += PAGE_SIZE_4KB) {
234 v3_invalidate_nested_addr(info, cur_addr);
245 struct v3_mem_region * v3_get_mem_region(struct v3_vm_info * vm, uint16_t core_id, addr_t guest_addr) {
246 struct rb_node * n = vm->mem_map.mem_regions.rb_node;
247 struct v3_mem_region * reg = NULL;
251 reg = rb_entry(n, struct v3_mem_region, tree_node);
253 if (guest_addr < reg->guest_start) {
255 } else if (guest_addr >= reg->guest_end) {
258 if (reg->core_id == V3_MEM_CORE_ANY) {
259 // found relevant region, it's available on all cores
261 } else if (core_id == reg->core_id) {
262 // found relevant region, it's available on the indicated core
264 } else if (core_id < reg->core_id) {
265 // go left, core too big
267 } else if (core_id > reg->core_id) {
268 // go right, core too small
271 PrintDebug("v3_get_mem_region: Impossible!\n");
278 // There is not registered region, so we check if its a valid address in the base region
280 if (guest_addr > vm->mem_map.base_region.guest_end) {
281 PrintError("Guest Address Exceeds Base Memory Size (ga=0x%p), (limit=0x%p) (core=0x%x)\n",
282 (void *)guest_addr, (void *)vm->mem_map.base_region.guest_end, core_id);
283 v3_print_mem_map(vm);
288 return &(vm->mem_map.base_region);
293 /* This returns the next memory region based on a given address.
294 * If the address falls inside a sub region, that region is returned.
295 * If the address falls outside a sub region, the next sub region is returned
296 * NOTE that we have to be careful about core_ids here...
298 static struct v3_mem_region * get_next_mem_region( struct v3_vm_info * vm, uint16_t core_id, addr_t guest_addr) {
299 struct rb_node * n = vm->mem_map.mem_regions.rb_node;
300 struct v3_mem_region * reg = NULL;
301 struct v3_mem_region * parent = NULL;
305 reg = rb_entry(n, struct v3_mem_region, tree_node);
307 if (guest_addr < reg->guest_start) {
309 } else if (guest_addr >= reg->guest_end) {
312 if (reg->core_id == V3_MEM_CORE_ANY) {
313 // found relevant region, it's available on all cores
315 } else if (core_id == reg->core_id) {
316 // found relevant region, it's available on the indicated core
318 } else if (core_id < reg->core_id) {
319 // go left, core too big
321 } else if (core_id > reg->core_id) {
322 // go right, core too small
325 PrintError("v3_get_mem_region: Impossible!\n");
330 if ((reg->core_id == core_id) || (reg->core_id == V3_MEM_CORE_ANY)) {
336 if (parent->guest_start > guest_addr) {
338 } else if (parent->guest_end < guest_addr) {
339 struct rb_node * node = &(parent->tree_node);
341 while ((node = v3_rb_next(node)) != NULL) {
342 struct v3_mem_region * next_reg = rb_entry(node, struct v3_mem_region, tree_node);
344 if ((next_reg->core_id == V3_MEM_CORE_ANY) ||
345 (next_reg->core_id == core_id)) {
347 // This check is not strictly necessary, but it makes it clearer
348 if (next_reg->guest_start > guest_addr) {
361 /* Given an address region of memory, find if there are any regions that overlap with it.
362 * This checks that the range lies in a single region, and returns that region if it does,
363 * this can be either the base region or a sub region.
364 * IF there are multiple regions in the range then it returns NULL
366 static struct v3_mem_region * get_overlapping_region(struct v3_vm_info * vm, uint16_t core_id,
367 addr_t start_gpa, addr_t end_gpa) {
368 struct v3_mem_region * start_region = v3_get_mem_region(vm, core_id, start_gpa);
370 if (start_region == NULL) {
371 PrintError("Invalid memory region\n");
376 if (start_region->guest_end < end_gpa) {
377 // Region ends before range
379 } else if (start_region->flags.base == 0) {
380 // sub region overlaps range
383 // Base region, now we have to scan forward for the next sub region
384 struct v3_mem_region * next_reg = get_next_mem_region(vm, core_id, start_gpa);
386 if (next_reg == NULL) {
387 // no sub regions after start_addr, base region is ok
389 } else if (next_reg->guest_start >= end_gpa) {
390 // Next sub region begins outside range
398 // Should never get here
406 void v3_delete_mem_region(struct v3_vm_info * vm, struct v3_mem_region * reg) {
413 for (i = 0; i < vm->num_cores; i++) {
414 struct guest_info * info = &(vm->cores[i]);
416 // flush virtual page tables
417 // 3 cases shadow, shadow passthrough, and nested
419 if (info->shdw_pg_mode == SHADOW_PAGING) {
420 v3_mem_mode_t mem_mode = v3_get_vm_mem_mode(info);
422 if (mem_mode == PHYSICAL_MEM) {
425 for (cur_addr = reg->guest_start;
426 cur_addr < reg->guest_end;
427 cur_addr += PAGE_SIZE_4KB) {
428 v3_invalidate_passthrough_addr(info, cur_addr);
431 v3_invalidate_shadow_pts(info);
434 } else if (info->shdw_pg_mode == NESTED_PAGING) {
437 for (cur_addr = reg->guest_start;
438 cur_addr < reg->guest_end;
439 cur_addr += PAGE_SIZE_4KB) {
441 v3_invalidate_nested_addr(info, cur_addr);
446 v3_rb_erase(&(reg->tree_node), &(vm->mem_map.mem_regions));
450 // flush virtual page tables
451 // 3 cases shadow, shadow passthrough, and nested
455 // Determine if a given address can be handled by a large page of the requested size
456 uint32_t v3_get_max_page_size(struct guest_info * core, addr_t page_addr, v3_cpu_mode_t mode) {
459 uint32_t page_size = PAGE_SIZE_4KB;
460 struct v3_mem_region * reg = NULL;
464 if (core->use_large_pages == 1) {
465 pg_start = PAGE_ADDR_4MB(page_addr);
466 pg_end = (pg_start + PAGE_SIZE_4MB);
468 reg = get_overlapping_region(core->vm_info, core->cpu_id, pg_start, pg_end);
470 if ((reg) && ((reg->host_addr % PAGE_SIZE_4MB) == 0)) {
471 page_size = PAGE_SIZE_4MB;
476 if (core->use_large_pages == 1) {
477 pg_start = PAGE_ADDR_2MB(page_addr);
478 pg_end = (pg_start + PAGE_SIZE_2MB);
480 reg = get_overlapping_region(core->vm_info, core->cpu_id, pg_start, pg_end);
482 if ((reg) && ((reg->host_addr % PAGE_SIZE_2MB) == 0)) {
483 page_size = PAGE_SIZE_2MB;
490 if (core->use_giant_pages == 1) {
491 pg_start = PAGE_ADDR_1GB(page_addr);
492 pg_end = (pg_start + PAGE_SIZE_1GB);
494 reg = get_overlapping_region(core->vm_info, core->cpu_id, pg_start, pg_end);
496 if ((reg) && ((reg->host_addr % PAGE_SIZE_1GB) == 0)) {
497 page_size = PAGE_SIZE_1GB;
502 if (core->use_large_pages == 1) {
503 pg_start = PAGE_ADDR_2MB(page_addr);
504 pg_end = (pg_start + PAGE_SIZE_2MB);
506 reg = get_overlapping_region(core->vm_info, core->cpu_id, pg_start, pg_end);
508 if ((reg) && ((reg->host_addr % PAGE_SIZE_2MB) == 0)) {
509 page_size = PAGE_SIZE_2MB;
514 PrintError("Invalid CPU mode: %s\n", v3_cpu_mode_to_str(v3_get_vm_cpu_mode(core)));
523 void v3_print_mem_map(struct v3_vm_info * vm) {
524 struct rb_node * node = v3_rb_first(&(vm->mem_map.mem_regions));
525 struct v3_mem_region * reg = &(vm->mem_map.base_region);
528 V3_Print("Memory Layout (all cores):\n");
531 V3_Print("Base Region (all cores): 0x%p - 0x%p -> 0x%p\n",
532 (void *)(reg->guest_start),
533 (void *)(reg->guest_end - 1),
534 (void *)(reg->host_addr));
537 // If the memory map is empty, don't print it
543 reg = rb_entry(node, struct v3_mem_region, tree_node);
545 V3_Print("%d: 0x%p - 0x%p -> 0x%p\n", i,
546 (void *)(reg->guest_start),
547 (void *)(reg->guest_end - 1),
548 (void *)(reg->host_addr));
550 V3_Print("\t(flags=0x%x) (core=0x%x) (unhandled = 0x%p)\n",
556 } while ((node = v3_rb_next(node)));