Home
last modified time | relevance | path

Searched refs:rn1 (Results 1 – 14 of 14) sorted by relevance

/dragonfly/games/hack/
H A Dhack.mkmaze.c128 for (x = rn1(8, 11); x; x--) { in makemaz()
132 for (x = rn1(10, 2); x; x--) { in makemaz()
138 for (x = rn1(5, 7); x; x--) { in makemaz()
142 for (x = rn1(6, 7); x; x--) { in makemaz()
146 for (x = rn1(6, 7); x; x--) in makemaz()
H A Dhack.potion.c115 Invis += rn1(15, 31); in dodrink()
137 nomul(-(rn1(10, 25))); in dodrink()
178 losestr(rn1(4, 3)); in dodrink()
186 Confusion += rn1(7, 16); in dodrink()
210 Fast += rn1(10, 100); in dodrink()
217 Blind += rn1(100, 250); in dodrink()
H A Dhack.mkobj.c123 otmp->quan = (otmp->otyp <= ROCK) ? rn1(6, 6) : 1; in mksobj()
165 otmp->spe = rn1(5, in mksobj()
H A Drnd.c71 rn1(int x, int y) in rn1() function
H A Dhack.makemon.c103 tmp = rn1(ct - ct / 2, ct / 2); in makemon()
244 tx = rn1(COLNO - 3, 2); in rloc()
H A Dhack.zap.c223 (void) bhit(u.dx, u.dy, rn1(8, 6), 0, bhitm, bhito, obj); in dozap()
512 range = rn1(7, 7); in buzz()
709 tx = rn1(COLNO - 3, 2); in rloco()
H A Dhack.mhitu.c143 (void) hitu(mtmp, rn1(4, 2)); in mhitu()
H A Dextern.h536 int rn1(int, int);
H A Dhack.trap.c194 u.utrap = rn1(6, 2); in dotrap()
H A Dhack.mon.c686 losestr(rn1(3, 3)); in poisoned()
688 losehp(rn1(10, 6), pname); in poisoned()
H A Dhack.apply.c357 u.utrap = rn1(4, 2); in dig()
H A Dhack.fight.c453 nomul((u.ulevel > 6 || rn2(4)) ? rn1(20, -21) : -200); in attack()
H A Dhack.mklev.c127 if (dlevel >= rn1(3, 26)) { /* there might be several mazes */ in makelevel()
/dragonfly/sys/net/
H A Drtsock.c1691 struct radix_node *rn1 = rn; in rttable_walk_entry() local
1699 while ((rn1 = rn1->rn_dupedkey) != NULL) { in rttable_walk_entry()
1703 if (rn1->rn_flags & RNF_ROOT) in rttable_walk_entry()
1706 rttable_entry_rtinfo(&rtinfo1, rn1); in rttable_walk_entry()