Searched refs:kNodeIsTooComplexForGreedyLoops (Results 1 – 2 of 2) sorted by relevance
499 static const int kNodeIsTooComplexForGreedyLoops = kMinInt; variable500 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()653 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()
3418 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3421 if (node_length == kNodeIsTooComplexForGreedyLoops) { in GreedyLoopTextLengthForAlternative()3422 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3452 DCHECK_NE(kNodeIsTooComplexForGreedyLoops, text_length); in Emit()3928 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) { in Emit()