| 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 1535 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1546 Register key = x1; | 1546 Register key = x1; |
| 1547 Register receiver = x2; | 1547 Register receiver = x2; |
| 1548 Register receiver_map = x3; | 1548 Register receiver_map = x3; |
| 1549 Register elements = x4; | 1549 Register elements = x4; |
| 1550 Register elements_map = x5; | 1550 Register elements_map = x5; |
| 1551 | 1551 |
| 1552 __ JumpIfNotSmi(key, &slow); | 1552 __ JumpIfNotSmi(key, &slow); |
| 1553 __ JumpIfSmi(receiver, &slow); | 1553 __ JumpIfSmi(receiver, &slow); |
| 1554 __ Ldr(receiver_map, FieldMemOperand(receiver, HeapObject::kMapOffset)); | 1554 __ Ldr(receiver_map, FieldMemOperand(receiver, HeapObject::kMapOffset)); |
| 1555 | 1555 |
| 1556 // Check that the receiver does not require access checks. We need to do this | 1556 // Check that the receiver does not require access checks and is not observed. |
| 1557 // because this generic stub does not perform map checks. | 1557 // The generic stub does not perform map checks or handle observed objects. |
| 1558 __ Ldrb(x10, FieldMemOperand(receiver_map, Map::kBitFieldOffset)); | 1558 __ Ldrb(x10, FieldMemOperand(receiver_map, Map::kBitFieldOffset)); |
| 1559 __ Tbnz(x10, Map::kIsAccessCheckNeeded, &slow); | 1559 __ TestAndBranchIfAnySet( |
| 1560 x10, (1 << Map::kIsAccessCheckNeeded) | (1 << Map::kIsObserved), &slow); |
| 1560 | 1561 |
| 1561 // Check if the object is a JS array or not. | 1562 // Check if the object is a JS array or not. |
| 1562 Register instance_type = x10; | 1563 Register instance_type = x10; |
| 1563 __ CompareInstanceType(receiver_map, instance_type, JS_ARRAY_TYPE); | 1564 __ CompareInstanceType(receiver_map, instance_type, JS_ARRAY_TYPE); |
| 1564 __ B(eq, &array); | 1565 __ B(eq, &array); |
| 1565 // Check that the object is some kind of JSObject. | 1566 // Check that the object is some kind of JSObject. |
| 1566 __ Cmp(instance_type, FIRST_JS_OBJECT_TYPE); | 1567 __ Cmp(instance_type, FIRST_JS_OBJECT_TYPE); |
| 1567 __ B(lt, &slow); | 1568 __ B(lt, &slow); |
| 1568 | 1569 |
| 1569 // Object case: Check key against length in the elements array. | 1570 // Object case: Check key against length in the elements array. |
| (...skipping 251 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1821 ASSERT(to_patch->Mask(TestBranchMask) == TBNZ); | 1822 ASSERT(to_patch->Mask(TestBranchMask) == TBNZ); |
| 1822 // This is JumpIfSmi(smi_reg, branch_imm). | 1823 // This is JumpIfSmi(smi_reg, branch_imm). |
| 1823 patcher.tbz(smi_reg, 0, branch_imm); | 1824 patcher.tbz(smi_reg, 0, branch_imm); |
| 1824 } | 1825 } |
| 1825 } | 1826 } |
| 1826 | 1827 |
| 1827 | 1828 |
| 1828 } } // namespace v8::internal | 1829 } } // namespace v8::internal |
| 1829 | 1830 |
| 1830 #endif // V8_TARGET_ARCH_A64 | 1831 #endif // V8_TARGET_ARCH_A64 |
| OLD | NEW |