[interpreter] Remove OperandScale from front stages of pipeline.

src/interpreter/bytecode-peephole-optimizer.cc

 // Copyright 2015 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/interpreter/bytecode-peephole-optimizer.h"
 
 #include "src/interpreter/constant-array-builder.h"
 #include "src/objects-inl.h"
 #include "src/objects.h"
 
@@ skipping 166 matching lines @@
   //
   // An example transformation here would be:
   //
   //   LdaGlobal i0, i1  ____\  LdrGlobal i0, i1, R
   //   Star R            ====/  Ldar R
   //
   // which loads a global value into both a register and the
   // accumulator. However, in the second form the Ldar can often be
   // peephole optimized away unlike the Star in the first form.
   //
-  last->Transform(new_bytecode, current->operand(0), current->operand_scale());
-  current->set_bytecode(Bytecode::kLdar, current->operand(0),
-                        current->operand_scale());
+  last->Transform(new_bytecode, current->operand(0));
+  current->set_bytecode(Bytecode::kLdar, current->operand(0));
 }
 
 }  // namespace
 
 bool BytecodePeepholeOptimizer::TransformLastAndCurrentBytecodes(
     BytecodeNode* const current) {
   if (current->bytecode() == Bytecode::kStar &&
       !current->source_info().is_statement()) {
     // Note: If the Star is tagged with a statement position, we can't
     // perform this transform as the store to the register will
@@ skipping 25 matching lines @@
     BytecodeNode* const current) {
   bool can_remove = Bytecodes::IsJumpIfToBoolean(current->bytecode()) &&
                     Bytecodes::WritesBooleanToAccumulator(last_.bytecode());
   if (can_remove) {
     // Conditional jumps with boolean conditions are emiitted in
     // ToBoolean form by the bytecode array builder,
     // i.e. JumpIfToBooleanTrue rather JumpIfTrue. The ToBoolean
     // element can be removed if the previous bytecode put a boolean
     // value in the accumulator.
     Bytecode jump = Bytecodes::GetJumpWithoutToBoolean(current->bytecode());
-    current->set_bytecode(jump, current->operand(0), current->operand_scale());
+    current->set_bytecode(jump, current->operand(0));
   }
   return can_remove;
 }
 
 bool BytecodePeepholeOptimizer::RemoveToBooleanFromLogicalNot(
     BytecodeNode* const current) {
   bool can_remove = current->bytecode() == Bytecode::kToBooleanLogicalNot &&
                     Bytecodes::WritesBooleanToAccumulator(last_.bytecode());
   if (can_remove) {
     // Logical-nots are emitted in ToBoolean form by the bytecode array
@@ skipping 70 matching lines @@
       next_stage_->Write(&last_);
       InvalidateLast();
     }
   }
   return current;
 }
 
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8