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 #include "src/compiler/verifier.h" | 5 #include "src/compiler/verifier.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 #include <deque> | 8 #include <deque> |
| 9 #include <queue> | 9 #include <queue> |
| 10 #include <sstream> | 10 #include <sstream> |
| (...skipping 1020 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1031 case IrOpcode::kLoadParentFramePointer: | 1031 case IrOpcode::kLoadParentFramePointer: |
| 1032 case IrOpcode::kCheckedLoad: | 1032 case IrOpcode::kCheckedLoad: |
| 1033 case IrOpcode::kCheckedStore: | 1033 case IrOpcode::kCheckedStore: |
| 1034 case IrOpcode::kAtomicLoad: | 1034 case IrOpcode::kAtomicLoad: |
| 1035 // TODO(rossberg): Check. | 1035 // TODO(rossberg): Check. |
| 1036 break; | 1036 break; |
| 1037 } | 1037 } |
| 1038 } // NOLINT(readability/fn_size) | 1038 } // NOLINT(readability/fn_size) |
| 1039 | 1039 |
| 1040 void Verifier::Run(Graph* graph, Typing typing, CheckInputs check_inputs) { | 1040 void Verifier::Run(Graph* graph, Typing typing, CheckInputs check_inputs) { |
| 1041 return; | |
|
Benedikt Meurer
2016/04/28 10:28:44
Please undo.
| |
| 1041 CHECK_NOT_NULL(graph->start()); | 1042 CHECK_NOT_NULL(graph->start()); |
| 1042 CHECK_NOT_NULL(graph->end()); | 1043 CHECK_NOT_NULL(graph->end()); |
| 1043 Zone zone(graph->zone()->allocator()); | 1044 Zone zone(graph->zone()->allocator()); |
| 1044 Visitor visitor(&zone, typing, check_inputs); | 1045 Visitor visitor(&zone, typing, check_inputs); |
| 1045 AllNodes all(&zone, graph); | 1046 AllNodes all(&zone, graph); |
| 1046 for (Node* node : all.live) visitor.Check(node); | 1047 for (Node* node : all.live) visitor.Check(node); |
| 1047 | 1048 |
| 1048 // Check the uniqueness of projections. | 1049 // Check the uniqueness of projections. |
| 1049 for (Node* proj : all.live) { | 1050 for (Node* proj : all.live) { |
| 1050 if (proj->opcode() != IrOpcode::kProjection) continue; | 1051 if (proj->opcode() != IrOpcode::kProjection) continue; |
| (...skipping 303 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1354 replacement->op()->EffectOutputCount() > 0); | 1355 replacement->op()->EffectOutputCount() > 0); |
| 1355 DCHECK(!NodeProperties::IsFrameStateEdge(edge) || | 1356 DCHECK(!NodeProperties::IsFrameStateEdge(edge) || |
| 1356 replacement->opcode() == IrOpcode::kFrameState); | 1357 replacement->opcode() == IrOpcode::kFrameState); |
| 1357 } | 1358 } |
| 1358 | 1359 |
| 1359 #endif // DEBUG | 1360 #endif // DEBUG |
| 1360 | 1361 |
| 1361 } // namespace compiler | 1362 } // namespace compiler |
| 1362 } // namespace internal | 1363 } // namespace internal |
| 1363 } // namespace v8 | 1364 } // namespace v8 |
| OLD | NEW |