usr.bin/awk/awk.h

173

struct Node *nnext;

usr.bin/awk/awk.h

176

struct Node *narg[1]; /* variable: actual size set by calling malloc */

usr.bin/awk/awk.h

179

#define NIL ((Node *) 0)

usr.bin/awk/awk.h

181

extern Node *winner;

usr.bin/awk/awk.h

182

extern Node *nullnode;

usr.bin/awk/awk.h

252

Node *np;

usr.bin/awk/awkgram.y

101

winner = (Node *)stat3(PROGRAM, beginloc, $1, endloc); }

usr.bin/awk/awkgram.y

208

| ppattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedfa($3, 0)); free($3); }

usr.bin/awk/awkgram.y

211

$$ = op3($2, NIL, $1, (Node*)makedfa(strnode($3), 0));

usr.bin/awk/awkgram.y

214

$$ = op3($2, (Node *)1, $1, $3); }

usr.bin/awk/awkgram.y

236

| pattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedfa($3, 0)); free($3); }

usr.bin/awk/awkgram.y

239

$$ = op3($2, NIL, $1, (Node*)makedfa(strnode($3), 0));

usr.bin/awk/awkgram.y

242

$$ = op3($2, (Node *)1, $1, $3); }

usr.bin/awk/awkgram.y

250

else $$ = op3(GETLINE, (Node*)0, itonp($2), $1); }

usr.bin/awk/awkgram.y

286

{ $$ = op3(MATCH, NIL, rectonode(), (Node*)makedfa($1, 0)); free($1); }

usr.bin/awk/awkgram.y

31

void checkdup(Node *list, Cell *item);

usr.bin/awk/awkgram.y

34

Node *beginloc = 0;

usr.bin/awk/awkgram.y

35

Node *endloc = 0;

usr.bin/awk/awkgram.y

382

{ $$ = op5(GENSUB, NIL, (Node*)makedfa($3, 1), $5, $7, rectonode()); }

usr.bin/awk/awkgram.y

385

$$ = op5(GENSUB, NIL, (Node *)makedfa(strnode($3), 1), $5, $7, rectonode());

usr.bin/awk/awkgram.y

388

$$ = op5(GENSUB, (Node *)1, $3, $5, $7, rectonode());

usr.bin/awk/awkgram.y

39

Node *arglist = 0; /* list of args for current function */

usr.bin/awk/awkgram.y

391

{ $$ = op5(GENSUB, NIL, (Node*)makedfa($3, 1), $5, $7, $9); }

usr.bin/awk/awkgram.y

394

$$ = op5(GENSUB, NIL, (Node *)makedfa(strnode($3),1), $5,$7,$9);

usr.bin/awk/awkgram.y

397

$$ = op5(GENSUB, (Node *)1, $3, $5, $7, $9);

usr.bin/awk/awkgram.y

407

$$ = op2(INDEX, $3, (Node*)$5); }

usr.bin/awk/awkgram.y

410

{ $$ = op3(MATCHFCN, NIL, $3, (Node*)makedfa($5, 1)); free($5); }

usr.bin/awk/awkgram.y

413

$$ = op3(MATCHFCN, NIL, $3, (Node*)makedfa(strnode($5), 1));

usr.bin/awk/awkgram.y

416

$$ = op3(MATCHFCN, (Node *)1, $3, $5); }

usr.bin/awk/awkgram.y

419

{ $$ = op4(SPLIT, $3, makearr($5), $7, (Node*)STRING); }

usr.bin/awk/awkgram.y

421

{ $$ = op4(SPLIT, $3, makearr($5), (Node*)makedfa($7, 1), (Node *)REGEXPR); free($7); }

usr.bin/awk/awkgram.y

423

{ $$ = op4(SPLIT, $3, makearr($5), NIL, (Node*)STRING); } /* default */

usr.bin/awk/awkgram.y

427

{ $$ = op4($1, NIL, (Node*)makedfa($3, 1), $5, rectonode()); free($3); }

usr.bin/awk/awkgram.y

43

Node *p;

usr.bin/awk/awkgram.y

430

$$ = op4($1, NIL, (Node*)makedfa(strnode($3), 1), $5, rectonode());

usr.bin/awk/awkgram.y

433

