Lines Matching refs:nodes
234 stream->nodes = antlr3VectorNew(DEFAULT_INITIAL_BUFFER_SIZE);
237 // Install the navigation nodes
240 // Install the navigation nodes
380 stream->nodes = antlr3VectorNew(hint);
383 // Install the navigation nodes
442 if (ctns->nodes != NULL)
444 ctns->nodes ->free (ctns->nodes);
469 /// Walk tree with depth-first-search and fill nodes buffer.
470 /// Don't add in DOWN, UP nodes if the supplied tree is a list (t is isNilNode)
487 ctns->nodes->add(ctns->nodes, t, NULL);
523 /// Reset the input stream to the start of the input nodes.
563 return tns->ctns->nodes->get(tns->ctns->nodes, tns->ctns->p - k);
567 /// i<0 indicates nodes in the past. So -1 is previous node and -2 is
568 /// two nodes ago. LT(0) is undefined. For i>=n, return null.
595 if (( tns->ctns->p + k - 1) >= (ANTLR3_INT32)(tns->ctns->nodes->count))
600 return tns->ctns->nodes->get(tns->ctns->nodes, tns->ctns->p + k - 1);
603 /// Where is this stream pulling nodes from? This is not the name, but
683 /// wipe out the lookahead which will force reloading a few nodes
700 /// spit out the navigation nodes.
744 return ctns->nodes->size(ctns->nodes);
747 /// As we flatten the tree, we use UP, DOWN nodes to represent
748 /// the tree structure. When debugging we need unique nodes
783 ctns->nodes->add(ctns->nodes, node, NULL);
806 /// Print out the entire tree including DOWN/UP nodes. Uses
950 return tns->ctns->nodes->get(tns->ctns->nodes, k);
