Lines Matching refs:jump
164 failures.append(jump());
171 failures.append(jump());
219 unicodeFail = jump();
333 jump(Address(stackPointerRegister, frameLocation * sizeof(void*)));
508 // - A jump list of jumps, to be linked to code that will backtrack them
522 // Add a jump or jumps, a return address, or set the flag indicating
524 void append(const Jump& jump)
526 m_laterFailures.append(jump);
566 assembler->jump(label);
581 jumpList.append(assembler->jump());
622 // to many terms; terms commonly jump out of the forwards matching path
645 op.m_jumps.append(jump());
651 op.m_jumps.append(jump());
675 op.m_jumps.append(jump());
683 op.m_jumps.append(jump());
727 nonWordCharThenWordChar.append(jump());
730 nonWordCharThenNonWordChar.append(jump());
734 // We jump here if the last character was a wordchar.
740 wordCharThenWordChar.append(jump());
773 op.m_jumps.append(jump());
820 op.m_jumps.append(jump());
939 jump(loop);
962 jump(op.m_reentry);
1000 jump(op.m_reentry);
1022 op.m_jumps.append(jump());
1053 op.m_jumps.append(jump());
1086 failures.append(jump());
1094 failures.append(jump());
1096 jump(loop);
1116 jump(op.m_reentry);
1154 nonGreedyFailures.append(jump());
1161 jump(op.m_reentry);
1192 saveStartIndex.append(jump());
1214 jump(findEOLLoop);
1401 // point to jump to when the last alternative fails. Again, this expects the input
1481 // jump to the end - Next nodes use the End node's m_jumps list to hold this
1485 // 'return address' using a DataLabelPtr, used to store the address to jump
1524 // If we reach here then the last alternative has matched - jump to the
1528 // small). We could avoid this either by adding an extra jump to the JIT
1538 endOp->m_jumps.append(jump());
1604 // and plant a jump to the end. We'll also plant a label to backtrack to
1613 op.m_jumps.append(jump());
1667 // If the parentheses are quantified Greedy then add a label to jump back
1669 // parentheses, link the jump from before the subpattern to here.
1709 jump(beginOp.m_reentry);
1711 // This is the entry point to jump to when we stop matching - we will
1742 // as a failure, so jump to backtracking.
1744 op.m_jumps.append(jump());
1814 // need to jump to try to match the next alternative.
1871 jump(beginOp->m_reentry);
1915 jump(nextOp->m_reentry);
1926 // alternatives we are done - just jump back up into the forwards matching path at the End.
1929 jump(endOp.m_reentry);
1978 // input check here - jump straight back up to the start of the first alternative.
1980 jump(beginOp->m_reentry);
1987 jump(firstInputCheckFailed);
1990 // We jump to here if we iterate to the point that there is insufficient input to
2014 // there are more alternatives we need to jump to the next alternative,
2033 // Set the backtracks to jump to the appropriate place. We may need
2041 // jump anywhere - if the alternative fails to match we can just
2045 // need to jump to return back out to the beginning. We'll do so by
2046 // adding a jump to the End node's m_jumps list, and linking this
2048 // than the last, we need to jump to the next alternative.
2051 // backtracking to here, correct, and then jump on. If not we can
2058 // An alternative that is not the last should jump to its successor.
2059 jump(nextOp.m_reentry);
2061 // The last of more than one alternatives must jump back to the beginning.
2062 nextOp.m_jumps.append(jump());
2070 // An alternative that is not the last should jump to its successor.
2073 // The last of more than one alternatives must jump back to the beginning.
2079 // If there is a backtrack jump from a zero length match link it here.
2084 // Now link any backtracks that need to jump to here.
2092 // have planted a jump to be linked to the end. This jump was added to the
2115 // If there is a backtrack jump from a zero length match link it here.
2121 // into the end of a non-simple set of alterntives we need to jump
2126 // Plant a jump to the return address.
2156 // out of the start of the parentheses, or jump back to the forwards
2170 // If Greedy, jump to the end.
2176 jump(m_ops[op.m_nextOp].m_reentry);
2178 // will jump back to here.
2228 // quantified with a minimum of zero) jump back to the forwards matching
2255 // is treated as a successful match - jump to the end of the
2259 jump(endOp.m_reentry);
2264 // The End node's jump list will contain any backtracks into