Lines Matching defs:node
46 // Returns true if the interests and assumptions of this node
55 // Updates the interests of this node given the interests of the
56 // node preceding it.
69 // Sets the interests of this node to include the interests of the
70 // following node.
85 // These bits are set of this node has to know what the preceding
117 // Any successful match starting from the current node will consume at least
140 // Generates a goto to this node or actually generates the code at this point.
142 // How many characters must this node consume at a minimum in order to
146 // on success. If this node has not been analyzed yet, EatsAtLeast returns 0.
148 // Returns how many characters this node must consume in order to succeed,
159 // If the node cannot make a quick check it does nothing and returns false.
167 // A comparison failure indicates the node cannot match the next n characters.
168 // A comparison success indicates the node may match.
173 // Fills in quick check details for this node, given that this is a
178 // continuation node. However, with a newly-initialized counter, it can
186 // Only returns the successor for a text node of length 1 that matches any
206 // never match. This method returns a node that can be substituted for
207 // itself, or nullptr if the node can never match.
223 // node. Only info that is for this node is stored. We can tell that the
224 // info is for this node when offset == 0, so the information is calculated
225 // relative to this node.
231 // If non-generic code is generated for a node (i.e. the node is not at the
234 // trace and generating generic code for a node that can be reused by flushing
283 // this node (in different traces). We don't keep track of where the
298 void set_on_success(RegExpNode* node) { on_success_ = node; }
589 explicit GuardedAlternative(RegExpNode* node)
590 : node_(node), guards_(nullptr) {}
592 RegExpNode* node() { return node_; }
593 void set_node(RegExpNode* node) { node_ = node; }
612 void AddAlternative(GuardedAlternative node) {
613 alternatives()->Add(node, zone());
661 // If true, this node is never checked at the start of the input.
688 return alternatives()->at(kLookaroundIndex).node();
691 return alternatives()->at(kContinueIndex).node();
739 // should not be added freely, we need to keep track of which node
740 // goes back to the node itself.
741 void AddAlternative(GuardedAlternative node) {
742 ChoiceNode::AddAlternative(node);
751 // whether GetQuickCheckDetails traversed the initialization node for this
753 // because we know the loop node must match at least min_loop_iterations_
754 // times before the continuation node can match.