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".
21 #include <palacios/vmm_inspector.h>
22 #include <palacios/vmm.h>
23 #include <palacios/vm_guest.h>
24 #include <palacios/vmm_sprintf.h>
26 // Note that v3_inspect_node_t is actuall a struct v3_mtree
27 // Its set as void for opaque portability
30 int v3_init_inspector(struct v3_vm_info * vm) {
31 struct v3_inspector_state * state = (struct v3_inspector_state *)&(vm->inspector);
33 strncpy(state->state_tree.name, "vm->name", 50);
34 state->state_tree.subtree = 1;
40 int v3_init_inspector_core(struct guest_info * core) {
41 struct v3_inspector_state * vm_state = &(core->vm_info->inspector);
44 snprintf(core_name, 50, "core.%d", core->cpu_id);
47 struct v3_mtree * core_node = v3_mtree_create_subtree(&(vm_state->state_tree), core_name);
48 struct v3_mtree * gpr_node = v3_mtree_create_subtree(core_node, "GPRS");
50 v3_inspect_64(gpr_node, "RAX", (uint64_t *)&(core->vm_regs.rax));
57 v3_inspect_node_t * v3_inspect_add_subtree(v3_inspect_node_t * root, char * name) {
58 return v3_mtree_create_subtree(root, name);
61 int v3_inspect_8(v3_inspect_node_t * node, char * name, uint8_t * val) {
62 v3_mtree_create_value(node, name, 1, val);
67 int v3_inspect_16(v3_inspect_node_t * node, char * name, uint16_t * val) {
68 v3_mtree_create_value(node, name, 2, val);
73 int v3_inspect_32(v3_inspect_node_t * node, char * name, uint32_t * val) {
74 v3_mtree_create_value(node, name, 4, val);
78 int v3_inspect_64(v3_inspect_node_t * node, char * name, uint64_t * val) {
79 v3_mtree_create_value(node, name, 8, val);
83 int v3_inspect_addr(v3_inspect_node_t * node, char * name, addr_t * val) {
84 v3_mtree_create_value(node, name, sizeof(addr_t), val);
88 int v3_inspect_buf(v3_inspect_node_t * node, char * name,
89 uint8_t * buf, uint64_t size) {
90 v3_mtree_create_value(node, name, size, buf);
99 int v3_get_inspection_value(v3_inspect_node_t * node, char * name,
100 struct v3_inspection_value * value) {
101 struct v3_mtree * mt_node = v3_mtree_find_node(node, name);
107 value->value = mt_node->value;
108 value->size = mt_node->size;
109 value->flags = mt_node->user_flags;
110 value->name = mt_node->name;
117 v3_inspect_node_t * v3_get_inspection_root(struct v3_vm_info * vm) {
118 return &(vm->inspector.state_tree);
121 v3_inspect_node_t * v3_get_inspection_subtree(v3_inspect_node_t * root, char * name) {
122 return v3_mtree_find_subtree(root, name);