geekos/include/geekos/vmm_stubs.h

   1 /*
   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.
   5  *
   6  * The V3VEE Project is a joint project between Northwestern University
   7  * and the University of New Mexico.  You can find out more at
   8  * http://www.v3vee.org
   9  *
  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.
  13  *
  14  * Author: Jack Lange <jarusl@cs.northwestern.edu>
  15  *
  16  * This is free software.  You are permitted to use,
  17  * redistribute, and modify it as specified in the file "V3VEE_LICENSE".
  18  */
  19
  20 #ifndef __VMM_STUBS_H
  21 #define __VMM_STUBS_H
  22
  23
  24 #include <geekos/mem.h>
  25 #include <geekos/malloc.h>
  26
  27
  28 struct guest_info;
  29
  30
  31
  32
  33 void * Allocate_VMM_Pages(int num_pages);
  34 void Free_VMM_Page(void * page);
  35
  36 void * VMM_Malloc(unsigned int size);
  37 void VMM_Free(void * addr);
  38
  39 void * Identity(void *addr);
  40
  41
  42
  43
  44 int hook_irq_stub(struct guest_info * info, int irq);
  45 int ack_irq(int irq);
  46
  47
  48
  49 int geekos_hook_interrupt_new(uint_t irq, void *opaque);
  50
  51
  52 unsigned int get_cpu_khz();
  53
  54 void Init_Stubs();
  55
  56
  57
  58
  59
  60
  61
  62
  63
  64
  65 #if 0
  66
  67 # define do_div(n,base) ({                                      \
  68         uint32_t __base = (base);                               \
  69         uint32_t __rem;                                         \
  70         __rem = ((uint64_t)(n)) % __base;                       \
  71         (n) = ((uint64_t)(n)) / __base;                         \
  72         __rem;                                                  \
  73  })
  74
  75 #else
  76
  77 /*
  78  * do_div() is NOT a C function. It wants to return
  79  * two values (the quotient and the remainder), but
  80  * since that doesn't work very well in C, what it
  81  * does is:
  82  *
  83  * - modifies the 64-bit dividend _in_place_
  84  * - returns the 32-bit remainder
  85  *
  86  * This ends up being the most efficient "calling
  87  * convention" on x86.
  88  */
  89 #define do_div(n,base) ({                                    \
  90       unsigned long __upper, __low, __high, __mod, __base;   \
  91       __base = (base);                                       \
  92       asm("":"=a" (__low), "=d" (__high):"A" (n));           \
  93       __upper = __high;                                      \
  94       if (__high) {                                          \
  95         __upper = __high % (__base);                         \
  96         __high = __high / (__base);                          \
  97       }                                                                 \
  98       asm("divl %2":"=a" (__low), "=d" (__mod):"rm" (__base), "0" (__low), "1" (__upper)); \
  99       asm("":"=A" (n):"a" (__low),"d" (__high));                        \
 100       __mod;                                                            \
 101     })
 102
 103 #endif
 104
 105
 106
 107
 108
 109
 110 #endif