Lines Matching defs:last_node
195 // start of the sequence in bytecode and last_node is the last
198 const BytecodeSequenceNode& last_node);
685 int start_pc, const byte* bytecode, const BytecodeSequenceNode& last_node) {
695 uint32_t bc = last_node.OptimizedBytecode();
698 for (size_t arg = 0; arg < last_node.ArgumentSize(); arg++) {
699 BytecodeArgumentMapping arg_map = last_node.ArgumentMapping(arg);
722 RegExpBytecodeLength(last_node.OptimizedBytecode()));
725 if (last_node.HasIgnoredArguments()) {
726 for (auto ignored_arg = last_node.ArgumentIgnoredBegin();
727 ignored_arg != last_node.ArgumentIgnoredEnd(); ignored_arg++) {
743 int fixup_length = RegExpBytecodeLength(bc) - last_node.SequenceLength();
758 int preserve_from = start_pc + last_node.SequenceLength();
760 jump_candidate_destination < start_pc + last_node.SequenceLength()) {
769 start_pc + last_node.SequenceLength();
780 int preserve_length = start_pc + last_node.SequenceLength() - preserve_from;
784 start_pc + last_node.SequenceLength() - preserve_length);
796 AddJumpSourceFixup(fixup_length, start_pc + last_node.SequenceLength());