OLD | NEW |
---|---|
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 5450 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
5461 // If any of these assumptions fail, we call the runtime system. | 5461 // If any of these assumptions fail, we call the runtime system. |
5462 | 5462 |
5463 static const int kToOffset = 0 * kPointerSize; | 5463 static const int kToOffset = 0 * kPointerSize; |
5464 static const int kFromOffset = 1 * kPointerSize; | 5464 static const int kFromOffset = 1 * kPointerSize; |
5465 static const int kStringOffset = 2 * kPointerSize; | 5465 static const int kStringOffset = 2 * kPointerSize; |
5466 | 5466 |
5467 // Check bounds and smi-ness. | 5467 // Check bounds and smi-ness. |
5468 Register to = r6; | 5468 Register to = r6; |
5469 Register from = r7; | 5469 Register from = r7; |
5470 | 5470 |
5471 if (FLAG_string_slices) { | |
5472 __ nop(0); // Jumping as first instruction would crash the code generation. | |
5473 __ jmp(&runtime); | |
5474 } | |
5475 | |
5476 __ Ldrd(to, from, MemOperand(sp, kToOffset)); | 5471 __ Ldrd(to, from, MemOperand(sp, kToOffset)); |
5477 STATIC_ASSERT(kFromOffset == kToOffset + 4); | 5472 STATIC_ASSERT(kFromOffset == kToOffset + 4); |
5478 STATIC_ASSERT(kSmiTag == 0); | 5473 STATIC_ASSERT(kSmiTag == 0); |
5479 STATIC_ASSERT(kSmiTagSize + kSmiShiftSize == 1); | 5474 STATIC_ASSERT(kSmiTagSize + kSmiShiftSize == 1); |
5480 | 5475 |
5481 // I.e., arithmetic shift right by one un-smi-tags. | 5476 // I.e., arithmetic shift right by one un-smi-tags. |
5482 __ mov(r2, Operand(to, ASR, 1), SetCC); | 5477 __ mov(r2, Operand(to, ASR, 1), SetCC); |
5483 __ mov(r3, Operand(from, ASR, 1), SetCC, cc); | 5478 __ mov(r3, Operand(from, ASR, 1), SetCC, cc); |
5484 // If either to or from had the smi tag bit set, then carry is set now. | 5479 // If either to or from had the smi tag bit set, then carry is set now. |
5485 __ b(cs, &runtime); // Either "from" or "to" is not a smi. | 5480 __ b(cs, &runtime); // Either "from" or "to" is not a smi. |
5486 __ b(mi, &runtime); // From is negative. | 5481 __ b(mi, &runtime); // From is negative. |
5487 | 5482 |
5488 // Both to and from are smis. | 5483 // Both to and from are smis. |
5489 __ sub(r2, r2, Operand(r3), SetCC); | 5484 __ sub(r2, r2, Operand(r3), SetCC); |
5490 __ b(mi, &runtime); // Fail if from > to. | 5485 __ b(mi, &runtime); // Fail if from > to. |
5491 // Special handling of sub-strings of length 1 and 2. One character strings | 5486 // Special handling of sub-strings of length 1 and 2. One character strings |
Erik Corry
2011/08/31 14:14:13
This comment is out of date, since the code handle
| |
5492 // are handled in the runtime system (looked up in the single character | 5487 // are handled in the runtime system (looked up in the single character |
5493 // cache). Two character strings are looked for in the symbol cache. | 5488 // cache). Two character strings are looked for in the symbol cache. |
5494 __ cmp(r2, Operand(2)); | 5489 __ cmp(r2, Operand(2)); |
5495 __ b(lt, &runtime); | 5490 __ b(lt, &runtime); |
5496 | 5491 |
5497 // r2: length | 5492 // r2: length |
5498 // r3: from index (untaged smi) | 5493 // r3: from index (untaged smi) |
5499 // r6 (a.k.a. to): to (smi) | 5494 // r6 (a.k.a. to): to (smi) |
5500 // r7 (a.k.a. from): from offset (smi) | 5495 // r7 (a.k.a. from): from offset (smi) |
5501 | 5496 |
5502 // Make sure first argument is a sequential (or flat) string. | 5497 // Make sure first argument is a sequential (or flat) string. |
5503 __ ldr(r5, MemOperand(sp, kStringOffset)); | 5498 __ ldr(r0, MemOperand(sp, kStringOffset)); |
5504 STATIC_ASSERT(kSmiTag == 0); | 5499 STATIC_ASSERT(kSmiTag == 0); |
5505 __ JumpIfSmi(r5, &runtime); | 5500 __ JumpIfSmi(r0, &runtime); |
5506 Condition is_string = masm->IsObjectStringType(r5, r1); | 5501 Condition is_string = masm->IsObjectStringType(r0, r1); |
5507 __ b(NegateCondition(is_string), &runtime); | 5502 __ b(NegateCondition(is_string), &runtime); |
5508 | 5503 |
5504 // Short-cut for the case of trivial substring. | |
5505 Label return_r0; | |
5506 __ ldr(r4, FieldMemOperand(r0, String::kLengthOffset)); | |
5507 __ cmp(r2, Operand(r4, ASR, 1)); | |
5508 __ b(ge, &return_r0); | |
Erik Corry
2011/08/31 14:14:13
I think eq is clearer than ge. A comment to the e
| |
5509 | |
5510 Label create_slice; | |
5511 if (FLAG_string_slices) { | |
5512 __ cmp(r2, Operand(SlicedString::kMinLength)); | |
5513 __ b(ge, &create_slice); | |
5514 } | |
5515 | |
5516 // r0: original string | |
5509 // r1: instance type | 5517 // r1: instance type |
5510 // r2: length | 5518 // r2: length |
5511 // r3: from index (untagged smi) | 5519 // r3: from index (untagged smi) |
5512 // r5: string | |
5513 // r6 (a.k.a. to): to (smi) | 5520 // r6 (a.k.a. to): to (smi) |
5514 // r7 (a.k.a. from): from offset (smi) | 5521 // r7 (a.k.a. from): from offset (smi) |
5515 Label seq_string; | 5522 Label seq_string; |
5516 __ and_(r4, r1, Operand(kStringRepresentationMask)); | 5523 __ and_(r4, r1, Operand(kStringRepresentationMask)); |
5517 STATIC_ASSERT(kSeqStringTag < kConsStringTag); | 5524 STATIC_ASSERT(kSeqStringTag < kConsStringTag); |
5518 STATIC_ASSERT(kConsStringTag < kExternalStringTag); | 5525 STATIC_ASSERT(kConsStringTag < kExternalStringTag); |
5519 __ cmp(r4, Operand(kConsStringTag)); | 5526 __ cmp(r4, Operand(kConsStringTag)); |
5520 __ b(gt, &runtime); // External strings go to runtime. | 5527 __ b(gt, &runtime); // External strings go to runtime. |
Erik Corry
2011/08/31 14:14:13
Update comment to say that external and sliced str
Yang
2011/08/31 15:58:16
Note that (with FLAG_string_slices==true) this bai
| |
5521 __ b(lt, &seq_string); // Sequential strings are handled directly. | 5528 __ b(lt, &seq_string); // Sequential strings are handled directly. |
5522 | 5529 |
5523 // Cons string. Try to recurse (once) on the first substring. | 5530 // Cons string. Try to recurse (once) on the first substring. |
5524 // (This adds a little more generality than necessary to handle flattened | 5531 // (This adds a little more generality than necessary to handle flattened |
5525 // cons strings, but not much). | 5532 // cons strings, but not much). |
5526 __ ldr(r5, FieldMemOperand(r5, ConsString::kFirstOffset)); | 5533 __ ldr(r0, FieldMemOperand(r0, ConsString::kFirstOffset)); |
5527 __ ldr(r4, FieldMemOperand(r5, HeapObject::kMapOffset)); | 5534 __ ldr(r4, FieldMemOperand(r0, HeapObject::kMapOffset)); |
5528 __ ldrb(r1, FieldMemOperand(r4, Map::kInstanceTypeOffset)); | 5535 __ ldrb(r1, FieldMemOperand(r4, Map::kInstanceTypeOffset)); |
5529 __ tst(r1, Operand(kStringRepresentationMask)); | 5536 __ tst(r1, Operand(kStringRepresentationMask)); |
5530 STATIC_ASSERT(kSeqStringTag == 0); | 5537 STATIC_ASSERT(kSeqStringTag == 0); |
5531 __ b(ne, &runtime); // Cons and External strings go to runtime. | 5538 __ b(ne, &runtime); // Cons and External strings go to runtime. |
Erik Corry
2011/08/31 14:14:13
and slices, or can they not be found under a cons
| |
5532 | 5539 |
5533 // Definitly a sequential string. | 5540 // Definitly a sequential string. |
5534 __ bind(&seq_string); | 5541 __ bind(&seq_string); |
5535 | 5542 |
5536 // r1: instance type. | 5543 // r0: original string |
5544 // r1: instance type | |
5537 // r2: length | 5545 // r2: length |
5538 // r3: from index (untaged smi) | 5546 // r3: from index (untaged smi) |
Erik Corry
2011/08/31 14:14:13
untaged -> untagged
also at least one other place.
| |
5539 // r5: string | |
5540 // r6 (a.k.a. to): to (smi) | 5547 // r6 (a.k.a. to): to (smi) |
5541 // r7 (a.k.a. from): from offset (smi) | 5548 // r7 (a.k.a. from): from offset (smi) |
5542 __ ldr(r4, FieldMemOperand(r5, String::kLengthOffset)); | 5549 __ ldr(r4, FieldMemOperand(r0, String::kLengthOffset)); |
5543 __ cmp(r4, Operand(to)); | 5550 __ cmp(r4, Operand(to)); |
5544 __ b(lt, &runtime); // Fail if to > length. | 5551 __ b(lt, &runtime); // Fail if to > length. |
5545 to = no_reg; | 5552 to = no_reg; |
5546 | 5553 |
5547 // r1: instance type. | 5554 // r0: original string |
Erik Corry
2011/08/31 14:14:13
Original string or left hand side of the original
| |
5548 // r2: result string length. | 5555 // r1: instance type |
5556 // r2: result string length | |
5549 // r3: from index (untaged smi) | 5557 // r3: from index (untaged smi) |
5550 // r5: string. | |
5551 // r7 (a.k.a. from): from offset (smi) | 5558 // r7 (a.k.a. from): from offset (smi) |
5552 // Check for flat ASCII string. | 5559 // Check for flat ASCII string. |
5553 Label non_ascii_flat; | 5560 Label non_ascii_flat; |
5554 __ tst(r1, Operand(kStringEncodingMask)); | 5561 __ tst(r1, Operand(kStringEncodingMask)); |
5555 STATIC_ASSERT(kTwoByteStringTag == 0); | 5562 STATIC_ASSERT(kTwoByteStringTag == 0); |
5556 __ b(eq, &non_ascii_flat); | 5563 __ b(eq, &non_ascii_flat); |
5557 | 5564 |
5558 Label result_longer_than_two; | 5565 Label result_longer_than_two; |
5559 __ cmp(r2, Operand(2)); | 5566 __ cmp(r2, Operand(2)); |
5560 __ b(gt, &result_longer_than_two); | 5567 __ b(gt, &result_longer_than_two); |
5561 | 5568 |
5562 // Sub string of length 2 requested. | 5569 // Sub string of length 2 requested. |
5563 // Get the two characters forming the sub string. | 5570 // Get the two characters forming the sub string. |
5564 __ add(r5, r5, Operand(r3)); | 5571 __ add(r0, r0, Operand(r3)); |
5565 __ ldrb(r3, FieldMemOperand(r5, SeqAsciiString::kHeaderSize)); | 5572 __ ldrb(r3, FieldMemOperand(r0, SeqAsciiString::kHeaderSize)); |
5566 __ ldrb(r4, FieldMemOperand(r5, SeqAsciiString::kHeaderSize + 1)); | 5573 __ ldrb(r4, FieldMemOperand(r0, SeqAsciiString::kHeaderSize + 1)); |
5567 | 5574 |
5568 // Try to lookup two character string in symbol table. | 5575 // Try to lookup two character string in symbol table. |
5569 Label make_two_character_string; | 5576 Label make_two_character_string; |
5570 StringHelper::GenerateTwoCharacterSymbolTableProbe( | 5577 StringHelper::GenerateTwoCharacterSymbolTableProbe( |
5571 masm, r3, r4, r1, r5, r6, r7, r9, &make_two_character_string); | 5578 masm, r3, r4, r1, r5, r6, r7, r9, &make_two_character_string); |
5572 Counters* counters = masm->isolate()->counters(); | 5579 Counters* counters = masm->isolate()->counters(); |
5573 __ IncrementCounter(counters->sub_string_native(), 1, r3, r4); | 5580 __ jmp(&return_r0); |
5574 __ add(sp, sp, Operand(3 * kPointerSize)); | |
5575 __ Ret(); | |
5576 | 5581 |
5577 // r2: result string length. | 5582 // r2: result string length. |
5578 // r3: two characters combined into halfword in little endian byte order. | 5583 // r3: two characters combined into halfword in little endian byte order. |
5579 __ bind(&make_two_character_string); | 5584 __ bind(&make_two_character_string); |
5580 __ AllocateAsciiString(r0, r2, r4, r5, r9, &runtime); | 5585 __ AllocateAsciiString(r0, r2, r4, r5, r9, &runtime); |
5581 __ strh(r3, FieldMemOperand(r0, SeqAsciiString::kHeaderSize)); | 5586 __ strh(r3, FieldMemOperand(r0, SeqAsciiString::kHeaderSize)); |
5582 __ IncrementCounter(counters->sub_string_native(), 1, r3, r4); | 5587 __ jmp(&return_r0); |
5583 __ add(sp, sp, Operand(3 * kPointerSize)); | |
5584 __ Ret(); | |
5585 | 5588 |
5586 __ bind(&result_longer_than_two); | 5589 __ bind(&result_longer_than_two); |
5587 | 5590 |
5591 // Locate 'from' character of string. | |
5592 __ add(r5, r0, Operand(SeqAsciiString::kHeaderSize - kHeapObjectTag)); | |
5593 __ add(r5, r5, Operand(from, ASR, 1)); | |
5594 | |
5588 // Allocate the result. | 5595 // Allocate the result. |
5589 __ AllocateAsciiString(r0, r2, r3, r4, r1, &runtime); | 5596 __ AllocateAsciiString(r0, r2, r3, r4, r1, &runtime); |
5590 | 5597 |
5591 // r0: result string. | 5598 // r0: result string |
5592 // r2: result string length. | 5599 // r2: result string length |
5593 // r5: string. | 5600 // r5: first character of sub string to copy |
Erik Corry
2011/08/31 14:14:13
sub string -> substring
| |
5594 // r7 (a.k.a. from): from offset (smi) | 5601 // r7 (a.k.a. from): from offset (smi) |
5595 // Locate first character of result. | 5602 // Locate first character of result. |
5596 __ add(r1, r0, Operand(SeqAsciiString::kHeaderSize - kHeapObjectTag)); | 5603 __ add(r1, r0, Operand(SeqAsciiString::kHeaderSize - kHeapObjectTag)); |
5597 // Locate 'from' character of string. | |
5598 __ add(r5, r5, Operand(SeqAsciiString::kHeaderSize - kHeapObjectTag)); | |
5599 __ add(r5, r5, Operand(from, ASR, 1)); | |
5600 | 5604 |
5601 // r0: result string. | 5605 // r0: result string |
5602 // r1: first character of result string. | 5606 // r1: first character of result string |
5603 // r2: result string length. | 5607 // r2: result string length |
5604 // r5: first character of sub string to copy. | 5608 // r5: first character of sub string to copy |
5605 STATIC_ASSERT((SeqAsciiString::kHeaderSize & kObjectAlignmentMask) == 0); | 5609 STATIC_ASSERT((SeqAsciiString::kHeaderSize & kObjectAlignmentMask) == 0); |
5606 StringHelper::GenerateCopyCharactersLong(masm, r1, r5, r2, r3, r4, r6, r7, r9, | 5610 StringHelper::GenerateCopyCharactersLong(masm, r1, r5, r2, r3, r4, r6, r7, r9, |
5607 COPY_ASCII | DEST_ALWAYS_ALIGNED); | 5611 COPY_ASCII | DEST_ALWAYS_ALIGNED); |
5608 __ IncrementCounter(counters->sub_string_native(), 1, r3, r4); | 5612 __ jmp(&return_r0); |
5609 __ add(sp, sp, Operand(3 * kPointerSize)); | |
5610 __ Ret(); | |
5611 | 5613 |
5612 __ bind(&non_ascii_flat); | 5614 __ bind(&non_ascii_flat); |
5613 // r2: result string length. | 5615 // r0: original string |
5614 // r5: string. | 5616 // r2: result string length |
5615 // r7 (a.k.a. from): from offset (smi) | 5617 // r7 (a.k.a. from): from offset (smi) |
5616 // Check for flat two byte string. | 5618 // Check for flat two byte string. |
5617 | 5619 |
5620 // Locate 'from' character of string. | |
5621 __ add(r5, r0, Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag)); | |
5622 // As "from" is a smi it is 2 times the value which matches the size of a two | |
5623 // byte character. | |
Erik Corry
2011/08/31 14:14:13
Add a static assert that the kSmiTag is 0 and kSmi
| |
5624 __ add(r5, r5, Operand(from)); | |
5625 | |
5618 // Allocate the result. | 5626 // Allocate the result. |
5619 __ AllocateTwoByteString(r0, r2, r1, r3, r4, &runtime); | 5627 __ AllocateTwoByteString(r0, r2, r1, r3, r4, &runtime); |
5620 | 5628 |
5621 // r0: result string. | 5629 // r0: result string |
5622 // r2: result string length. | 5630 // r2: result string length |
5623 // r5: string. | 5631 // r5: first character of sub string to copy |
Erik Corry
2011/08/31 14:14:13
sub string -> substring
| |
5624 // Locate first character of result. | 5632 // Locate first character of result. |
5625 __ add(r1, r0, Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag)); | 5633 __ add(r1, r0, Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag)); |
5626 // Locate 'from' character of string. | 5634 |
5627 __ add(r5, r5, Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag)); | |
5628 // As "from" is a smi it is 2 times the value which matches the size of a two | |
5629 // byte character. | |
5630 __ add(r5, r5, Operand(from)); | |
5631 from = no_reg; | 5635 from = no_reg; |
5632 | 5636 |
5633 // r0: result string. | 5637 // r0: result string. |
5634 // r1: first character of result. | 5638 // r1: first character of result. |
5635 // r2: result length. | 5639 // r2: result length. |
5636 // r5: first character of string to copy. | 5640 // r5: first character of string to copy. |
5637 STATIC_ASSERT((SeqTwoByteString::kHeaderSize & kObjectAlignmentMask) == 0); | 5641 STATIC_ASSERT((SeqTwoByteString::kHeaderSize & kObjectAlignmentMask) == 0); |
5638 StringHelper::GenerateCopyCharactersLong( | 5642 StringHelper::GenerateCopyCharactersLong( |
5639 masm, r1, r5, r2, r3, r4, r6, r7, r9, DEST_ALWAYS_ALIGNED); | 5643 masm, r1, r5, r2, r3, r4, r6, r7, r9, DEST_ALWAYS_ALIGNED); |
5644 __ jmp(&return_r0); | |
5645 | |
5646 if (FLAG_string_slices) { | |
5647 __ bind(&create_slice); | |
5648 // r0: original string | |
5649 // r1: instance type | |
5650 // r2: length | |
5651 // r3: from index (untagged smi) | |
5652 // r6 (a.k.a. to): to (smi) | |
5653 // r7 (a.k.a. from): from offset (smi) | |
5654 Label allocate_slice, sliced_string, seq_string; | |
5655 STATIC_ASSERT(kSeqStringTag == 0); | |
5656 __ tst(r1, Operand(kStringRepresentationMask)); | |
5657 __ b(eq, &seq_string); | |
5658 STATIC_ASSERT(kIsIndirectStringMask == (kSlicedStringTag & kConsStringTag)); | |
antonm
2011/08/31 13:08:42
those constants might be worth lifting into object
| |
5659 STATIC_ASSERT(kIsIndirectStringMask != 0); | |
5660 __ tst(r1, Operand(kIsIndirectStringMask)); | |
5661 // External string. Jump to runtime. | |
5662 __ b(eq, &runtime); | |
5663 | |
5664 __ tst(r1, Operand(kSlicedNotConsMask)); | |
5665 __ b(ne, &sliced_string); | |
5666 // Cons string. Check whether it is flat, then fetch first part. | |
Erik Corry
2011/08/31 14:14:13
How do we get here if it's a cons string?
Yang
2011/08/31 15:58:16
A cons string's string representation bits has the
| |
5667 __ ldr(r5, FieldMemOperand(r0, ConsString::kSecondOffset)); | |
5668 __ LoadRoot(r9, Heap::kEmptyStringRootIndex); | |
5669 __ cmp(r5, r9); | |
5670 __ b(ne, &runtime); | |
5671 __ ldr(r5, FieldMemOperand(r0, ConsString::kFirstOffset)); | |
5672 __ jmp(&allocate_slice); | |
5673 | |
5674 __ bind(&sliced_string); | |
5675 // Sliced string. Fetch parent and correct start index by offset. | |
Erik Corry
2011/08/31 14:14:13
Do you have test coverage here? I think we alread
Yang
2011/08/31 15:58:16
We only bail out in the case when the original str
| |
5676 __ ldr(r5, FieldMemOperand(r0, SlicedString::kOffsetOffset)); | |
5677 __ add(r7, r7, r5); | |
5678 __ ldr(r5, FieldMemOperand(r0, SlicedString::kParentOffset)); | |
5679 __ jmp(&allocate_slice); | |
5680 | |
5681 __ bind(&seq_string); | |
5682 // Sequential string. Just move string to the right register. | |
5683 __ mov(r5, r0); | |
5684 | |
5685 __ bind(&allocate_slice); | |
5686 // r1: instance type of original string | |
5687 // r2: length | |
5688 // r5: underlying subject string | |
5689 // r7 (a.k.a. from): from offset (smi) | |
5690 // Allocate new sliced string. At this point we do not reload the instance | |
5691 // type including the string encoding because we simply rely on the info | |
5692 // provided by the original string. It does not matter if the original | |
5693 // string's encoding is wrong because we always have to recheck encoding of | |
5694 // the newly created string's parent anyways due to externalized strings. | |
5695 Label two_byte_slice, set_slice_header; | |
5696 STATIC_ASSERT(kAsciiStringTag != 0); | |
5697 __ tst(r1, Operand(kAsciiStringTag)); | |
5698 __ b(eq, &two_byte_slice); | |
5699 __ AllocateAsciiSlicedString(r0, r2, r3, r4, &runtime); | |
5700 __ jmp(&set_slice_header); | |
5701 __ bind(&two_byte_slice); | |
5702 __ AllocateTwoByteSlicedString(r0, r2, r3, r4, &runtime); | |
5703 __ bind(&set_slice_header); | |
5704 __ str(r7, FieldMemOperand(r0, SlicedString::kOffsetOffset)); | |
5705 __ str(r5, FieldMemOperand(r0, SlicedString::kParentOffset)); | |
5706 } | |
5707 | |
5708 __ bind(&return_r0); | |
5640 __ IncrementCounter(counters->sub_string_native(), 1, r3, r4); | 5709 __ IncrementCounter(counters->sub_string_native(), 1, r3, r4); |
5641 __ add(sp, sp, Operand(3 * kPointerSize)); | 5710 __ add(sp, sp, Operand(3 * kPointerSize)); |
5642 __ Ret(); | 5711 __ Ret(); |
5643 | 5712 |
5644 // Just jump to runtime to create the sub string. | 5713 // Just jump to runtime to create the sub string. |
5645 __ bind(&runtime); | 5714 __ bind(&runtime); |
5646 __ TailCallRuntime(Runtime::kSubString, 3, 1); | 5715 __ TailCallRuntime(Runtime::kSubString, 3, 1); |
5647 } | 5716 } |
5648 | 5717 |
5649 | 5718 |
(...skipping 960 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
6610 __ mov(result, Operand::Zero()); | 6679 __ mov(result, Operand::Zero()); |
6611 __ Ret(); | 6680 __ Ret(); |
6612 } | 6681 } |
6613 | 6682 |
6614 | 6683 |
6615 #undef __ | 6684 #undef __ |
6616 | 6685 |
6617 } } // namespace v8::internal | 6686 } } // namespace v8::internal |
6618 | 6687 |
6619 #endif // V8_TARGET_ARCH_ARM | 6688 #endif // V8_TARGET_ARCH_ARM |
OLD | NEW |