| 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 195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 206 break; | 206 break; |
| 207 } | 207 } |
| 208 case IrOpcode::kFrameState: | 208 case IrOpcode::kFrameState: |
| 209 // TODO(jarin): what are the constraints on these? | 209 // TODO(jarin): what are the constraints on these? |
| 210 break; | 210 break; |
| 211 case IrOpcode::kCall: | 211 case IrOpcode::kCall: |
| 212 // TODO(rossberg): what are the constraints on these? | 212 // TODO(rossberg): what are the constraints on these? |
| 213 break; | 213 break; |
| 214 case IrOpcode::kProjection: { | 214 case IrOpcode::kProjection: { |
| 215 // Projection has an input that produces enough values. | 215 // Projection has an input that produces enough values. |
| 216 int index = OpParameter<int>(node); | 216 size_t index = OpParameter<size_t>(node); |
| 217 Node* input = NodeProperties::GetValueInput(node, 0); | 217 Node* input = NodeProperties::GetValueInput(node, 0); |
| 218 CHECK_GT(OperatorProperties::GetValueOutputCount(input->op()), index); | 218 CHECK_GT(OperatorProperties::GetValueOutputCount(input->op()), |
| 219 static_cast<int>(index)); |
| 219 break; | 220 break; |
| 220 } | 221 } |
| 221 default: | 222 default: |
| 222 // TODO(rossberg): Check other node kinds. | 223 // TODO(rossberg): Check other node kinds. |
| 223 break; | 224 break; |
| 224 } | 225 } |
| 225 | 226 |
| 226 if (from_start) { | 227 if (from_start) { |
| 227 reached_from_start.insert(node); | 228 reached_from_start.insert(node); |
| 228 } else { | 229 } else { |
| (...skipping 216 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 445 // Check inputs for all nodes in the block. | 446 // Check inputs for all nodes in the block. |
| 446 for (size_t i = 0; i < block->nodes_.size(); i++) { | 447 for (size_t i = 0; i < block->nodes_.size(); i++) { |
| 447 Node* node = block->nodes_[i]; | 448 Node* node = block->nodes_[i]; |
| 448 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 449 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
| 449 } | 450 } |
| 450 } | 451 } |
| 451 } | 452 } |
| 452 } | 453 } |
| 453 } | 454 } |
| 454 } // namespace v8::internal::compiler | 455 } // namespace v8::internal::compiler |
| OLD | NEW |