Home
last modified time | relevance | path

Searched refs:CORR (Results 1 – 8 of 8) sorted by relevance

/openbsd/games/hack/
H A Dhack.search.c77 for(lx = u.ux; (num = levl[lx-1][(int)u.uy].typ) && num != CORR; lx--) ; in findit()
78 for(hx = u.ux; (num = levl[hx+1][(int)u.uy].typ) && num != CORR; hx++) ; in findit()
79 for(ly = u.uy; (num = levl[(int)u.ux][ly-1].typ) && num != CORR; ly--) ; in findit()
80 for(hy = u.uy; (num = levl[(int)u.ux][hy+1].typ) && num != CORR; hy++) ; in findit()
89 levl[(int)zx][(int)zy].typ = CORR; in findit()
131 levl[(int)x][(int)y].typ = CORR; in dosearch()
H A Dhack.read.c402 lev->typ = CORR; in doread()
518 levl[(int)u.ux][(int)u.uy].typ == CORR || in litroom()
537 if (levl[(int)u.ux][(int)u.uy].typ == CORR) { in litroom()
569 for(seelx = u.ux; (num = levl[seelx-1][zy].typ) != CORR && num != 0; in litroom()
571 for(seehx = u.ux; (num = levl[seehx+1][zy].typ) != CORR && num != 0; in litroom()
573 for(seely = u.uy; (num = levl[zx][seely-1].typ) != CORR && num != 0; in litroom()
575 for(seehy = u.uy; (num = levl[zx][seehy+1].typ) != CORR && num != 0; in litroom()
H A Dhack.mklev.c603 crm->typ = CORR; in join()
612 if(crm->typ != CORR && crm->typ != SCORR) { in join()
626 if(!crm->typ || crm->typ == CORR || crm->typ == SCORR) { in join()
635 if(!crm->typ || crm->typ == CORR || crm->typ == SCORR) { in join()
644 if(!crm->typ || crm->typ == CORR || crm->typ == SCORR) in join()
652 if(!crm->typ || crm->typ == CORR || crm->typ == SCORR) in join()
660 if(!crm->typ || crm->typ == CORR || crm->typ == SCORR) in join()
724 rm->typ = CORR; in makeniche()
H A Dhack.vault.c184 if(levl[x][y].typ == CORR) goto fnd; in invault()
284 crm->typ = (typ == SCORR) ? CORR : DOOR; in gd_move()
317 crm->typ = CORR; in gd_move()
H A Ddef.rm.h74 #define CORR 8 macro
H A Dhack.pri.c387 (IS_ROCK(room->typ) && levl[(int)u.ux][(int)u.uy].typ == CORR)) in prl()
446 case CORR: in news0()
H A Dhack.apply.c365 lev->typ = CORR; in dig()
H A Dhack.zap.c303 room->typ = CORR; in dozap()