Lines Matching full:jump
86 void Generator::generateIncrementIndex(Jump* failure)
136 Jump skipIfEmpty = branch32(Equal, Address(output, ((2 * subpatternId) + 1) * sizeof(int)), character);
155 Jump start = jump();
160 failures.append(jump());
203 // (1) Greedily read as many copies of the atom as possible, then jump to (2).
208 jump(readAtom);
210 doneReadingAtomsList.append(jump());
213 doneReadingAtomsList.append(jump());
219 failures.append(jump());
307 Jump isUpper;
348 Jump loOrAbove = branch32(GreaterThanOrEqual, character, Imm32((unsigned short)lo));
358 failures.append(jump());
362 Jump loOrAbove = branch32(GreaterThanOrEqual, character, Imm32((unsigned short)lo));
365 failures.append(jump());
386 Jump unicodeFail;
388 Jump isAscii = branch32(LessThanOrEqual, character, Imm32(0x7f));
402 Jump below = branch32(LessThan, character, Imm32(lo));
408 unicodeFail = jump();
457 failures.append(jump());
470 Jump success = jump();
474 failures.append(jump());
489 failures.append(jump());
496 void Generator::generateParenthesesNonGreedy(JumpList& failures, Label start, Jump success, Jump fail)
498 jump(start);
503 Generator::Jump
505 Jump skip = jump();
512 Jump newFailJump = jump();
530 failures.append(jump());
544 failures.append(jump());
559 Jump atBegin = branch32(Equal, index, Imm32(0));
572 notWordBoundary.append(jump());
586 wordBoundary.append(jump());
608 Jump skipIncrement = jump();
616 Jump endOfBackRef = branch32(Equal, Address(output, ((2 * subpatternId) + 1) * sizeof(int)), repeatCount);
621 Jump endOfInput = branch32(Equal, length, index);
630 failures.append(jump());
640 successes.append(jump());
