| 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 403 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 414 // TODO(rossberg): what are the constraints on these? | 414 // TODO(rossberg): what are the constraints on these? |
| 415 // Type must be subsumed by input type. | 415 // Type must be subsumed by input type. |
| 416 if (typing == TYPED) { | 416 if (typing == TYPED) { |
| 417 CHECK(bounds(ValueInput(node)).lower->Is(bounds(node).lower)); | 417 CHECK(bounds(ValueInput(node)).lower->Is(bounds(node).lower)); |
| 418 CHECK(bounds(ValueInput(node)).upper->Is(bounds(node).upper)); | 418 CHECK(bounds(ValueInput(node)).upper->Is(bounds(node).upper)); |
| 419 } | 419 } |
| 420 break; | 420 break; |
| 421 } | 421 } |
| 422 case IrOpcode::kFrameState: | 422 case IrOpcode::kFrameState: |
| 423 // TODO(jarin): what are the constraints on these? | 423 // TODO(jarin): what are the constraints on these? |
| 424 CHECK_EQ(5, value_count); |
| 425 CHECK_EQ(0, control_count); |
| 426 CHECK_EQ(0, effect_count); |
| 427 CHECK_EQ(6, input_count); |
| 424 break; | 428 break; |
| 425 case IrOpcode::kStateValues: | 429 case IrOpcode::kStateValues: |
| 426 case IrOpcode::kTypedStateValues: | 430 case IrOpcode::kTypedStateValues: |
| 427 // TODO(jarin): what are the constraints on these? | 431 // TODO(jarin): what are the constraints on these? |
| 428 break; | 432 break; |
| 429 case IrOpcode::kCall: | 433 case IrOpcode::kCall: |
| 430 // TODO(rossberg): what are the constraints on these? | 434 // TODO(rossberg): what are the constraints on these? |
| 431 break; | 435 break; |
| 432 case IrOpcode::kTailCall: | 436 case IrOpcode::kTailCall: |
| 433 // TODO(bmeurer): what are the constraints on these? | 437 // TODO(bmeurer): what are the constraints on these? |
| (...skipping 662 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1096 // Check inputs for all nodes in the block. | 1100 // Check inputs for all nodes in the block. |
| 1097 for (size_t i = 0; i < block->NodeCount(); i++) { | 1101 for (size_t i = 0; i < block->NodeCount(); i++) { |
| 1098 Node* node = block->NodeAt(i); | 1102 Node* node = block->NodeAt(i); |
| 1099 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 1103 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
| 1100 } | 1104 } |
| 1101 } | 1105 } |
| 1102 } | 1106 } |
| 1103 } | 1107 } |
| 1104 } | 1108 } |
| 1105 } // namespace v8::internal::compiler | 1109 } // namespace v8::internal::compiler |
| OLD | NEW |