| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 313 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 324 | 324 |
| 325 // Is the string an array index with cached numeric value? | 325 // Is the string an array index with cached numeric value? |
| 326 __ Ldr(hash_scratch.W(), FieldMemOperand(key, Name::kHashFieldOffset)); | 326 __ Ldr(hash_scratch.W(), FieldMemOperand(key, Name::kHashFieldOffset)); |
| 327 __ TestAndBranchIfAllClear(hash_scratch, | 327 __ TestAndBranchIfAllClear(hash_scratch, |
| 328 Name::kContainsCachedArrayIndexMask, | 328 Name::kContainsCachedArrayIndexMask, |
| 329 index_string); | 329 index_string); |
| 330 | 330 |
| 331 // Is the string internalized? We know it's a string, so a single bit test is | 331 // Is the string internalized? We know it's a string, so a single bit test is |
| 332 // enough. | 332 // enough. |
| 333 __ Ldrb(hash_scratch, FieldMemOperand(map_scratch, Map::kInstanceTypeOffset)); | 333 __ Ldrb(hash_scratch, FieldMemOperand(map_scratch, Map::kInstanceTypeOffset)); |
| 334 STATIC_ASSERT(kInternalizedTag != 0); | 334 STATIC_ASSERT(kInternalizedTag == 0); |
| 335 __ TestAndBranchIfAllClear(hash_scratch, kIsInternalizedMask, | 335 __ TestAndBranchIfAnySet(hash_scratch, kIsNotInternalizedMask, not_unique); |
| 336 not_unique); | |
| 337 | 336 |
| 338 __ Bind(&unique); | 337 __ Bind(&unique); |
| 339 // Fall through if the key is a unique name. | 338 // Fall through if the key is a unique name. |
| 340 } | 339 } |
| 341 | 340 |
| 342 | 341 |
| 343 // Neither 'object' nor 'key' are modified by this function. | 342 // Neither 'object' nor 'key' are modified by this function. |
| 344 // | 343 // |
| 345 // If the 'unmapped_case' or 'slow_case' exit is taken, the 'map' register is | 344 // If the 'unmapped_case' or 'slow_case' exit is taken, the 'map' register is |
| 346 // left with the object's elements map. Otherwise, it is used as a scratch | 345 // left with the object's elements map. Otherwise, it is used as a scratch |
| (...skipping 1503 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1850 ASSERT(to_patch->Mask(TestBranchMask) == TBNZ); | 1849 ASSERT(to_patch->Mask(TestBranchMask) == TBNZ); |
| 1851 // This is JumpIfSmi(smi_reg, branch_imm). | 1850 // This is JumpIfSmi(smi_reg, branch_imm). |
| 1852 patcher.tbz(smi_reg, 0, branch_imm); | 1851 patcher.tbz(smi_reg, 0, branch_imm); |
| 1853 } | 1852 } |
| 1854 } | 1853 } |
| 1855 | 1854 |
| 1856 | 1855 |
| 1857 } } // namespace v8::internal | 1856 } } // namespace v8::internal |
| 1858 | 1857 |
| 1859 #endif // V8_TARGET_ARCH_A64 | 1858 #endif // V8_TARGET_ARCH_A64 |
| OLD | NEW |