[interpreter] Make the binary op with Smi bytecode handlers collect type feedback.

test/cctest/interpreter/bytecode_expectations/BasicLoops.golden

 #
 # Autogenerated by generate-bytecode-expectations.
 #
 
 ---
 pool type: mixed
 execute: yes
 wrap: yes
 
 ---
@@ skipping 47 matching lines @@
   while (x < 10) {
     y = y * 12;
     x = x + 1;
     if (x == 3) continue;
     if (x == 4) break;
   }
   return y;
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 48
+bytecode array length: 49
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
                 B(Star), R(1),
   /*   65 S> */ B(LdaSmi), U8(10),
   /*   65 E> */ B(TestLessThan), R(0),
-                B(JumpIfFalse), U8(33),
+                B(JumpIfFalse), U8(34),
   /*   56 E> */ B(StackCheck),
   /*   75 S> */ B(LdaSmi), U8(12),
                 B(Mul), R(1), U8(1),
                 B(Star), R(1),
-  /*   89 S> */ B(AddSmi), U8(1), R(0),
+  /*   89 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*  102 S> */ B(LdaSmi), U8(3),
   /*  108 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*  114 S> */ B(Jump), U8(10),
   /*  126 S> */ B(LdaSmi), U8(4),
   /*  132 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*  138 S> */ B(Jump), U8(4),
-                B(Jump), U8(-35),
+                B(Jump), U8(-36),
   /*  147 S> */ B(Ldar), R(1),
   /*  157 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var i = 0;
   while (true) {
     if (i < 0) continue;
     if (i == 3) break;
     if (i == 4) break;
     if (i == 10) continue;
     if (i == 5) break;
     i = i + 1;
   }
   return i;
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 54
+bytecode array length: 55
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   45 E> */ B(StackCheck),
   /*   62 S> */ B(LdaZero),
   /*   68 E> */ B(TestLessThan), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   73 S> */ B(Jump), U8(39),
+  /*   73 S> */ B(Jump), U8(40),
   /*   85 S> */ B(LdaSmi), U8(3),
   /*   91 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   97 S> */ B(Jump), U8(33),
+  /*   97 S> */ B(Jump), U8(34),
   /*  106 S> */ B(LdaSmi), U8(4),
   /*  112 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*  118 S> */ B(Jump), U8(25),
+  /*  118 S> */ B(Jump), U8(26),
   /*  127 S> */ B(LdaSmi), U8(10),
   /*  133 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*  140 S> */ B(Jump), U8(15),
+  /*  140 S> */ B(Jump), U8(16),
   /*  152 S> */ B(LdaSmi), U8(5),
   /*  158 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*  164 S> */ B(Jump), U8(9),
-  /*  173 S> */ B(AddSmi), U8(1), R(0),
+  /*  164 S> */ B(Jump), U8(10),
+  /*  173 S> */ B(AddSmi), U8(1), R(0), U8(1),
                 B(Star), R(0),
-                B(Jump), U8(-45),
+                B(Jump), U8(-46),
   /*  186 S> */ B(Ldar), R(0),
   /*  196 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var i = 0;
   while (true) {
     while (i < 3) {
       if (i == 2) break;
       i = i + 1;
     }
     i = i + 1;
     break;
   }
   return i;
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 37
+bytecode array length: 39
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   45 E> */ B(StackCheck),
   /*   71 S> */ B(LdaSmi), U8(3),
   /*   71 E> */ B(TestLessThan), R(0),
-                B(JumpIfFalse), U8(18),
+                B(JumpIfFalse), U8(19),
   /*   62 E> */ B(StackCheck),
   /*   82 S> */ B(LdaSmi), U8(2),
   /*   88 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   94 S> */ B(Jump), U8(9),
-  /*  105 S> */ B(AddSmi), U8(1), R(0),
+  /*   94 S> */ B(Jump), U8(10),
+  /*  105 S> */ B(AddSmi), U8(1), R(0), U8(1),
                 B(Star), R(0),
-                B(Jump), U8(-20),
-  /*  122 S> */ B(AddSmi), U8(1), R(0),
+                B(Jump), U8(-21),
+  /*  122 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*  135 S> */ B(Jump), U8(2),
   /*  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: 2
 parameter count: 1
-bytecode array length: 31
+bytecode array length: 32
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(10),
                 B(Star), R(0),
   /*   54 S> */ B(LdaSmi), U8(1),
                 B(Star), R(1),
   /*   64 S> */ B(Ldar), R(0),
-                B(JumpIfToBooleanFalse), U8(17),
+                B(JumpIfToBooleanFalse), U8(18),
   /*   57 E> */ B(StackCheck),
   /*   71 S> */ B(LdaSmi), U8(12),
                 B(Mul), R(1), U8(1),
                 B(Star), R(1),
