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 #include "src/compiler/graph-replay.h" | 5 #include "src/compiler/graph-replay.h" |
6 | 6 |
7 #include "src/compiler/common-operator.h" | 7 #include "src/compiler/common-operator.h" |
8 #include "src/compiler/graph.h" | 8 #include "src/compiler/graph.h" |
9 #include "src/compiler/graph-inl.h" | 9 #include "src/compiler/graph-inl.h" |
10 #include "src/compiler/node.h" | 10 #include "src/compiler/node.h" |
(...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
56 case IrOpcode::kLoad: | 56 case IrOpcode::kLoad: |
57 PrintF("unique_name"); | 57 PrintF("unique_name"); |
58 break; | 58 break; |
59 case IrOpcode::kHeapConstant: | 59 case IrOpcode::kHeapConstant: |
60 PrintF("unique_constant"); | 60 PrintF("unique_constant"); |
61 break; | 61 break; |
62 case IrOpcode::kPhi: | 62 case IrOpcode::kPhi: |
63 PrintF("%d", op->InputCount()); | 63 PrintF("%d", op->InputCount()); |
64 break; | 64 break; |
65 case IrOpcode::kEffectPhi: | 65 case IrOpcode::kEffectPhi: |
66 PrintF("%d", OperatorProperties::GetEffectInputCount(op)); | 66 PrintF("%d", op->EffectInputCount()); |
67 break; | 67 break; |
68 case IrOpcode::kLoop: | 68 case IrOpcode::kLoop: |
69 case IrOpcode::kMerge: | 69 case IrOpcode::kMerge: |
70 PrintF("%d", OperatorProperties::GetControlInputCount(op)); | 70 PrintF("%d", op->ControlInputCount()); |
71 break; | 71 break; |
72 default: | 72 default: |
73 break; | 73 break; |
74 } | 74 } |
75 PrintF(");\n"); | 75 PrintF(");\n"); |
76 } | 76 } |
77 | 77 |
78 #endif // DEBUG | 78 #endif // DEBUG |
79 } | 79 } |
80 } | 80 } |
81 } // namespace v8::internal::compiler | 81 } // namespace v8::internal::compiler |
OLD | NEW |