| 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 <deque> | 7 #include <deque> |
| 8 #include <queue> | 8 #include <queue> |
| 9 | 9 |
| 10 #include "src/compiler/generic-algorithm.h" | 10 #include "src/compiler/generic-algorithm.h" |
| (...skipping 267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 278 BasicBlock* use_block = block; | 278 BasicBlock* use_block = block; |
| 279 if (node->opcode() == IrOpcode::kPhi) { | 279 if (node->opcode() == IrOpcode::kPhi) { |
| 280 use_block = use_block->PredecessorAt(j); | 280 use_block = use_block->PredecessorAt(j); |
| 281 use_pos = static_cast<int>(use_block->NodeCount()) - 1; | 281 use_pos = static_cast<int>(use_block->NodeCount()) - 1; |
| 282 } | 282 } |
| 283 Node* input = node->InputAt(j); | 283 Node* input = node->InputAt(j); |
| 284 if (!HasDominatingDef(schedule, node->InputAt(j), block, use_block, | 284 if (!HasDominatingDef(schedule, node->InputAt(j), block, use_block, |
| 285 use_pos)) { | 285 use_pos)) { |
| 286 V8_Fatal(__FILE__, __LINE__, | 286 V8_Fatal(__FILE__, __LINE__, |
| 287 "Node #%d:%s in B%d is not dominated by input@%d #%d:%s", | 287 "Node #%d:%s in B%d is not dominated by input@%d #%d:%s", |
| 288 node->id(), node->op()->mnemonic(), block->id(), j, input->id(), | 288 node->id(), node->op()->mnemonic(), block->id().ToInt(), j, |
| 289 input->op()->mnemonic()); | 289 input->id(), input->op()->mnemonic()); |
| 290 } | 290 } |
| 291 } | 291 } |
| 292 } | 292 } |
| 293 | 293 |
| 294 | 294 |
| 295 void ScheduleVerifier::Run(Schedule* schedule) { | 295 void ScheduleVerifier::Run(Schedule* schedule) { |
| 296 const size_t count = schedule->BasicBlockCount(); | 296 const size_t count = schedule->BasicBlockCount(); |
| 297 Zone tmp_zone(schedule->zone()->isolate()); | 297 Zone tmp_zone(schedule->zone()->isolate()); |
| 298 Zone* zone = &tmp_zone; | 298 Zone* zone = &tmp_zone; |
| 299 BasicBlock* start = schedule->start(); | 299 BasicBlock* start = schedule->start(); |
| (...skipping 148 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 448 // Check inputs for all nodes in the block. | 448 // Check inputs for all nodes in the block. |
| 449 for (size_t i = 0; i < block->NodeCount(); i++) { | 449 for (size_t i = 0; i < block->NodeCount(); i++) { |
| 450 Node* node = block->NodeAt(i); | 450 Node* node = block->NodeAt(i); |
| 451 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 451 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
| 452 } | 452 } |
| 453 } | 453 } |
| 454 } | 454 } |
| 455 } | 455 } |
| 456 } | 456 } |
| 457 } // namespace v8::internal::compiler | 457 } // namespace v8::internal::compiler |
| OLD | NEW |