Searched refs:kNodeIsTooComplexForGreedyLoops (Results 1 – 2 of 2) sorted by relevance
486 static const int kNodeIsTooComplexForGreedyLoops = kMinInt; variable487 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()642 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()
3438 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3441 if (node_length == kNodeIsTooComplexForGreedyLoops) { in GreedyLoopTextLengthForAlternative()3442 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3472 DCHECK(text_length != kNodeIsTooComplexForGreedyLoops); in Emit()3941 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) { in Emit()