Lines Matching refs:RegExpCompiler
993 class RegExpCompiler {
995 RegExpCompiler(int capture_count, bool ignore_case, bool is_one_byte,
1057 explicit RecursionCheck(RegExpCompiler* compiler) : compiler_(compiler) {
1062 RegExpCompiler* compiler_;
1073 RegExpCompiler::RegExpCompiler(int capture_count, bool ignore_case,
1089 RegExpEngine::CompilationResult RegExpCompiler::Assemble(
1184 int max_register = RegExpCompiler::kNoRegister;
1353 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) {
1414 void NegativeSubmatchSuccess::Emit(RegExpCompiler* compiler, Trace* trace) {
1441 void EndNode::Emit(RegExpCompiler* compiler, Trace* trace) {
1614 RegExpCompiler* compiler,
1637 RegExpCompiler* compiler,
1708 RegExpCompiler* compiler,
1718 RegExpCompiler* compiler,
2229 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler,
2244 if (compiler->recursion_depth() >= RegExpCompiler::kMaxRecursion) {
2261 compiler->recursion_depth() <= RegExpCompiler::kMaxRecursion) {
2360 RegExpCompiler* compiler,
2445 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler,
2528 RegExpCompiler* compiler,
2936 RegExpCompiler* compiler,
2963 RegExpCompiler* compiler,
3012 static void EmitHat(RegExpCompiler* compiler,
3047 void AssertionNode::EmitBoundaryCheck(RegExpCompiler* compiler, Trace* trace) {
3099 RegExpCompiler* compiler,
3131 RegExpCompiler* compiler,
3145 void AssertionNode::Emit(RegExpCompiler* compiler, Trace* trace) {
3225 void TextNode::TextEmitPass(RegExpCompiler* compiler,
3315 void TextNode::Emit(RegExpCompiler* compiler, Trace* trace) {
3374 void Trace::AdvanceCurrentPositionInTrace(int by, RegExpCompiler* compiler) {
3419 RegExpCompiler* compiler) {
3454 if (recursion_depth++ > RegExpCompiler::kMaxRecursion) {
3483 void LoopChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
3506 int ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler,
3634 int length, RegExpCompiler* compiler, Zone* zone)
3915 void ChoiceNode::SetUpPreLoad(RegExpCompiler* compiler,
3933 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
4005 Trace* ChoiceNode::EmitGreedyLoop(RegExpCompiler* compiler,
4052 int ChoiceNode::EmitOptimizedUnanchoredSearch(RegExpCompiler* compiler,
4103 void ChoiceNode::EmitChoices(RegExpCompiler* compiler,
4192 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler,
4234 void ActionNode::Emit(RegExpCompiler* compiler, Trace* trace) {
4293 bool has_minimum = (rep_reg != RegExpCompiler::kNoRegister);
4356 void BackReferenceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
4731 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler,
4740 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler,
4837 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler,
4843 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler,
4858 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler,
4874 RegExpExpansionLimiter(RegExpCompiler* compiler, int factor)
4899 RegExpCompiler* compiler_;
4911 RegExpCompiler* compiler,
4938 int body_start_reg = RegExpCompiler::kNoRegister;
4995 : RegExpCompiler::kNoRegister;
5046 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler,
5101 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler,
5110 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler,
5116 RegExpNode* RegExpLookahead::ToNode(RegExpCompiler* compiler,
5172 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler,
5180 RegExpCompiler* compiler,
5190 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler,
6041 RegExpCompiler compiler(data->capture_count, ignore_case, is_one_byte, zone);
6089 node = node->FilterOneByte(RegExpCompiler::kMaxRecursion, ignore_case);
6093 node = node->FilterOneByte(RegExpCompiler::kMaxRecursion, ignore_case);
