| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 3507 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3518 DeoptimizeIf(ne, instr->environment()); | 3518 DeoptimizeIf(ne, instr->environment()); |
| 3519 // Retrieve the result. | 3519 // Retrieve the result. |
| 3520 __ vmov(result_reg, single_scratch); | 3520 __ vmov(result_reg, single_scratch); |
| 3521 } | 3521 } |
| 3522 __ bind(&done); | 3522 __ bind(&done); |
| 3523 } | 3523 } |
| 3524 | 3524 |
| 3525 | 3525 |
| 3526 void LCodeGen::DoCheckSmi(LCheckSmi* instr) { | 3526 void LCodeGen::DoCheckSmi(LCheckSmi* instr) { |
| 3527 LOperand* input = instr->InputAt(0); | 3527 LOperand* input = instr->InputAt(0); |
| 3528 ASSERT(input->IsRegister()); | |
| 3529 __ tst(ToRegister(input), Operand(kSmiTagMask)); | 3528 __ tst(ToRegister(input), Operand(kSmiTagMask)); |
| 3530 DeoptimizeIf(instr->condition(), instr->environment()); | 3529 DeoptimizeIf(ne, instr->environment()); |
| 3530 } |
| 3531 |
| 3532 |
| 3533 void LCodeGen::DoCheckNonSmi(LCheckNonSmi* instr) { |
| 3534 LOperand* input = instr->InputAt(0); |
| 3535 __ tst(ToRegister(input), Operand(kSmiTagMask)); |
| 3536 DeoptimizeIf(eq, instr->environment()); |
| 3531 } | 3537 } |
| 3532 | 3538 |
| 3533 | 3539 |
| 3534 void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) { | 3540 void LCodeGen::DoCheckInstanceType(LCheckInstanceType* instr) { |
| 3535 Register input = ToRegister(instr->InputAt(0)); | 3541 Register input = ToRegister(instr->InputAt(0)); |
| 3536 Register scratch = scratch0(); | 3542 Register scratch = scratch0(); |
| 3537 InstanceType first = instr->hydrogen()->first(); | 3543 InstanceType first = instr->hydrogen()->first(); |
| 3538 InstanceType last = instr->hydrogen()->last(); | 3544 InstanceType last = instr->hydrogen()->last(); |
| 3539 | 3545 |
| 3540 __ ldr(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); | 3546 __ ldr(scratch, FieldMemOperand(input, HeapObject::kMapOffset)); |
| (...skipping 172 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3713 __ str(r3, FieldMemOperand(r0, size - kPointerSize)); | 3719 __ str(r3, FieldMemOperand(r0, size - kPointerSize)); |
| 3714 } | 3720 } |
| 3715 } | 3721 } |
| 3716 | 3722 |
| 3717 | 3723 |
| 3718 void LCodeGen::DoFunctionLiteral(LFunctionLiteral* instr) { | 3724 void LCodeGen::DoFunctionLiteral(LFunctionLiteral* instr) { |
| 3719 // Use the fast case closure allocation code that allocates in new | 3725 // Use the fast case closure allocation code that allocates in new |
| 3720 // space for nested functions that don't need literals cloning. | 3726 // space for nested functions that don't need literals cloning. |
| 3721 Handle<SharedFunctionInfo> shared_info = instr->shared_info(); | 3727 Handle<SharedFunctionInfo> shared_info = instr->shared_info(); |
| 3722 bool pretenure = instr->hydrogen()->pretenure(); | 3728 bool pretenure = instr->hydrogen()->pretenure(); |
| 3723 if (shared_info->num_literals() == 0 && !pretenure) { | 3729 if (!pretenure && shared_info->num_literals() == 0) { |
| 3724 FastNewClosureStub stub; | 3730 FastNewClosureStub stub( |
| 3731 shared_info->strict_mode() ? kStrictMode : kNonStrictMode); |
| 3725 __ mov(r1, Operand(shared_info)); | 3732 __ mov(r1, Operand(shared_info)); |
| 3726 __ push(r1); | 3733 __ push(r1); |
| 3727 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); | 3734 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); |
| 3728 } else { | 3735 } else { |
| 3729 __ mov(r2, Operand(shared_info)); | 3736 __ mov(r2, Operand(shared_info)); |
| 3730 __ mov(r1, Operand(pretenure | 3737 __ mov(r1, Operand(pretenure |
| 3731 ? Factory::true_value() | 3738 ? Factory::true_value() |
| 3732 : Factory::false_value())); | 3739 : Factory::false_value())); |
| 3733 __ Push(cp, r2, r1); | 3740 __ Push(cp, r2, r1); |
| 3734 CallRuntime(Runtime::kNewClosure, 3, instr); | 3741 CallRuntime(Runtime::kNewClosure, 3, instr); |
| (...skipping 215 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3950 ASSERT(!environment->HasBeenRegistered()); | 3957 ASSERT(!environment->HasBeenRegistered()); |
| 3951 RegisterEnvironmentForDeoptimization(environment); | 3958 RegisterEnvironmentForDeoptimization(environment); |
| 3952 ASSERT(osr_pc_offset_ == -1); | 3959 ASSERT(osr_pc_offset_ == -1); |
| 3953 osr_pc_offset_ = masm()->pc_offset(); | 3960 osr_pc_offset_ = masm()->pc_offset(); |
| 3954 } | 3961 } |
| 3955 | 3962 |
| 3956 | 3963 |
| 3957 #undef __ | 3964 #undef __ |
| 3958 | 3965 |
| 3959 } } // namespace v8::internal | 3966 } } // namespace v8::internal |
| OLD | NEW |