builtins-arm.cc revision 257744e915dfc84d6d07a6b2accf8402d9ffc708
1// Copyright 2011 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 4// met: 5// 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. 15// 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. 27 28#include "v8.h" 29 30#if defined(V8_TARGET_ARCH_ARM) 31 32#include "codegen.h" 33#include "debug.h" 34#include "deoptimizer.h" 35#include "full-codegen.h" 36#include "runtime.h" 37 38namespace v8 { 39namespace internal { 40 41 42#define __ ACCESS_MASM(masm) 43 44 45void Builtins::Generate_Adaptor(MacroAssembler* masm, 46 CFunctionId id, 47 BuiltinExtraArguments extra_args) { 48 // ----------- S t a t e ------------- 49 // -- r0 : number of arguments excluding receiver 50 // -- r1 : called function (only guaranteed when 51 // extra_args requires it) 52 // -- cp : context 53 // -- sp[0] : last argument 54 // -- ... 55 // -- sp[4 * (argc - 1)] : first argument (argc == r0) 56 // -- sp[4 * argc] : receiver 57 // ----------------------------------- 58 59 // Insert extra arguments. 60 int num_extra_args = 0; 61 if (extra_args == NEEDS_CALLED_FUNCTION) { 62 num_extra_args = 1; 63 __ push(r1); 64 } else { 65 ASSERT(extra_args == NO_EXTRA_ARGUMENTS); 66 } 67 68 // JumpToExternalReference expects r0 to contain the number of arguments 69 // including the receiver and the extra arguments. 70 __ add(r0, r0, Operand(num_extra_args + 1)); 71 __ JumpToExternalReference(ExternalReference(id, masm->isolate())); 72} 73 74 75// Load the built-in Array function from the current context. 76static void GenerateLoadArrayFunction(MacroAssembler* masm, Register result) { 77 // Load the global context. 78 79 __ ldr(result, MemOperand(cp, Context::SlotOffset(Context::GLOBAL_INDEX))); 80 __ ldr(result, 81 FieldMemOperand(result, GlobalObject::kGlobalContextOffset)); 82 // Load the Array function from the global context. 83 __ ldr(result, 84 MemOperand(result, 85 Context::SlotOffset(Context::ARRAY_FUNCTION_INDEX))); 86} 87 88 89// This constant has the same value as JSArray::kPreallocatedArrayElements and 90// if JSArray::kPreallocatedArrayElements is changed handling of loop unfolding 91// below should be reconsidered. 92static const int kLoopUnfoldLimit = 4; 93 94 95// Allocate an empty JSArray. The allocated array is put into the result 96// register. An elements backing store is allocated with size initial_capacity 97// and filled with the hole values. 98static void AllocateEmptyJSArray(MacroAssembler* masm, 99 Register array_function, 100 Register result, 101 Register scratch1, 102 Register scratch2, 103 Register scratch3, 104 int initial_capacity, 105 Label* gc_required) { 106 ASSERT(initial_capacity > 0); 107 // Load the initial map from the array function. 108 __ ldr(scratch1, FieldMemOperand(array_function, 109 JSFunction::kPrototypeOrInitialMapOffset)); 110 111 // Allocate the JSArray object together with space for a fixed array with the 112 // requested elements. 113 int size = JSArray::kSize + FixedArray::SizeFor(initial_capacity); 114 __ AllocateInNewSpace(size, 115 result, 116 scratch2, 117 scratch3, 118 gc_required, 119 TAG_OBJECT); 120 121 // Allocated the JSArray. Now initialize the fields except for the elements 122 // array. 123 // result: JSObject 124 // scratch1: initial map 125 // scratch2: start of next object 126 __ str(scratch1, FieldMemOperand(result, JSObject::kMapOffset)); 127 __ LoadRoot(scratch1, Heap::kEmptyFixedArrayRootIndex); 128 __ str(scratch1, FieldMemOperand(result, JSArray::kPropertiesOffset)); 129 // Field JSArray::kElementsOffset is initialized later. 130 __ mov(scratch3, Operand(0, RelocInfo::NONE)); 131 __ str(scratch3, FieldMemOperand(result, JSArray::kLengthOffset)); 132 133 // Calculate the location of the elements array and set elements array member 134 // of the JSArray. 135 // result: JSObject 136 // scratch2: start of next object 137 __ add(scratch1, result, Operand(JSArray::kSize)); 138 __ str(scratch1, FieldMemOperand(result, JSArray::kElementsOffset)); 139 140 // Clear the heap tag on the elements array. 141 ASSERT(kSmiTag == 0); 142 __ sub(scratch1, scratch1, Operand(kHeapObjectTag)); 143 144 // Initialize the FixedArray and fill it with holes. FixedArray length is 145 // stored as a smi. 146 // result: JSObject 147 // scratch1: elements array (untagged) 148 // scratch2: start of next object 149 __ LoadRoot(scratch3, Heap::kFixedArrayMapRootIndex); 150 ASSERT_EQ(0 * kPointerSize, FixedArray::kMapOffset); 151 __ str(scratch3, MemOperand(scratch1, kPointerSize, PostIndex)); 152 __ mov(scratch3, Operand(Smi::FromInt(initial_capacity))); 153 ASSERT_EQ(1 * kPointerSize, FixedArray::kLengthOffset); 154 __ str(scratch3, MemOperand(scratch1, kPointerSize, PostIndex)); 155 156 // Fill the FixedArray with the hole value. 157 ASSERT_EQ(2 * kPointerSize, FixedArray::kHeaderSize); 158 ASSERT(initial_capacity <= kLoopUnfoldLimit); 159 __ LoadRoot(scratch3, Heap::kTheHoleValueRootIndex); 160 for (int i = 0; i < initial_capacity; i++) { 161 __ str(scratch3, MemOperand(scratch1, kPointerSize, PostIndex)); 162 } 163} 164 165// Allocate a JSArray with the number of elements stored in a register. The 166// register array_function holds the built-in Array function and the register 167// array_size holds the size of the array as a smi. The allocated array is put 168// into the result register and beginning and end of the FixedArray elements 169// storage is put into registers elements_array_storage and elements_array_end 170// (see below for when that is not the case). If the parameter fill_with_holes 171// is true the allocated elements backing store is filled with the hole values 172// otherwise it is left uninitialized. When the backing store is filled the 173// register elements_array_storage is scratched. 174static void AllocateJSArray(MacroAssembler* masm, 175 Register array_function, // Array function. 176 Register array_size, // As a smi. 177 Register result, 178 Register elements_array_storage, 179 Register elements_array_end, 180 Register scratch1, 181 Register scratch2, 182 bool fill_with_hole, 183 Label* gc_required) { 184 Label not_empty, allocated; 185 186 // Load the initial map from the array function. 187 __ ldr(elements_array_storage, 188 FieldMemOperand(array_function, 189 JSFunction::kPrototypeOrInitialMapOffset)); 190 191 // Check whether an empty sized array is requested. 192 __ tst(array_size, array_size); 193 __ b(ne, ¬_empty); 194 195 // If an empty array is requested allocate a small elements array anyway. This 196 // keeps the code below free of special casing for the empty array. 197 int size = JSArray::kSize + 198 FixedArray::SizeFor(JSArray::kPreallocatedArrayElements); 199 __ AllocateInNewSpace(size, 200 result, 201 elements_array_end, 202 scratch1, 203 gc_required, 204 TAG_OBJECT); 205 __ jmp(&allocated); 206 207 // Allocate the JSArray object together with space for a FixedArray with the 208 // requested number of elements. 209 __ bind(¬_empty); 210 ASSERT(kSmiTagSize == 1 && kSmiTag == 0); 211 __ mov(elements_array_end, 212 Operand((JSArray::kSize + FixedArray::kHeaderSize) / kPointerSize)); 213 __ add(elements_array_end, 214 elements_array_end, 215 Operand(array_size, ASR, kSmiTagSize)); 216 __ AllocateInNewSpace( 217 elements_array_end, 218 result, 219 scratch1, 220 scratch2, 221 gc_required, 222 static_cast<AllocationFlags>(TAG_OBJECT | SIZE_IN_WORDS)); 223 224 // Allocated the JSArray. Now initialize the fields except for the elements 225 // array. 226 // result: JSObject 227 // elements_array_storage: initial map 228 // array_size: size of array (smi) 229 __ bind(&allocated); 230 __ str(elements_array_storage, FieldMemOperand(result, JSObject::kMapOffset)); 231 __ LoadRoot(elements_array_storage, Heap::kEmptyFixedArrayRootIndex); 232 __ str(elements_array_storage, 233 FieldMemOperand(result, JSArray::kPropertiesOffset)); 234 // Field JSArray::kElementsOffset is initialized later. 235 __ str(array_size, FieldMemOperand(result, JSArray::kLengthOffset)); 236 237 // Calculate the location of the elements array and set elements array member 238 // of the JSArray. 239 // result: JSObject 240 // array_size: size of array (smi) 241 __ add(elements_array_storage, result, Operand(JSArray::kSize)); 242 __ str(elements_array_storage, 243 FieldMemOperand(result, JSArray::kElementsOffset)); 244 245 // Clear the heap tag on the elements array. 246 ASSERT(kSmiTag == 0); 247 __ sub(elements_array_storage, 248 elements_array_storage, 249 Operand(kHeapObjectTag)); 250 // Initialize the fixed array and fill it with holes. FixedArray length is 251 // stored as a smi. 252 // result: JSObject 253 // elements_array_storage: elements array (untagged) 254 // array_size: size of array (smi) 255 __ LoadRoot(scratch1, Heap::kFixedArrayMapRootIndex); 256 ASSERT_EQ(0 * kPointerSize, FixedArray::kMapOffset); 257 __ str(scratch1, MemOperand(elements_array_storage, kPointerSize, PostIndex)); 258 ASSERT(kSmiTag == 0); 259 __ tst(array_size, array_size); 260 // Length of the FixedArray is the number of pre-allocated elements if 261 // the actual JSArray has length 0 and the size of the JSArray for non-empty 262 // JSArrays. The length of a FixedArray is stored as a smi. 263 __ mov(array_size, 264 Operand(Smi::FromInt(JSArray::kPreallocatedArrayElements)), 265 LeaveCC, 266 eq); 267 ASSERT_EQ(1 * kPointerSize, FixedArray::kLengthOffset); 268 __ str(array_size, 269 MemOperand(elements_array_storage, kPointerSize, PostIndex)); 270 271 // Calculate elements array and elements array end. 272 // result: JSObject 273 // elements_array_storage: elements array element storage 274 // array_size: smi-tagged size of elements array 275 ASSERT(kSmiTag == 0 && kSmiTagSize < kPointerSizeLog2); 276 __ add(elements_array_end, 277 elements_array_storage, 278 Operand(array_size, LSL, kPointerSizeLog2 - kSmiTagSize)); 279 280 // Fill the allocated FixedArray with the hole value if requested. 281 // result: JSObject 282 // elements_array_storage: elements array element storage 283 // elements_array_end: start of next object 284 if (fill_with_hole) { 285 Label loop, entry; 286 __ LoadRoot(scratch1, Heap::kTheHoleValueRootIndex); 287 __ jmp(&entry); 288 __ bind(&loop); 289 __ str(scratch1, 290 MemOperand(elements_array_storage, kPointerSize, PostIndex)); 291 __ bind(&entry); 292 __ cmp(elements_array_storage, elements_array_end); 293 __ b(lt, &loop); 294 } 295} 296 297// Create a new array for the built-in Array function. This function allocates 298// the JSArray object and the FixedArray elements array and initializes these. 299// If the Array cannot be constructed in native code the runtime is called. This 300// function assumes the following state: 301// r0: argc 302// r1: constructor (built-in Array function) 303// lr: return address 304// sp[0]: last argument 305// This function is used for both construct and normal calls of Array. The only 306// difference between handling a construct call and a normal call is that for a 307// construct call the constructor function in r1 needs to be preserved for 308// entering the generic code. In both cases argc in r0 needs to be preserved. 309// Both registers are preserved by this code so no need to differentiate between 310// construct call and normal call. 311static void ArrayNativeCode(MacroAssembler* masm, 312 Label* call_generic_code) { 313 Counters* counters = masm->isolate()->counters(); 314 Label argc_one_or_more, argc_two_or_more; 315 316 // Check for array construction with zero arguments or one. 317 __ cmp(r0, Operand(0, RelocInfo::NONE)); 318 __ b(ne, &argc_one_or_more); 319 320 // Handle construction of an empty array. 321 AllocateEmptyJSArray(masm, 322 r1, 323 r2, 324 r3, 325 r4, 326 r5, 327 JSArray::kPreallocatedArrayElements, 328 call_generic_code); 329 __ IncrementCounter(counters->array_function_native(), 1, r3, r4); 330 // Setup return value, remove receiver from stack and return. 331 __ mov(r0, r2); 332 __ add(sp, sp, Operand(kPointerSize)); 333 __ Jump(lr); 334 335 // Check for one argument. Bail out if argument is not smi or if it is 336 // negative. 337 __ bind(&argc_one_or_more); 338 __ cmp(r0, Operand(1)); 339 __ b(ne, &argc_two_or_more); 340 ASSERT(kSmiTag == 0); 341 __ ldr(r2, MemOperand(sp)); // Get the argument from the stack. 342 __ and_(r3, r2, Operand(kIntptrSignBit | kSmiTagMask), SetCC); 343 __ b(ne, call_generic_code); 344 345 // Handle construction of an empty array of a certain size. Bail out if size 346 // is too large to actually allocate an elements array. 347 ASSERT(kSmiTag == 0); 348 __ cmp(r2, Operand(JSObject::kInitialMaxFastElementArray << kSmiTagSize)); 349 __ b(ge, call_generic_code); 350 351 // r0: argc 352 // r1: constructor 353 // r2: array_size (smi) 354 // sp[0]: argument 355 AllocateJSArray(masm, 356 r1, 357 r2, 358 r3, 359 r4, 360 r5, 361 r6, 362 r7, 363 true, 364 call_generic_code); 365 __ IncrementCounter(counters->array_function_native(), 1, r2, r4); 366 // Setup return value, remove receiver and argument from stack and return. 367 __ mov(r0, r3); 368 __ add(sp, sp, Operand(2 * kPointerSize)); 369 __ Jump(lr); 370 371 // Handle construction of an array from a list of arguments. 372 __ bind(&argc_two_or_more); 373 __ mov(r2, Operand(r0, LSL, kSmiTagSize)); // Convet argc to a smi. 374 375 // r0: argc 376 // r1: constructor 377 // r2: array_size (smi) 378 // sp[0]: last argument 379 AllocateJSArray(masm, 380 r1, 381 r2, 382 r3, 383 r4, 384 r5, 385 r6, 386 r7, 387 false, 388 call_generic_code); 389 __ IncrementCounter(counters->array_function_native(), 1, r2, r6); 390 391 // Fill arguments as array elements. Copy from the top of the stack (last 392 // element) to the array backing store filling it backwards. Note: 393 // elements_array_end points after the backing store therefore PreIndex is 394 // used when filling the backing store. 395 // r0: argc 396 // r3: JSArray 397 // r4: elements_array storage start (untagged) 398 // r5: elements_array_end (untagged) 399 // sp[0]: last argument 400 Label loop, entry; 401 __ jmp(&entry); 402 __ bind(&loop); 403 __ ldr(r2, MemOperand(sp, kPointerSize, PostIndex)); 404 __ str(r2, MemOperand(r5, -kPointerSize, PreIndex)); 405 __ bind(&entry); 406 __ cmp(r4, r5); 407 __ b(lt, &loop); 408 409 // Remove caller arguments and receiver from the stack, setup return value and 410 // return. 411 // r0: argc 412 // r3: JSArray 413 // sp[0]: receiver 414 __ add(sp, sp, Operand(kPointerSize)); 415 __ mov(r0, r3); 416 __ Jump(lr); 417} 418 419 420void Builtins::Generate_ArrayCode(MacroAssembler* masm) { 421 // ----------- S t a t e ------------- 422 // -- r0 : number of arguments 423 // -- lr : return address 424 // -- sp[...]: constructor arguments 425 // ----------------------------------- 426 Label generic_array_code, one_or_more_arguments, two_or_more_arguments; 427 428 // Get the Array function. 429 GenerateLoadArrayFunction(masm, r1); 430 431 if (FLAG_debug_code) { 432 // Initial map for the builtin Array functions should be maps. 433 __ ldr(r2, FieldMemOperand(r1, JSFunction::kPrototypeOrInitialMapOffset)); 434 __ tst(r2, Operand(kSmiTagMask)); 435 __ Assert(ne, "Unexpected initial map for Array function"); 436 __ CompareObjectType(r2, r3, r4, MAP_TYPE); 437 __ Assert(eq, "Unexpected initial map for Array function"); 438 } 439 440 // Run the native code for the Array function called as a normal function. 441 ArrayNativeCode(masm, &generic_array_code); 442 443 // Jump to the generic array code if the specialized code cannot handle 444 // the construction. 445 __ bind(&generic_array_code); 446 447 Handle<Code> array_code = 448 masm->isolate()->builtins()->ArrayCodeGeneric(); 449 __ Jump(array_code, RelocInfo::CODE_TARGET); 450} 451 452 453void Builtins::Generate_ArrayConstructCode(MacroAssembler* masm) { 454 // ----------- S t a t e ------------- 455 // -- r0 : number of arguments 456 // -- r1 : constructor function 457 // -- lr : return address 458 // -- sp[...]: constructor arguments 459 // ----------------------------------- 460 Label generic_constructor; 461 462 if (FLAG_debug_code) { 463 // The array construct code is only set for the builtin and internal 464 // Array functions which always have a map. 465 // Initial map for the builtin Array function should be a map. 466 __ ldr(r2, FieldMemOperand(r1, JSFunction::kPrototypeOrInitialMapOffset)); 467 __ tst(r2, Operand(kSmiTagMask)); 468 __ Assert(ne, "Unexpected initial map for Array function"); 469 __ CompareObjectType(r2, r3, r4, MAP_TYPE); 470 __ Assert(eq, "Unexpected initial map for Array function"); 471 } 472 473 // Run the native code for the Array function called as a constructor. 474 ArrayNativeCode(masm, &generic_constructor); 475 476 // Jump to the generic construct code in case the specialized code cannot 477 // handle the construction. 478 __ bind(&generic_constructor); 479 Handle<Code> generic_construct_stub = 480 masm->isolate()->builtins()->JSConstructStubGeneric(); 481 __ Jump(generic_construct_stub, RelocInfo::CODE_TARGET); 482} 483 484 485void Builtins::Generate_StringConstructCode(MacroAssembler* masm) { 486 // ----------- S t a t e ------------- 487 // -- r0 : number of arguments 488 // -- r1 : constructor function 489 // -- lr : return address 490 // -- sp[(argc - n - 1) * 4] : arg[n] (zero based) 491 // -- sp[argc * 4] : receiver 492 // ----------------------------------- 493 Counters* counters = masm->isolate()->counters(); 494 __ IncrementCounter(counters->string_ctor_calls(), 1, r2, r3); 495 496 Register function = r1; 497 if (FLAG_debug_code) { 498 __ LoadGlobalFunction(Context::STRING_FUNCTION_INDEX, r2); 499 __ cmp(function, Operand(r2)); 500 __ Assert(eq, "Unexpected String function"); 501 } 502 503 // Load the first arguments in r0 and get rid of the rest. 504 Label no_arguments; 505 __ cmp(r0, Operand(0, RelocInfo::NONE)); 506 __ b(eq, &no_arguments); 507 // First args = sp[(argc - 1) * 4]. 508 __ sub(r0, r0, Operand(1)); 509 __ ldr(r0, MemOperand(sp, r0, LSL, kPointerSizeLog2, PreIndex)); 510 // sp now point to args[0], drop args[0] + receiver. 511 __ Drop(2); 512 513 Register argument = r2; 514 Label not_cached, argument_is_string; 515 NumberToStringStub::GenerateLookupNumberStringCache( 516 masm, 517 r0, // Input. 518 argument, // Result. 519 r3, // Scratch. 520 r4, // Scratch. 521 r5, // Scratch. 522 false, // Is it a Smi? 523 ¬_cached); 524 __ IncrementCounter(counters->string_ctor_cached_number(), 1, r3, r4); 525 __ bind(&argument_is_string); 526 527 // ----------- S t a t e ------------- 528 // -- r2 : argument converted to string 529 // -- r1 : constructor function 530 // -- lr : return address 531 // ----------------------------------- 532 533 Label gc_required; 534 __ AllocateInNewSpace(JSValue::kSize, 535 r0, // Result. 536 r3, // Scratch. 537 r4, // Scratch. 538 &gc_required, 539 TAG_OBJECT); 540 541 // Initialising the String Object. 542 Register map = r3; 543 __ LoadGlobalFunctionInitialMap(function, map, r4); 544 if (FLAG_debug_code) { 545 __ ldrb(r4, FieldMemOperand(map, Map::kInstanceSizeOffset)); 546 __ cmp(r4, Operand(JSValue::kSize >> kPointerSizeLog2)); 547 __ Assert(eq, "Unexpected string wrapper instance size"); 548 __ ldrb(r4, FieldMemOperand(map, Map::kUnusedPropertyFieldsOffset)); 549 __ cmp(r4, Operand(0, RelocInfo::NONE)); 550 __ Assert(eq, "Unexpected unused properties of string wrapper"); 551 } 552 __ str(map, FieldMemOperand(r0, HeapObject::kMapOffset)); 553 554 __ LoadRoot(r3, Heap::kEmptyFixedArrayRootIndex); 555 __ str(r3, FieldMemOperand(r0, JSObject::kPropertiesOffset)); 556 __ str(r3, FieldMemOperand(r0, JSObject::kElementsOffset)); 557 558 __ str(argument, FieldMemOperand(r0, JSValue::kValueOffset)); 559 560 // Ensure the object is fully initialized. 561 STATIC_ASSERT(JSValue::kSize == 4 * kPointerSize); 562 563 __ Ret(); 564 565 // The argument was not found in the number to string cache. Check 566 // if it's a string already before calling the conversion builtin. 567 Label convert_argument; 568 __ bind(¬_cached); 569 __ JumpIfSmi(r0, &convert_argument); 570 571 // Is it a String? 572 __ ldr(r2, FieldMemOperand(r0, HeapObject::kMapOffset)); 573 __ ldrb(r3, FieldMemOperand(r2, Map::kInstanceTypeOffset)); 574 ASSERT(kNotStringTag != 0); 575 __ tst(r3, Operand(kIsNotStringMask)); 576 __ b(ne, &convert_argument); 577 __ mov(argument, r0); 578 __ IncrementCounter(counters->string_ctor_conversions(), 1, r3, r4); 579 __ b(&argument_is_string); 580 581 // Invoke the conversion builtin and put the result into r2. 582 __ bind(&convert_argument); 583 __ push(function); // Preserve the function. 584 __ IncrementCounter(counters->string_ctor_conversions(), 1, r3, r4); 585 __ EnterInternalFrame(); 586 __ push(r0); 587 __ InvokeBuiltin(Builtins::TO_STRING, CALL_FUNCTION); 588 __ LeaveInternalFrame(); 589 __ pop(function); 590 __ mov(argument, r0); 591 __ b(&argument_is_string); 592 593 // Load the empty string into r2, remove the receiver from the 594 // stack, and jump back to the case where the argument is a string. 595 __ bind(&no_arguments); 596 __ LoadRoot(argument, Heap::kEmptyStringRootIndex); 597 __ Drop(1); 598 __ b(&argument_is_string); 599 600 // At this point the argument is already a string. Call runtime to 601 // create a string wrapper. 602 __ bind(&gc_required); 603 __ IncrementCounter(counters->string_ctor_gc_required(), 1, r3, r4); 604 __ EnterInternalFrame(); 605 __ push(argument); 606 __ CallRuntime(Runtime::kNewStringWrapper, 1); 607 __ LeaveInternalFrame(); 608 __ Ret(); 609} 610 611 612void Builtins::Generate_JSConstructCall(MacroAssembler* masm) { 613 // ----------- S t a t e ------------- 614 // -- r0 : number of arguments 615 // -- r1 : constructor function 616 // -- lr : return address 617 // -- sp[...]: constructor arguments 618 // ----------------------------------- 619 620 Label non_function_call; 621 // Check that the function is not a smi. 622 __ tst(r1, Operand(kSmiTagMask)); 623 __ b(eq, &non_function_call); 624 // Check that the function is a JSFunction. 625 __ CompareObjectType(r1, r2, r2, JS_FUNCTION_TYPE); 626 __ b(ne, &non_function_call); 627 628 // Jump to the function-specific construct stub. 629 __ ldr(r2, FieldMemOperand(r1, JSFunction::kSharedFunctionInfoOffset)); 630 __ ldr(r2, FieldMemOperand(r2, SharedFunctionInfo::kConstructStubOffset)); 631 __ add(pc, r2, Operand(Code::kHeaderSize - kHeapObjectTag)); 632 633 // r0: number of arguments 634 // r1: called object 635 __ bind(&non_function_call); 636 // Set expected number of arguments to zero (not changing r0). 637 __ mov(r2, Operand(0, RelocInfo::NONE)); 638 __ GetBuiltinEntry(r3, Builtins::CALL_NON_FUNCTION_AS_CONSTRUCTOR); 639 __ SetCallKind(r5, CALL_AS_METHOD); 640 __ Jump(masm->isolate()->builtins()->ArgumentsAdaptorTrampoline(), 641 RelocInfo::CODE_TARGET); 642} 643 644 645static void Generate_JSConstructStubHelper(MacroAssembler* masm, 646 bool is_api_function, 647 bool count_constructions) { 648 // Should never count constructions for api objects. 649 ASSERT(!is_api_function || !count_constructions); 650 651 Isolate* isolate = masm->isolate(); 652 653 // Enter a construct frame. 654 __ EnterConstructFrame(); 655 656 // Preserve the two incoming parameters on the stack. 657 __ mov(r0, Operand(r0, LSL, kSmiTagSize)); 658 __ push(r0); // Smi-tagged arguments count. 659 __ push(r1); // Constructor function. 660 661 // Try to allocate the object without transitioning into C code. If any of the 662 // preconditions is not met, the code bails out to the runtime call. 663 Label rt_call, allocated; 664 if (FLAG_inline_new) { 665 Label undo_allocation; 666#ifdef ENABLE_DEBUGGER_SUPPORT 667 ExternalReference debug_step_in_fp = 668 ExternalReference::debug_step_in_fp_address(isolate); 669 __ mov(r2, Operand(debug_step_in_fp)); 670 __ ldr(r2, MemOperand(r2)); 671 __ tst(r2, r2); 672 __ b(ne, &rt_call); 673#endif 674 675 // Load the initial map and verify that it is in fact a map. 676 // r1: constructor function 677 __ ldr(r2, FieldMemOperand(r1, JSFunction::kPrototypeOrInitialMapOffset)); 678 __ tst(r2, Operand(kSmiTagMask)); 679 __ b(eq, &rt_call); 680 __ CompareObjectType(r2, r3, r4, MAP_TYPE); 681 __ b(ne, &rt_call); 682 683 // Check that the constructor is not constructing a JSFunction (see comments 684 // in Runtime_NewObject in runtime.cc). In which case the initial map's 685 // instance type would be JS_FUNCTION_TYPE. 686 // r1: constructor function 687 // r2: initial map 688 __ CompareInstanceType(r2, r3, JS_FUNCTION_TYPE); 689 __ b(eq, &rt_call); 690 691 if (count_constructions) { 692 Label allocate; 693 // Decrease generous allocation count. 694 __ ldr(r3, FieldMemOperand(r1, JSFunction::kSharedFunctionInfoOffset)); 695 MemOperand constructor_count = 696 FieldMemOperand(r3, SharedFunctionInfo::kConstructionCountOffset); 697 __ ldrb(r4, constructor_count); 698 __ sub(r4, r4, Operand(1), SetCC); 699 __ strb(r4, constructor_count); 700 __ b(ne, &allocate); 701 702 __ Push(r1, r2); 703 704 __ push(r1); // constructor 705 // The call will replace the stub, so the countdown is only done once. 706 __ CallRuntime(Runtime::kFinalizeInstanceSize, 1); 707 708 __ pop(r2); 709 __ pop(r1); 710 711 __ bind(&allocate); 712 } 713 714 // Now allocate the JSObject on the heap. 715 // r1: constructor function 716 // r2: initial map 717 __ ldrb(r3, FieldMemOperand(r2, Map::kInstanceSizeOffset)); 718 __ AllocateInNewSpace(r3, r4, r5, r6, &rt_call, SIZE_IN_WORDS); 719 720 // Allocated the JSObject, now initialize the fields. Map is set to initial 721 // map and properties and elements are set to empty fixed array. 722 // r1: constructor function 723 // r2: initial map 724 // r3: object size 725 // r4: JSObject (not tagged) 726 __ LoadRoot(r6, Heap::kEmptyFixedArrayRootIndex); 727 __ mov(r5, r4); 728 ASSERT_EQ(0 * kPointerSize, JSObject::kMapOffset); 729 __ str(r2, MemOperand(r5, kPointerSize, PostIndex)); 730 ASSERT_EQ(1 * kPointerSize, JSObject::kPropertiesOffset); 731 __ str(r6, MemOperand(r5, kPointerSize, PostIndex)); 732 ASSERT_EQ(2 * kPointerSize, JSObject::kElementsOffset); 733 __ str(r6, MemOperand(r5, kPointerSize, PostIndex)); 734 735 // Fill all the in-object properties with the appropriate filler. 736 // r1: constructor function 737 // r2: initial map 738 // r3: object size (in words) 739 // r4: JSObject (not tagged) 740 // r5: First in-object property of JSObject (not tagged) 741 __ add(r6, r4, Operand(r3, LSL, kPointerSizeLog2)); // End of object. 742 ASSERT_EQ(3 * kPointerSize, JSObject::kHeaderSize); 743 { Label loop, entry; 744 if (count_constructions) { 745 // To allow for truncation. 746 __ LoadRoot(r7, Heap::kOnePointerFillerMapRootIndex); 747 } else { 748 __ LoadRoot(r7, Heap::kUndefinedValueRootIndex); 749 } 750 __ b(&entry); 751 __ bind(&loop); 752 __ str(r7, MemOperand(r5, kPointerSize, PostIndex)); 753 __ bind(&entry); 754 __ cmp(r5, r6); 755 __ b(lt, &loop); 756 } 757 758 // Add the object tag to make the JSObject real, so that we can continue and 759 // jump into the continuation code at any time from now on. Any failures 760 // need to undo the allocation, so that the heap is in a consistent state 761 // and verifiable. 762 __ add(r4, r4, Operand(kHeapObjectTag)); 763 764 // Check if a non-empty properties array is needed. Continue with allocated 765 // object if not fall through to runtime call if it is. 766 // r1: constructor function 767 // r4: JSObject 768 // r5: start of next object (not tagged) 769 __ ldrb(r3, FieldMemOperand(r2, Map::kUnusedPropertyFieldsOffset)); 770 // The field instance sizes contains both pre-allocated property fields and 771 // in-object properties. 772 __ ldr(r0, FieldMemOperand(r2, Map::kInstanceSizesOffset)); 773 __ Ubfx(r6, r0, Map::kPreAllocatedPropertyFieldsByte * 8, 8); 774 __ add(r3, r3, Operand(r6)); 775 __ Ubfx(r6, r0, Map::kInObjectPropertiesByte * 8, 8); 776 __ sub(r3, r3, Operand(r6), SetCC); 777 778 // Done if no extra properties are to be allocated. 779 __ b(eq, &allocated); 780 __ Assert(pl, "Property allocation count failed."); 781 782 // Scale the number of elements by pointer size and add the header for 783 // FixedArrays to the start of the next object calculation from above. 784 // r1: constructor 785 // r3: number of elements in properties array 786 // r4: JSObject 787 // r5: start of next object 788 __ add(r0, r3, Operand(FixedArray::kHeaderSize / kPointerSize)); 789 __ AllocateInNewSpace( 790 r0, 791 r5, 792 r6, 793 r2, 794 &undo_allocation, 795 static_cast<AllocationFlags>(RESULT_CONTAINS_TOP | SIZE_IN_WORDS)); 796 797 // Initialize the FixedArray. 798 // r1: constructor 799 // r3: number of elements in properties array 800 // r4: JSObject 801 // r5: FixedArray (not tagged) 802 __ LoadRoot(r6, Heap::kFixedArrayMapRootIndex); 803 __ mov(r2, r5); 804 ASSERT_EQ(0 * kPointerSize, JSObject::kMapOffset); 805 __ str(r6, MemOperand(r2, kPointerSize, PostIndex)); 806 ASSERT_EQ(1 * kPointerSize, FixedArray::kLengthOffset); 807 __ mov(r0, Operand(r3, LSL, kSmiTagSize)); 808 __ str(r0, MemOperand(r2, kPointerSize, PostIndex)); 809 810 // Initialize the fields to undefined. 811 // r1: constructor function 812 // r2: First element of FixedArray (not tagged) 813 // r3: number of elements in properties array 814 // r4: JSObject 815 // r5: FixedArray (not tagged) 816 __ add(r6, r2, Operand(r3, LSL, kPointerSizeLog2)); // End of object. 817 ASSERT_EQ(2 * kPointerSize, FixedArray::kHeaderSize); 818 { Label loop, entry; 819 if (count_constructions) { 820 __ LoadRoot(r7, Heap::kUndefinedValueRootIndex); 821 } else if (FLAG_debug_code) { 822 __ LoadRoot(r8, Heap::kUndefinedValueRootIndex); 823 __ cmp(r7, r8); 824 __ Assert(eq, "Undefined value not loaded."); 825 } 826 __ b(&entry); 827 __ bind(&loop); 828 __ str(r7, MemOperand(r2, kPointerSize, PostIndex)); 829 __ bind(&entry); 830 __ cmp(r2, r6); 831 __ b(lt, &loop); 832 } 833 834 // Store the initialized FixedArray into the properties field of 835 // the JSObject 836 // r1: constructor function 837 // r4: JSObject 838 // r5: FixedArray (not tagged) 839 __ add(r5, r5, Operand(kHeapObjectTag)); // Add the heap tag. 840 __ str(r5, FieldMemOperand(r4, JSObject::kPropertiesOffset)); 841 842 // Continue with JSObject being successfully allocated 843 // r1: constructor function 844 // r4: JSObject 845 __ jmp(&allocated); 846 847 // Undo the setting of the new top so that the heap is verifiable. For 848 // example, the map's unused properties potentially do not match the 849 // allocated objects unused properties. 850 // r4: JSObject (previous new top) 851 __ bind(&undo_allocation); 852 __ UndoAllocationInNewSpace(r4, r5); 853 } 854 855 // Allocate the new receiver object using the runtime call. 856 // r1: constructor function 857 __ bind(&rt_call); 858 __ push(r1); // argument for Runtime_NewObject 859 __ CallRuntime(Runtime::kNewObject, 1); 860 __ mov(r4, r0); 861 862 // Receiver for constructor call allocated. 863 // r4: JSObject 864 __ bind(&allocated); 865 __ push(r4); 866 867 // Push the function and the allocated receiver from the stack. 868 // sp[0]: receiver (newly allocated object) 869 // sp[1]: constructor function 870 // sp[2]: number of arguments (smi-tagged) 871 __ ldr(r1, MemOperand(sp, kPointerSize)); 872 __ push(r1); // Constructor function. 873 __ push(r4); // Receiver. 874 875 // Reload the number of arguments from the stack. 876 // r1: constructor function 877 // sp[0]: receiver 878 // sp[1]: constructor function 879 // sp[2]: receiver 880 // sp[3]: constructor function 881 // sp[4]: number of arguments (smi-tagged) 882 __ ldr(r3, MemOperand(sp, 4 * kPointerSize)); 883 884 // Setup pointer to last argument. 885 __ add(r2, fp, Operand(StandardFrameConstants::kCallerSPOffset)); 886 887 // Setup number of arguments for function call below 888 __ mov(r0, Operand(r3, LSR, kSmiTagSize)); 889 890 // Copy arguments and receiver to the expression stack. 891 // r0: number of arguments 892 // r2: address of last argument (caller sp) 893 // r1: constructor function 894 // r3: number of arguments (smi-tagged) 895 // sp[0]: receiver 896 // sp[1]: constructor function 897 // sp[2]: receiver 898 // sp[3]: constructor function 899 // sp[4]: number of arguments (smi-tagged) 900 Label loop, entry; 901 __ b(&entry); 902 __ bind(&loop); 903 __ ldr(ip, MemOperand(r2, r3, LSL, kPointerSizeLog2 - 1)); 904 __ push(ip); 905 __ bind(&entry); 906 __ sub(r3, r3, Operand(2), SetCC); 907 __ b(ge, &loop); 908 909 // Call the function. 910 // r0: number of arguments 911 // r1: constructor function 912 if (is_api_function) { 913 __ ldr(cp, FieldMemOperand(r1, JSFunction::kContextOffset)); 914 Handle<Code> code = 915 masm->isolate()->builtins()->HandleApiCallConstruct(); 916 ParameterCount expected(0); 917 __ InvokeCode(code, expected, expected, 918 RelocInfo::CODE_TARGET, CALL_FUNCTION, CALL_AS_METHOD); 919 } else { 920 ParameterCount actual(r0); 921 __ InvokeFunction(r1, actual, CALL_FUNCTION, 922 NullCallWrapper(), CALL_AS_METHOD); 923 } 924 925 // Pop the function from the stack. 926 // sp[0]: constructor function 927 // sp[2]: receiver 928 // sp[3]: constructor function 929 // sp[4]: number of arguments (smi-tagged) 930 __ pop(); 931 932 // Restore context from the frame. 933 // r0: result 934 // sp[0]: receiver 935 // sp[1]: constructor function 936 // sp[2]: number of arguments (smi-tagged) 937 __ ldr(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); 938 939 // If the result is an object (in the ECMA sense), we should get rid 940 // of the receiver and use the result; see ECMA-262 section 13.2.2-7 941 // on page 74. 942 Label use_receiver, exit; 943 944 // If the result is a smi, it is *not* an object in the ECMA sense. 945 // r0: result 946 // sp[0]: receiver (newly allocated object) 947 // sp[1]: constructor function 948 // sp[2]: number of arguments (smi-tagged) 949 __ tst(r0, Operand(kSmiTagMask)); 950 __ b(eq, &use_receiver); 951 952 // If the type of the result (stored in its map) is less than 953 // FIRST_JS_OBJECT_TYPE, it is not an object in the ECMA sense. 954 __ CompareObjectType(r0, r3, r3, FIRST_JS_OBJECT_TYPE); 955 __ b(ge, &exit); 956 957 // Throw away the result of the constructor invocation and use the 958 // on-stack receiver as the result. 959 __ bind(&use_receiver); 960 __ ldr(r0, MemOperand(sp)); 961 962 // Remove receiver from the stack, remove caller arguments, and 963 // return. 964 __ bind(&exit); 965 // r0: result 966 // sp[0]: receiver (newly allocated object) 967 // sp[1]: constructor function 968 // sp[2]: number of arguments (smi-tagged) 969 __ ldr(r1, MemOperand(sp, 2 * kPointerSize)); 970 __ LeaveConstructFrame(); 971 __ add(sp, sp, Operand(r1, LSL, kPointerSizeLog2 - 1)); 972 __ add(sp, sp, Operand(kPointerSize)); 973 __ IncrementCounter(isolate->counters()->constructed_objects(), 1, r1, r2); 974 __ Jump(lr); 975} 976 977 978void Builtins::Generate_JSConstructStubCountdown(MacroAssembler* masm) { 979 Generate_JSConstructStubHelper(masm, false, true); 980} 981 982 983void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) { 984 Generate_JSConstructStubHelper(masm, false, false); 985} 986 987 988void Builtins::Generate_JSConstructStubApi(MacroAssembler* masm) { 989 Generate_JSConstructStubHelper(masm, true, false); 990} 991 992 993static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm, 994 bool is_construct) { 995 // Called from Generate_JS_Entry 996 // r0: code entry 997 // r1: function 998 // r2: receiver 999 // r3: argc 1000 // r4: argv 1001 // r5-r7, cp may be clobbered 1002 1003 // Clear the context before we push it when entering the JS frame. 1004 __ mov(cp, Operand(0, RelocInfo::NONE)); 1005 1006 // Enter an internal frame. 1007 __ EnterInternalFrame(); 1008 1009 // Set up the context from the function argument. 1010 __ ldr(cp, FieldMemOperand(r1, JSFunction::kContextOffset)); 1011 1012 // Set up the roots register. 1013 ExternalReference roots_address = 1014 ExternalReference::roots_address(masm->isolate()); 1015 __ mov(r10, Operand(roots_address)); 1016 1017 // Push the function and the receiver onto the stack. 1018 __ push(r1); 1019 __ push(r2); 1020 1021 // Copy arguments to the stack in a loop. 1022 // r1: function 1023 // r3: argc 1024 // r4: argv, i.e. points to first arg 1025 Label loop, entry; 1026 __ add(r2, r4, Operand(r3, LSL, kPointerSizeLog2)); 1027 // r2 points past last arg. 1028 __ b(&entry); 1029 __ bind(&loop); 1030 __ ldr(r0, MemOperand(r4, kPointerSize, PostIndex)); // read next parameter 1031 __ ldr(r0, MemOperand(r0)); // dereference handle 1032 __ push(r0); // push parameter 1033 __ bind(&entry); 1034 __ cmp(r4, r2); 1035 __ b(ne, &loop); 1036 1037 // Initialize all JavaScript callee-saved registers, since they will be seen 1038 // by the garbage collector as part of handlers. 1039 __ LoadRoot(r4, Heap::kUndefinedValueRootIndex); 1040 __ mov(r5, Operand(r4)); 1041 __ mov(r6, Operand(r4)); 1042 __ mov(r7, Operand(r4)); 1043 if (kR9Available == 1) { 1044 __ mov(r9, Operand(r4)); 1045 } 1046 1047 // Invoke the code and pass argc as r0. 1048 __ mov(r0, Operand(r3)); 1049 if (is_construct) { 1050 __ Call(masm->isolate()->builtins()->JSConstructCall(), 1051 RelocInfo::CODE_TARGET); 1052 } else { 1053 ParameterCount actual(r0); 1054 __ InvokeFunction(r1, actual, CALL_FUNCTION, 1055 NullCallWrapper(), CALL_AS_METHOD); 1056 } 1057 1058 // Exit the JS frame and remove the parameters (except function), and return. 1059 // Respect ABI stack constraint. 1060 __ LeaveInternalFrame(); 1061 __ Jump(lr); 1062 1063 // r0: result 1064} 1065 1066 1067void Builtins::Generate_JSEntryTrampoline(MacroAssembler* masm) { 1068 Generate_JSEntryTrampolineHelper(masm, false); 1069} 1070 1071 1072void Builtins::Generate_JSConstructEntryTrampoline(MacroAssembler* masm) { 1073 Generate_JSEntryTrampolineHelper(masm, true); 1074} 1075 1076 1077void Builtins::Generate_LazyCompile(MacroAssembler* masm) { 1078 // Enter an internal frame. 1079 __ EnterInternalFrame(); 1080 1081 // Preserve the function. 1082 __ push(r1); 1083 // Push call kind information. 1084 __ push(r5); 1085 1086 // Push the function on the stack as the argument to the runtime function. 1087 __ push(r1); 1088 __ CallRuntime(Runtime::kLazyCompile, 1); 1089 // Calculate the entry point. 1090 __ add(r2, r0, Operand(Code::kHeaderSize - kHeapObjectTag)); 1091 1092 // Restore call kind information. 1093 __ pop(r5); 1094 // Restore saved function. 1095 __ pop(r1); 1096 1097 // Tear down temporary frame. 1098 __ LeaveInternalFrame(); 1099 1100 // Do a tail-call of the compiled function. 1101 __ Jump(r2); 1102} 1103 1104 1105void Builtins::Generate_LazyRecompile(MacroAssembler* masm) { 1106 // Enter an internal frame. 1107 __ EnterInternalFrame(); 1108 1109 // Preserve the function. 1110 __ push(r1); 1111 // Push call kind information. 1112 __ push(r5); 1113 1114 // Push the function on the stack as the argument to the runtime function. 1115 __ push(r1); 1116 __ CallRuntime(Runtime::kLazyRecompile, 1); 1117 // Calculate the entry point. 1118 __ add(r2, r0, Operand(Code::kHeaderSize - kHeapObjectTag)); 1119 1120 // Restore call kind information. 1121 __ pop(r5); 1122 // Restore saved function. 1123 __ pop(r1); 1124 1125 // Tear down temporary frame. 1126 __ LeaveInternalFrame(); 1127 1128 // Do a tail-call of the compiled function. 1129 __ Jump(r2); 1130} 1131 1132 1133static void Generate_NotifyDeoptimizedHelper(MacroAssembler* masm, 1134 Deoptimizer::BailoutType type) { 1135 __ EnterInternalFrame(); 1136 // Pass the function and deoptimization type to the runtime system. 1137 __ mov(r0, Operand(Smi::FromInt(static_cast<int>(type)))); 1138 __ push(r0); 1139 __ CallRuntime(Runtime::kNotifyDeoptimized, 1); 1140 __ LeaveInternalFrame(); 1141 1142 // Get the full codegen state from the stack and untag it -> r6. 1143 __ ldr(r6, MemOperand(sp, 0 * kPointerSize)); 1144 __ SmiUntag(r6); 1145 // Switch on the state. 1146 Label with_tos_register, unknown_state; 1147 __ cmp(r6, Operand(FullCodeGenerator::NO_REGISTERS)); 1148 __ b(ne, &with_tos_register); 1149 __ add(sp, sp, Operand(1 * kPointerSize)); // Remove state. 1150 __ Ret(); 1151 1152 __ bind(&with_tos_register); 1153 __ ldr(r0, MemOperand(sp, 1 * kPointerSize)); 1154 __ cmp(r6, Operand(FullCodeGenerator::TOS_REG)); 1155 __ b(ne, &unknown_state); 1156 __ add(sp, sp, Operand(2 * kPointerSize)); // Remove state. 1157 __ Ret(); 1158 1159 __ bind(&unknown_state); 1160 __ stop("no cases left"); 1161} 1162 1163 1164void Builtins::Generate_NotifyDeoptimized(MacroAssembler* masm) { 1165 Generate_NotifyDeoptimizedHelper(masm, Deoptimizer::EAGER); 1166} 1167 1168 1169void Builtins::Generate_NotifyLazyDeoptimized(MacroAssembler* masm) { 1170 Generate_NotifyDeoptimizedHelper(masm, Deoptimizer::LAZY); 1171} 1172 1173 1174void Builtins::Generate_NotifyOSR(MacroAssembler* masm) { 1175 // For now, we are relying on the fact that Runtime::NotifyOSR 1176 // doesn't do any garbage collection which allows us to save/restore 1177 // the registers without worrying about which of them contain 1178 // pointers. This seems a bit fragile. 1179 __ stm(db_w, sp, kJSCallerSaved | kCalleeSaved | lr.bit() | fp.bit()); 1180 __ EnterInternalFrame(); 1181 __ CallRuntime(Runtime::kNotifyOSR, 0); 1182 __ LeaveInternalFrame(); 1183 __ ldm(ia_w, sp, kJSCallerSaved | kCalleeSaved | lr.bit() | fp.bit()); 1184 __ Ret(); 1185} 1186 1187 1188void Builtins::Generate_OnStackReplacement(MacroAssembler* masm) { 1189 CpuFeatures::TryForceFeatureScope scope(VFP3); 1190 if (!CpuFeatures::IsSupported(VFP3)) { 1191 __ Abort("Unreachable code: Cannot optimize without VFP3 support."); 1192 return; 1193 } 1194 1195 // Lookup the function in the JavaScript frame and push it as an 1196 // argument to the on-stack replacement function. 1197 __ ldr(r0, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset)); 1198 __ EnterInternalFrame(); 1199 __ push(r0); 1200 __ CallRuntime(Runtime::kCompileForOnStackReplacement, 1); 1201 __ LeaveInternalFrame(); 1202 1203 // If the result was -1 it means that we couldn't optimize the 1204 // function. Just return and continue in the unoptimized version. 1205 Label skip; 1206 __ cmp(r0, Operand(Smi::FromInt(-1))); 1207 __ b(ne, &skip); 1208 __ Ret(); 1209 1210 __ bind(&skip); 1211 // Untag the AST id and push it on the stack. 1212 __ SmiUntag(r0); 1213 __ push(r0); 1214 1215 // Generate the code for doing the frame-to-frame translation using 1216 // the deoptimizer infrastructure. 1217 Deoptimizer::EntryGenerator generator(masm, Deoptimizer::OSR); 1218 generator.Generate(); 1219} 1220 1221 1222void Builtins::Generate_FunctionCall(MacroAssembler* masm) { 1223 // 1. Make sure we have at least one argument. 1224 // r0: actual number of arguments 1225 { Label done; 1226 __ tst(r0, Operand(r0)); 1227 __ b(ne, &done); 1228 __ LoadRoot(r2, Heap::kUndefinedValueRootIndex); 1229 __ push(r2); 1230 __ add(r0, r0, Operand(1)); 1231 __ bind(&done); 1232 } 1233 1234 // 2. Get the function to call (passed as receiver) from the stack, check 1235 // if it is a function. 1236 // r0: actual number of arguments 1237 Label non_function; 1238 __ ldr(r1, MemOperand(sp, r0, LSL, kPointerSizeLog2)); 1239 __ tst(r1, Operand(kSmiTagMask)); 1240 __ b(eq, &non_function); 1241 __ CompareObjectType(r1, r2, r2, JS_FUNCTION_TYPE); 1242 __ b(ne, &non_function); 1243 1244 // 3a. Patch the first argument if necessary when calling a function. 1245 // r0: actual number of arguments 1246 // r1: function 1247 Label shift_arguments; 1248 { Label convert_to_object, use_global_receiver, patch_receiver; 1249 // Change context eagerly in case we need the global receiver. 1250 __ ldr(cp, FieldMemOperand(r1, JSFunction::kContextOffset)); 1251 1252 // Do not transform the receiver for strict mode functions. 1253 __ ldr(r2, FieldMemOperand(r1, JSFunction::kSharedFunctionInfoOffset)); 1254 __ ldr(r3, FieldMemOperand(r2, SharedFunctionInfo::kCompilerHintsOffset)); 1255 __ tst(r3, Operand(1 << (SharedFunctionInfo::kStrictModeFunction + 1256 kSmiTagSize))); 1257 __ b(ne, &shift_arguments); 1258 1259 // Do not transform the receiver for native (Compilerhints already in r3). 1260 __ tst(r3, Operand(1 << (SharedFunctionInfo::kES5Native + 1261 kSmiTagSize))); 1262 __ b(ne, &shift_arguments); 1263 1264 // Compute the receiver in non-strict mode. 1265 __ add(r2, sp, Operand(r0, LSL, kPointerSizeLog2)); 1266 __ ldr(r2, MemOperand(r2, -kPointerSize)); 1267 // r0: actual number of arguments 1268 // r1: function 1269 // r2: first argument 1270 __ tst(r2, Operand(kSmiTagMask)); 1271 __ b(eq, &convert_to_object); 1272 1273 __ LoadRoot(r3, Heap::kUndefinedValueRootIndex); 1274 __ cmp(r2, r3); 1275 __ b(eq, &use_global_receiver); 1276 __ LoadRoot(r3, Heap::kNullValueRootIndex); 1277 __ cmp(r2, r3); 1278 __ b(eq, &use_global_receiver); 1279 1280 STATIC_ASSERT(LAST_JS_OBJECT_TYPE + 1 == LAST_TYPE); 1281 STATIC_ASSERT(LAST_TYPE == JS_FUNCTION_TYPE); 1282 __ CompareObjectType(r2, r3, r3, FIRST_JS_OBJECT_TYPE); 1283 __ b(ge, &shift_arguments); 1284 1285 __ bind(&convert_to_object); 1286 __ EnterInternalFrame(); // In order to preserve argument count. 1287 __ mov(r0, Operand(r0, LSL, kSmiTagSize)); // Smi-tagged. 1288 __ push(r0); 1289 1290 __ push(r2); 1291 __ InvokeBuiltin(Builtins::TO_OBJECT, CALL_FUNCTION); 1292 __ mov(r2, r0); 1293 1294 __ pop(r0); 1295 __ mov(r0, Operand(r0, ASR, kSmiTagSize)); 1296 __ LeaveInternalFrame(); 1297 // Restore the function to r1. 1298 __ ldr(r1, MemOperand(sp, r0, LSL, kPointerSizeLog2)); 1299 __ jmp(&patch_receiver); 1300 1301 // Use the global receiver object from the called function as the 1302 // receiver. 1303 __ bind(&use_global_receiver); 1304 const int kGlobalIndex = 1305 Context::kHeaderSize + Context::GLOBAL_INDEX * kPointerSize; 1306 __ ldr(r2, FieldMemOperand(cp, kGlobalIndex)); 1307 __ ldr(r2, FieldMemOperand(r2, GlobalObject::kGlobalContextOffset)); 1308 __ ldr(r2, FieldMemOperand(r2, kGlobalIndex)); 1309 __ ldr(r2, FieldMemOperand(r2, GlobalObject::kGlobalReceiverOffset)); 1310 1311 __ bind(&patch_receiver); 1312 __ add(r3, sp, Operand(r0, LSL, kPointerSizeLog2)); 1313 __ str(r2, MemOperand(r3, -kPointerSize)); 1314 1315 __ jmp(&shift_arguments); 1316 } 1317 1318 // 3b. Patch the first argument when calling a non-function. The 1319 // CALL_NON_FUNCTION builtin expects the non-function callee as 1320 // receiver, so overwrite the first argument which will ultimately 1321 // become the receiver. 1322 // r0: actual number of arguments 1323 // r1: function 1324 __ bind(&non_function); 1325 __ add(r2, sp, Operand(r0, LSL, kPointerSizeLog2)); 1326 __ str(r1, MemOperand(r2, -kPointerSize)); 1327 // Clear r1 to indicate a non-function being called. 1328 __ mov(r1, Operand(0, RelocInfo::NONE)); 1329 1330 // 4. Shift arguments and return address one slot down on the stack 1331 // (overwriting the original receiver). Adjust argument count to make 1332 // the original first argument the new receiver. 1333 // r0: actual number of arguments 1334 // r1: function 1335 __ bind(&shift_arguments); 1336 { Label loop; 1337 // Calculate the copy start address (destination). Copy end address is sp. 1338 __ add(r2, sp, Operand(r0, LSL, kPointerSizeLog2)); 1339 1340 __ bind(&loop); 1341 __ ldr(ip, MemOperand(r2, -kPointerSize)); 1342 __ str(ip, MemOperand(r2)); 1343 __ sub(r2, r2, Operand(kPointerSize)); 1344 __ cmp(r2, sp); 1345 __ b(ne, &loop); 1346 // Adjust the actual number of arguments and remove the top element 1347 // (which is a copy of the last argument). 1348 __ sub(r0, r0, Operand(1)); 1349 __ pop(); 1350 } 1351 1352 // 5a. Call non-function via tail call to CALL_NON_FUNCTION builtin. 1353 // r0: actual number of arguments 1354 // r1: function 1355 { Label function; 1356 __ tst(r1, r1); 1357 __ b(ne, &function); 1358 // Expected number of arguments is 0 for CALL_NON_FUNCTION. 1359 __ mov(r2, Operand(0, RelocInfo::NONE)); 1360 __ GetBuiltinEntry(r3, Builtins::CALL_NON_FUNCTION); 1361 __ SetCallKind(r5, CALL_AS_METHOD); 1362 __ Jump(masm->isolate()->builtins()->ArgumentsAdaptorTrampoline(), 1363 RelocInfo::CODE_TARGET); 1364 __ bind(&function); 1365 } 1366 1367 // 5b. Get the code to call from the function and check that the number of 1368 // expected arguments matches what we're providing. If so, jump 1369 // (tail-call) to the code in register edx without checking arguments. 1370 // r0: actual number of arguments 1371 // r1: function 1372 __ ldr(r3, FieldMemOperand(r1, JSFunction::kSharedFunctionInfoOffset)); 1373 __ ldr(r2, 1374 FieldMemOperand(r3, SharedFunctionInfo::kFormalParameterCountOffset)); 1375 __ mov(r2, Operand(r2, ASR, kSmiTagSize)); 1376 __ ldr(r3, FieldMemOperand(r1, JSFunction::kCodeEntryOffset)); 1377 __ SetCallKind(r5, CALL_AS_METHOD); 1378 __ cmp(r2, r0); // Check formal and actual parameter counts. 1379 __ Jump(masm->isolate()->builtins()->ArgumentsAdaptorTrampoline(), 1380 RelocInfo::CODE_TARGET, 1381 ne); 1382 1383 ParameterCount expected(0); 1384 __ InvokeCode(r3, expected, expected, JUMP_FUNCTION, 1385 NullCallWrapper(), CALL_AS_METHOD); 1386} 1387 1388 1389void Builtins::Generate_FunctionApply(MacroAssembler* masm) { 1390 const int kIndexOffset = -5 * kPointerSize; 1391 const int kLimitOffset = -4 * kPointerSize; 1392 const int kArgsOffset = 2 * kPointerSize; 1393 const int kRecvOffset = 3 * kPointerSize; 1394 const int kFunctionOffset = 4 * kPointerSize; 1395 1396 __ EnterInternalFrame(); 1397 1398 __ ldr(r0, MemOperand(fp, kFunctionOffset)); // get the function 1399 __ push(r0); 1400 __ ldr(r0, MemOperand(fp, kArgsOffset)); // get the args array 1401 __ push(r0); 1402 __ InvokeBuiltin(Builtins::APPLY_PREPARE, CALL_FUNCTION); 1403 1404 // Check the stack for overflow. We are not trying need to catch 1405 // interruptions (e.g. debug break and preemption) here, so the "real stack 1406 // limit" is checked. 1407 Label okay; 1408 __ LoadRoot(r2, Heap::kRealStackLimitRootIndex); 1409 // Make r2 the space we have left. The stack might already be overflowed 1410 // here which will cause r2 to become negative. 1411 __ sub(r2, sp, r2); 1412 // Check if the arguments will overflow the stack. 1413 __ cmp(r2, Operand(r0, LSL, kPointerSizeLog2 - kSmiTagSize)); 1414 __ b(gt, &okay); // Signed comparison. 1415 1416 // Out of stack space. 1417 __ ldr(r1, MemOperand(fp, kFunctionOffset)); 1418 __ push(r1); 1419 __ push(r0); 1420 __ InvokeBuiltin(Builtins::APPLY_OVERFLOW, CALL_FUNCTION); 1421 // End of stack check. 1422 1423 // Push current limit and index. 1424 __ bind(&okay); 1425 __ push(r0); // limit 1426 __ mov(r1, Operand(0, RelocInfo::NONE)); // initial index 1427 __ push(r1); 1428 1429 // Change context eagerly to get the right global object if necessary. 1430 __ ldr(r0, MemOperand(fp, kFunctionOffset)); 1431 __ ldr(cp, FieldMemOperand(r0, JSFunction::kContextOffset)); 1432 // Load the shared function info while the function is still in r0. 1433 __ ldr(r1, FieldMemOperand(r0, JSFunction::kSharedFunctionInfoOffset)); 1434 1435 // Compute the receiver. 1436 Label call_to_object, use_global_receiver, push_receiver; 1437 __ ldr(r0, MemOperand(fp, kRecvOffset)); 1438 1439 // Do not transform the receiver for strict mode functions. 1440 __ ldr(r2, FieldMemOperand(r1, SharedFunctionInfo::kCompilerHintsOffset)); 1441 __ tst(r2, Operand(1 << (SharedFunctionInfo::kStrictModeFunction + 1442 kSmiTagSize))); 1443 __ b(ne, &push_receiver); 1444 1445 // Do not transform the receiver for strict mode functions. 1446 __ tst(r2, Operand(1 << (SharedFunctionInfo::kES5Native + 1447 kSmiTagSize))); 1448 __ b(ne, &push_receiver); 1449 1450 // Compute the receiver in non-strict mode. 1451 __ tst(r0, Operand(kSmiTagMask)); 1452 __ b(eq, &call_to_object); 1453 __ LoadRoot(r1, Heap::kNullValueRootIndex); 1454 __ cmp(r0, r1); 1455 __ b(eq, &use_global_receiver); 1456 __ LoadRoot(r1, Heap::kUndefinedValueRootIndex); 1457 __ cmp(r0, r1); 1458 __ b(eq, &use_global_receiver); 1459 1460 // Check if the receiver is already a JavaScript object. 1461 // r0: receiver 1462 STATIC_ASSERT(LAST_JS_OBJECT_TYPE + 1 == LAST_TYPE); 1463 STATIC_ASSERT(LAST_TYPE == JS_FUNCTION_TYPE); 1464 __ CompareObjectType(r0, r1, r1, FIRST_JS_OBJECT_TYPE); 1465 __ b(ge, &push_receiver); 1466 1467 // Convert the receiver to a regular object. 1468 // r0: receiver 1469 __ bind(&call_to_object); 1470 __ push(r0); 1471 __ InvokeBuiltin(Builtins::TO_OBJECT, CALL_FUNCTION); 1472 __ b(&push_receiver); 1473 1474 // Use the current global receiver object as the receiver. 1475 __ bind(&use_global_receiver); 1476 const int kGlobalOffset = 1477 Context::kHeaderSize + Context::GLOBAL_INDEX * kPointerSize; 1478 __ ldr(r0, FieldMemOperand(cp, kGlobalOffset)); 1479 __ ldr(r0, FieldMemOperand(r0, GlobalObject::kGlobalContextOffset)); 1480 __ ldr(r0, FieldMemOperand(r0, kGlobalOffset)); 1481 __ ldr(r0, FieldMemOperand(r0, GlobalObject::kGlobalReceiverOffset)); 1482 1483 // Push the receiver. 1484 // r0: receiver 1485 __ bind(&push_receiver); 1486 __ push(r0); 1487 1488 // Copy all arguments from the array to the stack. 1489 Label entry, loop; 1490 __ ldr(r0, MemOperand(fp, kIndexOffset)); 1491 __ b(&entry); 1492 1493 // Load the current argument from the arguments array and push it to the 1494 // stack. 1495 // r0: current argument index 1496 __ bind(&loop); 1497 __ ldr(r1, MemOperand(fp, kArgsOffset)); 1498 __ push(r1); 1499 __ push(r0); 1500 1501 // Call the runtime to access the property in the arguments array. 1502 __ CallRuntime(Runtime::kGetProperty, 2); 1503 __ push(r0); 1504 1505 // Use inline caching to access the arguments. 1506 __ ldr(r0, MemOperand(fp, kIndexOffset)); 1507 __ add(r0, r0, Operand(1 << kSmiTagSize)); 1508 __ str(r0, MemOperand(fp, kIndexOffset)); 1509 1510 // Test if the copy loop has finished copying all the elements from the 1511 // arguments object. 1512 __ bind(&entry); 1513 __ ldr(r1, MemOperand(fp, kLimitOffset)); 1514 __ cmp(r0, r1); 1515 __ b(ne, &loop); 1516 1517 // Invoke the function. 1518 ParameterCount actual(r0); 1519 __ mov(r0, Operand(r0, ASR, kSmiTagSize)); 1520 __ ldr(r1, MemOperand(fp, kFunctionOffset)); 1521 __ InvokeFunction(r1, actual, CALL_FUNCTION, 1522 NullCallWrapper(), CALL_AS_METHOD); 1523 1524 // Tear down the internal frame and remove function, receiver and args. 1525 __ LeaveInternalFrame(); 1526 __ add(sp, sp, Operand(3 * kPointerSize)); 1527 __ Jump(lr); 1528} 1529 1530 1531static void EnterArgumentsAdaptorFrame(MacroAssembler* masm) { 1532 __ mov(r0, Operand(r0, LSL, kSmiTagSize)); 1533 __ mov(r4, Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR))); 1534 __ stm(db_w, sp, r0.bit() | r1.bit() | r4.bit() | fp.bit() | lr.bit()); 1535 __ add(fp, sp, Operand(3 * kPointerSize)); 1536} 1537 1538 1539static void LeaveArgumentsAdaptorFrame(MacroAssembler* masm) { 1540 // ----------- S t a t e ------------- 1541 // -- r0 : result being passed through 1542 // ----------------------------------- 1543 // Get the number of arguments passed (as a smi), tear down the frame and 1544 // then tear down the parameters. 1545 __ ldr(r1, MemOperand(fp, -3 * kPointerSize)); 1546 __ mov(sp, fp); 1547 __ ldm(ia_w, sp, fp.bit() | lr.bit()); 1548 __ add(sp, sp, Operand(r1, LSL, kPointerSizeLog2 - kSmiTagSize)); 1549 __ add(sp, sp, Operand(kPointerSize)); // adjust for receiver 1550} 1551 1552 1553void Builtins::Generate_ArgumentsAdaptorTrampoline(MacroAssembler* masm) { 1554 // ----------- S t a t e ------------- 1555 // -- r0 : actual number of arguments 1556 // -- r1 : function (passed through to callee) 1557 // -- r2 : expected number of arguments 1558 // -- r3 : code entry to call 1559 // -- r5 : call kind information 1560 // ----------------------------------- 1561 1562 Label invoke, dont_adapt_arguments; 1563 1564 Label enough, too_few; 1565 __ cmp(r0, r2); 1566 __ b(lt, &too_few); 1567 __ cmp(r2, Operand(SharedFunctionInfo::kDontAdaptArgumentsSentinel)); 1568 __ b(eq, &dont_adapt_arguments); 1569 1570 { // Enough parameters: actual >= expected 1571 __ bind(&enough); 1572 EnterArgumentsAdaptorFrame(masm); 1573 1574 // Calculate copy start address into r0 and copy end address into r2. 1575 // r0: actual number of arguments as a smi 1576 // r1: function 1577 // r2: expected number of arguments 1578 // r3: code entry to call 1579 __ add(r0, fp, Operand(r0, LSL, kPointerSizeLog2 - kSmiTagSize)); 1580 // adjust for return address and receiver 1581 __ add(r0, r0, Operand(2 * kPointerSize)); 1582 __ sub(r2, r0, Operand(r2, LSL, kPointerSizeLog2)); 1583 1584 // Copy the arguments (including the receiver) to the new stack frame. 1585 // r0: copy start address 1586 // r1: function 1587 // r2: copy end address 1588 // r3: code entry to call 1589 1590 Label copy; 1591 __ bind(©); 1592 __ ldr(ip, MemOperand(r0, 0)); 1593 __ push(ip); 1594 __ cmp(r0, r2); // Compare before moving to next argument. 1595 __ sub(r0, r0, Operand(kPointerSize)); 1596 __ b(ne, ©); 1597 1598 __ b(&invoke); 1599 } 1600 1601 { // Too few parameters: Actual < expected 1602 __ bind(&too_few); 1603 EnterArgumentsAdaptorFrame(masm); 1604 1605 // Calculate copy start address into r0 and copy end address is fp. 1606 // r0: actual number of arguments as a smi 1607 // r1: function 1608 // r2: expected number of arguments 1609 // r3: code entry to call 1610 __ add(r0, fp, Operand(r0, LSL, kPointerSizeLog2 - kSmiTagSize)); 1611 1612 // Copy the arguments (including the receiver) to the new stack frame. 1613 // r0: copy start address 1614 // r1: function 1615 // r2: expected number of arguments 1616 // r3: code entry to call 1617 Label copy; 1618 __ bind(©); 1619 // Adjust load for return address and receiver. 1620 __ ldr(ip, MemOperand(r0, 2 * kPointerSize)); 1621 __ push(ip); 1622 __ cmp(r0, fp); // Compare before moving to next argument. 1623 __ sub(r0, r0, Operand(kPointerSize)); 1624 __ b(ne, ©); 1625 1626 // Fill the remaining expected arguments with undefined. 1627 // r1: function 1628 // r2: expected number of arguments 1629 // r3: code entry to call 1630 __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); 1631 __ sub(r2, fp, Operand(r2, LSL, kPointerSizeLog2)); 1632 __ sub(r2, r2, Operand(4 * kPointerSize)); // Adjust for frame. 1633 1634 Label fill; 1635 __ bind(&fill); 1636 __ push(ip); 1637 __ cmp(sp, r2); 1638 __ b(ne, &fill); 1639 } 1640 1641 // Call the entry point. 1642 __ bind(&invoke); 1643 __ Call(r3); 1644 1645 // Exit frame and return. 1646 LeaveArgumentsAdaptorFrame(masm); 1647 __ Jump(lr); 1648 1649 1650 // ------------------------------------------- 1651 // Dont adapt arguments. 1652 // ------------------------------------------- 1653 __ bind(&dont_adapt_arguments); 1654 __ Jump(r3); 1655} 1656 1657 1658#undef __ 1659 1660} } // namespace v8::internal 1661 1662#endif // V8_TARGET_ARCH_ARM 1663