Lines Matching refs:NODE
169 static NODE *node_common P((NODETYPE op));
170 static NODE *snode P((NODE *subn, NODETYPE op, int sindex));
171 static NODE *make_for_loop P((NODE *init, NODE *cond, NODE *incr));
172 static NODE *append_right P((NODE *list, NODE *new));
173 static inline NODE *append_pattern P((NODE **list, NODE *patt));
174 static void func_install P((NODE *params, NODE *def));
175 static void pop_var P((NODE *np, int freeit));
176 static void pop_params P((NODE *params));
177 static NODE *make_param P((char *name));
178 static NODE *mk_rexp P((NODE *exp));
179 static int dup_parms P((NODE *func));
180 static void param_sanity P((NODE *arglist));
181 static int parms_shadow P((const char *fname, NODE *func));
183 static int isassignable P((NODE *n));
186 static void count_args P((NODE *n));
187 static int isarray P((NODE *n));
213 NODE *variables[HASHSIZE];
221 extern NODE *begin_block;
222 extern NODE *end_block;
254 NODE *nodeval;
257 NODE *(*ptrval) P((void));
1634 yyval.nodeval = append_pattern(&expression_value, (NODE *) NULL);
1648 NODE *r;
1662 yyval.nodeval = append_pattern(&begin_block, (NODE *) NULL);
1670 yyval.nodeval = append_pattern(&end_block, (NODE *) NULL);
1710 NODE *t;
1730 NODE *n;
1766 : node(yyvsp[-1].nodeval, Node_statement_list, (NODE *) NULL)),
1768 : node(yyvsp[0].nodeval, Node_statement_list, (NODE *) NULL)));
1826 NODE *arr, *sub;
1849 (NODE *) NULL, variable(yyvsp[-3].sval, CAN_FREE, Node_var_array)));
1857 yyval.nodeval = node(yyvsp[0].nodeval, Node_K_for, (NODE *) make_for_loop(yyvsp[-9].nodeval, yyvsp[-6].nodeval, yyvsp[-3].nodeval));
1865 (NODE *) make_for_loop(yyvsp[-8].nodeval, (NODE *) NULL, yyvsp[-3].nodeval));
1871 { yyval.nodeval = node((NODE *) NULL, Node_K_break, (NODE *) NULL); }
1876 { yyval.nodeval = node((NODE *) NULL, Node_K_continue, (NODE *) NULL); }
1887 yyval.nodeval = node((NODE *) NULL, type, (NODE *) NULL);
1910 yyval.nodeval = node((NODE *) NULL, Node_K_nextfile, (NODE *) NULL);
1916 { yyval.nodeval = node(yyvsp[-1].nodeval, Node_K_exit, (NODE *) NULL); }
1929 { yyval.nodeval = node(yyvsp[-1].nodeval, Node_K_return, (NODE *) NULL); }
1989 yyval.nodeval = node(variable(yyvsp[0].sval, CAN_FREE, Node_var_array), Node_K_delete, (NODE *) NULL);
2007 yyval.nodeval = node(variable(yyvsp[-1].sval, CAN_FREE, Node_var_array), Node_K_delete, (NODE *) NULL);
2032 NODE *dflt = NULL;
2033 NODE *head = yyvsp[0].nodeval;
2034 NODE *curr;
2092 yyval.nodeval = node(yyvsp[0].nodeval, Node_case_list, (NODE *) NULL);
2095 (yyvsp[-1].nodeval->type == Node_case_list ? yyvsp[-1].nodeval : node(yyvsp[-1].nodeval, Node_case_list, (NODE *) NULL)),
2096 (yyvsp[0].nodeval->type == Node_case_list ? yyvsp[0].nodeval : node(yyvsp[0].nodeval, Node_case_list, (NODE *) NULL))
2115 { yyval.nodeval = node((NODE *) NULL, Node_K_default, yyvsp[0].nodeval); }
2168 yyval.nodeval = node(yyvsp[0].nodeval, yyvsp[-2].nodetypeval, (NODE *) NULL);
2180 node(yyvsp[0].nodeval, Node_if_branches, (NODE *) NULL));
2197 { yyval.nodeval = node(yyvsp[0].nodeval, Node_redirect_input, (NODE *) NULL); }
2257 { yyval.nodeval = node(yyvsp[0].nodeval, Node_expression_list, (NODE *) NULL); }
2264 node(yyvsp[0].nodeval, Node_expression_list, (NODE *) NULL));
2381 (NODE *) NULL),
2445 node(yyvsp[-3].nodeval, yyvsp[-2].nodetypeval, (NODE *) NULL));
2451 { yyval.nodeval = node(yyvsp[-1].nodeval, Node_postincrement, (NODE *) NULL); }
2456 { yyval.nodeval = node(yyvsp[-1].nodeval, Node_postdecrement, (NODE *) NULL); }
2461 { yyval.nodeval = node(yyvsp[0].nodeval, Node_not, (NODE *) NULL); }
2484 yyval.nodeval = snode((NODE *) NULL, Node_builtin, (int) yyvsp[0].lval);
2503 { yyval.nodeval = node(yyvsp[0].nodeval, Node_preincrement, (NODE *) NULL); }
2508 { yyval.nodeval = node(yyvsp[0].nodeval, Node_predecrement, (NODE *) NULL); }
2528 yyval.nodeval = node(yyvsp[0].nodeval, Node_unary_minus, (NODE *) NULL);
2561 NODE *n;
2577 { yyval.nodeval = node(yyvsp[0].nodeval, Node_field_spec, (NODE *) NULL); }
2834 NODE *(*ptr) P((NODE *)); /* function that implements this keyword */
2934 getfname(register NODE *(*fptr)(NODE *))
4005 static NODE *
4008 register NODE *r;
4024 NODE *
4025 node(NODE *left, NODETYPE op, NODE *right)
4027 register NODE *r;
4039 static NODE *
4040 snode(NODE *subn, NODETYPE op, int idx)
4042 register NODE *r;
4043 register NODE *n;
4066 subn = node(node(make_number(0.0), Node_field_spec, (NODE *) NULL),
4068 (NODE *) NULL);
4089 (NODE *) NULL),
4091 (NODE *) NULL));
4106 (NODE *) NULL),
4108 (NODE *) NULL));
4112 node(FS_node, Node_expression_list, (NODE *) NULL));
4134 NODE *str = subn->lnode;
4148 NODE *str1 = subn->lnode;
4149 NODE *str2 = subn->rnode->lnode;
4167 static NODE *
4168 make_for_loop(NODE *init, NODE *cond, NODE *incr)
4171 NODE *n;
4186 dup_parms(NODE *func)
4188 register NODE *np;
4191 NODE *params;
4236 parms_shadow(const char *fname, NODE *func)
4271 NODE *
4272 install(char *name, NODE *value)
4274 register NODE *hp;
4294 NODE *
4297 register NODE *bucket;
4314 const NODE *const *npp1, *const *npp2;
4315 const NODE *n1, *n2;
4318 npp1 = (const NODE *const *) v1;
4319 npp2 = (const NODE *const *) v2;
4334 valinfo(NODE *n, FILE *fp)
4359 NODE **table;
4360 NODE *p;
4363 emalloc(table, NODE **, var_count * sizeof(NODE *), "dump_vars");
4380 qsort(table, j, sizeof(NODE *), var_comp);
4394 NODE **lhs = get_lhs(p->hvalue, NULL, FALSE);
4412 NODE *p, *next;
4423 NODE **lhs = get_lhs(p->hvalue, NULL, FALSE);
4436 NODE *func;
4464 NODE *p;
4514 NODE *p;
4559 static NODE *
4560 append_right(NODE *list, NODE *new)
4562 register NODE *oldlist;
4563 static NODE *savefront = NULL, *savetail = NULL;
4584 static inline NODE *
4585 append_pattern(NODE **list, NODE *patt)
4587 NODE *n = node(patt, Node_rule_node, (NODE *) NULL);
4592 NODE *n1 = node(n, Node_rule_list, (NODE *) NULL);
4613 func_install(NODE *params, NODE *def)
4615 NODE *r, *n, *thisfunc;
4675 pop_var(NODE *np, int freeit)
4677 register NODE *bucket, **save;
4704 pop_params(NODE *params)
4714 static NODE *
4717 NODE *r;
4812 param_sanity(NODE *arglist)
4814 NODE *argp, *arg;
4826 NODE *
4829 register NODE *r;
4846 NODE *n;
4849 n = node(Nnull_string, type, (NODE *) NULL);
4851 n = node((NODE *) NULL, type, (NODE *) NULL);
4863 static NODE *
4864 mk_rexp(NODE *exp)
4866 NODE *n;
4941 isassignable(register NODE *n)
4973 NODE *
4974 stopme(NODE *tree ATTRIBUTE_UNUSED)
5031 count_args(NODE *tree)
5034 NODE *save_tree;
5051 isarray(NODE *n)