Home | History | Annotate | Download | only in mips64

Lines Matching full:branch

127     __ Branch(&error, ne, scratch, Operand(zero_reg));
129 __ Branch(&done);
152 __ Branch(&done, eq, scratch, Operand(zero_reg));
161 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg));
163 __ Branch(&done);
178 __ Branch(&high_shift_needed, lt, scratch, Operand(32));
180 __ Branch(&high_shift_done);
198 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg));
203 __ Branch(&shift_done);
233 __ Branch(&not_identical, ne, a0, Operand(a1));
244 __ Branch(slow, greater, t0, Operand(FIRST_JS_RECEIVER_TYPE));
246 __ Branch(slow, eq, t0, Operand(SYMBOL_TYPE));
248 __ Branch(slow, eq, t0, Operand(SIMD128_VALUE_TYPE));
250 __ Branch(&heap_number, eq, t0, Operand(HEAP_NUMBER_TYPE));
253 __ Branch(slow, greater, t0, Operand(FIRST_JS_RECEIVER_TYPE));
255 __ Branch(slow, eq, t0, Operand(SYMBOL_TYPE));
257 __ Branch(slow, eq, t0, Operand(SIMD128_VALUE_TYPE));
262 __ Branch(&return_equal, ne, t0, Operand(ODDBALL_TYPE));
264 __ Branch(&return_equal, ne, a0, Operand(a6));
303 __ Branch(&return_equal, ne, a7, Operand(exp_mask_reg));
354 __ Branch(slow, ne, t0, Operand(HEAP_NUMBER_TYPE));
377 __ Branch(slow, ne, t0, Operand(HEAP_NUMBER_TYPE));
401 __ Branch(&first_non_object, less, a2, Operand(FIRST_JS_RECEIVER_TYPE));
411 __ Branch(&return_not_equal, eq, a2, Operand(ODDBALL_TYPE));
414 __ Branch(&return_not_equal, greater, a3, Operand(FIRST_JS_RECEIVER_TYPE));
417 __ Branch(&return_not_equal, eq, a3, Operand(ODDBALL_TYPE));
424 __ Branch(&return_not_equal, eq, at, Operand(zero_reg));
435 __ Branch(not_heap_numbers, ne, a2, Operand(HEAP_NUMBER_TYPE));
438 __ Branch(slow, ne, a3, Operand(a2));
461 __ Branch(&object_test, ne, at, Operand(zero_reg));
463 __ Branch(possible_strings, ne, at, Operand(zero_reg));
465 __ Branch(runtime_call, ge, a3, Operand(FIRST_NONSTRING_TYPE));
467 __ Branch(possible_strings, ne, at, Operand(zero_reg));
481 __ Branch(&undetectable, ne, at, Operand(zero_reg));
483 __ Branch(&return_unequal, ne, at, Operand(zero_reg));
486 __ Branch(runtime_call, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
488 __ Branch(runtime_call, lt, a3, Operand(FIRST_JS_RECEIVER_TYPE));
497 __ Branch(&return_unequal, eq, at, Operand(zero_reg));
503 __ Branch(&return_equal, eq, a2, Operand(ODDBALL_TYPE));
505 __ Branch(&return_unequal, ne, a3, Operand(ODDBALL_TYPE));
790 __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
824 __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
828 __ Branch(&bail_out, gt, zero_reg, Operand(scratch));
837 __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
843 __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
846 __ Branch(&while_true);
850 __ Branch(&done, ge, exponent, Operand(zero_reg));
1004 // This branch-and-link sequence is needed to find the current PC on mips
1006 __ bal(&find_ra); // bal exposes branch delay slot.
1013 // Stack space reservation moved to the branch delay slot below.
1037 __ Branch(&exception_returned, eq, a4, Operand(v0));
1049 __ Branch(&okay, eq, a4, Operand(a2));
1106 __ Branch(&zero, eq, cp, Operand(zero_reg));
1185 __ Branch(&non_outermost_js, ne, a6, Operand(zero_reg));
1190 __ nop(); // Branch delay slot nop.
1209 __ b(&exit); // b exposes branch delay slot.
1210 __ nop(); // Branch delay slot nop.
1258 __ Branch(&non_outermost_js_2,
1367 __ Branch(&runtime, eq, a0, Operand(zero_reg));
1374 __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
1394 __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
1406 __ Branch(&runtime, hi, a2, Operand(Smi::FromInt(temp)));
1450 __ Branch(&seq_string, eq, a1, Operand(zero_reg)); // Go to (4).
1458 __ Branch(&not_seq_nor_cons, ge, a1, Operand(kExternalStringTag));
1464 __ Branch(&runtime, ne, a0, Operand(a1));
1478 __ Branch(&runtime, ls, a3, Operand(a1));
1594 __ Branch(&success, eq, v0, Operand(1));
1598 __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
1600 __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
1609 __ Branch(&runtime, eq, v0, Operand(a1));
1634 __ Branch(&runtime, ne, a0, Operand(at));
1642 __ Branch(&runtime, gt, a2, Operand(at));
1678 __ Branch(&done, lt, a1, Operand(zero_reg));
1685 __ Branch(&next_capture, USE_DELAY_SLOT);
1686 __ daddiu(a0, a0, kPointerSize); // In branch delay slot.
1702 __ Branch(&not_long_external, gt, a1, Operand(kExternalStringTag));
1730 __ Branch(&runtime, ne, at, Operand(zero_reg));
1793 __ Branch(&done, eq, a1, Operand(weak_value));
1795 __ Branch(&done, eq, a5, Operand(at));
1798 __ Branch(&check_allocation_site, ne, feedback_map, Operand(at));
1810 __ Branch(&miss, ne, feedback_map, Operand(at));
1814 __ Branch(&megamorphic, ne, a1, Operand(a5));
1822 __ Branch(&initialize, eq, a5, Operand(at));
1836 __ Branch(&not_array_function, ne, a1, Operand(a5));
1843 __ Branch(&done);
1872 __ Branch(&non_function, ne, a5, Operand(JS_FUNCTION_TYPE));
1883 __ Branch(&feedback_register_initialized, eq, a5, Operand(at));
1920 __ Branch(receiver_not_string_, ne, a4, Operand(zero_reg));
1930 __ Branch(index_out_of_range_, ls, a4, Operand(index_));
1961 __ Branch(miss, ne, a1, Operand(at));
2000 __ Branch(&extra_checks_or_miss, ne, a1, Operand(a5));
2018 __ Branch(&call, eq, a4, Operand(at));
2023 __ Branch(&not_allocation_site, ne, a5, Operand(at));
2032 __ Branch(&miss);
2036 __ Branch(&uninitialized, eq, a4, Operand(at));
2042 __ Branch(&miss, ne, a5, Operand(JS_FUNCTION_TYPE));
2063 __ Branch(&miss, ne, a4, Operand(JS_FUNCTION_TYPE));
2068 __ Branch(&miss, eq, a1, Operand(a4));
2074 __ Branch(&miss, ne, t0, Operand(t1));
2094 __ Branch(&call_function);
2101 __ Branch(&call_count_incremented);
2167 __ Branch(&got_smi_index_);
2193 __ Branch(&slow_case_, hi, code_,
2202 __ Branch(&slow_case_, eq, result_, Operand(at));
2219 __ Branch(&exit_);
2256 __ Branch(&loop_entry);
2263 __ Branch(&loop, lt, dest, Operand(limit));
2278 __ Branch(&check_zero_length, eq, length, Operand(scratch2));
2288 __ Branch(&compare_chars, ne, length, Operand(zero_reg));
2318 __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
2336 __ Branch(&ret, eq, scratch2, Operand(scratch4));
2338 __ Branch(&ret, gt, scratch2, Operand(scratch4));
2368 __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
2370 __ Branch(&loop, ne, index, Operand(zero_reg));
2468 __ Branch(&left);
2481 __ Branch(&done);
2520 __ Branch(&miss, ne, a0, Operand(at));
2523 __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
2530 __ Branch(&unordered, eq, a1, Operand(at));
2559 __ Branch(&miss, ne, at, Operand(zero_reg));
2607 __ Branch(&done, ne, left, Operand(right));
2649 __ Branch(&miss, ne, tmp5, Operand(zero_reg));
2655 __ Branch(&left_ne_right, ne, left, Operand(right));
2671 __ Branch(&is_symbol, ne, tmp5, Operand(zero_reg));
2723 __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
2725 __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
2744 __ Branch(&miss, ne, a2, Operand(a4));
2745 __ Branch(&miss, ne, a3, Operand(a4));
2857 __ Branch(done, eq, entity_name, Operand(tmp));
2863 __ Branch(miss, eq, entity_name, Operand(Handle<Name>(name)));
2866 __ Branch(&good, eq, entity_name, Operand(tmp));
2892 __ Branch(done, eq, at, Operand(zero_reg));
2893 __ Branch(miss, ne, at, Operand(zero_reg));
2946 __ Branch(done, eq, name, Operand(at));
2969 __ Branch(done, ne, at, Operand(zero_reg));
2970 __ Branch(miss, eq, at, Operand(zero_reg));
3032 __ Branch(&not_in_dictionary, eq, entry_key, Operand(undefined));
3035 __ Branch(&in_dictionary, eq, entry_key, Operand(key));
3083 // The first two branch+nop instructions are generated with labels so as to
3286 __ Branch(&start_polymorphic, ne, receiver_map, Operand(cached_map));
3299 __ Branch(miss, eq, length, Operand(Smi::FromInt(2)));
3324 __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
3331 __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
3334 __ Branch(miss);
3349 __ Branch(try_array, ne, cached_map, Operand(receiver_map));
3407 __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
3411 __ Branch(&transition_call, ne, too_far, Operand(at));
3430 __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
3433 __ Branch(miss);
3461 __ Branch(&not_array, ne, scratch1, Heap::kFixedArrayMapRootIndex);
3473 __ Branch(&try_poly_name, ne, feedback, Heap::kmegamorphic_symbolRootIndex);
3480 __ Branch(&miss, ne, key, Operand(feedback));
3494 __ Branch(USE_DELAY_SLOT, &compare_map);
3614 __ Branch(&normal_sequence, ne, at, Operand(zero_reg));
3618 __ Branch(&normal_sequence, eq, a5, Operand(zero_reg));
3709 __ Branch(&not_zero_case, ne, at, Operand(zero_reg));
3713 __ Branch(&not_one_case, gt, a0, Operand(1));
3753 __ Branch(&subclassing, ne, a1, Operand(a3));
3758 __ Branch(&no_info, eq, a2, Operand(at));
3838 __ Branch(&done, eq, a3, Operand(FAST_ELEMENTS));
3846 __ Branch(&fast_elements_case, eq, a3, Operand(FAST_ELEMENTS));
3867 __ Branch(&new_object, ne, a2, Operand(JS_FUNCTION_TYPE));
3873 __ Branch(&new_object, ne, a0, Operand(MAP_TYPE));
3878 __ Branch(&new_object, ne, a0, Operand(a1));
3908 __ Branch(USE_DELAY_SLOT, &slack_tracking, ne, at, Operand(zero_reg));
3936 __ Branch(&finalize, eq, a3, Operand(zero_reg));
3994 __ Branch(&ok, eq, a1, Operand(a3));
4004 __ Branch(&no_rest_parameters, ne, a3,
4016 __ Branch(&rest_parameters, gt, a0, Operand(zero_reg));
4086 __ Branch(&done_loop, eq, a1, Operand(a3));
4091 __ Branch(&loop);
4109 __ Branch(&too_big_for_new_space, gt, a5,
4149 __ Branch(&ok, eq, a1, Operand(a3));
4174 __ Branch(&adaptor_frame, eq, a0,
4179 __ Branch(USE_DELAY_SLOT, &try_allocate);
4193 __ Branch(&try_allocate, le, a6, Operand(a5));
4205 __ Branch(USE_DELAY_SLOT, &param_map_size, eq, a6, Operand(zero_reg));
4232 __ Branch(&skip2_ne, ne, a6, Operand(zero_reg));
4236 __ Branch(&skip2_eq, eq, a6, Operand(zero_reg));
4270 __ Branch(&skip3, ne, a6, Operand(Smi::kZero));
4276 __ Branch(&skip_parameter_map, eq, a6, Operand(Smi::kZero));
4323 __ Branch(&parameters_loop, ne, a5, Operand(Smi::kZero));
4353 __ Branch(&arguments_loop, lt, a6, Operand(a5));
4385 __ Branch(&ok, eq, a1, Operand(a3));
4394 __ Branch(&arguments_adaptor, eq, a0,
4404 __ Branch(&arguments_done);
4442 __ Branch(&done_loop, eq, a1, Operand(a3));
4447 __ Branch(&loop);
4465 __ Branch(&too_big_for_new_space, gt, a5, Operand(kMaxRegularHeapObjectSize));
4514 __ Branch(&profiler_disabled, eq, t9, Operand(zero_reg));
4577 __ Branch(&delete_allocated_handles, ne, s1, Operand(at));
4599 __ Branch(&promote_scheduled_exception, ne, a4, Operand(a5));