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 1972 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1983 // that at some point, and maybe even a dedicated truncation. | 1983 // that at some point, and maybe even a dedicated truncation. |
1984 VisitUnop(node, UseInfo::AnyTagged(), | 1984 VisitUnop(node, UseInfo::AnyTagged(), |
1985 MachineRepresentation::kTagged); | 1985 MachineRepresentation::kTagged); |
1986 } | 1986 } |
1987 if (lower()) DeferReplacement(node, node->InputAt(0)); | 1987 if (lower()) DeferReplacement(node, node->InputAt(0)); |
1988 } else { | 1988 } else { |
1989 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); | 1989 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); |
1990 } | 1990 } |
1991 return; | 1991 return; |
1992 } | 1992 } |
| 1993 case IrOpcode::kCheckString: { |
| 1994 if (InputIs(node, Type::String())) { |
| 1995 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); |
| 1996 if (lower()) DeferReplacement(node, node->InputAt(0)); |
| 1997 } else { |
| 1998 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); |
| 1999 } |
| 2000 return; |
| 2001 } |
1993 case IrOpcode::kCheckTaggedPointer: { | 2002 case IrOpcode::kCheckTaggedPointer: { |
1994 if (InputCannotBe(node, Type::SignedSmall())) { | 2003 if (InputCannotBe(node, Type::SignedSmall())) { |
1995 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); | 2004 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); |
1996 if (lower()) DeferReplacement(node, node->InputAt(0)); | 2005 if (lower()) DeferReplacement(node, node->InputAt(0)); |
1997 } else { | 2006 } else { |
1998 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); | 2007 VisitUnop(node, UseInfo::AnyTagged(), MachineRepresentation::kTagged); |
1999 } | 2008 } |
2000 return; | 2009 return; |
2001 } | 2010 } |
2002 case IrOpcode::kCheckTaggedSigned: { | 2011 case IrOpcode::kCheckTaggedSigned: { |
(...skipping 1501 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3504 isolate(), graph()->zone(), callable.descriptor(), 0, flags, | 3513 isolate(), graph()->zone(), callable.descriptor(), 0, flags, |
3505 Operator::kNoProperties); | 3514 Operator::kNoProperties); |
3506 to_number_operator_.set(common()->Call(desc)); | 3515 to_number_operator_.set(common()->Call(desc)); |
3507 } | 3516 } |
3508 return to_number_operator_.get(); | 3517 return to_number_operator_.get(); |
3509 } | 3518 } |
3510 | 3519 |
3511 } // namespace compiler | 3520 } // namespace compiler |
3512 } // namespace internal | 3521 } // namespace internal |
3513 } // namespace v8 | 3522 } // namespace v8 |
OLD | NEW |