Searched refs:RegExpTree (Results 1 - 10 of 10) sorted by relevance
| /third_party/node/deps/v8/src/regexp/ |
| H A D | regexp-ast.h | 37 class RegExpTree;
160 class RegExpTree : public ZoneObject { class
163 virtual ~RegExpTree() = default;
185 class RegExpDisjunction final : public RegExpTree {
187 explicit RegExpDisjunction(ZoneList<RegExpTree*>* alternatives);
196 ZoneList<RegExpTree*>* alternatives() const { return alternatives_; } in alternatives()
202 ZoneList<RegExpTree*>* alternatives_;
208 class RegExpAlternative final : public RegExpTree {
210 explicit RegExpAlternative(ZoneList<RegExpTree*>* nodes);
219 ZoneList<RegExpTree*>* node
[all...] |
| H A D | regexp-ast.cc | 19 RegExp##Name* RegExpTree::As##Name() { return nullptr; } \
20 bool RegExpTree::Is##Name() { return false; }
32 Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) { in ListCaptureRegisters()
78 ZoneList<RegExpTree*>* nodes = this->nodes(); in IsAnchoredAtStart()
80 RegExpTree* node = nodes->at(i); in IsAnchoredAtStart()
93 ZoneList<RegExpTree*>* nodes = this->nodes(); in IsAnchoredAtEnd()
95 RegExpTree* node = nodes->at(i); in IsAnchoredAtEnd()
108 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in IsAnchoredAtStart()
117 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in IsAnchoredAtEnd()
252 if (that->max() == RegExpTree in VisitQuantifier()
[all...] |
| H A D | regexp-parser.cc | 42 terms_(ZoneAllocator<RegExpTree*>{zone}), in RegExpBuilder()
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* ParsePatter
[all...] |
| H A D | regexp-compiler-tonode.cc | 510 int CompareFirstChar(RegExpTree* const* a, RegExpTree* const* b) { in CompareFirstChar()
527 int CompareFirstCharCaseInsensitive(RegExpTree* const* a, in CompareFirstCharCaseInsensitive()
528 RegExpTree* const* b) { in CompareFirstCharCaseInsensitive()
573 RegExpTree* const* a, RegExpTree* const* b) { in CompareFirstCharCaseInsensitive()
605 ZoneList<RegExpTree*>* alternatives = this->alternatives(); in SortConsecutiveAtoms()
610 RegExpTree* alternative = alternatives->at(i); in SortConsecutiveAtoms()
619 RegExpTree* alternative = alternatives->at(i); in SortConsecutiveAtoms()
639 auto compare_closure = [canonicalize](RegExpTree* cons in SortConsecutiveAtoms()
[all...] |
| H A D | regexp.h | 21 class RegExpTree;
29 RegExpTree* tree = nullptr;
31 // The compiled Node graph as produced by RegExpTree::ToNode methods.
|
| H A D | regexp-compiler.cc | 193 void RegExpTree::AppendToText(RegExpText* text, Zone* zone) { UNREACHABLE(); } in AppendToText()
3921 0, RegExpTree::kInfinity, false, in PreprocessRegExp()
|
| /third_party/node/deps/v8/src/regexp/experimental/ |
| H A D | experimental-compiler.cc | 26 static bool Check(RegExpTree* tree, RegExpFlags flags, int capture_count) { in Check()
49 for (RegExpTree* alt : *node->alternatives()) {
59 for (RegExpTree* child : *node->nodes()) {
104 (node->max() != RegExpTree::kInfinity &&
115 if (node->max() == RegExpTree::kInfinity) {
177 bool ExperimentalRegExpCompiler::CanBeHandled(RegExpTree* tree, in CanBeHandled()
298 static ZoneList<RegExpInstruction> Compile(RegExpTree* tree, in Compile()
370 ZoneList<RegExpTree*>& alts = *node->alternatives();
377 for (RegExpTree* child : *node->nodes()) {
570 if (node->max() == RegExpTree
[all...] |
| H A D | experimental-compiler.h | 18 // Checks whether a given RegExpTree can be compiled into an experimental
23 static bool CanBeHandled(RegExpTree* tree, RegExpFlags flags,
27 // ZoneList backed by the same Zone that is used in the RegExpTree argument.
28 static ZoneList<RegExpInstruction> Compile(RegExpTree* tree,
|
| H A D | experimental.h | 20 // TODO(mbid, v8:10765): This walks the RegExpTree, but it could also be
23 static bool CanBeHandled(RegExpTree* tree, RegExpFlags flags,
|
| H A D | experimental.cc | 17 bool ExperimentalRegExp::CanBeHandled(RegExpTree* tree, RegExpFlags flags, in CanBeHandled()
|
Completed in 21 milliseconds