rn1
int rn1(int, int);
u.utrap = rn1(4, 2);
nomul((u.ulevel > 6 || rn2(4)) ? rn1(20, -21) : -200);
tmp = rn1(ct - ct / 2, ct / 2);
tx = rn1(COLNO - 3, 2);
(void) hitu(mtmp, rn1(4, 2));
if (dlevel >= rn1(3, 26)) { /* there might be several mazes */
for (x = rn1(8, 11); x; x--) {
for (x = rn1(10, 2); x; x--) {
for (x = rn1(5, 7); x; x--) {
for (x = rn1(6, 7); x; x--) {
for (x = rn1(6, 7); x; x--)
otmp->quan = (otmp->otyp <= ROCK) ? rn1(6, 6) : 1;
otmp->spe = rn1(5,
losestr(rn1(3, 3));
losehp(rn1(10, 6), pname);
Invis += rn1(15, 31);
nomul(-(rn1(10, 25)));
losestr(rn1(4, 3));
Confusion += rn1(7, 16);
Fast += rn1(10, 100);
Blind += rn1(100, 250);
u.utrap = rn1(6, 2);
(void) bhit(u.dx, u.dy, rn1(8, 6), 0, bhitm, bhito, obj);
range = rn1(7, 7);
tx = rn1(COLNO - 3, 2);
struct radix_node *rn1 = rn;
while ((rn1 = rn1->rn_dupedkey) != NULL) {
if (rn1->rn_flags & RNF_ROOT)
rttable_entry_rtinfo(&rtinfo1, rn1);