Lines Matching defs:node
105 * if it is deleting the next node to be used by a loop.
152 * Assign to a variable node.
163 /* short circuit assignment of a node to itself */
239 * Assign to an l-value node.
259 * If it's a parameter then link to the actual value node and
281 * Compiled tree non-terminal node.
284 node(int type, NODE *left, NODE *right)
296 * Create an integer node.
310 * Create a real number node.
324 * Make a node for a string.
367 * Allocate an empty node of given type.
368 * String space for the node is given by `length'.
393 * Free a node.
486 * Delete the given node from the symbol table.
487 * If fflag is non-zero, also free the node space.
579 * Save the parent node and evaluate the pattern.
727 * get pointer to the node for this array
940 * Return pointer to node with concatenation of operands of CONCAT node.
945 * operand is not a CONCAT node.
996 * Reduce an expression to a terminal node.
1010 * a var or constant is a leaf-node (no further reduction required)
1016 * If it's a parameter then it is probably a leaf node but it
1456 * The node must be a FSTRING type and the return value
1584 * Return the unevaluated node as one doesn't always need it
1809 /* if node is a local array, free the elements */
1972 * At this point if the node is not actually an array
1989 * Set up a pointer to the first node in the array list.
1992 * that might be pointing at a node which has been deleted.
2099 * The node (np) is the list of indices and 'array' is the array name.
2182 * Promote a node to an array. In the simplest case, just set the
2183 * node type field to ARRAY. The more complicated case involves walking
2195 * setting each node to type array.