| /plan9/sys/src/cmd/awk/ |
| H A D | proto.h | 26 extern void setfname(Cell *);
67 extern Node *celltonode(Cell *, int);
72 extern void defn(Cell *, Node *, Node *);
75 extern Cell *(*proctab[])(Node **, int);
83 extern void freesymtab(Cell *);
84 extern void freeelem(Cell *, char *);
85 extern Cell *setsymtab(char *, char *, double, unsigned int, Array *);
88 extern Cell *lookup(char *, Array *);
89 extern double setfval(Cell *, double);
90 extern void funnyvar(Cell *, char *);
[all …]
|
| H A D | tran.c | 54 Cell *nrloc; /* NR */
55 Cell *nfloc; /* NF */
56 Cell *fnrloc; /* FNR */
59 Cell *rstartloc; /* RSTART */
60 Cell *rlengthloc; /* RLENGTH */
61 Cell *symtabloc; /* SYMTAB */
63 Cell *nullloc; /* a guaranteed empty cell */
65 Cell *literal0;
67 extern Cell **fldtab;
100 Cell *cp; in arginit()
[all …]
|
| H A D | run.c | 70 Cell *tmps; /* free temporary cells for execution */
72 static Cell truecell ={ OBOOL, BTRUE, 0, 0, 1.0, NUM };
73 Cell *True = &truecell;
74 static Cell falsecell ={ OBOOL, BFALSE, 0, 0, 0.0, NUM };
75 Cell *False = &falsecell;
76 static Cell breakcell ={ OJUMP, JBREAK, 0, 0, 0.0, NUM };
77 Cell *jbreak = &breakcell;
78 static Cell contcell ={ OJUMP, JCONT, 0, 0, 0.0, NUM };
79 Cell *jcont = &contcell;
80 static Cell nextcell ={ OJUMP, JNEXT, 0, 0, 0.0, NUM };
[all …]
|
| H A D | awk.h | 58 typedef struct Cell { struct
65 struct Cell *cnext; /* ptr to next if chained */ argument
66 } Cell; typedef
71 Cell **tab; /* hash table pointers */
77 extern Cell *nrloc; /* NR */
78 extern Cell *fnrloc; /* FNR */
79 extern Cell *nfloc; /* NF */
80 extern Cell *rstartloc; /* RSTART */
81 extern Cell *rlengthloc; /* RLENGTH */
|
| H A D | lib.c | 42 Cell **fldtab; /* pointers to Cells */
55 static Cell dollar0 = { OCELL, CFLD, NULL, "", 0.0, REC|STR|DONTFREE };
56 static Cell dollar1 = { OCELL, CFLD, NULL, "", 0.0, FLD|STR|DONTFREE };
62 fldtab = (Cell **) malloc((nfields+1) * sizeof(Cell *)); in recinit()
65 fldtab[0] = (Cell *) malloc(sizeof (Cell)); in recinit()
78 fldtab[i] = (Cell *) malloc(sizeof (struct Cell)); in makefields()
222 Cell *x; in getargv()
236 Cell *q; in setclvar()
257 Cell *p; in fldbld()
349 Cell *p; in cleanfld()
[all …]
|
| H A D | parse.c | 168 Node *celltonode(Cell *a, int b) in celltonode()
181 extern Cell *literal0; in rectonode()
187 Cell *cp; in makearr()
190 cp = (Cell *) (p->narg[0]); in makearr()
233 void defn(Cell *v, Node *vl, Node *st) /* turn on FCN bit in definition, */ in defn()
258 if (strcmp(((Cell *)(p->narg[0]))->nval, s) == 0) in isarg()
|
| H A D | awkgram.y | 32 void checkdup(Node *list, Cell *item);
45 Cell *cp;
187 { infunc--; curfname=0; defn((Cell *)$2, $4, $8); $$ = 0; }
449 void setfname(Cell *p)
460 return isvalue(p) && ((Cell *) (p->narg[0]))->csub == CCON;
465 return ((Cell *)(p->narg[0]))->sval;
479 void checkdup(Node *vl, Cell *cp) /* check if name already in list */
483 if (strcmp(s, ((Cell *)(vl->narg[0]))->nval) == 0) {
|
| H A D | awkgram.c | 9 void checkdup(Node *list, Cell *item);
22 Cell *cp;
130 void setfname(Cell *p) in setfname()
141 return isvalue(p) && ((Cell *) (p->narg[0]))->csub == CCON; in constnode()
146 return ((Cell *)(p->narg[0]))->sval; in strnode()
160 void checkdup(Node *vl, Cell *cp) /* check if name already in list */ in checkdup()
164 if (strcmp(s, ((Cell *)(vl->narg[0]))->nval) == 0) { in checkdup()
1241 { infunc--; curfname=0; defn((Cell *)yypt[-7].yyv.p, yypt[-5].yyv.p, yypt[-1].yyv.p); yyval.p = 0; … in yyparse()
|
| H A D | proctab.c | 101 Cell *(*proctab[92])(Node **, int) = {
|
| /plan9/sys/src/games/sudoku/ |
| H A D | sudoku.h | 18 typedef struct Cell { struct
22 } Cell; argument
24 Cell brd[Psize];
25 Cell obrd[Psize];
49 void fprettyprintbrd(Cell *board);
50 void fprintbrd(int fd, Cell *board);
51 void floadbrd(int fd, Cell *board);
52 void printboard(Cell *board);
53 int loadlevel(char *name, Cell *board);
54 void savegame(Cell *board);
[all …]
|
| H A D | levels.c | 16 fprettyprintbrd(Cell *board) in fprettyprintbrd()
49 fprintbrd(int fd, Cell *board) in fprintbrd()
72 loadlevel(char *name, Cell *board) in loadlevel()
146 printboard(Cell *board) in printboard()
162 savegame(Cell *board) in savegame()
172 if(write(fd, board, Psize * sizeof(Cell)) != Psize * sizeof(Cell)) { in savegame()
181 loadgame(Cell *board) in loadgame()
191 if(read(fd, board, Psize * sizeof(Cell)) != Psize * sizeof(Cell)) { in loadgame()
|
| H A D | sudoku.c | 80 convert(Cell *brd, int *board) in convert()
91 memcpy(obrd, brd, Psize * sizeof(Cell)); in convert()
127 clearboard(Cell *board) in clearboard()
139 solveboard(Cell *board) in solveboard()
150 checkpossible(Cell *board, int x, int y, int num) in checkpossible()
208 drawchecked(Cell *brd) in drawchecked()
364 memcpy(obrd, brd, Psize * sizeof(Cell)); in main()
384 memcpy(brd, obrd, Psize * sizeof(Cell)); in main()
395 memcpy(obrd, brd, Psize * sizeof(Cell)); in main()
|
| /plan9/sys/src/ape/cmd/pdksh/ |
| H A D | alloc.c | 18 typedef union Cell Cell; typedef
31 union Cell { union
33 Cell *next;
42 Cell *freelist; /* object free list */
43 Cell *last; /* &b.cell[size] */
44 Cell cell [1]; /* [size] Cells for allocation */
50 static void *asplit ARGS((Area *ap, Block *bp, Cell *fp, Cell *fpp, int cells));
91 Cell *fp = 0, *fpp = 0;
96 cells = (unsigned)(size + sizeof(Cell) - 1) / sizeof(Cell);
156 Cell *fp;
[all …]
|