| Index: src/mips/lithium-codegen-mips.cc
|
| diff --git a/src/mips/lithium-codegen-mips.cc b/src/mips/lithium-codegen-mips.cc
|
| index 91be0d6a5095d3936f7f5d7691db1a35c42b6d35..aa56d7298e6900d00241bfceaf808076f6a0e2a1 100644
|
| --- a/src/mips/lithium-codegen-mips.cc
|
| +++ b/src/mips/lithium-codegen-mips.cc
|
| @@ -36,7 +36,7 @@ namespace v8 {
|
| namespace internal {
|
|
|
|
|
| -class SafepointGenerator : public CallWrapper {
|
| +class SafepointGenerator V8_FINAL : public CallWrapper {
|
| public:
|
| SafepointGenerator(LCodeGen* codegen,
|
| LPointerMap* pointers,
|
| @@ -44,11 +44,11 @@ class SafepointGenerator : public CallWrapper {
|
| : codegen_(codegen),
|
| pointers_(pointers),
|
| deopt_mode_(mode) { }
|
| - virtual ~SafepointGenerator() { }
|
| + virtual ~SafepointGenerator() {}
|
|
|
| - virtual void BeforeCall(int call_size) const { }
|
| + virtual void BeforeCall(int call_size) const V8_OVERRIDE {}
|
|
|
| - virtual void AfterCall() const {
|
| + virtual void AfterCall() const V8_OVERRIDE {
|
| codegen_->RecordSafepoint(pointers_, deopt_mode_);
|
| }
|
|
|
| @@ -323,16 +323,6 @@ bool LCodeGen::GenerateDeferredCode() {
|
|
|
|
|
| bool LCodeGen::GenerateDeoptJumpTable() {
|
| - // Check that the jump table is accessible from everywhere in the function
|
| - // code, i.e. that offsets to the table can be encoded in the 16bit signed
|
| - // immediate of a branch instruction.
|
| - // To simplify we consider the code size from the first instruction to the
|
| - // end of the jump table.
|
| - if (!is_int16((masm()->pc_offset() / Assembler::kInstrSize) +
|
| - deopt_jump_table_.length() * 12)) {
|
| - Abort(kGeneratedCodeIsTooLarge);
|
| - }
|
| -
|
| if (deopt_jump_table_.length() > 0) {
|
| Comment(";;; -------------------- Jump table --------------------");
|
| }
|
| @@ -762,7 +752,7 @@ void LCodeGen::RegisterEnvironmentForDeoptimization(LEnvironment* environment,
|
| }
|
|
|
|
|
| -void LCodeGen::DeoptimizeIf(Condition cc,
|
| +void LCodeGen::DeoptimizeIf(Condition condition,
|
| LEnvironment* environment,
|
| Deoptimizer::BailoutType bailout_type,
|
| Register src1,
|
| @@ -789,16 +779,16 @@ void LCodeGen::DeoptimizeIf(Condition cc,
|
|
|
| if (info()->ShouldTrapOnDeopt()) {
|
| Label skip;
|
| - if (cc != al) {
|
| - __ Branch(&skip, NegateCondition(cc), src1, src2);
|
| + if (condition != al) {
|
| + __ Branch(&skip, NegateCondition(condition), src1, src2);
|
| }
|
| __ stop("trap_on_deopt");
|
| __ bind(&skip);
|
| }
|
|
|
| ASSERT(info()->IsStub() || frame_is_built_);
|
| - if (cc == al && frame_is_built_) {
|
| - __ Call(entry, RelocInfo::RUNTIME_ENTRY, cc, src1, src2);
|
| + if (condition == al && frame_is_built_) {
|
| + __ Call(entry, RelocInfo::RUNTIME_ENTRY, condition, src1, src2);
|
| } else {
|
| // We often have several deopts to the same entry, reuse the last
|
| // jump entry if this is the case.
|
| @@ -811,19 +801,19 @@ void LCodeGen::DeoptimizeIf(Condition cc,
|
| !frame_is_built_);
|
| deopt_jump_table_.Add(table_entry, zone());
|
| }
|
| - __ Branch(&deopt_jump_table_.last().label, cc, src1, src2);
|
| + __ Branch(&deopt_jump_table_.last().label, condition, src1, src2);
|
| }
|
| }
|
|
|
|
|
| -void LCodeGen::DeoptimizeIf(Condition cc,
|
| +void LCodeGen::DeoptimizeIf(Condition condition,
|
| LEnvironment* environment,
|
| Register src1,
|
| const Operand& src2) {
|
| Deoptimizer::BailoutType bailout_type = info()->IsStub()
|
| ? Deoptimizer::LAZY
|
| : Deoptimizer::EAGER;
|
| - DeoptimizeIf(cc, environment, bailout_type, src1, src2);
|
| + DeoptimizeIf(condition, environment, bailout_type, src1, src2);
|
| }
|
|
|
|
|
| @@ -1993,20 +1983,22 @@ int LCodeGen::GetNextEmittedBlock() const {
|
|
|
| template<class InstrType>
|
| void LCodeGen::EmitBranch(InstrType instr,
|
| - Condition cc, Register src1, const Operand& src2) {
|
| + Condition condition,
|
| + Register src1,
|
| + const Operand& src2) {
|
| int left_block = instr->TrueDestination(chunk_);
|
| int right_block = instr->FalseDestination(chunk_);
|
|
|
| int next_block = GetNextEmittedBlock();
|
| - if (right_block == left_block || cc == al) {
|
| + if (right_block == left_block || condition == al) {
|
| EmitGoto(left_block);
|
| } else if (left_block == next_block) {
|
| __ Branch(chunk_->GetAssemblyLabel(right_block),
|
| - NegateCondition(cc), src1, src2);
|
| + NegateCondition(condition), src1, src2);
|
| } else if (right_block == next_block) {
|
| - __ Branch(chunk_->GetAssemblyLabel(left_block), cc, src1, src2);
|
| + __ Branch(chunk_->GetAssemblyLabel(left_block), condition, src1, src2);
|
| } else {
|
| - __ Branch(chunk_->GetAssemblyLabel(left_block), cc, src1, src2);
|
| + __ Branch(chunk_->GetAssemblyLabel(left_block), condition, src1, src2);
|
| __ Branch(chunk_->GetAssemblyLabel(right_block));
|
| }
|
| }
|
| @@ -2014,7 +2006,9 @@ void LCodeGen::EmitBranch(InstrType instr,
|
|
|
| template<class InstrType>
|
| void LCodeGen::EmitBranchF(InstrType instr,
|
| - Condition cc, FPURegister src1, FPURegister src2) {
|
| + Condition condition,
|
| + FPURegister src1,
|
| + FPURegister src2) {
|
| int right_block = instr->FalseDestination(chunk_);
|
| int left_block = instr->TrueDestination(chunk_);
|
|
|
| @@ -2023,16 +2017,29 @@ void LCodeGen::EmitBranchF(InstrType instr,
|
| EmitGoto(left_block);
|
| } else if (left_block == next_block) {
|
| __ BranchF(chunk_->GetAssemblyLabel(right_block), NULL,
|
| - NegateCondition(cc), src1, src2);
|
| + NegateCondition(condition), src1, src2);
|
| } else if (right_block == next_block) {
|
| - __ BranchF(chunk_->GetAssemblyLabel(left_block), NULL, cc, src1, src2);
|
| + __ BranchF(chunk_->GetAssemblyLabel(left_block), NULL,
|
| + condition, src1, src2);
|
| } else {
|
| - __ BranchF(chunk_->GetAssemblyLabel(left_block), NULL, cc, src1, src2);
|
| + __ BranchF(chunk_->GetAssemblyLabel(left_block), NULL,
|
| + condition, src1, src2);
|
| __ Branch(chunk_->GetAssemblyLabel(right_block));
|
| }
|
| }
|
|
|
|
|
| +template<class InstrType>
|
| +void LCodeGen::EmitFalseBranchF(InstrType instr,
|
| + Condition condition,
|
| + FPURegister src1,
|
| + FPURegister src2) {
|
| + int false_block = instr->FalseDestination(chunk_);
|
| + __ BranchF(chunk_->GetAssemblyLabel(false_block), NULL,
|
| + condition, src1, src2);
|
| +}
|
| +
|
| +
|
| void LCodeGen::DoDebugBreak(LDebugBreak* instr) {
|
| __ stop("LDebugBreak");
|
| }
|
| @@ -2293,6 +2300,23 @@ void LCodeGen::DoCmpObjectEqAndBranch(LCmpObjectEqAndBranch* instr) {
|
| }
|
|
|
|
|
| +void LCodeGen::DoCmpHoleAndBranch(LCmpHoleAndBranch* instr) {
|
| + if (instr->hydrogen()->representation().IsTagged()) {
|
| + Register input_reg = ToRegister(instr->object());
|
| + __ li(at, Operand(factory()->the_hole_value()));
|
| + EmitBranch(instr, eq, input_reg, Operand(at));
|
| + return;
|
| + }
|
| +
|
| + DoubleRegister input_reg = ToDoubleRegister(instr->object());
|
| + EmitFalseBranchF(instr, eq, input_reg, input_reg);
|
| +
|
| + Register scratch = scratch0();
|
| + __ FmoveHigh(scratch, input_reg);
|
| + EmitBranch(instr, eq, scratch, Operand(kHoleNanUpper32));
|
| +}
|
| +
|
| +
|
| Condition LCodeGen::EmitIsObject(Register input,
|
| Register temp1,
|
| Register temp2,
|
| @@ -2581,15 +2605,15 @@ void LCodeGen::DoInstanceOf(LInstanceOf* instr) {
|
|
|
|
|
| void LCodeGen::DoInstanceOfKnownGlobal(LInstanceOfKnownGlobal* instr) {
|
| - class DeferredInstanceOfKnownGlobal: public LDeferredCode {
|
| + class DeferredInstanceOfKnownGlobal V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredInstanceOfKnownGlobal(LCodeGen* codegen,
|
| LInstanceOfKnownGlobal* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() {
|
| + virtual void Generate() V8_OVERRIDE {
|
| codegen()->DoDeferredInstanceOfKnownGlobal(instr_, &map_check_);
|
| }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| Label* map_check() { return &map_check_; }
|
|
|
| private:
|
| @@ -2921,90 +2945,6 @@ void LCodeGen::DoLoadNamedField(LLoadNamedField* instr) {
|
| }
|
|
|
|
|
| -void LCodeGen::EmitLoadFieldOrConstantFunction(Register result,
|
| - Register object,
|
| - Handle<Map> type,
|
| - Handle<String> name,
|
| - LEnvironment* env) {
|
| - LookupResult lookup(isolate());
|
| - type->LookupDescriptor(NULL, *name, &lookup);
|
| - ASSERT(lookup.IsFound() || lookup.IsCacheable());
|
| - if (lookup.IsField()) {
|
| - int index = lookup.GetLocalFieldIndexFromMap(*type);
|
| - int offset = index * kPointerSize;
|
| - if (index < 0) {
|
| - // Negative property indices are in-object properties, indexed
|
| - // from the end of the fixed part of the object.
|
| - __ lw(result, FieldMemOperand(object, offset + type->instance_size()));
|
| - } else {
|
| - // Non-negative property indices are in the properties array.
|
| - __ lw(result, FieldMemOperand(object, JSObject::kPropertiesOffset));
|
| - __ lw(result, FieldMemOperand(result, offset + FixedArray::kHeaderSize));
|
| - }
|
| - } else if (lookup.IsConstant()) {
|
| - Handle<Object> constant(lookup.GetConstantFromMap(*type), isolate());
|
| - __ LoadObject(result, constant);
|
| - } else {
|
| - // Negative lookup.
|
| - // Check prototypes.
|
| - Handle<HeapObject> current(HeapObject::cast((*type)->prototype()));
|
| - Heap* heap = type->GetHeap();
|
| - while (*current != heap->null_value()) {
|
| - __ LoadHeapObject(result, current);
|
| - __ lw(result, FieldMemOperand(result, HeapObject::kMapOffset));
|
| - DeoptimizeIf(ne, env, result, Operand(Handle<Map>(current->map())));
|
| - current =
|
| - Handle<HeapObject>(HeapObject::cast(current->map()->prototype()));
|
| - }
|
| - __ LoadRoot(result, Heap::kUndefinedValueRootIndex);
|
| - }
|
| -}
|
| -
|
| -
|
| -void LCodeGen::DoLoadNamedFieldPolymorphic(LLoadNamedFieldPolymorphic* instr) {
|
| - Register object = ToRegister(instr->object());
|
| - Register result = ToRegister(instr->result());
|
| - Register object_map = scratch0();
|
| -
|
| - int map_count = instr->hydrogen()->types()->length();
|
| - bool need_generic = instr->hydrogen()->need_generic();
|
| -
|
| - if (map_count == 0 && !need_generic) {
|
| - DeoptimizeIf(al, instr->environment());
|
| - return;
|
| - }
|
| - Handle<String> name = instr->hydrogen()->name();
|
| - Label done;
|
| - __ lw(object_map, FieldMemOperand(object, HeapObject::kMapOffset));
|
| - for (int i = 0; i < map_count; ++i) {
|
| - bool last = (i == map_count - 1);
|
| - Handle<Map> map = instr->hydrogen()->types()->at(i);
|
| - Label check_passed;
|
| - __ CompareMapAndBranch(object_map, map, &check_passed, eq, &check_passed);
|
| - if (last && !need_generic) {
|
| - DeoptimizeIf(al, instr->environment());
|
| - __ bind(&check_passed);
|
| - EmitLoadFieldOrConstantFunction(
|
| - result, object, map, name, instr->environment());
|
| - } else {
|
| - Label next;
|
| - __ Branch(&next);
|
| - __ bind(&check_passed);
|
| - EmitLoadFieldOrConstantFunction(
|
| - result, object, map, name, instr->environment());
|
| - __ Branch(&done);
|
| - __ bind(&next);
|
| - }
|
| - }
|
| - if (need_generic) {
|
| - __ li(a2, Operand(name));
|
| - Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
|
| - CallCode(ic, RelocInfo::CODE_TARGET, instr);
|
| - }
|
| - __ bind(&done);
|
| -}
|
| -
|
| -
|
| void LCodeGen::DoLoadNamedGeneric(LLoadNamedGeneric* instr) {
|
| ASSERT(ToRegister(instr->object()).is(a0));
|
| ASSERT(ToRegister(instr->result()).is(v0));
|
| @@ -3659,14 +3599,14 @@ void LCodeGen::EmitIntegerMathAbs(LMathAbs* instr) {
|
|
|
| void LCodeGen::DoMathAbs(LMathAbs* instr) {
|
| // Class for deferred case.
|
| - class DeferredMathAbsTaggedHeapNumber: public LDeferredCode {
|
| + class DeferredMathAbsTaggedHeapNumber V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredMathAbsTaggedHeapNumber(LCodeGen* codegen, LMathAbs* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() {
|
| + virtual void Generate() V8_OVERRIDE {
|
| codegen()->DoDeferredMathAbsTaggedHeapNumber(instr_);
|
| }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LMathAbs* instr_;
|
| };
|
| @@ -3861,12 +3801,12 @@ void LCodeGen::DoPower(LPower* instr) {
|
|
|
|
|
| void LCodeGen::DoRandom(LRandom* instr) {
|
| - class DeferredDoRandom: public LDeferredCode {
|
| + class DeferredDoRandom V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredDoRandom(LCodeGen* codegen, LRandom* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredRandom(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE { codegen()->DoDeferredRandom(instr_); }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LRandom* instr_;
|
| };
|
| @@ -4233,17 +4173,17 @@ void LCodeGen::DoStoreNamedGeneric(LStoreNamedGeneric* instr) {
|
| }
|
|
|
|
|
| -void LCodeGen::ApplyCheckIf(Condition cc,
|
| +void LCodeGen::ApplyCheckIf(Condition condition,
|
| LBoundsCheck* check,
|
| Register src1,
|
| const Operand& src2) {
|
| if (FLAG_debug_code && check->hydrogen()->skip_check()) {
|
| Label done;
|
| - __ Branch(&done, NegateCondition(cc), src1, src2);
|
| + __ Branch(&done, NegateCondition(condition), src1, src2);
|
| __ stop("eliminated bounds check failed");
|
| __ bind(&done);
|
| } else {
|
| - DeoptimizeIf(cc, check->environment(), src1, src2);
|
| + DeoptimizeIf(condition, check->environment(), src1, src2);
|
| }
|
| }
|
|
|
| @@ -4489,12 +4429,13 @@ void LCodeGen::DoTransitionElementsKind(LTransitionElementsKind* instr) {
|
| __ RecordWriteField(object_reg, HeapObject::kMapOffset, new_map_reg,
|
| scratch, GetRAState(), kDontSaveFPRegs);
|
| } else {
|
| - PushSafepointRegistersScope scope(this, Safepoint::kWithRegisters);
|
| + PushSafepointRegistersScope scope(
|
| + this, Safepoint::kWithRegistersAndDoubles);
|
| __ mov(a0, object_reg);
|
| __ li(a1, Operand(to_map));
|
| TransitionElementsKindStub stub(from_kind, to_kind);
|
| __ CallStub(&stub);
|
| - RecordSafepointWithRegisters(
|
| + RecordSafepointWithRegistersAndDoubles(
|
| instr->pointer_map(), 0, Safepoint::kNoLazyDeopt);
|
| }
|
| __ bind(¬_applicable);
|
| @@ -4520,12 +4461,14 @@ void LCodeGen::DoStringAdd(LStringAdd* instr) {
|
|
|
|
|
| void LCodeGen::DoStringCharCodeAt(LStringCharCodeAt* instr) {
|
| - class DeferredStringCharCodeAt: public LDeferredCode {
|
| + class DeferredStringCharCodeAt V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredStringCharCodeAt(LCodeGen* codegen, LStringCharCodeAt* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredStringCharCodeAt(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE {
|
| + codegen()->DoDeferredStringCharCodeAt(instr_);
|
| + }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LStringCharCodeAt* instr_;
|
| };
|
| @@ -4572,12 +4515,14 @@ void LCodeGen::DoDeferredStringCharCodeAt(LStringCharCodeAt* instr) {
|
|
|
|
|
| void LCodeGen::DoStringCharFromCode(LStringCharFromCode* instr) {
|
| - class DeferredStringCharFromCode: public LDeferredCode {
|
| + class DeferredStringCharFromCode V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredStringCharFromCode(LCodeGen* codegen, LStringCharFromCode* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredStringCharFromCode(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE {
|
| + codegen()->DoDeferredStringCharFromCode(instr_);
|
| + }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LStringCharFromCode* instr_;
|
| };
|
| @@ -4663,16 +4608,16 @@ void LCodeGen::DoUint32ToDouble(LUint32ToDouble* instr) {
|
|
|
|
|
| void LCodeGen::DoNumberTagI(LNumberTagI* instr) {
|
| - class DeferredNumberTagI: public LDeferredCode {
|
| + class DeferredNumberTagI V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredNumberTagI(LCodeGen* codegen, LNumberTagI* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() {
|
| + virtual void Generate() V8_OVERRIDE {
|
| codegen()->DoDeferredNumberTagI(instr_,
|
| instr_->value(),
|
| SIGNED_INT32);
|
| }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LNumberTagI* instr_;
|
| };
|
| @@ -4689,16 +4634,16 @@ void LCodeGen::DoNumberTagI(LNumberTagI* instr) {
|
|
|
|
|
| void LCodeGen::DoNumberTagU(LNumberTagU* instr) {
|
| - class DeferredNumberTagU: public LDeferredCode {
|
| + class DeferredNumberTagU V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredNumberTagU(LCodeGen* codegen, LNumberTagU* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() {
|
| + virtual void Generate() V8_OVERRIDE {
|
| codegen()->DoDeferredNumberTagI(instr_,
|
| instr_->value(),
|
| UNSIGNED_INT32);
|
| }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LNumberTagU* instr_;
|
| };
|
| @@ -4769,12 +4714,14 @@ void LCodeGen::DoDeferredNumberTagI(LInstruction* instr,
|
|
|
|
|
| void LCodeGen::DoNumberTagD(LNumberTagD* instr) {
|
| - class DeferredNumberTagD: public LDeferredCode {
|
| + class DeferredNumberTagD V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredNumberTagD(LCodeGen* codegen, LNumberTagD* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredNumberTagD(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE {
|
| + codegen()->DoDeferredNumberTagD(instr_);
|
| + }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LNumberTagD* instr_;
|
| };
|
| @@ -4785,29 +4732,6 @@ void LCodeGen::DoNumberTagD(LNumberTagD* instr) {
|
| Register temp1 = ToRegister(instr->temp());
|
| Register temp2 = ToRegister(instr->temp2());
|
|
|
| - bool convert_hole = false;
|
| - HValue* change_input = instr->hydrogen()->value();
|
| - if (change_input->IsLoadKeyed()) {
|
| - HLoadKeyed* load = HLoadKeyed::cast(change_input);
|
| - convert_hole = load->UsesMustHandleHole();
|
| - }
|
| -
|
| - Label no_special_nan_handling;
|
| - Label done;
|
| - if (convert_hole) {
|
| - DoubleRegister input_reg = ToDoubleRegister(instr->value());
|
| - __ BranchF(&no_special_nan_handling, NULL, eq, input_reg, input_reg);
|
| - __ Move(reg, scratch0(), input_reg);
|
| - Label canonicalize;
|
| - __ Branch(&canonicalize, ne, scratch0(), Operand(kHoleNanUpper32));
|
| - __ li(reg, factory()->the_hole_value());
|
| - __ Branch(&done);
|
| - __ bind(&canonicalize);
|
| - __ Move(input_reg,
|
| - FixedDoubleArray::canonical_not_the_hole_nan_as_double());
|
| - }
|
| -
|
| - __ bind(&no_special_nan_handling);
|
| DeferredNumberTagD* deferred = new(zone()) DeferredNumberTagD(this, instr);
|
| if (FLAG_inline_new) {
|
| __ LoadRoot(scratch, Heap::kHeapNumberMapRootIndex);
|
| @@ -4821,7 +4745,6 @@ void LCodeGen::DoNumberTagD(LNumberTagD* instr) {
|
| __ sdc1(input_reg, MemOperand(reg, HeapNumber::kValueOffset));
|
| // Now that we have finished with the object's real address tag it
|
| __ Addu(reg, reg, kHeapObjectTag);
|
| - __ bind(&done);
|
| }
|
|
|
|
|
| @@ -4863,7 +4786,7 @@ void LCodeGen::DoSmiUntag(LSmiUntag* instr) {
|
|
|
| void LCodeGen::EmitNumberUntagD(Register input_reg,
|
| DoubleRegister result_reg,
|
| - bool allow_undefined_as_nan,
|
| + bool can_convert_undefined_to_nan,
|
| bool deoptimize_on_minus_zero,
|
| LEnvironment* env,
|
| NumberUntagDMode mode) {
|
| @@ -4871,16 +4794,14 @@ void LCodeGen::EmitNumberUntagD(Register input_reg,
|
|
|
| Label load_smi, heap_number, done;
|
|
|
| - STATIC_ASSERT(NUMBER_CANDIDATE_IS_ANY_TAGGED_CONVERT_HOLE >
|
| - NUMBER_CANDIDATE_IS_ANY_TAGGED);
|
| - if (mode >= NUMBER_CANDIDATE_IS_ANY_TAGGED) {
|
| + if (mode == NUMBER_CANDIDATE_IS_ANY_TAGGED) {
|
| // Smi check.
|
| __ UntagAndJumpIfSmi(scratch, input_reg, &load_smi);
|
|
|
| // Heap number map check.
|
| __ lw(scratch, FieldMemOperand(input_reg, HeapObject::kMapOffset));
|
| __ LoadRoot(at, Heap::kHeapNumberMapRootIndex);
|
| - if (!allow_undefined_as_nan) {
|
| + if (!can_convert_undefined_to_nan) {
|
| DeoptimizeIf(ne, env, scratch, Operand(at));
|
| } else {
|
| Label heap_number, convert;
|
| @@ -4888,10 +4809,6 @@ void LCodeGen::EmitNumberUntagD(Register input_reg,
|
|
|
| // Convert undefined (and hole) to NaN.
|
| __ LoadRoot(at, Heap::kUndefinedValueRootIndex);
|
| - if (mode == NUMBER_CANDIDATE_IS_ANY_TAGGED_CONVERT_HOLE) {
|
| - __ Branch(&convert, eq, input_reg, Operand(at));
|
| - __ LoadRoot(at, Heap::kTheHoleValueRootIndex);
|
| - }
|
| DeoptimizeIf(ne, env, input_reg, Operand(at));
|
|
|
| __ bind(&convert);
|
| @@ -5003,12 +4920,14 @@ void LCodeGen::DoDeferredTaggedToI(LTaggedToI* instr) {
|
|
|
|
|
| void LCodeGen::DoTaggedToI(LTaggedToI* instr) {
|
| - class DeferredTaggedToI: public LDeferredCode {
|
| + class DeferredTaggedToI V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredTaggedToI(LCodeGen* codegen, LTaggedToI* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredTaggedToI(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE {
|
| + codegen()->DoDeferredTaggedToI(instr_);
|
| + }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LTaggedToI* instr_;
|
| };
|
| @@ -5039,21 +4958,12 @@ void LCodeGen::DoNumberUntagD(LNumberUntagD* instr) {
|
| Register input_reg = ToRegister(input);
|
| DoubleRegister result_reg = ToDoubleRegister(result);
|
|
|
| - NumberUntagDMode mode = NUMBER_CANDIDATE_IS_ANY_TAGGED;
|
| HValue* value = instr->hydrogen()->value();
|
| - if (value->type().IsSmi()) {
|
| - mode = NUMBER_CANDIDATE_IS_SMI;
|
| - } else if (value->IsLoadKeyed()) {
|
| - HLoadKeyed* load = HLoadKeyed::cast(value);
|
| - if (load->UsesMustHandleHole()) {
|
| - if (load->hole_mode() == ALLOW_RETURN_HOLE) {
|
| - mode = NUMBER_CANDIDATE_IS_ANY_TAGGED_CONVERT_HOLE;
|
| - }
|
| - }
|
| - }
|
| + NumberUntagDMode mode = value->representation().IsSmi()
|
| + ? NUMBER_CANDIDATE_IS_SMI : NUMBER_CANDIDATE_IS_ANY_TAGGED;
|
|
|
| EmitNumberUntagD(input_reg, result_reg,
|
| - instr->hydrogen()->allow_undefined_as_nan(),
|
| + instr->hydrogen()->can_convert_undefined_to_nan(),
|
| instr->hydrogen()->deoptimize_on_minus_zero(),
|
| instr->environment(),
|
| mode);
|
| @@ -5205,7 +5115,7 @@ void LCodeGen::DoCheckFunction(LCheckFunction* instr) {
|
| AllowDeferredHandleDereference smi_check;
|
| if (isolate()->heap()->InNewSpace(*target)) {
|
| Register reg = ToRegister(instr->value());
|
| - Handle<Cell> cell = isolate()->factory()->NewPropertyCell(target);
|
| + Handle<Cell> cell = isolate()->factory()->NewCell(target);
|
| __ li(at, Operand(Handle<Object>(cell)));
|
| __ lw(at, FieldMemOperand(at, Cell::kValueOffset));
|
| DeoptimizeIf(ne, instr->environment(), reg,
|
| @@ -5230,17 +5140,17 @@ void LCodeGen::DoDeferredInstanceMigration(LCheckMaps* instr, Register object) {
|
|
|
|
|
| void LCodeGen::DoCheckMaps(LCheckMaps* instr) {
|
| - class DeferredCheckMaps: public LDeferredCode {
|
| + class DeferredCheckMaps V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredCheckMaps(LCodeGen* codegen, LCheckMaps* instr, Register object)
|
| : LDeferredCode(codegen), instr_(instr), object_(object) {
|
| SetExit(check_maps());
|
| }
|
| - virtual void Generate() {
|
| + virtual void Generate() V8_OVERRIDE {
|
| codegen()->DoDeferredInstanceMigration(instr_, object_);
|
| }
|
| Label* check_maps() { return &check_maps_; }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LCheckMaps* instr_;
|
| Label check_maps_;
|
| @@ -5329,12 +5239,14 @@ void LCodeGen::DoClampTToUint8(LClampTToUint8* instr) {
|
|
|
|
|
| void LCodeGen::DoAllocate(LAllocate* instr) {
|
| - class DeferredAllocate: public LDeferredCode {
|
| + class DeferredAllocate V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredAllocate(LCodeGen* codegen, LAllocate* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredAllocate(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE {
|
| + codegen()->DoDeferredAllocate(instr_);
|
| + }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LAllocate* instr_;
|
| };
|
| @@ -5708,6 +5620,8 @@ void LCodeGen::DoDeoptimize(LDeoptimize* instr) {
|
| if (info()->IsStub() && type == Deoptimizer::EAGER) {
|
| type = Deoptimizer::LAZY;
|
| }
|
| +
|
| + Comment(";;; deoptimize: %s", instr->hydrogen()->reason());
|
| DeoptimizeIf(al, instr->environment(), type, zero_reg, Operand(zero_reg));
|
| }
|
|
|
| @@ -5729,12 +5643,14 @@ void LCodeGen::DoDeferredStackCheck(LStackCheck* instr) {
|
|
|
|
|
| void LCodeGen::DoStackCheck(LStackCheck* instr) {
|
| - class DeferredStackCheck: public LDeferredCode {
|
| + class DeferredStackCheck V8_FINAL : public LDeferredCode {
|
| public:
|
| DeferredStackCheck(LCodeGen* codegen, LStackCheck* instr)
|
| : LDeferredCode(codegen), instr_(instr) { }
|
| - virtual void Generate() { codegen()->DoDeferredStackCheck(instr_); }
|
| - virtual LInstruction* instr() { return instr_; }
|
| + virtual void Generate() V8_OVERRIDE {
|
| + codegen()->DoDeferredStackCheck(instr_);
|
| + }
|
| + virtual LInstruction* instr() V8_OVERRIDE { return instr_; }
|
| private:
|
| LStackCheck* instr_;
|
| };
|
|
|