[Interpreter] Don't try to eliminate dead-code in bytecode-array-builder

test/cctest/interpreter/bytecode_expectations/IfConditions.golden

 #
 # Autogenerated by generate-bytecode-expectations.
 #
 
 ---
 pool type: mixed
 execute: yes
 wrap: no
 test function name: f
 
@@ skipping 132 matching lines @@
     if (a <= 0) {
       return 200;
     } else {
       return -200;
     }
   };
   f(99);
 "
 frame size: 0
 parameter count: 2
-bytecode array length: 18
+bytecode array length: 20
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   18 S> */ B(LdaZero),
   /*   24 E> */ B(TestLessThanOrEqual), R(arg0),
-                B(JumpIfFalse), U8(7),
+                B(JumpIfFalse), U8(9),
   /*   36 S> */ B(Wide), B(LdaSmi), U16(200),
   /*   80 S> */ B(Return),
+                B(Jump), U8(7),
   /*   63 S> */ B(Wide), B(LdaSmi), U16(-200),
   /*   80 S> */ B(Return),
                 B(LdaUndefined),
   /*   80 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]
 
@@ skipping 84 matching lines @@
     b = a; a = b;
     b = a; a = b;
     b = a; a = b;
     b = a; a = b;
     b = a; a = b;
     b = a; a = b;
    return 200; } else { return -200; } } f(0.001);
 "
 frame size: 2
 parameter count: 2
-bytecode array length: 537
+bytecode array length: 539
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   24 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   35 S> */ B(LdaZero),
                 B(Star), R(1),
   /*   38 S> */ B(LdaConstant), U8(0),
   /*   44 E> */ B(TestEqualStrict), R(0),
                 B(JumpIfFalseConstant), U8(1),
   /*   58 S> */ B(Nop),
@@ skipping 247 matching lines @@
   /* 1050 S> */ B(Nop),
                 B(Mov), R(0), R(1),
   /* 1057 S> */ B(Nop),
                 B(Mov), R(1), R(0),
   /* 1066 S> */ B(Nop),
                 B(Mov), R(0), R(1),
   /* 1073 S> */ B(Nop),
                 B(Mov), R(1), R(0),
   /* 1081 S> */ B(Wide), B(LdaSmi), U16(200),
   /* 1117 S> */ B(Return),
+                B(Jump), U8(7),
   /* 1102 S> */ B(Wide), B(LdaSmi), U16(-200),
   /* 1117 S> */ B(Return),
                 B(LdaUndefined),
   /* 1117 S> */ B(Return),
 ]
 constant pool: [
   InstanceType::HEAP_NUMBER_TYPE,
   kInstanceTypeDontCare,
 ]
 handlers: [
@@ skipping 67 matching lines @@
     b = a; a = b;
     b = a; a = b;
     b = a; a = b;
     b = a; a = b;
     return 200; } else { return -200; }
   };
   f();
 "
 frame size: 2
 parameter count: 1
-bytecode array length: 535
+bytecode array length: 537
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   25 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   36 S> */ B(LdaZero),
                 B(Star), R(1),
   /*   41 S> */ B(Ldar), R(0),
                 B(JumpIfToBooleanFalseConstant), U8(0),
   /*   52 S> */ B(Nop),
                 B(Mov), R(0), R(1),
@@ skipping 246 matching lines @@
   /* 1044 S> */ B(Nop),
                 B(Mov), R(0), R(1),
   /* 1051 S> */ B(Nop),
                 B(Mov), R(1), R(0),
   /* 1060 S> */ B(Nop),
                 B(Mov), R(0), R(1),
   /* 1067 S> */ B(Nop),
                 B(Mov), R(1), R(0),
   /* 1076 S> */ B(Wide), B(LdaSmi), U16(200),
   /* 1112 S> */ B(Return),
+                B(Jump), U8(7),
   /* 1097 S> */ B(Wide), B(LdaSmi), U16(-200),
   /* 1112 S> */ B(Return),
                 B(LdaUndefined),
   /* 1112 S> */ B(Return),
 ]
 constant pool: [
   kInstanceTypeDontCare,
 ]
 handlers: [
 ]
@@ skipping 81 matching lines @@
     if (a) {
       return 20;
     } else {
       return -20;
     }
   };
   f();
 "
 frame size: 1
 parameter count: 1
-bytecode array length: 14
+bytecode array length: 16
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   25 S> */ B(LdaZero),
                 B(Star), R(0),
-  /*   30 S> */ B(JumpIfToBooleanFalse), U8(5),
+  /*   30 S> */ B(JumpIfToBooleanFalse), U8(7),
   /*   43 S> */ B(LdaSmi), U8(20),
   /*   85 S> */ B(Return),
+                B(Jump), U8(5),
   /*   69 S> */ B(LdaSmi), U8(-20),
   /*   85 S> */ B(Return),
                 B(LdaUndefined),
   /*   85 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]