Lines Matching full:branch
129 __ Branch(&error, ne, scratch, Operand(zero_reg));
131 __ Branch(&done);
154 __ Branch(&done, eq, scratch, Operand(zero_reg));
163 __ Branch(&normal_exponent, le, result_reg, Operand(zero_reg));
165 __ Branch(&done);
180 __ Branch(&high_shift_needed, lt, scratch, Operand(32));
182 __ Branch(&high_shift_done);
200 __ Branch(&pos_shift, ge, scratch, Operand(zero_reg));
205 __ Branch(&shift_done);
235 __ Branch(¬_identical, ne, a0, Operand(a1));
246 __ Branch(slow, greater, t4, Operand(FIRST_JS_RECEIVER_TYPE));
248 __ Branch(slow, eq, t4, Operand(SYMBOL_TYPE));
250 __ Branch(slow, eq, t4, Operand(SIMD128_VALUE_TYPE));
252 __ Branch(&heap_number, eq, t4, Operand(HEAP_NUMBER_TYPE));
255 __ Branch(slow, greater, t4, Operand(FIRST_JS_RECEIVER_TYPE));
257 __ Branch(slow, eq, t4, Operand(SYMBOL_TYPE));
259 __ Branch(slow, eq, t4, Operand(SIMD128_VALUE_TYPE));
264 __ Branch(&return_equal, ne, t4, Operand(ODDBALL_TYPE));
266 __ Branch(&return_equal, ne, a0, Operand(t2));
306 __ Branch(&return_equal, ne, t3, Operand(exp_mask_reg));
357 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
381 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
405 __ Branch(&first_non_object, less, a2, Operand(FIRST_JS_RECEIVER_TYPE));
415 __ Branch(&return_not_equal, eq, a2, Operand(ODDBALL_TYPE));
418 __ Branch(&return_not_equal, greater, a3, Operand(FIRST_JS_RECEIVER_TYPE));
421 __ Branch(&return_not_equal, eq, a3, Operand(ODDBALL_TYPE));
428 __ Branch(&return_not_equal, eq, at, Operand(zero_reg));
439 __ Branch(not_heap_numbers, ne, a2, Operand(HEAP_NUMBER_TYPE));
442 __ Branch(slow, ne, a3, Operand(a2));
465 __ Branch(&object_test, ne, at, Operand(zero_reg));
467 __ Branch(possible_strings, ne, at, Operand(zero_reg));
469 __ Branch(runtime_call, ge, a3, Operand(FIRST_NONSTRING_TYPE));
471 __ Branch(possible_strings, ne, at, Operand(zero_reg));
485 __ Branch(&undetectable, ne, at, Operand(zero_reg));
487 __ Branch(&return_unequal, ne, at, Operand(zero_reg));
490 __ Branch(runtime_call, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
492 __ Branch(runtime_call, lt, a3, Operand(FIRST_JS_RECEIVER_TYPE));
501 __ Branch(&return_unequal, eq, at, Operand(zero_reg));
507 __ Branch(&return_equal, eq, a2, Operand(ODDBALL_TYPE));
509 __ Branch(&return_unequal, ne, a3, Operand(ODDBALL_TYPE));
793 __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
827 __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
831 __ Branch(&bail_out, gt, zero_reg, Operand(scratch));
840 __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
846 __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
849 __ Branch(&while_true);
853 __ Branch(&done, ge, exponent, Operand(zero_reg));
1007 // This branch-and-link sequence is needed to find the current PC on mips
1009 __ bal(&find_ra); // bal exposes branch delay slot.
1016 // Stack space reservation moved to the branch delay slot below.
1040 __ Branch(&exception_returned, eq, t0, Operand(v0));
1052 __ Branch(&okay, eq, t0, Operand(a2));
1109 __ Branch(&zero, eq, cp, Operand(zero_reg));
1189 __ Branch(&non_outermost_js, ne, t2, Operand(zero_reg));
1194 __ nop(); // Branch delay slot nop.
1213 __ b(&exit); // b exposes branch delay slot.
1214 __ nop(); // Branch delay slot nop.
1263 __ Branch(&non_outermost_js_2,
1370 __ Branch(&runtime, eq, a0, Operand(zero_reg));
1377 __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
1397 __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
1409 __ Branch(
1450 __ Branch(&seq_string, eq, a1, Operand(zero_reg)); // Go to (5).
1458 __ Branch(¬_seq_nor_cons, ge, a1, Operand(kExternalStringTag));
1464 __ Branch(&runtime, ne, a0, Operand(a1));
1478 __ Branch(&runtime, ls, a3, Operand(a1));
1593 __ Branch(&success, eq, v0, Operand(1));
1597 __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
1599 __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
1608 __ Branch(&runtime, eq, v0, Operand(a1));
1634 __ Branch(&runtime, ne, a0, Operand(at));
1641 __ Branch(&runtime, gt, a2, Operand(at));
1677 __ Branch(&done, lt, a1, Operand(zero_reg));
1684 __ Branch(&next_capture, USE_DELAY_SLOT);
1685 __ addiu(a0, a0, kPointerSize); // In branch delay slot.
1701 __ Branch(¬_long_external, gt, a1, Operand(kExternalStringTag));
1729 __ Branch(&runtime, ne, at, Operand(zero_reg));
1791 __ Branch(&done, eq, a1, Operand(weak_value));
1793 __ Branch(&done, eq, t2, Operand(at));
1796 __ Branch(&check_allocation_site, ne, feedback_map, Operand(at));
1808 __ Branch(&miss, ne, feedback_map, Operand(at));
1812 __ Branch(&megamorphic, ne, a1, Operand(t2));
1820 __ Branch(&initialize, eq, t2, Operand(at));
1833 __ Branch(¬_array_function, ne, a1, Operand(t2));
1840 __ Branch(&done);
1867 __ Branch(&non_function, ne, t1, Operand(JS_FUNCTION_TYPE));
1877 __ Branch(&feedback_register_initialized, eq, t1, Operand(at));
1914 __ Branch(miss, ne, a1, Operand(at));
1952 __ Branch(&extra_checks_or_miss, ne, a1, Operand(t1));
1971 __ Branch(&call, eq, t0, Operand(at));
1976 __ Branch(¬_allocation_site, ne, t1, Operand(at));
1985 __ Branch(&miss);
1989 __ Branch(&uninitialized, eq, t0, Operand(at));
1995 __ Branch(&miss, ne, t1, Operand(JS_FUNCTION_TYPE));
2015 __ Branch(&miss, ne, t0, Operand(JS_FUNCTION_TYPE));
2020 __ Branch(&miss, eq, a1, Operand(t0));
2026 __ Branch(&miss, ne, t0, Operand(t1));
2046 __ Branch(&call_function);
2053 __ Branch(&call_count_incremented);
2093 __ Branch(receiver_not_string_, ne, t0, Operand(zero_reg));
2103 __ Branch(index_out_of_range_, ls, t0, Operand(index_));
2157 __ Branch(&got_smi_index_);
2191 __ Branch(&slow_case_, ne, t0, Operand(zero_reg));
2199 __ Branch(&slow_case_, eq, result_, Operand(t0));
2216 __ Branch(&exit_);
2253 __ Branch(&loop_entry);
2260 __ Branch(&loop, lt, dest, Operand(limit));
2275 __ Branch(&check_zero_length, eq, length, Operand(scratch2));
2285 __ Branch(&compare_chars, ne, length, Operand(zero_reg));
2315 __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
2333 __ Branch(&ret, eq, scratch2, Operand(scratch4));
2335 __ Branch(&ret, gt, scratch2, Operand(scratch4));
2365 __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
2367 __ Branch(&loop, ne, index, Operand(zero_reg));
2465 __ Branch(&left);
2478 __ Branch(&done);
2517 __ Branch(&miss, ne, a0, Operand(at));
2520 __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
2527 __ Branch(&unordered, eq, a1, Operand(at));
2556 __ Branch(&miss, ne, at, Operand(zero_reg));
2604 __ Branch(&done, ne, left, Operand(right));
2646 __ Branch(&miss, ne, tmp5, Operand(zero_reg));
2652 __ Branch(&left_ne_right, ne, left, Operand(right));
2668 __ Branch(&is_symbol, ne, tmp5, Operand(zero_reg));
2720 __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
2722 __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
2741 __ Branch(&miss, ne, a2, Operand(t0));
2742 __ Branch(&miss, ne, a3, Operand(t0));
2853 __ Branch(done, eq, entity_name, Operand(tmp));
2859 __ Branch(miss, eq, entity_name, Operand(Handle<Name>(name)));
2862 __ Branch(&good, eq, entity_name, Operand(tmp));
2888 __ Branch(done, eq, at, Operand(zero_reg));
2889 __ Branch(miss, ne, at, Operand(zero_reg));
2943 __ Branch(done, eq, name, Operand(at));
2966 __ Branch(done, ne, at, Operand(zero_reg));
2967 __ Branch(miss, eq, at, Operand(zero_reg));
3029 __ Branch(¬_in_dictionary, eq, entry_key, Operand(undefined));
3032 __ Branch(&in_dictionary, eq, entry_key, Operand(key));
3080 // The first two branch+nop instructions are generated with labels so as to
3283 __ Branch(&start_polymorphic, ne, receiver_map, Operand(cached_map));
3297 __ Branch(miss, eq, length, Operand(Smi::FromInt(2)));
3321 __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
3328 __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
3346 __ Branch(try_array, ne, cached_map, Operand(receiver_map));
3402 __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
3406 __ Branch(&transition_call, ne, too_far, Operand(at));
3426 __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
3457 __ Branch(¬_array, ne, scratch1, Operand(at));
3471 __ Branch(&try_poly_name, ne, feedback, Operand(at));
3478 __ Branch(&miss, ne, key, Operand(feedback));
3491 __ Branch(USE_DELAY_SLOT, &compare_map);
3610 __ Branch(&normal_sequence, ne, at, Operand(zero_reg));
3615 __ Branch(&normal_sequence, eq, t1, Operand(zero_reg));
3706 __ Branch(¬_zero_case, ne, at, Operand(zero_reg));
3710 __ Branch(¬_one_case, gt, a0, Operand(1));
3750 __ Branch(&subclassing, ne, a1, Operand(a3));
3755 __ Branch(&no_info, eq, a2, Operand(at));
3835 __ Branch(&done, eq, a3, Operand(FAST_ELEMENTS));
3843 __ Branch(&fast_elements_case, eq, a3, Operand(FAST_ELEMENTS));
3864 __ Branch(&new_object, ne, a2, Operand(JS_FUNCTION_TYPE));
3870 __ Branch(&new_object, ne, a0, Operand(MAP_TYPE));
3875 __ Branch(&new_object, ne, a0, Operand(a1));
3905 __ Branch(USE_DELAY_SLOT, &slack_tracking, ne, at, Operand(0));
3933 __ Branch(&finalize, eq, a3, Operand(zero_reg));
3990 __ Branch(&ok, eq, a1, Operand(a3));
4000 __ Branch(&no_rest_parameters, ne, a3,
4011 __ Branch(&rest_parameters, gt, a0, Operand(zero_reg));
4079 __ Branch(&done_loop, eq, a1, Operand(a3));
4102 __ Branch(&too_big_for_new_space, gt, t0,
4140 __ Branch(&ok, eq, a1, Operand(a3));
4164 __ Branch(&adaptor_frame, eq, a0,
4169 __ Branch(USE_DELAY_SLOT, &try_allocate);
4182 __ Branch(&try_allocate, le, t2, Operand(t1));
4194 __ Branch(USE_DELAY_SLOT, ¶m_map_size, eq, t2, Operand(zero_reg));
4220 __ Branch(&skip2_ne, ne, t2, Operand(zero_reg));
4224 __ Branch(&skip2_eq, eq, t2, Operand(zero_reg));
4258 __ Branch(&skip3, ne, t2, Operand(Smi::kZero));
4264 __ Branch(&skip_parameter_map, eq, t2, Operand(Smi::kZero));
4309 __ Branch(¶meters_loop, ne, t1, Operand(Smi::kZero));
4338 __ Branch(&arguments_loop, lt, t2, Operand(t1));
4370 __ Branch(&ok, eq, a1, Operand(a3));
4379 __ Branch(&arguments_adaptor, eq, a0,
4389 __ Branch(&arguments_done);
4424 __ Branch(&done_loop, eq, a1, Operand(a3));
4429 __ Branch(&loop);
4447 __ Branch(&too_big_for_new_space, gt, t0, Operand(kMaxRegularHeapObjectSize));
4492 __ Branch(&profiler_disabled, eq, t9, Operand(zero_reg));
4555 __ Branch(&delete_allocated_handles, ne, s1, Operand(at));
4578 __ Branch(&promote_scheduled_exception, ne, t0, Operand(t1));