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 532 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
543 CheckUpperIs(node, Type::Receiver()); | 543 CheckUpperIs(node, Type::Receiver()); |
544 break; | 544 break; |
545 case IrOpcode::kJSCallFunction: | 545 case IrOpcode::kJSCallFunction: |
546 case IrOpcode::kJSCallRuntime: | 546 case IrOpcode::kJSCallRuntime: |
547 case IrOpcode::kJSYield: | 547 case IrOpcode::kJSYield: |
548 case IrOpcode::kJSDebugger: | 548 case IrOpcode::kJSDebugger: |
549 // Type can be anything. | 549 // Type can be anything. |
550 CheckUpperIs(node, Type::Any()); | 550 CheckUpperIs(node, Type::Any()); |
551 break; | 551 break; |
552 | 552 |
| 553 case IrOpcode::kJSStackCheck: |
| 554 // Type is empty. |
| 555 CheckNotTyped(node); |
| 556 break; |
| 557 |
553 // Simplified operators | 558 // Simplified operators |
554 // ------------------------------- | 559 // ------------------------------- |
555 case IrOpcode::kAnyToBoolean: | 560 case IrOpcode::kAnyToBoolean: |
556 // Type is Boolean. | 561 // Type is Boolean. |
557 CheckUpperIs(node, Type::Boolean()); | 562 CheckUpperIs(node, Type::Boolean()); |
558 break; | 563 break; |
559 case IrOpcode::kBooleanNot: | 564 case IrOpcode::kBooleanNot: |
560 // Boolean -> Boolean | 565 // Boolean -> Boolean |
561 CheckValueInputIs(node, 0, Type::Boolean()); | 566 CheckValueInputIs(node, 0, Type::Boolean()); |
562 CheckUpperIs(node, Type::Boolean()); | 567 CheckUpperIs(node, Type::Boolean()); |
(...skipping 494 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1057 // Check inputs for all nodes in the block. | 1062 // Check inputs for all nodes in the block. |
1058 for (size_t i = 0; i < block->NodeCount(); i++) { | 1063 for (size_t i = 0; i < block->NodeCount(); i++) { |
1059 Node* node = block->NodeAt(i); | 1064 Node* node = block->NodeAt(i); |
1060 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 1065 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
1061 } | 1066 } |
1062 } | 1067 } |
1063 } | 1068 } |
1064 } | 1069 } |
1065 } | 1070 } |
1066 } // namespace v8::internal::compiler | 1071 } // namespace v8::internal::compiler |
OLD | NEW |