[Interpreter] Preserve source positions in peephole optimizer.

test/cctest/interpreter/bytecode_expectations/BasicLoops.golden

 #
 # Autogenerated by generate-bytecode-expectations.
 #
 
 ---
 pool type: mixed
 execute: yes
 wrap: yes
 
 ---
 snippet: "
   var x = 0;
   while (false) { x = 99; break; continue; }
   return x;
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 5
+bytecode array length: 6
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
+  /*   88 S> */ B(Nop),
   /*   98 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0;
   while (false) {
     x = x + 1;
   };
   return x;
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 5
+bytecode array length: 6
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
+  /*   77 S> */ B(Nop),
   /*   87 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0;
   var y = 1;
   while (x < 10) {
     y = y * 12;
     x = x + 1;
     if (x == 3) continue;
     if (x == 4) break;
   }
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 66
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
   /*   53 E> */ B(Star), R(1),
   /*   65 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(10),
   /*   65 E> */ B(TestLessThan), R(2),
                 B(JumpIfFalse), U8(47),
   /*   56 E> */ B(StackCheck),
   /*   75 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(12),
                 B(Mul), R(2),
-  /*   77 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   89 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Add), R(2),
-  /*   91 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*  102 S> */ B(Star), R(2),
                 B(LdaSmi), U8(3),
   /*  108 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*  114 S> */ B(Jump), U8(14),
   /*  126 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(4),
   /*  132 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
@@ skipping 108 matching lines @@
   /*  105 S> */ B(Ldar), R(0),
                 B(Star), R(1),
                 B(LdaSmi), U8(1),
                 B(Add), R(1),
   /*  107 E> */ B(Star), R(0),
                 B(Jump), U8(-33),
   /*  122 S> */ B(Ldar), R(0),
                 B(Star), R(1),
                 B(LdaSmi), U8(1),
                 B(Add), R(1),
-  /*  124 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*  135 S> */ B(Jump), U8(4),
                 B(Jump), U8(-48),
   /*  144 S> */ B(Ldar), R(0),
   /*  154 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 10;
   var y = 1;
   while (x) {
     y = y * 12;
     x = x - 1;
   }
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 39
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(10),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   54 S> */ B(LdaSmi), U8(1),
   /*   54 E> */ B(Star), R(1),
   /*   64 S> */ B(Ldar), R(0),
                 B(JumpIfToBooleanFalse), U8(25),
   /*   57 E> */ B(StackCheck),
   /*   71 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(12),
                 B(Mul), R(2),
-  /*   73 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   85 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Sub), R(2),
   /*   87 E> */ B(Star), R(0),
                 B(Jump), U8(-25),
   /*   98 S> */ B(Ldar), R(1),
   /*  108 S> */ B(Return),
 ]
 constant pool: [
@@ skipping 11 matching lines @@
     x = x + 1;
   } while (x < 10);
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 66
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
   /*   53 E> */ B(Star), R(1),
   /*   56 E> */ B(StackCheck),
   /*   63 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(10),
                 B(Mul), R(2),
-  /*   65 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   77 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(5),
   /*   83 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*   89 S> */ B(Jump), U8(34),
   /*   98 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(6),
   /*  104 E> */ B(TestEqual), R(2),
@@ skipping 26 matching lines @@
     x = x - 1;
   } while (x);
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 37
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(10),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   54 S> */ B(LdaSmi), U8(1),
   /*   54 E> */ B(Star), R(1),
   /*   57 E> */ B(StackCheck),
   /*   64 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(12),
                 B(Mul), R(2),
-  /*   66 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   78 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Sub), R(2),
   /*   80 E> */ B(Star), R(0),
   /*   98 S> */ B(Ldar), R(0),
                 B(JumpIfToBooleanTrue), U8(-23),
   /*  102 S> */ B(Ldar), R(1),
   /*  112 S> */ B(Return),
 ]
