Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(572)

Side by Side Diff: src/compiler/verifier.cc

Issue 1044793002: [turbofan] Add backend support for float32 operations. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@master
Patch Set: Add MachineOperator unit tests. Created 5 years, 8 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
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 762 matching lines...) Expand 10 before | Expand all | Expand 10 after
773 case IrOpcode::kInt64Add: 773 case IrOpcode::kInt64Add:
774 case IrOpcode::kInt64Sub: 774 case IrOpcode::kInt64Sub:
775 case IrOpcode::kInt64Mul: 775 case IrOpcode::kInt64Mul:
776 case IrOpcode::kInt64Div: 776 case IrOpcode::kInt64Div:
777 case IrOpcode::kInt64Mod: 777 case IrOpcode::kInt64Mod:
778 case IrOpcode::kInt64LessThan: 778 case IrOpcode::kInt64LessThan:
779 case IrOpcode::kInt64LessThanOrEqual: 779 case IrOpcode::kInt64LessThanOrEqual:
780 case IrOpcode::kUint64Div: 780 case IrOpcode::kUint64Div:
781 case IrOpcode::kUint64Mod: 781 case IrOpcode::kUint64Mod:
782 case IrOpcode::kUint64LessThan: 782 case IrOpcode::kUint64LessThan:
783 case IrOpcode::kFloat32Add:
784 case IrOpcode::kFloat32Sub:
785 case IrOpcode::kFloat32Mul:
786 case IrOpcode::kFloat32Div:
787 case IrOpcode::kFloat32Max:
788 case IrOpcode::kFloat32Min:
789 case IrOpcode::kFloat32Sqrt:
790 case IrOpcode::kFloat32Equal:
791 case IrOpcode::kFloat32LessThan:
792 case IrOpcode::kFloat32LessThanOrEqual:
783 case IrOpcode::kFloat64Add: 793 case IrOpcode::kFloat64Add:
784 case IrOpcode::kFloat64Sub: 794 case IrOpcode::kFloat64Sub:
785 case IrOpcode::kFloat64Mul: 795 case IrOpcode::kFloat64Mul:
786 case IrOpcode::kFloat64Div: 796 case IrOpcode::kFloat64Div:
787 case IrOpcode::kFloat64Mod: 797 case IrOpcode::kFloat64Mod:
788 case IrOpcode::kFloat64Max: 798 case IrOpcode::kFloat64Max:
789 case IrOpcode::kFloat64Min: 799 case IrOpcode::kFloat64Min:
790 case IrOpcode::kFloat64Sqrt: 800 case IrOpcode::kFloat64Sqrt:
791 case IrOpcode::kFloat64RoundDown: 801 case IrOpcode::kFloat64RoundDown:
792 case IrOpcode::kFloat64RoundTruncate: 802 case IrOpcode::kFloat64RoundTruncate:
(...skipping 279 matching lines...) Expand 10 before | Expand all | Expand 10 after
1072 // Check inputs for all nodes in the block. 1082 // Check inputs for all nodes in the block.
1073 for (size_t i = 0; i < block->NodeCount(); i++) { 1083 for (size_t i = 0; i < block->NodeCount(); i++) {
1074 Node* node = block->NodeAt(i); 1084 Node* node = block->NodeAt(i);
1075 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1); 1085 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);
1076 } 1086 }
1077 } 1087 }
1078 } 1088 }
1079 } 1089 }
1080 } 1090 }
1081 } // namespace v8::internal::compiler 1091 } // namespace v8::internal::compiler
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698