Lines Matching full:loop
331 // TODO: optimize this loop by efficiently scanning for '$' or '\',
341 // loop iteration.
580 // to avoid sending find() into a loop on zero-length matches.
642 // match at the end of a string, so we must make sure that the loop
765 // match at the end of a string, so we must make sure that the loop
793 // match at the end of a string, so we must make sure that the loop
875 // to avoid sending find() into a loop on zero-length matches.
926 // match at the end of a string, so we must make sure that the loop
1031 // match at the end of a string, so we must make sure that the loop
1057 // match at the end of a string, so we must make sure that the loop
2042 // Loop through the input text, searching for the delimiter pattern
2049 // Fill the last output string with whatever is left from the input, then exit the loop.
2540 // The engine will pick that up and stop in its outer loop.
2684 // Main loop for interpreting the compiled pattern.
2685 // One iteration of the loop per pattern operation performed.
2854 // The match loop will exit via this path on a successful match,
3511 // data address of the input position at the start of the loop.
3521 // The match did make progress. Repeat the loop.
3527 // execution will fall out of the loop.
3534 fp->fExtra[opValue] = 0; // Set the loop counter variable to zero
3578 fp->fPatIdx = opValue + 4; // Loop back.
3584 // Initialize a non-greedy loop
3586 fp->fExtra[opValue] = 0; // Set the loop counter variable to zero
3626 // The loop has matched the maximum permitted number of times.
3635 // Loop back for another one.
3636 fp->fPatIdx = opValue + 4; // Loop back.
3640 // a state save to the top of the loop, so that a failure
3641 // in the following pattern will try another iteration of the loop.
3727 fp = (REStackFrame *)fStack->popFrame(fFrameSize); // FAIL, no progress in loop.
3954 // Positive Look-Behind, at top of loop checking for matches of LB expression
3968 // First time through loop.
3971 // 2nd through nth time through the loop.
3994 // Save state to this URX_LB_CONT op, so failure to match will repeat the loop.
3995 // (successful match will fall off the end of the loop.)
4028 // Negative Look-Behind, at top of loop checking for matches of LB expression
4044 // First time through loop.
4047 // 2nd through nth time through the loop.
4070 // Save state to this URX_LB_CONT op, so failure to match will repeat the loop.
4071 // (successful match will cause a FAIL out of the loop altogether.)
4117 // Loop Initialization for the optimized implementation of
4126 // Loop through input, until either the input is exhausted or
4148 // If there were no matching characters, skip over the loop altogether.
4149 // The loop doesn't run at all, a * op always succeeds.
4178 // Loop Initialization for the optimized implementation of .*
4182 // Loop through input until the input is exhausted (we reach an end-of-line)
4204 // char is a line ending. Exit the scanning loop.
4212 // If there were no matching characters, skip over the loop altogether.
4213 // The loop doesn't run at all, a * op always succeeds.
4247 // We've backed up the input idx to the point that the loop started.
4248 // The loop is done. Leave here without saving state.
4252 // Set up for the next iteration of the loop, with input index
4255 // (We're going backwards because this loop emulates stack unwinding, not
4393 // Main loop for interpreting the compiled pattern.
4394 // One iteration of the loop per pattern operation performed.
4560 // The match loop will exit via this path on a successful match,
5183 // data address of the input position at the start of the loop.
5193 // The match did make progress. Repeat the loop.
5199 // execution will fall out of the loop.
5206 fp->fExtra[opValue] = 0; // Set the loop counter variable to zero
5250 fp->fPatIdx = opValue + 4; // Loop back.
5256 // Initialize a non-greedy loop
5258 fp->fExtra[opValue] = 0; // Set the loop counter variable to zero
5298 // The loop has matched the maximum permitted number of times.
5307 // Loop back for another one.
5308 fp->fPatIdx = opValue + 4; // Loop back.
5312 // a state save to the top of the loop, so that a failure
5313 // in the following pattern will try another iteration of the loop.
5405 loop.
5626 // Positive Look-Behind, at top of loop checking for matches of LB expression
5640 // First time through loop.
5643 // 2nd through nth time through the loop.
5664 // Save state to this URX_LB_CONT op, so failure to match will repeat the loop.
5665 // (successful match will fall off the end of the loop.)
5698 // Negative Look-Behind, at top of loop checking for matches of LB expression
5714 // First time through loop.
5717 // 2nd through nth time through the loop.
5738 // Save state to this URX_LB_CONT op, so failure to match will repeat the loop.
5739 // (successful match will cause a FAIL out of the loop altogether.)
5785 // Loop Initialization for the optimized implementation of
5794 // Loop through input, until either the input is exhausted or
5817 // If there were no matching characters, skip over the loop altogether.
5818 // The loop doesn't run at all, a * op always succeeds.
5847 // Loop Initialization for the optimized implementation of .*
5851 // Loop through input until the input is exhausted (we reach an end-of-line)
5874 // line ending char, and exit the scanning loop.
5882 // If there were no matching characters, skip over the loop altogether.
5883 // The loop doesn't run at all, a * op always succeeds.
5917 // We've backed up the input idx to the point that the loop started.
5918 // The loop is done. Leave here without saving state.
5922 // Set up for the next iteration of the loop, with input index
5925 // (We're going backwards because this loop emulates stack unwinding, not
