/kernel/linux/linux-5.10/arch/nios2/kernel/ |
H A D | insnemu.S | 210 andi r7, r4, 0x02 /* For R-type multiply instructions, 212 bne r7, zero, multiply 406 multiply: label
|
/kernel/linux/linux-6.6/arch/nios2/kernel/ |
H A D | insnemu.S | 210 andi r7, r4, 0x02 /* For R-type multiply instructions, 212 bne r7, zero, multiply 406 multiply: label
|
/kernel/linux/linux-5.10/arch/m68k/fpsp040/ |
H A D | decbin.S | 472 | same sign. If the exp was pos then multiply fp1*fp0; 483 beqs mul |if clear, go to multiply 488 fmulx %fp1,%fp0 |exp is positive, so multiply by exp
|
H A D | setox.S | 567 fmulx SCALE(%a6),%fp0 | ...multiply 2^(M)
|
/kernel/linux/linux-6.6/arch/m68k/fpsp040/ |
H A D | decbin.S | 472 | same sign. If the exp was pos then multiply fp1*fp0; 483 beqs mul |if clear, go to multiply 488 fmulx %fp1,%fp0 |exp is positive, so multiply by exp
|
H A D | setox.S | 567 fmulx SCALE(%a6),%fp0 | ...multiply 2^(M)
|
/kernel/linux/linux-5.10/arch/powerpc/boot/ |
H A D | div64.S | 41 mulhwu r9,r11,r4 # multiply the estimate by the divisor,
|
/kernel/linux/linux-6.6/arch/powerpc/boot/ |
H A D | div64.S | 41 mulhwu r9,r11,r4 # multiply the estimate by the divisor,
|
/kernel/linux/linux-5.10/arch/arc/mm/ |
H A D | tlbex.S | 239 ; multiply in step (3) above avoided by shifting lesser in step (1)
|
/kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/ |
H A D | ilsp.S | 452 # multiply hi,lo words of each factor to get 4 intermediate products 485 # 64-bit multiply instruction. # 499 # Perform the multiply in pieces using 16x16->32 unsigned #
|
H A D | fpsp.S | 962 # multiply operation is the smallest possible normalized number 995 # multiply operation is the smallest possible normalized number 1023 # multiply operation is the smallest possible normalized number 7309 fmul.x SCALE(%a6),%fp0 # multiply 2^(M) 9626 # the multiply factor that we're trying to create should be a denorm 9627 # for the multiply to work. Therefore, we're going to actually do a 9628 # multiply with a denorm which will cause an unimplemented data type 9652 # create an fp multiply that will create the result. 9667 fmul.x (%sp)+,%fp0 # do the multiply 11338 # fmul() - emulate a multiply instructio [all...] |
H A D | fplsp.S | 7203 fmul.x SCALE(%a6),%fp0 # multiply 2^(M) 9267 # the multiply factor that we're trying to create should be a denorm 9268 # for the multiply to work. therefore, we're going to actually do a 9269 # multiply with a denorm which will cause an unimplemented data type 9293 # create an fp multiply that will create the result. 9308 fmul.x (%sp)+,%fp0 # do the multiply
|
H A D | pfpsp.S | 961 # multiply operation is the smallest possible normalized number 994 # multiply operation is the smallest possible normalized number 1022 # multiply operation is the smallest possible normalized number 6982 lsl.b &0x1,%d1 # multiply d1 by 2 7978 # For norms/denorms, scale the exponents such that a multiply # 8047 # - the result of the multiply operation will neither overflow nor underflow. 8048 # - do the multiply to the proper precision and rounding mode. 8059 fmul.x FP_SCR0(%a6),%fp0 # execute multiply 8082 # - the result of the multiply operation is an overflow. 8083 # - do the multiply t [all...] |
/kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/ |
H A D | ilsp.S | 452 # multiply hi,lo words of each factor to get 4 intermediate products 485 # 64-bit multiply instruction. # 499 # Perform the multiply in pieces using 16x16->32 unsigned #
|
H A D | fpsp.S | 962 # multiply operation is the smallest possible normalized number 995 # multiply operation is the smallest possible normalized number 1023 # multiply operation is the smallest possible normalized number 7309 fmul.x SCALE(%a6),%fp0 # multiply 2^(M) 9626 # the multiply factor that we're trying to create should be a denorm 9627 # for the multiply to work. Therefore, we're going to actually do a 9628 # multiply with a denorm which will cause an unimplemented data type 9652 # create an fp multiply that will create the result. 9667 fmul.x (%sp)+,%fp0 # do the multiply 11338 # fmul() - emulate a multiply instructio [all...] |
H A D | fplsp.S | 7203 fmul.x SCALE(%a6),%fp0 # multiply 2^(M) 9267 # the multiply factor that we're trying to create should be a denorm 9268 # for the multiply to work. therefore, we're going to actually do a 9269 # multiply with a denorm which will cause an unimplemented data type 9293 # create an fp multiply that will create the result. 9308 fmul.x (%sp)+,%fp0 # do the multiply
|
/kernel/linux/linux-5.10/arch/x86/crypto/ |
H A D | sha1_ssse3_asm.S | 83 shl $6, CNT # multiply by 64
|
H A D | aesni-intel_asm.S | 989 # multiply TMP5 * HashKey using karatsuba 1197 # multiply TMP5 * HashKey using karatsuba
|
/kernel/linux/linux-6.6/arch/x86/crypto/ |
H A D | sha1_ssse3_asm.S | 84 shl $6, CNT # multiply by 64
|
H A D | aesni-intel_asm.S | 985 # multiply TMP5 * HashKey using karatsuba 1193 # multiply TMP5 * HashKey using karatsuba
|
/kernel/linux/linux-6.6/arch/powerpc/crypto/ |
H A D | poly1305-p10le_64.S | 218 # multiply odd and even words
|
/kernel/linux/linux-5.10/arch/arm64/crypto/ |
H A D | poly1305-armv8.pl | 744 // multiply (inp[0:1]+hash) or inp[2:3] by r^2:r^1
|
/kernel/linux/linux-6.6/arch/arm64/crypto/ |
H A D | poly1305-armv8.pl | 744 // multiply (inp[0:1]+hash) or inp[2:3] by r^2:r^1
|
/kernel/linux/linux-5.10/arch/arm/crypto/ |
H A D | poly1305-armv4.pl | 1044 @ multiply (inp[0:1]+hash) or inp[2:3] by r^2:r^1
|
/kernel/linux/linux-6.6/arch/arm/crypto/ |
H A D | poly1305-armv4.pl | 1044 @ multiply (inp[0:1]+hash) or inp[2:3] by r^2:r^1
|