HomeSort by: relevance | last modified time | path
    Searched refs:playerx (Results 1 - 13 of 13) sorted by relevancy

  /src/games/larn/
action.c 41 item[playerx][playery] = ODEADTHRONE;
42 know[playerx][playery] = 0;
45 item[playerx][playery] = OTHRONE2;
46 know[playerx][playery] = 0;
68 item[playerx][playery] = OTHRONE2;
69 know[playerx][playery] = 0;
111 item[playerx][playery] = ODEADFOUNTAIN; /* dead fountain */
112 know[playerx][playery] = 0;
moreobj.c 136 act_open_chest(playerx, playery);
141 if (take(OCHEST, iarg[playerx][playery]) == 0)
142 item[playerx][playery] = know[playerx][playery] = 0;
object.c 39 i = item[playerx][playery];
42 showcell(playerx, playery);
56 i = iarg[playerx][playery];
64 i = iarg[playerx][playery];
148 item[playerx][playery] = OTELEPORTER;
149 know[playerx][playery] = 1;
244 item[playerx][playery] = OCLOSEDDOOR;
245 iarg[playerx][playery] = 0;
246 playerx = lastpx;
259 playerx = lastpx
    [all...]
movem.c 51 tmp3 = playerx - 10;
52 tmp4 = playerx + 11;
57 tmp3 = playerx - 5;
58 tmp4 = playerx + 6;
194 screen[playerx][playery] = 1;
197 * now perform proximity ripple from playerx,playery to
220 /* now select lowest value around playerx,playery */
233 if (i < playerx)
235 else if (i > playerx)
249 if (tmpitem != OWALL || (k == playerx && m == playery)
    [all...]
global.c 233 while ((item[playerx][playery] || mitem[playerx][playery]) && (try))
234 if (++playerx >= MAXX - 1) {
235 playerx = 1;
501 if (item[playerx][playery]) {
506 if (playery == MAXY - 1 && playerx == 33)
508 item[playerx][playery] = theitem;
509 iarg[playerx][playery] = ivenarg[k];
513 know[playerx][playery] = 0;
607 for (tmp = playerx - 1; tmp < playerx + 2; tmp++
    [all...]
create.c 52 playerx = rnd(MAXX - 2);
368 tp1 = playerx;
372 for (playerx = tx + 1; playerx <= tx + xsize - 2; playerx += 2)
378 for (playerx = tx + 1; playerx <= tx + xsize - 2; playerx += 2)
384 playerx = tp1;
558 if ((item[x][y] == 0) && (mitem[x][y] == 0) && ((playerx != x) || (playery != y)))
    [all...]
display.c 477 cursor(playerx + 1, playery + 1);
478 oldx = playerx;
505 kk = playerx + diroffx[dir];
522 playerx = kk;
533 lastpx = playerx;
535 playerx = kk;
monster.c 87 * annihilate() Routine to annihilate monsters around player, playerx,playery
160 x = playerx + diroffx[k];
223 x = playerx + diroffx[k];
362 xl = playerx - 15;
363 xh = playerx + 16;
426 xh = min(playerx + 1, MAXX - 2);
428 for (i = max(playerx - 1, 1); i <= xh; i++) /* vaporize rock */
542 xl = playerx;
805 dx = x - playerx;
807 x = playerx;
    [all...]
main.c 301 showcell(playerx, playery);
817 for (i = playerx - 1; i < playerx + 2; i++) {
1005 showcell(playerx, playery);
1124 p = &item[playerx][playery];
1167 iarg[playerx][playery] = i;
1169 know[playerx][playery] = 0;
header.h 363 extern short nobeep, oldx, oldy, playerx, playery, level;
391 #define forget() (item[playerx][playery]=know[playerx][playery]=0)
data.c 159 short playerx, playery; /* the room on the present level of variable in typeref:typename:short
regen.c 175 if (item[playerx][playery] == 0) /* only if nothing there */
diag.c 205 lprc(playerx);
268 playerx = lgetc();

Completed in 18 milliseconds