nethack-3.4.3/src/dungeon.c

85 	    fprintf(stderr, "on %d, %d; ", x->dlevel.dnum, x->dlevel.dlevel);
102 		br->end1.dnum, br->end1.dlevel,
103 		br->end2.dnum, br->end2.dlevel,
302 	    base += levtmp->dlevel.dlevel;
342 			if ((curr->end1.dnum == dnum && curr->end1.dlevel == base+i) ||
343 				(curr->end2.dnum == dnum && curr->end2.dlevel == base+i))
393 	  (long)(bp)->end1.dlevel) * (MAXDUNGEON+1) * (MAXLEVEL+1)) + \
394 	 ((long)(bp)->end2.dnum * (MAXLEVEL+1) + (long)(bp)->end2.dlevel))
433     new_branch->end1.dlevel = parent_dlevel(dungeons[dgn].dname, pd);
435     new_branch->end2.dlevel = child_entry_level;
456 	    if (curr->dlevel.dnum == new_lev->dlevel.dnum &&
457 		    curr->dlevel.dlevel > new_lev->dlevel.dlevel)
489 	new_level->dlevel.dnum = dgn;
490 	new_level->dlevel.dlevel = 0;	/* for now */
518     count = level_range(lev->dlevel.dnum, pd->tmplevel[idx].lev.base,
527 	if (pd->final_lev[i] && map[pd->final_lev[i]->dlevel.dlevel]) {
528 	    map[pd->final_lev[i]->dlevel.dlevel] = FALSE;
589 	lev->dlevel.dlevel = pick_level(map, rn2(npossible));
592 	fprintf(stderr,"%s: trying %d [ ", lev->proto, lev->dlevel.dlevel);
598 	map[lev->dlevel.dlevel] = FALSE;	/* this choice didn't work */
853 			assign_level(lev_map->lev_spec, &x->dlevel);
886 	    i = x->dlevel.dnum;
891 	    if (dunlevs_in_dungeon(&x->dlevel) > 1 - dungeons[i].depth_start)
906 	return(lev->dlevel);
940 	    if((tmp.dlevel = dungeons[i].dunlev_ureached) == 0) continue;
955 	return((xchar)(lev->dlevel + dungeons[lev->dnum].ledger_start));
1010 	return((schar)( dungeons[lev->dnum].depth_start + lev->dlevel - 1));
1017 	return((boolean)((lev1->dnum == lev2->dnum) && (lev1->dlevel == lev2->dlevel)));
1031 	    if (on_level(lev, &levtmp->dlevel)) return(levtmp);
1066 		newlevel.dlevel = u.uz.dlevel + 1;
1080 		if(!u.uz.dnum && u.uz.dlevel == 1 && !u.uhave.amulet) done(ESCAPED);
1086 		newlevel.dlevel = u.uz.dlevel - 1;
1165 	return((boolean)(lev->dlevel == dungeons[lev->dnum].num_dunlevs));
1204     return (boolean)(lev->dlevel > 1 ||
1230 	    levnum = u.uz.dlevel;
1265 	newlevel->dlevel = levnum;
1385 	lev->dlevel = 1;
1403 	dest->dlevel = src->dlevel;
1412 	dest->dlevel = src->dlevel + ((range > 0) ? rnd(range) : -rnd(-range)) ;
1414 	if(dest->dlevel > dunlevs_in_dungeon(dest))
1415 		dest->dlevel = dunlevs_in_dungeon(dest);
1416 	else if(dest->dlevel < 1)
1417 		dest->dlevel = 1;
1448 		lev->dlevel == (dungeons[lev->dnum].num_dunlevs - 1)));
1494 	dlev = slev->dlevel;
1507 	    lev = depth(&slev->dlevel);
1526 		dlev.dlevel = ledger_to_dlev(idx);
1566 	if (br->end1.dnum == dnum && lower_bound < br->end1.dlevel &&
1567 					br->end1.dlevel <= upper_bound) {
1573 		lchoices->lev[lchoices->idx] = br->end1.dlevel;
1639 	    if (slev->dlevel.dnum != i) continue;
1642 	    print_branch(win, i, last_level, slev->dlevel.dlevel, bymenu, &lchoices);
1644 	    Sprintf(buf, "   %s: %d", slev->proto, depth(&slev->dlevel));
1645 	    if (Is_stronghold(&slev->dlevel))
1650 			lchoices.lev[lchoices.idx] = slev->dlevel.dlevel;
1653 			lchoices.lev[lchoices.idx] = depth(&slev->dlevel);
1656 		lchoices.playerlev[lchoices.idx] = depth(&slev->dlevel);
1667 	    last_level = slev->dlevel.dlevel;