HomeSort by: relevance | last modified time | path
    Searched defs:examine (Results 1 - 4 of 4) sorted by relevancy

  /src/games/phantasia/
main.c 91 bool examine = FALSE; /* set if examine a character */ local in function:main
124 case 'x': /* examine */
125 examine = TRUE;
147 if (examine) {
513 case 'X': /* change/examine a character */
  /src/common/dist/zlib/examples/
enough.c 10 Prune examine() search on previously visited states
25 Examine all possible prefix codes for a given number of symbols and a
357 // Examine all possible codes from the given node (syms, len, left). Compute
361 local void examine(int syms, int left, int len, int mem, int rem) { function in typeref:typename:local void
433 // examine codes from here, updating table space as we go
436 examine(syms - use, (left - use) << 1, len + 1,
469 examine(n, left, g.root + 1, 1 << g.root, 0);
474 examine((n - left) << 1, (n - left) << 1, g.root + 1,
483 // Examine and show the total number of possible prefix codes for a given
493 // To count and examine prefix codes that are not length-limited, provide
    [all...]
  /src/sys/arch/hpcmips/stand/pbsdboot/
disptest.c 384 examine(char* addr, int size) function in typeref:typename:int
423 res = examine(p, step);
427 res = examine((char*)((int)addr | 0xa0000000), step);
  /src/usr.bin/make/
make.c 673 /* It is save to re-examine any nodes again */
1210 ExamineLater(GNodeList *examine, GNodeList *toBeExamined)
1222 DEBUG2(MAKE, "ExamineLater: need to examine \"%s%s\"\n",
1224 Lst_Enqueue(examine, gn);
1232 GNodeList examine = LST_INIT; /* Queue of targets to examine */ local in function:Make_ExpandUse
1233 Lst_AppendAll(&examine, targets);
1245 while (!Lst_IsEmpty(&examine)) {
1246 GNode *gn = Lst_Dequeue(&examine);
1252 DEBUG2(MAKE, "Make_ExpandUse: examine %s%s\n"
1324 GNodeList examine; local in function:Make_ProcessWait
    [all...]

Completed in 15 milliseconds