Searched refs:kNodeIsTooComplexForGreedyLoops (Results 1 – 2 of 2) sorted by relevance
607 static const int kNodeIsTooComplexForGreedyLoops = -1; variable608 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()791 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()
3455 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3458 if (node_length == kNodeIsTooComplexForGreedyLoops) { in GreedyLoopTextLengthForAlternative()3459 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLengthForAlternative()3489 DCHECK(text_length != kNodeIsTooComplexForGreedyLoops); in Emit()3958 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) { in Emit()