Lines Matching defs:RegExpCompiler
787 class RegExpCompiler {
789 RegExpCompiler(int capture_count, bool ignore_case, bool is_ascii);
845 explicit RecursionCheck(RegExpCompiler
850 RegExpCompiler* compiler_;
861 RegExpCompiler::RegExpCompiler(int capture_count, bool ignore_case, bool ascii)
874 RegExpEngine::CompilationResult RegExpCompiler::Assemble(
966 int max_register = RegExpCompiler::kNoRegister;
1133 void Trace::Flush(RegExpCompiler* compiler, RegExpNode* successor) {
1192 void NegativeSubmatchSuccess::Emit(RegExpCompiler* compiler, Trace* trace) {
1219 void EndNode::Emit(RegExpCompiler* compiler, Trace* trace) {
1383 RegExpCompiler* compiler,
1406 RegExpCompiler* compiler,
1478 RegExpCompiler* compiler,
1488 RegExpCompiler* compiler,
1665 RegExpNode::LimitResult RegExpNode::LimitVersions(RegExpCompiler* compiler,
1680 if (compiler->recursion_depth() >= RegExpCompiler::kMaxRecursion) {
1697 compiler->recursion_depth() <= RegExpCompiler::kMaxRecursion) {
1712 if (recursion_depth > RegExpCompiler::kMaxRecursion) return 0;
1723 if (recursion_depth > RegExpCompiler::kMaxRecursion) return 0;
1739 if (recursion_depth > RegExpCompiler::kMaxRecursion) return 0;
1751 if (recursion_depth > RegExpCompiler::kMaxRecursion) return answer;
1762 if (recursion_depth > RegExpCompiler::kMaxRecursion) return 0;
1772 RegExpCompiler* compiler,
1786 if (recursion_depth > RegExpCompiler::kMaxRecursion) return 0;
1856 bool RegExpNode::EmitQuickCheck(RegExpCompiler* compiler,
1932 RegExpCompiler* compiler,
2156 RegExpCompiler* compiler,
2169 RegExpCompiler* compiler,
2218 static void EmitHat(RegExpCompiler* compiler,
2255 RegExpCompiler* compiler,
2294 RegExpCompiler* compiler,
2360 RegExpCompiler* compiler,
2374 void AssertionNode::Emit(RegExpCompiler* compiler, Trace* trace) {
2458 void TextNode::TextEmitPass(RegExpCompiler* compiler,
2557 void TextNode::Emit(RegExpCompiler* compiler, Trace* trace) {
2616 void Trace::AdvanceCurrentPositionInTrace(int by, RegExpCompiler* compiler) {
2676 if (recursion_depth++ > RegExpCompiler::kMaxRecursion) {
2705 void LoopChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
2727 int ChoiceNode::CalculatePreloadCharacters(RegExpCompiler* compiler,
2874 void ChoiceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
3050 void ChoiceNode::EmitOutOfLineContinuation(RegExpCompiler* compiler,
3092 void ActionNode::Emit(RegExpCompiler* compiler, Trace* trace) {
3151 bool has_minimum = (rep_reg != RegExpCompiler::kNoRegister);
3214 void BackReferenceNode::Emit(RegExpCompiler* compiler, Trace* trace) {
3617 RegExpNode* RegExpAtom::ToNode(RegExpCompiler* compiler,
3625 RegExpNode* RegExpText::ToNode(RegExpCompiler* compiler,
3716 RegExpNode* RegExpCharacterClass::ToNode(RegExpCompiler* compiler,
3722 RegExpNode* RegExpDisjunction::ToNode(RegExpCompiler* compiler,
3736 RegExpNode* RegExpQuantifier::ToNode(RegExpCompiler* compiler,
3752 RegExpExpansionLimiter(RegExpCompiler* compiler, int factor)
3777 RegExpCompiler* compiler_;
3789 RegExpCompiler* compiler,
3816 int body_start_reg = RegExpCompiler::kNoRegister;
3871 : RegExpCompiler::kNoRegister;
3920 RegExpNode* RegExpAssertion::ToNode(RegExpCompiler* compiler,
3973 RegExpNode* RegExpBackReference::ToNode(RegExpCompiler* compiler,
3981 RegExpNode* RegExpEmpty::ToNode(RegExpCompiler* compiler,
3987 RegExpNode* RegExpLookahead::ToNode(RegExpCompiler* compiler,
4039 RegExpNode* RegExpCapture::ToNode(RegExpCompiler* compiler,
4047 RegExpCompiler* compiler,
4057 RegExpNode* RegExpAlternative::ToNode(RegExpCompiler* compiler,
5261 RegExpCompiler compiler(data->capture_count, ignore_case, is_ascii);
