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);
55 int v3_init_mem_map(struct v3_vm_info * vm) {
56 struct v3_mem_map * map = &(vm->mem_map);
57 addr_t mem_pages = vm->mem_size >> 12;
59 memset(&(map->base_region), 0, sizeof(struct v3_mem_region));
61 map->mem_regions.rb_node = NULL;
64 // There is an underlying region that contains all of the guest memory
65 // PrintDebug("Mapping %d pages of memory (%u bytes)\n", (int)mem_pages, (uint_t)info->mem_size);
67 // 2MB page alignment needed for 2MB hardware nested paging
68 map->base_region.guest_start = 0;
69 map->base_region.guest_end = mem_pages * PAGE_SIZE_4KB;
70 map->base_region.host_addr = (addr_t)V3_AllocAlignedPages(mem_pages, PAGE_SIZE_2MB);
72 map->base_region.flags.read = 1;
73 map->base_region.flags.write = 1;
74 map->base_region.flags.exec = 1;
75 map->base_region.flags.base = 1;
76 map->base_region.flags.alloced = 1;
78 map->base_region.unhandled = unhandled_err;
80 if ((void *)map->base_region.host_addr == NULL) {
81 PrintError("Could not allocate Guest memory\n");
85 //memset(V3_VAddr((void *)map->base_region.host_addr), 0xffffffff, map->base_region.guest_end);
87 v3_register_hypercall(vm, MEM_OFFSET_HCALL, mem_offset_hypercall, NULL);
93 void v3_delete_mem_map(struct v3_vm_info * vm) {
94 struct rb_node * node = v3_rb_first(&(vm->mem_map.mem_regions));
95 struct v3_mem_region * reg;
96 struct rb_node * tmp_node = NULL;
99 reg = rb_entry(node, struct v3_mem_region, tree_node);
101 node = v3_rb_next(node);
103 v3_delete_mem_region(vm, reg);
106 V3_FreePage((void *)(vm->mem_map.base_region.host_addr));
110 struct v3_mem_region * v3_create_mem_region(struct v3_vm_info * vm, uint16_t core_id,
111 addr_t guest_addr_start, addr_t guest_addr_end) {
113 struct v3_mem_region * entry = (struct v3_mem_region *)V3_Malloc(sizeof(struct v3_mem_region));
114 memset(entry, 0, sizeof(struct v3_mem_region));
116 entry->guest_start = guest_addr_start;
117 entry->guest_end = guest_addr_end;
118 entry->core_id = core_id;
119 entry->unhandled = unhandled_err;
127 int v3_add_shadow_mem( struct v3_vm_info * vm, uint16_t core_id,
128 addr_t guest_addr_start,
129 addr_t guest_addr_end,
132 struct v3_mem_region * entry = NULL;
134 entry = v3_create_mem_region(vm, core_id,
138 entry->host_addr = host_addr;
141 entry->flags.read = 1;
142 entry->flags.write = 1;
143 entry->flags.exec = 1;
144 entry->flags.alloced = 1;
146 if (v3_insert_mem_region(vm, entry) == -1) {
157 struct v3_mem_region * __insert_mem_region(struct v3_vm_info * vm,
158 struct v3_mem_region * region) {
159 struct rb_node ** p = &(vm->mem_map.mem_regions.rb_node);
160 struct rb_node * parent = NULL;
161 struct v3_mem_region * tmp_region;
165 tmp_region = rb_entry(parent, struct v3_mem_region, tree_node);
167 if (region->guest_end <= tmp_region->guest_start) {
169 } else if (region->guest_start >= tmp_region->guest_end) {
172 if ((region->guest_end != tmp_region->guest_end) ||
173 (region->guest_start != tmp_region->guest_start)) {
174 PrintError("Trying to map a partial overlapped core specific page...\n");
175 return tmp_region; // This is ugly...
176 } else if (region->core_id == tmp_region->core_id) {
178 } else if (region->core_id < tmp_region->core_id) {
186 rb_link_node(&(region->tree_node), parent, p);
193 int v3_insert_mem_region(struct v3_vm_info * vm, struct v3_mem_region * region) {
194 struct v3_mem_region * ret;
197 if ((ret = __insert_mem_region(vm, region))) {
201 v3_rb_insert_color(&(region->tree_node), &(vm->mem_map.mem_regions));
205 for (i = 0; i < vm->num_cores; i++) {
206 struct guest_info * info = &(vm->cores[i]);
208 // flush virtual page tables
209 // 3 cases shadow, shadow passthrough, and nested
211 if (info->shdw_pg_mode == SHADOW_PAGING) {
212 v3_mem_mode_t mem_mode = v3_get_vm_mem_mode(info);
214 if (mem_mode == PHYSICAL_MEM) {
217 for (cur_addr = region->guest_start;
218 cur_addr < region->guest_end;
219 cur_addr += PAGE_SIZE_4KB) {
220 v3_invalidate_passthrough_addr(info, cur_addr);
223 v3_invalidate_shadow_pts(info);
226 } else if (info->shdw_pg_mode == NESTED_PAGING) {
229 for (cur_addr = region->guest_start;
230 cur_addr < region->guest_end;
231 cur_addr += PAGE_SIZE_4KB) {
233 v3_invalidate_nested_addr(info, cur_addr);
244 struct v3_mem_region * v3_get_mem_region(struct v3_vm_info * vm, uint16_t core_id, addr_t guest_addr) {
245 struct rb_node * n = vm->mem_map.mem_regions.rb_node;
246 struct v3_mem_region * reg = NULL;
250 reg = rb_entry(n, struct v3_mem_region, tree_node);
252 if (guest_addr < reg->guest_start) {
254 } else if (guest_addr >= reg->guest_end) {
257 if (reg->core_id == V3_MEM_CORE_ANY) {
258 // found relevant region, it's available on all cores
260 } else if (core_id == reg->core_id) {
261 // found relevant region, it's available on the indicated core
263 } else if (core_id < reg->core_id) {
264 // go left, core too big
266 } else if (core_id > reg->core_id) {
267 // go right, core too small
270 PrintDebug("v3_get_mem_region: Impossible!\n");
277 // There is not registered region, so we check if its a valid address in the base region
279 if (guest_addr > vm->mem_map.base_region.guest_end) {
280 PrintError("Guest Address Exceeds Base Memory Size (ga=0x%p), (limit=0x%p) (core=0x%x)\n",
281 (void *)guest_addr, (void *)vm->mem_map.base_region.guest_end, core_id);
282 v3_print_mem_map(vm);
287 return &(vm->mem_map.base_region);
292 /* Search the "hooked" memory regions for a region that ends after the given address. If the
293 * address is invalid, return NULL. Else, return the first region found or the base region if no
294 * region ends after the given address.
296 struct v3_mem_region * v3_get_next_mem_region( struct v3_vm_info * vm, uint16_t core_id, addr_t guest_addr) {
297 struct rb_node * n = vm->mem_map.mem_regions.rb_node;
298 struct v3_mem_region * reg = NULL;
300 // Keep going to the right in the tree while the address is greater than the current region's
303 reg = rb_entry(n, struct v3_mem_region, tree_node);
304 if (guest_addr >= reg->guest_end) { // reg is [start,end)
307 if ((core_id == reg->core_id) || (reg->core_id == V3_MEM_CORE_ANY)) {
315 // There is no registered region, so we check if it's a valid address in the base region
317 if (guest_addr >= vm->mem_map.base_region.guest_end) {
318 PrintError("%s: Guest Address Exceeds Base Memory Size (ga=%p), (limit=%p)\n",
319 __FUNCTION__, (void *)guest_addr, (void *)vm->mem_map.base_region.guest_end);
320 v3_print_mem_map(vm);
324 return &(vm->mem_map.base_region);
330 void v3_delete_mem_region(struct v3_vm_info * vm, struct v3_mem_region * reg) {
337 for (i = 0; i < vm->num_cores; i++) {
338 struct guest_info * info = &(vm->cores[i]);
340 // flush virtual page tables
341 // 3 cases shadow, shadow passthrough, and nested
343 if (info->shdw_pg_mode == SHADOW_PAGING) {
344 v3_mem_mode_t mem_mode = v3_get_vm_mem_mode(info);
346 if (mem_mode == PHYSICAL_MEM) {
349 for (cur_addr = reg->guest_start;
350 cur_addr < reg->guest_end;
351 cur_addr += PAGE_SIZE_4KB) {
352 v3_invalidate_passthrough_addr(info, cur_addr);
355 v3_invalidate_shadow_pts(info);
358 } else if (info->shdw_pg_mode == NESTED_PAGING) {
361 for (cur_addr = reg->guest_start;
362 cur_addr < reg->guest_end;
363 cur_addr += PAGE_SIZE_4KB) {
365 v3_invalidate_nested_addr(info, cur_addr);
370 v3_rb_erase(&(reg->tree_node), &(vm->mem_map.mem_regions));
374 // flush virtual page tables
375 // 3 cases shadow, shadow passthrough, and nested
381 void v3_print_mem_map(struct v3_vm_info * vm) {
382 struct rb_node * node = v3_rb_first(&(vm->mem_map.mem_regions));
383 struct v3_mem_region * reg = &(vm->mem_map.base_region);
386 V3_Print("Memory Layout (all cores):\n");
389 V3_Print("Base Region (all cores): 0x%p - 0x%p -> 0x%p\n",
390 (void *)(reg->guest_start),
391 (void *)(reg->guest_end - 1),
392 (void *)(reg->host_addr));
395 // If the memory map is empty, don't print it
401 reg = rb_entry(node, struct v3_mem_region, tree_node);
403 V3_Print("%d: 0x%p - 0x%p -> 0x%p\n", i,
404 (void *)(reg->guest_start),
405 (void *)(reg->guest_end - 1),
406 (void *)(reg->host_addr));
408 V3_Print("\t(flags=0x%x) (core=0x%x) (unhandled = 0x%p)\n",
414 } while ((node = v3_rb_next(node)));