Lines Matching defs:mul
23046 # Clean up and return. Check if the final mul or div was inexact. #
23083 # 2. Calculate absolute value of exponent in d1 by mul and add.
23107 mulu.l &0xa,%d1 # mul partial product by one digit place
23126 # 1. Calculate absolute value of mantissa in fp0 by mul and add.
23283 bcc.b ap_p_en # if 1, mul fp1 by pwrten factor
23284 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
23289 fmul.x %fp1,%fp0 # mul mantissa by 10**(no_bits_shifted)
23331 bcc.b ap_n_en # if 1, mul fp1 by pwrten factor
23332 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
23415 bcc.b e_next # if zero, skip the mul
23416 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
23435 beq.b mul # if clear, go to multiply
23439 mul:
23445 # If the final mul/div in decbin incurred an inex exception,
23702 fmul.x PLOG2UP1(%pc),%fp0 # if neg, mul by LOG2UP1
23706 fmul.x PLOG2(%pc),%fp0 # if pos, mul by LOG2
23876 bcc.b e_next2 # if zero, skip the mul
23877 fmul.x (%a1,%d3),%fp1 # mul by 10**(d3_bit_no)
23897 # digits. The excess digits are collected in INEX2. If mul,
23904 # create a busy stack frame with the mul command and the
23931 bne.b sc_mul # if neg (LAMBDA = 1), scale by mul
23937 beq.w A9_norm # if norm, continue with mul
24137 bcc.b l_next # if zero, skip the mul
24138 fmul.x (%a1,%d3),%fp2 # mul by 10**(d3_bit_no)
24188 bcc.b z_next # if zero, skip the mul
24189 fmul.x (%a1,%d3),%fp2 # mul by 10**(d3_bit_no)
24468 # bit 63. The fraction is multiplied by 10 using a mul by 2 #
24469 # shift and a mul by 8 shift. The bits shifted out of the #
24504 # d2: upper 32-bits of fraction for mul by 8
24505 # d3: lower 32-bits of fraction for mul by 8
24506 # d4: upper 32-bits of fraction for mul by 2
24507 # d5: lower 32-bits of fraction for mul by 2
24539 asl.l &1,%d5 # mul d5 by 2
24540 roxl.l &1,%d4 # mul d4 by 2
24542 addx.w %d6,%d1 # add in extend from mul by 2
24544 # A5. Add mul by 8 to mul by 2. D1 contains the digit formed.