--- ray/src/common/urand.c	1991/07/11 16:25:58	1.6
+++ ray/src/common/urand.c	1998/01/05 16:47:37	2.4
@@ -1,7 +1,7 @@
-/* Copyright (c) 1991 Regents of the University of California */
+/* Copyright (c) 1998 Silicon Graphics, Inc. */
 
 #ifndef lint
-static char SCCSid[] = "$SunId$ LBL";
+static char SCCSid[] = "$SunId$ SGI";
 #endif
 
 /*
@@ -12,24 +12,29 @@ static char SCCSid[] = "$SunId$ LBL";
 
 #define  NULL		0
 
+#define  MAXORDER	(8*sizeof(unsigned short))
+
 extern char  *malloc();
 
-short  *urperm;		/* urand() permutation */
+unsigned short  *urperm = NULL;	/* urand() permutation */
 int  urmask;		/* bits used in permutation */
 
 
+int
 initurand(size)		/* initialize urand() for size entries */
 int  size;
 {
 	int  order, n;
 	register int  i, offset;
 
+	if (urperm != NULL)
+		free((char *)urperm);
 	size--;
 	for (i = 1; size >>= 1; i++)
 		;
-	order = i;
+	order = i>MAXORDER ? MAXORDER : i;
 	urmask = (1<<i) - 1;
-	urperm = (short *)malloc((urmask+1)*sizeof(short));
+	urperm = (unsigned short *)malloc((urmask+1)*sizeof(unsigned short));
 	if (urperm == NULL) {
 		eputs("out of memory in initurand\n");
 		quit(1);
@@ -44,6 +49,7 @@ int  size;
 			else
 				urperm[i+offset]++;
 		}
+	return(1<<order);
 }
 
 
@@ -59,56 +65,4 @@ register int  n;
 	while (n-- > 0)
 		hval += *d++ * tab[n&7];
 	return(hval);
-}
-
-
-static char  bctab[256] = {
-		0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
-		1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
-		1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
-		2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
-		1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
-		2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
-		2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
-		3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
-		1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
-		2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
-		2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
-		3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
-		2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
-		3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
-		3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
-		4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8,
-	};
-
-
-#define NBITS		32
-
-#if NBITS==32
-#define  bitcount(i)	(bctab[(i)>>24&0xff]+bctab[(i)>>16&0xff]+ \
-				bctab[(i)>>8&0xff]+bctab[(i)&0xff])
-#endif
-#if  NBITS==16
-#define  bitcount(i)	(bctab[(i)>>8&0xff]+bctab[(i)&0xff])
-#endif
-
-
-int
-urind(s, i)			/* compute i'th index from seed s */
-int	s, i;
-{
-	register int  ss, k;
-	int  left;
-
-	ss = s*1103515245 + 12345;
-	left = 0;
-	for (k = i/NBITS; k--; ) {
-		left += bitcount(ss);
-		ss = ss*1103515245 + 12345;
-	}
-	for (k = i&(NBITS-1); k--; ss >>= 1)
-		left += ss & 1;
-	if (ss & 1)
-		return(s-left-1);
-	return(s-left+i);
 }