[interpeter] Move to table based peephole optimizer.

src/interpreter/bytecode-peephole-optimizer.h

 // 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.
 
 #ifndef V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_
 #define V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_
 
 #include "src/interpreter/bytecode-pipeline.h"
 
 namespace v8 {
@@ skipping 14 matching lines @@
   // BytecodePipelineStage interface.
   void Write(BytecodeNode* node) override;
   void WriteJump(BytecodeNode* node, BytecodeLabel* label) override;
   void BindLabel(BytecodeLabel* label) override;
   void BindLabel(const BytecodeLabel& target, BytecodeLabel* label) override;
   Handle<BytecodeArray> ToBytecodeArray(
       int fixed_register_count, int parameter_count,
       Handle<FixedArray> handler_table) override;
 
  private:
-  BytecodeNode* OptimizeAndEmitLast(BytecodeNode* current);
-  BytecodeNode* Optimize(BytecodeNode* current);
+  // Actions for non-jump bytecodes.
+  void DefaultAction(BytecodeNode* const node);
+  void UpdateLastAction(BytecodeNode* const node);
+  void ElideCurrentAction(BytecodeNode* const node);
+  void ElideCurrentIfOperand0MatchesAction(BytecodeNode* const node);
+  void ElideCurrentIfLoadingNameConstantAction(BytecodeNode* const node);
+  void ElideLastAction(BytecodeNode* const node);
+  void ChangeBytecodeAction(BytecodeNode* const node, Bytecode replacement);
+  void TransformLdaStarToLdrLdarAction(BytecodeNode* const node,
+                                       Bytecode replacement);
+
+  // Actions for jump bytecodes.
+  void DefaultJumpAction(BytecodeNode* const node);
+  void UpdateLastJumpAction(BytecodeNode* const node);
+  void ChangeJumpBytecodeAction(BytecodeNode* const node, Bytecode replacement);
+  void ElideLastBeforeJumpAction(BytecodeNode* const node);
+
+  void Optimize(BytecodeNode* const node);
   void Flush();
-
-  void TryToRemoveLastExpressionPosition(const BytecodeNode* const current);
-  bool TransformCurrentBytecode(BytecodeNode* const current);
-  bool TransformLastAndCurrentBytecodes(BytecodeNode* const current);
-  bool CanElideCurrent(const BytecodeNode* const current) const;
-  bool CanElideLast(const BytecodeNode* const current) const;
   bool CanElideLastBasedOnSourcePosition(
       const BytecodeNode* const current) const;
-
-  // Simple substitution methods.
-  bool RemoveToBooleanFromJump(BytecodeNode* const current);
-  bool RemoveToBooleanFromLogicalNot(BytecodeNode* const current);
-
   void InvalidateLast();
   bool LastIsValid() const;
   void SetLast(const BytecodeNode* const node);
 
-  bool LastBytecodePutsNameInAccumulator() const;
-
   Handle<Object> GetConstantForIndexOperand(const BytecodeNode* const node,
                                             int index) const;
 
+  BytecodePipelineStage* next_stage() const { return next_stage_; }
+  BytecodeNode* last() { return &last_; }
+
   ConstantArrayBuilder* constant_array_builder_;
   BytecodePipelineStage* next_stage_;
   BytecodeNode last_;
 
   DISALLOW_COPY_AND_ASSIGN(BytecodePeepholeOptimizer);
 };
 
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_