Chromium Code Reviews| Index: src/x64/code-stubs-x64.cc |
| diff --git a/src/x64/code-stubs-x64.cc b/src/x64/code-stubs-x64.cc |
| index ab3064fc26bfb5552a43ffcc7b91c0161b434bbc..1980b7f58cafeba36d64a235421a8a088f856127 100644 |
| --- a/src/x64/code-stubs-x64.cc |
| +++ b/src/x64/code-stubs-x64.cc |
| @@ -3436,11 +3436,10 @@ static void BranchIfNotInternalizedString(MacroAssembler* masm, |
| __ movq(scratch, FieldOperand(object, HeapObject::kMapOffset)); |
| __ movzxbq(scratch, |
| FieldOperand(scratch, Map::kInstanceTypeOffset)); |
| - // Ensure that no non-strings have the internalized bit set. |
| - STATIC_ASSERT(LAST_TYPE < kNotStringTag + kIsInternalizedMask); |
| STATIC_ASSERT(kInternalizedTag != 0); |
| - __ testb(scratch, Immediate(kIsInternalizedMask)); |
| - __ j(zero, label); |
| + __ and_(scratch, Immediate(kIsNotStringMask | kIsInternalizedMask)); |
| + __ cmpb(scratch, Immediate(kInternalizedTag | kStringTag)); |
| + __ j(not_equal, label); |
| } |
| @@ -5845,9 +5844,13 @@ void ICCompareStub::GenerateInternalizedStrings(MacroAssembler* masm) { |
| __ movzxbq(tmp1, FieldOperand(tmp1, Map::kInstanceTypeOffset)); |
| __ movzxbq(tmp2, FieldOperand(tmp2, Map::kInstanceTypeOffset)); |
| STATIC_ASSERT(kInternalizedTag != 0); |
| - __ and_(tmp1, tmp2); |
| - __ testb(tmp1, Immediate(kIsInternalizedMask)); |
| - __ j(zero, &miss, Label::kNear); |
| + __ and_(tmp1, Immediate(kIsNotStringMask | kIsInternalizedMask)); |
| + __ cmpb(tmp1, Immediate(kInternalizedTag | kStringTag)); |
| + __ j(not_equal, &miss, Label::kNear); |
| + |
| + __ and_(tmp2, Immediate(kIsNotStringMask | kIsInternalizedMask)); |
| + __ cmpb(tmp2, Immediate(kInternalizedTag | kStringTag)); |
| + __ j(not_equal, &miss, Label::kNear); |
| // Internalized strings are compared by identity. |
| Label done; |
| @@ -5891,16 +5894,18 @@ void ICCompareStub::GenerateUniqueNames(MacroAssembler* masm) { |
| __ movzxbq(tmp2, FieldOperand(tmp2, Map::kInstanceTypeOffset)); |
| Label succeed1; |
| - __ testb(tmp1, Immediate(kIsInternalizedMask)); |
| - __ j(not_zero, &succeed1, Label::kNear); |
| __ cmpb(tmp1, Immediate(static_cast<uint8_t>(SYMBOL_TYPE))); |
| + __ j(equal, &succeed1, Label::kNear); |
| + __ and_(tmp1, Immediate(kIsNotStringMask | kIsInternalizedMask)); |
| + __ cmpb(tmp1, Immediate(kInternalizedTag | kStringTag)); |
| __ j(not_equal, &miss, Label::kNear); |
|
Yang
2013/06/26 15:00:27
We could be clever here to save one instruction:
mvstanton
2013/06/26 16:09:37
Done.
|
| __ bind(&succeed1); |
| Label succeed2; |
| - __ testb(tmp2, Immediate(kIsInternalizedMask)); |
| - __ j(not_zero, &succeed2, Label::kNear); |
| __ cmpb(tmp2, Immediate(static_cast<uint8_t>(SYMBOL_TYPE))); |
| + __ j(equal, &succeed2, Label::kNear); |
| + __ and_(tmp2, Immediate(kIsNotStringMask | kIsInternalizedMask)); |
| + __ cmpb(tmp2, Immediate(kInternalizedTag | kStringTag)); |
| __ j(not_equal, &miss, Label::kNear); |
| __ bind(&succeed2); |
| @@ -5964,7 +5969,8 @@ void ICCompareStub::GenerateStrings(MacroAssembler* masm) { |
| __ bind(¬_same); |
| // Check that both strings are internalized strings. If they are, we're done |
| - // because we already know they are not identical. |
| + // because we already know they are not identical. We also know they are both |
| + // strings. |
| if (equality) { |
| Label do_compare; |
| STATIC_ASSERT(kInternalizedTag != 0); |
| @@ -6120,12 +6126,15 @@ void NameDictionaryLookupStub::GenerateNegativeLookup(MacroAssembler* masm, |
| // Check if the entry name is not a unique name. |
| __ movq(entity_name, FieldOperand(entity_name, HeapObject::kMapOffset)); |
| - __ testb(FieldOperand(entity_name, Map::kInstanceTypeOffset), |
| - Immediate(kIsInternalizedMask)); |
| - __ j(not_zero, &good, Label::kNear); |
| __ cmpb(FieldOperand(entity_name, Map::kInstanceTypeOffset), |
| Immediate(static_cast<uint8_t>(SYMBOL_TYPE))); |
| - __ j(not_equal, miss); |
| + __ j(equal, &good, Label::kNear); |
| + __ testb(FieldOperand(entity_name, Map::kInstanceTypeOffset), |
| + Immediate(kIsNotStringMask)); |
| + __ j(not_zero, miss); |
| + __ testb(FieldOperand(entity_name, Map::kInstanceTypeOffset), |
| + Immediate(kIsInternalizedMask)); |
| + __ j(zero, miss); |
| __ bind(&good); |
| } |
| @@ -6254,12 +6263,15 @@ void NameDictionaryLookupStub::Generate(MacroAssembler* masm) { |
| // Check if the entry name is not a unique name. |
| Label cont; |
| __ movq(scratch, FieldOperand(scratch, HeapObject::kMapOffset)); |
| - __ testb(FieldOperand(scratch, Map::kInstanceTypeOffset), |
| - Immediate(kIsInternalizedMask)); |
| - __ j(not_zero, &cont); |
| __ cmpb(FieldOperand(scratch, Map::kInstanceTypeOffset), |
| Immediate(static_cast<uint8_t>(SYMBOL_TYPE))); |
| - __ j(not_equal, &maybe_in_dictionary); |
| + __ j(equal, &cont); |
| + __ testb(FieldOperand(scratch, Map::kInstanceTypeOffset), |
| + Immediate(kIsNotStringMask)); |
| + __ j(not_zero, &maybe_in_dictionary); |
| + __ testb(FieldOperand(scratch, Map::kInstanceTypeOffset), |
| + Immediate(kIsInternalizedMask)); |
| + __ j(zero, &maybe_in_dictionary); |
|
Yang
2013/06/26 15:00:27
JumpIfNotUniqueName that I suggested above would b
mvstanton
2013/06/26 16:09:37
Done.
|
| __ bind(&cont); |
| } |
| } |