Lines Matching defs:mul
13006 # Clean up and return. Check if the final mul or div was inexact. #
13043 # 2. Calculate absolute value of exponent in d1 by mul and add.
13067 mulu.l &0xa,%d1 # mul partial product by one digit place
13086 # 1. Calculate absolute value of mantissa in fp0 by mul and add.
13243 bcc.b ap_p_en # if 1, mul fp1 by pwrten factor
13244 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
13249 fmul.x %fp1,%fp0 # mul mantissa by 10**(no_bits_shifted)
13291 bcc.b ap_n_en # if 1, mul fp1 by pwrten factor
13292 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
13375 bcc.b e_next # if zero, skip the mul
13376 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
13395 beq.b mul # if clear, go to multiply
13399 mul:
13405 # If the final mul/div in decbin incurred an inex exception,
13662 fmul.x PLOG2UP1(%pc),%fp0 # if neg, mul by LOG2UP1
13666 fmul.x PLOG2(%pc),%fp0 # if pos, mul by LOG2
13836 bcc.b e_next2 # if zero, skip the mul
13837 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
13857 # digits. The excess digits are collected in INEX2. If mul,
13864 # create a busy stack frame with the mul command and the
13891 bne.b sc_mul # if neg (LAMBDA = 1), scale by mul
13897 beq.w A9_norm # if norm, continue with mul
14097 bcc.b l_next # if zero, skip the mul
14098 fmul.x (%a1,%d3),%fp2 # mul by 10**(d3_bit_no)
14148 bcc.b z_next # if zero, skip the mul
14149 fmul.x (%a1,%d3),%fp2 # mul by 10**(d3_bit_no)
14428 # bit 63. The fraction is multiplied by 10 using a mul by 2 #
14429 # shift and a mul by 8 shift. The bits shifted out of the #
14464 # d2: upper 32-bits of fraction for mul by 8
14465 # d3: lower 32-bits of fraction for mul by 8
14466 # d4: upper 32-bits of fraction for mul by 2
14467 # d5: lower 32-bits of fraction for mul by 2
14499 asl.l &1,%d5 # mul d5 by 2
14500 roxl.l &1,%d4 # mul d4 by 2
14502 addx.w %d6,%d1 # add in extend from mul by 2
14504 # A5. Add mul by 8 to mul by 2. D1 contains the digit formed.