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/simplified-lowering.h" | 5 #include "src/compiler/simplified-lowering.h" |
6 | 6 |
7 #include <limits> | 7 #include <limits> |
8 | 8 |
9 #include "src/address-map.h" | 9 #include "src/address-map.h" |
10 #include "src/base/bits.h" | 10 #include "src/base/bits.h" |
(...skipping 1174 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1185 return VisitLeaf(node, MachineRepresentation::kFloat32); | 1185 return VisitLeaf(node, MachineRepresentation::kFloat32); |
1186 case IrOpcode::kFloat64Constant: | 1186 case IrOpcode::kFloat64Constant: |
1187 return VisitLeaf(node, MachineRepresentation::kFloat64); | 1187 return VisitLeaf(node, MachineRepresentation::kFloat64); |
1188 case IrOpcode::kExternalConstant: | 1188 case IrOpcode::kExternalConstant: |
1189 return VisitLeaf(node, MachineType::PointerRepresentation()); | 1189 return VisitLeaf(node, MachineType::PointerRepresentation()); |
1190 case IrOpcode::kNumberConstant: | 1190 case IrOpcode::kNumberConstant: |
1191 return VisitLeaf(node, MachineRepresentation::kTagged); | 1191 return VisitLeaf(node, MachineRepresentation::kTagged); |
1192 case IrOpcode::kHeapConstant: | 1192 case IrOpcode::kHeapConstant: |
1193 return VisitLeaf(node, MachineRepresentation::kTagged); | 1193 return VisitLeaf(node, MachineRepresentation::kTagged); |
1194 | 1194 |
1195 case IrOpcode::kCheckIf: | |
1196 case IrOpcode::kCheckUnless: | |
1197 ProcessInput(node, 0, UseInfo::Bool()); | |
1198 ProcessRemainingInputs(node, 1); | |
1199 return; | |
1200 case IrOpcode::kDeoptimizeIf: | 1195 case IrOpcode::kDeoptimizeIf: |
1201 case IrOpcode::kDeoptimizeUnless: | 1196 case IrOpcode::kDeoptimizeUnless: |
1202 ProcessInput(node, 0, UseInfo::Bool()); | 1197 ProcessInput(node, 0, UseInfo::Bool()); |
1203 ProcessInput(node, 1, UseInfo::AnyTagged()); | 1198 ProcessInput(node, 1, UseInfo::AnyTagged()); |
1204 ProcessRemainingInputs(node, 2); | 1199 ProcessRemainingInputs(node, 2); |
1205 return; | 1200 return; |
1206 case IrOpcode::kBranch: | 1201 case IrOpcode::kBranch: |
1207 ProcessInput(node, 0, UseInfo::Bool()); | 1202 ProcessInput(node, 0, UseInfo::Bool()); |
1208 EnqueueInput(node, NodeProperties::FirstControlIndex(node)); | 1203 EnqueueInput(node, NodeProperties::FirstControlIndex(node)); |
1209 return; | 1204 return; |
(...skipping 1823 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3033 isolate(), graph()->zone(), callable.descriptor(), 0, flags, | 3028 isolate(), graph()->zone(), callable.descriptor(), 0, flags, |
3034 Operator::kNoProperties); | 3029 Operator::kNoProperties); |
3035 to_number_operator_.set(common()->Call(desc)); | 3030 to_number_operator_.set(common()->Call(desc)); |
3036 } | 3031 } |
3037 return to_number_operator_.get(); | 3032 return to_number_operator_.get(); |
3038 } | 3033 } |
3039 | 3034 |
3040 } // namespace compiler | 3035 } // namespace compiler |
3041 } // namespace internal | 3036 } // namespace internal |
3042 } // namespace v8 | 3037 } // namespace v8 |
OLD | NEW |