| 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 2178 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2189 NodeProperties::ChangeOp(node, lowering->machine()->WordEqual()); | 2189 NodeProperties::ChangeOp(node, lowering->machine()->WordEqual()); |
| 2190 } | 2190 } |
| 2191 return; | 2191 return; |
| 2192 } | 2192 } |
| 2193 case IrOpcode::kStringEqual: | 2193 case IrOpcode::kStringEqual: |
| 2194 case IrOpcode::kStringLessThan: | 2194 case IrOpcode::kStringLessThan: |
| 2195 case IrOpcode::kStringLessThanOrEqual: { | 2195 case IrOpcode::kStringLessThanOrEqual: { |
| 2196 return VisitBinop(node, UseInfo::AnyTagged(), | 2196 return VisitBinop(node, UseInfo::AnyTagged(), |
| 2197 MachineRepresentation::kTaggedPointer); | 2197 MachineRepresentation::kTaggedPointer); |
| 2198 } | 2198 } |
| 2199 case IrOpcode::kStringCharAt: { |
| 2200 VisitBinop(node, UseInfo::AnyTagged(), UseInfo::TruncatingWord32(), |
| 2201 MachineRepresentation::kTaggedPointer); |
| 2202 return; |
| 2203 } |
| 2199 case IrOpcode::kStringCharCodeAt: { | 2204 case IrOpcode::kStringCharCodeAt: { |
| 2200 VisitBinop(node, UseInfo::AnyTagged(), UseInfo::TruncatingWord32(), | 2205 VisitBinop(node, UseInfo::AnyTagged(), UseInfo::TruncatingWord32(), |
| 2201 MachineRepresentation::kWord32); | 2206 MachineRepresentation::kWord32); |
| 2202 return; | 2207 return; |
| 2203 } | 2208 } |
| 2204 case IrOpcode::kStringFromCharCode: { | 2209 case IrOpcode::kStringFromCharCode: { |
| 2205 VisitUnop(node, UseInfo::TruncatingWord32(), | 2210 VisitUnop(node, UseInfo::TruncatingWord32(), |
| 2206 MachineRepresentation::kTaggedPointer); | 2211 MachineRepresentation::kTaggedPointer); |
| 2207 return; | 2212 return; |
| 2208 } | 2213 } |
| (...skipping 1243 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3452 isolate(), graph()->zone(), callable.descriptor(), 0, flags, | 3457 isolate(), graph()->zone(), callable.descriptor(), 0, flags, |
| 3453 Operator::kNoProperties); | 3458 Operator::kNoProperties); |
| 3454 to_number_operator_.set(common()->Call(desc)); | 3459 to_number_operator_.set(common()->Call(desc)); |
| 3455 } | 3460 } |
| 3456 return to_number_operator_.get(); | 3461 return to_number_operator_.get(); |
| 3457 } | 3462 } |
| 3458 | 3463 |
| 3459 } // namespace compiler | 3464 } // namespace compiler |
| 3460 } // namespace internal | 3465 } // namespace internal |
| 3461 } // namespace v8 | 3466 } // namespace v8 |
| OLD | NEW |