Searched refs:lnode (Results 1 - 11 of 11) sorted by relevance
/haiku-fatelf/src/bin/gawk/ |
H A D | profile.c | 179 tree = t->lnode; 186 if (tree->lnode) { 187 eval_condition(tree->lnode); 195 if (tree->lnode != NULL 196 && tree->lnode->exec_count) 198 tree->lnode->exec_count); 220 pprint(t->lnode); 228 eval_condition(tree->lnode); 237 pprint(tree->rnode->lnode); 257 pprint(tree->lnode); [all...] |
H A D | ext.c | 67 obj = tree_eval(tree->lnode); 77 fun = tree_eval(tree->rnode->lnode); 150 if (tree->lnode == Nnull_string) 161 return tree->lnode;
|
H A D | eval.c | 361 tree = t->lnode; 368 if (tree->lnode == NULL || 369 eval_condition(tree->lnode)) { 370 /* using the lnode exec_count is kludgey */ 371 if (tree->lnode != NULL) 372 INCREMENT(tree->lnode->exec_count); 394 (void) interpret(t->lnode); 399 if (eval_condition(tree->lnode)) { 401 (void) interpret(tree->rnode->lnode); 421 switch_value = tree_eval(stable_tree->lnode); [all...] |
H A D | builtin.c | 150 tmp = tree_eval(tree->lnode); 200 tmp = tree_eval(tree->lnode); 321 s1 = tree_eval(tree->lnode); 322 s2 = tree_eval(tree->rnode->lnode); 435 tmp = tree_eval(tree->lnode); 452 tmp = tree_eval(tree->lnode); 468 tmp = tree_eval(tree->lnode); 617 tmp = tree_eval(carg->lnode); 1143 NODE *sfmt = force_string(tree_eval(tree->lnode)); 1181 if (tree->lnode [all...] |
H A D | awkgram.y | 202 if ($1->lnode != NULL) { 393 arr = $8->lnode; /* array var */ 394 sub = $8->rnode->lnode; /* index var */ 486 * and lnode is a field spec for field 0, we have `print $0'. 493 && $3->lnode->type == Node_field_spec 494 && $3->lnode->lnode->type == Node_val 495 && $3->lnode->lnode->numbr == 0.0)) 573 if (curr->lnode [all...] |
H A D | awkgram.c | 1606 if (yyvsp[-1].nodeval->lnode != NULL) { 1829 arr = yyvsp[0].nodeval->lnode; /* array var */ 1830 sub = yyvsp[0].nodeval->rnode->lnode; /* index var */ 1943 * and lnode is a field spec for field 0, we have `print $0'. 1950 && yyvsp[-1].nodeval->lnode->type == Node_field_spec 1951 && yyvsp[-1].nodeval->lnode->lnode->type == Node_val 1952 && yyvsp[-1].nodeval->lnode->lnode->numbr == 0.0)) 2045 if (curr->lnode [all...] |
H A D | array.c | 269 r = force_string(tree_eval(tree->lnode)); 286 r = force_string(tree_eval(tree->lnode)); 657 lhs = get_lhs(tree->lnode, & after_assign, FALSE); 804 a = tree->lnode; 1101 NODE *array = get_array(tree->lnode); 1104 NODE *dest = get_array(tree->rnode->lnode);
|
H A D | awk.h | 302 /* binary operators lnode and rnode are the expressions to work on */ 321 /* assignments lnode is the var to assign to, rnode is the exp */ 330 /* boolean binaries lnode and rnode are expressions */ 334 /* binary relationals compares lnode and rnode */ 348 Node_rule_list, /* lnode is a rule, rnode is rest of list */ 349 Node_rule_node, /* lnode is pattern, rnode is statement */ 350 Node_statement_list, /* lnode is statement, rnode is more list */ 351 Node_switch_body, /* lnode is the case list, rnode is default list */ 352 Node_case_list, /* lnode is the case, rnode is a statement list */ 353 Node_if_branches, /* lnode i 517 #define lnode macro [all...] |
H A D | field.c | 804 src = force_string(tree_eval(tree->lnode)); 806 arr = get_param(tree->rnode->lnode); 810 sep = tree->rnode->rnode->lnode;
|
H A D | node.c | 182 dummy->lnode = s;
|
H A D | io.c | 267 for (; i < (long) (ARGC_node->lnode->numbr); i++) { 796 tmp = force_string(tree_eval(tree->lnode)); /* 1st arg: redir to close */ 801 tmp2 = force_string(tree->rnode->lnode); 2280 if (tree->lnode == NULL) /* no optional var. */ 2286 lhs = get_lhs(tree->lnode, &after_assign, FALSE);
|
Completed in 122 milliseconds