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 2235 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2246 } | 2246 } |
2247 if (lower()) DeferReplacement(node, node->InputAt(0)); | 2247 if (lower()) DeferReplacement(node, node->InputAt(0)); |
2248 return; | 2248 return; |
2249 } | 2249 } |
2250 case IrOpcode::kCheckIf: { | 2250 case IrOpcode::kCheckIf: { |
2251 ProcessInput(node, 0, UseInfo::Bool()); | 2251 ProcessInput(node, 0, UseInfo::Bool()); |
2252 ProcessRemainingInputs(node, 1); | 2252 ProcessRemainingInputs(node, 1); |
2253 SetOutput(node, MachineRepresentation::kNone); | 2253 SetOutput(node, MachineRepresentation::kNone); |
2254 return; | 2254 return; |
2255 } | 2255 } |
| 2256 case IrOpcode::kCheckInternalizedString: { |
| 2257 if (InputIs(node, Type::InternalizedString())) { |
| 2258 VisitUnop(node, UseInfo::AnyTagged(), |
| 2259 MachineRepresentation::kTaggedPointer); |
| 2260 if (lower()) DeferReplacement(node, node->InputAt(0)); |
| 2261 } else { |
| 2262 VisitUnop(node, UseInfo::AnyTagged(), |
| 2263 MachineRepresentation::kTaggedPointer); |
| 2264 } |
| 2265 return; |
| 2266 } |
2256 case IrOpcode::kCheckNumber: { | 2267 case IrOpcode::kCheckNumber: { |
2257 if (InputIs(node, Type::Number())) { | 2268 if (InputIs(node, Type::Number())) { |
2258 if (truncation.IsUsedAsWord32()) { | 2269 if (truncation.IsUsedAsWord32()) { |
2259 VisitUnop(node, UseInfo::TruncatingWord32(), | 2270 VisitUnop(node, UseInfo::TruncatingWord32(), |
2260 MachineRepresentation::kWord32); | 2271 MachineRepresentation::kWord32); |
2261 } else { | 2272 } else { |
2262 // TODO(jarin,bmeurer): We need to go to Tagged here, because | 2273 // TODO(jarin,bmeurer): We need to go to Tagged here, because |
2263 // otherwise we cannot distinguish the hole NaN (which might need to | 2274 // otherwise we cannot distinguish the hole NaN (which might need to |
2264 // be treated as undefined). We should have a dedicated Type for | 2275 // be treated as undefined). We should have a dedicated Type for |
2265 // that at some point, and maybe even a dedicated truncation. | 2276 // that at some point, and maybe even a dedicated truncation. |
(...skipping 1192 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3458 isolate(), graph()->zone(), callable.descriptor(), 0, flags, | 3469 isolate(), graph()->zone(), callable.descriptor(), 0, flags, |
3459 Operator::kNoProperties); | 3470 Operator::kNoProperties); |
3460 to_number_operator_.set(common()->Call(desc)); | 3471 to_number_operator_.set(common()->Call(desc)); |
3461 } | 3472 } |
3462 return to_number_operator_.get(); | 3473 return to_number_operator_.get(); |
3463 } | 3474 } |
3464 | 3475 |
3465 } // namespace compiler | 3476 } // namespace compiler |
3466 } // namespace internal | 3477 } // namespace internal |
3467 } // namespace v8 | 3478 } // namespace v8 |
OLD | NEW |