$$ = op4($1, (Node *)1, $3, $5, rectonode()); }

usr.bin/awk/awkgram.y

435

{ $$ = op4($1, NIL, (Node*)makedfa($3, 1), $5, $7); free($3); }

usr.bin/awk/awkgram.y

438

$$ = op4($1, NIL, (Node*)makedfa(strnode($3), 1), $5, $7);

usr.bin/awk/awkgram.y

441

$$ = op4($1, (Node *)1, $3, $5, $7); }

usr.bin/awk/awkgram.y

467

| VARNF { $$ = op1(VARNF, (Node *) $1); }

usr.bin/awk/awkgram.y

486

int constnode(Node *p)

usr.bin/awk/awkgram.y

491

char *strnode(Node *p)

usr.bin/awk/awkgram.y

496

Node *notnull(Node *n)

usr.bin/awk/awkgram.y

507

void checkdup(Node *vl, Cell *cp) /* check if name already in list */

usr.bin/awk/b.c

1011

np = op2(CCL, NIL, (Node*) cclenter((const char *) rlxstr));

usr.bin/awk/b.c

1016

np = op2(NCCL, NIL, (Node *) cclenter((const char *) rlxstr));

usr.bin/awk/b.c

1032

return unary(op2(CCL, NIL, (Node *) cclenter("")));

usr.bin/awk/b.c

1048

Node *concat(Node *np)

usr.bin/awk/b.c

1055

