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::kCheckedUint32ToInt32: | |
Benedikt Meurer
2016/05/30 18:39:50
These nodes should be lowered long before we get h
Jarin
2016/05/31 20:28:53
Done.
| |
96 case IrOpcode::kCheckedFloat64ToInt32: | |
97 case IrOpcode::kCheckedTaggedToInt32: | |
98 case IrOpcode::kCheckedTaggedToFloat64: | |
95 return VisitOtherEffect(node, state); | 99 return VisitOtherEffect(node, state); |
96 default: | 100 default: |
97 break; | 101 break; |
98 } | 102 } |
99 DCHECK_EQ(0, node->op()->EffectOutputCount()); | 103 DCHECK_EQ(0, node->op()->EffectOutputCount()); |
100 } | 104 } |
101 | 105 |
102 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { | 106 void MemoryOptimizer::VisitAllocate(Node* node, AllocationState const* state) { |
103 DCHECK_EQ(IrOpcode::kAllocate, node->opcode()); | 107 DCHECK_EQ(IrOpcode::kAllocate, node->opcode()); |
104 Node* value; | 108 Node* value; |
(...skipping 382 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
487 return jsgraph()->common(); | 491 return jsgraph()->common(); |
488 } | 492 } |
489 | 493 |
490 MachineOperatorBuilder* MemoryOptimizer::machine() const { | 494 MachineOperatorBuilder* MemoryOptimizer::machine() const { |
491 return jsgraph()->machine(); | 495 return jsgraph()->machine(); |
492 } | 496 } |
493 | 497 |
494 } // namespace compiler | 498 } // namespace compiler |
495 } // namespace internal | 499 } // namespace internal |
496 } // namespace v8 | 500 } // namespace v8 |
OLD | NEW |