Lines Matching full:branch
65 __ Branch(not_a_heap_number, ne, scratch1, Operand(scratch2));
317 __ Branch(&slow_case, eq, a3, Operand(t1));
325 __ Branch(&check_fast_elements, ne, v0, Operand(t1));
333 __ Branch(&double_elements, ne, v0, Operand(t1));
394 __ Branch(&slow_case, eq, a3, Operand(t0));
401 __ Branch(&slow_case, ne, a0, Operand(size >> kPointerSizeLog2));
481 __ Branch(¬_special, gt, source_, Operand(1));
608 __ Branch(&done);
654 __ Branch(not_number, ne, scratch1, Operand(heap_number_map));
706 __ Branch(&done, eq, int_scratch, Operand(zero_reg));
712 __ Branch(&skip_sub, ge, dst2, Operand(zero_reg));
737 __ Branch(&fewer_than_20_useful_bits, lt, scratch2, Operand(zero_reg));
744 __ Branch(&done);
781 __ Branch(&done);
806 __ Branch(not_int32, ne, except_flag, Operand(zero_reg));
821 __ Branch(&done, eq, scratch1, Operand(zero_reg));
879 __ Branch(not_int32, ne, except_flag, Operand(zero_reg));
891 __ Branch(&done, eq, dst, Operand(zero_reg));
910 __ Branch(&skip_sub, ge, scratch1, Operand(zero_reg));
940 __ Branch(not_int32, lt, scratch, Operand(zero_reg));
949 __ Branch(not_int32, gt, tmp, Operand(30));
952 __ Branch(not_int32, ne, tmp, Operand(zero_reg));
975 __ Branch(not_int32, ne, src1, Operand(zero_reg));
1066 __ Branch(&max_negative_int, eq, the_int_, Operand(0x80000000u));
1120 __ Branch(¬_identical, ne, a0, Operand(a1));
1133 __ Branch(slow, greater, t4, Operand(FIRST_SPEC_OBJECT_TYPE));
1136 __ Branch(&heap_number, eq, t4, Operand(HEAP_NUMBER_TYPE));
1139 __ Branch(slow, greater, t4, Operand(FIRST_SPEC_OBJECT_TYPE));
1144 __ Branch(&return_equal, ne, t4, Operand(ODDBALL_TYPE));
1146 __ Branch(&return_equal, ne, a0, Operand(t2));
1187 __ Branch(&return_equal, ne, t3, Operand(exp_mask_reg));
1238 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
1277 __ Branch(slow, ne, t4, Operand(HEAP_NUMBER_TYPE));
1332 __ Branch(&lhs_not_nan_exp_mask_is_loaded, ne, t5, Operand(exp_mask_reg));
1335 __ Branch(&one_is_nan, ne, t5, Operand(zero_reg));
1337 __ Branch(&one_is_nan, ne, lhs_mantissa, Operand(zero_reg));
1343 __ Branch(&neither_is_nan, ne, t5, Operand(exp_mask_reg));
1346 __ Branch(&one_is_nan, ne, t5, Operand(zero_reg));
1348 __ Branch(&neither_is_nan, eq, rhs_mantissa, Operand(zero_reg));
1395 __ Branch(&return_result_not_equal, ne, v0, Operand(zero_reg));
1398 __ Branch(&return_result_equal, eq, v0, Operand(zero_reg));
1405 __ Branch(&return_result_not_equal, ne, t4, Operand(zero_reg));
1466 __ Branch(&first_non_object, less, a2, Operand(FIRST_SPEC_OBJECT_TYPE));
1476 __ Branch(&return_not_equal, eq, a2, Operand(ODDBALL_TYPE));
1479 __ Branch(&return_not_equal, greater, a3, Operand(FIRST_SPEC_OBJECT_TYPE));
1482 __ Branch(&return_not_equal, eq, a3, Operand(ODDBALL_TYPE));
1490 __ Branch(&return_not_equal, ne, t0, Operand(zero_reg));
1501 __ Branch(not_heap_numbers, ne, a2, Operand(HEAP_NUMBER_TYPE));
1504 __ Branch(slow, ne, a3, Operand(a2));
1541 __ Branch(&object_test, ne, at, Operand(zero_reg));
1543 __ Branch(possible_strings, eq, at, Operand(zero_reg));
1545 __ Branch(not_both_strings, ge, a3, Operand(FIRST_NONSTRING_TYPE));
1547 __ Branch(possible_strings, eq, at, Operand(zero_reg));
1555 __ Branch(not_both_strings, lt, a2, Operand(FIRST_SPEC_OBJECT_TYPE));
1557 __ Branch(not_both_strings, lt, a3, Operand(FIRST_SPEC_OBJECT_TYPE));
1632 __ Branch(not_found);
1637 __ Branch(not_found);
1654 __ Branch(not_found, ne, object, Operand(probe));
1916 __ Branch(&skip, ge, at, Operand(FIRST_NONSTRING_TYPE));
1926 __ Branch(¬_heap_number, ne, map, Operand(at));
2090 __ Branch(slow, eq, t0, Operand(zero_reg));
2193 __ Branch(&try_float, lt, a2, Operand(zero_reg));
2412 __ Branch(¬_smi_result, ne, scratch1, Operand(scratch2));
2422 __ Branch(&skip, lt, scratch2, Operand(zero_reg));
2438 __ Branch(¬_smi_result, eq, scratch2, Operand(zero_reg));
2444 __ Branch(¬_smi_result, ne, scratch1, Operand(zero_reg));
2446 __ Branch(&done, ne, scratch1, Operand(zero_reg));
2447 __ Branch(¬_smi_result, lt, scratch2, Operand(zero_reg));
2451 __ Branch(¬_smi_result, lt, scratch2, Operand(zero_reg));
2464 __ Branch(¬_smi_result, eq, scratch2, Operand(zero_reg));
2469 __ Branch(&done, ne, scratch2, Operand(zero_reg));
2470 __ Branch(¬_smi_result, lt, scratch1, Operand(zero_reg));
2474 __ Branch(¬_smi_result, lt, scratch1, Operand(zero_reg));
2508 __ Branch(¬_smi_result, ne, scratch1, Operand(zero_reg));
2520 __ Branch(¬_smi_result, lt, scratch2, Operand(zero_reg));
2677 __ Branch(&result_not_a_smi, lt, a2, Operand(zero_reg));
2679 __ Branch(not_numbers, lt, a2, Operand(zero_reg));
2692 __ Branch(&result_not_a_smi, lt, a3, Operand(zero_reg));
2823 __ Branch(&call_runtime, ge, a2, Operand(FIRST_NONSTRING_TYPE));
2828 __ Branch(&call_runtime, ge, a2, Operand(FIRST_NONSTRING_TYPE));
2939 __ Branch(&transition, ne, except_flag, Operand(zero_reg));
2946 __ Branch(&return_heap_number, lt, scratch2, Operand(zero_reg));
2949 __ Branch(¬_zero, ne, scratch1, Operand(zero_reg));
2952 __ Branch(&return_heap_number, ne, scratch2, Operand(zero_reg));
3011 __ Branch(&call_runtime);
3073 __ Branch((result_type_ <= BinaryOpIC::INT32)
3080 __ Branch((result_type_ <= BinaryOpIC::INT32)
3099 __ Branch(&return_heap_number, lt, scratch1, Operand(zero_reg));
3171 __ Branch(&check, ne, a1, Operand(t0));
3180 __ Branch(&done, ne, a0, Operand(t0));
3228 __ Branch(&left_not_string, ge, a2, Operand(FIRST_NONSTRING_TYPE));
3238 __ Branch(&call_runtime, ge, a2, Operand(FIRST_NONSTRING_TYPE));
3312 __ Branch(&allocated);
3360 __ Branch(&loaded);
3401 __ Branch(&invalid_cache, eq, cache_entry, Operand(zero_reg));
3428 __ Branch(&calculate, ne, a2, Operand(t0));
3429 __ Branch(&calculate, ne, a3, Operand(t1));
3611 __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
3624 __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
3645 __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
3729 __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
3738 __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
3744 __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
3747 __ Branch(&while_true);
3751 __ Branch(&done, ge, exponent, Operand(zero_reg));
3882 // This branch-and-link sequence is needed to find the current PC on mips,
3887 masm->bal(&find_ra); // bal exposes branch delay slot.
3897 // Stack space reservation moved to the branch delay slot below.
3923 __ Branch(USE_DELAY_SLOT, &failure_returned, eq, t0, Operand(zero_reg));
3924 // Restore stack (remove arg slots) in branch delay slot.
3939 __ Branch(&retry, eq, t0, Operand(zero_reg));
3943 __ Branch(USE_DELAY_SLOT,
3961 __ Branch(throw_termination_exception, eq, v0, Operand(t0));
4124 __ Branch(&non_outermost_js, ne, t2, Operand(zero_reg));
4129 __ nop(); // Branch delay slot nop.
4148 __ b(&exit); // b exposes branch delay slot.
4149 __ nop(); // Branch
4205 __ Branch(&non_outermost_js_2,
4275 __ Branch(&miss, ne, function, Operand(at));
4277 __ Branch(&miss, ne, map, Operand(at));
4320 __ Branch(&is_instance, eq, scratch, Operand(prototype));
4321 __ Branch(&is_not_instance, eq, scratch, Operand(scratch2));
4324 __ Branch(&loop);
4369 __ Branch(&slow, ne, scratch, Operand(JS_FUNCTION_TYPE));
4372 __ Branch(&object_not_null,
4433 __ Branch(&adaptor,
4441 __ Branch(&slow, hs, a1, Operand(a0));
4455 __ Branch(&slow, Ugreater_equal, a1, Operand(a0));
4480 __ Branch(&runtime,
4515 __ Branch(&adaptor_frame,
4523 __ nop(); // Branch delay slot nop.
4537 __ Branch(&skip_min, lt, a1, Operand(a2));
4550 __ Branch(USE_DELAY_SLOT, ¶m_map_size, eq, a1, Operand(zero_reg));
4578 __ Branch(&skip2_ne, ne, a1, Operand(zero_reg));
4582 __ Branch(&skip2_eq, eq, a1, Operand(zero_reg));
4622 __ Branch(&skip3, ne, a1, Operand(Smi::FromInt(0)));
4628 __ Branch(&skip_parameter_map, eq, a1, Operand(Smi::FromInt(0)));
4677 __ Branch(¶meters_loop, ne, t2, Operand(Smi::FromInt(0)));
4704 __ Branch(&arguments_loop, lt, t5, Operand(a2));
4725 __ Branch(&adaptor_frame,
4732 __ Branch(&try_allocate);
4748 __ Branch(&add_arguments_object, eq, a1, Operand(zero_reg));
4780 __ Branch(&done, eq, a1, Operand(zero_reg));
4808 __ Branch(&loop, ne, a1, Operand(zero_reg));
4861 __ Branch(&runtime, eq, a0, Operand(zero_reg));
4868 __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
4888 __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
4900 __ Branch(&runtime, hi, a2, Operand(OffsetsVector::kStaticOffsetsVectorSize));
4910 __ Branch(&runtime, ne, a0, Operand(zero_reg));
4923 __ Branch(&runtime, ls, a3, Operand(a0));
4932 __ Branch(&runtime, ne, a1, Operand(JS_ARRAY_TYPE));
4937 __ Branch(&runtime, ne, a0, Operand(
4945 __ Branch(&runtime, gt, a2, Operand(at));
4963 __ Branch(&seq_string, eq, a1, Operand(zero_reg));
4980 __ Branch(&cons_string, lt, a1, Operand(kExternalStringTag));
4981 __ Branch(&external_string, eq, a1, Operand(kExternalStringTag));
4986 __ Branch(&runtime, ne, at, Operand(zero_reg));
4998 __ Branch(&runtime, ne, a0, Operand(a1));
5006 __ Branch(&external_string, ne, at, Operand(zero_reg));
5128 __ Branch(&success, eq, v0, Operand(NativeRegExpMacroAssembler::SUCCESS));
5130 __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
5132 __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
5141 __ Branch(&runtime, eq, v0, Operand(a1));
5148 __ Branch(&termination_exception, eq, v0, Operand(a0));
5211 __ Branch(&done, lt, a1, Operand(zero_reg));
5218 __ Branch(&next_capture, USE_DELAY_SLOT);
5219 __ addiu(a0, a0, kPointerSize); // In branch delay slot.
5265 __ Branch(&slowcase, hi, a1, Operand(Smi::FromInt(kMaxInlineLength)));
5331 __ Branch(&done, ge, a3, Operand(t1)); // Break when a3 past end of elem.
5333 __ Branch(&loop, USE_DELAY_SLOT);
5334 __ addiu(a3, a3, kPointerSize); // In branch delay slot.
5362 __ Branch(&done, eq, a3, Operand(a1));
5364 __ Branch(&done, eq, a3, Operand(at));
5370 __ Branch(USE_DELAY_SLOT, &done, eq, a3, Operand(at));
5401 __ Branch(&call, ne, t0, Operand(at));
5414 __ Branch(&slow, ne, a2, Operand(JS_FUNCTION_TYPE));
5423 __ Branch(&call_as_function, eq, t0, Operand(at));
5440 __ Branch(&non_function, ne, a2, Operand(JS_FUNCTION_PROXY_TYPE));
5475 __ Branch(&slow, ne, a3, Operand(JS_FUNCTION_TYPE));
5492 __ Branch(&non_function_call, ne, a3, Operand(JS_FUNCTION_PROXY_TYPE));
5565 __ Branch(receiver_not_string_, ne, t0, Operand(zero_reg));
5574 __ Branch(index_out_of_range_, ls, t0, Operand(index_));
5625 __ Branch(&got_smi_index_);
5661 __ Branch(&slow_case_, ne, t0, Operand(zero_reg));
5670 __ Branch(&slow_case_, eq, result_, Operand(t0));
5687 __ Branch(&exit_);
5723 __ Branch(&done, eq, count, Operand(zero_reg));
5731 __ Branch(&loop, lt, dest, Operand(count));
5779 __ Branch(&done, eq, count, Operand(zero_reg));
5786 __ Branch(&byte_loop, lt, scratch1, Operand(zero_reg));
5792 __ Branch(&dest_aligned, eq, scratch4, Operand(zero_reg));
5800 __ Branch(&aligned_loop, le, scratch4, Operand(kReadAlignmentMask));
5807 __ Branch(&simple_loop, eq, scratch4, Operand(zero_reg));
5821 __ Branch(&loop, ge, scratch2, Operand(kReadAlignment));
5824 __ Branch(&byte_loop);
5838 __ Branch(&loop, ge, scratch2, Operand(kReadAlignment));
5844 __ Branch(&done, ge, dest, Operand(limit));
5849 __ Branch(&byte_loop);
5871 __ Branch(¬_array_index,
5879 // not_found branch expects this combination in c1 register.
5882 __ Branch(&tmp, Ugreater, scratch, Operand(static_cast<int>('9' - '0')));
5885 __ Branch(
5955 __ Branch(&is_string, ne, scratch, Operand(ODDBALL_TYPE));
5957 __ Branch(not_found, eq, undefined, Operand(candidate));
5975 __ Branch(&next_probe[i], ne, scratch, Operand(Smi::FromInt(2)));
5980 __ Branch(&found_in_symbol_table, eq, chars, Operand(scratch));
6076 __ Branch(&runtime, lt, a3, Operand(zero_reg)); // From < 0.
6078 __ Branch(&runtime, gt, a3, Operand(a2)); // Fail if from > to.
6088 __ Branch(&runtime, ne, t0, Operand(zero_reg));
6096 __ Branch(&return_v0, eq, a2, Operand(t0));
6103 __ Branch(&result_longer_than_two, gt, a2, Operand(t0));
6104 __ Branch(&runtime, lt, a2, Operand(t0));
6139 __ Branch(USE_DELAY_SLOT, &seq_or_external_string, eq, t0, Operand(zero_reg));
6142 __ Branch(&sliced_string, ne, t0, Operand(zero_reg));
6146 __ Branch(&runtime, ne, t1, Operand(t0));
6177 __ Branch(©_routine, lt, a2, Operand(SlicedString::kMinLength));
6187 __ Branch(&two_byte_slice, eq, t0, Operand(zero_reg));
6209 __ Branch(&sequential_string, eq, t0, Operand(zero_reg));
6215 __ Branch(&runtime, ne, t0, Operand(zero_reg));
6229 __ Branch(&two_byte_sequential, eq, t0, Operand(zero_reg));
6291 __ Branch(&check_zero_length, eq, length, Operand(scratch2));
6300 __ Branch(&compare_chars, ne, length, Operand(zero_reg));
6334 __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
6353 __ Branch(&ret, eq, scratch2, Operand(scratch4));
6355 __ Branch(&ret, gt, scratch2, Operand(scratch4));
6390 __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
6392 __ Branch(&loop, ne, index, Operand(zero_reg));
6408 __ Branch(¬_same, ne, a0, Operand(a1));
6456 __ Branch(&call_runtime, ne, t4, Operand(zero_reg));
6491 __ and_(t4, t4, t5); // Branch if both strings were non-empty.
6492 __ Branch(&strings_not_empty, ne, t4, Operand(zero_reg));
6518 __ Branch(&longer_than_two, ne, t2, Operand(2));
6556 __ Branch(&string_add_flat_result, lt, t2, Operand(ConsString::kMinLength));
6561 __ Branch(&call_runtime, hs, t2, Operand(String::kMaxLength + 1));
6573 // Branch to non_ascii if either string-encoding field is zero (non-ASCII).
6576 __ Branch(&non_ascii, eq, t4, Operand(zero_reg));
6593 // Branch to if _both_ instances have kAsciiDataHintMask set.
6596 __ Branch(&ascii_data, ne, at, Operand(zero_reg));
6601 __ Branch(&ascii_data, eq, t0, Operand(kAsciiStringTag | kAsciiDataHintTag));
6605 __ Branch(&allocated);
6629 __ Branch(&call_runtime, ne, t3, Operand(zero_reg));
6636 __ Branch(&skip_first_add, ne, t4, Operand(zero_reg));
6637 __ Branch(USE_DELAY_SLOT, &first_prepared);
6643 __ Branch(&call_runtime, ne, t4, Operand(zero_reg));
6651 __ Branch(&skip_second_add, ne, t4, Operand(zero_reg));
6652 __ Branch(USE_DELAY_SLOT, &second_prepared);
6658 __ Branch(&call_runtime, ne, t4, Operand(zero_reg));
6671 __ Branch(&non_ascii_string_add_flat_result, eq, t4, Operand(zero_reg));
6727 __ Branch(&done, lt, scratch1, Operand(FIRST_NONSTRING_TYPE));
6749 __ Branch(slow, ne, scratch2, Operand(JS_VALUE_TYPE));
6753 __ Branch(slow, ne, scratch2, Operand(scratch4));
6793 __ Branch(&maybe_undefined1, ne, a2, Operand(HEAP_NUMBER_TYPE));
6795 __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
6838 __ Branch(&miss, ne, a0, Operand(at));
6840 __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
6847 __ Branch(&unordered, eq, a1, Operand(at));
6876 __ Branch(&miss, eq, tmp1, Operand(zero_reg));
6920 __ Branch(&miss, ne, tmp5, Operand(zero_reg));
6926 __ Branch(&left_ne_right, ne, left, Operand(right));
6941 __ Branch(&is_symbol, eq, tmp5, Operand(zero_reg));
6985 __ Branch(&miss, ne, a2, Operand(JS_OBJECT_TYPE));
6987 __ Branch(&miss, ne, a2, Operand(JS_OBJECT_TYPE));
7004 __ Branch(&miss, ne, a2, Operand(known_map_));
7005 __ Branch(&miss, ne, a3, Operand(known_map_));
7075 masm->nop(); // Branch delay slot nop.
7131 __ Branch(done, eq, entity_name, Operand(tmp));
7138 __ Branch(miss, eq, entity_name, Operand(Handle<String>(name)));
7141 __ Branch(&the_hole, eq, entity_name, Operand(tmp));
7148 __ Branch(miss, eq, scratch0, Operand(zero_reg));
7170 __ Branch(done, eq, at, Operand(zero_reg));
7171 __ Branch(miss, ne, at, Operand(zero_reg));
7228 __ Branch(done, eq, name, Operand(at));
7251 __ Branch(done, ne, at, Operand(zero_reg));
7252 __ Branch(miss, eq, at, Operand(zero_reg));
7318 __ Branch(¬_in_dictionary, eq, entry_key, Operand(undefined));
7321 __ Branch(&in_dictionary, eq, entry_key, Operand(key));
7329 __ Branch(&maybe_in_dictionary, eq, result, Operand(zero_reg));
7444 // The first two branch+nop instructions are generated with labels so as to
