Home
last modified time | relevance | path

Searched full:multiplying (Results 1 – 25 of 132) sorted by relevance

123456

/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DConstraintSystem.h115 // The negated constraint R is obtained by multiplying by -1 and adding 1 to in negate()
126 // The negated constraint R is obtained by multiplying by -1. in negateOrEqual()
/freebsd-src/share/man/man3/
H A Dstdckdint.328 If the result of adding, subtracting, or multiplying
/freebsd-src/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/pointers/
H A Dtst.PointerArithmetic3.d32 * multiplying or dividing the operands by the size of the type referenced
H A Dtst.PointerArithmetic1.d32 * multiplying or dividing the operands by the size of the type referenced
/freebsd-src/sys/contrib/device-tree/Bindings/iio/dac/
H A Dadi,ad5449.yaml14 Family of multiplying DACs from Analog Devices
/freebsd-src/sys/contrib/device-tree/Bindings/clock/ti/
H A Dapll.txt6 loop logic for multiplying the input clock to a desired output
H A Ddpll.txt6 loop logic for multiplying the input clock to a desired output
/freebsd-src/sbin/dumpfs/
H A Ddumpfs.864 Fragment numbers may be converted to raw byte offsets by multiplying by the
/freebsd-src/crypto/openssl/test/
H A Dbn_internal_test.c65 /* Test that multiplying all the small primes from 3 to 751 equals a constant.
/freebsd-src/sys/powerpc/include/
H A Dslb.h52 * coverage is increased by swizzling the ESID and multiplying by a prime
/freebsd-src/contrib/llvm-project/libcxx/src/include/ryu/
H A Dd2s_intrinsics.h194 // We can truncate before multiplying instead of after, as multiplying in __mod1e9()
/freebsd-src/sys/contrib/device-tree/Bindings/serial/
H A Dfsl-imx-uart.yaml100 the amount of chunks used for the device. Multiplying both numbers is
/freebsd-src/lib/msun/ld80/
H A Dk_cosl.c29 * to be precisely -0.5 so that multiplying by it is exact, and plain
/freebsd-src/contrib/arm-optimized-routines/math/
H A Dtgamma128.c89 * multiply back up _after_ multiplying the shrinking factor in tgamma_large()
309 * Actually multiplying (x-1) by (x-2) by (x-3) and so on in tgamma128()
/freebsd-src/sys/x86/include/
H A Dpvclock.h53 * Scale a 64-bit delta by scaling and multiplying by a 32-bit fraction,
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DSpeculativeExecution.h16 // addressing mode for multiplying by sizeof(*a):
/freebsd-src/contrib/arm-optimized-routines/pl/math/
H A Dsv_log1pf_1u3.c
H A Dv_log1pf_2u1.c
H A Dlog1pf_2u1.c
/freebsd-src/contrib/llvm-project/llvm/lib/Support/
H A DBranchProbability.cpp75 // Fast path for multiplying by 1.0. in scale()
H A DKnownBits.cpp804 // Compute the high known-0 bits by multiplying the unsigned max of each side. in sdiv()
820 // multiplying them together. in sdiv()
841 // Which allows us to infer the 2 LSBs. Since we're multiplying the result in sdiv()
884 // If we're self-multiplying then bit[1] is guaranteed to be zero. in udiv()
/freebsd-src/contrib/libpcap/
H A Dsf-pcapng.c1404 * the resolution the user requested by multiplying by in pcap_ng_next_packet()
1421 * the resolution the user requested by multiplying by in pcap_ng_next_packet()
1445 * the resolution the user requested by multiplying by in pcap_ng_next_packet()
1465 * resolution the user requested by multiplying by the in pcap_ng_next_packet()
1467 * file-supplied resolution. We do that by multiplying in pcap_ng_next_packet()
/freebsd-src/sys/fs/ext2fs/
H A Dfs.h87 * obtained by multiplying AVFPDIR and AVFILESIZ which is assumed to be
/freebsd-src/contrib/llvm-project/llvm/include/llvm/IR/
H A DGetElementPtrTypeIterator.h150 // can be translated into a byte offset by multiplying with an element stride.
/freebsd-src/contrib/ntp/libparse/
H A Dmfp_mul.c51 * 64bit quantities.thus effectively multiplying 2 63bit quantities.

123456