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 852 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
863 case IrOpcode::kFloat64Sqrt: | 863 case IrOpcode::kFloat64Sqrt: |
864 case IrOpcode::kFloat64RoundDown: | 864 case IrOpcode::kFloat64RoundDown: |
865 case IrOpcode::kFloat64RoundTruncate: | 865 case IrOpcode::kFloat64RoundTruncate: |
866 case IrOpcode::kFloat64RoundTiesAway: | 866 case IrOpcode::kFloat64RoundTiesAway: |
867 case IrOpcode::kFloat64Equal: | 867 case IrOpcode::kFloat64Equal: |
868 case IrOpcode::kFloat64LessThan: | 868 case IrOpcode::kFloat64LessThan: |
869 case IrOpcode::kFloat64LessThanOrEqual: | 869 case IrOpcode::kFloat64LessThanOrEqual: |
870 case IrOpcode::kTruncateInt64ToInt32: | 870 case IrOpcode::kTruncateInt64ToInt32: |
871 case IrOpcode::kTruncateFloat64ToFloat32: | 871 case IrOpcode::kTruncateFloat64ToFloat32: |
872 case IrOpcode::kTruncateFloat64ToInt32: | 872 case IrOpcode::kTruncateFloat64ToInt32: |
| 873 case IrOpcode::kBitcastFloat32ToInt32: |
| 874 case IrOpcode::kBitcastFloat64ToInt64: |
| 875 case IrOpcode::kBitcastInt32ToFloat32: |
| 876 case IrOpcode::kBitcastInt64ToFloat64: |
873 case IrOpcode::kChangeInt32ToInt64: | 877 case IrOpcode::kChangeInt32ToInt64: |
874 case IrOpcode::kChangeUint32ToUint64: | 878 case IrOpcode::kChangeUint32ToUint64: |
875 case IrOpcode::kChangeInt32ToFloat64: | 879 case IrOpcode::kChangeInt32ToFloat64: |
876 case IrOpcode::kChangeUint32ToFloat64: | 880 case IrOpcode::kChangeUint32ToFloat64: |
877 case IrOpcode::kChangeFloat32ToFloat64: | 881 case IrOpcode::kChangeFloat32ToFloat64: |
878 case IrOpcode::kChangeFloat64ToInt32: | 882 case IrOpcode::kChangeFloat64ToInt32: |
879 case IrOpcode::kChangeFloat64ToUint32: | 883 case IrOpcode::kChangeFloat64ToUint32: |
880 case IrOpcode::kFloat64ExtractLowWord32: | 884 case IrOpcode::kFloat64ExtractLowWord32: |
881 case IrOpcode::kFloat64ExtractHighWord32: | 885 case IrOpcode::kFloat64ExtractHighWord32: |
882 case IrOpcode::kFloat64InsertLowWord32: | 886 case IrOpcode::kFloat64InsertLowWord32: |
(...skipping 263 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1146 // Check inputs for all nodes in the block. | 1150 // Check inputs for all nodes in the block. |
1147 for (size_t i = 0; i < block->NodeCount(); i++) { | 1151 for (size_t i = 0; i < block->NodeCount(); i++) { |
1148 Node* node = block->NodeAt(i); | 1152 Node* node = block->NodeAt(i); |
1149 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); | 1153 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); |
1150 } | 1154 } |
1151 } | 1155 } |
1152 } | 1156 } |
1153 } // namespace compiler | 1157 } // namespace compiler |
1154 } // namespace internal | 1158 } // namespace internal |
1155 } // namespace v8 | 1159 } // namespace v8 |
OLD | NEW |