OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
140 SetFunctionPosition(function()); | 140 SetFunctionPosition(function()); |
141 Comment cmnt(masm_, "[ function compiled by full code generator"); | 141 Comment cmnt(masm_, "[ function compiled by full code generator"); |
142 | 142 |
143 #ifdef DEBUG | 143 #ifdef DEBUG |
144 if (strlen(FLAG_stop_at) > 0 && | 144 if (strlen(FLAG_stop_at) > 0 && |
145 info->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { | 145 info->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { |
146 __ stop("stop-at"); | 146 __ stop("stop-at"); |
147 } | 147 } |
148 #endif | 148 #endif |
149 | 149 |
150 // Strict mode functions need to replace the receiver with undefined | 150 // Strict mode functions and builtins need to replace the receiver |
151 // when called as functions (without an explicit receiver | 151 // with undefined when called as functions (without an explicit |
152 // object). t1 is zero for method calls and non-zero for function | 152 // receiver object). t1 is zero for method calls and non-zero for |
153 // calls. | 153 // function calls. |
154 if (info->is_strict_mode()) { | 154 if (info->is_strict_mode() || info->is_native()) { |
155 Label ok; | 155 Label ok; |
156 __ Branch(&ok, eq, t1, Operand(zero_reg)); | 156 __ Branch(&ok, eq, t1, Operand(zero_reg)); |
157 int receiver_offset = scope()->num_parameters() * kPointerSize; | 157 int receiver_offset = scope()->num_parameters() * kPointerSize; |
158 __ LoadRoot(a2, Heap::kUndefinedValueRootIndex); | 158 __ LoadRoot(a2, Heap::kUndefinedValueRootIndex); |
159 __ sw(a2, MemOperand(sp, receiver_offset)); | 159 __ sw(a2, MemOperand(sp, receiver_offset)); |
160 __ bind(&ok); | 160 __ bind(&ok); |
161 } | 161 } |
162 | 162 |
163 int locals_count = scope()->num_stack_slots(); | 163 int locals_count = scope()->num_stack_slots(); |
164 | 164 |
(...skipping 746 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
911 __ LoadRoot(at, Heap::kUndefinedValueRootIndex); | 911 __ LoadRoot(at, Heap::kUndefinedValueRootIndex); |
912 __ Branch(&exit, eq, a0, Operand(at)); | 912 __ Branch(&exit, eq, a0, Operand(at)); |
913 Register null_value = t1; | 913 Register null_value = t1; |
914 __ LoadRoot(null_value, Heap::kNullValueRootIndex); | 914 __ LoadRoot(null_value, Heap::kNullValueRootIndex); |
915 __ Branch(&exit, eq, a0, Operand(null_value)); | 915 __ Branch(&exit, eq, a0, Operand(null_value)); |
916 | 916 |
917 // Convert the object to a JS object. | 917 // Convert the object to a JS object. |
918 Label convert, done_convert; | 918 Label convert, done_convert; |
919 __ JumpIfSmi(a0, &convert); | 919 __ JumpIfSmi(a0, &convert); |
920 __ GetObjectType(a0, a1, a1); | 920 __ GetObjectType(a0, a1, a1); |
921 __ Branch(&done_convert, hs, a1, Operand(FIRST_JS_OBJECT_TYPE)); | 921 __ Branch(&done_convert, ge, a1, Operand(FIRST_SPEC_OBJECT_TYPE)); |
922 __ bind(&convert); | 922 __ bind(&convert); |
923 __ push(a0); | 923 __ push(a0); |
924 __ InvokeBuiltin(Builtins::TO_OBJECT, CALL_FUNCTION); | 924 __ InvokeBuiltin(Builtins::TO_OBJECT, CALL_FUNCTION); |
925 __ mov(a0, v0); | 925 __ mov(a0, v0); |
926 __ bind(&done_convert); | 926 __ bind(&done_convert); |
927 __ push(a0); | 927 __ push(a0); |
928 | 928 |
929 // Check cache validity in generated code. This is a fast case for | 929 // Check cache validity in generated code. This is a fast case for |
930 // the JSObject::IsSimpleEnum cache validity checks. If we cannot | 930 // the JSObject::IsSimpleEnum cache validity checks. If we cannot |
931 // guarantee cache validity, call the runtime system to check cache | 931 // guarantee cache validity, call the runtime system to check cache |
(...skipping 1371 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2303 | 2303 |
2304 // If fast case code has been generated, emit code to push the | 2304 // If fast case code has been generated, emit code to push the |
2305 // function and receiver and have the slow path jump around this | 2305 // function and receiver and have the slow path jump around this |
2306 // code. | 2306 // code. |
2307 if (done.is_linked()) { | 2307 if (done.is_linked()) { |
2308 Label call; | 2308 Label call; |
2309 __ Branch(&call); | 2309 __ Branch(&call); |
2310 __ bind(&done); | 2310 __ bind(&done); |
2311 // Push function. | 2311 // Push function. |
2312 __ push(v0); | 2312 __ push(v0); |
2313 // Push global receiver. | 2313 // The receiver is implicitly the global receiver. Indicate this |
2314 __ lw(a1, GlobalObjectOperand()); | 2314 // by passing the hole to the call function stub. |
2315 __ lw(a1, FieldMemOperand(a1, GlobalObject::kGlobalReceiverOffset)); | 2315 __ LoadRoot(a1, Heap::kTheHoleValueRootIndex); |
2316 __ push(a1); | 2316 __ push(a1); |
2317 __ bind(&call); | 2317 __ bind(&call); |
2318 } | 2318 } |
2319 | 2319 |
2320 // The receiver is either the global receiver or an object found | 2320 // The receiver is either the global receiver or an object found |
2321 // by LoadContextSlot. That object could be the hole if the | 2321 // by LoadContextSlot. That object could be the hole if the |
2322 // receiver is implicitly the global object. | 2322 // receiver is implicitly the global object. |
2323 EmitCallWithStub(expr, RECEIVER_MIGHT_BE_IMPLICIT); | 2323 EmitCallWithStub(expr, RECEIVER_MIGHT_BE_IMPLICIT); |
2324 } else if (fun->AsProperty() != NULL) { | 2324 } else if (fun->AsProperty() != NULL) { |
2325 // Call to an object property. | 2325 // Call to an object property. |
(...skipping 144 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2470 | 2470 |
2471 __ JumpIfSmi(v0, if_false); | 2471 __ JumpIfSmi(v0, if_false); |
2472 __ LoadRoot(at, Heap::kNullValueRootIndex); | 2472 __ LoadRoot(at, Heap::kNullValueRootIndex); |
2473 __ Branch(if_true, eq, v0, Operand(at)); | 2473 __ Branch(if_true, eq, v0, Operand(at)); |
2474 __ lw(a2, FieldMemOperand(v0, HeapObject::kMapOffset)); | 2474 __ lw(a2, FieldMemOperand(v0, HeapObject::kMapOffset)); |
2475 // Undetectable objects behave like undefined when tested with typeof. | 2475 // Undetectable objects behave like undefined when tested with typeof. |
2476 __ lbu(a1, FieldMemOperand(a2, Map::kBitFieldOffset)); | 2476 __ lbu(a1, FieldMemOperand(a2, Map::kBitFieldOffset)); |
2477 __ And(at, a1, Operand(1 << Map::kIsUndetectable)); | 2477 __ And(at, a1, Operand(1 << Map::kIsUndetectable)); |
2478 __ Branch(if_false, ne, at, Operand(zero_reg)); | 2478 __ Branch(if_false, ne, at, Operand(zero_reg)); |
2479 __ lbu(a1, FieldMemOperand(a2, Map::kInstanceTypeOffset)); | 2479 __ lbu(a1, FieldMemOperand(a2, Map::kInstanceTypeOffset)); |
2480 __ Branch(if_false, lt, a1, Operand(FIRST_JS_OBJECT_TYPE)); | 2480 __ Branch(if_false, lt, a1, Operand(FIRST_NONCALLABLE_SPEC_OBJECT_TYPE)); |
2481 PrepareForBailoutBeforeSplit(TOS_REG, true, if_true, if_false); | 2481 PrepareForBailoutBeforeSplit(TOS_REG, true, if_true, if_false); |
2482 Split(le, a1, Operand(LAST_JS_OBJECT_TYPE), if_true, if_false, fall_through); | 2482 Split(le, a1, Operand(LAST_NONCALLABLE_SPEC_OBJECT_TYPE), |
| 2483 if_true, if_false, fall_through); |
2483 | 2484 |
2484 context()->Plug(if_true, if_false); | 2485 context()->Plug(if_true, if_false); |
2485 } | 2486 } |
2486 | 2487 |
2487 | 2488 |
2488 void FullCodeGenerator::EmitIsSpecObject(ZoneList<Expression*>* args) { | 2489 void FullCodeGenerator::EmitIsSpecObject(ZoneList<Expression*>* args) { |
2489 ASSERT(args->length() == 1); | 2490 ASSERT(args->length() == 1); |
2490 | 2491 |
2491 VisitForAccumulatorValue(args->at(0)); | 2492 VisitForAccumulatorValue(args->at(0)); |
2492 | 2493 |
2493 Label materialize_true, materialize_false; | 2494 Label materialize_true, materialize_false; |
2494 Label* if_true = NULL; | 2495 Label* if_true = NULL; |
2495 Label* if_false = NULL; | 2496 Label* if_false = NULL; |
2496 Label* fall_through = NULL; | 2497 Label* fall_through = NULL; |
2497 context()->PrepareTest(&materialize_true, &materialize_false, | 2498 context()->PrepareTest(&materialize_true, &materialize_false, |
2498 &if_true, &if_false, &fall_through); | 2499 &if_true, &if_false, &fall_through); |
2499 | 2500 |
2500 __ JumpIfSmi(v0, if_false); | 2501 __ JumpIfSmi(v0, if_false); |
2501 __ GetObjectType(v0, a1, a1); | 2502 __ GetObjectType(v0, a1, a1); |
2502 PrepareForBailoutBeforeSplit(TOS_REG, true, if_true, if_false); | 2503 PrepareForBailoutBeforeSplit(TOS_REG, true, if_true, if_false); |
2503 Split(ge, a1, Operand(FIRST_JS_OBJECT_TYPE), | 2504 Split(ge, a1, Operand(FIRST_SPEC_OBJECT_TYPE), |
2504 if_true, if_false, fall_through); | 2505 if_true, if_false, fall_through); |
2505 | 2506 |
2506 context()->Plug(if_true, if_false); | 2507 context()->Plug(if_true, if_false); |
2507 } | 2508 } |
2508 | 2509 |
2509 | 2510 |
2510 void FullCodeGenerator::EmitIsUndetectableObject(ZoneList<Expression*>* args) { | 2511 void FullCodeGenerator::EmitIsUndetectableObject(ZoneList<Expression*>* args) { |
2511 ASSERT(args->length() == 1); | 2512 ASSERT(args->length() == 1); |
2512 | 2513 |
2513 VisitForAccumulatorValue(args->at(0)); | 2514 VisitForAccumulatorValue(args->at(0)); |
(...skipping 258 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2772 Label done, null, function, non_function_constructor; | 2773 Label done, null, function, non_function_constructor; |
2773 | 2774 |
2774 VisitForAccumulatorValue(args->at(0)); | 2775 VisitForAccumulatorValue(args->at(0)); |
2775 | 2776 |
2776 // If the object is a smi, we return null. | 2777 // If the object is a smi, we return null. |
2777 __ JumpIfSmi(v0, &null); | 2778 __ JumpIfSmi(v0, &null); |
2778 | 2779 |
2779 // Check that the object is a JS object but take special care of JS | 2780 // Check that the object is a JS object but take special care of JS |
2780 // functions to make sure they have 'Function' as their class. | 2781 // functions to make sure they have 'Function' as their class. |
2781 __ GetObjectType(v0, v0, a1); // Map is now in v0. | 2782 __ GetObjectType(v0, v0, a1); // Map is now in v0. |
2782 __ Branch(&null, lt, a1, Operand(FIRST_JS_OBJECT_TYPE)); | 2783 __ Branch(&null, lt, a1, Operand(FIRST_SPEC_OBJECT_TYPE)); |
2783 | 2784 |
2784 // As long as JS_FUNCTION_TYPE is the last instance type and it is | 2785 // As long as LAST_CALLABLE_SPEC_OBJECT_TYPE is the last instance type, and |
2785 // right after LAST_JS_OBJECT_TYPE, we can avoid checking for | 2786 // FIRST_CALLABLE_SPEC_OBJECT_TYPE comes right after |
2786 // LAST_JS_OBJECT_TYPE. | 2787 // LAST_NONCALLABLE_SPEC_OBJECT_TYPE, we can avoid checking for the latter. |
2787 ASSERT(LAST_TYPE == JS_FUNCTION_TYPE); | 2788 STATIC_ASSERT(LAST_TYPE == LAST_CALLABLE_SPEC_OBJECT_TYPE); |
2788 ASSERT(JS_FUNCTION_TYPE == LAST_JS_OBJECT_TYPE + 1); | 2789 STATIC_ASSERT(FIRST_CALLABLE_SPEC_OBJECT_TYPE == |
2789 __ Branch(&function, eq, a1, Operand(JS_FUNCTION_TYPE)); | 2790 LAST_NONCALLABLE_SPEC_OBJECT_TYPE + 1); |
| 2791 __ Branch(&function, ge, a1, Operand(FIRST_CALLABLE_SPEC_OBJECT_TYPE)); |
2790 | 2792 |
2791 // Check if the constructor in the map is a function. | 2793 // Check if the constructor in the map is a function. |
2792 __ lw(v0, FieldMemOperand(v0, Map::kConstructorOffset)); | 2794 __ lw(v0, FieldMemOperand(v0, Map::kConstructorOffset)); |
2793 __ GetObjectType(v0, a1, a1); | 2795 __ GetObjectType(v0, a1, a1); |
2794 __ Branch(&non_function_constructor, ne, a1, Operand(JS_FUNCTION_TYPE)); | 2796 __ Branch(&non_function_constructor, ne, a1, Operand(JS_FUNCTION_TYPE)); |
2795 | 2797 |
2796 // v0 now contains the constructor function. Grab the | 2798 // v0 now contains the constructor function. Grab the |
2797 // instance class name from there. | 2799 // instance class name from there. |
2798 __ lw(v0, FieldMemOperand(v0, JSFunction::kSharedFunctionInfoOffset)); | 2800 __ lw(v0, FieldMemOperand(v0, JSFunction::kSharedFunctionInfoOffset)); |
2799 __ lw(v0, FieldMemOperand(v0, SharedFunctionInfo::kInstanceClassNameOffset)); | 2801 __ lw(v0, FieldMemOperand(v0, SharedFunctionInfo::kInstanceClassNameOffset)); |
(...skipping 377 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3177 | 3179 |
3178 int arg_count = args->length() - 2; // 2 ~ receiver and function. | 3180 int arg_count = args->length() - 2; // 2 ~ receiver and function. |
3179 for (int i = 0; i < arg_count + 1; i++) { | 3181 for (int i = 0; i < arg_count + 1; i++) { |
3180 VisitForStackValue(args->at(i)); | 3182 VisitForStackValue(args->at(i)); |
3181 } | 3183 } |
3182 VisitForAccumulatorValue(args->last()); // Function. | 3184 VisitForAccumulatorValue(args->last()); // Function. |
3183 | 3185 |
3184 // InvokeFunction requires the function in a1. Move it in there. | 3186 // InvokeFunction requires the function in a1. Move it in there. |
3185 __ mov(a1, result_register()); | 3187 __ mov(a1, result_register()); |
3186 ParameterCount count(arg_count); | 3188 ParameterCount count(arg_count); |
3187 __ InvokeFunction(a1, count, CALL_FUNCTION); | 3189 __ InvokeFunction(a1, count, CALL_FUNCTION, |
| 3190 NullCallWrapper(), CALL_AS_METHOD); |
3188 __ lw(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); | 3191 __ lw(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); |
3189 context()->Plug(v0); | 3192 context()->Plug(v0); |
3190 } | 3193 } |
3191 | 3194 |
3192 | 3195 |
3193 void FullCodeGenerator::EmitRegExpConstructResult(ZoneList<Expression*>* args) { | 3196 void FullCodeGenerator::EmitRegExpConstructResult(ZoneList<Expression*>* args) { |
3194 RegExpConstructResultStub stub; | 3197 RegExpConstructResultStub stub; |
3195 ASSERT(args->length() == 3); | 3198 ASSERT(args->length() == 3); |
3196 VisitForStackValue(args->at(0)); | 3199 VisitForStackValue(args->at(0)); |
3197 VisitForStackValue(args->at(1)); | 3200 VisitForStackValue(args->at(1)); |
(...skipping 238 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3436 | 3439 |
3437 // Separator operand is on the stack. | 3440 // Separator operand is on the stack. |
3438 __ pop(separator); | 3441 __ pop(separator); |
3439 | 3442 |
3440 // Check that the array is a JSArray. | 3443 // Check that the array is a JSArray. |
3441 __ JumpIfSmi(array, &bailout); | 3444 __ JumpIfSmi(array, &bailout); |
3442 __ GetObjectType(array, scratch1, scratch2); | 3445 __ GetObjectType(array, scratch1, scratch2); |
3443 __ Branch(&bailout, ne, scratch2, Operand(JS_ARRAY_TYPE)); | 3446 __ Branch(&bailout, ne, scratch2, Operand(JS_ARRAY_TYPE)); |
3444 | 3447 |
3445 // Check that the array has fast elements. | 3448 // Check that the array has fast elements. |
3446 __ lbu(scratch2, FieldMemOperand(scratch1, Map::kBitField2Offset)); | 3449 __ CheckFastElements(scratch1, scratch2, &bailout); |
3447 __ And(scratch3, scratch2, Operand(1 << Map::kHasFastElements)); | |
3448 __ Branch(&bailout, eq, scratch3, Operand(zero_reg)); | |
3449 | 3450 |
3450 // If the array has length zero, return the empty string. | 3451 // If the array has length zero, return the empty string. |
3451 __ lw(array_length, FieldMemOperand(array, JSArray::kLengthOffset)); | 3452 __ lw(array_length, FieldMemOperand(array, JSArray::kLengthOffset)); |
3452 __ SmiUntag(array_length); | 3453 __ SmiUntag(array_length); |
3453 __ Branch(&non_trivial_array, ne, array_length, Operand(zero_reg)); | 3454 __ Branch(&non_trivial_array, ne, array_length, Operand(zero_reg)); |
3454 __ LoadRoot(v0, Heap::kEmptyStringRootIndex); | 3455 __ LoadRoot(v0, Heap::kEmptyStringRootIndex); |
3455 __ Branch(&done); | 3456 __ Branch(&done); |
3456 | 3457 |
3457 __ bind(&non_trivial_array); | 3458 __ bind(&non_trivial_array); |
3458 | 3459 |
(...skipping 631 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4090 __ Branch(if_true, eq, v0, Operand(at)); | 4091 __ Branch(if_true, eq, v0, Operand(at)); |
4091 __ JumpIfSmi(v0, if_false); | 4092 __ JumpIfSmi(v0, if_false); |
4092 // Check for undetectable objects => true. | 4093 // Check for undetectable objects => true. |
4093 __ lw(v0, FieldMemOperand(v0, HeapObject::kMapOffset)); | 4094 __ lw(v0, FieldMemOperand(v0, HeapObject::kMapOffset)); |
4094 __ lbu(a1, FieldMemOperand(v0, Map::kBitFieldOffset)); | 4095 __ lbu(a1, FieldMemOperand(v0, Map::kBitFieldOffset)); |
4095 __ And(a1, a1, Operand(1 << Map::kIsUndetectable)); | 4096 __ And(a1, a1, Operand(1 << Map::kIsUndetectable)); |
4096 Split(ne, a1, Operand(zero_reg), if_true, if_false, fall_through); | 4097 Split(ne, a1, Operand(zero_reg), if_true, if_false, fall_through); |
4097 } else if (check->Equals(isolate()->heap()->function_symbol())) { | 4098 } else if (check->Equals(isolate()->heap()->function_symbol())) { |
4098 __ JumpIfSmi(v0, if_false); | 4099 __ JumpIfSmi(v0, if_false); |
4099 __ GetObjectType(v0, a1, v0); // Leave map in a1. | 4100 __ GetObjectType(v0, a1, v0); // Leave map in a1. |
4100 Split(ge, v0, Operand(FIRST_FUNCTION_CLASS_TYPE), | 4101 Split(ge, v0, Operand(FIRST_CALLABLE_SPEC_OBJECT_TYPE), |
4101 if_true, if_false, fall_through); | 4102 if_true, if_false, fall_through); |
4102 | 4103 |
4103 } else if (check->Equals(isolate()->heap()->object_symbol())) { | 4104 } else if (check->Equals(isolate()->heap()->object_symbol())) { |
4104 __ JumpIfSmi(v0, if_false); | 4105 __ JumpIfSmi(v0, if_false); |
4105 __ LoadRoot(at, Heap::kNullValueRootIndex); | 4106 __ LoadRoot(at, Heap::kNullValueRootIndex); |
4106 __ Branch(if_true, eq, v0, Operand(at)); | 4107 __ Branch(if_true, eq, v0, Operand(at)); |
4107 // Check for JS objects => true. | 4108 // Check for JS objects => true. |
4108 __ GetObjectType(v0, v0, a1); | 4109 __ GetObjectType(v0, v0, a1); |
4109 __ Branch(if_false, lo, a1, Operand(FIRST_JS_OBJECT_TYPE)); | 4110 __ Branch(if_false, lt, a1, Operand(FIRST_NONCALLABLE_SPEC_OBJECT_TYPE)); |
4110 __ lbu(a1, FieldMemOperand(v0, Map::kInstanceTypeOffset)); | 4111 __ lbu(a1, FieldMemOperand(v0, Map::kInstanceTypeOffset)); |
4111 __ Branch(if_false, hs, a1, Operand(FIRST_FUNCTION_CLASS_TYPE)); | 4112 __ Branch(if_false, gt, a1, Operand(LAST_NONCALLABLE_SPEC_OBJECT_TYPE)); |
4112 // Check for undetectable objects => false. | 4113 // Check for undetectable objects => false. |
4113 __ lbu(a1, FieldMemOperand(v0, Map::kBitFieldOffset)); | 4114 __ lbu(a1, FieldMemOperand(v0, Map::kBitFieldOffset)); |
4114 __ And(a1, a1, Operand(1 << Map::kIsUndetectable)); | 4115 __ And(a1, a1, Operand(1 << Map::kIsUndetectable)); |
4115 Split(eq, a1, Operand(zero_reg), if_true, if_false, fall_through); | 4116 Split(eq, a1, Operand(zero_reg), if_true, if_false, fall_through); |
4116 } else { | 4117 } else { |
4117 if (if_false != fall_through) __ jmp(if_false); | 4118 if (if_false != fall_through) __ jmp(if_false); |
4118 } | 4119 } |
4119 | 4120 |
4120 return true; | 4121 return true; |
4121 } | 4122 } |
(...skipping 257 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4379 __ Addu(at, a1, Operand(masm_->CodeObject())); | 4380 __ Addu(at, a1, Operand(masm_->CodeObject())); |
4380 __ Jump(at); | 4381 __ Jump(at); |
4381 } | 4382 } |
4382 | 4383 |
4383 | 4384 |
4384 #undef __ | 4385 #undef __ |
4385 | 4386 |
4386 } } // namespace v8::internal | 4387 } } // namespace v8::internal |
4387 | 4388 |
4388 #endif // V8_TARGET_ARCH_MIPS | 4389 #endif // V8_TARGET_ARCH_MIPS |
OLD | NEW |