Lines Matching refs:Operand
121 __ Subu(sp, sp, Operand(param_count * kPointerSize));
177 __ Branch(&error, ne, scratch, Operand(zero_reg));
202 __ Branch(&done, eq, scratch, Operand(zero_reg));
207 Operand(HeapNumber::kExponentBias + HeapNumber::kMantissaBits + 31));
211 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg));
218 __ Addu(scratch, result_reg, Operand(kShiftBase + HeapNumber::kMantissaBits));
223 __ And(sign, input_high, Operand(HeapNumber::kSignMask));
228 __ Branch(&high_shift_needed, lt, scratch, Operand(32));
236 Operand(1 << HeapNumber::kMantissaBitsInTopWord));
248 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg));
259 __ Or(input_high, input_high, Operand(input_low));
283 __ Branch(¬_identical, ne, a0, Operand(a1));
285 __ li(exp_mask_reg, Operand(HeapNumber::kExponentMask));
294 __ Branch(slow, greater, t4, Operand(FIRST_JS_RECEIVER_TYPE));
296 __ Branch(slow, eq, t4, Operand(SYMBOL_TYPE));
298 __ Branch(slow, eq, t4, Operand(SIMD128_VALUE_TYPE));
302 __ Branch(&return_equal, eq, t4, Operand(HEAP_NUMBER_TYPE));
303 __ And(t4, t4, Operand(kIsNotStringMask));
304 __ Branch(slow, ne, t4, Operand(zero_reg));
307 __ Branch(&heap_number, eq, t4, Operand(HEAP_NUMBER_TYPE));
310 __ Branch(slow, greater, t4, Operand(FIRST_JS_RECEIVER_TYPE));
312 __ Branch(slow, eq, t4, Operand(SYMBOL_TYPE));
314 __ Branch(slow, eq, t4, Operand(SIMD128_VALUE_TYPE));
319 __ And(t4, t4, Operand(kIsNotStringMask));
320 __ Branch(slow, ne, t4, Operand(zero_reg));
326 __ Branch(&return_equal, ne, t4, Operand(ODDBALL_TYPE));
328 __ Branch(&return_equal, ne, a0, Operand(t2));
333 __ li(v0, Operand(GREATER));
336 __ li(v0, Operand(LESS));
346 __ li(v0, Operand(GREATER)); // Things aren't less than themselves.
348 __ li(v0, Operand(LESS)); // Things aren't greater than themselves.
366 __ And(t3, t2, Operand(exp_mask_reg));
368 __ Branch(&return_equal, ne, t3, Operand(exp_mask_reg));
374 __ Or(v0, t3, Operand(t2));
381 __ Ret(eq, v0, Operand(zero_reg));
385 __ li(v0, Operand(GREATER)); // NaN <= NaN should fail.
387 __ li(v0, Operand(LESS)); // NaN >= NaN should fail.
414 __ Ret(USE_DELAY_SLOT, ne, t4, Operand(HEAP_NUMBER_TYPE));
419 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
438 __ Ret(USE_DELAY_SLOT, ne, t4, Operand(HEAP_NUMBER_TYPE));
439 __ li(v0, Operand(1));
443 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
459 // If either operand is a JS object or an oddball value, then they are
464 // Get the type of the first operand into a2 and compare it with
467 __ Branch(&first_non_object, less, a2, Operand(FIRST_JS_RECEIVER_TYPE));
473 __ li(v0, Operand(1));
477 __ Branch(&return_not_equal, eq, a2, Operand(ODDBALL_TYPE));
480 __ Branch(&return_not_equal, greater, a3, Operand(FIRST_JS_RECEIVER_TYPE));
483 __ Branch(&return_not_equal, eq, a3, Operand(ODDBALL_TYPE));
488 __ Or(a2, a2, Operand(a3));
489 __ And(at, a2, Operand(kIsNotStringMask | kIsNotInternalizedMask));
490 __ Branch(&return_not_equal, eq, at, Operand(zero_reg));
501 __ Branch(not_heap_numbers, ne, a2, Operand(HEAP_NUMBER_TYPE));
504 __ Branch(slow, ne, a3, Operand(a2));
527 __ And(at, a2, Operand(kIsNotStringMask));
528 __ Branch(&object_test, ne, at, Operand(zero_reg));
529 __ And(at, a2, Operand(kIsNotInternalizedMask));
530 __ Branch(possible_strings, ne, at, Operand(zero_reg));
532 __ Branch(not_both_strings, ge, a3, Operand(FIRST_NONSTRING_TYPE));
533 __ And(at, a3, Operand(kIsNotInternalizedMask));
534 __ Branch(possible_strings, ne, at, Operand(zero_reg));
539 __ li(v0, Operand(1)); // Non-zero indicates not equal.
542 __ Branch(not_both_strings, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
544 __ Branch(not_both_strings, lt, a3, Operand(FIRST_JS_RECEIVER_TYPE));
553 __ And(a0, a0, Operand(1 << Map::kIsUndetectable));
602 // it is certain that at least one operand isn't a smi.
612 __ And(t2, lhs, Operand(rhs));
614 // One operand is a smi. EmitSmiNonsmiComparison generates code that can:
630 __ li(t0, Operand(LESS));
631 __ li(t1, Operand(GREATER));
632 __ li(t2, Operand(EQUAL));
670 __ li(v0, Operand(GREATER));
672 __ li(v0, Operand(LESS));
740 __ li(a0, Operand(Smi::FromInt(ncr)));
784 __ li(a0, Operand(ExternalReference::isolate_address(isolate())));
824 __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
837 __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
859 __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
941 __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
950 __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
956 __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
963 __ Branch(&done, ge, exponent, Operand(zero_reg));
1102 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
1141 __ Branch(&exception_returned, eq, t0, Operand(v0));
1149 __ li(a2, Operand(pending_exception_address));
1153 __ Branch(&okay, eq, t0, Operand(a2));
1195 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
1200 __ li(cp, Operand(pending_handler_context_address));
1202 __ li(sp, Operand(pending_handler_sp_address));
1204 __ li(fp, Operand(pending_handler_fp_address));
1210 __ Branch(&zero, eq, cp, Operand(zero_reg));
1215 __ li(a1, Operand(pending_handler_code_address));
1217 __ li(a2, Operand(pending_handler_offset_address));
1219 __ Addu(a1, a1, Operand(Code::kHeaderSize - kHeapObjectTag));
1258 __ li(t3, Operand(-1)); // Push a bad frame pointer to fail if it is used.
1260 __ li(t2, Operand(Smi::FromInt(marker)));
1261 __ li(t1, Operand(Smi::FromInt(marker)));
1262 __ li(t0, Operand(ExternalReference(Isolate::kCEntryFPAddress,
1288 __ li(t1, Operand(ExternalReference(js_entry_sp)));
1290 __ Branch(&non_outermost_js, ne, t2, Operand(zero_reg));
1292 __ li(t0, Operand(Smi::FromInt(StackFrame::OUTERMOST_JSENTRY_FRAME)));
1297 __ li(t0, Operand(Smi::FromInt(StackFrame::INNER_JSENTRY_FRAME)));
1310 __ li(t0, Operand(ExternalReference(Isolate::kPendingExceptionAddress,
1327 __ li(t0, Operand(ExternalReference(Isolate::kPendingExceptionAddress,
1352 __ li(t0, Operand(construct_entry));
1355 __ li(t0, Operand(entry));
1373 Operand(Smi::FromInt(StackFrame::OUTERMOST_JSENTRY_FRAME)));
1374 __ li(t1, Operand(ExternalReference(js_entry_sp)));
1380 __ li(t0, Operand
1447 __ Branch(&fast_case, ne, function, Operand(at));
1449 __ Branch(&fast_case, ne, object_map, Operand(at));
1458 __ Branch(&slow_case, ne, scratch, Operand(JS_FUNCTION_TYPE));
1466 __ Branch(&slow_case, ne, scratch, Operand(JS_FUNCTION_TYPE));
1470 __ And(at, scratch, Operand(1 << Map::kHasNonInstancePrototype));
1471 __ Branch(&slow_case, ne, at, Operand(zero_reg));
1484 __ Branch(&function_prototype_valid, ne, scratch, Operand(MAP_TYPE));
1509 __ And(map_bit_field, map_bit_field, Operand(1 << Map::kIsAccessCheckNeeded));
1510 __ Branch(&fast_runtime_fallback, ne, map_bit_field, Operand(zero_reg));
1515 Operand(JS_PROXY_TYPE));
1518 __ Branch(&done, eq, object, Operand(function_prototype));
1519 __ Branch(USE_DELAY_SLOT, &loop, ne, object, Operand(null));
1578 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1583 __ Branch(&slow, hs, a1, Operand(a0));
1588 __ Addu(a3, fp, Operand(t3));
1597 __ Branch(&slow, Ugreater_equal, a1, Operand(a0));
1602 __ Addu(a3, a2, Operand(t3));
1628 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1633 __ Addu(t0, t0, Operand(t3));
1659 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1670 __ Addu(t0, t0, Operand(t6));
1671 __ Addu(a3, t0, Operand(StandardFrameConstants::kCallerSPOffset));
1677 __ Branch(&try_allocate, le, t2, Operand(t1));
1689 __ Branch(USE_DELAY_SLOT, ¶m_map_size, eq, t2, Operand(zero_reg));
1697 __ Addu(t5, t5, Operand(t6));
1698 __ Addu(t5, t5, Operand(FixedArray::kHeaderSize));
1701 __ Addu(t5, t5, Operand(Heap::kSloppyArgumentsObjectSize));
1716 __ Branch(&skip2_ne, ne, t2, Operand(zero_reg));
1720 __ Branch(&skip2_eq, eq, t2, Operand(zero_reg));
1750 __ Addu(t0, v0, Operand(Heap::kSloppyArgumentsObjectSize));
1760 __ Branch(&skip3, ne, t2, Operand(Smi::FromInt(0)));
1766 __ Branch(&skip_parameter_map, eq, t2, Operand(Smi::FromInt(0)));
1770 __ Addu(t1, t2, Operand(Smi::FromInt(2)));
1774 __ Addu(t1, t0, Operand(t6));
1775 __ Addu(t1, t1, Operand(kParameterMapHeaderSize));
1788 __ Addu(t5, a2, Operand(Smi::FromInt(Context::MIN_CONTEXT_SLOTS)));
1789 __ Subu(t5, t5, Operand(t2));
1792 __ Addu(a1, t0, Operand(t6));
1793 __ Addu(a1, a1, Operand(kParameterMapHeaderSize));
1803 __ Subu(t1, t1, Operand(Smi::FromInt(1)));
1805 __ Addu(a0, a0, Operand(kParameterMapHeaderSize - kHeapObjectTag));
1808 __ Subu(a0, a0, Operand(kParameterMapHeaderSize - FixedArray::kHeaderSize));
1811 __ Addu(t5, t5, Operand(Smi::FromInt(1)));
1813 __ Branch(¶meters_loop, ne, t1, Operand(Smi::FromInt(0)));
1831 __ Subu(a3, a3, Operand(t6));
1835 __ Subu(a3, a3, Operand(kPointerSize));
1838 __ Addu(t5, a1, Operand(t6));
1840 __ Addu(t2, t2, Operand(Smi::FromInt(1)));
1843 __ Branch(&arguments_loop, lt, t2, Operand(t1));
1864 __ And(t0, key, Operand(kSmiTagMask | kSmiSignMask));
1865 __ Branch(&slow, ne, t0, Operand(zero_reg));
1893 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1898 __ Addu(t0, t0, Operand(at));
1899 __ Addu(a3, t0, Operand(StandardFrameConstants::kCallerSPOffset));
1906 __ Branch(&add_arguments_object, eq, a2, Operand(zero_reg));
1908 __ Addu(t5, t5, Operand(FixedArray::kHeaderSize / kPointerSize));
1910 __ Addu(t5, t5, Operand(Heap::kStrictArgumentsObjectSize / kPointerSize));
1932 __ Branch(&done, eq, a2, Operand(zero_reg));
1936 __ Addu(t0, v0, Operand(Heap::kStrictArgumentsObjectSize));
1946 __ Addu(t0, t0, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
1950 __ Addu(a3, a3, Operand(-kPointerSize));
1954 __ Addu(t0, t0, Operand(kPointerSize));
1955 __ Subu(a2, a2, Operand(1));
1956 __ Branch(&loop, ne, a2, Operand(zero_reg));
1979 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1984 __ Addu(a3, t0, Operand(t1));
1985 __ Addu(a3, a3, Operand(StandardFrameConstants::kCallerSPOffset));
2030 __ li(a0, Operand(address_of_regexp_stack_memory_size));
2032 __ Branch(&runtime, eq, a0, Operand(zero_reg));
2039 __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
2048 Operand(zero_reg));
2053 Operand(FIXED_ARRAY_TYPE));
2059 __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
2072 &runtime, hi, a2, Operand(Isolate::kJSRegexpStaticOffsetsVectorSize - 2));
2109 Operand(kIsNotStringMask |
2113 __ Branch(&seq_string, eq, a1, Operand(zero_reg)); // Go to (5).
2121 __ Branch(¬_seq_nor_cons, ge, a1, Operand(kExternalStringTag));
2127 __ Branch(&runtime, ne, a0, Operand(a1));
2135 __ And(at, a0, Operand(kStringRepresentationMask));
2139 __ Branch(&external_string, ne, at, Operand(zero_reg)); // Go to (7).
2151 __ Branch(&runtime, ls, a3, Operand(a1));
2157 __ And(a0, a0, Operand(kStringEncodingMask)); // Non-zero for one-byte.
2200 __ li(a0, Operand(ExternalReference::isolate_address(isolate())));
2204 __ li(a0, Operand(1));
2208 __ li(a0, Operand(address_of_regexp_stack_memory_address));
2210 __ li(a2, Operand(address_of_regexp_stack_memory_size));
2221 __ li(a0, Operand(
2227 __ Addu(t2, subject, Operand(SeqString::kHeaderSize - kHeapObjectTag));
2228 __ Xor(a3, a3, Operand(1)); // 1 for 2-byte str, 0 for 1-byte.
2254 __ Addu(t9, t9, Operand(Code::kHeaderSize - kHeapObjectTag));
2266 __ Branch(&success, eq, v0, Operand(1));
2270 __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
2272 __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
2277 __ li(a1, Operand(isolate()->factory()->the_hole_value()));
2278 __ li(a2, Operand(ExternalReference(Isolate::kPendingExceptionAddress,
2281 __ Branch(&runtime, eq, v0, Operand(a1));
2288 __ li(v0, Operand(isolate()->factory()->null_value()));
2299 __ Addu(a1, a1, Operand(2)); // a1 was a smi.
2304 __ Branch(&runtime, ne, a2, Operand(JS_ARRAY_TYPE));
2310 __ Branch(&runtime, ne, a0, Operand(at));
2315 __ Addu(a2, a1, Operand(RegExpImpl::kLastMatchOverhead));
2317 __ Branch(&runtime, gt, a2, Operand(at));
2350 __ li(a2, Operand(address_of_static_offsets_vector));
2359 Operand(RegExpImpl::kFirstCaptureOffset - kHeapObjectTag));
2361 __ Subu(a1, a1, Operand(1));
2362 __ Branch(&done, lt, a1, Operand(zero_reg));
2386 __ Branch(¬_long_external, gt, a1, Operand(kExternalStringTag));
2395 __ And(at, a0, Operand(kIsIndirectStringMask));
2399 Operand(zero_reg));
2413 __ And(at, a1, Operand(kIsNotStringMask | kShortExternalStringMask));
2414 __ Branch(&runtime, ne, at, Operand(zero_reg));
2465 __ Addu(t2, a2, Operand(t2));
2476 __ Branch(&done, eq, a1, Operand(weak_value));
2478 __ Branch(&done, eq, t2, Operand(at));
2481 __ Branch(&check_allocation_site, ne, feedback_map, Operand(at));
2493 __ Branch(&miss, ne, feedback_map, Operand(at));
2497 __ Branch(&megamorphic, ne, a1, Operand(t2));
2505 __ Branch(&initialize, eq, t2, Operand(at));
2510 __ Addu(t2, a2, Operand(t2));
2519 __ Branch(¬_array_function, ne, a1, Operand(t2));
2546 __ Branch(&non_function, ne, t1, Operand(JS_FUNCTION_TYPE));
2557 __ Branch(&feedback_register_initialized, eq, t1, Operand(at));
2570 __ Addu(at, t0, Operand(Code::kHeaderSize - kHeapObjectTag));
2585 __ Branch(miss, ne, a1, Operand(at));
2587 __ li(a0, Operand(arg_count()));
2591 __ Addu(at, a2, Operand(at));
2593 __ Addu(a3, a3, Operand(Smi::FromInt(CallICNexus::kCallCountIncrement)));
2613 __ Addu(t0, a2, Operand(t0));
2631 __ Branch(&extra_checks_or_miss, ne, a1, Operand(t1));
2639 __ Addu(at, a2, Operand(at));
2641 __ Addu(a3, a3, Operand(Smi::FromInt(CallICNexus::kCallCountIncrement)));
2646 RelocInfo::CODE_TARGET, al, zero_reg, Operand(zero_reg),
2648 __ li(a0, Operand(argc)); // In delay slot.
2654 __ Branch(&call, eq, t0, Operand(at));
2659 __ Branch(¬_allocation_site, ne, t1, Operand(at));
2672 __ Branch(&uninitialized, eq, t0, Operand(at));
2678 __ Branch(&miss, ne, t1, Operand(JS_FUNCTION_TYPE));
2680 __ Addu(t0, a2, Operand(t0));
2686 RelocInfo::CODE_TARGET, al, zero_reg, Operand(zero_reg),
2688 __ li(a0, Operand(argc)); // In delay slot.
2697 __ Branch(&miss, ne, t0, Operand(JS_FUNCTION_TYPE));
2702 __ Branch(&miss, eq, a1, Operand(t0));
2708 __ Branch(&miss, ne, t0, Operand(t1));
2712 __ Addu(at, a2, Operand(at));
2713 __ li(t0, Operand(Smi::FromInt(CallICNexus::kCallCountIncrement)));
2766 __ And(t0, result_, Operand(kIsNotStringMask));
2767 __ Branch(receiver_not_string_, ne, t0, Operand(zero_reg));
2777 __ Branch(index_out_of_range_, ls, t0, Operand(index_));
2869 __ And(t0, code_, Operand(kSmiTagMask |
2871 __ Branch(&slow_case_, ne, t0, Operand(zero_reg));
2880 __ Branch(&slow_case_, eq, result_, Operand(t0));
2914 __ And(scratch, dest, Operand(kPointerAlignmentMask));
2918 Operand(zero_reg));
2930 __ Addu(limit, dest, Operand(count));
2937 __ Addu(src, src, Operand(1));
2939 __ Addu(dest, dest, Operand(1));
2941 __ Branch(&loop, lt, dest, Operand(limit));
2978 __ Branch(&runtime, lt, a3, Operand(zero_reg)); // From < 0.
2980 __ Branch(&runtime, gt, a3, Operand(a2)); // Fail if from > to.
2988 __ And(t0, a1, Operand(kIsNotStringMask));
2990 __ Branch(&runtime, ne, t0, Operand(zero_reg));
2993 __ Branch(&single_char, eq, a2, Operand(1));
3002 __ Branch(&return_v0, eq, a2, Operand(t0));
3004 __ Branch(&runtime, hi, a2, Operand(t0));
3017 __ And(t0, a1, Operand(kIsIndirectStringMask));
3018 __ Branch(USE_DELAY_SLOT, &seq_or_external_string, eq, t0, Operand(zero_reg));
3020 __ And(t0, a1, Operand(kSlicedNotConsMask));
3021 __ Branch(&sliced_string, ne, t0, Operand(zero_reg));
3025 __ Branch(&runtime, ne, t1, Operand(t0));
3056 __ Branch(©_routine, lt, a2, Operand(SlicedString::kMinLength));
3065 __ And(t0, a1, Operand(kStringEncodingMask));
3066 __ Branch(&two_byte_slice, eq, t0, Operand(zero_reg));
3087 __ And(t0, a1, Operand(kExternalStringTag));
3088 __ Branch(&sequential_string, eq, t0, Operand(zero_reg));
3093 __ And(t0, a1, Operand(kShortExternalStringTag));
3094 __ Branch(&runtime, ne, t0, Operand(zero_reg));
3102 __ Addu(t1, t1, Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
3107 __ And(t0, a1, Operand(kStringEncodingMask));
3108 __ Branch(&two_byte_sequential, eq, t0, Operand(zero_reg));
3117 __ Addu(a1, v0, Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
3137 __ Addu(a1, v0, Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag));
3183 __ Branch(¬_heap_number, ne, a1, Operand(HEAP_NUMBER_TYPE));
3189 __ Branch(¬_string, hs, a1, Operand(FIRST_NONSTRING_TYPE));
3192 __ And(at, a2, Operand(String::kContainsCachedArrayIndexMask));
3193 __ Branch(&slow_string, ne, at, Operand(zero_reg));
3203 __ Branch(¬_oddball, ne, a1, Operand(ODDBALL_TYPE));
3218 __ Branch(&positive_smi, ge, a0, Operand(zero_reg));
3239 __ Branch(¬_string, ge, a1, Operand(FIRST_NONSTRING_TYPE));
3245 __ Branch(¬_heap_number, ne, a1, Operand(HEAP_NUMBER_TYPE));
3252 __ Branch(¬_oddball, ne, a1, Operand(ODDBALL_TYPE));
3271 __ Branch(&check_zero_length, eq, length, Operand(scratch2));
3275 __ li(v0, Operand(Smi::FromInt(NOT_EQUAL)));
3281 __ Branch(&compare_chars, ne, length, Operand(zero_reg));
3284 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3294 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3305 __ Subu(scratch3, scratch1, Operand(scratch2));
3311 __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
3329 __ Branch(&ret, eq, scratch2, Operand(scratch4));
3330 __ li(v0, Operand(Smi::FromInt(GREATER)));
3331 __ Branch(&ret, gt, scratch2, Operand(scratch4));
3332 __ li(v0, Operand(Smi::FromInt(LESS)));
3347 Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
3348 __ Addu(left, left, Operand(scratch1));
3349 __ Addu(right, right, Operand(scratch1));
3361 __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
3363 __ Branch(&loop, ne, index, Operand(zero_reg));
3377 __ Branch(¬_same, ne, a0, Operand(a1));
3378 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3414 __ And(at, a2, Operand(kSmiTagMask));
3415 __ Assert(ne, kExpectedAllocationSite, at, Operand(zero_reg));
3418 __ Assert(eq, kExpectedAllocationSite, t0, Operand(at));
3491 // Load left and right operand.
3496 __ Subu(a2, a0, Operand(kHeapObjectTag));
3509 __ Subu(a2, a1, Operand(kHeapObjectTag));
3531 __ li(v0, Operand(GREATER));
3535 __ li(v0, Operand(EQUAL));
3539 __ li(v0, Operand(LESS));
3550 __ Branch(&miss, ne, a0, Operand(at));
3553 __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
3560 __ Branch(&unordered, eq, a1, Operand(at));
3587 __ Or(tmp1, tmp1, Operand(tmp2));
3588 __ And(at, tmp1, Operand(kIsNotStringMask | kIsNotInternalizedMask));
3589 __ Branch(&miss, ne, at, Operand(zero_reg));
3598 __ Ret(ne, left, Operand(right));
3601 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3637 __ Branch(&done, ne, left, Operand(right));
3643 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3678 __ And(tmp5, tmp3, Operand(kIsNotStringMask));
3679 __ Branch(&miss, ne, tmp5, Operand(zero_reg));
3685 __ Branch(&left_ne_right, ne, left, Operand(right));
3698 __ Or(tmp3, tmp1, Operand(tmp2));
3699 __ And(tmp5, tmp3, Operand(kIsNotInternalizedMask));
3701 __ Branch(&is_symbol, ne, tmp5, Operand(zero_reg));
3741 __ And(a2, a1, Operand(a0));
3746 __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
3748 __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
3767 __ Branch(&miss, ne, a2, Operand(t0));
3768 __ Branch(&miss, ne, a3, Operand(t0));
3777 __ li(a2, Operand(Smi::FromInt(GREATER)));
3779 __ li(a2, Operand(Smi::FromInt(LESS)));
3796 __ li(t0, Operand(Smi::FromInt(op())));
3802 __ Addu(a2, v0, Operand(Code::kHeaderSize - kHeapObjectTag));
3816 __ Subu(sp, sp, Operand(kCArgsSlotsSize));
3829 Operand(reinterpret_cast<uint32_t>(kZapValue)));
3840 __ li(at, Operand(loc, RelocInfo::CODE_TARGET), CONSTANT_SIZE);
3864 __ Subu(index, index, Operand(1));
3865 __ And(index, index, Operand(
3883 __ Branch(done, eq, entity_name, Operand(tmp));
3889 __ Branch(miss, eq, entity_name, Operand(Handle<Name>(name)));
3892 __ Branch(&good, eq, entity_name, Operand(tmp));
3912 __ li(a1, Operand(Handle<Name>(name)));
3918 __ Branch(done, eq, at, Operand(zero_reg));
3919 __ Branch(miss, ne, at, Operand(zero_reg));
3944 __ Subu(scratch1, scratch1, Operand(1));
3958 __ Addu(scratch2, scratch2, Operand(
3975 __ Branch(done, eq, name, Operand(at));
3998 __ Branch(done, ne, at, Operand(zero_reg));
3999 __ Branch(miss, eq, at, Operand(zero_reg));
4028 __ Subu(mask, mask, Operand(1));
4043 __ Addu(index, hash, Operand(
4065 __ Branch(¬_in_dictionary, eq, entry_key, Operand(undefined));
4068 __ Branch(&in_dictionary, eq, entry_key, Operand(key));
4201 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
4219 __ And(regs_.scratch0(), regs_.object(), Operand(~Page::kPageAlignmentMask));
4223 __ Subu(regs_.scratch1(), regs_.scratch1(), Operand(1));
4227 __ Branch(&need_incremental, lt, regs_.scratch1(), Operand(zero_reg));
4304 __ Addu(a1, a1, Operand(1));
4355 __ Branch(&start_polymorphic, ne, receiver_map, Operand(cached_map));
4359 __ Addu(t9, handler, Operand(Code::kHeaderSize - kHeapObjectTag));
4369 __ Branch(miss, eq, length, Operand(Smi::FromInt(2)));
4386 __ Addu(too_far, feedback, Operand(at));
4387 __ Addu(too_far, too_far, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
4389 Operand(FixedArray::OffsetOfElementAt(2) - kHeapObjectTag));
4394 __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
4396 __ Addu(t9, handler, Operand(Code::kHeaderSize - kHeapObjectTag));
4400 __ Addu(pointer_reg, pointer_reg, Operand(kPointerSize * 2));
4401 __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
4419 __ Branch(try_array, ne, cached_map, Operand(receiver_map));
4423 __ Addu(handler, vector, Operand(at));
4426 __ Addu(t9, handler, Operand(Code::kHeaderSize - kHeapObjectTag));
4441 __ Addu(feedback, vector, Operand(at));
4456 __ Branch(¬_array, ne, at, Operand(scratch1));
4461 __ Branch(&miss, ne, at, Operand(feedback));
4497 __ Addu(feedback, vector, Operand(at));
4512 __ Branch(¬_array, ne, at, Operand(scratch1));
4523 __ Branch(&try_poly_name, ne, at, Operand(feedback));
4530 __ Branch(&miss, ne, key, Operand(feedback));
4534 __ Addu(feedback, vector, Operand(at));
4583 __ Addu(feedback, vector, Operand(scratch1));
4598 __ Branch(¬_array, ne, scratch1, Operand(at));
4606 __ Branch(&miss, ne, feedback, Operand(at));
4656 __ Addu(too_far, feedback, Operand(scratch1));
4657 __ Addu(too_far, too_far, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
4659 Operand(FixedArray::OffsetOfElementAt(0) - kHeapObjectTag));
4664 __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
4668 __ Branch(&transition_call, ne, too_far, Operand(at));
4670 __ Addu(t9, pointer_reg, Operand(Code::kHeaderSize - kHeapObjectTag));
4683 __ Addu(t9, receiver_map, Operand(Code::kHeaderSize - kHeapObjectTag));
4687 __ Addu(pointer_reg, pointer_reg, Operand(kPointerSize * 3));
4688 __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
4706 __ Addu(feedback, vector, Operand(scratch1));
4721 __ Branch(¬_array, ne, scratch1, Operand(at));
4735 __ Branch(&try_poly_name, ne, feedback, Operand(at));
4742 __ Branch(&miss, ne, key, Operand(feedback));
4746 __ Addu(feedback, vector, Operand(scratch1));
4789 __ Subu(a0, ra, Operand(kReturnAddressDistanceFromFunctionStart));
4793 __ Addu(a1, sp, Operand(kNumSavedRegs * kPointerSize));
4800 __ And(sp, sp, Operand(-frame_alignment));
4806 __ li(t9, Operand(entry_hook));
4811 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
4814 __ li(t9, Operand(ExternalReference(&dispatcher,
4846 __ TailCallStub(&stub, eq, a3, Operand(kind));
4874 __ And(at, a3, Operand(1));
4875 __ Branch(&normal_sequence, ne, at, Operand(zero_reg));
4880 __ Branch(&normal_sequence, eq, t1, Operand(zero_reg));
4899 __ Addu(a3, a3, Operand(1));
4904 __ Assert(eq, kExpectedAllocationSite, t1, Operand(at));
4912 __ Addu(t0, t0, Operand(Smi::FromInt(kFastElementsKindPackedToHoley)));
4922 __ TailCallStub(&stub, eq, a3, Operand(kind));
4980 __ Branch(¬_zero_case, ne, at, Operand(zero_reg));
4984 __ Branch(¬_one_case, gt, a0, Operand(1));
5019 at, Operand(zero_reg));
5022 t1, Operand(MAP_TYPE));
5032 __ Branch(&subclassing, ne, a1, Operand(a3));
5037 __ Branch(&no_info, eq, a2, Operand(at));
5042 __ And(a3, a3, Operand(AllocationSite::ElementsKindBits::kMask));
5056 __ li(at, Operand(3));
5061 __ li(a0, Operand(3));
5065 __ li(a0, Operand(4));
5077 __ TailCallStub(&stub0, lo, a0, Operand(1));
5080 __ TailCallStub(&stubN, hi, a0, Operand(1));
5089 __ TailCallStub(&stub1_holey, ne, at, Operand(zero_reg));
5114 at, Operand(zero_reg));
5117 t0, Operand(MAP_TYPE));
5131 __ Branch(&done, eq, a3, Operand(FAST_ELEMENTS));
5134 a3, Operand(FAST_HOLEY_ELEMENTS));
5139 __ Branch(&fast_elements_case, eq, a3, Operand(FAST_ELEMENTS));
5161 __ Addu(at, at, Operand(context_reg));
5167 __ Branch(&slow_case, eq, result_reg, Operand(at));
5189 __ Check(ne, kUnexpectedValue, value_reg, Operand(at));
5200 __ Addu(at, at, Operand(context_reg));
5215 Operand(PropertyDetails::PropertyCellTypeField::encode(
5233 __ Branch(¬_same_value, ne, value_reg, Operand(cell_value_reg));
5236 __ Branch(&slow_case, ne, at, Operand(zero_reg));
5242 Operand(PropertyDetails::PropertyCellTypeField::encode(
5246 Operand(PropertyDetails::PropertyCellTypeField::encode(
5250 Operand(PropertyDetails::PropertyCellTypeField::encode(
5261 Operand(PropertyDetails::PropertyCellTypeField::encode(
5318 __ li(t9, Operand(ExternalReference::is_profiling_address(isolate)));
5320 __ Branch(&profiler_disabled, eq, t9, Operand(zero_reg));
5323 __ li(t9, Operand(thunk_ref));
5331 __ li(s3, Operand(next_address));
5335 __ Addu(s2, s2, Operand(1));
5342 __ li(a0, Operand(ExternalReference::isolate_address(isolate)));
5358 __ li(a0, Operand(ExternalReference::isolate_address(isolate)));
5378 __ Check(eq, kUnexpectedLevelAfterReturnFromApiCall, a1, Operand(s2));
5380 __ Subu(s2, s2, Operand(1));
5383 __ Branch(&delete_allocated_handles, ne, s1, Operand(at));
5397 __ li(s0, Operand(stack_space));
5404 __ li(at, Operand(ExternalReference::scheduled_exception_address(isolate)));
5406 __ Branch(&promote_scheduled_exception, ne, t0, Operand(t1));
5420 __ li(a0, Operand(ExternalReference::isolate_address(isolate)));
5476 __ li(scratch, Operand(ExternalReference::isolate_address(masm->isolate())));
5493 __ Addu(a0, sp, Operand(1 * kPointerSize));
5499 Operand((FCA::kArgsLength - 1 + argc.immediate()) * kPointerSize));
5502 __ li(at, Operand(argc.immediate()));
5510 __ Addu(at, at, Operand((FCA::kArgsLength - 1) * kPointerSize));
5515 __ Addu(argc.reg(), argc.reg(), Operand(FCA::kArgsLength + 1));
5574 __ Addu(a1, a0, Operand(1 * kPointerSize)); // a1 = PCA
5583 __ Addu(a1, sp, Operand(1 * kPointerSize)); // a1 = AccessorInfo&
