| Index: src/ia32/full-codegen-ia32.cc
|
| diff --git a/src/ia32/full-codegen-ia32.cc b/src/ia32/full-codegen-ia32.cc
|
| index 704fb4e7d28bc994e1dc06bd09542d663d77f8af..8a51fbc10498c19da297066092fef6a54d634a34 100644
|
| --- a/src/ia32/full-codegen-ia32.cc
|
| +++ b/src/ia32/full-codegen-ia32.cc
|
| @@ -1574,6 +1574,9 @@ void FullCodeGenerator::EmitAccessor(Expression* expression) {
|
|
|
| void FullCodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
|
| Comment cmnt(masm_, "[ ObjectLiteral");
|
| +
|
| + int depth = 1;
|
| + expr->BuildConstantProperties(isolate(), &depth);
|
| Handle<FixedArray> constant_properties = expr->constant_properties();
|
| int flags = expr->fast_elements()
|
| ? ObjectLiteral::kFastElements
|
| @@ -1583,7 +1586,7 @@ void FullCodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
|
| : ObjectLiteral::kNoFlags;
|
| int properties_count = constant_properties->length() / 2;
|
| if ((FLAG_track_double_fields && expr->may_store_doubles()) ||
|
| - expr->depth() > 1 || Serializer::enabled() ||
|
| + depth > 1 || Serializer::enabled() ||
|
| flags != ObjectLiteral::kFastElements ||
|
| properties_count > FastCloneShallowObjectStub::kMaximumClonedProperties) {
|
| __ mov(edi, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
| @@ -1702,6 +1705,8 @@ void FullCodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
|
| void FullCodeGenerator::VisitArrayLiteral(ArrayLiteral* expr) {
|
| Comment cmnt(masm_, "[ ArrayLiteral");
|
|
|
| + int depth = 1;
|
| + expr->BuildConstantElements(isolate(), &depth);
|
| ZoneList<Expression*>* subexprs = expr->values();
|
| int length = subexprs->length();
|
| Handle<FixedArray> constant_elements = expr->constant_elements();
|
| @@ -1728,19 +1733,13 @@ void FullCodeGenerator::VisitArrayLiteral(ArrayLiteral* expr) {
|
| DONT_TRACK_ALLOCATION_SITE,
|
| length);
|
| __ CallStub(&stub);
|
| - } else if (expr->depth() > 1) {
|
| + } else if (depth > 1 || Serializer::enabled() ||
|
| + length > FastCloneShallowArrayStub::kMaximumClonedLength) {
|
| __ mov(ebx, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
| __ push(FieldOperand(ebx, JSFunction::kLiteralsOffset));
|
| __ push(Immediate(Smi::FromInt(expr->literal_index())));
|
| __ push(Immediate(constant_elements));
|
| __ CallRuntime(Runtime::kCreateArrayLiteral, 3);
|
| - } else if (Serializer::enabled() ||
|
| - length > FastCloneShallowArrayStub::kMaximumClonedLength) {
|
| - __ mov(ebx, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
| - __ push(FieldOperand(ebx, JSFunction::kLiteralsOffset));
|
| - __ push(Immediate(Smi::FromInt(expr->literal_index())));
|
| - __ push(Immediate(constant_elements));
|
| - __ CallRuntime(Runtime::kCreateArrayLiteralShallow, 3);
|
| } else {
|
| ASSERT(IsFastSmiOrObjectElementsKind(constant_elements_kind) ||
|
| FLAG_smi_only_arrays);
|
| @@ -3053,6 +3052,32 @@ void FullCodeGenerator::EmitIsFunction(CallRuntime* expr) {
|
| }
|
|
|
|
|
| +void FullCodeGenerator::EmitIsMinusZero(CallRuntime* expr) {
|
| + ZoneList<Expression*>* args = expr->arguments();
|
| + ASSERT(args->length() == 1);
|
| +
|
| + VisitForAccumulatorValue(args->at(0));
|
| +
|
| + Label materialize_true, materialize_false;
|
| + Label* if_true = NULL;
|
| + Label* if_false = NULL;
|
| + Label* fall_through = NULL;
|
| + context()->PrepareTest(&materialize_true, &materialize_false,
|
| + &if_true, &if_false, &fall_through);
|
| +
|
| + Handle<Map> map = masm()->isolate()->factory()->heap_number_map();
|
| + __ CheckMap(eax, map, if_false, DO_SMI_CHECK);
|
| + __ cmp(FieldOperand(eax, HeapNumber::kExponentOffset), Immediate(0x80000000));
|
| + __ j(not_equal, if_false);
|
| + __ cmp(FieldOperand(eax, HeapNumber::kMantissaOffset), Immediate(0x00000000));
|
| + PrepareForBailoutBeforeSplit(expr, true, if_true, if_false);
|
| + Split(equal, if_true, if_false, fall_through);
|
| +
|
| + context()->Plug(if_true, if_false);
|
| +}
|
| +
|
| +
|
| +
|
| void FullCodeGenerator::EmitIsArray(CallRuntime* expr) {
|
| ZoneList<Expression*>* args = expr->arguments();
|
| ASSERT(args->length() == 1);
|
| @@ -3672,11 +3697,20 @@ void FullCodeGenerator::EmitStringAdd(CallRuntime* expr) {
|
| ZoneList<Expression*>* args = expr->arguments();
|
| ASSERT_EQ(2, args->length());
|
|
|
| - VisitForStackValue(args->at(0));
|
| - VisitForStackValue(args->at(1));
|
| + if (FLAG_new_string_add) {
|
| + VisitForStackValue(args->at(0));
|
| + VisitForAccumulatorValue(args->at(1));
|
|
|
| - StringAddStub stub(STRING_ADD_CHECK_BOTH);
|
| - __ CallStub(&stub);
|
| + __ pop(edx);
|
| + NewStringAddStub stub(STRING_ADD_CHECK_BOTH, NOT_TENURED);
|
| + __ CallStub(&stub);
|
| + } else {
|
| + VisitForStackValue(args->at(0));
|
| + VisitForStackValue(args->at(1));
|
| +
|
| + StringAddStub stub(STRING_ADD_CHECK_BOTH);
|
| + __ CallStub(&stub);
|
| + }
|
| context()->Plug(eax);
|
| }
|
|
|
| @@ -3694,42 +3728,6 @@ void FullCodeGenerator::EmitStringCompare(CallRuntime* expr) {
|
| }
|
|
|
|
|
| -void FullCodeGenerator::EmitMathSin(CallRuntime* expr) {
|
| - // Load the argument on the stack and call the stub.
|
| - TranscendentalCacheStub stub(TranscendentalCache::SIN,
|
| - TranscendentalCacheStub::TAGGED);
|
| - ZoneList<Expression*>* args = expr->arguments();
|
| - ASSERT(args->length() == 1);
|
| - VisitForStackValue(args->at(0));
|
| - __ CallStub(&stub);
|
| - context()->Plug(eax);
|
| -}
|
| -
|
| -
|
| -void FullCodeGenerator::EmitMathCos(CallRuntime* expr) {
|
| - // Load the argument on the stack and call the stub.
|
| - TranscendentalCacheStub stub(TranscendentalCache::COS,
|
| - TranscendentalCacheStub::TAGGED);
|
| - ZoneList<Expression*>* args = expr->arguments();
|
| - ASSERT(args->length() == 1);
|
| - VisitForStackValue(args->at(0));
|
| - __ CallStub(&stub);
|
| - context()->Plug(eax);
|
| -}
|
| -
|
| -
|
| -void FullCodeGenerator::EmitMathTan(CallRuntime* expr) {
|
| - // Load the argument on the stack and call the stub.
|
| - TranscendentalCacheStub stub(TranscendentalCache::TAN,
|
| - TranscendentalCacheStub::TAGGED);
|
| - ZoneList<Expression*>* args = expr->arguments();
|
| - ASSERT(args->length() == 1);
|
| - VisitForStackValue(args->at(0));
|
| - __ CallStub(&stub);
|
| - context()->Plug(eax);
|
| -}
|
| -
|
| -
|
| void FullCodeGenerator::EmitMathLog(CallRuntime* expr) {
|
| // Load the argument on the stack and call the stub.
|
| TranscendentalCacheStub stub(TranscendentalCache::LOG,
|
| @@ -4399,14 +4397,50 @@ void FullCodeGenerator::VisitCountOperation(CountOperation* expr) {
|
| PrepareForBailoutForId(prop->LoadId(), TOS_REG);
|
| }
|
|
|
| - // Call ToNumber only if operand is not a smi.
|
| - Label no_conversion;
|
| + // Inline smi case if we are in a loop.
|
| + Label done, stub_call;
|
| + JumpPatchSite patch_site(masm_);
|
| if (ShouldInlineSmiCase(expr->op())) {
|
| - __ JumpIfSmi(eax, &no_conversion, Label::kNear);
|
| + Label slow;
|
| + patch_site.EmitJumpIfNotSmi(eax, &slow, Label::kNear);
|
| +
|
| + // Save result for postfix expressions.
|
| + if (expr->is_postfix()) {
|
| + if (!context()->IsEffect()) {
|
| + // Save the result on the stack. If we have a named or keyed property
|
| + // we store the result under the receiver that is currently on top
|
| + // of the stack.
|
| + switch (assign_type) {
|
| + case VARIABLE:
|
| + __ push(eax);
|
| + break;
|
| + case NAMED_PROPERTY:
|
| + __ mov(Operand(esp, kPointerSize), eax);
|
| + break;
|
| + case KEYED_PROPERTY:
|
| + __ mov(Operand(esp, 2 * kPointerSize), eax);
|
| + break;
|
| + }
|
| + }
|
| + }
|
| +
|
| + if (expr->op() == Token::INC) {
|
| + __ add(eax, Immediate(Smi::FromInt(1)));
|
| + } else {
|
| + __ sub(eax, Immediate(Smi::FromInt(1)));
|
| + }
|
| + __ j(no_overflow, &done, Label::kNear);
|
| + // Call stub. Undo operation first.
|
| + if (expr->op() == Token::INC) {
|
| + __ sub(eax, Immediate(Smi::FromInt(1)));
|
| + } else {
|
| + __ add(eax, Immediate(Smi::FromInt(1)));
|
| + }
|
| + __ jmp(&stub_call, Label::kNear);
|
| + __ bind(&slow);
|
| }
|
| ToNumberStub convert_stub;
|
| __ CallStub(&convert_stub);
|
| - __ bind(&no_conversion);
|
|
|
| // Save result for postfix expressions.
|
| if (expr->is_postfix()) {
|
| @@ -4428,34 +4462,11 @@ void FullCodeGenerator::VisitCountOperation(CountOperation* expr) {
|
| }
|
| }
|
|
|
| - // Inline smi case if we are in a loop.
|
| - Label done, stub_call;
|
| - JumpPatchSite patch_site(masm_);
|
| -
|
| - if (ShouldInlineSmiCase(expr->op())) {
|
| - if (expr->op() == Token::INC) {
|
| - __ add(eax, Immediate(Smi::FromInt(1)));
|
| - } else {
|
| - __ sub(eax, Immediate(Smi::FromInt(1)));
|
| - }
|
| - __ j(overflow, &stub_call, Label::kNear);
|
| - // We could eliminate this smi check if we split the code at
|
| - // the first smi check before calling ToNumber.
|
| - patch_site.EmitJumpIfSmi(eax, &done, Label::kNear);
|
| -
|
| - __ bind(&stub_call);
|
| - // Call stub. Undo operation first.
|
| - if (expr->op() == Token::INC) {
|
| - __ sub(eax, Immediate(Smi::FromInt(1)));
|
| - } else {
|
| - __ add(eax, Immediate(Smi::FromInt(1)));
|
| - }
|
| - }
|
| -
|
| // Record position before stub call.
|
| SetSourcePosition(expr->position());
|
|
|
| // Call stub for +1/-1.
|
| + __ bind(&stub_call);
|
| __ mov(edx, eax);
|
| __ mov(eax, Immediate(Smi::FromInt(1)));
|
| BinaryOpStub stub(expr->binary_op(), NO_OVERWRITE);
|
|
|