| /src/tests/bin/expr/ |
| t_expr.sh | 199 atf_test_case multiply
201 atf_set "descr" "Test the multiply operator (PR bin/12838)"
311 atf_add_test_case multiply
|
| t_expr.sh | 199 atf_test_case multiply
201 atf_set "descr" "Test the multiply operator (PR bin/12838)"
311 atf_add_test_case multiply
|
| /src/sys/lib/libkern/arch/m68k/ |
| udivsi3.S | 95 | to adjust this quotient, we multiply it by the original
103 | as in mulsi3, we have to do the multiply in stages to avoid
117 clrw %d1 | %d1 = finished high multiply result
|
| udivsi3.S | 95 | to adjust this quotient, we multiply it by the original
103 | as in mulsi3, we have to do the multiply in stages to avoid
117 clrw %d1 | %d1 = finished high multiply result
|
| /src/sys/arch/m68k/060sp/dist/ |
| ilsp.doc | 43 module can be used to emulate 64-bit divide and multiply,
87 For example, to use a 64-bit multiply instruction,
90 for unsigned multiply could look like:
99 bsr.l _060LISP_TOP+0x18 # branch to multiply routine
|
| ilsp.doc | 43 module can be used to emulate 64-bit divide and multiply,
87 For example, to use a 64-bit multiply instruction,
90 for unsigned multiply could look like:
99 bsr.l _060LISP_TOP+0x18 # branch to multiply routine
|
| isp.doc | 51 64-bit multiply
|
| isp.doc | 51 64-bit multiply
|
| pfpsp.s | 971 # multiply operation is the smallest possible normalized number
1004 # multiply operation is the smallest possible normalized number
1032 # multiply operation is the smallest possible normalized number
5789 # Multiply: (Infinity x Zero) #
6992 lsl.b &0x1,%d1 # multiply d1 by 2
7988 # For norms/denorms, scale the exponents such that a multiply #
8057 # - the result of the multiply operation will neither overflow nor underflow.
8058 # - do the multiply to the proper precision and rounding mode.
8069 fmul.x FP_SCR0(%a6),%fp0 # execute multiply
8092 # - the result of the multiply operation is an overflow
[all...] |
| pfpsp.s | 971 # multiply operation is the smallest possible normalized number
1004 # multiply operation is the smallest possible normalized number
1032 # multiply operation is the smallest possible normalized number
5789 # Multiply: (Infinity x Zero) #
6992 lsl.b &0x1,%d1 # multiply d1 by 2
7988 # For norms/denorms, scale the exponents such that a multiply #
8057 # - the result of the multiply operation will neither overflow nor underflow.
8058 # - do the multiply to the proper precision and rounding mode.
8069 fmul.x FP_SCR0(%a6),%fp0 # execute multiply
8092 # - the result of the multiply operation is an overflow
[all...] |
| /src/lib/libutil/ |
| login_cap.c | 64 static u_quad_t multiply(u_quad_t, u_quad_t);
816 num = multiply(num, (u_quad_t)512);
820 num = multiply(num, (u_quad_t)1024);
824 num = multiply(num, (u_quad_t)1024 * 1024);
828 num = multiply(num, (u_quad_t)1024 * 1024 * 1024);
832 num = multiply(num, (u_quad_t)1024 * 1024);
833 num = multiply(num, (u_quad_t)1024 * 1024);
856 num = multiply(num, num2);
908 multiply(u_quad_t n1, u_quad_t n2) function in typeref:typename:u_quad_t
938 * is not done then the first multiply below may overflow.
[all...] |
| login_cap.c | 64 static u_quad_t multiply(u_quad_t, u_quad_t);
816 num = multiply(num, (u_quad_t)512);
820 num = multiply(num, (u_quad_t)1024);
824 num = multiply(num, (u_quad_t)1024 * 1024);
828 num = multiply(num, (u_quad_t)1024 * 1024 * 1024);
832 num = multiply(num, (u_quad_t)1024 * 1024);
833 num = multiply(num, (u_quad_t)1024 * 1024);
856 num = multiply(num, num2);
908 multiply(u_quad_t n1, u_quad_t n2) function in typeref:typename:u_quad_t
938 * is not done then the first multiply below may overflow.
[all...] |
| /src/usr.bin/make/unit-tests/ |
| opt-jobs.mk | 27 # The options '-j <float>' and '-j <integer>C' multiply the given number with
|
| opt-jobs.mk | 27 # The options '-j <float>' and '-j <integer>C' multiply the given number with
|
| /src/sys/arch/hppa/spmath/ |
| impyu.S | 48 *Implement an integer multiply routine for 32-bit operands and 64-bit product
63 cnt: .equ 6 ; count in multiply
88 ; Start multiply process
101 b mpy1 ; if op1 < 2**32, start multiply
225 b lastadd ; end of multiply
248 b lastadd ; end of multiply
|
| impyu.S | 48 *Implement an integer multiply routine for 32-bit operands and 64-bit product
63 cnt: .equ 6 ; count in multiply
88 ; Start multiply process
101 b mpy1 ; if op1 < 2**32, start multiply
225 b lastadd ; end of multiply
248 b lastadd ; end of multiply
|
| impys.S | 48 * Implement an integer multiply routine for 32-bit operands and 64-bit product
63 cnt: .equ 6 /* count in multiply */
81 ; Start multiply process
206 b signs ; end of multiply
251 b signs ; end of multiply
|
| impys.S | 48 * Implement an integer multiply routine for 32-bit operands and 64-bit product
63 cnt: .equ 6 /* count in multiply */
81 ; Start multiply process
206 b signs ; end of multiply
251 b signs ; end of multiply
|
| /src/sys/arch/aarch64/aarch64/ |
| db_trace.c | 188 SignExtend(int bitwidth, uint64_t imm, unsigned int multiply)
195 return imm * multiply;
199 ZeroExtend(int bitwidth, uint64_t imm, unsigned int multiply)
201 return imm * multiply;
|
| db_trace.c | 188 SignExtend(int bitwidth, uint64_t imm, unsigned int multiply)
195 return imm * multiply;
199 ZeroExtend(int bitwidth, uint64_t imm, unsigned int multiply)
201 return imm * multiply;
|
| db_interface.c | 274 SignExtend(int bitwidth, uint64_t imm, unsigned int multiply)
281 return imm * multiply;
|
| db_interface.c | 274 SignExtend(int bitwidth, uint64_t imm, unsigned int multiply)
281 return imm * multiply;
|
| /src/lib/libc/arch/mips/gen/ |
| ldexp.S | 74 addu v0, v0, v1 # multiply by (2**N)
|
| ldexp.S | 74 addu v0, v0, v1 # multiply by (2**N)
|
| /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/ |
| am3874-iceboard.dts | 105 * of the backplane. Since there are multiply assigned addresses, the
|
