Lines Matching full:branch
175 __ Branch(&loop, ne, a0, Operand(sp));
790 __ Branch(&no_deopt, ne, a1, Operand(zero_reg));
804 __ Branch(&skip, NegateCondition(condition), src1, src2);
829 __ Branch(&jump_table_.last().label, condition, src1, src2);
951 // Theoretically, a variation of the branch-free code for integer division by
962 __ Branch(÷nd_is_not_negative, ge, dividend, Operand(zero_reg));
970 __ Branch(USE_DELAY_SLOT, &done);
999 __ Branch(&remainder_not_zero, ne, result, Operand(zero_reg));
1028 __ Branch(&no_overflow_possible, ne, left_reg, Operand(kMinInt));
1033 __ Branch(&no_overflow_possible, ne, right_reg, Operand(-1));
1034 __ Branch(USE_DELAY_SLOT, &done);
1041 __ Branch(&done, ge, left_reg, Operand(zero_reg));
1148 __ Branch(&left_not_zero, ne, dividend, Operand(zero_reg));
1158 __ Branch(&left_not_min_int, ne, dividend, Operand(kMinInt));
1232 __ Branch(&no_overflow, lt, scratch, Operand(zero_reg));
1234 __ Branch(&done);
1273 __ Branch(&needs_adjustment, divisor > 0 ? lt : gt,
1307 __ Branch(&left_not_zero, ne, dividend, Operand(zero_reg));
1317 __ Branch(&left_not_min_int, ne, dividend, Operand(kMinInt));
1324 __ Branch(&done, eq, remainder, Operand(zero_reg), USE_DELAY_SLOT);
1326 __ Branch(&done, ge, remainder, Operand(zero_reg));
1434 __ Branch(&done, ge, at, Operand(zero_reg));
1774 __ Branch(&done);
1852 __ Branch(chunk_->GetAssemblyLabel(right_block),
1855 __ Branch(chunk_->GetAssemblyLabel(left_block), condition, src1, src2);
1857 __ Branch(chunk_->GetAssemblyLabel(left_block), condition, src1, src2);
1858 __ Branch(chunk_->GetAssemblyLabel(right_block));
1883 __ Branch(chunk_->GetAssemblyLabel(right_block));
1892 __ Branch(chunk_->GetAssemblyLabel(true_block), condition, src1, src2);
1900 __ Branch(chunk_->GetAssemblyLabel(false_block), condition, src1, src2);
1963 __ Branch(instr->FalseLabel(chunk_), eq, reg, Operand(at));
1968 __ Branch(instr->TrueLabel(chunk_), eq, reg, Operand(at));
1970 __ Branch(instr->FalseLabel(chunk_), eq, reg, Operand(at));
1975 __ Branch(instr->FalseLabel(chunk_), eq, reg, Operand(at));
1980 __ Branch(instr->FalseLabel(chunk_), eq, reg, Operand(zero_reg));
1995 __ Branch(instr->FalseLabel(chunk_), ne, at, Operand(zero_reg));
2002 __ Branch(instr->TrueLabel(chunk_),
2010 __ Branch(¬_string, ge , at, Operand(FIRST_NONSTRING_TYPE));
2012 __ Branch(instr->TrueLabel(chunk_), ne, at, Operand(zero_reg));
2013 __ Branch(instr->FalseLabel(chunk_));
2021 __ Branch(instr->TrueLabel(chunk_), eq, scratch, Operand(SYMBOL_TYPE));
2028 __ Branch(instr->TrueLabel(chunk_), eq, scratch,
2037 __ Branch(¬_heap_number, ne, map, Operand(at));
2042 __ Branch(instr->FalseLabel(chunk_));
2322 __ Branch(is_true, hs, temp2, Operand(FIRST_FUNCTION_TYPE));
2324 __ Branch(is_false, hs, temp2, Operand(FIRST_FUNCTION_TYPE));
2334 __ Branch(is_true, ne, instance_type, Operand(JS_FUNCTION_TYPE));
2336 __ Branch(is_false, ne, instance_type, Operand(JS_FUNCTION_TYPE));
2416 __ Branch(USE_DELAY_SLOT, &loop);
2434 __ Branch(USE_DELAY_SLOT, &done, condition, v0, Operand(zero_reg));
2490 __ Branch(&is_not_hole, ne, result, Operand(at));
2513 __ Branch(&skip_assignment, ne, scratch, Operand(at));
2580 __ Branch(&done, ne, scratch, Operand(MAP_TYPE));
2796 __ Branch(&done, ne, result, Operand(scratch));
2893 __ Branch(&done, eq, fp, Operand(elem));
2930 __ Branch(&result_in_receiver, ne, scratch, Operand(zero_reg));
2935 __ Branch(&global_object, eq, receiver, Operand(scratch));
2937 __ Branch(&global_object, eq, receiver, Operand(scratch));
2947 __ Branch(&result_in_receiver);
2957 __ Branch(&result_ok);
2992 __ Branch(USE_DELAY_SLOT, &invoke, eq, length, Operand(zero_reg));
2999 __ Branch(USE_DELAY_SLOT, &loop, ne, length, Operand(zero_reg));
3142 __ Branch(&done, eq, at, Operand(zero_reg));
3161 __ Branch(&allocated);
3195 __ Branch(USE_DELAY_SLOT, &done, ge, input, Operand(zero_reg));
3261 __ Branch(&done, ne, result, Operand(zero_reg));
3287 __ Branch(&skip1, gt, scratch, Operand(HeapNumber::kExponentBias - 2));
3290 __ Branch(&check_sign_on_zero);
3292 __ Branch(&done);
3319 __ Branch(&skip2, ge, result, Operand(zero_reg));
3321 __ Branch(&done);
3338 __ Branch(&done, ne, result, Operand(zero_reg));
3378 // result is overwritten if the branch is not taken.
3484 __ Branch(&no_arguments_adaptor, ne, scratch3,
3492 __ Branch(&formal_parameter_count_loaded);
3598 __ Branch(&packed_case, eq, t1, Operand(zero_reg));
3744 __ Branch(&done, NegateCondition(cc), reg, operand);
3865 __ Branch(¬_nan);
3873 __ Branch(&done);
3974 __ Branch(deferred->entry(), le, ToRegister(current_capacity),
3979 __ Branch(deferred->entry(), ge, ToRegister(key),
3982 __ Branch(deferred->entry(), ge, ToRegister(key),
4053 __ Branch(¬_applicable, ne, scratch, Operand(from_map));
4177 __ Branch(deferred->entry(), hi,
4183 __ Branch(deferred->entry(), eq, result, Operand(scratch));
4282 __ Branch(deferred->entry(), hi, input, Operand(Smi::kMaxValue));
4318 __ Branch(&done);
4371 __ Branch(deferred->entry());
4449 __ Branch(&convert, ne, scratch, Operand(at));
4458 __ Branch(&done, ne, at, Operand(zero_reg));
4463 __ Branch(&done);
4472 __ Branch(&done);
4508 __ Branch(USE_DELAY_SLOT, &truncate, eq, scratch1, Operand(at));
4536 __ Branch(&done, ne, input_reg, Operand(zero_reg));
4622 __ Branch(&done, ne, result_reg, Operand(zero_reg));
4657 __ Branch(&done, ne, result_reg, Operand(zero_reg));
4822 // Do the CompareMap() directly within the Branch() and DeoptimizeIf().
4824 __ Branch(deferred->entry(), ne, map_reg, Operand(map));
4860 __ Branch(&heap_number, eq, scratch, Operand(factory()->heap_number_map()));
4942 __ Branch(&loop, ge, scratch, Operand(zero_reg));
5104 __ Branch(USE_DELAY_SLOT, true_label, eq, at, Operand(input));
5112 __ Branch(USE_DELAY_SLOT, false_label, eq, at, Operand(input));
5137 __ Branch(USE_DELAY_SLOT, true_label, eq, at, Operand(input));
5140 __ Branch(false_label, lt, scratch1(), Operand(FIRST_JS_RECEIVER_TYPE));
5165 __ Branch(false_label);
5256 __ Branch(&done, hs, sp, Operand(at));
5269 __ Branch(deferred_stack_check->entry(), lo, sp, Operand(at));
5305 __ Branch(&use_cache);
5320 __ Branch(&load_cache, ne, result, Operand(Smi::kZero));
5398 __ Branch(deferred->entry(), ne, scratch, Operand(zero_reg));
5401 __ Branch(USE_DELAY_SLOT, &out_of_object, lt, index, Operand(zero_reg));
5408 __ Branch(&done);