Lines Matching refs:Operand
122 __ Subu(sp, sp, Operand(param_count * kPointerSize));
178 __ Branch(&error, ne, scratch, Operand(zero_reg));
203 __ Branch(&done, eq, scratch, Operand(zero_reg));
208 Operand(HeapNumber::kExponentBias + HeapNumber::kMantissaBits + 31));
212 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg));
219 __ Addu(scratch, result_reg, Operand(kShiftBase + HeapNumber::kMantissaBits));
224 __ And(sign, input_high, Operand(HeapNumber::kSignMask));
229 __ Branch(&high_shift_needed, lt, scratch, Operand(32));
237 Operand(1 << HeapNumber::kMantissaBitsInTopWord));
249 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg));
260 __ Or(input_high, input_high, Operand(input_low));
291 __ And(sign(), the_int(), Operand(0x80000000u));
292 __ Branch(&max_negative_int, eq, the_int(), Operand(0x80000000u));
298 __ li(scratch(), Operand(non_smi_exponent));
325 __ li(scratch(), Operand(HeapNumber::kSignMask | non_smi_exponent));
345 __ Branch(¬_identical, ne, a0, Operand(a1));
347 __ li(exp_mask_reg, Operand(HeapNumber::kExponentMask));
355 __ Branch(slow, greater, t4, Operand(FIRST_SPEC_OBJECT_TYPE));
358 __ Branch(&heap_number, eq, t4, Operand(HEAP_NUMBER_TYPE));
361 __ Branch(slow, greater, t4, Operand(FIRST_SPEC_OBJECT_TYPE));
366 __ Branch(&return_equal, ne, t4, Operand(ODDBALL_TYPE));
368 __ Branch(&return_equal, ne, a0, Operand(t2));
373 __ li(v0, Operand(GREATER));
376 __ li(v0, Operand(LESS));
386 __ li(v0, Operand(GREATER)); // Things aren't less than themselves.
388 __ li(v0, Operand(LESS)); // Things aren't greater than themselves.
406 __ And(t3, t2, Operand(exp_mask_reg));
408 __ Branch(&return_equal, ne, t3, Operand(exp_mask_reg));
414 __ Or(v0, t3, Operand(t2));
421 __ Ret(eq, v0, Operand(zero_reg));
425 __ li(v0, Operand(GREATER)); // NaN <= NaN should fail.
427 __ li(v0, Operand(LESS)); // NaN >= NaN should fail.
454 __ Ret(USE_DELAY_SLOT, ne, t4, Operand(HEAP_NUMBER_TYPE));
459 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
478 __ Ret(USE_DELAY_SLOT, ne, t4, Operand(HEAP_NUMBER_TYPE));
479 __ li(v0, Operand(1));
483 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
499 // If either operand is a JS object or an oddball value, then they are
504 // Get the type of the first operand into a2 and compare it with
507 __ Branch(&first_non_object, less, a2, Operand(FIRST_SPEC_OBJECT_TYPE));
513 __ li(v0, Operand(1));
517 __ Branch(&return_not_equal, eq, a2, Operand(ODDBALL_TYPE));
520 __ Branch(&return_not_equal, greater, a3, Operand(FIRST_SPEC_OBJECT_TYPE));
523 __ Branch(&return_not_equal, eq, a3, Operand(ODDBALL_TYPE));
528 __ Or(a2, a2, Operand(a3));
529 __ And(at, a2, Operand(kIsNotStringMask | kIsNotInternalizedMask));
530 __ Branch(&return_not_equal, eq, at, Operand(zero_reg));
541 __ Branch(not_heap_numbers, ne, a2, Operand(HEAP_NUMBER_TYPE));
544 __ Branch(slow, ne, a3, Operand(a2));
567 __ And(at, a2, Operand(kIsNotStringMask));
568 __ Branch(&object_test, ne, at, Operand(zero_reg));
569 __ And(at, a2, Operand(kIsNotInternalizedMask));
570 __ Branch(possible_strings, ne, at, Operand(zero_reg));
572 __ Branch(not_both_strings, ge, a3, Operand(FIRST_NONSTRING_TYPE));
573 __ And(at, a3, Operand(kIsNotInternalizedMask));
574 __ Branch(possible_strings, ne, at, Operand(zero_reg));
579 __ li(v0, Operand(1)); // Non-zero indicates not equal.
582 __ Branch(not_both_strings, lt, a2, Operand(FIRST_SPEC_OBJECT_TYPE));
584 __ Branch(not_both_strings, lt, a3, Operand(FIRST_SPEC_OBJECT_TYPE));
593 __ And(a0, a0, Operand(1 << Map::kIsUndetectable));
642 // it is certain that at least one operand isn't a smi.
652 __ And(t2, lhs, Operand(rhs));
654 // One operand is a smi. EmitSmiNonsmiComparison generates code that can:
670 __ li(t0, Operand(LESS));
671 __ li(t1, Operand(GREATER));
672 __ li(t2, Operand(EQUAL));
710 __ li(v0, Operand(GREATER));
712 __ li(v0, Operand(LESS));
782 __ li(a0, Operand(Smi::FromInt(ncr)));
825 __ li(a0, Operand(ExternalReference::isolate_address(isolate())));
865 __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
878 __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
900 __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
983 __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
992 __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
998 __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
1005 __ Branch(&done, ge, exponent, Operand(zero_reg));
1137 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
1178 __ Branch(&okay, ne, v0, Operand(t0));
1186 __ Branch(&exception_returned, eq, t0, Operand(v0));
1195 __ li(a2, Operand(pending_exception_address));
1199 __ Branch(&okay, eq, t0, Operand(a2));
1215 __ li(a2, Operand(pending_exception_address));
1219 __ li(a3, Operand(isolate()->factory()->the_hole_value()));
1226 __ Branch(&throw_termination_exception, eq, v0, Operand(t0));
1269 __ li(t3, Operand(-1)); // Push a bad frame pointer to fail if it is used.
1271 __ li(t2, Operand(Smi::FromInt(marker)));
1272 __ li(t1, Operand(Smi::FromInt(marker)));
1273 __ li(t0, Operand(ExternalReference(Isolate::kCEntryFPAddress,
1299 __ li(t1, Operand(ExternalReference(js_entry_sp)));
1301 __ Branch(&non_outermost_js, ne, t2, Operand(zero_reg));
1303 __ li(t0, Operand(Smi::FromInt(StackFrame::OUTERMOST_JSENTRY_FRAME)));
1308 __ li(t0, Operand(Smi::FromInt(StackFrame::INNER_JSENTRY_FRAME)));
1321 __ li(t0, Operand(ExternalReference(Isolate::kPendingExceptionAddress,
1339 __ li(t0, Operand(ExternalReference(Isolate::kPendingExceptionAddress,
1364 __ li(t0, Operand(construct_entry));
1367 __ li(t0, Operand(entry));
1385 Operand(Smi::FromInt(StackFrame::OUTERMOST_JSENTRY_FRAME)));
1386 __ li(t1, Operand(ExternalReference(js_entry_sp)));
1392 __ li(t0, Operand(ExternalReference(Isolate::kCEntryFPAddress,
1449 __ Branch(&miss, ne, function, Operand(at));
1451 __ Branch(&miss, ne, map, Operand(at));
1494 __ Branch(&is_instance, eq, scratch, Operand(prototype));
1495 __ Branch(&is_not_instance, eq, scratch, Operand(scratch2));
1508 __ Addu(inline_site, inline_site, Operand(kDeltaToLoadBoolResult));
1521 __ li(v0, Operand(Smi::FromInt(1)));
1526 __ Addu(inline_site, inline_site, Operand(kDeltaToLoadBoolResult));
1531 __ li(v0, Operand(Smi::FromInt(1)));
1543 __ Branch(&slow, ne, scratch, Operand(JS_FUNCTION_TYPE));
1549 Operand(isolate()->factory()->null_value()));
1550 __ li(v0, Operand(Smi::FromInt(1)));
1556 __ li(v0, Operand(Smi::FromInt(1)));
1562 __ li(v0, Operand(Smi::FromInt(1)));
1580 __ DropAndRet(HasArgsInRegisters() ? 0 : 2, eq, a0, Operand(zero_reg));
1617 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1622 __ Branch(&slow, hs, a1, Operand(a0));
1627 __ Addu(a3, fp, Operand(t3));
1636 __ Branch(&slow, Ugreater_equal, a1, Operand(a0));
1641 __ Addu(a3, a2, Operand(t3));
1664 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1670 __ Addu(a3, a3, Operand(t3));
1699 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1710 __ Addu(a3, a3, Operand(t6));
1711 __ Addu(a3, a3, Operand(StandardFrameConstants::kCallerSPOffset));
1718 __ Branch(&skip_min, lt, a1, Operand(a2));
1731 __ Branch(USE_DELAY_SLOT, ¶m_map_size, eq, a1, Operand(zero_reg));
1739 __ Addu(t5, t5, Operand(t6));
1740 __ Addu(t5, t5, Operand(FixedArray::kHeaderSize));
1743 __ Addu(t5, t5, Operand(Heap::kSloppyArgumentsObjectSize));
1759 __ Branch(&skip2_ne, ne, a1, Operand(zero_reg));
1763 __ Branch(&skip2_eq, eq, a1, Operand(zero_reg));
1794 __ Addu(t0, v0, Operand(Heap::kSloppyArgumentsObjectSize));
1804 __ Branch(&skip3, ne, a1, Operand(Smi::FromInt(0)));
1810 __ Branch(&skip_parameter_map, eq, a1, Operand(Smi::FromInt(0)));
1814 __ Addu(t2, a1, Operand(Smi::FromInt(2)));
1818 __ Addu(t2, t0, Operand(t6));
1819 Operand(kParameterMapHeaderSize));
1833 __ Addu(t5, t5, Operand(Smi::FromInt(Context::MIN_CONTEXT_SLOTS)));
1834 __ Subu(t5, t5, Operand(a1));
1837 __ Addu(a3, t0, Operand(t6));
1838 __ Addu(a3, a3, Operand(kParameterMapHeaderSize));
1849 __ Subu(t2, t2, Operand(Smi::FromInt(1)));
1851 __ Addu(t1, t1, Operand(kParameterMapHeaderSize - kHeapObjectTag));
1854 __ Subu(t1, t1, Operand(kParameterMapHeaderSize - FixedArray::kHeaderSize));
1857 __ Addu(t5, t5, Operand(Smi::FromInt(1)));
1859 __ Branch(¶meters_loop, ne, t2, Operand(Smi::FromInt(0)));
1874 __ Subu(t0, t0, Operand(t6));
1878 __ Subu(t0, t0, Operand(kPointerSize));
1881 __ Addu(t1, a3, Operand(t6));
1883 __ Addu(t5, t5, Operand(Smi::FromInt(1)));
1886 __ Branch(&arguments_loop, lt, t5, Operand(a2));
1907 __ And(t0, key, Operand(kSmiTagMask | kSmiSignMask));
1908 __ Branch(&slow, ne, t0, Operand(zero_reg));
1936 Operand(Smi::FromInt(StackFrame::ARGUMENTS_ADAPTOR)));
1947 __ Addu(a3, a2, Operand(at));
1949 __ Addu(a3, a3, Operand(StandardFrameConstants::kCallerSPOffset));
1956 __ Branch(&add_arguments_object, eq, a1, Operand(zero_reg));
1959 __ Addu(a1, a1, Operand(FixedArray::kHeaderSize / kPointerSize));
1961 __ Addu(a1, a1, Operand(Heap::kStrictArgumentsObjectSize / kPointerSize));
1986 __ Branch(&done, eq, a1, Operand(zero_reg));
1993 __ Addu(t0, v0, Operand(Heap::kStrictArgumentsObjectSize));
2004 __ Addu(t0, t0, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
2008 __ Addu(a2, a2, Operand(-kPointerSize));
2012 __ Addu(t0, t0, Operand(kPointerSize));
2013 __ Subu(a1, a1, Operand(1));
2014 __ Branch(&loop, ne, a1, Operand(zero_reg));
2062 __ li(a0, Operand(address_of_regexp_stack_memory_size));
2064 __ Branch(&runtime, eq, a0, Operand(zero_reg));
2071 __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
2080 Operand(zero_reg));
2085 Operand(FIXED_ARRAY_TYPE));
2091 __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
2104 &runtime, hi, a2, Operand(Isolate::kJSRegexpStaticOffsetsVectorSize - 2));
2141 Operand(kIsNotStringMask |
2145 __ Branch(&seq_string, eq, a1, Operand(zero_reg)); // Go to (5).
2153 __ Branch(¬_seq_nor_cons, ge, a1, Operand(kExternalStringTag));
2159 __ Branch(&runtime, ne, a0, Operand(a1));
2167 __ And(at, a0, Operand(kStringRepresentationMask));
2171 __ Branch(&external_string, ne, at, Operand(zero_reg)); // Go to (7).
2183 __ Branch(&runtime, ls, a3, Operand(a1));
2189 __ And(a0, a0, Operand(kStringEncodingMask)); // Non-zero for one-byte.
2232 __ li(a0, Operand(ExternalReference::isolate_address(isolate())));
2236 __ li(a0, Operand(1));
2240 __ li(a0, Operand(address_of_regexp_stack_memory_address));
2242 __ li(a2, Operand(address_of_regexp_stack_memory_size));
2253 __ li(a0, Operand(
2259 __ Addu(t2, subject, Operand(SeqString::kHeaderSize - kHeapObjectTag));
2260 __ Xor(a3, a3, Operand(1)); // 1 for 2-byte str, 0 for 1-byte.
2286 __ Addu(t9, t9, Operand(Code::kHeaderSize - kHeapObjectTag));
2298 __ Branch(&success, eq, v0, Operand(1));
2302 __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
2304 __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
2309 __ li(a1, Operand(isolate()->factory()->the_hole_value()));
2310 __ li(a2, Operand(ExternalReference(Isolate::kPendingExceptionAddress,
2313 __ Branch(&runtime, eq, v0, Operand(a1));
2320 __ Branch(&termination_exception, eq, v0, Operand(a0));
2329 __ li(v0, Operand(isolate()->factory()->null_value()));
2340 __ Addu(a1, a1, Operand(2)); // a1 was a smi.
2345 __ Branch(&runtime, ne, a2, Operand(JS_ARRAY_TYPE));
2351 __ Branch(&runtime, ne, a0, Operand(at));
2356 __ Addu(a2, a1, Operand(RegExpImpl::kLastMatchOverhead));
2358 __ Branch(&runtime, gt, a2, Operand(at));
2391 __ li(a2, Operand(address_of_static_offsets_vector));
2400 Operand(RegExpImpl::kFirstCaptureOffset - kHeapObjectTag));
2402 __ Subu(a1, a1, Operand(1));
2403 __ Branch(&done, lt, a1, Operand(zero_reg));
2427 __ Branch(¬_long_external, gt, a1, Operand(kExternalStringTag));
2436 __ And(at, a0, Operand(kIsIndirectStringMask));
2440 Operand(zero_reg));
2454 __ And(at, a1, Operand(kIsNotStringMask | kShortExternalStringMask));
2455 __ Branch(&runtime, ne, at, Operand(zero_reg));
2484 __ Addu(t0, a2, Operand(t0));
2489 __ Branch(&done, eq, t0, Operand(a1));
2498 __ Branch(&miss, ne, t1, Operand(at));
2502 __ Branch(&megamorphic, ne, a1, Operand(t0));
2511 __ Branch(&initialize, eq, t0, Operand(at));
2516 __ Addu(t0, a2, Operand(t0));
2526 __ Branch(¬_array_function, ne, a1, Operand(t0));
2555 __ Addu(t0, a2, Operand(t0));
2556 __ Addu(t0, t0, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
2577 __ And(at, t0, Operand(strict_mode_function_mask | native_mask));
2578 __ Branch(cont, ne, at, Operand(zero_reg));
2586 __ Branch(non_function, ne, t0, Operand(JS_FUNCTION_PROXY_TYPE));
2588 __ li(a0, Operand(argc + 1, RelocInfo::NONE32));
2601 __ li(a0, Operand(argc)); // Set up the number of arguments.
2634 __ Branch(&slow, ne, t0, Operand(JS_FUNCTION_TYPE));
2652 __ Branch(&wrap, lt, t0, Operand(FIRST_SPEC_OBJECT_TYPE));
2692 __ Branch(&slow, ne, t0, Operand(JS_FUNCTION_TYPE));
2710 __ Branch(&feedback_register_initialized, eq, t1, Operand(at));
2723 __ Addu(at, jmp_reg, Operand(Code::kHeaderSize - kHeapObjectTag));
2731 __ Branch(&non_function_call, ne, t0, Operand(JS_FUNCTION_PROXY_TYPE));
2739 __ li(a2, Operand(0, RelocInfo::NONE32));
2762 __ Branch(&miss, ne, a1, Operand(at));
2764 __ li(a0, Operand(arg_count()));
2766 __ Addu(at, a2, Operand(at));
2772 __ Branch(&miss, ne, t1, Operand(at));
2805 __ Addu(t0, a2, Operand(t0));
2807 __ Branch(&extra_checks_or_miss, ne, a1, Operand(t0));
2817 __ Branch(&wrap, lt, t0, Operand(FIRST_SPEC_OBJECT_TYPE));
2836 __ Branch(&slow_start, eq, t0, Operand(at));
2838 __ Branch(&miss, eq, t0, Operand(at));
2845 __ Branch(&miss, ne, t1, Operand(JS_FUNCTION_TYPE));
2847 __ Addu(t0, a2, Operand(t0));
2865 __ Branch(&slow, ne, t0, Operand(JS_FUNCTION_TYPE));
2907 __ And(t0, result_, Operand(kIsNotStringMask));
2908 __ Branch(receiver_not_string_, ne, t0, Operand(zero_reg));
2917 __ Branch(index_out_of_range_, ls, t0, Operand(index_));
3002 Operand(kSmiTagMask |
3004 __ Branch(&slow_case_, ne, t0, Operand(zero_reg));
3013 __ Branch(&slow_case_, eq, result_, Operand(t0));
3047 __ And(scratch, dest, Operand(kPointerAlignmentMask));
3051 Operand(zero_reg));
3063 __ Addu(limit, dest, Operand(count));
3070 __ Addu(src, src, Operand(1));
3072 __ Addu(dest, dest, Operand(1));
3074 __ Branch(&loop, lt, dest, Operand(limit));
3111 __ Branch(&runtime, lt, a3, Operand(zero_reg)); // From < 0.
3113 __ Branch(&runtime, gt, a3, Operand(a2)); // Fail if from > to.
3121 __ And(t0, a1, Operand(kIsNotStringMask));
3123 __ Branch(&runtime, ne, t0, Operand(zero_reg));
3126 __ Branch(&single_char, eq, a2, Operand(1));
3135 __ Branch(&return_v0, eq, a2, Operand(t0));
3137 __ Branch(&runtime, hi, a2, Operand(t0));
3150 __ And(t0, a1, Operand(kIsIndirectStringMask));
3151 __ Branch(USE_DELAY_SLOT, &seq_or_external_string, eq, t0, Operand(zero_reg));
3153 __ And(t0, a1, Operand(kSlicedNotConsMask));
3154 __ Branch(&sliced_string, ne, t0, Operand(zero_reg));
3158 __ Branch(&runtime, ne, t1, Operand(t0));
3189 __ Branch(©_routine, lt, a2, Operand(SlicedString::kMinLength));
3198 __ And(t0, a1, Operand(kStringEncodingMask));
3199 __ Branch(&two_byte_slice, eq, t0, Operand(zero_reg));
3220 __ And(t0, a1, Operand(kExternalStringTag));
3221 __ Branch(&sequential_string, eq, t0, Operand(zero_reg));
3226 __ And(t0, a1, Operand(kShortExternalStringTag));
3227 __ Branch(&runtime, ne, t0, Operand(zero_reg));
3235 __ Addu(t1, t1, Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
3240 __ And(t0, a1, Operand(kStringEncodingMask));
3241 __ Branch(&two_byte_sequential, eq, t0, Operand(zero_reg));
3250 __ Addu(a1, v0, Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
3270 __ Addu(a1, v0, Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag));
3312 __ Branch(&check_zero_length, eq, length, Operand(scratch2));
3316 __ li(v0, Operand(Smi::FromInt(NOT_EQUAL)));
3322 __ Branch(&compare_chars, ne, length, Operand(zero_reg));
3325 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3335 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3346 __ Subu(scratch3, scratch1, Operand(scratch2));
3352 __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
3370 __ Branch(&ret, eq, scratch2, Operand(scratch4));
3371 __ li(v0, Operand(Smi::FromInt(GREATER)));
3372 __ Branch(&ret, gt, scratch2, Operand(scratch4));
3373 __ li(v0, Operand(Smi::FromInt(LESS)));
3388 Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
3389 __ Addu(left, left, Operand(scratch1));
3390 __ Addu(right, right, Operand(scratch1));
3402 __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
3404 __ Branch(&loop, ne, index, Operand(zero_reg));
3420 __ Branch(¬_same, ne, a0, Operand(a1));
3423 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3434 __ Addu(sp, sp, Operand(2 * kPointerSize));
3456 __ And(at, a2, Operand(kSmiTagMask));
3457 __ Assert(ne, kExpectedAllocationSite, at, Operand(zero_reg));
3460 __ Assert(eq, kExpectedAllocationSite, t0, Operand(at));
3509 // Load left and right operand.
3514 __ Subu(a2, a0, Operand(kHeapObjectTag));
3527 __ Subu(a2, a1, Operand(kHeapObjectTag));
3549 __ li(v0, Operand(GREATER));
3553 __ li(v0, Operand(EQUAL));
3557 __ li(v0, Operand(LESS));
3568 __ Branch(&miss, ne, a0, Operand(at));
3571 __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
3578 __ Branch(&unordered, eq, a1, Operand(at));
3605 __ Or(tmp1, tmp1, Operand(tmp2));
3606 __ And(at, tmp1, Operand(kIsNotStringMask | kIsNotInternalizedMask));
3607 __ Branch(&miss, ne, at, Operand(zero_reg));
3616 __ Ret(ne, left, Operand(right));
3619 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3655 __ Branch(&done, ne, left, Operand(right));
3661 __ li(v0, Operand(Smi::FromInt(EQUAL)));
3696 __ And(tmp5, tmp3, Operand(kIsNotStringMask));
3697 __ Branch(&miss, ne, tmp5, Operand(zero_reg));
3703 __ Branch(&left_ne_right, ne, left, Operand(right));
3716 __ Or(tmp3, tmp1, Operand(tmp2));
3717 __ And(tmp5, tmp3, Operand(kIsNotInternalizedMask));
3719 __ Branch(&is_symbol, ne, tmp5, Operand(zero_reg));
3759 __ And(a2, a1, Operand(a0));
3763 __ Branch(&miss, ne, a2, Operand(JS_OBJECT_TYPE));
3765 __ Branch(&miss, ne, a2, Operand(JS_OBJECT_TYPE));
3782 __ Branch(&miss, ne, a2, Operand(known_map_));
3783 __ Branch(&miss, ne, a3, Operand(known_map_));
3801 __ li(t0, Operand(Smi::FromInt(op())));
3806 __ Addu(a2, v0, Operand(Code::kHeaderSize - kHeapObjectTag));
3820 __ Subu(sp, sp, Operand(kCArgsSlotsSize));
3833 Operand(reinterpret_cast<uint32_t>(kZapValue)));
3844 __ li(ra, Operand(loc, RelocInfo::CODE_TARGET), CONSTANT_SIZE);
3868 __ Subu(index, index, Operand(1));
3869 __ And(index, index, Operand(
3887 __ Branch(done, eq, entity_name, Operand(tmp));
3893 __ Branch(miss, eq, entity_name, Operand(Handle<Name>(name)));
3896 __ Branch(&good, eq, entity_name, Operand(tmp));
3916 __ li(a1, Operand(Handle<Name>(name)));
3922 __ Branch(done, eq, at, Operand(zero_reg));
3923 __ Branch(miss, ne, at, Operand(zero_reg));
3948 __ Subu(scratch1, scratch1, Operand(1));
3962 __ Addu(scratch2, scratch2, Operand(
3979 __ Branch(done, eq, name, Operand(at));
4002 __ Branch(done, ne, at, Operand(zero_reg));
4003 __ Branch(miss, eq, at, Operand(zero_reg));
4032 __ Subu(mask, mask, Operand(1));
4047 __ Addu(index, hash, Operand(
4069 __ Branch(¬_in_dictionary, eq, entry_key, Operand(undefined));
4072 __ Branch(&in_dictionary, eq, entry_key, Operand(key));
4205 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
4223 __ And(regs_.scratch0(), regs_.object(), Operand(~Page::kPageAlignmentMask));
4227 __ Subu(regs_.scratch1(), regs_.scratch1(), Operand(1));
4231 __ Branch(&need_incremental, lt, regs_.scratch1(), Operand(zero_reg));
4341 __ Addu(t2, t2, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
4375 __ Addu(a1, a1, Operand(1));
4426 __ Subu(a0, ra, Operand(kReturnAddressDistanceFromFunctionStart));
4430 __ Addu(a1, sp, Operand(kNumSavedRegs * kPointerSize));
4437 __ And(sp, sp, Operand(-frame_alignment));
4443 __ li(t9, Operand(entry_hook));
4448 __ li(a2, Operand(ExternalReference::isolate_address(isolate())));
4451 __ li(t9, Operand(ExternalReference(&dispatcher,
4483 __ TailCallStub(&stub, eq, a3, Operand(kind));
4511 __ And(at, a3, Operand(1));
4512 __ Branch(&normal_sequence, ne, at, Operand(zero_reg));
4517 __ Branch(&normal_sequence, eq, t1, Operand(zero_reg));
4536 __ Addu(a3, a3, Operand(1));
4541 Operand(at));
4549 __ Addu(t0, t0, Operand(Smi::FromInt(kFastElementsKindPackedToHoley)));
4559 __ TailCallStub(&stub, eq, a3, Operand(kind));
4617 __ Branch(¬_zero_case, ne, at, Operand(zero_reg));
4621 __ Branch(¬_one_case, gt, a0, Operand(1));
4656 at, Operand(zero_reg));
4659 t1, Operand(MAP_TYPE));
4668 __ Branch(&no_info, eq, a2, Operand(at));
4673 __ And(a3, a3, Operand(AllocationSite::ElementsKindBits::kMask));
4685 __ TailCallStub(&stub0, lo, a0, Operand(1));
4688 __ TailCallStub(&stubN, hi, a0, Operand(1));
4697 __ TailCallStub(&stub1_holey, ne, at, Operand(zero_reg));
4722 at, Operand(zero_reg));
4725 t0, Operand(MAP_TYPE));
4739 __ Branch(&done, eq, a3, Operand(FAST_ELEMENTS));
4742 a3, Operand(FAST_HOLEY_ELEMENTS));
4747 __ Branch(&fast_elements_case, eq, a3, Operand(FAST_ELEMENTS));
4802 Operand(ExternalReference::isolate_address(isolate())));
4819 __ Addu(a0, sp, Operand(1 * kPointerSize));
4823 __ Addu(at, scratch, Operand((FCA::kArgsLength - 1 + argc) * kPointerSize));
4826 __ li(at, Operand(argc));
4867 __ Addu(a1, a0, Operand(1 * kPointerSize)); // a1 = PCA
4876 __ Addu(a1, sp, Operand(1 * kPointerSize)); // a1 = AccessorInfo&
