From: Keith Bostic <bostic@ucbvax.Berkeley.EDU>
Date: Thu, 31 Mar 1994 04:20:43 +0000 (-0800)
Subject: lint, ubig is an unsigned long
X-Git-Tag: BSD-4_4_Lite1-Snapshot-Development~67
X-Git-Url: https://git.subgeniuskitty.com/unix-history/.git/commitdiff_plain/2eca79198373edf65337c9bb91096d6f8fa965f9

lint, ubig is an unsigned long

SCCS-vsn: games/factor/factor.c 8.3
---

diff --git a/usr/src/games/factor/factor.c b/usr/src/games/factor/factor.c
index f2e9c4b043..9243b76d05 100644
--- a/usr/src/games/factor/factor.c
+++ b/usr/src/games/factor/factor.c
@@ -15,7 +15,7 @@ static char copyright[] =
 #endif /* not lint */
 
 #ifndef lint
-static char sccsid[] = "@(#)factor.c	8.2 (Berkeley) %G%";
+static char sccsid[] = "@(#)factor.c	8.3 (Berkeley) %G%";
 #endif /* not lint */
 
 /*
@@ -141,7 +141,7 @@ pr_fact(val)
 	}
 
 	/* Factor value. */
-	(void)printf("%ld:", val);
+	(void)printf("%lu:", val);
 	for (fact = &prime[0]; val > 1; ++fact) {
 		/* Look for the smallest factor. */
 		do {
@@ -151,13 +151,13 @@ pr_fact(val)
 
 		/* Watch for primes larger than the table. */
 		if (fact > pr_limit) {
-			(void)printf(" %ld", val);
+			(void)printf(" %lu", val);
 			break;
 		}
 
 		/* Divide factor out until none are left. */
 		do {
-			(void)printf(" %ld", *fact);
+			(void)printf(" %lu", *fact);
 			val /= (long)*fact;
 		} while ((val % (long)*fact) == 0);