Home
last modified time | relevance | path

Searched refs:RegExpTree (Results 1 – 7 of 7) sorted by relevance

/external/v8/src/regexp/
Dregexp-ast.h34 class RegExpTree; variable
162 RegExpTree* tree() const { return tree_; } in tree()
175 TextElement(TextType text_type, RegExpTree* tree) in TextElement()
180 RegExpTree* tree_;
184 class RegExpTree : public ZoneObject {
187 virtual ~RegExpTree() {} in ~RegExpTree()
209 class RegExpDisjunction final : public RegExpTree {
211 explicit RegExpDisjunction(ZoneList<RegExpTree*>* alternatives);
221 ZoneList<RegExpTree*>* alternatives() { return alternatives_; } in alternatives()
227 ZoneList<RegExpTree*>* alternatives_;
[all …]
Dregexp-ast.cc19 RegExp##Name* RegExpTree::As##Name() { return NULL; } \
20 bool RegExpTree::Is##Name() { return false; }
31 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
76 ZoneList<RegExpTree*>* nodes = this->nodes(); in IsAnchoredAtStart()
78 RegExpTree* node = nodes->at(i); in IsAnchoredAtStart()
91 ZoneList<RegExpTree*>* nodes = this->nodes(); in IsAnchoredAtEnd()
93 RegExpTree* node = nodes->at(i); in IsAnchoredAtEnd()
106 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in IsAnchoredAtStart()
115 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in IsAnchoredAtEnd()
248 if (that->max() == RegExpTree::kInfinity) { in VisitQuantifier()
[all …]
Dregexp-parser.h108 void AddAtom(RegExpTree* tree);
109 void AddAssertion(RegExpTree* tree);
113 RegExpTree* ToRegExp();
124 BufferedZoneList<RegExpTree, 2> terms_;
125 BufferedZoneList<RegExpTree, 2> text_;
126 BufferedZoneList<RegExpTree, 2> alternatives_;
145 RegExpTree* ParsePattern();
146 RegExpTree* ParseDisjunction();
147 RegExpTree* ParseGroup();
148 RegExpTree* ParseCharacterClass();
[all …]
Dregexp-parser.cc103 RegExpTree* RegExpParser::ReportError(Vector<const char> message) { in ReportError()
120 RegExpTree* RegExpParser::ParsePattern() { in ParsePattern()
121 RegExpTree* result = ParseDisjunction(CHECK_FAILED); in ParsePattern()
142 RegExpTree* RegExpParser::ParseDisjunction() { in ParseDisjunction()
168 RegExpTree* body = builder->ToRegExp(); in ParseDisjunction()
233 RegExpTree* atom = new (zone()) RegExpCharacterClass(ranges, false); in ParseDisjunction()
285 RegExpTree* atom = ParseCharacterClass(CHECK_FAILED); in ParseDisjunction()
321 RegExpTree* atom = new (zone()) RegExpCharacterClass(ranges, false); in ParseDisjunction()
345 RegExpTree* atom = new (zone()) RegExpBackReference(capture); in ParseDisjunction()
479 max = RegExpTree::kInfinity; in ParseDisjunction()
[all …]
Djsregexp.cc844 void RegExpTree::AppendToText(RegExpText* text, Zone* zone) { in AppendToText()
4830 int CompareFirstChar(RegExpTree* const* a, RegExpTree* const* b) { in CompareFirstChar()
4855 RegExpTree* const* a, RegExpTree* const* b) { in CompareFirstCharCaseIndependent()
4873 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in SortConsecutiveAtoms()
4878 RegExpTree* alternative = alternatives->at(i); in SortConsecutiveAtoms()
4887 RegExpTree* alternative = alternatives->at(i); in SortConsecutiveAtoms()
4904 [canonicalize](RegExpTree* const* a, RegExpTree* const* b) { in SortConsecutiveAtoms()
4920 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in RationalizeConsecutiveAtoms()
4926 RegExpTree* alternative = alternatives->at(i); in RationalizeConsecutiveAtoms()
4973 ZoneList<RegExpTree*>* pair = new (zone) ZoneList<RegExpTree*>(2, zone); in RationalizeConsecutiveAtoms()
[all …]
Djsregexp.h19 class RegExpTree; variable
1484 RegExpTree* tree;
/external/v8/test/cctest/
Dtest-regexp.cc394 CHECK_MIN_MAX("(ab)\\1", 2, RegExpTree::kInfinity); in TestRegExpParser()
395 CHECK_MIN_MAX("(ab|cde)\\1", 2, RegExpTree::kInfinity); in TestRegExpParser()
397 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity); in TestRegExpParser()
398 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity); in TestRegExpParser()
400 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity); in TestRegExpParser()
401 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity); in TestRegExpParser()
403 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity); in TestRegExpParser()
404 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity); in TestRegExpParser()
406 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity); in TestRegExpParser()
407 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity); in TestRegExpParser()
[all …]