Chromium Code Reviews| Index: src/interpreter/bytecode-register-optimizer.h |
| diff --git a/src/interpreter/bytecode-register-optimizer.h b/src/interpreter/bytecode-register-optimizer.h |
| new file mode 100644 |
| index 0000000000000000000000000000000000000000..c851ab7aa6c28b1fb5a162815bc6d803055ac63c |
| --- /dev/null |
| +++ b/src/interpreter/bytecode-register-optimizer.h |
| @@ -0,0 +1,132 @@ |
| +// Copyright 2015 the V8 project authors. All rights reserved. |
|
rmcilroy
2016/05/26 10:24:53
2016
oth
2016/05/26 21:26:51
Done.
|
| +// Use of this source code is governed by a BSD-style license that can be |
| +// found in the LICENSE file. |
| + |
| +#ifndef V8_INTERPRETER_BYTECODE_REGISTER_OPTIMIZER_H_ |
| +#define V8_INTERPRETER_BYTECODE_REGISTER_OPTIMIZER_H_ |
| + |
| +#include "src/interpreter/bytecode-pipeline.h" |
| + |
| +namespace v8 { |
| +namespace internal { |
| +namespace interpreter { |
| + |
| +// An optimization stage for eliminating unnecessary transfers between |
| +// registers. The bytecode generator uses temporary registers |
| +// liberally for correctness and convenience and this stage removes |
| +// transfers that are not required and preserves correctness. |
| +class BytecodeRegisterOptimizer final : public BytecodePipelineStage, |
| + public TemporaryRegisterObserver, |
| + public ZoneObject { |
| + public: |
| + BytecodeRegisterOptimizer(Zone* zone, |
| + TemporaryRegisterAllocator* register_allocator, |
| + int parameter_count, int fixed_register_count, |
| + BytecodePipelineStage* next_stage); |
| + virtual ~BytecodeRegisterOptimizer() {} |
| + |
| + // BytecodePipelineStage interface. |
| + size_t FlushForOffset() override; |
| + void FlushBasicBlock() override; |
| + void Write(BytecodeNode* node) override; |
| + |
| + private: |
| + class RegisterInfo; |
| + |
| + // TemporaryRegisterObserver interface. |
| + void TemporaryRegisterFreeEvent(Register reg) override; |
| + |
| + // Helpers for BytecodePipelineStage interface. |
| + void FlushState(); |
| + void WriteToNextStage(BytecodeNode* node); |
| + void WriteToNextStage(BytecodeNode* node, RegisterInfo* output_info); |
| + |
| + // Update internal state for register transfer from |input| to |output|. |
| + void RegisterTransfer(RegisterInfo* input, RegisterInfo* output); |
| + |
| + // Emit a register transfer bytecode from |input| to |output|. |
| + void OutputRegisterTransfer(RegisterInfo* input, RegisterInfo* output); |
| + |
| + // Emits a Nop in place of |node| taking the source position |
| + // associated with |Nop|. |
|
rmcilroy
2016/05/26 10:24:54
/s/|Nop|/|node| ?
oth
2016/05/26 21:26:51
Done.
|
| + void EmitNopTakingSourcePosition(BytecodeNode* node); |
| + |
| + // Handlers for bytecode nodes for register to register transfers. |
| + void DoLdar(const BytecodeNode* const node); |
| + void DoMov(const BytecodeNode* const node); |
| + void DoStar(const BytecodeNode* const node); |
| + |
| + // Operand processing methods for bytecodes other than those |
| + // performing register to register transfers. |
| + void PrepareOperands(BytecodeNode* const node); |
| + void PrepareAccumulator(BytecodeNode* const node); |
| + void PrepareRegisterOperands(BytecodeNode* const node); |
| + |
| + void PrepareRegisterOutputOperand(RegisterInfo* reg_info); |
| + void PrepareRegisterRangeOutputOperand(Register start, int count); |
| + Register PrepareRegisterInputOperand(Register reg); |
| + void PrepareRegisterRangeInputOperand(Register start, int count); |
| + |
| + static Register GetRegisterInputOperand(int index, Bytecode bytecode, |
| + const uint32_t* operands, |
| + int operand_count); |
| + static Register GetRegisterOutputOperand(int index, Bytecode bytecode, |
| + const uint32_t* operands, |
| + int operand_count); |
| + |
| + void CreateMaterializedEquivalentIfRequired(RegisterInfo* info); |
| + RegisterInfo* GetMaterializedEquivalent(RegisterInfo* info); |
| + RegisterInfo* GetMaterializedEquivalentNotAccumulator(RegisterInfo* info); |
| + void Materialize(RegisterInfo* info); |
| + |
| + // Methods for finding and creating metadata for each register. |
| + RegisterInfo* GetOrCreateRegisterInfo(Register reg); |
| + RegisterInfo* GetRegisterInfo(Register reg); |
| + RegisterInfo* NewRegisterInfo(Register reg); |
| + void GrowRegisterMap(Register reg); |
| + |
| + bool RegisterIsTemporary(Register reg) const { |
| + return reg >= temporary_base_; |
| + } |
| + |
| + bool RegisterIsObservable(Register reg) const { |
| + return reg != accumulator_ && !RegisterIsTemporary(reg); |
| + } |
| + |
| + static Register OperandToRegister(uint32_t operand) { |
| + return Register::FromOperand(static_cast<int32_t>(operand)); |
| + } |
| + |
| + size_t GetMapIndex(Register reg) const { |
| + return static_cast<size_t>(reg.index() + map_index_offset_); |
| + } |
| + |
| + Register RegisterFromMapIndex(size_t index) const { |
| + return Register(static_cast<int>(index) - map_index_offset_); |
| + } |
| + |
| + Zone* zone() { return zone_; } |
| + |
| + const Register accumulator_; |
| + RegisterInfo* accumulator_info_; |
| + const Register temporary_base_; |
| + |
| + // Direct mapping to register info. |
| + ZoneVector<RegisterInfo*> register_map_; |
|
rmcilroy
2016/05/26 10:24:53
This is not a map, how about register_infos_ (if s
oth
2016/05/26 21:26:51
Done.
|
| + int map_index_offset_; |
| + |
| + // Counter for equivalence sets identifiers. |
| + int equivalence_id_; |
| + |
| + BytecodePipelineStage* next_stage_; |
| + bool flushed_; |
| + Zone* zone_; |
| + |
| + DISALLOW_COPY_AND_ASSIGN(BytecodeRegisterOptimizer); |
| +}; |
| + |
| +} // namespace interpreter |
| +} // namespace internal |
| +} // namespace v8 |
| + |
| +#endif // V8_INTERPRETER_BYTECODE_REGISTER_OPTIMIZER_H_ |