Lines Matching defs:node
461 // Returns true if the interests and assumptions of this node
470 // Updates the interests of this node given the interests of the
471 // node preceding it.
485 // Sets the interests of this node to include the interests of the
486 // following node.
501 // These bits are set of this node has to know what the preceding
553 // the same for all branches of a choice node.
576 // Generates a goto to this node or actually generates the code at this point.
578 // How many characters must this node consume at a minimum in order to
588 // If the node cannot make a quick check it does nothing and returns false.
597 // A comparison failure indicates the node cannot match the next n characters.
598 // A comparison success indicates the node may match.
605 // Only returns the successor for a text node of length 1 that matches any
626 // never match. This method returns a node that can be substituted for
627 // itself, or NULL if the node can never match.
641 // node. Only info that is for this node is stored. We can tell that the
642 // info is for this node when offset == 0, so the information is calculated
643 // relative to this node.
649 // If non-generic code is generated for a node (i.e. the node is not at the
652 // trace and generating generic code for a node that can be reused by flushing
679 // this node (in different traces). We don't keep track of where the
722 void set_on_success(RegExpNode* node) { on_success_ = node; }
1030 explicit GuardedAlternative(RegExpNode* node) : node_(node), guards_(NULL) { }
1032 RegExpNode* node() { return node_; }
1033 void set_node(RegExpNode* node) { node_ = node; }
1055 void AddAlternative(GuardedAlternative node) {
1056 alternatives()->Add(node, zone());
1100 // If true, this node is never checked at the start of the input.
1125 alternatives_->at(1).node()->FillInBMInfo(
1166 // should not be added freely, we need to keep track of which node
1167 // goes back to the node itself.
1168 void AddAlternative(GuardedAlternative node) {
1169 ChoiceNode::AddAlternative(node);
1318 // There are many ways to generate code for a node. This class encapsulates
1322 // expression. A given node in the regexp can be code-generated several times
1417 // actions in the trace. The location of the code generated for a node using
1418 // a trivial trace is recorded in a label in the node so that gotos can be
1453 void set_stop_node(RegExpNode* node) { stop_node_ = node; }
1493 virtual void Visit##Type(Type##Node* that) = 0;
1500 // Node visitor used to add the start set of the alternatives to the
1501 // dispatch table of a choice node.
1511 void BuildTable(ChoiceNode* node);
1520 virtual void Visit##Type(Type##Node* that);
1553 void EnsureAnalyzed(RegExpNode* node);
1556 virtual void Visit##Type(Type##Node* that);
1582 node(NULL),
1587 RegExpNode* node;
1619 static void DotPrint(const char* label, RegExpNode* node, bool ignore_case);
