/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/ |
H A D | mkroom.h | 37 extern NEARDATA struct mkroom rooms[(MAXNROFROOMS+1)*2]; 39 /* the normal rooms on the current level are described in rooms[0..n] for 41 * the vault, if any, is described by rooms[n+1] 42 * the next rooms entry has hx -1 as a flag 89 * rooms[] index, for inside-squares and 93 #define IS_ROOM_PTR(x) ((x) >= rooms && (x) < rooms + MAXNROFROOMS) 98 #define ROOM_INDEX(x) ((x) - rooms)
|
H A D | sp_lev.h | 241 room **rooms; member in struct:__anon721
|
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/ |
H A D | mkroom.h | 37 extern NEARDATA struct mkroom rooms[(MAXNROFROOMS+1)*2]; 39 /* the normal rooms on the current level are described in rooms[0..n] for 41 * the vault, if any, is described by rooms[n+1] 42 * the next rooms entry has hx -1 as a flag 89 * rooms[] index, for inside-squares and 93 #define IS_ROOM_PTR(x) ((x) >= rooms && (x) < rooms + MAXNROFROOMS) 98 #define ROOM_INDEX(x) ((x) - rooms)
|
H A D | sp_lev.h | 241 room **rooms; member in struct:__anon43
|
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/ |
H A D | mkroom.c | 12 * save_rooms() -- save rooms into file fd 13 * rest_rooms() -- restore rooms from file fd 135 for(sroom = &rooms[0]; ; sroom++){ 137 if(sroom - rooms >= nroom) { 138 pline("rooms not closed by -1?"); 166 /* big rooms cannot be wand or book shops, 193 for(sroom = &rooms[rn2(nroom)]; i--; sroom++) { 194 if(sroom == &rooms[nroom]) 195 sroom = &rooms[0]; 233 int rmno = (sroom - rooms) [all...] |
H A D | vault.c | 124 if (rooms[*ptr - ROOMOFFSET].rtype == VAULT) 325 xchar lowx = rooms[vlt].lx, hix = rooms[vlt].hx; 326 xchar lowy = rooms[vlt].ly, hiy = rooms[vlt].hy; 361 nx = rooms[vroom].lx + rn2(2); 362 ny = rooms[vroom].ly + rn2(2); 375 xchar lox = rooms[vlt].lx - 1, hix = rooms[vlt].hx + 1, 376 loy = rooms[vl [all...] |
H A D | mklev.c | 111 qsort((genericptr_t) rooms, (unsigned)nroom, sizeof(struct mkroom), do_comp); 113 qsort((genericptr_t) rooms, nroom, sizeof(struct mkroom), do_comp); 130 /* locations might bump level edges in wall-less rooms */ 199 croom = &rooms[nroom]; 231 /* make rooms until satisfied */ 237 vault_x = rooms[nroom].lx; 238 vault_y = rooms[nroom].ly; 239 rooms[nroom].hx = -1; 258 croom = &rooms[a]; 259 troom = &rooms[ [all...] |
H A D | extralev.c | 18 int nroom; /* Only meaningful for "real" rooms */ 81 dodoor(fromx, fromy, &rooms[r[x][y].nroom]); 100 dodoor(tox, toy, &rooms[r[x][y].nroom]); 118 dodoor(fromx, fromy, &rooms[r[x][y].nroom]); 137 dodoor(tox, toy, &rooms[r[x][y].nroom]); 204 * second row of rooms not as deep. 224 /* Arbitrary: dummy rooms may only go where real 256 * level 10, but since Rogue rooms are only 297 croom = &rooms[rn2(nroom)];
|
H A D | mkmap.c | 288 rooms[nroom-1].irregular = TRUE; 310 * The rooms are already sorted due to the previous loop, 314 for(croom = &rooms[0], croom2 = croom + 1; croom2 < &rooms[nroom]; ) { 318 /* arbitrarily pick centers of both rooms and hope for the best */ 356 rooms[i].rlit = 1; 366 * When level processed by join_map is overlaid by a MAP, some rooms may no 367 * longer be valid. All rooms in the region lx <= x < hx, ly <= y < hy are 370 * those rooms will be removed as well. Assumes roomno fields in the 382 croom = &rooms[ [all...] |
H A D | decl.c | 136 NEARDATA struct mkroom rooms[(MAXNROFROOMS+1)*2] = {DUMMY}; variable in typeref:struct:mkroom 137 NEARDATA struct mkroom* subrooms = &rooms[MAXNROFROOMS+1];
|
H A D | shknam.c | 349 int rmno = (sroom - rooms) + ROOMOFFSET; 397 ESHK(shk)->shoproom = (sroom - rooms) + ROOMOFFSET; 437 int rmno = (sroom - rooms) + ROOMOFFSET;
|
H A D | priest.c | 123 if (rooms[*ptr - ROOMOFFSET].rtype == TEMPLE) 203 EPRI(priest)->shroom = (sroom - rooms) + ROOMOFFSET; 616 troom = &rooms[roomno - ROOMOFFSET];
|
H A D | read.c | 1397 for(rx = rooms[rnum].lx-1; rx <= rooms[rnum].hx+1; rx++) 1398 for(ry = rooms[rnum].ly-1; ry <= rooms[rnum].hy+1; ry++) 1401 rooms[rnum].rlit = on;
|
H A D | sp_lev.c | 386 /* some other rooms may require lighting */ 521 rooms[nroom].lx = xabs; 522 rooms[nroom].ly = yabs; 1102 croom = &rooms[sproom - ROOMOFFSET]; 1372 * Disgusting hack: since special levels have their rooms filled before 1373 * sorting the rooms, we have to re-arrange the speed values upstairs_room 1374 * and dnstairs_room after the rooms have been sorted. On normal levels, 1387 croom = &rooms[i]; 1401 croom = &rooms[i]; 1432 if( !search_door(&rooms[ [all...] |
H A D | restore.c | 787 doorindex = rooms[nroom - 1].fdoor + rooms[nroom - 1].doorct;
|
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/ |
H A D | mkroom.c | 12 * save_rooms() -- save rooms into file fd 13 * rest_rooms() -- restore rooms from file fd 135 for(sroom = &rooms[0]; ; sroom++){ 137 if(sroom - rooms >= nroom) { 138 pline("rooms not closed by -1?"); 166 /* big rooms cannot be wand or book shops, 193 for(sroom = &rooms[rn2(nroom)]; i--; sroom++) { 194 if(sroom == &rooms[nroom]) 195 sroom = &rooms[0]; 233 int rmno = (sroom - rooms) [all...] |
H A D | vault.c | 124 if (rooms[*ptr - ROOMOFFSET].rtype == VAULT) 325 xchar lowx = rooms[vlt].lx, hix = rooms[vlt].hx; 326 xchar lowy = rooms[vlt].ly, hiy = rooms[vlt].hy; 361 nx = rooms[vroom].lx + rn2(2); 362 ny = rooms[vroom].ly + rn2(2); 375 xchar lox = rooms[vlt].lx - 1, hix = rooms[vlt].hx + 1, 376 loy = rooms[vl [all...] |
H A D | mklev.c | 111 qsort((genericptr_t) rooms, (unsigned)nroom, sizeof(struct mkroom), do_comp); 113 qsort((genericptr_t) rooms, nroom, sizeof(struct mkroom), do_comp); 130 /* locations might bump level edges in wall-less rooms */ 199 croom = &rooms[nroom]; 231 /* make rooms until satisfied */ 237 vault_x = rooms[nroom].lx; 238 vault_y = rooms[nroom].ly; 239 rooms[nroom].hx = -1; 258 croom = &rooms[a]; 259 troom = &rooms[ [all...] |
H A D | extralev.c | 18 int nroom; /* Only meaningful for "real" rooms */ 81 dodoor(fromx, fromy, &rooms[r[x][y].nroom]); 100 dodoor(tox, toy, &rooms[r[x][y].nroom]); 118 dodoor(fromx, fromy, &rooms[r[x][y].nroom]); 137 dodoor(tox, toy, &rooms[r[x][y].nroom]); 204 * second row of rooms not as deep. 224 /* Arbitrary: dummy rooms may only go where real 256 * level 10, but since Rogue rooms are only 297 croom = &rooms[rn2(nroom)];
|
H A D | mkmap.c | 288 rooms[nroom-1].irregular = TRUE; 310 * The rooms are already sorted due to the previous loop, 314 for(croom = &rooms[0], croom2 = croom + 1; croom2 < &rooms[nroom]; ) { 318 /* arbitrarily pick centers of both rooms and hope for the best */ 356 rooms[i].rlit = 1; 366 * When level processed by join_map is overlaid by a MAP, some rooms may no 367 * longer be valid. All rooms in the region lx <= x < hx, ly <= y < hy are 370 * those rooms will be removed as well. Assumes roomno fields in the 382 croom = &rooms[ [all...] |
H A D | decl.c | 136 NEARDATA struct mkroom rooms[(MAXNROFROOMS+1)*2] = {DUMMY}; variable in typeref:struct:mkroom 137 NEARDATA struct mkroom* subrooms = &rooms[MAXNROFROOMS+1];
|
H A D | shknam.c | 349 int rmno = (sroom - rooms) + ROOMOFFSET; 397 ESHK(shk)->shoproom = (sroom - rooms) + ROOMOFFSET; 437 int rmno = (sroom - rooms) + ROOMOFFSET;
|
H A D | priest.c | 123 if (rooms[*ptr - ROOMOFFSET].rtype == TEMPLE) 203 EPRI(priest)->shroom = (sroom - rooms) + ROOMOFFSET; 616 troom = &rooms[roomno - ROOMOFFSET];
|
H A D | read.c | 1397 for(rx = rooms[rnum].lx-1; rx <= rooms[rnum].hx+1; rx++) 1398 for(ry = rooms[rnum].ly-1; ry <= rooms[rnum].hy+1; ry++) 1401 rooms[rnum].rlit = on;
|
H A D | sp_lev.c | 386 /* some other rooms may require lighting */ 521 rooms[nroom].lx = xabs; 522 rooms[nroom].ly = yabs; 1102 croom = &rooms[sproom - ROOMOFFSET]; 1372 * Disgusting hack: since special levels have their rooms filled before 1373 * sorting the rooms, we have to re-arrange the speed values upstairs_room 1374 * and dnstairs_room after the rooms have been sorted. On normal levels, 1387 croom = &rooms[i]; 1401 croom = &rooms[i]; 1432 if( !search_door(&rooms[ [all...] |