A64: Synchronize with r15358.

src/a64/code-stubs-a64.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 671 matching lines @@
 
 // See call site for description.
 static void EmitStrictTwoHeapObjectCompare(MacroAssembler* masm,
                                            Register left,
                                            Register right,
                                            Register left_type,
                                            Register right_type,
                                            Register scratch) {
   ASSERT(!AreAliased(left, right, left_type, right_type, scratch));
 
+  if (masm->emit_debug_code()) {
+    // We assume that the arguments are not identical.
+    __ Cmp(left, right);
+    __ Assert(ne, "Expected non-identical objects.");
+  }
+
   // If either operand is a JS object or an oddball value, then they are not
   // equal since their pointers are different.
   // There is no test for undetectability in strict equality.
   STATIC_ASSERT(LAST_TYPE == LAST_SPEC_OBJECT_TYPE);
   Label right_non_object;
 
   __ Cmp(right_type, FIRST_SPEC_OBJECT_TYPE);
   __ B(lt, &right_non_object);
 
   // Return non-zero - x0 already contains a non-zero pointer.
   ASSERT(left.is(x0) || right.is(x0));
   Label return_not_equal;
   __ Bind(&return_not_equal);
   __ Ret();
 
   __ Bind(&right_non_object);
 
   // Check for oddballs: true, false, null, undefined.
   __ Cmp(right_type, ODDBALL_TYPE);
 
   // If right is not ODDBALL, test left. Otherwise, set eq condition.
   __ Ccmp(left_type, ODDBALL_TYPE, ZFlag, ne);
 
   // If right or left is not ODDBALL, test left >= FIRST_SPEC_OBJECT_TYPE.
   // Otherwise, right or left is ODDBALL, so set a ge condition.
   __ Ccmp(left_type, FIRST_SPEC_OBJECT_TYPE, NVFlag, ne);
 
   __ B(ge, &return_not_equal);
 
-  // Check for internalized-internalized comparison. Ensure that no non-strings
-  // have the internalized bit set.
-  STATIC_ASSERT(LAST_TYPE < (kNotStringTag + kIsInternalizedMask));
-  STATIC_ASSERT(kInternalizedTag != 0);
-  __ And(scratch, right_type, left_type);
-  __ Tbnz(scratch, MaskToBit(kIsInternalizedMask), &return_not_equal);
+  // Internalized strings are unique, so they can only be equal if they are the
+  // same object. We have already tested that case, so if left and right are
+  // both internalized strings, they cannot be equal.
+  __ And(scratch, right_type, kIsNotStringMask | kIsInternalizedMask);
+  __ Cmp(scratch, kInternalizedTag | kStringTag);
+  __ And(scratch, left_type, kIsNotStringMask | kIsInternalizedMask);
+  __ Ccmp(scratch, kInternalizedTag | kStringTag, NoFlag, eq);
+  __ B(eq, &return_not_equal);
 }
 
 
 // See call site for description.
 static void EmitSmiNonsmiComparison(MacroAssembler* masm,
                                     Register left,
                                     Register right,
                                     FPRegister left_d,
                                     FPRegister right_d,
                                     Register scratch,
@@ skipping 70 matching lines @@
                                                      Register right,
                                                      Register left_map,
                                                      Register right_map,
                                                      Register left_type,
                                                      Register right_type,
                                                      Label* possible_strings,
                                                      Label* not_both_strings) {
   ASSERT(!AreAliased(left, right, left_map, right_map, left_type, right_type));
   Register result = x0;
 
-  // Ensure that no non-strings have the internalized bit set.
   Label object_test;
   STATIC_ASSERT(kStringTag == 0);
   STATIC_ASSERT(kInternalizedTag != 0);
   // TODO(all): reexamine this branch sequence for optimisation wrt branch
   // prediction.
   __ Tbnz(right_type, MaskToBit(kIsNotStringMask), &object_test);
   __ Tbz(right_type, MaskToBit(kIsInternalizedMask), possible_strings);
   __ Tbnz(left_type, MaskToBit(kIsNotStringMask), not_both_strings);
   __ Tbz(left_type, MaskToBit(kIsInternalizedMask), possible_strings);
 
@@ skipping 919 matching lines @@
   }
 
   __ Bind(&not_smis);
 }
 
 
 void BinaryOpStub::GenerateSmiStub(MacroAssembler* masm) {
   ASM_LOCATION("BinaryOpStub::GenerateSmiStub");
   Label right_arg_changed, call_runtime;
 
-  if ((op_ == Token::MOD) && has_fixed_right_arg_) {
+  if ((op_ == Token::MOD) && encoded_right_arg_.has_value) {
     // It is guaranteed that the value will fit into a Smi, because if it
     // didn't, we wouldn't be here, see BinaryOp_Patch.
     __ CompareAndBranch(x0, Operand(Smi::FromInt(fixed_right_arg_value())), ne,
                         &right_arg_changed);
   }
 
 #ifdef DEBUG
   Register saved_left = x18;
   Register saved_right = x19;
   if (masm->emit_debug_code()) {
@@ skipping 725 matching lines @@
 
 void CodeStub::GenerateStubsAheadOfTime(Isolate* isolate) {
   // It is important that the following stubs are generated in this order
   // because pregenerated stubs can only call other pregenerated stubs.
   // RecordWriteStub uses StoreBufferOverflowStub, which in turn uses
   // CEntryStub.
   CEntryStub::GenerateAheadOfTime(isolate);
   StoreBufferOverflowStub::GenerateFixedRegStubsAheadOfTime(isolate);
   StubFailureTrampolineStub::GenerateAheadOfTime(isolate);
   RecordWriteStub::GenerateFixedRegStubsAheadOfTime(isolate);
-
-  if (FLAG_optimize_constructed_arrays) {
-    ArrayConstructorStubBase::GenerateStubsAheadOfTime(isolate);
-  }
+  ArrayConstructorStubBase::GenerateStubsAheadOfTime(isolate);
 }
 
 
 void CodeStub::GenerateFPStubs(Isolate* isolate) {
   // Floating-point code doesn't get special handling in A64, so there's
   // nothing to do here.
   USE(isolate);
 }
 
 
@@ skipping 1935 matching lines @@
 
   __ Bind(&done);
   __ Ret();
 
   __ Bind(&slow);
   __ Push(length_smi, index_smi, input);
   __ TailCallRuntime(Runtime::kRegExpConstructResult, 3, 1);
 }
 
 
-// TODO(mcapewel): This code has been ported as part of the merge process, but
-//                 is currently untested.
-// TODO(jbramley): Don't use static registers here, but take them as arguments.
-static void GenerateRecordCallTargetNoArray(MacroAssembler* masm) {
-  ASM_UNIMPLEMENTED_BREAK("Untested: GenerateRecordCallTargetNoArray");
-  // Cache the called function in a global property cell. Cache states are
-  // uninitialized, monomorphic (indicated by a JSFunction), and megamorphic.
-  //  x1 : the function to call
-  //  x2 : cache cell for the call target
-  Label done;
-
-  ASSERT_EQ(*TypeFeedbackCells::MegamorphicSentinel(masm->isolate()),
-            masm->isolate()->heap()->undefined_value());
-  ASSERT_EQ(*TypeFeedbackCells::UninitializedSentinel(masm->isolate()),
-            masm->isolate()->heap()->the_hole_value());
-
-  // Load the cache state.
-  __ Ldr(x3, FieldMemOperand(x2, Cell::kValueOffset));
-
-  // A monomorphic cache hit or an already megamorphic state: invoke the
-  // function without changing the state.
-  __ Cmp(x3, x1);
-  __ B(eq, &done);
-  __ JumpIfRoot(x3, Heap::kUndefinedValueRootIndex, &done);
-
-  // A monomorphic miss (i.e, here the cache is not uninitialized) goes
-  // megamorphic. MegamorphicSentinal is an immortal immovable object
-  // (undefined) so no write-barrier is needed.
-  Label skip_undef_store;
-  __ JumpIfRoot(x3, Heap::kTheHoleValueRootIndex, &skip_undef_store);
-  __ LoadRoot(ip0, Heap::kUndefinedValueRootIndex);
-  __ Str(ip0, FieldMemOperand(x2, Cell::kValueOffset));
-  __ B(&done);
-  __ Bind(&skip_undef_store);
-
-  // An uninitialized cache is patched with the function.
-  __ Str(x1, FieldMemOperand(x2, Cell::kValueOffset));
-  // No need for a write barrier here - cells are rescanned.
-
-  __ Bind(&done);
-}
-
-
 // TODO(jbramley): Don't use static registers here, but take them as arguments.
 static void GenerateRecordCallTarget(MacroAssembler* masm) {
   // Cache the called function in a global property cell. Cache states are
   // uninitialized, monomorphic (indicated by a JSFunction), and megamorphic.
   //  x1 : the function to call
   //  x2 : cache cell for the call target
-  ASSERT(FLAG_optimize_constructed_arrays);
   Label initialize, done, miss, megamorphic, not_array_function;
 
   ASSERT_EQ(*TypeFeedbackCells::MegamorphicSentinel(masm->isolate()),
             masm->isolate()->heap()->undefined_value());
   ASSERT_EQ(*TypeFeedbackCells::UninitializedSentinel(masm->isolate()),
             masm->isolate()->heap()->the_hole_value());
 
   // Load the cache state.
   __ Ldr(x3, FieldMemOperand(x2, Cell::kValueOffset));
 
@@ skipping 84 matching lines @@
     __ Bind(&call);
   }
 
   // Check that the function is really a JavaScript function.
   // x1  function  pushed function (to be verified)
   __ JumpIfSmi(function, &non_function);
   // Get the map of the function object.
   __ JumpIfNotObjectType(function, x10, x10, JS_FUNCTION_TYPE, &slow);
 
   if (RecordCallTarget()) {
-    if (FLAG_optimize_constructed_arrays) {
-      GenerateRecordCallTarget(masm);
-    } else {
-      GenerateRecordCallTargetNoArray(masm);
-    }
+    GenerateRecordCallTarget(masm);
   }
 
   // Fast-case: Invoke the function now.
   // x1  function  pushed function
   ParameterCount actual(argc_);
 
   if (ReceiverMightBeImplicit()) {
     Label call_as_function;
     __ JumpIfRoot(x4, Heap::kTheHoleValueRootIndex, &call_as_function);
     __ InvokeFunction(function,
@@ skipping 57 matching lines @@
   Label slow, non_function_call;
 
   // Check that the function is not a smi.
   __ JumpIfSmi(function, &non_function_call);
   // Check that the function is a JSFunction.
   Register object_type = x10;
   __ JumpIfNotObjectType(function, object_type, object_type, JS_FUNCTION_TYPE,
                          &slow);
 
   if (RecordCallTarget()) {
-    if (FLAG_optimize_constructed_arrays) {
-      GenerateRecordCallTarget(masm);
-    } else {
-      GenerateRecordCallTargetNoArray(masm);
-    }
+    GenerateRecordCallTarget(masm);
   }
 
   // Jump to the function-specific construct stub.
-  Register jump_reg = FLAG_optimize_constructed_arrays ? x3 : x2;
+  Register jump_reg = x3;
   Register shared_func_info = jump_reg;
   Register cons_stub = jump_reg;
   Register cons_stub_code = jump_reg;
   __ Ldr(shared_func_info,
          FieldMemOperand(function, JSFunction::kSharedFunctionInfoOffset));
   __ Ldr(cons_stub,
          FieldMemOperand(shared_func_info,
                          SharedFunctionInfo::kConstructStubOffset));
   __ Add(cons_stub_code, cons_stub, Code::kHeaderSize - kHeapObjectTag);
   __ Br(cons_stub_code);
@@ skipping 240 matching lines @@
 
   // Check that both operands are internalized strings.
   Register rhs_map = x10;
   Register lhs_map = x11;
   Register rhs_type = x10;
   Register lhs_type = x11;
   __ Ldr(lhs_map, FieldMemOperand(lhs, HeapObject::kMapOffset));
   __ Ldr(rhs_map, FieldMemOperand(rhs, HeapObject::kMapOffset));
   __ Ldrb(lhs_type, FieldMemOperand(lhs_map, Map::kInstanceTypeOffset));
   __ Ldrb(rhs_type, FieldMemOperand(rhs_map, Map::kInstanceTypeOffset));
-  __ And(x10, lhs_type, rhs_type);
-  __ Tbz(x10, MaskToBit(kIsInternalizedMask), &miss);
-  STATIC_ASSERT(kInternalizedTag != 0);
+
+  __ And(x12, rhs_type, kIsNotStringMask | kIsInternalizedMask);
+  __ And(x13, lhs_type, kIsNotStringMask | kIsInternalizedMask);
+  __ Cmp(x12, kInternalizedTag | kStringTag);
+  __ Ccmp(x13, kInternalizedTag | kStringTag, NoFlag, eq);
+  __ B(ne, &miss);
 
   // Internalized strings are compared by identity.
   STATIC_ASSERT(EQUAL == 0);
   __ Cmp(lhs, rhs);
   __ Cset(result, ne);
   __ Ret();
 
   __ Bind(&miss);
   GenerateMiss(masm);
 }
@@ skipping 17 matching lines @@
 
   // Check that both operands are unique names. This leaves the instance
   // types loaded in tmp1 and tmp2.
   __ Ldr(x10, FieldMemOperand(lhs, HeapObject::kMapOffset));
   __ Ldr(x11, FieldMemOperand(rhs, HeapObject::kMapOffset));
   __ Ldrb(lhs_instance_type, FieldMemOperand(x10, Map::kInstanceTypeOffset));
   __ Ldrb(rhs_instance_type, FieldMemOperand(x11, Map::kInstanceTypeOffset));
 
   // To avoid a miss, each instance type should be either SYMBOL_TYPE or it
   // should have kInternalizedTag set.
-  STATIC_ASSERT(kInternalizedTag != 0);
-  __ Tst(lhs_instance_type, kIsInternalizedMask);
-  __ Ccmp(lhs_instance_type, SYMBOL_TYPE, ZFlag, eq);
-  __ B(ne, &miss);
-
-  __ Tst(rhs_instance_type, kIsInternalizedMask);
-  __ Ccmp(rhs_instance_type, SYMBOL_TYPE, ZFlag, eq);
-  __ B(ne, &miss);
+  __ JumpIfNotUniqueName(lhs_instance_type, &miss);
+  __ JumpIfNotUniqueName(rhs_instance_type, &miss);
 
   // Unique names are compared by identity.
   STATIC_ASSERT(EQUAL == 0);
   __ Cmp(lhs, rhs);
   __ Cset(result, ne);
   __ Ret();
 
   __ Bind(&miss);
   GenerateMiss(masm);
 }
@@ skipping 31 matching lines @@
   Label not_equal;
   __ Cmp(lhs, rhs);
   __ B(ne, &not_equal);
   __ Mov(result, EQUAL);
   __ Ret();
 
   __ Bind(&not_equal);
   // Handle not identical strings
 
   // Check that both strings are internalized strings. If they are, we're done
-  // because we already know they are not identical.
+  // because we already know they are not identical. We know they are both
+  // strings.
   if (equality) {
     ASSERT(GetCondition() == eq);
     STATIC_ASSERT(kInternalizedTag != 0);
     Label not_internalized_strings;
     __ And(x12, lhs_type, rhs_type);
     __ Tbz(x12, MaskToBit(kIsInternalizedMask), &not_internalized_strings);
     // Result is in rhs (x0), and not EQUAL, as rhs is not a smi.
     __ Ret();
     __ Bind(&not_internalized_strings);
   }
@@ skipping 1814 matching lines @@
     __ Cmp(entity_name, Operand(name));
     __ B(eq, miss);
 
     Label good;
     __ JumpIfRoot(entity_name, Heap::kTheHoleValueRootIndex, &good);
 
     // Check if the entry name is not a unique name.
     __ Ldr(entity_name, FieldMemOperand(entity_name, HeapObject::kMapOffset));
     __ Ldrb(entity_name,
             FieldMemOperand(entity_name, Map::kInstanceTypeOffset));
-    __ TestAndBranchIfAnySet(entity_name, kIsInternalizedMask, &good);
-    __ CompareAndBranch(entity_name, SYMBOL_TYPE, ne, miss);
-
+    __ JumpIfNotUniqueName(entity_name, miss);
     __ Bind(&good);
   }
 
   CPURegList spill_list(CPURegister::kRegister, kXRegSize, 0, 6);
   spill_list.Combine(lr);
   spill_list.Remove(scratch0);  // Scratch registers don't need to be preserved.
 
   __ PushCPURegList(spill_list);
 
   __ Ldr(x0, FieldMemOperand(receiver, JSObject::kPropertiesOffset));
@@ skipping 64 matching lines @@
     // Having undefined at this place means the name is not contained.
     __ Cmp(entry_key, undefined);
     __ B(eq, &not_in_dictionary);
 
     // Stop if found the property.
     __ Cmp(entry_key, key);
     __ B(eq, &in_dictionary);
 
     if (i != kTotalProbes - 1 && mode_ == NEGATIVE_LOOKUP) {
       // Check if the entry name is not a unique name.
-      Label cont;
       __ Ldr(entry_key, FieldMemOperand(entry_key, HeapObject::kMapOffset));
       __ Ldrb(entry_key, FieldMemOperand(entry_key, Map::kInstanceTypeOffset));
-      STATIC_ASSERT(kIsInternalizedMask != 0);
-      __ Tbnz(entry_key, MaskToBit(kIsInternalizedMask), &cont);
-      __ CompareAndBranch(entry_key, SYMBOL_TYPE, ne, &maybe_in_dictionary);
-      __ Bind(&cont);
+      __ JumpIfNotUniqueName(entry_key, &maybe_in_dictionary);
     }
   }
 
   __ Bind(&maybe_in_dictionary);
   // If we are doing negative lookup then probing failure should be
   // treated as a lookup success. For positive lookup, probing failure
   // should be treated as lookup failure.
   if (mode_ == POSITIVE_LOOKUP) {
     __ Mov(result, 0);
     __ Ret();
@@ skipping 167 matching lines @@
     Label okay_here;
     Handle<Map> cell_map(masm->isolate()->heap()->global_property_cell_map());
     __ CompareAndBranch(type_info_cell, Operand(undefined_sentinel),
                         eq, &okay_here);
     __ Ldr(x10, FieldMemOperand(type_info_cell, Cell::kMapOffset));
     __ Cmp(x10, Operand(cell_map));
     __ Assert(eq, "Expected property cell in type_info_cell");
     __ Bind(&okay_here);
   }
 
