Lines Matching defs:node
93 // the same for all branches of a choice node.
218 // There are many ways to generate code for a node. This class encapsulates
222 // expression. A given node in the regexp can be code-generated several times
318 // actions in the trace. The location of the code generated for a node using
319 // a trivial trace is recorded in a label in the node so that gotos can be
348 void set_stop_node(RegExpNode* node) { stop_node_ = node; }
405 RegExpNode* node);
501 // Preprocessing is the final step of node creation before analysis
514 inline void AddWork(RegExpNode* node) {
515 if (!node->on_work_list() && !node->label()->is_bound()) {
516 node->set_on_work_list(true);
517 work_list_->push_back(node);
553 // The recursive nature of ToNode node generation means we may run into stack
557 // mechanism or iterative node generation.