Searched refs:kNodeIsTooComplexForGreedyLoops (Results 1 – 2 of 2) sorted by relevance
469 static const int kNodeIsTooComplexForGreedyLoops = kMinInt; variable470 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()625 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()
3490 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3493 if (node_length == kNodeIsTooComplexForGreedyLoops) { in GreedyLoopTextLengthForAlternative()3494 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3524 DCHECK(text_length != kNodeIsTooComplexForGreedyLoops); in Emit()4000 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) { in Emit()