-  if (FLAG_optimize_constructed_arrays) {
-    Register kind = x3;
-    Label no_info, switch_ready;
-    // Get the elements kind and case on that.
-    __ CompareAndBranch(type_info_cell, Operand(undefined_sentinel),
-                        eq, &no_info);
-    __ Ldr(kind, FieldMemOperand(type_info_cell, PropertyCell::kValueOffset));
-    __ JumpIfNotSmi(kind, &no_info);
-    __ SmiUntag(kind);
-    __ B(&switch_ready);
+  Register kind = x3;
+  Label no_info, switch_ready;
+  // Get the elements kind and case on that.
+  __ CompareAndBranch(type_info_cell, Operand(undefined_sentinel),
+                      eq, &no_info);
+  __ Ldr(kind, FieldMemOperand(type_info_cell, PropertyCell::kValueOffset));
+  __ JumpIfNotSmi(kind, &no_info);
+  __ SmiUntag(kind);
+  __ B(&switch_ready);
 
-    __ Bind(&no_info);
-    __ Mov(kind, GetInitialFastElementsKind());
-    __ Bind(&switch_ready);
+  __ Bind(&no_info);
+  __ Mov(kind, GetInitialFastElementsKind());
+  __ Bind(&switch_ready);
 
-    if (argument_count_ == ANY) {
-      Label zero_case, n_case;
-      __ Cbz(argc, &zero_case);
-      __ Cmp(argc, 1);
-      __ B(ne, &n_case);
+  if (argument_count_ == ANY) {
+    Label zero_case, n_case;
+    __ Cbz(argc, &zero_case);
+    __ Cmp(argc, 1);
+    __ B(ne, &n_case);
 
-      // One argument.
-      CreateArrayDispatchOneArgument(masm);
+    // One argument.
+    CreateArrayDispatchOneArgument(masm);
 
-      __ Bind(&zero_case);
-      // No arguments.
-      CreateArrayDispatch<ArrayNoArgumentConstructorStub>(masm);
+    __ Bind(&zero_case);
+    // No arguments.
+    CreateArrayDispatch<ArrayNoArgumentConstructorStub>(masm);
 
-      __ Bind(&n_case);
-      // N arguments.
-      CreateArrayDispatch<ArrayNArgumentsConstructorStub>(masm);
+    __ Bind(&n_case);
+    // N arguments.
+    CreateArrayDispatch<ArrayNArgumentsConstructorStub>(masm);
 
-    } else if (argument_count_ == NONE) {
-      CreateArrayDispatch<ArrayNoArgumentConstructorStub>(masm);
-    } else if (argument_count_ == ONE) {
-      CreateArrayDispatchOneArgument(masm);
-    } else if (argument_count_ == MORE_THAN_ONE) {
-      CreateArrayDispatch<ArrayNArgumentsConstructorStub>(masm);
-    } else {
-      UNREACHABLE();
-    }
+  } else if (argument_count_ == NONE) {
+    CreateArrayDispatch<ArrayNoArgumentConstructorStub>(masm);
+  } else if (argument_count_ == ONE) {
+    CreateArrayDispatchOneArgument(masm);
+  } else if (argument_count_ == MORE_THAN_ONE) {
+    CreateArrayDispatch<ArrayNArgumentsConstructorStub>(masm);
   } else {
-     Label generic_constructor;
-     // Run the native code for the Array function called as a constructor.
-     ArrayNativeCode(masm, &generic_constructor);
-
-     // Jump to the generic construct code in case the specialized code cannot
-     // handle the construction.
-     __ Bind(&generic_constructor);
-     Handle<Code> generic_construct_stub =
-         masm->isolate()->builtins()->JSConstructStubGeneric();
-     __ Jump(generic_construct_stub, RelocInfo::CODE_TARGET);
+    UNREACHABLE();
   }
 }
 
 
 void InternalArrayConstructorStub::GenerateCase(
     MacroAssembler* masm, ElementsKind kind) {
   Label zero_case, n_case;
   Register argc = x0;
 
   __ Cbz(argc, &zero_case);
@@ skipping 49 matching lines @@
     __ Ldr(x10, FieldMemOperand(constructor,
                                 JSFunction::kPrototypeOrInitialMapOffset));
     // Will both indicate a NULL and a Smi.
     __ JumpIfSmi(x10, &unexpected_map);
     __ JumpIfObjectType(x10, x10, x11, MAP_TYPE, &map_ok);
     __ Bind(&unexpected_map);
     __ Abort("Unexpected initial map for Array function");
     __ Bind(&map_ok);
   }
 
