OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 2291 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2302 // Grab the current frame's height for the break and continue | 2302 // Grab the current frame's height for the break and continue |
2303 // targets only after all the state is pushed on the frame. | 2303 // targets only after all the state is pushed on the frame. |
2304 node->break_target()->SetExpectedHeight(); | 2304 node->break_target()->SetExpectedHeight(); |
2305 node->continue_target()->SetExpectedHeight(); | 2305 node->continue_target()->SetExpectedHeight(); |
2306 | 2306 |
2307 // Load the current count to r0, load the length to r1. | 2307 // Load the current count to r0, load the length to r1. |
2308 __ ldrd(r0, frame_->ElementAt(0)); | 2308 __ ldrd(r0, frame_->ElementAt(0)); |
2309 __ cmp(r0, r1); // compare to the array length | 2309 __ cmp(r0, r1); // compare to the array length |
2310 node->break_target()->Branch(hs); | 2310 node->break_target()->Branch(hs); |
2311 | 2311 |
2312 __ ldr(r0, frame_->ElementAt(0)); | |
2313 | |
2314 // Get the i'th entry of the array. | 2312 // Get the i'th entry of the array. |
2315 __ ldr(r2, frame_->ElementAt(2)); | 2313 __ ldr(r2, frame_->ElementAt(2)); |
2316 __ add(r2, r2, Operand(FixedArray::kHeaderSize - kHeapObjectTag)); | 2314 __ add(r2, r2, Operand(FixedArray::kHeaderSize - kHeapObjectTag)); |
2317 __ ldr(r3, MemOperand(r2, r0, LSL, kPointerSizeLog2 - kSmiTagSize)); | 2315 __ ldr(r3, MemOperand(r2, r0, LSL, kPointerSizeLog2 - kSmiTagSize)); |
2318 | 2316 |
2319 // Get Map or 0. | 2317 // Get Map or 0. |
2320 __ ldr(r2, frame_->ElementAt(3)); | 2318 __ ldr(r2, frame_->ElementAt(3)); |
2321 // Check if this (still) matches the map of the enumerable. | 2319 // Check if this (still) matches the map of the enumerable. |
2322 // If not, we have to filter the key. | 2320 // If not, we have to filter the key. |
2323 __ ldr(r1, frame_->ElementAt(4)); | 2321 __ ldr(r1, frame_->ElementAt(4)); |
(...skipping 1881 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4205 false_target()->Branch(eq); | 4203 false_target()->Branch(eq); |
4206 | 4204 |
4207 __ LoadRoot(ip, Heap::kNullValueRootIndex); | 4205 __ LoadRoot(ip, Heap::kNullValueRootIndex); |
4208 __ cmp(r1, ip); | 4206 __ cmp(r1, ip); |
4209 true_target()->Branch(eq); | 4207 true_target()->Branch(eq); |
4210 | 4208 |
4211 Register map_reg = r2; | 4209 Register map_reg = r2; |
4212 __ ldr(map_reg, FieldMemOperand(r1, HeapObject::kMapOffset)); | 4210 __ ldr(map_reg, FieldMemOperand(r1, HeapObject::kMapOffset)); |
4213 // Undetectable objects behave like undefined when tested with typeof. | 4211 // Undetectable objects behave like undefined when tested with typeof. |
4214 __ ldrb(r1, FieldMemOperand(map_reg, Map::kBitFieldOffset)); | 4212 __ ldrb(r1, FieldMemOperand(map_reg, Map::kBitFieldOffset)); |
4215 __ and_(r1, r1, Operand(1 << Map::kIsUndetectable)); | 4213 __ tst(r1, Operand(1 << Map::kIsUndetectable)); |
4216 __ cmp(r1, Operand(1 << Map::kIsUndetectable)); | 4214 false_target()->Branch(ne); |
4217 false_target()->Branch(eq); | |
4218 | 4215 |
4219 __ ldrb(r1, FieldMemOperand(map_reg, Map::kInstanceTypeOffset)); | 4216 __ ldrb(r1, FieldMemOperand(map_reg, Map::kInstanceTypeOffset)); |
4220 __ cmp(r1, Operand(FIRST_JS_OBJECT_TYPE)); | 4217 __ cmp(r1, Operand(FIRST_JS_OBJECT_TYPE)); |
4221 false_target()->Branch(lt); | 4218 false_target()->Branch(lt); |
4222 __ cmp(r1, Operand(LAST_JS_OBJECT_TYPE)); | 4219 __ cmp(r1, Operand(LAST_JS_OBJECT_TYPE)); |
4223 cc_reg_ = le; | 4220 cc_reg_ = le; |
4224 } | 4221 } |
4225 | 4222 |
4226 | 4223 |
4227 void CodeGenerator::GenerateIsFunction(ZoneList<Expression*>* args) { | 4224 void CodeGenerator::GenerateIsFunction(ZoneList<Expression*>* args) { |
(...skipping 5810 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
10038 __ bind(&string_add_runtime); | 10035 __ bind(&string_add_runtime); |
10039 __ TailCallRuntime(Runtime::kStringAdd, 2, 1); | 10036 __ TailCallRuntime(Runtime::kStringAdd, 2, 1); |
10040 } | 10037 } |
10041 | 10038 |
10042 | 10039 |
10043 #undef __ | 10040 #undef __ |
10044 | 10041 |
10045 } } // namespace v8::internal | 10042 } } // namespace v8::internal |
10046 | 10043 |
10047 #endif // V8_TARGET_ARCH_ARM | 10044 #endif // V8_TARGET_ARCH_ARM |
OLD | NEW |