| 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 431 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 442 case IrOpcode::kStateValues: | 442 case IrOpcode::kStateValues: |
| 443 case IrOpcode::kTypedStateValues: | 443 case IrOpcode::kTypedStateValues: |
| 444 // TODO(jarin): what are the constraints on these? | 444 // TODO(jarin): what are the constraints on these? |
| 445 break; | 445 break; |
| 446 case IrOpcode::kCall: | 446 case IrOpcode::kCall: |
| 447 // TODO(rossberg): what are the constraints on these? | 447 // TODO(rossberg): what are the constraints on these? |
| 448 break; | 448 break; |
| 449 case IrOpcode::kTailCall: | 449 case IrOpcode::kTailCall: |
| 450 // TODO(bmeurer): what are the constraints on these? | 450 // TODO(bmeurer): what are the constraints on these? |
| 451 break; | 451 break; |
| 452 case IrOpcode::kCallVarArgs: |
| 453 // TODO(rossberg): what are the constraints on these? |
| 454 break; |
| 452 | 455 |
| 453 // JavaScript operators | 456 // JavaScript operators |
| 454 // -------------------- | 457 // -------------------- |
| 455 case IrOpcode::kJSEqual: | 458 case IrOpcode::kJSEqual: |
| 456 case IrOpcode::kJSNotEqual: | 459 case IrOpcode::kJSNotEqual: |
| 457 case IrOpcode::kJSStrictEqual: | 460 case IrOpcode::kJSStrictEqual: |
| 458 case IrOpcode::kJSStrictNotEqual: | 461 case IrOpcode::kJSStrictNotEqual: |
| 459 case IrOpcode::kJSLessThan: | 462 case IrOpcode::kJSLessThan: |
| 460 case IrOpcode::kJSGreaterThan: | 463 case IrOpcode::kJSGreaterThan: |
| 461 case IrOpcode::kJSLessThanOrEqual: | 464 case IrOpcode::kJSLessThanOrEqual: |
| (...skipping 683 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1145 // Check inputs for all nodes in the block. | 1148 // Check inputs for all nodes in the block. |
| 1146 for (size_t i = 0; i < block->NodeCount(); i++) { | 1149 for (size_t i = 0; i < block->NodeCount(); i++) { |
| 1147 Node* node = block->NodeAt(i); | 1150 Node* node = block->NodeAt(i); |
| 1148 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 1151 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
| 1149 } | 1152 } |
| 1150 } | 1153 } |
| 1151 } | 1154 } |
| 1152 } // namespace compiler | 1155 } // namespace compiler |
| 1153 } // namespace internal | 1156 } // namespace internal |
| 1154 } // namespace v8 | 1157 } // namespace v8 |
| OLD | NEW |