Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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_COMPILER_RAW_MACHINE_ASSEMBLER_H_ | 5 #ifndef V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
| 6 #define V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ | 6 #define V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
| 7 | 7 |
| 8 #include "src/assembler.h" | 8 #include "src/assembler.h" |
| 9 #include "src/compiler/common-operator.h" | 9 #include "src/compiler/common-operator.h" |
| 10 #include "src/compiler/graph.h" | 10 #include "src/compiler/graph.h" |
| (...skipping 108 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 119 } | 119 } |
| 120 | 120 |
| 121 // Memory Operations. | 121 // Memory Operations. |
| 122 Node* Load(MachineType rep, Node* base) { | 122 Node* Load(MachineType rep, Node* base) { |
| 123 return Load(rep, base, IntPtrConstant(0)); | 123 return Load(rep, base, IntPtrConstant(0)); |
| 124 } | 124 } |
| 125 Node* Load(MachineType rep, Node* base, Node* index) { | 125 Node* Load(MachineType rep, Node* base, Node* index) { |
| 126 return AddNode(machine()->Load(rep), base, index, graph()->start(), | 126 return AddNode(machine()->Load(rep), base, index, graph()->start(), |
| 127 graph()->start()); | 127 graph()->start()); |
| 128 } | 128 } |
| 129 Node* Store(MachineType rep, Node* base, Node* value) { | 129 Node* Store(MachineType rep, Node* base, Node* value, |
| 130 return Store(rep, base, IntPtrConstant(0), value); | 130 WriteBarrierKind write_barrier_kind = kNoWriteBarrier) { |
|
Michael Starzinger
2015/10/26 13:28:13
Joking aside: How much overhead would it be to not
rmcilroy
2015/10/26 15:37:51
Good point - done by changing Store to take a Stor
| |
| 131 return Store(rep, base, IntPtrConstant(0), value, write_barrier_kind); | |
| 131 } | 132 } |
| 132 Node* Store(MachineType rep, Node* base, Node* index, Node* value) { | 133 Node* Store(MachineType rep, Node* base, Node* index, Node* value, |
| 133 return AddNode(machine()->Store(StoreRepresentation(rep, kNoWriteBarrier)), | 134 WriteBarrierKind write_barrier_kind = kNoWriteBarrier) { |
|
Michael Starzinger
2015/10/26 13:28:13
Likewise.
rmcilroy
2015/10/26 15:37:51
Done.
| |
| 134 base, index, value, graph()->start(), graph()->start()); | 135 return AddNode( |
| 136 machine()->Store(StoreRepresentation(rep, write_barrier_kind)), base, | |
| 137 index, value, graph()->start(), graph()->start()); | |
| 135 } | 138 } |
| 136 | 139 |
| 137 // Arithmetic Operations. | 140 // Arithmetic Operations. |
| 138 Node* WordAnd(Node* a, Node* b) { | 141 Node* WordAnd(Node* a, Node* b) { |
| 139 return AddNode(machine()->WordAnd(), a, b); | 142 return AddNode(machine()->WordAnd(), a, b); |
| 140 } | 143 } |
| 141 Node* WordOr(Node* a, Node* b) { return AddNode(machine()->WordOr(), a, b); } | 144 Node* WordOr(Node* a, Node* b) { return AddNode(machine()->WordOr(), a, b); } |
| 142 Node* WordXor(Node* a, Node* b) { | 145 Node* WordXor(Node* a, Node* b) { |
| 143 return AddNode(machine()->WordXor(), a, b); | 146 return AddNode(machine()->WordXor(), a, b); |
| 144 } | 147 } |
| (...skipping 443 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 588 BasicBlock* current_block_; | 591 BasicBlock* current_block_; |
| 589 | 592 |
| 590 DISALLOW_COPY_AND_ASSIGN(RawMachineAssembler); | 593 DISALLOW_COPY_AND_ASSIGN(RawMachineAssembler); |
| 591 }; | 594 }; |
| 592 | 595 |
| 593 } // namespace compiler | 596 } // namespace compiler |
| 594 } // namespace internal | 597 } // namespace internal |
| 595 } // namespace v8 | 598 } // namespace v8 |
| 596 | 599 |
| 597 #endif // V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ | 600 #endif // V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
| OLD | NEW |