Lines Matching refs:RegExpTree
42 terms_(ZoneAllocator<RegExpTree*>{zone}),
43 text_(ZoneAllocator<RegExpTree*>{zone}),
44 alternatives_(ZoneAllocator<RegExpTree*>{zone}) {}
53 void AddAtom(RegExpTree* tree);
54 void AddTerm(RegExpTree* tree);
55 void AddAssertion(RegExpTree* tree);
60 RegExpTree* ToRegExp();
86 base::SmallVector<RegExpTree*, 8, ZoneAllocator<RegExpTree*>>;
194 RegExpTree* ParsePattern();
195 RegExpTree* ParseDisjunction();
196 RegExpTree* ParseGroup();
214 RegExpTree* ParseCharacterClass(const RegExpBuilder* state);
239 RegExpTree* ReportError(RegExpError error);
493 RegExpTree* RegExpParserImpl<CharT>::ReportError(RegExpError error) {
511 RegExpTree* RegExpParserImpl<CharT>::ParsePattern() {
512 RegExpTree* result = ParseDisjunction(CHECK_FAILED);
534 RegExpTree* RegExpParserImpl<CharT>::ParseDisjunction() {
561 RegExpTree* body = builder->ToRegExp();
649 RegExpTree* cc = ParseCharacterClass(builder CHECK_FAILED);
694 RegExpTree* atom = zone()->template New<RegExpBackReference>(
824 max = RegExpTree::kInfinity;
829 max = RegExpTree::kInfinity;
1290 // values. Values are truncated to RegExpTree::kInfinity if they overflow.
1304 if (min > (RegExpTree::kInfinity - next) / 10) {
1309 min = RegExpTree::kInfinity;
1322 max = RegExpTree::kInfinity;
1327 if (max > (RegExpTree::kInfinity - next) / 10) {
1331 max = RegExpTree::kInfinity;
1965 RegExpTree* RegExpParserImpl<CharT>::ParseCharacterClass(
2030 RegExpTree* tree = ParsePattern();
2101 RegExpTree* atom = zone()->New<RegExpAtom>(characters_->ToConstVector());
2178 void RegExpBuilder::AddAtom(RegExpTree* term) {
2193 void RegExpBuilder::AddTerm(RegExpTree* term) {
2199 void RegExpBuilder::AddAssertion(RegExpTree* assert) {
2210 RegExpTree* alternative;
2217 zone()->New<RegExpAlternative>(zone()->New<ZoneList<RegExpTree*>>(
2258 RegExpTree* RegExpBuilder::ToRegExp() {
2263 return zone()->New<RegExpDisjunction>(zone()->New<ZoneList<RegExpTree*>>(
2274 RegExpTree* atom;