-  if (FLAG_optimize_constructed_arrays) {
-    Register kind = w3;
-    // Figure out the right elements kind
-    __ Ldr(x10, FieldMemOperand(constructor,
-                                JSFunction::kPrototypeOrInitialMapOffset));
+  Register kind = w3;
+  // Figure out the right elements kind
+  __ Ldr(x10, FieldMemOperand(constructor,
+                              JSFunction::kPrototypeOrInitialMapOffset));
 
-    // TODO(jbramley): Add a helper function to read elements kind from an
-    // existing map.
-    // Load the map's "bit field 2" into result.
-    __ Ldr(kind, FieldMemOperand(x10, Map::kBitField2Offset));
-    // Retrieve elements_kind from bit field 2.
-    __ Ubfx(kind, kind, Map::kElementsKindShift, Map::kElementsKindBitCount);
+  // TODO(jbramley): Add a helper function to read elements kind from an
+  // existing map.
+  // Load the map's "bit field 2" into result.
+  __ Ldr(kind, FieldMemOperand(x10, Map::kBitField2Offset));
+  // Retrieve elements_kind from bit field 2.
+  __ Ubfx(kind, kind, Map::kElementsKindShift, Map::kElementsKindBitCount);
 
-    if (FLAG_debug_code) {
-      Label done;
-      __ Cmp(x3, FAST_ELEMENTS);
-      __ Ccmp(x3, FAST_HOLEY_ELEMENTS, ZFlag, ne);
-      __ Assert(eq,
-            "Invalid ElementsKind for InternalArray or InternalPackedArray");
-    }
+  if (FLAG_debug_code) {
+    Label done;
+    __ Cmp(x3, FAST_ELEMENTS);
+    __ Ccmp(x3, FAST_HOLEY_ELEMENTS, ZFlag, ne);
+    __ Assert(eq,
+              "Invalid ElementsKind for InternalArray or InternalPackedArray");
+  }
 
-    Label fast_elements_case;
-    __ CompareAndBranch(kind, FAST_ELEMENTS, eq, &fast_elements_case);
-    GenerateCase(masm, FAST_HOLEY_ELEMENTS);
+  Label fast_elements_case;
+  __ CompareAndBranch(kind, FAST_ELEMENTS, eq, &fast_elements_case);
+  GenerateCase(masm, FAST_HOLEY_ELEMENTS);
 
-    __ Bind(&fast_elements_case);
-    GenerateCase(masm, FAST_ELEMENTS);
-  } else {
-    Label generic_constructor;
-    // Run the native code for the Array function called as constructor.
-    ArrayNativeCode(masm, &generic_constructor);
-
-    // Jump to the generic construct code in case the specialized code cannot
-    // handle the construction.
-    __ Bind(&generic_constructor);
-    Handle<Code> generic_construct_stub =
-        masm->isolate()->builtins()->JSConstructStubGeneric();
-    __ Jump(generic_construct_stub, RelocInfo::CODE_TARGET);
-  }
+  __ Bind(&fast_elements_case);
+  GenerateCase(masm, FAST_ELEMENTS);
 }
 
 
 #undef __
 
 } }  // namespace v8::internal
 
 #endif  // V8_TARGET_ARCH_A64