Lines Matching refs:RegExpCompiler

963 class RegExpCompiler {  class
965 RegExpCompiler(Isolate* isolate, Zone* zone, int capture_count,
1064 explicit RecursionCheck(RegExpCompiler* compiler) : compiler_(compiler) { in RecursionCheck()
1069 RegExpCompiler* compiler_;
1080 RegExpCompiler::RegExpCompiler(Isolate* isolate, Zone* zone, int capture_count, in RegExpCompiler() function in v8::internal::RegExpCompiler
1102 RegExpEngine::CompilationResult RegExpCompiler::Assemble( in Assemble()
1195 int max_register = RegExpCompiler::kNoRegister; in FindAffectedRegisters()
1365 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) { in Flush()
1431 void NegativeSubmatchSuccess::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
1458 void EndNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
1634 RegExpCompiler* compiler, in EmitSimpleCharacter()
1657 RegExpCompiler* compiler, in EmitAtomNonLetter()
1728 RegExpCompiler* compiler,
1738 RegExpCompiler* compiler, in EmitAtomLetter()
2236 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler, in LimitVersions()
2278 bool RegExpNode::KeepRecursing(RegExpCompiler* compiler) { in KeepRecursing()
2280 compiler->recursion_depth() <= RegExpCompiler::kMaxRecursion; in KeepRecursing()
2367 QuickCheckDetails* details, RegExpCompiler* compiler, int filled_in, in GetQuickCheckDetails()
2451 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler, in EmitQuickCheck()
2536 RegExpCompiler* compiler, in GetQuickCheckDetails()
2947 RegExpCompiler* compiler, in GetQuickCheckDetails()
2972 RegExpCompiler* compiler, in GetQuickCheckDetails()
3021 static void EmitHat(RegExpCompiler* compiler, in EmitHat()
3056 void AssertionNode::EmitBoundaryCheck(RegExpCompiler* compiler, Trace* trace) { in EmitBoundaryCheck()
3109 RegExpCompiler* compiler, in BacktrackIfPrevious()
3141 RegExpCompiler* compiler, in GetQuickCheckDetails()
3155 void AssertionNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
3235 void TextNode::TextEmitPass(RegExpCompiler* compiler, in TextEmitPass()
3354 void TextNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
3416 void Trace::AdvanceCurrentPositionInTrace(int by, RegExpCompiler* compiler) { in AdvanceCurrentPositionInTrace()
3454 RegExpCompiler* compiler) { in GetSuccessorOfOmnivorousTextNode()
3488 if (recursion_depth++ > RegExpCompiler::kMaxRecursion) { in GreedyLoopTextLengthForAlternative()
3517 void LoopChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
3540 int ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler, in CalculatePreloadCharacters()
3670 int length, RegExpCompiler* compiler, Zone* zone) in BoyerMooreLookahead()
3951 void ChoiceNode::SetUpPreLoad(RegExpCompiler* compiler, in SetUpPreLoad()
3969 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
4046 Trace* ChoiceNode::EmitGreedyLoop(RegExpCompiler* compiler, in EmitGreedyLoop()
4093 int ChoiceNode::EmitOptimizedUnanchoredSearch(RegExpCompiler* compiler, in EmitOptimizedUnanchoredSearch()
4145 void ChoiceNode::EmitChoices(RegExpCompiler* compiler, in EmitChoices()
4231 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler, in EmitOutOfLineContinuation()
4273 void ActionNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
4332 bool has_minimum = (rep_reg != RegExpCompiler::kNoRegister); in Emit()
4395 void BackReferenceNode::Emit(RegExpCompiler* compiler, Trace* trace) { in Emit()
4778 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler, in ToNode()
4788 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler, in ToNode()
4943 void AddBmpCharacters(RegExpCompiler* compiler, ChoiceNode* result, in AddBmpCharacters()
4952 void AddNonBmpSurrogatePairs(RegExpCompiler* compiler, ChoiceNode* result, in AddNonBmpSurrogatePairs()
5013 RegExpCompiler* compiler, ZoneList<CharacterRange>* lookbehind, in NegativeLookaroundAgainstReadDirectionAndMatch()
5030 RegExpCompiler* compiler, ZoneList<CharacterRange>* match, in MatchAndNegativeLookaroundInReadDirection()
5045 void AddLoneLeadSurrogates(RegExpCompiler* compiler, ChoiceNode* result, in AddLoneLeadSurrogates()
5071 void AddLoneTrailSurrogates(RegExpCompiler* compiler, ChoiceNode* result, in AddLoneTrailSurrogates()
5096 RegExpNode* UnanchoredAdvance(RegExpCompiler* compiler, in UnanchoredAdvance()
5111 void AddUnicodeCaseEquivalents(RegExpCompiler* compiler, in AddUnicodeCaseEquivalents()
5150 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler, in ToNode()
5230 bool RegExpDisjunction::SortConsecutiveAtoms(RegExpCompiler* compiler) { in SortConsecutiveAtoms()
5276 void RegExpDisjunction::RationalizeConsecutiveAtoms(RegExpCompiler* compiler) { in RationalizeConsecutiveAtoms()
5362 RegExpCompiler* compiler) { in FixSingleCharacterDisjunctions()
5414 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler, in ToNode()
5440 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler, in ToNode()
5456 RegExpExpansionLimiter(RegExpCompiler* compiler, int factor) in RegExpExpansionLimiter()
5481 RegExpCompiler* compiler_;
5493 RegExpCompiler* compiler, in ToNode()
5520 int body_start_reg = RegExpCompiler::kNoRegister; in ToNode()
5579 : RegExpCompiler::kNoRegister; in ToNode()
5630 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler, in ToNode()
5684 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler, in ToNode()
5693 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler, in ToNode()
5740 RegExpNode* RegExpLookaround::ToNode(RegExpCompiler* compiler, in ToNode()
5763 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler, in ToNode()
5771 RegExpCompiler* compiler, in ToNode()
5783 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler, in ToNode()
6589 RegExpNode* OptionallyStepBackToLeadSurrogate(RegExpCompiler* compiler, in OptionallyStepBackToLeadSurrogate()
6630 RegExpCompiler compiler(isolate, zone, data->capture_count, flags, in Compile()
6676 node = node->FilterOneByte(RegExpCompiler::kMaxRecursion, ignore_case); in Compile()
6680 node = node->FilterOneByte(RegExpCompiler::kMaxRecursion, ignore_case); in Compile()