SPACE
case SPACE:
newpp->p_maze[y][x] = SPACE;
} while (Maze[y][x] != SPACE);
newpp->p_over = SPACE;
} while (Maze[y][x] != SPACE);
} while (Maze[y][x] != SPACE);
if (*sp != SPACE) {
} while (Maze[y][x] != SPACE);
bp->b_over = SPACE;
NULL, true, SPACE);
np->p_over = SPACE;
} while (Maze[y][x] != SPACE);
NULL, true, SPACE);
} while (Maze[y][x] != SPACE);
NULL, false, SPACE);
case SPACE:
Maze[y][x] = SPACE;
Maze[y][x] = SPACE;
Maze[y][x] = SPACE;
c = SPACE;
case SPACE:
if (Maze[r->r_y][r->r_x] == SPACE)
if (save_char == SPACE)
Maze[y][x] = SPACE;
Maze[y][x] = SPACE; /* Clear this spot */
Maze[y][x] = SPACE;
if (Maze[ty][tx] == SPACE)
Maze[(y + ty) / 2][(x + tx) / 2] = SPACE;
if (*sp == SPACE)
if (y - 1 >= 0 && Maze[y - 1][x] != SPACE)
if (y + 1 < HEIGHT && Maze[y + 1][x] != SPACE)
if (x + 1 < WIDTH && Maze[y][x + 1] != SPACE)
if (x - 1 >= 0 && Maze[y][x - 1] != SPACE)
#define ISCLEAR(y,x) (Maze[y][x] == SPACE)
case SPACE:
Maze[y][x] = SPACE;
NULL, true, SPACE);
Maze[y][x] = SPACE;
i, bp->b_size, bp->b_owner, bp->b_score, true, SPACE);
bp->b_score, true, SPACE);
bp->b_score, true, SPACE);
bp->b_score, true, SPACE);
cmd.opcode = SPACE;
else if (current != PERIOD && current != SPACE) {
lflag |= SPACE;
else if (lflag & SPACE)
days[dw++] = SPACE - day++;
if (day == SPACE) {
if (day < SPACE) {
day = SPACE - day;
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
case SPACE:
void cspace(SPACE *, const char *, size_t, enum e_spflag);
int mf_fgets(SPACE *, enum e_spflag);
mf_fgets(SPACE *sp, enum e_spflag spflag)
SPACE tspace;
SPACE tspace;
SPACE tmp;
static SPACE HS, PS, SS, YS;
regsub(SPACE *sp, char *string, char *src)
cspace(SPACE *sp, const char *p, size_t len, enum e_spflag spflag)
static void regsub(SPACE *, char *, char *);
pad = SPACE;