| OLD | NEW |
| 1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_ | 5 #ifndef V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_ |
| 6 #define V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_ | 6 #define V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_ |
| 7 | 7 |
| 8 #include "src/interpreter/bytecode-pipeline.h" | 8 #include "src/interpreter/bytecode-pipeline.h" |
| 9 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 BytecodePeepholeOptimizer(ConstantArrayBuilder* constant_array_builder, | 22 BytecodePeepholeOptimizer(ConstantArrayBuilder* constant_array_builder, |
| 23 BytecodePipelineStage* next_stage); | 23 BytecodePipelineStage* next_stage); |
| 24 | 24 |
| 25 void Write(BytecodeNode* node) override; | 25 void Write(BytecodeNode* node) override; |
| 26 size_t FlushForOffset() override; | 26 size_t FlushForOffset() override; |
| 27 void FlushBasicBlock() override; | 27 void FlushBasicBlock() override; |
| 28 | 28 |
| 29 private: | 29 private: |
| 30 BytecodeNode* Optimize(BytecodeNode* current); | 30 BytecodeNode* Optimize(BytecodeNode* current); |
| 31 | 31 |
| 32 void UpdateCurrentBytecode(BytecodeNode* const current); | 32 bool SimpleSubstitution(BytecodeNode* const current); |
| 33 bool CanElideCurrent(const BytecodeNode* const current) const; | 33 bool CanElideCurrent(const BytecodeNode* const current); |
| 34 bool CanElideLast(const BytecodeNode* const current) const; | 34 bool CanElideLast(const BytecodeNode* const current) const; |
| 35 | 35 |
| 36 // Simple substitution methods. |
| 37 void RewriteLastLoadAndStar(Bytecode new_bytecode, |
| 38 BytecodeNode* const current); |
| 39 bool RemoveToBooleanFromJump(BytecodeNode* const current); |
| 40 bool ChangeLdaToLdr(BytecodeNode* const current); |
| 41 bool ChangeLdarMovToLdarStar(BytecodeNode* const current); |
| 42 |
| 36 void InvalidateLast(); | 43 void InvalidateLast(); |
| 37 bool LastIsValid() const; | 44 bool LastIsValid() const; |
| 38 void SetLast(const BytecodeNode* const node); | 45 void SetLast(const BytecodeNode* const node); |
| 39 | 46 |
| 40 bool LastBytecodePutsNameInAccumulator() const; | 47 bool LastBytecodePutsNameInAccumulator() const; |
| 41 | 48 |
| 42 Handle<Object> GetConstantForIndexOperand(const BytecodeNode* const node, | 49 Handle<Object> GetConstantForIndexOperand(const BytecodeNode* const node, |
| 43 int index) const; | 50 int index) const; |
| 44 | 51 |
| 45 ConstantArrayBuilder* constant_array_builder_; | 52 ConstantArrayBuilder* constant_array_builder_; |
| 46 BytecodePipelineStage* next_stage_; | 53 BytecodePipelineStage* next_stage_; |
| 47 BytecodeNode last_; | 54 BytecodeNode last_; |
| 48 bool last_is_discardable_; | 55 bool last_is_discardable_; |
| 49 | 56 |
| 50 DISALLOW_COPY_AND_ASSIGN(BytecodePeepholeOptimizer); | 57 DISALLOW_COPY_AND_ASSIGN(BytecodePeepholeOptimizer); |
| 51 }; | 58 }; |
| 52 | 59 |
| 53 } // namespace interpreter | 60 } // namespace interpreter |
| 54 } // namespace internal | 61 } // namespace internal |
| 55 } // namespace v8 | 62 } // namespace v8 |
| 56 | 63 |
| 57 #endif // V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_ | 64 #endif // V8_INTERPRETER_BYTECODE_PEEPHOLE_OPTIMIZER_H_ |
| OLD | NEW |