Searched refs:kNodeIsTooComplexForGreedyLoops (Results 1 – 2 of 2) sorted by relevance
507 static const int kNodeIsTooComplexForGreedyLoops = -1; variable508 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()644 virtual int GreedyLoopTextLength() { return kNodeIsTooComplexForGreedyLoops; } in GreedyLoopTextLength()
2476 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLength()2479 if (node_length == kNodeIsTooComplexForGreedyLoops) { in GreedyLoopTextLength()2480 return kNodeIsTooComplexForGreedyLoops; in GreedyLoopTextLength()2508 ASSERT(text_length != kNodeIsTooComplexForGreedyLoops); in Emit()2705 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) { in Emit()