Lines Matching defs:text
193 void RegExpTree::AppendToText(RegExpText* text, Zone* zone) { UNREACHABLE(); }
195 void RegExpAtom::AppendToText(RegExpText* text, Zone* zone) {
196 text->AddElement(TextElement::Atom(this), zone);
199 void RegExpCharacterClass::AppendToText(RegExpText* text, Zone* zone) {
200 text->AddElement(TextElement::CharClass(this), zone);
203 void RegExpText::AppendToText(RegExpText* text, Zone* zone) {
205 text->AddElement(elements()->at(i), zone);
1069 // character range (even non-Latin1 charset-based text has spaces and
1579 // We iterate along the text object, building up for each character a
1588 // Do not collect any quick check details if the text node reads backward,
2304 // We call this repeatedly to generate code for each pass over the text node.
2458 // This generates the code to match a text node. A text node can contain
2461 // pass from left to right. Instead we pass over the text node several times,
2575 // Later we will generate code for all these text nodes using recursion
2593 // Check that we can jump by the whole text length. If not, return sentinel
3143 // Here we have special handling for greedy loops containing only text nodes
3837 TextElement text = elements()->at(i);
3838 if (text.text_type() == TextElement::ATOM) {
3839 RegExpAtom* atom = text.atom();
3859 DCHECK_EQ(TextElement::CHAR_CLASS, text.text_type());
3860 RegExpCharacterClass* char_class = text.char_class();
3880 true); // Not at start after a text node.