| 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 264 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 275 NodeProperties::GetControlInput(node)->opcode()); | 275 NodeProperties::GetControlInput(node)->opcode()); |
| 276 // Type is empty. | 276 // Type is empty. |
| 277 CheckNotTyped(node); | 277 CheckNotTyped(node); |
| 278 break; | 278 break; |
| 279 case IrOpcode::kLoop: | 279 case IrOpcode::kLoop: |
| 280 case IrOpcode::kMerge: | 280 case IrOpcode::kMerge: |
| 281 CHECK_EQ(control_count, input_count); | 281 CHECK_EQ(control_count, input_count); |
| 282 // Type is empty. | 282 // Type is empty. |
| 283 CheckNotTyped(node); | 283 CheckNotTyped(node); |
| 284 break; | 284 break; |
| 285 case IrOpcode::kDeoptimize: |
| 286 // TODO(rossberg): check successor is End |
| 287 // Type is empty. |
| 288 CheckNotTyped(node); |
| 285 case IrOpcode::kReturn: | 289 case IrOpcode::kReturn: |
| 286 // TODO(rossberg): check successor is End | 290 // TODO(rossberg): check successor is End |
| 287 // Type is empty. | 291 // Type is empty. |
| 288 CheckNotTyped(node); | 292 CheckNotTyped(node); |
| 289 break; | 293 break; |
| 290 case IrOpcode::kThrow: | 294 case IrOpcode::kThrow: |
| 291 // TODO(rossberg): what are the constraints on these? | 295 // TODO(rossberg): what are the constraints on these? |
| 292 // Type is empty. | 296 // Type is empty. |
| 293 CheckNotTyped(node); | 297 CheckNotTyped(node); |
| 294 break; | 298 break; |
| (...skipping 754 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1049 // Check inputs for all nodes in the block. | 1053 // Check inputs for all nodes in the block. |
| 1050 for (size_t i = 0; i < block->NodeCount(); i++) { | 1054 for (size_t i = 0; i < block->NodeCount(); i++) { |
| 1051 Node* node = block->NodeAt(i); | 1055 Node* node = block->NodeAt(i); |
| 1052 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 1056 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
| 1053 } | 1057 } |
| 1054 } | 1058 } |
| 1055 } | 1059 } |
| 1056 } | 1060 } |
| 1057 } | 1061 } |
| 1058 } // namespace v8::internal::compiler | 1062 } // namespace v8::internal::compiler |
| OLD | NEW |