X-Git-Url: https://git.ucc.asn.au/?a=blobdiff_plain;ds=sidebyside;f=Usermode%2FLibraries%2Flibgcc.so_src%2Flibgcc.c;fp=Usermode%2FLibraries%2Flibgcc.so_src%2Flibgcc.c;h=bd5d1f3a3c65c502457341a092d9c5719fbd85cd;hb=da7ef0c8cace452ccfdfa0881a3c0b09970874d8;hp=53ea643236a044c00ed10d3c255ab612743154f6;hpb=0b9aaf1442259bb14619b92e251f6535b3dc0dd1;p=tpg%2Facess2.git

diff --git a/Usermode/Libraries/libgcc.so_src/libgcc.c b/Usermode/Libraries/libgcc.so_src/libgcc.c
index 53ea6432..bd5d1f3a 100644
--- a/Usermode/Libraries/libgcc.so_src/libgcc.c
+++ b/Usermode/Libraries/libgcc.so_src/libgcc.c
@@ -46,7 +46,8 @@ uint64_t __udivdi3(uint64_t Num, uint64_t Den)
 	}
 	return ret;
 	#else
-	uint64_t	P[64], q, n;
+	uint64_t	P[2];
+	uint64_t	q;
 	 int	i;
 	
 	if(Den == 0)	__asm__ __volatile__ ("int $0x0");
@@ -57,28 +58,31 @@ uint64_t __udivdi3(uint64_t Num, uint64_t Den)
 	if(Den == 2)	return Num >> 1;
 	if(Den == 16)	return Num >> 4;
 	if(Num < Den)	return 0;
-	if(Num == Den)	return 1;
+	if(Num < Den*2)	return 1;
 	if(Num == Den*2)	return 2;
 	
-	// Non-restoring division, from wikipedia
+	// Restoring division, from wikipedia
 	// http://en.wikipedia.org/wiki/Division_(digital)
-	P[0] = Num;
-	for( i = 0; i < 64; i ++ )
+	P[0] = Num;	P[1] = 0;
+	for( i = 64; i--; )
 	{
-		if( P[i] >= 0 ) {
+		// P <<= 1;
+		P[1] = (P[1] << 1) | (P[0] >> 63);
+		P[0] = P[0] << 1;
+		
+		// P -= Den << 64
+		P[1] -= Den;
+		
+		// P >= 0
+		if( !(P[1] & (1ULL<<63)) ) {
 			q |= (uint64_t)1 << (63-i);
-			P[i+1] = 2*P[i] - Den;
 		}
 		else {
 			//q |= 0 << (63-i);
-			P[i+1] = 2*P[i] + Den;
+			P[1] += Den;
 		}
 	}
 	
-	n = ~q;
-	n = -n;
-	q += n;
-	
 	return q;
 	#endif
 }