OLD | NEW |
1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 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 #include "src/compiler/memory-optimizer.h" | 5 #include "src/compiler/memory-optimizer.h" |
6 | 6 |
7 #include "src/compiler/js-graph.h" | 7 #include "src/compiler/js-graph.h" |
8 #include "src/compiler/linkage.h" | 8 #include "src/compiler/linkage.h" |
9 #include "src/compiler/node-matchers.h" | 9 #include "src/compiler/node-matchers.h" |
10 #include "src/compiler/node-properties.h" | 10 #include "src/compiler/node-properties.h" |
(...skipping 74 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
85 return VisitStoreElement(node, state); | 85 return VisitStoreElement(node, state); |
86 case IrOpcode::kStoreField: | 86 case IrOpcode::kStoreField: |
87 return VisitStoreField(node, state); | 87 return VisitStoreField(node, state); |
88 case IrOpcode::kCheckedLoad: | 88 case IrOpcode::kCheckedLoad: |
89 case IrOpcode::kCheckedStore: | 89 case IrOpcode::kCheckedStore: |
90 case IrOpcode::kDeoptimizeIf: | 90 case IrOpcode::kDeoptimizeIf: |
91 case IrOpcode::kDeoptimizeUnless: | 91 case IrOpcode::kDeoptimizeUnless: |
92 case IrOpcode::kIfException: | 92 case IrOpcode::kIfException: |
93 case IrOpcode::kLoad: | 93 case IrOpcode::kLoad: |
94 case IrOpcode::kStore: | 94 case IrOpcode::kStore: |
| 95 case IrOpcode::kRetain: |
| 96 case IrOpcode::kUnsafePointerAdd: |
95 return VisitOtherEffect(node, state); | 97 return VisitOtherEffect(node, state); |
96 default: | 98 default: |
97 break; | 99 break; |
98 } | 100 } |
99 DCHECK_EQ(0, node->op()->EffectOutputCount()); | 101 DCHECK_EQ(0, node->op()->EffectOutputCount()); |
100 } | 102 } |
101 | 103 |
102 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { | 104 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { |
103 DCHECK_EQ(IrOpcode::kAllocate, node->opcode()); | 105 DCHECK_EQ(IrOpcode::kAllocate, node->opcode()); |
104 Node* value; | 106 Node* value; |
(...skipping 387 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
492 return jsgraph()->common(); | 494 return jsgraph()->common(); |
493 } | 495 } |
494 | 496 |
495 MachineOperatorBuilder* MemoryOptimizer::machine() const { | 497 MachineOperatorBuilder* MemoryOptimizer::machine() const { |
496 return jsgraph()->machine(); | 498 return jsgraph()->machine(); |
497 } | 499 } |
498 | 500 |
499 } // namespace compiler | 501 } // namespace compiler |
500 } // namespace internal | 502 } // namespace internal |
501 } // namespace v8 | 503 } // namespace v8 |
OLD | NEW |