1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #include "code-stubs.h"
38 static LChunk* OptimizeGraph(HGraph* graph) {
39 DisallowHeapAllocation no_allocation;
40 DisallowHandleAllocation no_handles;
41 DisallowHandleDereference no_deref;
43 ASSERT(graph != NULL);
44 SmartArrayPointer<char> bailout_reason;
45 if (!graph->Optimize(&bailout_reason)) {
46 FATAL(bailout_reason.is_empty() ? "unknown" : *bailout_reason);
48 LChunk* chunk = LChunk::NewChunk(graph);
50 FATAL(graph->info()->bailout_reason());
56 class CodeStubGraphBuilderBase : public HGraphBuilder {
58 CodeStubGraphBuilderBase(Isolate* isolate, HydrogenCodeStub* stub)
59 : HGraphBuilder(&info_),
60 arguments_length_(NULL),
63 descriptor_ = stub->GetInterfaceDescriptor(isolate);
64 parameters_.Reset(new HParameter*[descriptor_->register_param_count_]);
66 virtual bool BuildGraph();
69 virtual HValue* BuildCodeStub() = 0;
70 HParameter* GetParameter(int parameter) {
71 ASSERT(parameter < descriptor_->register_param_count_);
72 return parameters_[parameter];
74 HValue* GetArgumentsLength() {
75 // This is initialized in BuildGraph()
76 ASSERT(arguments_length_ != NULL);
77 return arguments_length_;
79 CompilationInfo* info() { return &info_; }
80 HydrogenCodeStub* stub() { return info_.code_stub(); }
81 HContext* context() { return context_; }
82 Isolate* isolate() { return info_.isolate(); }
84 class ArrayContextChecker {
86 ArrayContextChecker(HGraphBuilder* builder, HValue* constructor,
87 HValue* array_function)
89 checker_.If<HCompareObjectEqAndBranch, HValue*>(constructor,
94 ~ArrayContextChecker() {
108 HValue* BuildArrayConstructor(ElementsKind kind,
109 ContextCheckMode context_mode,
110 AllocationSiteOverrideMode override_mode,
111 ArgumentClass argument_class);
112 HValue* BuildInternalArrayConstructor(ElementsKind kind,
113 ArgumentClass argument_class);
116 HValue* BuildArraySingleArgumentConstructor(JSArrayBuilder* builder);
117 HValue* BuildArrayNArgumentsConstructor(JSArrayBuilder* builder,
120 SmartArrayPointer<HParameter*> parameters_;
121 HValue* arguments_length_;
122 CompilationInfoWithZone info_;
123 CodeStubInterfaceDescriptor* descriptor_;
128 bool CodeStubGraphBuilderBase::BuildGraph() {
129 // Update the static counter each time a new code stub is generated.
130 isolate()->counters()->code_stubs()->Increment();
132 if (FLAG_trace_hydrogen_stubs) {
133 const char* name = CodeStub::MajorName(stub()->MajorKey(), false);
134 PrintF("-----------------------------------------------------------\n");
135 PrintF("Compiling stub %s using hydrogen\n", name);
136 isolate()->GetHTracer()->TraceCompilation(&info_);
139 Zone* zone = this->zone();
140 int param_count = descriptor_->register_param_count_;
141 HEnvironment* start_environment = graph()->start_environment();
142 HBasicBlock* next_block = CreateBasicBlock(start_environment);
143 current_block()->Goto(next_block);
144 next_block->SetJoinId(BailoutId::StubEntry());
145 set_current_block(next_block);
147 HConstant* undefined_constant = new(zone) HConstant(
148 isolate()->factory()->undefined_value());
149 AddInstruction(undefined_constant);
150 graph()->set_undefined_constant(undefined_constant);
152 for (int i = 0; i < param_count; ++i) {
154 new(zone) HParameter(i, HParameter::REGISTER_PARAMETER);
155 AddInstruction(param);
156 start_environment->Bind(i, param);
157 parameters_[i] = param;
160 HInstruction* stack_parameter_count;
161 if (descriptor_->stack_parameter_count_ != NULL) {
162 ASSERT(descriptor_->environment_length() == (param_count + 1));
163 stack_parameter_count = new(zone) HParameter(param_count,
164 HParameter::REGISTER_PARAMETER,
165 Representation::Integer32());
166 stack_parameter_count->set_type(HType::Smi());
167 // It's essential to bind this value to the environment in case of deopt.
168 AddInstruction(stack_parameter_count);
169 start_environment->Bind(param_count, stack_parameter_count);
170 arguments_length_ = stack_parameter_count;
172 ASSERT(descriptor_->environment_length() == param_count);
173 stack_parameter_count = graph()->GetConstantMinus1();
174 arguments_length_ = graph()->GetConstant0();
177 context_ = new(zone) HContext();
178 AddInstruction(context_);
179 start_environment->BindContext(context_);
181 Add<HSimulate>(BailoutId::StubEntry());
183 NoObservableSideEffectsScope no_effects(this);
185 HValue* return_value = BuildCodeStub();
187 // We might have extra expressions to pop from the stack in addition to the
189 HInstruction* stack_pop_count = stack_parameter_count;
190 if (descriptor_->function_mode_ == JS_FUNCTION_STUB_MODE) {
191 if (!stack_parameter_count->IsConstant() &&
192 descriptor_->hint_stack_parameter_count_ < 0) {
193 HInstruction* amount = graph()->GetConstant1();
194 stack_pop_count = AddInstruction(
195 HAdd::New(zone, context_, stack_parameter_count, amount));
196 stack_pop_count->ChangeRepresentation(Representation::Integer32());
197 stack_pop_count->ClearFlag(HValue::kCanOverflow);
199 int count = descriptor_->hint_stack_parameter_count_;
200 stack_pop_count = AddInstruction(new(zone) HConstant(count));
204 if (current_block() != NULL) {
205 HReturn* hreturn_instruction = new(zone) HReturn(return_value,
208 current_block()->Finish(hreturn_instruction);
209 set_current_block(NULL);
215 template <class Stub>
216 class CodeStubGraphBuilder: public CodeStubGraphBuilderBase {
218 explicit CodeStubGraphBuilder(Stub* stub)
219 : CodeStubGraphBuilderBase(Isolate::Current(), stub) {}
222 virtual HValue* BuildCodeStub() {
223 if (casted_stub()->IsUninitialized()) {
224 return BuildCodeUninitializedStub();
226 return BuildCodeInitializedStub();
230 virtual HValue* BuildCodeInitializedStub() {
235 virtual HValue* BuildCodeUninitializedStub() {
236 // Force a deopt that falls back to the runtime.
237 HValue* undefined = graph()->GetConstantUndefined();
238 IfBuilder builder(this);
239 builder.IfNot<HCompareObjectEqAndBranch, HValue*>(undefined, undefined);
245 Stub* casted_stub() { return static_cast<Stub*>(stub()); }
249 Handle<Code> HydrogenCodeStub::GenerateLightweightMissCode(Isolate* isolate) {
250 Factory* factory = isolate->factory();
252 // Generate the new code.
253 MacroAssembler masm(isolate, NULL, 256);
256 // Update the static counter each time a new code stub is generated.
257 isolate->counters()->code_stubs()->Increment();
259 // Nested stubs are not allowed for leaves.
260 AllowStubCallsScope allow_scope(&masm, false);
262 // Generate the code for the stub.
263 masm.set_generating_stub(true);
264 NoCurrentFrameScope scope(&masm);
265 GenerateLightweightMiss(&masm);
268 // Create the code object.
272 // Copy the generated code into a heap object.
273 Code::Flags flags = Code::ComputeFlags(
279 Handle<Code> new_object = factory->NewCode(
280 desc, flags, masm.CodeObject(), NeedsImmovableCode());
285 template <class Stub>
286 static Handle<Code> DoGenerateCode(Stub* stub) {
287 Isolate* isolate = Isolate::Current();
288 CodeStub::Major major_key =
289 static_cast<HydrogenCodeStub*>(stub)->MajorKey();
290 CodeStubInterfaceDescriptor* descriptor =
291 isolate->code_stub_interface_descriptor(major_key);
292 if (descriptor->register_param_count_ < 0) {
293 stub->InitializeInterfaceDescriptor(isolate, descriptor);
296 // If we are uninitialized we can use a light-weight stub to enter
297 // the runtime that is significantly faster than using the standard
298 // stub-failure deopt mechanism.
299 if (stub->IsUninitialized() && descriptor->has_miss_handler()) {
300 ASSERT(descriptor->stack_parameter_count_ == NULL);
301 return stub->GenerateLightweightMissCode(isolate);
303 CodeStubGraphBuilder<Stub> builder(stub);
304 LChunk* chunk = OptimizeGraph(builder.CreateGraph());
305 return chunk->Codegen();
310 HValue* CodeStubGraphBuilder<ToNumberStub>::BuildCodeStub() {
311 HValue* value = GetParameter(0);
313 // Check if the parameter is already a SMI or heap number.
314 IfBuilder if_number(this);
315 if_number.If<HIsSmiAndBranch>(value);
316 if_number.OrIf<HCompareMap>(value, isolate()->factory()->heap_number_map());
319 // Return the number.
324 // Convert the parameter to number using the builtin.
325 HValue* function = AddLoadJSBuiltin(Builtins::TO_NUMBER, context());
326 Add<HPushArgument>(value);
327 Push(Add<HInvokeFunction>(context(), function, 1));
335 Handle<Code> ToNumberStub::GenerateCode() {
336 return DoGenerateCode(this);
341 HValue* CodeStubGraphBuilder<FastCloneShallowArrayStub>::BuildCodeStub() {
342 Zone* zone = this->zone();
343 Factory* factory = isolate()->factory();
344 HValue* undefined = graph()->GetConstantUndefined();
345 AllocationSiteMode alloc_site_mode = casted_stub()->allocation_site_mode();
346 FastCloneShallowArrayStub::Mode mode = casted_stub()->mode();
347 int length = casted_stub()->length();
349 HInstruction* allocation_site =
350 AddInstruction(new(zone) HLoadKeyed(GetParameter(0),
354 IfBuilder checker(this);
355 checker.IfNot<HCompareObjectEqAndBranch, HValue*>(allocation_site, undefined);
358 HObjectAccess access = HObjectAccess::ForAllocationSiteTransitionInfo();
359 HInstruction* boilerplate = AddLoad(allocation_site, access);
360 if (mode == FastCloneShallowArrayStub::CLONE_ANY_ELEMENTS) {
361 HValue* elements = AddLoadElements(boilerplate);
363 IfBuilder if_fixed_cow(this);
364 if_fixed_cow.If<HCompareMap>(elements, factory->fixed_cow_array_map());
366 environment()->Push(BuildCloneShallowArray(context(),
371 0/*copy-on-write*/));
374 IfBuilder if_fixed(this);
375 if_fixed.If<HCompareMap>(elements, factory->fixed_array_map());
377 environment()->Push(BuildCloneShallowArray(context(),
384 environment()->Push(BuildCloneShallowArray(context(),
388 FAST_DOUBLE_ELEMENTS,
391 ElementsKind elements_kind = casted_stub()->ComputeElementsKind();
392 environment()->Push(BuildCloneShallowArray(context(),
403 return environment()->Pop();
407 Handle<Code> FastCloneShallowArrayStub::GenerateCode() {
408 return DoGenerateCode(this);
413 HValue* CodeStubGraphBuilder<FastCloneShallowObjectStub>::BuildCodeStub() {
414 Zone* zone = this->zone();
415 HValue* undefined = graph()->GetConstantUndefined();
417 HInstruction* boilerplate =
418 AddInstruction(new(zone) HLoadKeyed(GetParameter(0),
423 IfBuilder checker(this);
424 checker.IfNot<HCompareObjectEqAndBranch, HValue*>(boilerplate, undefined);
427 int size = JSObject::kHeaderSize + casted_stub()->length() * kPointerSize;
428 HValue* boilerplate_size =
429 AddInstruction(new(zone) HInstanceSize(boilerplate));
430 HValue* size_in_words =
431 AddInstruction(new(zone) HConstant(size >> kPointerSizeLog2));
432 checker.If<HCompareNumericAndBranch>(boilerplate_size,
433 size_in_words, Token::EQ);
436 HValue* size_in_bytes = AddInstruction(new(zone) HConstant(size));
437 HAllocate::Flags flags = HAllocate::CAN_ALLOCATE_IN_NEW_SPACE;
438 if (isolate()->heap()->ShouldGloballyPretenure()) {
439 flags = static_cast<HAllocate::Flags>(
440 flags | HAllocate::CAN_ALLOCATE_IN_OLD_POINTER_SPACE);
443 HInstruction* object = AddInstruction(new(zone)
444 HAllocate(context(), size_in_bytes, HType::JSObject(), flags));
446 for (int i = 0; i < size; i += kPointerSize) {
447 HObjectAccess access = HObjectAccess::ForJSObjectOffset(i);
448 AddStore(object, access, AddLoad(boilerplate, access));
451 environment()->Push(object);
455 return environment()->Pop();
459 Handle<Code> FastCloneShallowObjectStub::GenerateCode() {
460 return DoGenerateCode(this);
465 HValue* CodeStubGraphBuilder<CreateAllocationSiteStub>::BuildCodeStub() {
466 Zone* zone = this->zone();
468 HValue* size = AddInstruction(new(zone) HConstant(AllocationSite::kSize));
469 HAllocate::Flags flags = HAllocate::DefaultFlags();
470 flags = static_cast<HAllocate::Flags>(
471 flags | HAllocate::CAN_ALLOCATE_IN_OLD_POINTER_SPACE);
472 HInstruction* object = AddInstruction(new(zone)
473 HAllocate(context(), size, HType::JSObject(), flags));
476 Handle<Map> allocation_site_map(isolate()->heap()->allocation_site_map(),
478 AddStoreMapConstant(object, allocation_site_map);
480 // Store the payload (smi elements kind)
481 HValue* initial_elements_kind = AddInstruction(new(zone) HConstant(
482 GetInitialFastElementsKind()));
483 Add<HStoreNamedField>(object,
484 HObjectAccess::ForAllocationSiteTransitionInfo(),
485 initial_elements_kind);
487 Add<HLinkObjectInList>(object, HObjectAccess::ForAllocationSiteWeakNext(),
488 HLinkObjectInList::ALLOCATION_SITE_LIST);
490 // We use a hammer (SkipWriteBarrier()) to indicate that we know the input
491 // cell is really a Cell, and so no write barrier is needed.
492 // TODO(mvstanton): Add a debug_code check to verify the input cell is really
493 // a cell. (perhaps with a new instruction, HAssert).
494 HInstruction* cell = GetParameter(0);
495 HObjectAccess access = HObjectAccess::ForCellValue();
496 HStoreNamedField* store = AddStore(cell, access, object);
497 store->SkipWriteBarrier();
502 Handle<Code> CreateAllocationSiteStub::GenerateCode() {
503 return DoGenerateCode(this);
508 HValue* CodeStubGraphBuilder<KeyedLoadFastElementStub>::BuildCodeStub() {
509 HInstruction* load = BuildUncheckedMonomorphicElementAccess(
510 GetParameter(0), GetParameter(1), NULL, NULL,
511 casted_stub()->is_js_array(), casted_stub()->elements_kind(),
512 false, NEVER_RETURN_HOLE, STANDARD_STORE);
517 Handle<Code> KeyedLoadFastElementStub::GenerateCode() {
518 return DoGenerateCode(this);
523 HValue* CodeStubGraphBuilder<LoadFieldStub>::BuildCodeStub() {
524 Representation rep = casted_stub()->representation();
525 HObjectAccess access = casted_stub()->is_inobject() ?
526 HObjectAccess::ForJSObjectOffset(casted_stub()->offset(), rep) :
527 HObjectAccess::ForBackingStoreOffset(casted_stub()->offset(), rep);
528 return AddInstruction(BuildLoadNamedField(GetParameter(0), access));
532 Handle<Code> LoadFieldStub::GenerateCode() {
533 return DoGenerateCode(this);
538 HValue* CodeStubGraphBuilder<KeyedLoadFieldStub>::BuildCodeStub() {
539 Representation rep = casted_stub()->representation();
540 HObjectAccess access = casted_stub()->is_inobject() ?
541 HObjectAccess::ForJSObjectOffset(casted_stub()->offset(), rep) :
542 HObjectAccess::ForBackingStoreOffset(casted_stub()->offset(), rep);
543 return AddInstruction(BuildLoadNamedField(GetParameter(0), access));
547 Handle<Code> KeyedLoadFieldStub::GenerateCode() {
548 return DoGenerateCode(this);
553 HValue* CodeStubGraphBuilder<KeyedStoreFastElementStub>::BuildCodeStub() {
554 BuildUncheckedMonomorphicElementAccess(
555 GetParameter(0), GetParameter(1), GetParameter(2), NULL,
556 casted_stub()->is_js_array(), casted_stub()->elements_kind(),
557 true, NEVER_RETURN_HOLE, casted_stub()->store_mode());
559 return GetParameter(2);
563 Handle<Code> KeyedStoreFastElementStub::GenerateCode() {
564 return DoGenerateCode(this);
569 HValue* CodeStubGraphBuilder<TransitionElementsKindStub>::BuildCodeStub() {
570 info()->MarkAsSavesCallerDoubles();
572 BuildTransitionElementsKind(GetParameter(0),
574 casted_stub()->from_kind(),
575 casted_stub()->to_kind(),
578 return GetParameter(0);
582 Handle<Code> TransitionElementsKindStub::GenerateCode() {
583 return DoGenerateCode(this);
586 HValue* CodeStubGraphBuilderBase::BuildArrayConstructor(
588 ContextCheckMode context_mode,
589 AllocationSiteOverrideMode override_mode,
590 ArgumentClass argument_class) {
591 HValue* constructor = GetParameter(ArrayConstructorStubBase::kConstructor);
592 if (context_mode == CONTEXT_CHECK_REQUIRED) {
593 HInstruction* array_function = BuildGetArrayFunction(context());
594 ArrayContextChecker checker(this, constructor, array_function);
597 HValue* property_cell = GetParameter(ArrayConstructorStubBase::kPropertyCell);
598 // Walk through the property cell to the AllocationSite
599 HValue* alloc_site = AddInstruction(new(zone()) HLoadNamedField(property_cell,
600 HObjectAccess::ForCellValue()));
601 JSArrayBuilder array_builder(this, kind, alloc_site, constructor,
603 HValue* result = NULL;
604 switch (argument_class) {
606 result = array_builder.AllocateEmptyArray();
609 result = BuildArraySingleArgumentConstructor(&array_builder);
612 result = BuildArrayNArgumentsConstructor(&array_builder, kind);
620 HValue* CodeStubGraphBuilderBase::BuildInternalArrayConstructor(
621 ElementsKind kind, ArgumentClass argument_class) {
622 HValue* constructor = GetParameter(
623 InternalArrayConstructorStubBase::kConstructor);
624 JSArrayBuilder array_builder(this, kind, constructor);
626 HValue* result = NULL;
627 switch (argument_class) {
629 result = array_builder.AllocateEmptyArray();
632 result = BuildArraySingleArgumentConstructor(&array_builder);
635 result = BuildArrayNArgumentsConstructor(&array_builder, kind);
642 HValue* CodeStubGraphBuilderBase::BuildArraySingleArgumentConstructor(
643 JSArrayBuilder* array_builder) {
644 // Smi check and range check on the input arg.
645 HValue* constant_one = graph()->GetConstant1();
646 HValue* constant_zero = graph()->GetConstant0();
648 HInstruction* elements = AddInstruction(
649 new(zone()) HArgumentsElements(false));
650 HInstruction* argument = AddInstruction(
651 new(zone()) HAccessArgumentsAt(elements, constant_one, constant_zero));
653 HConstant* max_alloc_length =
654 new(zone()) HConstant(JSObject::kInitialMaxFastElementArray);
655 AddInstruction(max_alloc_length);
656 const int initial_capacity = JSArray::kPreallocatedArrayElements;
657 HConstant* initial_capacity_node = new(zone()) HConstant(initial_capacity);
658 AddInstruction(initial_capacity_node);
660 HBoundsCheck* checked_arg = Add<HBoundsCheck>(argument, max_alloc_length);
661 IfBuilder if_builder(this);
662 if_builder.If<HCompareNumericAndBranch>(checked_arg, constant_zero,
665 Push(initial_capacity_node); // capacity
666 Push(constant_zero); // length
668 Push(checked_arg); // capacity
669 Push(checked_arg); // length
672 // Figure out total size
673 HValue* length = Pop();
674 HValue* capacity = Pop();
675 return array_builder->AllocateArray(capacity, length, true);
679 HValue* CodeStubGraphBuilderBase::BuildArrayNArgumentsConstructor(
680 JSArrayBuilder* array_builder, ElementsKind kind) {
681 // We need to fill with the hole if it's a smi array in the multi-argument
682 // case because we might have to bail out while copying arguments into
683 // the array because they aren't compatible with a smi array.
684 // If it's a double array, no problem, and if it's fast then no
685 // problem either because doubles are boxed.
686 HValue* length = GetArgumentsLength();
687 bool fill_with_hole = IsFastSmiElementsKind(kind);
688 HValue* new_object = array_builder->AllocateArray(length,
691 HValue* elements = array_builder->GetElementsLocation();
692 ASSERT(elements != NULL);
694 // Now populate the elements correctly.
695 LoopBuilder builder(this,
697 LoopBuilder::kPostIncrement);
698 HValue* start = graph()->GetConstant0();
699 HValue* key = builder.BeginBody(start, length, Token::LT);
700 HInstruction* argument_elements = AddInstruction(
701 new(zone()) HArgumentsElements(false));
702 HInstruction* argument = AddInstruction(new(zone()) HAccessArgumentsAt(
703 argument_elements, length, key));
705 AddInstruction(new(zone()) HStoreKeyed(elements, key, argument, kind));
712 HValue* CodeStubGraphBuilder<ArrayNoArgumentConstructorStub>::BuildCodeStub() {
713 ElementsKind kind = casted_stub()->elements_kind();
714 ContextCheckMode context_mode = casted_stub()->context_mode();
715 AllocationSiteOverrideMode override_mode = casted_stub()->override_mode();
716 return BuildArrayConstructor(kind, context_mode, override_mode, NONE);
720 Handle<Code> ArrayNoArgumentConstructorStub::GenerateCode() {
721 return DoGenerateCode(this);
726 HValue* CodeStubGraphBuilder<ArraySingleArgumentConstructorStub>::
728 ElementsKind kind = casted_stub()->elements_kind();
729 ContextCheckMode context_mode = casted_stub()->context_mode();
730 AllocationSiteOverrideMode override_mode = casted_stub()->override_mode();
731 return BuildArrayConstructor(kind, context_mode, override_mode, SINGLE);
735 Handle<Code> ArraySingleArgumentConstructorStub::GenerateCode() {
736 return DoGenerateCode(this);
741 HValue* CodeStubGraphBuilder<ArrayNArgumentsConstructorStub>::BuildCodeStub() {
742 ElementsKind kind = casted_stub()->elements_kind();
743 ContextCheckMode context_mode = casted_stub()->context_mode();
744 AllocationSiteOverrideMode override_mode = casted_stub()->override_mode();
745 return BuildArrayConstructor(kind, context_mode, override_mode, MULTIPLE);
749 Handle<Code> ArrayNArgumentsConstructorStub::GenerateCode() {
750 return DoGenerateCode(this);
755 HValue* CodeStubGraphBuilder<InternalArrayNoArgumentConstructorStub>::
757 ElementsKind kind = casted_stub()->elements_kind();
758 return BuildInternalArrayConstructor(kind, NONE);
762 Handle<Code> InternalArrayNoArgumentConstructorStub::GenerateCode() {
763 return DoGenerateCode(this);
768 HValue* CodeStubGraphBuilder<InternalArraySingleArgumentConstructorStub>::
770 ElementsKind kind = casted_stub()->elements_kind();
771 return BuildInternalArrayConstructor(kind, SINGLE);
775 Handle<Code> InternalArraySingleArgumentConstructorStub::GenerateCode() {
776 return DoGenerateCode(this);
781 HValue* CodeStubGraphBuilder<InternalArrayNArgumentsConstructorStub>::
783 ElementsKind kind = casted_stub()->elements_kind();
784 return BuildInternalArrayConstructor(kind, MULTIPLE);
788 Handle<Code> InternalArrayNArgumentsConstructorStub::GenerateCode() {
789 return DoGenerateCode(this);
794 HValue* CodeStubGraphBuilder<CompareNilICStub>::BuildCodeInitializedStub() {
795 Isolate* isolate = graph()->isolate();
796 CompareNilICStub* stub = casted_stub();
797 HIfContinuation continuation;
798 Handle<Map> sentinel_map(isolate->heap()->meta_map());
799 Handle<Type> type = stub->GetType(isolate, sentinel_map);
800 BuildCompareNil(GetParameter(0), type, RelocInfo::kNoPosition, &continuation);
801 IfBuilder if_nil(this, &continuation);
803 if (continuation.IsFalseReachable()) {
805 if_nil.Return(graph()->GetConstant0());
808 return continuation.IsTrueReachable()
809 ? graph()->GetConstant1()
810 : graph()->GetConstantUndefined();
814 Handle<Code> CompareNilICStub::GenerateCode() {
815 return DoGenerateCode(this);
820 HValue* CodeStubGraphBuilder<UnaryOpStub>::BuildCodeInitializedStub() {
821 UnaryOpStub* stub = casted_stub();
822 Handle<Type> type = stub->GetType(graph()->isolate());
823 HValue* input = GetParameter(0);
825 // Prevent unwanted HChange being inserted to ensure that the stub
826 // deopts on newly encountered types.
827 if (!type->Maybe(Type::Double())) {
828 input = AddInstruction(new(zone())
829 HForceRepresentation(input, Representation::Smi()));
832 if (!type->Is(Type::Number())) {
833 // If we expect to see other things than Numbers, we will create a generic
834 // stub, which handles all numbers and calls into the runtime for the rest.
835 IfBuilder if_number(this);
836 if_number.If<HIsNumberAndBranch>(input);
838 HInstruction* res = BuildUnaryMathOp(input, type, stub->operation());
839 if_number.Return(AddInstruction(res));
841 HValue* function = AddLoadJSBuiltin(stub->ToJSBuiltin(), context());
842 Add<HPushArgument>(GetParameter(0));
843 HValue* result = Add<HInvokeFunction>(context(), function, 1);
844 if_number.Return(result);
846 return graph()->GetConstantUndefined();
849 return AddInstruction(BuildUnaryMathOp(input, type, stub->operation()));
853 Handle<Code> UnaryOpStub::GenerateCode() {
854 return DoGenerateCode(this);
859 HValue* CodeStubGraphBuilder<ToBooleanStub>::BuildCodeInitializedStub() {
860 ToBooleanStub* stub = casted_stub();
862 IfBuilder if_true(this);
863 if_true.If<HBranch>(GetParameter(0), stub->GetTypes());
865 if_true.Return(graph()->GetConstant1());
868 return graph()->GetConstant0();
872 Handle<Code> ToBooleanStub::GenerateCode() {
873 return DoGenerateCode(this);
878 HValue* CodeStubGraphBuilder<StoreGlobalStub>::BuildCodeInitializedStub() {
879 StoreGlobalStub* stub = casted_stub();
880 Handle<Object> hole(isolate()->heap()->the_hole_value(), isolate());
881 Handle<Object> placeholer_value(Smi::FromInt(0), isolate());
882 Handle<PropertyCell> placeholder_cell =
883 isolate()->factory()->NewPropertyCell(placeholer_value);
885 HParameter* receiver = GetParameter(0);
886 HParameter* value = GetParameter(2);
888 // Check that the map of the global has not changed: use a placeholder map
889 // that will be replaced later with the global object's map.
890 Handle<Map> placeholder_map = isolate()->factory()->meta_map();
891 AddInstruction(HCheckMaps::New(
892 receiver, placeholder_map, zone(), top_info()));
894 HValue* cell = Add<HConstant>(placeholder_cell, Representation::Tagged());
895 HObjectAccess access(HObjectAccess::ForCellPayload(isolate()));
896 HValue* cell_contents = Add<HLoadNamedField>(cell, access);
898 if (stub->is_constant()) {
899 IfBuilder builder(this);
900 builder.If<HCompareObjectEqAndBranch>(cell_contents, value);
905 // Load the payload of the global parameter cell. A hole indicates that the
906 // property has been deleted and that the store must be handled by the
908 IfBuilder builder(this);
909 HValue* hole_value = Add<HConstant>(hole, Representation::Tagged());
910 builder.If<HCompareObjectEqAndBranch>(cell_contents, hole_value);
914 Add<HStoreNamedField>(cell, access, value);
922 Handle<Code> StoreGlobalStub::GenerateCode() {
923 return DoGenerateCode(this);
928 HValue* CodeStubGraphBuilder<ElementsTransitionAndStoreStub>::BuildCodeStub() {
929 HValue* value = GetParameter(0);
930 HValue* map = GetParameter(1);
931 HValue* key = GetParameter(2);
932 HValue* object = GetParameter(3);
934 if (FLAG_trace_elements_transitions) {
935 // Tracing elements transitions is the job of the runtime.
936 Add<HDeoptimize>(Deoptimizer::EAGER);
938 info()->MarkAsSavesCallerDoubles();
940 BuildTransitionElementsKind(object, map,
941 casted_stub()->from_kind(),
942 casted_stub()->to_kind(),
943 casted_stub()->is_jsarray());
945 BuildUncheckedMonomorphicElementAccess(object, key, value, NULL,
946 casted_stub()->is_jsarray(),
947 casted_stub()->to_kind(),
948 true, ALLOW_RETURN_HOLE,
949 casted_stub()->store_mode());
956 Handle<Code> ElementsTransitionAndStoreStub::GenerateCode() {
957 return DoGenerateCode(this);
961 } } // namespace v8::internal