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 1343 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1354 __ Ret(); | 1354 __ Ret(); |
1355 | 1355 |
1356 __ bind(fast_double); | 1356 __ bind(fast_double); |
1357 if (check_map == kCheckMap) { | 1357 if (check_map == kCheckMap) { |
1358 // Check for fast double array case. If this fails, call through to the | 1358 // Check for fast double array case. If this fails, call through to the |
1359 // runtime. | 1359 // runtime. |
1360 __ CompareRoot(elements_map, Heap::kFixedDoubleArrayMapRootIndex); | 1360 __ CompareRoot(elements_map, Heap::kFixedDoubleArrayMapRootIndex); |
1361 __ b(ne, slow); | 1361 __ b(ne, slow); |
1362 } | 1362 } |
1363 __ bind(&fast_double_without_map_check); | 1363 __ bind(&fast_double_without_map_check); |
1364 __ StoreNumberToDoubleElements(value, key, elements, r3, | 1364 __ StoreNumberToDoubleElements(value, key, elements, r3, d0, |
1365 &transition_double_elements); | 1365 &transition_double_elements); |
1366 if (increment_length == kIncrementLength) { | 1366 if (increment_length == kIncrementLength) { |
1367 // Add 1 to receiver->length. | 1367 // Add 1 to receiver->length. |
1368 __ add(scratch_value, key, Operand(Smi::FromInt(1))); | 1368 __ add(scratch_value, key, Operand(Smi::FromInt(1))); |
1369 __ str(scratch_value, FieldMemOperand(receiver, JSArray::kLengthOffset)); | 1369 __ str(scratch_value, FieldMemOperand(receiver, JSArray::kLengthOffset)); |
1370 } | 1370 } |
1371 __ Ret(); | 1371 __ Ret(); |
1372 | 1372 |
1373 __ bind(&transition_smi_elements); | 1373 __ bind(&transition_smi_elements); |
1374 // Transition the array appropriately depending on the value type. | 1374 // Transition the array appropriately depending on the value type. |
(...skipping 323 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1698 } else { | 1698 } else { |
1699 ASSERT(Assembler::GetCondition(branch_instr) == ne); | 1699 ASSERT(Assembler::GetCondition(branch_instr) == ne); |
1700 patcher.EmitCondition(eq); | 1700 patcher.EmitCondition(eq); |
1701 } | 1701 } |
1702 } | 1702 } |
1703 | 1703 |
1704 | 1704 |
1705 } } // namespace v8::internal | 1705 } } // namespace v8::internal |
1706 | 1706 |
1707 #endif // V8_TARGET_ARCH_ARM | 1707 #endif // V8_TARGET_ARCH_ARM |
OLD | NEW |