Home
last modified time | relevance | path

Searched refs:brindx (Results 1 – 3 of 3) sorted by relevance

/dports/games/nethack36/NetHack-NetHack-3.6.6_Released/src/
H A Ddungeon.c2199 int brindx; local
2201 for (brindx = 0, curr = branches; curr; curr = curr->next, ++brindx)
2204 bwrite(fd, (genericptr_t) &brindx, sizeof brindx);
2220 int branchnum, brindx; local
2227 for (brindx = 0, curr = branches; curr; curr = curr->next, ++brindx)
2228 if (brindx == branchnum)
/dports/games/nethack36-nox11/NetHack-NetHack-3.6.6_Released/src/
H A Ddungeon.c2199 int brindx; local
2201 for (brindx = 0, curr = branches; curr; curr = curr->next, ++brindx)
2204 bwrite(fd, (genericptr_t) &brindx, sizeof brindx);
2220 int branchnum, brindx; local
2227 for (brindx = 0, curr = branches; curr; curr = curr->next, ++brindx)
2228 if (brindx == branchnum)
/dports/games/xnethack/xNetHack-xnh6.1/src/
H A Ddungeon.c2466 int brindx; in save_mapseen() local
2468 for (brindx = 0, curr = g.branches; curr; curr = curr->next, ++brindx) in save_mapseen()
2472 bwrite(nhfp->fd, (genericptr_t) &brindx, sizeof brindx); in save_mapseen()
2495 int branchnum = 0, brindx; in load_mapseen() local
2503 for (brindx = 0, curr = g.branches; curr; curr = curr->next, ++brindx) in load_mapseen()
2504 if (brindx == branchnum) in load_mapseen()