X-Git-Url: http://git.buserror.net/cgi-bin/gitweb.cgi?p=polintos%2Fscott%2Fpriv.git;a=blobdiff_plain;f=lib%2Fc%2B%2B%2Forb.cc;h=8533f52347146f677a142a539cca850b675819e3;hp=a6158bf9ebcf0c23824e28e6adcf34f671b55e10;hb=263f276afb0b78c5c8914a54975d383425869d66;hpb=15d9baeca05f30f8564785c255fed765ede457ff

diff --git a/lib/c++/orb.cc b/lib/c++/orb.cc
index a6158bf..8533f52 100644
--- a/lib/c++/orb.cc
+++ b/lib/c++/orb.cc
@@ -7,8 +7,7 @@ namespace RunTime {
 
 	// This function could be made to do a binary search if we can
 	// manage to somehow sort the IFaceTables...
-	uintptr_t downcast(::System::_i_Object *obj,
-	                   const unsigned long *new_guid)
+	uintptr_t downcast(::System::_i_Object *obj, const GUID *new_guid)
 	{
 		if (!obj)
 			return 0;
@@ -19,7 +18,7 @@ namespace RunTime {
 			unsupported_long_size();
 
 		IFaceTable *tbl = obj->info->concrete_IFaceTable;
-		unsigned long new_guid_first = *new_guid;
+		unsigned long new_guid_first = new_guid->l[0];
 		
 		// This doesn't use guids_equal(), as that would eliminate the
 		// ability to cache the first word of new_guid.  The compiler
@@ -29,15 +28,15 @@ namespace RunTime {
 		// behaves.
 		
 		while (true) {
-			if (tbl->info->guid[0] == new_guid_first &&
-			    tbl->info->guid[1] == new_guid[1] &&
+			if (tbl->info->guid->l[0] == new_guid_first &&
+			    tbl->info->guid->l[1] == new_guid->l[1] &&
 			    (sizeof(long) == 8 ||
-			     (tbl->info->guid[2] == new_guid[2] &&
-			      tbl->info->guid[3] == new_guid[3])))
+			     (tbl->info->guid->l[2] == new_guid->l[2] &&
+			      tbl->info->guid->l[3] == new_guid->l[3])))
 				break;				
 
 			tbl++;
-			if (__builtin_expect(!tbl->info->guid, 0))
+			if (__builtin_expect(!tbl->info->guid->l[0], 0))
 				return 0;
 		}
 	
@@ -58,7 +57,7 @@ namespace RunTime {
 		};
 
 		typedef ::Util::RadixTree<Object, ID, 6> ObjTable;
-		ObjTable objtable;
+//		ObjTable objtable;
 
 		unsigned long get_pc()
 		{