@@ skipping 12 matching lines @@
     if (x == 6) continue;
   } while (false);
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 54
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
   /*   53 E> */ B(Star), R(1),
   /*   56 E> */ B(StackCheck),
   /*   63 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(10),
                 B(Mul), R(2),
-  /*   65 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   77 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(5),
   /*   83 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*   89 S> */ B(Jump), U8(22),
   /*   98 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Add), R(2),
-  /*  100 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*  111 S> */ B(Star), R(2),
                 B(LdaSmi), U8(6),
   /*  117 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*  123 S> */ B(Jump), U8(2),
   /*  150 S> */ B(Ldar), R(1),
   /*  160 S> */ B(Return),
 ]
 constant pool: [
 ]
@@ skipping 10 matching lines @@
     if (x == 6) continue;
   } while (true);
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 56
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
   /*   53 E> */ B(Star), R(1),
   /*   56 E> */ B(StackCheck),
   /*   63 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(10),
                 B(Mul), R(2),
-  /*   65 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   77 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(5),
   /*   83 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*   89 S> */ B(Jump), U8(24),
   /*   98 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Add), R(2),
-  /*  100 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*  111 S> */ B(Star), R(2),
                 B(LdaSmi), U8(6),
   /*  117 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*  123 S> */ B(Jump), U8(2),
                 B(Jump), U8(-43),
   /*  149 S> */ B(Ldar), R(1),
   /*  159 S> */ B(Return),
 ]
 constant pool: [
@@ skipping 176 matching lines @@
     u = u + 1;
     continue;
   }
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 44
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   58 S> */ B(LdaZero),
   /*   58 E> */ B(Star), R(1),
   /*   63 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(100),
   /*   63 E> */ B(TestLessThan), R(2),
                 B(JumpIfFalse), U8(27),
   /*   45 E> */ B(StackCheck),
   /*   85 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Add), R(2),
-  /*   87 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   98 S> */ B(Jump), U8(2),
   /*   72 S> */ B(Ldar), R(1),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Add), R(2),
   /*   72 E> */ B(Star), R(1),
                 B(Jump), U8(-33),
                 B(LdaUndefined),
   /*  110 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var y = 1;
   for (var x = 10; x; --x) {
     y = y * 12;
   }
   return y;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 34
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   58 S> */ B(LdaSmi), U8(10),
   /*   58 E> */ B(Star), R(1),
   /*   62 S> */ B(Ldar), R(1),
                 B(JumpIfToBooleanFalse), U8(20),
   /*   45 E> */ B(StackCheck),
   /*   74 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(12),
                 B(Mul), R(2),
   /*   76 E> */ B(Star), R(0),
@@ skipping 16 matching lines @@
     x = x + 1;
   };
   return x;
 "
 frame size: 2
 parameter count: 1
 bytecode array length: 10
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   58 S> */ B(LdaZero),
-  /*   58 E> */ B(Star), R(1),
+                B(Star), R(1),
   /*   91 S> */ B(Ldar), R(0),
   /*  101 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0;
   for (var i = 0; true; ++i) {
     x = x + 1;
     if (x == 20) break;
   };
   return x;
 "
 frame size: 3
 parameter count: 1
 bytecode array length: 38
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
-  /*   42 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   58 S> */ B(LdaZero),
   /*   58 E> */ B(Star), R(1),
   /*   45 E> */ B(StackCheck),
   /*   76 S> */ B(Ldar), R(0),
                 B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(Add), R(2),
-  /*   78 E> */ B(Star), R(0),
+                B(Star), R(0),
   /*   89 S> */ B(Star), R(2),
                 B(LdaSmi), U8(20),
   /*   95 E> */ B(TestEqual), R(2),
                 B(JumpIfFalse), U8(4),
   /*  102 S> */ B(Jump), U8(9),
   /*   69 S> */ B(Ldar), R(1),
                 B(Inc),
   /*   69 E> */ B(Star), R(1),
                 B(Jump), U8(-26),
   /*  112 S> */ B(Ldar), R(0),
@@ skipping 76 matching lines @@
 ]
 constant pool: [
   InstanceType::FIXED_ARRAY_TYPE,
   InstanceType::SHARED_FUNCTION_INFO_TYPE,
   InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
   InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
 ]
 handlers: [
 ]