Home | History | Annotate | Download | only in mips

Lines Matching refs: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(&not_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));
789     __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
802     __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
824     __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
906   __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
915   __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
921   __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
924   __ Branch(&while_true);
928   __ Branch(&done, ge, exponent, Operand(zero_reg));
1098       // This branch-and-link sequence is needed to find the current PC on mips
1100       __ bal(&find_ra);  // bal exposes branch delay slot.
1107     // Stack space reservation moved to the branch delay slot below.
1131   __ Branch(&exception_returned, eq, t0, Operand(v0));
1143     __ Branch(&okay, eq, t0, Operand(a2));
1200   __ Branch(&zero, eq, cp, Operand(zero_reg));
1280   __ Branch(&non_outermost_js, ne, t2, Operand(zero_reg));
1285   __ nop();   // Branch delay slot nop.
1304   __ b(&exit);  // b exposes branch delay slot.
1305   __ nop();   // Branch delay slot nop.
1360   __ Branch(&non_outermost_js_2,
1467   __ Branch(&runtime, eq, a0, Operand(zero_reg));
1474   __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
1494   __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
1506   __ Branch(
1547   __ Branch(&seq_string, eq, a1, Operand(zero_reg));  // Go to (5).
1555   __ Branch(&not_seq_nor_cons, ge, a1, Operand(kExternalStringTag));
1561   __ Branch(&runtime, ne, a0, Operand(a1));
1575   __ Branch(&runtime, ls, a3, Operand(a1));
1690   __ Branch(&success, eq, v0, Operand(1));
1694   __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
1696   __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
1705   __ Branch(&runtime, eq, v0, Operand(a1));
1728   __ Branch(&runtime, ne, a2, Operand(JS_ARRAY_TYPE));
1734   __ Branch(&runtime, ne, a0, Operand(at));
1741   __ Branch(&runtime, gt, a2, Operand(at));
1786   __ Branch(&done, lt, a1, Operand(zero_reg));
1793   __ Branch(&next_capture, USE_DELAY_SLOT);
1794   __ addiu(a0, a0, kPointerSize);  // In branch delay slot.
1810   __ Branch(&not_long_external, gt, a1, Operand(kExternalStringTag));
1838   __ Branch(&runtime, ne, at, Operand(zero_reg));
1900   __ Branch(&done_increment_count, eq, a1, Operand(weak_value));
1902   __ Branch(&done, eq, t2, Operand(at));
1905   __ Branch(&check_allocation_site, ne, feedback_map, Operand(at));
1917   __ Branch(&miss, ne, feedback_map, Operand(at));
1921   __ Branch(&megamorphic, ne, a1, Operand(t2));
1929   __ Branch(&initialize, eq, t2, Operand(at));
1942   __ Branch(&not_array_function, ne, a1, Operand(t2));
1949   __ Branch(&done_initialize_count);
1959   __ Branch(USE_DELAY_SLOT, &done);
1985   __ Branch(&non_function, ne, t1, Operand(JS_FUNCTION_TYPE));
1995   __ Branch(&feedback_register_initialized, eq, t1, Operand(at));
2023   __ Branch(miss, ne, a1, Operand(at));
2067   __ Branch(&extra_checks_or_miss, ne, a1, Operand(t1));
2090   __ Branch(&call, eq, t0, Operand(at));
2095   __ Branch(&not_allocation_site, ne, t1, Operand(at));
2104     __ Branch(&miss);
2108   __ Branch(&uninitialized, eq, t0, Operand(at));
2114   __ Branch(&miss, ne, t1, Operand(JS_FUNCTION_TYPE));
2132   __ Branch(&miss, ne, t0, Operand(JS_FUNCTION_TYPE));
2137   __ Branch(&miss, eq, a1, Operand(t0));
2143   __ Branch(&miss, ne, t0, Operand(t1));
2162   __ Branch(&call_function);
2169   __ Branch(&call);
2201     __ Branch
2211   __ Branch(index_out_of_range_, ls, t0, Operand(index_));
2265   __ Branch(&got_smi_index_);
2299   __ Branch(&slow_case_, ne, t0, Operand(zero_reg));
2307   __ Branch(&slow_case_, eq, result_, Operand(t0));
2324   __ Branch(&exit_);
2361   __ Branch(&loop_entry);
2368   __ Branch(&loop, lt, dest, Operand(limit));
2405   __ Branch(&runtime, lt, a3, Operand(zero_reg));  // From < 0.
2407   __ Branch(&runtime, gt, a3, Operand(a2));  // Fail if from > to.
2417   __ Branch(&runtime, ne, t0, Operand(zero_reg));
2420   __ Branch(&single_char, eq, a2, Operand(1));
2429   __ Branch(&return_v0, eq, a2, Operand(t0));
2431   __ Branch(&runtime, hi, a2, Operand(t0));
2445   __ Branch(USE_DELAY_SLOT, &seq_or_external_string, eq, t0, Operand(zero_reg));
2448   __ Branch(&sliced_string, ne, t0, Operand(zero_reg));
2452   __ Branch(&runtime, ne, t1, Operand(t0));
2483     __ Branch(&copy_routine, lt, a2, Operand(SlicedString::kMinLength));
2493     __ Branch(&two_byte_slice, eq, t0, Operand(zero_reg));
2515   __ Branch(&sequential_string, eq, t0, Operand(zero_reg));
2521   __ Branch(&runtime, ne, t0, Operand(zero_reg));
2535   __ Branch(&two_byte_sequential, eq, t0, Operand(zero_reg));
2605   __ Branch(&not_string, ge, a1, Operand(FIRST_NONSTRING_TYPE));
2611   __ Branch(&not_heap_number, ne, a1, Operand(HEAP_NUMBER_TYPE));
2618   __ Branch(&not_oddball, ne, a1, Operand(ODDBALL_TYPE));
2638   __ Branch(&not_name, gt, a1, Operand(LAST_NAME_TYPE));
2644   __ Branch(&not_heap_number, ne, a1, Operand(HEAP_NUMBER_TYPE));
2651   __ Branch(&not_oddball, ne, a1, Operand(ODDBALL_TYPE));
2670   __ Branch
2680   __ Branch(&compare_chars, ne, length, Operand(zero_reg));
2710   __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
2728   __ Branch(&ret, eq, scratch2, Operand(scratch4));
2730   __ Branch(&ret, gt, scratch2, Operand(scratch4));
2760   __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
2762   __ Branch(&loop, ne, index, Operand(zero_reg));
2860   __ Branch(&left);
2873   __ Branch(&done);
2912     __ Branch(&miss, ne, a0, Operand(at));
2915     __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
2922     __ Branch(&unordered, eq, a1, Operand(at));
2951   __ Branch(&miss, ne, at, Operand(zero_reg));
2999   __ Branch(&done, ne, left, Operand(right));
3041   __ Branch(&miss, ne, tmp5, Operand(zero_reg));
3047   __ Branch(&left_ne_right, ne, left, Operand(right));
3063     __ Branch(&is_symbol, ne, tmp5, Operand(zero_reg));
3115   __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
3117   __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
3136   __ Branch(&miss, ne, a2, Operand(t0));
3137   __ Branch(&miss, ne, a3, Operand(t0));
3248     __ Branch(done, eq, entity_name, Operand(tmp));
3254     __ Branch(miss, eq, entity_name, Operand(Handle<Name>(name)));
3257     __ Branch(&good, eq, entity_name, Operand(tmp));
3283   __ Branch(done, eq, at, Operand(zero_reg));
3284   __ Branch(miss, ne, at, Operand(zero_reg));
3338     __ Branch(done, eq, name, Operand(at));
3361   __ Branch(done, ne, at, Operand(zero_reg));
3362   __ Branch(miss, eq, at, Operand(zero_reg));
3424     __ Branch(&not_in_dictionary, eq, entry_key, Operand(undefined));
3427     __ Branch(&in_dictionary, eq, entry_key, Operand(key));
3475   // The first two branch+nop instructions are generated with labels so as to
3583   __ Branch(&need_incremental, lt, regs_.scratch1(), Operand(zero_reg));
3711   __ Branch(&start_polymorphic, ne, receiver_map, Operand(cached_map));
3725     __ Branch(miss, eq, length, Operand(Smi::FromInt(2)));
3749   __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
3756   __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
3774   __ Branch(try_array, ne, cached_map, Operand(receiver_map));
3809   __ Branch(&not_array, ne, at, Operand(scratch1));
3814   __ Branch(&miss, ne, at, Operand(feedback));
3864   __ Branch(&not_array, ne, at, Operand(scratch1));
3875   __ Branch(&try_poly_name, ne, at, Operand(feedback));
3882   __ Branch(&miss, ne, key, Operand(feedback));
3948   __ Branch(&not_array, ne, scratch1, Operand(at));
3956   __ Branch(&miss, ne, feedback, Operand(at));
3967   __ Branch(USE_DELAY_SLOT, &compare_map);
4013   __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
4017   __ Branch(&transition_call, ne, too_far, Operand(at));
4037   __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
4069   __ Branch(&not_array, ne, scratch1, Operand(at));
4083   __ Branch(&try_poly_name, ne, feedback, Operand(at));
4090   __ Branch(&miss, ne, key, Operand(feedback));
4103   __ Branch(USE_DELAY_SLOT, &compare_map);
4222     __ Branch(&normal_sequence, ne, at, Operand(zero_reg));
4227   __ Branch(&normal_sequence, eq, t1, Operand(zero_reg));
4319     __ Branch(&not_zero_case, ne, at, Operand(zero_reg));
4323     __ Branch(&not_one_case, gt, a0, Operand(1));
4373   __ Branch(&subclassing, ne, a1, Operand(a3));
4378   __ Branch(&no_info, eq, a2, Operand(at));
4471     __ Branch(&done, eq, a3, Operand(FAST_ELEMENTS));
4479   __ Branch(&fast_elements_case, eq, a3, Operand(FAST_ELEMENTS));
4500   __ Branch(&new_object, ne, a2, Operand(JS_FUNCTION_TYPE));
4506   __ Branch(&new_object, ne, a0, Operand(MAP_TYPE));
4511   __ Branch(&new_object, ne, a0, Operand(a1));
4541   __ Branch(USE_DELAY_SLOT, &slack_tracking, ne, at, Operand(0));
4569     __ Branch(&finalize, eq, a3, Operand(zero_reg));
4626     __ Branch(&ok, eq, a1, Operand(a3));
4636   __ Branch(&no_rest_parameters, ne, a3,
4647   __ Branch(&rest_parameters, gt, a0, Operand(zero_reg));
4715       __ Branch(&done_loop, eq, a1, Operand(a3));
4738     __ Branch(&too_big_for_new_space, gt, t0,
4776     __ Branch(&ok, eq, a1, Operand(a3));
4800   __ Branch(&adaptor_frame, eq, a0,
4805   __ Branch(USE_DELAY_SLOT, &try_allocate);
4818   __ Branch(&try_allocate, le, t2, Operand(t1));
4830   __ Branch(USE_DELAY_SLOT, &param_map_size, eq, t2, Operand(zero_reg));
4856   __ Branch(&skip2_ne, ne, t2, Operand(zero_reg));
4860   __ Branch(&skip2_eq, eq, t2, Operand(zero_reg));
4894   __ Branch(&skip3, ne, t2, Operand(Smi::FromInt(0)));
4900   __ Branch(&skip_parameter_map, eq, t2, Operand(Smi::FromInt(0)));
4945   __ Branch(&parameters_loop, ne, t1, Operand(Smi::FromInt(0)));
4974   __ Branch(&arguments_loop, lt, t2, Operand(t1));
5006     __ Branch(&ok, eq, a1, Operand(a3));
5015   __ Branch(&arguments_adaptor, eq, a0,
5025   __ Branch(&arguments_done);
5060     __ Branch(&done_loop, eq, a1, Operand(a3));
5065     __ Branch(&loop);
5083   __ Branch(&too_big_for_new_space, gt, t0,
5136   __ Branch(&not_mutable_data, ne, cell_details_reg,
5155   __ Branch(&not_same_value, ne, value_reg, Operand(cell_value_reg));
5158   __ Branch(&slow_case, ne, at, Operand(zero_reg));
5163     __ Branch(&done, eq, cell_details_reg,
5167     __ Branch(&done, eq, cell_details_reg,
5182   __ Branch(&slow_case, ne, cell_details_reg,
5201   __ Branch(&fast_heapobject_case, eq, cell_value_map_reg,
5242   __ Branch(&profiler_disabled, eq, t9, Operand(zero_reg));
5305   __ Branch(&delete_allocated_handles, ne, s1, Operand(at));
5328   __ Branch(&promote_scheduled_exception, ne, t0, Operand(t1));