Lines Matching defs:that
2 // Use of this source code is governed by a BSD-style license that can be
48 bool Matches(NodeInfo* that) {
49 return (at_end == that->at_end) &&
50 (follows_word_interest == that->follows_word_interest) &&
51 (follows_newline_interest == that->follows_newline_interest) &&
52 (follows_start_interest == that->follows_start_interest);
57 void AddFromPreceding(NodeInfo* that) {
58 at_end |= that->at_end;
59 follows_word_interest |= that->follows_word_interest;
60 follows_newline_interest |= that->follows_newline_interest;
61 follows_start_interest |= that->follows_start_interest;
71 void AddFromFollowing(NodeInfo* that) {
72 follows_word_interest |= that->follows_word_interest;
73 follows_newline_interest |= that->follows_newline_interest;
74 follows_start_interest |= that->follows_start_interest;
118 // this many characters. This does not necessarily mean that there is a
124 // that start-of-string assertions (^) can't match. This value is greater than
143 // succeed. The not_at_start argument is used to indicate that we know we are
149 // given that this is a LoopChoiceNode whose counter register is in a
152 // LoopChoiceNode for the repetition must report that it consumes at least
154 // with a newly-initialized counter, it can report that it consumes at least
157 // Emits some quick code that checks whether the preloaded characters match.
173 // Fills in quick check details for this node, given that this is a
186 // Only returns the successor for a text node of length 1 that matches any
187 // character and that has no guards on it.
193 // Collects information on the possible code units (mod 128) that can match if
205 // If we know that the input is one-byte then there are some nodes that can
206 // never match. This method returns a node that can be substituted for
223 // node. Only info that is for this node is stored. We can tell that the
233 // on how often we allow that to happen before we insist on starting a new
234 // trace and generating generic code for a node that can be reused by flushing
248 // for very large choice nodes that can be generated by unicode property
400 TextNode(RegExpCharacterClass* that, bool read_backward,
405 elms_->Add(TextElement::CharClass(that), zone());
442 NON_LATIN1_MATCH, // Check for characters that can't match.
444 NON_LETTER_CHARACTER_MATCH, // Check characters that have no case equivs.
694 // alternative that is expected to fail. This is because quick check code
695 // starts by loading enough characters for the alternative that takes fewest
697 // part in that calculation (EatsAtLeast) so the assumptions don't hold.
770 #define DECLARE_VISIT(Type) virtual void Visit##Type(Type##Node* that) = 0;