Searched refs:rn1 (Results 1 - 12 of 12) sorted by relevance

/netbsd-current/games/hack/
H A Drnd.c76 rn1(int x, int y) function
H A Dhack.mkmaze.c133 for (x = rn1(8, 11); x; x--) {
137 for (x = rn1(10, 2); x; x--) {
143 for (x = rn1(5, 7); x; x--) {
147 for (x = rn1(6, 7); x; x--) {
151 for (x = rn1(6, 7); x; x--)
H A Dhack.potion.c120 Invis += rn1(15, 31);
142 nomul(-(rn1(10, 25)));
183 losestr(rn1(4, 3));
191 Confusion += rn1(7, 16);
215 Fast += rn1(10, 100);
222 Blind += rn1(100, 250);
H A Dhack.mkobj.c128 otmp->quan = (otmp->otyp <= ROCK) ? rn1(6, 6) : 1;
170 otmp->spe = rn1(5,
H A Dhack.makemon.c108 tmp = rn1(ct - ct / 2, ct / 2);
249 tx = rn1(COLNO - 3, 2);
H A Dhack.zap.c228 (void) bhit(u.dx, u.dy, rn1(8, 6), 0, bhitm, bhito, obj);
517 range = rn1(7, 7);
714 tx = rn1(COLNO - 3, 2);
H A Dhack.trap.c199 u.utrap = rn1(6, 2);
H A Dextern.h536 int rn1(int, int);
H A Dhack.apply.c362 u.utrap = rn1(4, 2);
H A Dhack.fight.c458 nomul((u.ulevel > 6 || rn2(4)) ? rn1(20, -21) : -200);
H A Dhack.mon.c691 losestr(rn1(3, 3));
693 losehp(rn1(10, 6), pname);
H A Dhack.mklev.c132 if (dlevel >= rn1(3, 26)) { /* there might be several mazes */

Completed in 270 milliseconds