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

  /src/games/larn/
savelev.c 21 pcel = &cell[level * MAXX * MAXY]; /* pointer to this level's
23 pecel = pcel + MAXX * MAXY; /* pointer to past end of this
50 pcel = &cell[level * MAXX * MAXY]; /* pointer to this level's
52 pecel = pcel + MAXX * MAXY; /* pointer to past end of this
data.c 120 short hitp[MAXX][MAXY]; /* monster hp on level */
121 short iarg[MAXX][MAXY]; /* arg for the item array */
122 u_char item[MAXX][MAXY]; /* objects in maze if any */
123 u_char know[MAXX][MAXY]; /* 1 or 0 if here before */
124 u_char mitem[MAXX][MAXY]; /* monster item array */
125 u_char moved[MAXX][MAXY]; /* monster movement flags */
126 u_char stealth[MAXX][MAXY]; /* 0=sleeping 1=awake monst */
161 short lastpx, lastpy; /* 0 --- MAXX-1 or 0 --- MAXY-1 */
header.h 12 #define MAXY 17
341 extern u_char item[MAXX][MAXY], iven[], know[MAXX][MAXY];
345 extern u_char *lpnt, moved[MAXX][MAXY], mitem[MAXX][MAXY], monstlevel[];
355 extern u_char screen[MAXX][MAXY], sex;
359 extern u_char splev[], stealth[MAXX][MAXY], wizard;
360 extern short diroffx[], diroffy[], hitflag, hit2flag, hit3flag, hitp[MAXX][MAXY];
361 extern short iarg[MAXX][MAXY], ivenarg[], lasthx, lasthy, lastnum, lastpx,
main.c 129 cell = (struct cel *) malloc(sizeof(struct cel) * (MAXLEVEL + MAXVLEVEL) * MAXX * MAXY);
388 draws(0, MAXX, 0, (count > MAXY) ? MAXY : count);
815 if (j >= MAXY)
867 for (i = 0; i < MAXY; i++)
887 for (i = 1; i < MAXY; i++) {
891 for (i = MAXY; i < MAXY + MAXX; i++) {
892 item[i - MAXY][MAXY - 1] = i
    [all...]
object.c 311 playery = MAXY - 2;
312 item[33][MAXY - 1] = know[33][MAXY - 1] = mitem[33][MAXY - 1] = 0;
313 draws(0, MAXX, 0, MAXY);
346 for (i = 0; i < MAXY; i++)
353 i = MAXY;
356 draws(0, MAXX, 0, MAXY);
388 for (i = 0; i < MAXY; i++)
395 i = MAXY;
    [all...]
diag.c 145 for (j = 0; j < MAXY; j++)
147 if (cell[p * MAXX * MAXY + i * MAXY + j].item == l)
160 for (i = 0; i < MAXY; i++)
199 lwrite((char *) &cell[k * MAXX * MAXY], sizeof(struct cel) * MAXY * MAXX);
263 lrfill((char *) &cell[k * MAXX * MAXY], sizeof(struct cel) * MAXY * MAXX);
create.c 53 playery = rnd(MAXY - 2);
90 for (i = 0; i < MAXY; i++)
104 for (j = 0; j < MAXY; j++)
130 for (i = 0; i < MAXY; i++)
137 item[33][MAXY - 1] = 0; /* exit from dungeon */
166 my = rnd(MAXY - 2);
213 if (yy >= MAXY - 3)
258 for (i = 0; i < MAXY; i++) {
325 ty = rnd(MAXY - 9) + 1; /* upper left corner of room */
525 y = rnd(MAXY - 2)
    [all...]
display.c 20 static int minx, maxx, miny, maxy, k, m; variable
244 static int d_xmin = 0, d_xmax = MAXX, d_ymin = 0, d_ymax = MAXY;
282 u_char screen[MAXX][MAXY]; /* template for the screen */
290 if (d_xmin == 0 && d_xmax == MAXX && d_ymin == 0 && d_ymax == MAXY) {
367 d_xmin = 0, d_xmax = MAXX, d_ymin = 0, d_ymax = MAXY; /* for limited screen
387 maxy = y + 3;
392 maxy = y + 1;
401 if (maxy > MAXY - 1)
402 maxy = MAXY - 1
    [all...]
monster.c 192 if ((y >= 0) && (y <= MAXY - 1) && (x >= 0) && (x <= MAXX - 1))
200 (y != MAXY - 1))
427 yh = min(playery + 1, MAXY - 2);
581 save = (struct isave *) malloc(sizeof(struct isave) * MAXX * MAXY * 2);
582 for (j = 0; j < MAXY; j++)
605 item[33][MAXY - 1] = 0;
606 for (j = rnd(MAXY - 2), i = 1; i < MAXX - 1; i++)
612 for (trys = 100, i = j = 1; --trys > 0 && item[i][j]; i = rnd(MAXX - 1), j = rnd(MAXY - 1));
619 for (trys = 100, i = j = 1; --trys > 0 && (item[i][j] == OWALL || mitem[i][j]); i = rnd(MAXX - 1), j = rnd(MAXY - 1));
627 draws(0, MAXX, 0, MAXY);
    [all...]
movem.c 66 if (tmp2 > MAXY)
67 tmp2 = MAXY;
76 if (tmp2 > MAXY - 1)
77 tmp2 = MAXY - 1;
156 if (yl >= MAXY)
157 yl = MAXY - 1;
global.c 236 if (++playery >= MAXY - 1) {
506 if (playery == MAXY - 1 && playerx == 33)

Completed in 24 milliseconds