| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/crankshaft/arm/lithium-codegen-arm.h" | 5 #include "src/crankshaft/arm/lithium-codegen-arm.h" |
| 6 | 6 |
| 7 #include "src/base/bits.h" | 7 #include "src/base/bits.h" |
| 8 #include "src/code-factory.h" | 8 #include "src/code-factory.h" |
| 9 #include "src/code-stubs.h" | 9 #include "src/code-stubs.h" |
| 10 #include "src/crankshaft/arm/lithium-gap-resolver-arm.h" | 10 #include "src/crankshaft/arm/lithium-gap-resolver-arm.h" |
| (...skipping 2508 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2519 // Deoptimize if the object needs to be access checked. | 2519 // Deoptimize if the object needs to be access checked. |
| 2520 __ ldrb(object_instance_type, | 2520 __ ldrb(object_instance_type, |
| 2521 FieldMemOperand(object_map, Map::kBitFieldOffset)); | 2521 FieldMemOperand(object_map, Map::kBitFieldOffset)); |
| 2522 __ tst(object_instance_type, Operand(1 << Map::kIsAccessCheckNeeded)); | 2522 __ tst(object_instance_type, Operand(1 << Map::kIsAccessCheckNeeded)); |
| 2523 DeoptimizeIf(ne, instr, Deoptimizer::kAccessCheck); | 2523 DeoptimizeIf(ne, instr, Deoptimizer::kAccessCheck); |
| 2524 // Deoptimize for proxies. | 2524 // Deoptimize for proxies. |
| 2525 __ CompareInstanceType(object_map, object_instance_type, JS_PROXY_TYPE); | 2525 __ CompareInstanceType(object_map, object_instance_type, JS_PROXY_TYPE); |
| 2526 DeoptimizeIf(eq, instr, Deoptimizer::kProxy); | 2526 DeoptimizeIf(eq, instr, Deoptimizer::kProxy); |
| 2527 | 2527 |
| 2528 __ ldr(object_prototype, FieldMemOperand(object_map, Map::kPrototypeOffset)); | 2528 __ ldr(object_prototype, FieldMemOperand(object_map, Map::kPrototypeOffset)); |
| 2529 __ CompareRoot(object_prototype, Heap::kNullValueRootIndex); |
| 2530 EmitFalseBranch(instr, eq); |
| 2529 __ cmp(object_prototype, prototype); | 2531 __ cmp(object_prototype, prototype); |
| 2530 EmitTrueBranch(instr, eq); | 2532 EmitTrueBranch(instr, eq); |
| 2531 __ CompareRoot(object_prototype, Heap::kNullValueRootIndex); | |
| 2532 EmitFalseBranch(instr, eq); | |
| 2533 __ ldr(object_map, FieldMemOperand(object_prototype, HeapObject::kMapOffset)); | 2533 __ ldr(object_map, FieldMemOperand(object_prototype, HeapObject::kMapOffset)); |
| 2534 __ b(&loop); | 2534 __ b(&loop); |
| 2535 } | 2535 } |
| 2536 | 2536 |
| 2537 | 2537 |
| 2538 void LCodeGen::DoCmpT(LCmpT* instr) { | 2538 void LCodeGen::DoCmpT(LCmpT* instr) { |
| 2539 DCHECK(ToRegister(instr->context()).is(cp)); | 2539 DCHECK(ToRegister(instr->context()).is(cp)); |
| 2540 Token::Value op = instr->op(); | 2540 Token::Value op = instr->op(); |
| 2541 | 2541 |
| 2542 Handle<Code> ic = CodeFactory::CompareIC(isolate(), op).code(); | 2542 Handle<Code> ic = CodeFactory::CompareIC(isolate(), op).code(); |
| (...skipping 3017 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5560 __ ldr(result, FieldMemOperand(scratch, | 5560 __ ldr(result, FieldMemOperand(scratch, |
| 5561 FixedArray::kHeaderSize - kPointerSize)); | 5561 FixedArray::kHeaderSize - kPointerSize)); |
| 5562 __ bind(deferred->exit()); | 5562 __ bind(deferred->exit()); |
| 5563 __ bind(&done); | 5563 __ bind(&done); |
| 5564 } | 5564 } |
| 5565 | 5565 |
| 5566 #undef __ | 5566 #undef __ |
| 5567 | 5567 |
| 5568 } // namespace internal | 5568 } // namespace internal |
| 5569 } // namespace v8 | 5569 } // namespace v8 |
| OLD | NEW |