return (concat(op2(CAT, op2(CCL, NIL, (Node *) cclenter("")),

usr.bin/awk/b.c

1061

Node *alt(Node *np)

usr.bin/awk/b.c

1070

Node *unary(Node *np)

usr.bin/awk/b.c

231

Node *p, *p1;

usr.bin/awk/b.c

292

void penter(Node *p) /* set up parent pointers and leaf indices */

usr.bin/awk/b.c

319

void freetr(Node *p) /* free parse tree */

usr.bin/awk/b.c

490

void cfoll(fa *f, Node *v) /* enter follow set of each leaf of vertex v into lfollow[leaf] */

usr.bin/awk/b.c

529

int first(Node *p) /* collects initially active leaves of p into setvec */

usr.bin/awk/b.c

574

void follow(Node *v) /* collects leaves that can follow v into setvec */

usr.bin/awk/b.c

576

Node *p;

usr.bin/awk/b.c

966

Node *reparse(const char *p) /* parses regular expression pointed to by p */

usr.bin/awk/b.c

968

Node *np;

usr.bin/awk/b.c

984

Node *regexp(void) /* top-level parse of reg expr */

usr.bin/awk/b.c

989

Node *primary(void)

usr.bin/awk/b.c

991

Node *np;

usr.bin/awk/lib.c

760

extern Node *curnode;

usr.bin/awk/main.c

67

extern Node *curnode;

usr.bin/awk/parse.c

111

Node *stat1(int a, Node *b)

usr.bin/awk/parse.c

113

Node *x;

usr.bin/awk/parse.c

120

Node *stat2(int a, Node *b, Node *c)

usr.bin/awk/parse.c

122

Node *x;

usr.bin/awk/parse.c

129

Node *stat3(int a, Node *b, Node *c, Node *d)

usr.bin/awk/parse.c

131

Node *x;

usr.bin/awk/parse.c

138

Node *stat4(int a, Node *b, Node *c, Node *d, Node *e)

usr.bin/awk/parse.c

140

Node *x;

usr.bin/awk/parse.c

147

Node *op1(int a, Node *b)

usr.bin/awk/parse.c

149

Node *x;

usr.bin/awk/parse.c

156

Node *op2(int a, Node *b, Node *c)

usr.bin/awk/parse.c

158

Node *x;

usr.bin/awk/parse.c

165

Node *op3(int a, Node *b, Node *c, Node *d)

usr.bin/awk/parse.c

167

Node *x;

usr.bin/awk/parse.c

174

Node *op4(int a, Node *b, Node *c, Node *d, Node *e)

usr.bin/awk/parse.c

176

Node *x;

usr.bin/awk/parse.c

183

Node *op5(int a, Node *b, Node *c, Node *d, Node *e, Node *f)

usr.bin/awk/parse.c

185

Node *x;

usr.bin/awk/parse.c

192

Node *celltonode(Cell *a, int b)

usr.bin/awk/parse.c

194

Node *x;

usr.bin/awk/parse.c

198

x = node1(0, (Node *) a);

usr.bin/awk/parse.c

203

Node *rectonode(void) /* make $0 into a Node */

usr.bin/awk/parse.c

209

Node *makearr(Node *p)

usr.bin/awk/parse.c

230

Node *pa2stat(Node *a, Node *b, Node *c) /* pat, pat {...} */

usr.bin/awk/parse.c

232

Node *x;

usr.bin/awk/parse.c

241

Node *linkum(Node *a, Node *b)

usr.bin/awk/parse.c

243

Node *c;

usr.bin/awk/parse.c

257

void defn(Cell *v, Node *vl, Node *st) /* turn on FCN bit in definition, */

usr.bin/awk/parse.c

259

Node *p;

usr.bin/awk/parse.c

282

extern Node *arglist;

usr.bin/awk/parse.c

283

Node *p = arglist;

usr.bin/awk/parse.c

297

Node *itonp(int i) /* and vice versa */

usr.bin/awk/parse.c

299

return (Node *) (long) i;

usr.bin/awk/parse.c

33

Node *nodealloc(size_t n)

usr.bin/awk/parse.c

35

Node *x;

usr.bin/awk/parse.c

37

x = (Node *) malloc(sizeof(*x) + (n-1) * sizeof(x));

usr.bin/awk/parse.c

45

Node *exptostat(Node *a)

usr.bin/awk/parse.c

51

Node *node1(int a, Node *b)

usr.bin/awk/parse.c

53

Node *x;

usr.bin/awk/parse.c

61

Node *node2(int a, Node *b, Node *c)

usr.bin/awk/parse.c

63

Node *x;

usr.bin/awk/parse.c

72

Node *node3(int a, Node *b, Node *c, Node *d)

usr.bin/awk/parse.c

74

Node *x;

usr.bin/awk/parse.c

84

Node *node4(int a, Node *b, Node *c, Node *d, Node *e)

usr.bin/awk/parse.c

86

Node *x;

usr.bin/awk/parse.c

97

Node *node5(int a, Node *b, Node *c, Node *d, Node *e, Node *f)

usr.bin/awk/parse.c

99

Node *x;

usr.bin/awk/proto.h

153

extern void run(Node *);

usr.bin/awk/proto.h

154

extern Cell *execute(Node *);

usr.bin/awk/proto.h

155

extern Cell *program(Node **, int);

usr.bin/awk/proto.h

156

extern Cell *call(Node **, int);

usr.bin/awk/proto.h

158

extern Cell *arg(Node **, int);

usr.bin/awk/proto.h

159

extern Cell *jump(Node **, int);

usr.bin/awk/proto.h

160

extern Cell *awkgetline(Node **, int);

usr.bin/awk/proto.h

161

extern Cell *getnf(Node **, int);

usr.bin/awk/proto.h

162

extern Cell *array(Node **, int);

usr.bin/awk/proto.h

163

extern Cell *awkdelete(Node **, int);

usr.bin/awk/proto.h

164

extern Cell *intest(Node **, int);

usr.bin/awk/proto.h

165

extern Cell *matchop(Node **, int);

usr.bin/awk/proto.h

166

extern Cell *boolop(Node **, int);

usr.bin/awk/proto.h

167

extern Cell *relop(Node **, int);

usr.bin/awk/proto.h

170

extern Cell *indirect(Node **, int);

usr.bin/awk/proto.h

171

extern Cell *substr(Node **, int);

usr.bin/awk/proto.h

172

extern Cell *sindex(Node **, int);

usr.bin/awk/proto.h

173

extern int format(char **, int *, const char *, Node *);

usr.bin/awk/proto.h

174

extern Cell *awksprintf(Node **, int);

usr.bin/awk/proto.h

175

extern Cell *awkprintf(Node **, int);

usr.bin/awk/proto.h

176

extern Cell *arith(Node **, int);

usr.bin/awk/proto.h

178

extern Cell *incrdecr(Node **, int);

usr.bin/awk/proto.h

179

extern Cell *assign(Node **, int);

usr.bin/awk/proto.h

180

extern Cell *cat(Node **, int);

usr.bin/awk/proto.h

181

extern Cell *pastat(Node **, int);

usr.bin/awk/proto.h

182

extern Cell *dopa2(Node **, int);

usr.bin/awk/proto.h

183

extern Cell *split(Node **, int);

usr.bin/awk/proto.h

184

extern Cell *condexpr(Node **, int);

usr.bin/awk/proto.h

185

extern Cell *ifstat(Node **, int);

usr.bin/awk/proto.h

186

extern Cell *whilestat(Node **, int);

usr.bin/awk/proto.h

187

extern Cell *dostat(Node **, int);

usr.bin/awk/proto.h

188

extern Cell *forstat(Node **, int);

usr.bin/awk/proto.h

189

extern Cell *instat(Node **, int);

usr.bin/awk/proto.h

190

extern Cell *bltin(Node **, int);

usr.bin/awk/proto.h

191

extern Cell *printstat(Node **, int);

usr.bin/awk/proto.h

192

extern Cell *nullproc(Node **, int);

usr.bin/awk/proto.h

193

extern FILE *redirect(int, Node *);

usr.bin/awk/proto.h

196

extern Cell *closefile(Node **, int);

usr.bin/awk/proto.h

198

extern Cell *dosub(Node **, int);

usr.bin/awk/proto.h

199

extern Cell *gensub(Node **, int);

usr.bin/awk/proto.h

28

extern int constnode(Node *);

usr.bin/awk/proto.h

29

extern char *strnode(Node *);

usr.bin/awk/proto.h

30

extern Node *notnull(Node *);

usr.bin/awk/proto.h

42

extern void penter(Node *);

usr.bin/awk/proto.h

43

extern void freetr(Node *);

usr.bin/awk/proto.h

47

extern void cfoll(fa *, Node *);

usr.bin/awk/proto.h

48

extern int first(Node *);

usr.bin/awk/proto.h

49

extern void follow(Node *);

usr.bin/awk/proto.h

55

extern Node *reparse(const char *);

usr.bin/awk/proto.h

56

extern Node *regexp(void);

usr.bin/awk/proto.h

57

extern Node *primary(void);

usr.bin/awk/proto.h

58

extern Node *concat(Node *);

usr.bin/awk/proto.h

59

extern Node *alt(Node *);

usr.bin/awk/proto.h

60

extern Node *unary(Node *);

usr.bin/awk/proto.h

68

extern Node *nodealloc(size_t);

usr.bin/awk/proto.h

69

extern Node *exptostat(Node *);

usr.bin/awk/proto.h

70

extern Node *node1(int, Node *);

usr.bin/awk/proto.h

71

extern Node *node2(int, Node *, Node *);

usr.bin/awk/proto.h

72

extern Node *node3(int, Node *, Node *, Node *);

usr.bin/awk/proto.h

73

extern Node *node4(int, Node *, Node *, Node *, Node *);

usr.bin/awk/proto.h

74

extern Node *node5(int, Node *, Node *, Node *, Node *, Node *);

usr.bin/awk/proto.h

75

extern Node *stat3(int, Node *, Node *, Node *);

usr.bin/awk/proto.h

76

extern Node *op2(int, Node *, Node *);

usr.bin/awk/proto.h

77

extern Node *op1(int, Node *);

usr.bin/awk/proto.h

78

extern Node *stat1(int, Node *);

usr.bin/awk/proto.h

79

extern Node *op3(int, Node *, Node *, Node *);

usr.bin/awk/proto.h

80

extern Node *op4(int, Node *, Node *, Node *, Node *);

usr.bin/awk/proto.h

81

extern Node *op5(int, Node *, Node *, Node *, Node *, Node *);

usr.bin/awk/proto.h

82

extern Node *stat2(int, Node *, Node *);

usr.bin/awk/proto.h

83

extern Node *stat4(int, Node *, Node *, Node *, Node *);

usr.bin/awk/proto.h

84

extern Node *celltonode(Cell *, int);

usr.bin/awk/proto.h

85

extern Node *rectonode(void);

usr.bin/awk/proto.h

86

extern Node *makearr(Node *);

usr.bin/awk/proto.h

87

extern Node *pa2stat(Node *, Node *, Node *);

usr.bin/awk/proto.h

88

extern Node *linkum(Node *, Node *);

usr.bin/awk/proto.h

89

extern void defn(Cell *, Node *, Node *);

usr.bin/awk/proto.h

92

extern Cell *(*proctab[])(Node **, int);

usr.bin/awk/proto.h

94

extern Node *itonp(int);

usr.bin/awk/run.c

102

Node *curnode = NULL; /* the node being executed, for debugging */

usr.bin/awk/run.c

1026

Cell *sindex(Node **a, int nnn) /* index(a[0], a[1]) */

usr.bin/awk/run.c

1074

int format(char **pbuf, int *pbufsize, const char *s, Node *a) /* printf-like conversions */

usr.bin/awk/run.c

1387

Cell *awksprintf(Node **a, int n) /* sprintf(a[0]) */

usr.bin/awk/run.c

139

void run(Node *a) /* execution of parse tree starts here */

usr.bin/awk/run.c

1390

Node *y;

usr.bin/awk/run.c

1407

Cell *awkprintf(Node **a, int n) /* printf */

usr.bin/awk/run.c

1412

Node *y;

usr.bin/awk/run.c

1441

Cell *arith(Node **a, int n) /* a[0] + a[1], etc. also -a[0] */

usr.bin/awk/run.c

147

Cell *execute(Node *u) /* execute a node of the parse tree */

usr.bin/awk/run.c

149

Cell *(*proc)(Node **, int);

usr.bin/awk/run.c

151

Node *a;

usr.bin/awk/run.c

1510

Cell *incrdecr(Node **a, int n) /* a[0]++, etc. */

usr.bin/awk/run.c

1530

Cell *assign(Node **a, int n) /* a[0] = a[1], a[0] += a[1], etc. */

usr.bin/awk/run.c

1596

Cell *cat(Node **a, int q) /* a[0] cat a[1] */

usr.bin/awk/run.c

1625

Cell *pastat(Node **a, int n) /* a[0] { a[1] } */

usr.bin/awk/run.c

1641

Cell *dopa2(Node **a, int n) /* a[0], a[1] { a[2] } */

usr.bin/awk/run.c

1664

Cell *split(Node **a, int nnn) /* split(a[0], a[1], a[2]); a[3] is type */

usr.bin/awk/run.c

184

Cell *program(Node **a, int n) /* execute an awk program */

usr.bin/awk/run.c

1852

Cell *condexpr(Node **a, int n) /* a[0] ? a[1] : a[2] */

usr.bin/awk/run.c

1867

Cell *ifstat(Node **a, int n) /* if (a[0]) a[1]; else a[2] */

usr.bin/awk/run.c

1882

Cell *whilestat(Node **a, int n) /* while (a[0]) a[1] */

usr.bin/awk/run.c

1902

Cell *dostat(Node **a, int n) /* do a[0]; while(a[1]) */

usr.bin/awk/run.c

1920

Cell *forstat(Node **a, int n) /* for (a[0]; a[1]; a[2]) a[3] */

usr.bin/awk/run.c

1943

Cell *instat(Node **a, int n) /* for (a[0] in a[1]) a[2] */

usr.bin/awk/run.c

2051

Cell *bltin(Node **a, int n) /* builtin functions. a[0] is type, a[1] is arg list */

usr.bin/awk/run.c

2058

Node *nextarg;

usr.bin/awk/run.c

2292

Cell *printstat(Node **a, int n) /* print a[0] */

usr.bin/awk/run.c

2294

Node *x;

usr.bin/awk/run.c

231

Cell *call(Node **a, int n) /* function call. very kludgy and fragile */

usr.bin/awk/run.c

2318

Cell *nullproc(Node **a, int n)

usr.bin/awk/run.c

2324

FILE *redirect(int a, Node *b) /* set up all i/o redirections */

usr.bin/awk/run.c

236

Node *x;

usr.bin/awk/run.c

2442

Cell *closefile(Node **a, int n)

usr.bin/awk/run.c

2523

Cell *dosub(Node **a, int subop) /* sub and gsub */

usr.bin/awk/run.c

2662

Cell *gensub(Node **a, int nnn) /* global selective substitute */

usr.bin/awk/run.c

291

y = execute((Node *)(fcn->sval)); /* execute body */

usr.bin/awk/run.c

349

Cell *arg(Node **a, int n) /* nth argument of a function */

usr.bin/awk/run.c

360

Cell *jump(Node **a, int n) /* break, continue, next, nextfile, return */

usr.bin/awk/run.c

404

Cell *awkgetline(Node **a, int n) /* get next line from specific input */

usr.bin/awk/run.c

469

Cell *getnf(Node **a, int n) /* get NF */

usr.bin/awk/run.c

477

makearraystring(Node *p, const char *func)

usr.bin/awk/run.c

513

Cell *array(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */

usr.bin/awk/run.c

536

Cell *awkdelete(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */

usr.bin/awk/run.c

560

Cell *intest(Node **a, int n) /* a[0] is index (list), a[1] is symtab */

usr.bin/awk/run.c

796

Cell *matchop(Node **a, int n) /* ~ and match() */

usr.bin/awk/run.c

81

Node *winner = NULL; /* root of parse tree */

usr.bin/awk/run.c

852

Cell *boolop(Node **a, int n) /* a[0] || a[1], a[0] && a[1], !a[0] */

usr.bin/awk/run.c

884

Cell *relop(Node **a, int n) /* a[0 < a[1], etc. */

usr.bin/awk/run.c

955

Cell *indirect(Node **a, int n) /* $( a[0] ) */

usr.bin/awk/run.c

973

Cell *substr(Node **a, int nnn) /* substr(a[0], a[1], a[2]) */

usr.bin/awk/tran.c

68

Node *nullnode; /* zero&null, converted into a node for comparisons */

usr.sbin/map-mbone/mapper.c

100

void graph_edges(Node *node);

usr.sbin/map-mbone/mapper.c

101

void elide_aliases(Node *node);

usr.sbin/map-mbone/mapper.c

106

Node *find_node(u_int32_t addr, Node **ptr)

usr.sbin/map-mbone/mapper.c

108

Node *n = *ptr;

usr.sbin/map-mbone/mapper.c

111

*ptr = n = malloc(sizeof(Node));

usr.sbin/map-mbone/mapper.c

127

Interface *find_interface(u_int32_t addr, Node *node)

usr.sbin/map-mbone/mapper.c

145

Neighbor *find_neighbor(u_int32_t addr, Node *node)

usr.sbin/map-mbone/mapper.c

272

Node *node = find_node(src, &routers);

usr.sbin/map-mbone/mapper.c

308

Node *ifc_node;

usr.sbin/map-mbone/mapper.c

336

Node *tmp = ifc_node->u.alias;

usr.sbin/map-mbone/mapper.c

387

Node *n_node;

usr.sbin/map-mbone/mapper.c

431

Node *node = find_node(src, &routers);

usr.sbin/map-mbone/mapper.c

443

Node *ifc_node;

usr.sbin/map-mbone/mapper.c

477

Node *tmp = ifc_node->u.alias;

usr.sbin/map-mbone/mapper.c

528

Node *n_node;

usr.sbin/map-mbone/mapper.c

579

int retry_requests(Node *node)

usr.sbin/map-mbone/mapper.c

609

void print_map(Node *node)

usr.sbin/map-mbone/mapper.c

689

void graph_edges(Node *node)

usr.sbin/map-mbone/mapper.c

705

Node *nb_node = find_node(nb->addr, &routers);

usr.sbin/map-mbone/mapper.c

733

void elide_aliases(Node *node)

usr.sbin/map-mbone/mapper.c

744

Node *nb_node = find_node(nb->addr, &routers);

usr.sbin/map-mbone/mapper.c

81

Node *routers = 0;

usr.sbin/map-mbone/mapper.c

889

Node *n = find_node(target_addr, &routers);

usr.sbin/map-mbone/mapper.c

90

Node * find_node(u_int32_t addr, Node **ptr);

usr.sbin/map-mbone/mapper.c

91

Interface * find_interface(u_int32_t addr, Node *node);

usr.sbin/map-mbone/mapper.c

92

Neighbor * find_neighbor(u_int32_t addr, Node *node);

usr.sbin/map-mbone/mapper.c

96

int retry_requests(Node *node);

usr.sbin/map-mbone/mapper.c

98

void print_map(Node *node);