| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 1322 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1333 __ Ret(); | 1333 __ Ret(); |
| 1334 | 1334 |
| 1335 __ bind(fast_double); | 1335 __ bind(fast_double); |
| 1336 if (check_map == kCheckMap) { | 1336 if (check_map == kCheckMap) { |
| 1337 // Check for fast double array case. If this fails, call through to the | 1337 // Check for fast double array case. If this fails, call through to the |
| 1338 // runtime. | 1338 // runtime. |
| 1339 __ CompareRoot(elements_map, Heap::kFixedDoubleArrayMapRootIndex); | 1339 __ CompareRoot(elements_map, Heap::kFixedDoubleArrayMapRootIndex); |
| 1340 __ b(ne, slow); | 1340 __ b(ne, slow); |
| 1341 } | 1341 } |
| 1342 __ bind(&fast_double_without_map_check); | 1342 __ bind(&fast_double_without_map_check); |
| 1343 __ StoreNumberToDoubleElements(value, | 1343 __ StoreNumberToDoubleElements(value, key, elements, r3, |
| 1344 key, | |
| 1345 elements, // Overwritten. | |
| 1346 r3, // Scratch regs... | |
| 1347 r4, | |
| 1348 r5, | |
| 1349 r6, | |
| 1350 &transition_double_elements); | 1344 &transition_double_elements); |
| 1351 if (increment_length == kIncrementLength) { | 1345 if (increment_length == kIncrementLength) { |
| 1352 // Add 1 to receiver->length. | 1346 // Add 1 to receiver->length. |
| 1353 __ add(scratch_value, key, Operand(Smi::FromInt(1))); | 1347 __ add(scratch_value, key, Operand(Smi::FromInt(1))); |
| 1354 __ str(scratch_value, FieldMemOperand(receiver, JSArray::kLengthOffset)); | 1348 __ str(scratch_value, FieldMemOperand(receiver, JSArray::kLengthOffset)); |
| 1355 } | 1349 } |
| 1356 __ Ret(); | 1350 __ Ret(); |
| 1357 | 1351 |
| 1358 __ bind(&transition_smi_elements); | 1352 __ bind(&transition_smi_elements); |
| 1359 // Transition the array appropriately depending on the value type. | 1353 // Transition the array appropriately depending on the value type. |
| (...skipping 322 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1682 } else { | 1676 } else { |
| 1683 ASSERT(Assembler::GetCondition(branch_instr) == ne); | 1677 ASSERT(Assembler::GetCondition(branch_instr) == ne); |
| 1684 patcher.EmitCondition(eq); | 1678 patcher.EmitCondition(eq); |
| 1685 } | 1679 } |
| 1686 } | 1680 } |
| 1687 | 1681 |
| 1688 | 1682 |
| 1689 } } // namespace v8::internal | 1683 } } // namespace v8::internal |
| 1690 | 1684 |
| 1691 #endif // V8_TARGET_ARCH_ARM | 1685 #endif // V8_TARGET_ARCH_ARM |
| OLD | NEW |