Home | History | Annotate | Download | only in mips64

Lines Matching refs: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));
786     __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
799     __ Branch(&call_runtime, ne, scratch, Operand(heapnumbermap));
821     __ Branch(&int_exponent_convert, eq, scratch2, Operand(zero_reg));
904   __ Branch(&positive_exponent, ge, scratch, Operand(zero_reg));
913   __ Branch(&no_carry, eq, scratch2, Operand(zero_reg));
919   __ Branch(&loop_end, eq, scratch, Operand(zero_reg));
922   __ Branch(&while_true);
926   __ Branch(&done, ge, exponent, Operand(zero_reg));
1096       // This branch-and-link sequence is needed to find the current PC on mips
1098       __ bal(&find_ra);  // bal exposes branch delay slot.
1105     // Stack space reservation moved to the branch delay slot below.
1129   __ Branch(&exception_returned, eq, a4, Operand(v0));
1141     __ Branch(&okay, eq, a4, Operand(a2));
1198   __ Branch(&zero, eq, cp, Operand(zero_reg));
1277   __ Branch(&non_outermost_js, ne, a6, Operand(zero_reg));
1282   __ nop();   // Branch delay slot nop.
1301   __ b(&exit);  // b exposes branch delay slot.
1302   __ nop();   // Branch delay slot nop.
1356   __ Branch(&non_outermost_js_2,
1465   __ Branch(&runtime, eq, a0, Operand(zero_reg));
1472   __ Branch(&runtime, ne, a1, Operand(JS_REGEXP_TYPE));
1492   __ Branch(&runtime, ne, a0, Operand(Smi::FromInt(JSRegExp::IRREGEXP)));
1504   __ Branch(&runtime, hi, a2, Operand(Smi::FromInt(temp)));
1548   __ Branch(&seq_string, eq, a1, Operand(zero_reg));  // Go to (4).
1556   __ Branch(&not_seq_nor_cons, ge, a1, Operand(kExternalStringTag));
1562   __ Branch(&runtime, ne, a0, Operand(a1));
1576   __ Branch(&runtime, ls, a3, Operand(a1));
1692   __ Branch(&success, eq, v0, Operand(1));
1696   __ Branch(&failure, eq, v0, Operand(NativeRegExpMacroAssembler::FAILURE));
1698   __ Branch(&runtime, ne, v0, Operand(NativeRegExpMacroAssembler::EXCEPTION));
1707   __ Branch(&runtime, eq, v0, Operand(a1));
1729   __ Branch(&runtime, ne, a2, Operand(JS_ARRAY_TYPE));
1735   __ Branch(&runtime, ne, a0, Operand(at));
1743   __ Branch(&runtime, gt, a2, Operand(at));
1788   __ Branch(&done, lt, a1, Operand(zero_reg));
1795   __ Branch(&next_capture, USE_DELAY_SLOT);
1796   __ daddiu(a0, a0, kPointerSize);  // In branch delay slot.
1812   __ Branch(&not_long_external, gt, a1, Operand(kExternalStringTag));
1840   __ Branch(&runtime, ne, at, Operand(zero_reg));
1904   __ Branch(&done_increment_count, eq, a1, Operand(weak_value));
1906   __ Branch(&done, eq, a5, Operand(at));
1909   __ Branch(&check_allocation_site, ne, feedback_map, Operand(at));
1921   __ Branch(&miss, ne, feedback_map, Operand(at));
1925   __ Branch(&megamorphic, ne, a1, Operand(a5));
1933   __ Branch(&initialize, eq, a5, Operand(at));
1947   __ Branch(&not_array_function, ne, a1, Operand(a5));
1954   __ Branch(&done_initialize_count);
1967   __ Branch(USE_DELAY_SLOT, &done);
1994   __ Branch(&non_function, ne, a5, Operand(JS_FUNCTION_TYPE));
2005   __ Branch(&feedback_register_initialized, eq, a5, Operand(at));
2042     __ Branch(receiver_not_string_, ne, a4, Operand(zero_reg));
2052   __ Branch(index_out_of_range_, ls, a4, Operand(index_));
2073   __ Branch(miss, ne, a1, Operand(at));
2119   __ Branch(&extra_checks_or_miss, ne, a1, Operand(a5));
2143   __ Branch(&call, eq, a4, Operand(at));
2148   __ Branch(&not_allocation_site, ne, a5, Operand(at));
2157     __ Branch(&miss);
2161   __ Branch(&uninitialized, eq, a4, Operand(at));
2167   __ Branch(&miss, ne, a5, Operand(JS_FUNCTION_TYPE));
2186   __ Branch(&miss, ne, a4, Operand(JS_FUNCTION_TYPE));
2191   __ Branch(&miss, eq, a1, Operand(a4));
2197   __ Branch(&miss, ne, t0, Operand(t1));
2217   __ Branch(&call_function);
2224   __ Branch(&call);
2282   __ Branch(&got_smi_index_);
2308   __ Branch(&slow_case_, hi, code_,
2317   __ Branch(&slow_case_, eq, result_, Operand(at));
2334   __ Branch(&exit_);
2371   __ Branch(&loop_entry);
2378   __ Branch(&loop, lt, dest, Operand(limit));
2416   __ Branch(&runtime, lt, a3, Operand(zero_reg));  // From < 0.
2418   __ Branch(&runtime, gt, a3, Operand(a2));  // Fail if from > to.
2428   __ Branch(&runtime, ne, a4, Operand(zero_reg));
2431   __ Branch(&single_char, eq, a2, Operand(1));
2440   __ Branch(&return_v0, eq, a2, Operand(a4));
2442   __ Branch(&runtime, hi, a2, Operand(a4));
2456   __ Branch(USE_DELAY_SLOT, &seq_or_external_string, eq, a4, Operand(zero_reg));
2459   __ Branch(&sliced_string, ne, a4, Operand(zero_reg));
2463   __ Branch(&runtime, ne, a5, Operand(a4));
2494     __ Branch(&copy_routine, lt, a2, Operand(SlicedString::kMinLength));
2504     __ Branch(&two_byte_slice, eq, a4, Operand(zero_reg));
2526   __ Branch(&sequential_string, eq, a4, Operand(zero_reg));
2532   __ Branch(&runtime, ne, a4, Operand(zero_reg));
2546   __ Branch(&two_byte_sequential, eq, a4, Operand(zero_reg));
2615   __ Branch(&not_string, ge, a1, Operand(FIRST_NONSTRING_TYPE));
2621   __ Branch(&not_heap_number, ne, a1, Operand(HEAP_NUMBER_TYPE));
2628   __ Branch(&not_oddball, ne, a1, Operand(ODDBALL_TYPE));
2648   __ Branch(&not_name, gt, a1, Operand(LAST_NAME_TYPE));
2654   __ Branch(&not_heap_number, ne, a1, Operand(HEAP_NUMBER_TYPE));
2661   __ Branch(&not_oddball, ne, a1, Operand(ODDBALL_TYPE));
2680   __ Branch(&check_zero_length, eq, length, Operand(scratch2));
2690   __ Branch(&compare_chars, ne, length, Operand(zero_reg));
2720   __ Branch(&compare_lengths, eq, min_length, Operand(zero_reg));
2738   __ Branch(&ret, eq, scratch2, Operand(scratch4));
2740   __ Branch(&ret, gt, scratch2, Operand(scratch4));
2770   __ Branch(chars_not_equal, ne, scratch1, Operand(scratch2));
2772   __ Branch(&loop, ne, index, Operand(zero_reg));
2870   __ Branch(&left);
2883   __ Branch(&done);
2922     __ Branch(&miss, ne, a0, Operand(at));
2925     __ Branch(&maybe_undefined2, ne, a2, Operand(HEAP_NUMBER_TYPE));
2932     __ Branch(&unordered, eq, a1, Operand(at));
2961   __ Branch(&miss, ne, at, Operand(zero_reg));
3009   __ Branch(&done, ne, left, Operand(right));
3051   __ Branch(&miss, ne, tmp5, Operand(zero_reg));
3057   __ Branch(&left_ne_right, ne, left, Operand(right));
3073     __ Branch(&is_symbol, ne, tmp5, Operand(zero_reg));
3125   __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
3127   __ Branch(&miss, lt, a2, Operand(FIRST_JS_RECEIVER_TYPE));
3146   __ Branch(&miss, ne, a2, Operand(a4));
3147   __ Branch(&miss, ne, a3, Operand(a4));
3259     __ Branch(done, eq, entity_name, Operand(tmp));
3265     __ Branch(miss, eq, entity_name, Operand(Handle<Name>(name)));
3268     __ Branch(&good, eq, entity_name, Operand(tmp));
3294   __ Branch(done, eq, at, Operand(zero_reg));
3295   __ Branch(miss, ne, at, Operand(zero_reg));
3348     __ Branch(done, eq, name, Operand(at));
3371   __ Branch(done, ne, at, Operand(zero_reg));
3372   __ Branch(miss, eq, at, Operand(zero_reg));
3434     __ Branch(&not_in_dictionary, eq, entry_key, Operand(undefined));
3437     __ Branch(&in_dictionary, eq, entry_key, Operand(key));
3485   // The first two branch+nop instructions are generated with labels so as to
3593   __ Branch(&need_incremental, lt, regs_.scratch1(), Operand(zero_reg));
3721   __ Branch(&start_polymorphic, ne, receiver_map, Operand(cached_map));
3734     __ Branch(miss, eq, length, Operand(Smi::FromInt(2)));
3759   __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
3766   __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
3769   __ Branch(miss);
3784   __ Branch(try_array, ne, cached_map, Operand(receiver_map));
3820   __ Branch(&not_array, ne, scratch1, Operand(at));
3825   __ Branch(&miss, ne, feedback, Operand(at));
3837   __ Branch(&compare_map);
3876   __ Branch(&not_array, ne, scratch1, Operand(at));
3887   __ Branch(&try_poly_name, ne, feedback, Operand(at));
3894   __ Branch(&miss, ne, key, Operand(feedback));
3908   __ Branch(&compare_map);
3961   __ Branch(&not_array, ne, scratch1, Heap::kFixedArrayMapRootIndex);
3968   __ Branch(&miss, ne, feedback, Heap::kmegamorphic_symbolRootIndex);
3979   __ Branch(USE_DELAY_SLOT, &compare_map);
4027   __ Branch(&prepare_next, ne, receiver_map, Operand(cached_map));
4031   __ Branch(&transition_call, ne, too_far, Operand(at));
4050   __ Branch(&next_loop, lt, pointer_reg, Operand(too_far));
4053   __ Branch(miss);
4082   __ Branch(&not_array, ne, scratch1, Heap::kFixedArrayMapRootIndex);
4094   __ Branch(&try_poly_name, ne, feedback, Heap::kmegamorphic_symbolRootIndex);
4101   __ Branch(&miss, ne, key, Operand(feedback));
4115   __ Branch(USE_DELAY_SLOT, &compare_map);
4235     __ Branch(&normal_sequence, ne, at, Operand(zero_reg));
4239   __ Branch(&normal_sequence, eq, a5, Operand(zero_reg));
4331     __ Branch(&not_zero_case, ne, at, Operand(zero_reg));
4335     __ Branch(&not_one_case, gt, a0, Operand(1));
4385   __ Branch(&subclassing, ne, a1, Operand(a3));
4390   __ Branch(&no_info, eq, a2, Operand(at));
4483     __ Branch(&done, eq, a3, Operand(FAST_ELEMENTS));
4491   __ Branch(&fast_elements_case, eq, a3, Operand(FAST_ELEMENTS));
4512   __ Branch(&new_object, ne, a2, Operand(JS_FUNCTION_TYPE));
4518   __ Branch(&new_object, ne, a0, Operand(MAP_TYPE));
4523   __ Branch(&new_object, ne, a0, Operand(a1));
4553   __ Branch(USE_DELAY_SLOT, &slack_tracking, ne, at, Operand(zero_reg));
4581     __ Branch(&finalize, eq, a3, Operand(zero_reg));
4639     __ Branch(&ok, eq, a1, Operand(a3));
4649   __ Branch(&no_rest_parameters, ne, a3,
4661   __ Branch(&rest_parameters, gt, a0, Operand(zero_reg));
4731       __ Branch(&done_loop, eq, a1, Operand(a3));
4736       __ Branch(&loop);
4754     __ Branch(&too_big_for_new_space, gt, a5,
4794     __ Branch(&ok, eq, a1, Operand(a3));
4819   __ Branch(&adaptor_frame, eq, a0,
4824   __ Branch(USE_DELAY_SLOT, &try_allocate);
4838   __ Branch(&try_allocate, le, a6, Operand(a5));
4850   __ Branch(USE_DELAY_SLOT, &param_map_size, eq, a6, Operand(zero_reg));
4877   __ Branch(&skip2_ne, ne, a6, Operand(zero_reg));
4881   __ Branch(&skip2_eq, eq, a6, Operand(zero_reg));
4915   __ Branch(&skip3, ne, a6, Operand(Smi::FromInt(0)));
4921   __ Branch(&skip_parameter_map, eq, a6, Operand(Smi::FromInt(0)));
4968   __ Branch(&parameters_loop, ne, a5, Operand(Smi::FromInt(0)));
4998   __ Branch(&arguments_loop, lt, a6, Operand(a5));
5030     __ Branch(&ok, eq, a1, Operand(a3));
5039   __ Branch(&arguments_adaptor, eq, a0,
5049   __ Branch(&arguments_done);
5087     __ Branch(&done_loop, eq, a1, Operand(a3));
5092     __ Branch(&loop);
5110   __ Branch(&too_big_for_new_space, gt, a5,
5165   __ Branch(&not_mutable_data, ne, cell_details_reg,
5184   __ Branch(&not_same_value, ne, value_reg, Operand(cell_value_reg));
5187   __ Branch(&slow_case, ne, at, Operand(zero_reg));
5192     __ Branch(&done, eq, cell_details_reg,
5196     __ Branch(&done, eq, cell_details_reg,
5211   __ Branch(&slow_case, ne, cell_details_reg,
5230   __ Branch(&fast_heapobject_case, eq, cell_value_map_reg,
5273   __ Branch(&profiler_disabled, eq, t9, Operand(zero_reg));
5336   __ Branch(&delete_allocated_handles, ne, s1, Operand(at));
5358   __ Branch(&promote_scheduled_exception, ne, a4, Operand(a5));