X-Git-Url: https://git.cameronkatri.com/bsdgames-darwin.git/blobdiff_plain/225aeae6d8220143cb24ffcbe7c1ca2941643670..eff6047a366924e7f864e4f19335619f3236fce9:/monop/roll.c

diff --git a/monop/roll.c b/monop/roll.c
index 002cf788..ccae9d5a 100644
--- a/monop/roll.c
+++ b/monop/roll.c
@@ -1,6 +1,8 @@
+/*	$NetBSD: roll.c,v 1.13 2008/02/24 06:07:06 dholland Exp $	*/
+
 /*
- * Copyright (c) 1980 Regents of the University of California.
- * All rights reserved.
+ * Copyright (c) 1980, 1993
+ *	The Regents of the University of California.  All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
@@ -10,11 +12,7 @@
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
  *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *	This product includes software developed by the University of
- *	California, Berkeley and its contributors.
- * 4. Neither the name of the University nor the names of its contributors
+ * 3. Neither the name of the University nor the names of its contributors
  *    may be used to endorse or promote products derived from this software
  *    without specific prior written permission.
  *
@@ -31,27 +29,31 @@
  * SUCH DAMAGE.
  */
 
+#include <sys/cdefs.h>
 #ifndef lint
-static char sccsid[] = "@(#)roll.c	5.5 (Berkeley) 6/1/90";
+#if 0
+static char sccsid[] = "@(#)roll.c	8.1 (Berkeley) 5/31/93";
+#else
+__RCSID("$NetBSD: roll.c,v 1.13 2008/02/24 06:07:06 dholland Exp $");
+#endif
 #endif /* not lint */
 
+#include <stdlib.h>
+
+#include "monop.h"
+
 /*
  *	This routine rolls ndie nside-sided dice.
  */
 
-#include <stdlib.h>
-
-#define	reg	register
-
+int
 roll(ndie, nsides)
-reg int	ndie, nsides; {
-
-	reg int		tot, r;
-	reg double	num_sides;
+	int ndie, nsides;
+{
+	long tot;
 
-	num_sides = nsides;
 	tot = 0;
 	while (ndie--)
-		tot += (r = rand()) * (num_sides / RAND_MAX) + 1;
-	return tot;
+		tot += (random() % nsides) + 1;
+	return (int)tot;
 }