HomeSort by: relevance | last modified time | path
    Searched refs:multiply (Results 1 - 18 of 18) sorted by relevancy

  /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
  /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
  /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
isp.doc 51 64-bit multiply
ilsp.s 462 # multiply hi,lo words of each factor to get 4 intermediate products
495 # 64-bit multiply instruction. #
509 # Perform the multiply in pieces using 16x16->32 unsigned #
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...]
fpsp.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
7318 fmul.x SCALE(%a6),%fp0 # multiply 2^(M)
9635 # the multiply factor that we're trying to create should be a denorm
9636 # for the multiply to work. therefore, we're going to actually do a
9637 # multiply with a denorm which will cause an unimplemented data type
9661 # create an fp multiply that will create the result.
9676 fmul.x (%sp)+,%fp0 # do the multiply
11347 # fmul() - emulate a multiply instruction #
    [all...]
fplsp.s 7212 fmul.x SCALE(%a6),%fp0 # multiply 2^(M)
9276 # the multiply factor that we're trying to create should be a denorm
9277 # for the multiply to work. therefore, we're going to actually do a
9278 # multiply with a denorm which will cause an unimplemented data type
9302 # create an fp multiply that will create the result.
9317 fmul.x (%sp)+,%fp0 # do the multiply
  /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
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
  /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
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_interface.c 274 SignExtend(int bitwidth, uint64_t imm, unsigned int multiply)
281 return imm * multiply;
disasm.c 647 SignExtend(int bitwidth, uint64_t imm, unsigned int multiply)
654 return imm * multiply;
658 ZeroExtend(int bitwidth, uint64_t imm, unsigned int multiply)
660 return imm * multiply;
  /src/lib/libc/arch/mips/gen/
ldexp.S 74 addu v0, v0, v1 # multiply by (2**N)
  /src/sys/arch/vax/vax/
unimpl_emul.S 435 muld2 %r6,%r0 # multiply with arg
462 # Extended multiply/modulus
565 * Now we get ready to multiply. This multiplies a byte at a time,
782 * we can multiply them as integers. More below.
  /src/sys/arch/mips/mips/
fp.S 1157 * Single precision multiply.
1197 multu t2, ta2 # multiply fractions
1203 * Double precision multiply.
1252 multu t3, ta3 # multiply fractions (low * low)
1258 multu ta0, ta3 # multiply FS(high) * FT(low)
1263 multu ta1, ta2 # multiply FS(low) * FT(high)
1270 multu ta0, ta2 # multiply FS(high) * FT(high)

Completed in 48 milliseconds