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

  /src/games/adventure/
init.c 89 struct travlist *travel[LOCSIZE], *tkk; /* travel is closer to keys(...) */ variable in typeref:struct:travlist * []
161 if (ltext[i].seekadr != 0 && travel[i] != 0)
162 if ((travel[i]->tverb) == 1)
hdr.h 43 * A few places, such as the message arrays and travel arrays were changed
107 extern struct travlist { /* direcs & conditions of travel */
112 } *travel[LOCSIZE], *tkk; /* travel is closer to keys(...) */ variable in typeref:struct:travlist * []
io.c 231 case 3: /* travel table */
354 /* read travel table */
374 t = travel[locc] = calloc(1, sizeof(*t));
377 /* printf("New travel list for %d\n",locc); */
413 /* travel options from this loc */
421 for (t = travel[loq]; t != 0; t = t->next) {
subr.c 197 for (kk = travel[dloc[i]]; kk != 0; kk = kk->next) {
304 if ((tkk = travel[newloc = loc]) == 0)
402 tkk = travel[loc];
406 j = travel[loc];
414 tkk = travel[loc];
  /src/usr.bin/m4/TEST/
test.m4 140 and never intentionally destroys data. With no further ado, let us travel
148 and to travel any of the many routes in the kingdom. They are magically
163 injure or kill travelers. Fortunately, they do not travel, but always
235 travel, or (2) convince CTK to develop a faster breed of horses so that the

Completed in 15 milliseconds