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 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
84 case IrOpcode::kStoreElement: | 84 case IrOpcode::kStoreElement: |
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::kProtectedLoad: |
94 case IrOpcode::kStore: | 95 case IrOpcode::kStore: |
| 96 case IrOpcode::kProtectedStore: |
95 case IrOpcode::kRetain: | 97 case IrOpcode::kRetain: |
96 case IrOpcode::kUnsafePointerAdd: | 98 case IrOpcode::kUnsafePointerAdd: |
97 return VisitOtherEffect(node, state); | 99 return VisitOtherEffect(node, state); |
98 default: | 100 default: |
99 break; | 101 break; |
100 } | 102 } |
101 DCHECK_EQ(0, node->op()->EffectOutputCount()); | 103 DCHECK_EQ(0, node->op()->EffectOutputCount()); |
102 } | 104 } |
103 | 105 |
104 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { | 106 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { |
(...skipping 421 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
526 return jsgraph()->common(); | 528 return jsgraph()->common(); |
527 } | 529 } |
528 | 530 |
529 MachineOperatorBuilder* MemoryOptimizer::machine() const { | 531 MachineOperatorBuilder* MemoryOptimizer::machine() const { |
530 return jsgraph()->machine(); | 532 return jsgraph()->machine(); |
531 } | 533 } |
532 | 534 |
533 } // namespace compiler | 535 } // namespace compiler |
534 } // namespace internal | 536 } // namespace internal |
535 } // namespace v8 | 537 } // namespace v8 |
OLD | NEW |