Index: src/mips/full-codegen-mips.cc |
=================================================================== |
--- src/mips/full-codegen-mips.cc (revision 9808) |
+++ src/mips/full-codegen-mips.cc (working copy) |
@@ -278,7 +278,10 @@ |
// constant. |
if (scope()->is_function_scope() && scope()->function() != NULL) { |
int ignored = 0; |
- EmitDeclaration(scope()->function(), CONST, NULL, &ignored); |
+ VariableProxy* proxy = scope()->function(); |
+ ASSERT(proxy->var()->mode() == CONST || |
+ proxy->var()->mode() == CONST_HARMONY); |
+ EmitDeclaration(proxy, proxy->var()->mode(), NULL, &ignored); |
} |
VisitDeclarations(scope()->declarations()); |
} |
@@ -728,6 +731,8 @@ |
// need to "declare" it at runtime to make sure it actually exists in the |
// local context. |
Variable* variable = proxy->var(); |
+ bool binding_needs_init = |
+ mode == CONST || mode == CONST_HARMONY || mode == LET; |
switch (variable->location()) { |
case Variable::UNALLOCATED: |
++(*global_count); |
@@ -739,7 +744,7 @@ |
Comment cmnt(masm_, "[ Declaration"); |
VisitForAccumulatorValue(function); |
__ sw(result_register(), StackOperand(variable)); |
- } else if (mode == CONST || mode == LET) { |
+ } else if (binding_needs_init) { |
Comment cmnt(masm_, "[ Declaration"); |
__ LoadRoot(t0, Heap::kTheHoleValueRootIndex); |
__ sw(t0, StackOperand(variable)); |
@@ -775,7 +780,7 @@ |
EMIT_REMEMBERED_SET, |
OMIT_SMI_CHECK); |
PrepareForBailoutForId(proxy->id(), NO_REGISTERS); |
- } else if (mode == CONST || mode == LET) { |
+ } else if (binding_needs_init) { |
Comment cmnt(masm_, "[ Declaration"); |
__ LoadRoot(at, Heap::kTheHoleValueRootIndex); |
__ sw(at, ContextOperand(cp, variable->index())); |
@@ -787,9 +792,13 @@ |
case Variable::LOOKUP: { |
Comment cmnt(masm_, "[ Declaration"); |
__ li(a2, Operand(variable->name())); |
- // Declaration nodes are always introduced in one of three modes. |
- ASSERT(mode == VAR || mode == CONST || mode == LET); |
- PropertyAttributes attr = (mode == CONST) ? READ_ONLY : NONE; |
+ // Declaration nodes are always introduced in one of four modes. |
+ ASSERT(mode == VAR || |
+ mode == CONST || |
+ mode == CONST_HARMONY || |
+ mode == LET); |
+ PropertyAttributes attr = (mode == CONST || mode == CONST_HARMONY) |
+ ? READ_ONLY : NONE; |
__ li(a1, Operand(Smi::FromInt(attr))); |
// Push initial value, if any. |
// Note: For variables we must not push an initial value (such as |
@@ -799,7 +808,7 @@ |
__ Push(cp, a2, a1); |
// Push initial value for function declaration. |
VisitForStackValue(function); |
- } else if (mode == CONST || mode == LET) { |
+ } else if (binding_needs_init) { |
__ LoadRoot(a0, Heap::kTheHoleValueRootIndex); |
__ Push(cp, a2, a1, a0); |
} else { |
@@ -942,11 +951,17 @@ |
__ bind(&done_convert); |
__ push(a0); |
+ // Check for proxies. |
+ Label call_runtime; |
+ STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE); |
+ __ GetObjectType(a0, a1, a1); |
+ __ Branch(&call_runtime, le, a1, Operand(LAST_JS_PROXY_TYPE)); |
+ |
// Check cache validity in generated code. This is a fast case for |
// the JSObject::IsSimpleEnum cache validity checks. If we cannot |
// guarantee cache validity, call the runtime system to check cache |
// validity or get the property names in a fixed array. |
- Label next, call_runtime; |
+ Label next; |
// Preload a couple of values used in the loop. |
Register empty_fixed_array_value = t2; |
__ LoadRoot(empty_fixed_array_value, Heap::kEmptyFixedArrayRootIndex); |
@@ -1020,9 +1035,16 @@ |
__ jmp(&loop); |
// We got a fixed array in register v0. Iterate through that. |
+ Label non_proxy; |
__ bind(&fixed_array); |
- __ li(a1, Operand(Smi::FromInt(0))); // Map (0) - force slow check. |
- __ Push(a1, v0); |
+ __ li(a1, Operand(Smi::FromInt(1))); // Smi indicates slow check |
+ __ lw(a2, MemOperand(sp, 0 * kPointerSize)); // Get enumerated object |
+ STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_SPEC_OBJECT_TYPE); |
+ __ GetObjectType(a2, a3, a3); |
+ __ Branch(&non_proxy, gt, a3, Operand(LAST_JS_PROXY_TYPE)); |
+ __ li(a1, Operand(Smi::FromInt(0))); // Zero indicates proxy |
+ __ bind(&non_proxy); |
+ __ Push(a1, v0); // Smi and array |
__ lw(a1, FieldMemOperand(v0, FixedArray::kLengthOffset)); |
__ li(a0, Operand(Smi::FromInt(0))); |
__ Push(a1, a0); // Fixed array length (as smi) and initial index. |
@@ -1041,17 +1063,22 @@ |
__ addu(t0, a2, t0); // Array base + scaled (smi) index. |
__ lw(a3, MemOperand(t0)); // Current entry. |
- // Get the expected map from the stack or a zero map in the |
+ // Get the expected map from the stack or a smi in the |
// permanent slow case into register a2. |
__ lw(a2, MemOperand(sp, 3 * kPointerSize)); |
// Check if the expected map still matches that of the enumerable. |
- // If not, we have to filter the key. |
+ // If not, we may have to filter the key. |
Label update_each; |
__ lw(a1, MemOperand(sp, 4 * kPointerSize)); |
__ lw(t0, FieldMemOperand(a1, HeapObject::kMapOffset)); |
__ Branch(&update_each, eq, t0, Operand(a2)); |
+ // For proxies, no filtering is done. |
+ // TODO(rossberg): What if only a prototype is a proxy? Not specified yet. |
+ ASSERT_EQ(Smi::FromInt(0), 0); |
+ __ Branch(&update_each, eq, a2, Operand(zero_reg)); |
+ |
// Convert the entry to a string or (smi) 0 if it isn't a property |
// any more. If the property has been removed while iterating, we |
// just skip it. |
@@ -1106,7 +1133,7 @@ |
!pretenure && |
scope()->is_function_scope() && |
info->num_literals() == 0) { |
- FastNewClosureStub stub(info->strict_mode() ? kStrictMode : kNonStrictMode); |
+ FastNewClosureStub stub(info->strict_mode_flag()); |
__ li(a0, Operand(info)); |
__ push(a0); |
__ CallStub(&stub); |
@@ -1137,7 +1164,7 @@ |
Scope* s = scope(); |
while (s != NULL) { |
if (s->num_heap_slots() > 0) { |
- if (s->calls_eval()) { |
+ if (s->calls_non_strict_eval()) { |
// Check that extension is NULL. |
__ lw(temp, ContextOperand(current, Context::EXTENSION_INDEX)); |
__ Branch(slow, ne, temp, Operand(zero_reg)); |
@@ -1149,7 +1176,7 @@ |
} |
// If no outer scope calls eval, we do not need to check more |
// context extensions. |
- if (!s->outer_scope_calls_eval() || s->is_eval_scope()) break; |
+ if (!s->outer_scope_calls_non_strict_eval() || s->is_eval_scope()) break; |
s = s->outer_scope(); |
} |
@@ -1191,7 +1218,7 @@ |
for (Scope* s = scope(); s != var->scope(); s = s->outer_scope()) { |
if (s->num_heap_slots() > 0) { |
- if (s->calls_eval()) { |
+ if (s->calls_non_strict_eval()) { |
// Check that extension is NULL. |
__ lw(temp, ContextOperand(context, Context::EXTENSION_INDEX)); |
__ Branch(slow, ne, temp, Operand(zero_reg)); |
@@ -1228,13 +1255,14 @@ |
Variable* local = var->local_if_not_shadowed(); |
__ lw(v0, ContextSlotOperandCheckExtensions(local, slow)); |
if (local->mode() == CONST || |
+ local->mode() == CONST_HARMONY || |
local->mode() == LET) { |
__ LoadRoot(at, Heap::kTheHoleValueRootIndex); |
__ subu(at, v0, at); // Sub as compare: at == 0 on eq. |
if (local->mode() == CONST) { |
__ LoadRoot(a0, Heap::kUndefinedValueRootIndex); |
__ movz(v0, a0, at); // Conditional move: return Undefined if TheHole. |
- } else { // LET |
+ } else { // LET || CONST_HARMONY |
__ Branch(done, ne, at, Operand(zero_reg)); |
__ li(a0, Operand(var->name())); |
__ push(a0); |
@@ -1272,14 +1300,16 @@ |
Comment cmnt(masm_, var->IsContextSlot() |
? "Context variable" |
: "Stack variable"); |
- if (var->mode() != LET && var->mode() != CONST) { |
+ if (!var->binding_needs_init()) { |
context()->Plug(var); |
} else { |
// Let and const need a read barrier. |
GetVar(v0, var); |
__ LoadRoot(at, Heap::kTheHoleValueRootIndex); |
__ subu(at, v0, at); // Sub as compare: at == 0 on eq. |
- if (var->mode() == LET) { |
+ if (var->mode() == LET || var->mode() == CONST_HARMONY) { |
+ // Throw a reference error when using an uninitialized let/const |
+ // binding in harmony mode. |
Label done; |
__ Branch(&done, ne, at, Operand(zero_reg)); |
__ li(a0, Operand(var->name())); |
@@ -1287,6 +1317,8 @@ |
__ CallRuntime(Runtime::kThrowReferenceError, 1); |
__ bind(&done); |
} else { |
+ // Uninitalized const bindings outside of harmony mode are unholed. |
+ ASSERT(var->mode() == CONST); |
__ LoadRoot(a0, Heap::kUndefinedValueRootIndex); |
__ movz(v0, a0, at); // Conditional move: Undefined if TheHole. |
} |
@@ -1476,13 +1508,21 @@ |
ZoneList<Expression*>* subexprs = expr->values(); |
int length = subexprs->length(); |
+ |
+ Handle<FixedArray> constant_elements = expr->constant_elements(); |
+ ASSERT_EQ(2, constant_elements->length()); |
+ ElementsKind constant_elements_kind = |
+ static_cast<ElementsKind>(Smi::cast(constant_elements->get(0))->value()); |
+ Handle<FixedArrayBase> constant_elements_values( |
+ FixedArrayBase::cast(constant_elements->get(1))); |
+ |
__ mov(a0, result_register()); |
__ lw(a3, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset)); |
__ lw(a3, FieldMemOperand(a3, JSFunction::kLiteralsOffset)); |
__ li(a2, Operand(Smi::FromInt(expr->literal_index()))); |
- __ li(a1, Operand(expr->constant_elements())); |
+ __ li(a1, Operand(constant_elements)); |
__ Push(a3, a2, a1); |
- if (expr->constant_elements()->map() == |
+ if (constant_elements_values->map() == |
isolate()->heap()->fixed_cow_array_map()) { |
FastCloneShallowArrayStub stub( |
FastCloneShallowArrayStub::COPY_ON_WRITE_ELEMENTS, length); |
@@ -1494,8 +1534,14 @@ |
} else if (length > FastCloneShallowArrayStub::kMaximumClonedLength) { |
__ CallRuntime(Runtime::kCreateArrayLiteralShallow, 3); |
} else { |
- FastCloneShallowArrayStub stub( |
- FastCloneShallowArrayStub::CLONE_ELEMENTS, length); |
+ ASSERT(constant_elements_kind == FAST_ELEMENTS || |
+ constant_elements_kind == FAST_SMI_ONLY_ELEMENTS || |
+ FLAG_smi_only_arrays); |
+ FastCloneShallowArrayStub::Mode mode = |
+ constant_elements_kind == FAST_DOUBLE_ELEMENTS |
+ ? FastCloneShallowArrayStub::CLONE_DOUBLE_ELEMENTS |
+ : FastCloneShallowArrayStub::CLONE_ELEMENTS; |
+ FastCloneShallowArrayStub stub(mode, length); |
__ CallStub(&stub); |
} |
@@ -1518,25 +1564,58 @@ |
} |
VisitForAccumulatorValue(subexpr); |
- // Store the subexpression value in the array's elements. |
__ lw(t6, MemOperand(sp)); // Copy of array literal. |
__ lw(a1, FieldMemOperand(t6, JSObject::kElementsOffset)); |
+ __ lw(a2, FieldMemOperand(t6, JSObject::kMapOffset)); |
int offset = FixedArray::kHeaderSize + (i * kPointerSize); |
+ |
+ Label element_done; |
+ Label double_elements; |
+ Label smi_element; |
+ Label slow_elements; |
+ Label fast_elements; |
+ __ CheckFastElements(a2, a3, &double_elements); |
+ |
+ // FAST_SMI_ONLY_ELEMENTS or FAST_ELEMENTS |
+ __ JumpIfSmi(result_register(), &smi_element); |
+ __ CheckFastSmiOnlyElements(a2, a3, &fast_elements); |
+ |
+ // Store into the array literal requires a elements transition. Call into |
+ // the runtime. |
+ __ bind(&slow_elements); |
+ __ push(t6); // Copy of array literal. |
+ __ li(a1, Operand(Smi::FromInt(i))); |
+ __ li(a2, Operand(Smi::FromInt(NONE))); // PropertyAttributes |
+ __ li(a3, Operand(Smi::FromInt(strict_mode_flag()))); // Strict mode. |
+ __ Push(a1, result_register(), a2, a3); |
+ __ CallRuntime(Runtime::kSetProperty, 5); |
+ __ Branch(&element_done); |
+ |
+ // Array literal has ElementsKind of FAST_DOUBLE_ELEMENTS. |
+ __ bind(&double_elements); |
+ __ li(a3, Operand(Smi::FromInt(i))); |
+ __ StoreNumberToDoubleElements(result_register(), a3, t6, a1, t0, t1, t5, |
+ t3, &slow_elements); |
+ __ Branch(&element_done); |
+ |
+ // Array literal has ElementsKind of FAST_ELEMENTS and value is an object. |
+ __ bind(&fast_elements); |
__ sw(result_register(), FieldMemOperand(a1, offset)); |
+ // Update the write barrier for the array store. |
- Label no_map_change; |
- __ JumpIfSmi(result_register(), &no_map_change); |
- // Update the write barrier for the array store with v0 as the scratch |
- // register. |
__ RecordWriteField( |
a1, offset, result_register(), a2, kRAHasBeenSaved, kDontSaveFPRegs, |
EMIT_REMEMBERED_SET, OMIT_SMI_CHECK); |
- __ lw(a3, FieldMemOperand(a1, HeapObject::kMapOffset)); |
- __ CheckFastSmiOnlyElements(a3, a2, &no_map_change); |
- __ push(t6); // Copy of array literal. |
- __ CallRuntime(Runtime::kNonSmiElementStored, 1); |
- __ bind(&no_map_change); |
+ __ Branch(&element_done); |
+ // Array literal has ElementsKind of FAST_SMI_ONLY_ELEMENTS or |
+ // FAST_ELEMENTS, and value is Smi. |
+ __ bind(&smi_element); |
+ __ sw(result_register(), FieldMemOperand(a1, offset)); |
+ // Fall through |
+ |
+ __ bind(&element_done); |
+ |
PrepareForBailoutForId(expr->GetIdForElement(i), NO_REGISTERS); |
} |
@@ -1917,8 +1996,9 @@ |
} |
} |
- } else if (var->mode() != CONST) { |
- // Assignment to var or initializing assignment to let. |
+ } else if (!var->is_const_mode() || op == Token::INIT_CONST_HARMONY) { |
+ // Assignment to var or initializing assignment to let/const |
+ // in harmony mode. |
if (var->IsStackAllocated() || var->IsContextSlot()) { |
MemOperand location = VarOperand(var, a1); |
if (FLAG_debug_code && op == Token::INIT_LET) { |
@@ -2803,10 +2883,10 @@ |
// ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)). |
if (CpuFeatures::IsSupported(FPU)) { |
__ PrepareCallCFunction(1, a0); |
- __ li(a0, Operand(ExternalReference::isolate_address())); |
+ __ lw(a0, ContextOperand(cp, Context::GLOBAL_INDEX)); |
+ __ lw(a0, FieldMemOperand(a0, GlobalObject::kGlobalContextOffset)); |
__ CallCFunction(ExternalReference::random_uint32_function(isolate()), 1); |
- |
CpuFeatures::Scope scope(FPU); |
// 0x41300000 is the top half of 1.0 x 2^20 as a double. |
__ li(a1, Operand(0x41300000)); |
@@ -2821,7 +2901,8 @@ |
} else { |
__ PrepareCallCFunction(2, a0); |
__ mov(a0, s0); |
- __ li(a1, Operand(ExternalReference::isolate_address())); |
+ __ lw(a1, ContextOperand(cp, Context::GLOBAL_INDEX)); |
+ __ lw(a1, FieldMemOperand(a1, GlobalObject::kGlobalContextOffset)); |
__ CallCFunction( |
ExternalReference::fill_heap_number_with_random_function(isolate()), 2); |
} |
@@ -4100,36 +4181,26 @@ |
case Token::EQ_STRICT: |
case Token::EQ: |
cc = eq; |
- __ mov(a0, result_register()); |
- __ pop(a1); |
break; |
case Token::LT: |
cc = lt; |
- __ mov(a0, result_register()); |
- __ pop(a1); |
break; |
case Token::GT: |
- // Reverse left and right sides to obtain ECMA-262 conversion order. |
- cc = lt; |
- __ mov(a1, result_register()); |
- __ pop(a0); |
+ cc = gt; |
break; |
case Token::LTE: |
- // Reverse left and right sides to obtain ECMA-262 conversion order. |
- cc = ge; |
- __ mov(a1, result_register()); |
- __ pop(a0); |
+ cc = le; |
break; |
case Token::GTE: |
cc = ge; |
- __ mov(a0, result_register()); |
- __ pop(a1); |
break; |
case Token::IN: |
case Token::INSTANCEOF: |
default: |
UNREACHABLE(); |
} |
+ __ mov(a0, result_register()); |
+ __ pop(a1); |
bool inline_smi_code = ShouldInlineSmiCase(op); |
JumpPatchSite patch_site(masm_); |