-  /*   85 S> */ B(SubSmi), U8(1), R(0),
+  /*   85 S> */ B(SubSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
-                B(Jump), U8(-17),
+                B(Jump), U8(-18),
   /*   98 S> */ B(Ldar), R(1),
   /*  108 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0; var y = 1;
   do {
     y = y * 10;
     if (x == 5) break;
     if (x == 6) continue;
     x = x + 1;
   } while (x < 10);
   return y;
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 46
+bytecode array length: 47
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
                 B(Star), R(1),
   /*   56 E> */ B(StackCheck),
   /*   63 S> */ B(LdaSmi), U8(10),
                 B(Mul), R(1), U8(1),
                 B(Star), R(1),
   /*   77 S> */ B(LdaSmi), U8(5),
   /*   83 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   89 S> */ B(Jump), U8(21),
+  /*   89 S> */ B(Jump), U8(22),
   /*   98 S> */ B(LdaSmi), U8(6),
   /*  104 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*  110 S> */ B(Jump), U8(7),
-  /*  122 S> */ B(AddSmi), U8(1), R(0),
+  /*  110 S> */ B(Jump), U8(8),
+  /*  122 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*  144 S> */ B(LdaSmi), U8(10),
   /*  144 E> */ B(TestLessThan), R(0),
-                B(JumpIfTrue), U8(-33),
+                B(JumpIfTrue), U8(-34),
   /*  151 S> */ B(Ldar), R(1),
   /*  161 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 10;
   var y = 1;
   do {
     y = y * 12;
     x = x - 1;
   } while (x);
   return y;
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 27
+bytecode array length: 28
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(10),
                 B(Star), R(0),
   /*   54 S> */ B(LdaSmi), U8(1),
                 B(Star), R(1),
   /*   57 E> */ B(StackCheck),
   /*   64 S> */ B(LdaSmi), U8(12),
                 B(Mul), R(1), U8(1),
                 B(Star), R(1),
-  /*   78 S> */ B(SubSmi), U8(1), R(0),
+  /*   78 S> */ B(SubSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
-  /*   98 S> */ B(JumpIfToBooleanTrue), U8(-13),
+  /*   98 S> */ B(JumpIfToBooleanTrue), U8(-14),
   /*  102 S> */ B(Ldar), R(1),
   /*  112 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0; var y = 1;
   do {
     y = y * 10;
     if (x == 5) break;
     x = x + 1;
     if (x == 6) continue;
   } while (false);
   return y;
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 40
+bytecode array length: 41
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
                 B(Star), R(1),
   /*   56 E> */ B(StackCheck),
   /*   63 S> */ B(LdaSmi), U8(10),
                 B(Mul), R(1), U8(1),
                 B(Star), R(1),
   /*   77 S> */ B(LdaSmi), U8(5),
   /*   83 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   89 S> */ B(Jump), U8(15),
-  /*   98 S> */ B(AddSmi), U8(1), R(0),
+  /*   89 S> */ B(Jump), U8(16),
+  /*   98 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*  111 S> */ B(LdaSmi), U8(6),
   /*  117 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*  123 S> */ B(Jump), U8(2),
   /*  150 S> */ B(Ldar), R(1),
   /*  160 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0; var y = 1;
   do {
     y = y * 10;
     if (x == 5) break;
     x = x + 1;
     if (x == 6) continue;
   } while (true);
   return y;
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 42
+bytecode array length: 43
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   53 S> */ B(LdaSmi), U8(1),
                 B(Star), R(1),
   /*   56 E> */ B(StackCheck),
   /*   63 S> */ B(LdaSmi), U8(10),
                 B(Mul), R(1), U8(1),
                 B(Star), R(1),
   /*   77 S> */ B(LdaSmi), U8(5),
   /*   83 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   89 S> */ B(Jump), U8(17),
-  /*   98 S> */ B(AddSmi), U8(1), R(0),
+  /*   89 S> */ B(Jump), U8(18),
+  /*   98 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*  111 S> */ B(LdaSmi), U8(6),
   /*  117 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*  123 S> */ B(Jump), U8(2),
-                B(Jump), U8(-29),
+                B(Jump), U8(-30),
   /*  149 S> */ B(Ldar), R(1),
   /*  159 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0;
   for (;;) {
     if (x == 1) break;
     if (x == 2) continue;
     x = x + 1;
   }
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 30
+bytecode array length: 31
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   45 E> */ B(StackCheck),
   /*   58 S> */ B(LdaSmi), U8(1),
   /*   64 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   70 S> */ B(Jump), U8(17),
+  /*   70 S> */ B(Jump), U8(18),
   /*   79 S> */ B(LdaSmi), U8(2),
   /*   85 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   91 S> */ B(Jump), U8(7),
-  /*  103 S> */ B(AddSmi), U8(1), R(0),
+  /*   91 S> */ B(Jump), U8(8),
+  /*  103 S> */ B(AddSmi), U8(1), R(0), U8(1),
                 B(Star), R(0),
-                B(Jump), U8(-22),
+                B(Jump), U8(-23),
                 B(LdaUndefined),
   /*  116 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   for (var x = 0;;) {
     if (x == 1) break;
     if (x == 2) continue;
     x = x + 1;
   }
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 30
+bytecode array length: 31
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   47 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   34 E> */ B(StackCheck),
   /*   56 S> */ B(LdaSmi), U8(1),
   /*   62 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   68 S> */ B(Jump), U8(17),
+  /*   68 S> */ B(Jump), U8(18),
   /*   77 S> */ B(LdaSmi), U8(2),
   /*   83 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   89 S> */ B(Jump), U8(7),
-  /*  101 S> */ B(AddSmi), U8(1), R(0),
+  /*   89 S> */ B(Jump), U8(8),
+  /*  101 S> */ B(AddSmi), U8(1), R(0), U8(1),
                 B(Star), R(0),
-                B(Jump), U8(-22),
+                B(Jump), U8(-23),
                 B(LdaUndefined),
   /*  114 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var x = 0;
   for (;; x = x + 1) {
     if (x == 1) break;
     if (x == 2) continue;
   }
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 30
+bytecode array length: 31
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   45 E> */ B(StackCheck),
   /*   68 S> */ B(LdaSmi), U8(1),
   /*   74 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   80 S> */ B(Jump), U8(17),
+  /*   80 S> */ B(Jump), U8(18),
   /*   89 S> */ B(LdaSmi), U8(2),
   /*   95 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*  101 S> */ B(Jump), U8(2),
-  /*   55 S> */ B(AddSmi), U8(1), R(0),
+  /*   55 S> */ B(AddSmi), U8(1), R(0), U8(1),
                 B(Star), R(0),
-                B(Jump), U8(-22),
+                B(Jump), U8(-23),
                 B(LdaUndefined),
   /*  113 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   for (var x = 0;; x = x + 1) {
     if (x == 1) break;
     if (x == 2) continue;
   }
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 30
+bytecode array length: 31
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   47 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   34 E> */ B(StackCheck),
   /*   66 S> */ B(LdaSmi), U8(1),
   /*   72 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
-  /*   78 S> */ B(Jump), U8(17),
+  /*   78 S> */ B(Jump), U8(18),
   /*   87 S> */ B(LdaSmi), U8(2),
   /*   93 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*   99 S> */ B(Jump), U8(2),
-  /*   53 S> */ B(AddSmi), U8(1), R(0),
+  /*   53 S> */ B(AddSmi), U8(1), R(0), U8(1),
                 B(Star), R(0),
-                B(Jump), U8(-22),
+                B(Jump), U8(-23),
                 B(LdaUndefined),
   /*  111 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
   var u = 0;
   for (var i = 0; i < 100; i = i + 1) {
     u = u + 1;
     continue;
   }
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 30
+bytecode array length: 32
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   58 S> */ B(LdaZero),
                 B(Star), R(1),
   /*   63 S> */ B(LdaSmi), U8(100),
   /*   63 E> */ B(TestLessThan), R(1),
-                B(JumpIfFalse), U8(17),
+                B(JumpIfFalse), U8(19),
   /*   45 E> */ B(StackCheck),
-  /*   85 S> */ B(AddSmi), U8(1), R(0),
+  /*   85 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*   98 S> */ B(Jump), U8(2),
-  /*   72 S> */ B(AddSmi), U8(1), R(1),
+  /*   72 S> */ B(AddSmi), U8(1), R(1), U8(1),
                 B(Star), R(1),
-                B(Jump), U8(-19),
+                B(Jump), U8(-21),
                 B(LdaUndefined),
   /*  110 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
@@ skipping 59 matching lines @@
 snippet: "
   var x = 0;
   for (var i = 0; true; ++i) {
     x = x + 1;
     if (x == 20) break;
   };
   return x;
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 32
+bytecode array length: 33
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   58 S> */ B(LdaZero),
                 B(Star), R(1),
   /*   45 E> */ B(StackCheck),
-  /*   76 S> */ B(AddSmi), U8(1), R(0),
+  /*   76 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Star), R(0),
   /*   89 S> */ B(LdaSmi), U8(20),
   /*   95 E> */ B(TestEqual), R(0),
                 B(JumpIfFalse), U8(4),
   /*  102 S> */ B(Jump), U8(10),
   /*   69 S> */ B(Ldar), R(1),
                 B(Inc), U8(1),
                 B(Star), R(1),
-                B(Jump), U8(-20),
+                B(Jump), U8(-21),
   /*  112 S> */ B(Ldar), R(0),
   /*  122 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
 ---
 snippet: "
@@ skipping 56 matching lines @@
   /*  137 S> */ B(Return),
 ]
 constant pool: [
   InstanceType::FIXED_ARRAY_TYPE,
   InstanceType::SHARED_FUNCTION_INFO_TYPE,
   InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
 ]
 handlers: [
 ]