Lines Matching full:greedy
683 // * Simple greedy loops store reduced backtracking information.
1667 // If we are generating a greedy loop then don't stop and don't reuse code.
2667 // value indicating that a greedy loop cannot be constructed.
2712 // optimization for greedy loops (see below).
2845 * For greedy loops we reverse our expectation and expect to match rather
2847 * unwind code that steps back in the greedy loop). The following alternatives
2910 // Here we have special handling for greedy loops containing only text nodes
2933 Label second_choice; // For use in greedy matches.
