X-Git-Url: http://v3vee.org/palacios/gitweb/gitweb.cgi?a=blobdiff_plain;f=palacios%2Finclude%2Fpalacios%2Fvmm_util.h;h=caa6a16953ec195ba8cbf535574c18534755fecf;hb=e70e95962c26832628d586e07f9cd1a2e1852d72;hp=95a0c8e3ad11437f1b79b0b76aa3bb22c9e4a1b7;hpb=d8fc6aa4bc2a5d9cec50923e9d2bd30f867dd50a;p=palacios.git

diff --git a/palacios/include/palacios/vmm_util.h b/palacios/include/palacios/vmm_util.h
index 95a0c8e..caa6a16 100644
--- a/palacios/include/palacios/vmm_util.h
+++ b/palacios/include/palacios/vmm_util.h
@@ -1,6 +1,27 @@
+/*
+ * This file is part of the Palacios Virtual Machine Monitor developed
+ * by the V3VEE Project with funding from the United States National 
+ * Science Foundation and the Department of Energy.  
+ *
+ * The V3VEE Project is a joint project between Northwestern University
+ * and the University of New Mexico.  You can find out more at 
+ * http://www.v3vee.org
+ *
+ * Copyright (c) 2008, Jack Lange <jarusl@cs.northwestern.edu> 
+ * Copyright (c) 2008, The V3VEE Project <http://www.v3vee.org> 
+ * All rights reserved.
+ *
+ * Author: Jack Lange <jarusl@cs.northwestern.edu>
+ *
+ * This is free software.  You are permitted to use,
+ * redistribute, and modify it as specified in the file "V3VEE_LICENSE".
+ */
+
 #ifndef __VMM_UTIL_H
 #define __VMM_UTIL_H
 
+#ifdef __V3VEE__
+
 #include <palacios/vmm_types.h>
 
 
@@ -38,7 +59,7 @@ struct VMM_GPRs {
 
 
 void PrintTraceHex(unsigned char x);
-
+void PrintTraceLL(ullong_t num);
 void PrintTraceMemDump(unsigned char * start, int n);
 
 
@@ -97,19 +118,38 @@ void PrintTraceMemDump(unsigned char * start, int n);
  * This ends up being the most efficient "calling
  * convention" on x86.
  */
-#define do_div(n,base) ({ \
-	unsigned long __upper, __low, __high, __mod, __base; \
-	__base = (base); \
-	asm("":"=a" (__low), "=d" (__high):"A" (n)); \
-	__upper = __high; \
-	if (__high) { \
-		__upper = __high % (__base); \
-		__high = __high / (__base); \
-	} \
-	asm("divl %2":"=a" (__low), "=d" (__mod):"rm" (__base), "0" (__low), "1" (__upper)); \
-	asm("":"=A" (n):"a" (__low),"d" (__high)); \
-	__mod; \
-})
+#define do_div(n,base) ({				     \
+      unsigned long __upper, __low, __high, __mod, __base;   \
+      __base = (base);					     \
+      asm("":"=a" (__low), "=d" (__high):"A" (n));	     \
+      __upper = __high;					     \
+      if (__high) {					     \
+	__upper = __high % (__base);			     \
+	__high = __high / (__base);			     \
+      }									\
+      asm("divl %2":"=a" (__low), "=d" (__mod):"rm" (__base), "0" (__low), "1" (__upper)); \
+      asm("":"=A" (n):"a" (__low),"d" (__high));			\
+      __mod;								\
+    })
+
+
+
+/* This divides two 64bit unsigned ints
+ * The previous version only allows 32 bit bases(?)...
+ * 
+ * NOTE: This absolutely sucks... there has to be a better way....
+ */
+#define do_divll(n, base) ({				\
+      ullong_t __rem = 0;				\
+      ullong_t __num = 0;				\
+      while (n > base) {				\
+	__num++;					\
+	n -= base;					\
+      }							\
+      __rem = n;					\
+      n = __num;					\
+      __rem;						\
+    })						
 
 #endif
 
@@ -117,4 +157,6 @@ void PrintTraceMemDump(unsigned char * start, int n);
 
 
 
+#endif // ! __V3VEE__
+
 #endif