| 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 1248 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1259 break; | 1259 break; |
| 1260 } | 1260 } |
| 1261 } // NOLINT(readability/fn_size) | 1261 } // NOLINT(readability/fn_size) |
| 1262 | 1262 |
| 1263 void Verifier::Run(Graph* graph, Typing typing, CheckInputs check_inputs) { | 1263 void Verifier::Run(Graph* graph, Typing typing, CheckInputs check_inputs) { |
| 1264 CHECK_NOT_NULL(graph->start()); | 1264 CHECK_NOT_NULL(graph->start()); |
| 1265 CHECK_NOT_NULL(graph->end()); | 1265 CHECK_NOT_NULL(graph->end()); |
| 1266 Zone zone(graph->zone()->allocator()); | 1266 Zone zone(graph->zone()->allocator()); |
| 1267 Visitor visitor(&zone, typing, check_inputs); | 1267 Visitor visitor(&zone, typing, check_inputs); |
| 1268 AllNodes all(&zone, graph); | 1268 AllNodes all(&zone, graph); |
| 1269 for (Node* node : all.live) visitor.Check(node); | 1269 for (Node* node : all.reachable) visitor.Check(node); |
| 1270 | 1270 |
| 1271 // Check the uniqueness of projections. | 1271 // Check the uniqueness of projections. |
| 1272 for (Node* proj : all.live) { | 1272 for (Node* proj : all.reachable) { |
| 1273 if (proj->opcode() != IrOpcode::kProjection) continue; | 1273 if (proj->opcode() != IrOpcode::kProjection) continue; |
| 1274 Node* node = proj->InputAt(0); | 1274 Node* node = proj->InputAt(0); |
| 1275 for (Node* other : node->uses()) { | 1275 for (Node* other : node->uses()) { |
| 1276 if (all.IsLive(other) && other != proj && | 1276 if (all.IsLive(other) && other != proj && |
| 1277 other->opcode() == IrOpcode::kProjection && | 1277 other->opcode() == IrOpcode::kProjection && |
| 1278 ProjectionIndexOf(other->op()) == ProjectionIndexOf(proj->op())) { | 1278 ProjectionIndexOf(other->op()) == ProjectionIndexOf(proj->op())) { |
| 1279 V8_Fatal(__FILE__, __LINE__, | 1279 V8_Fatal(__FILE__, __LINE__, |
| 1280 "Node #%d:%s has duplicate projections #%d and #%d", | 1280 "Node #%d:%s has duplicate projections #%d and #%d", |
| 1281 node->id(), node->op()->mnemonic(), proj->id(), other->id()); | 1281 node->id(), node->op()->mnemonic(), proj->id(), other->id()); |
| 1282 } | 1282 } |
| (...skipping 293 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1576 replacement->op()->EffectOutputCount() > 0); | 1576 replacement->op()->EffectOutputCount() > 0); |
| 1577 DCHECK(!NodeProperties::IsFrameStateEdge(edge) || | 1577 DCHECK(!NodeProperties::IsFrameStateEdge(edge) || |
| 1578 replacement->opcode() == IrOpcode::kFrameState); | 1578 replacement->opcode() == IrOpcode::kFrameState); |
| 1579 } | 1579 } |
| 1580 | 1580 |
| 1581 #endif // DEBUG | 1581 #endif // DEBUG |
| 1582 | 1582 |
| 1583 } // namespace compiler | 1583 } // namespace compiler |
| 1584 } // namespace internal | 1584 } // namespace internal |
| 1585 } // namespace v8 | 1585 } // namespace v8 |
| OLD | NEW |