Home
last modified time | relevance | path

Searched refs:divisions (Results 1 – 25 of 46) sorted by relevance

12

/netbsd/src/sys/sys/
Dmidiio.h440 uint32_t divisions; member
659 e = SEQ_MK_TIMING(WAIT_ABS, .divisions=192);
660 e = SEQ_MK_TIMING(WAIT_REL, .divisions=192);
/netbsd/src/sys/dev/
Dsequencer.c608 seq_input_event(sc, &SEQ_MK_TIMING(WAIT_ABS, .divisions=t)); in seq_softintr()
1245 b->t_WAIT_REL.divisions + t->divs_lastevent); in seq_do_timing()
1248 seq_timer_waitabs(sc, b->t_WAIT_ABS.divisions); in seq_do_timing()
1382 *ev = SEQ_MK_TIMING(WAIT_ABS, .divisions=tmp_delay); in seq_to_new()
/netbsd/src/external/lgpl3/gmp/dist/tune/
DREADME289 The gmp manual points out that divisions by powers of two should be done
387 Smaller bases need more divisions to split a given size number, and so are
391 limbs) and those divisions come to dominate.
/netbsd/src/external/gpl3/gcc/dist/gcc/config/mips/
D10000.md120 ;; Only ALU2 does int multiplications and divisions.
/netbsd/src/usr.bin/midiplay/
Dmidiplay.c593 .divisions=tp->delta)); in playdata()
/netbsd/src/external/lgpl3/gmp/dist/doc/
Dgmp.info-241 single limb divisions saved. When d is a single limb some
389 faster, essentially saving N single limb divisions in a fashion similar
566 Repeated divisions by b^n are made, where b is the radix and n is the
568 remainder r from such divisions, an extra divide step is done to give a
570 extracted using multiplications by b rather than divisions. Special
583 The advantage of this algorithm is that big divisions can make use of
585 Division::), and big divisions tend to have less overheads than lots of
586 separate single limb divisions anyway. But in any case the cost of
614 divisions too, though there would be the cost of calculating a bigger
967 overall GMP performance. All multiplications and divisions come down to
Dgmp.texi2512 canonicalization, or swap them for divisions. For example when multiplying by
3551 This function performs some trial divisions, a Baillie-PSW probable prime
8143 subtracting one @math{W(t)} value from another, and a couple of divisions by
8462 N@cross{}1 division is implemented using repeated 2@cross{}1 divisions from
8546 N@cross{}(N/2) divisions.
8573 For the largest divisions, a block-wise Barrett division algorithm is used.
8619 divisions are saved, or if Q is small then the crossproducts reduce to a small
8672 divisions saved. When @math{d} is a single limb some simplifications arise,
9034 essentially saving N single limb divisions in a fashion similar to an exact
9238 Repeated divisions by @math{b^n} are made, where @math{b} is the radix and
[all …]
Dgmp.info-11698 the GCDs used for canonicalization, or swap them for divisions.
2646 This function performs some trial divisions, a Baillie-PSW probable
6584 subtracting one W(t) value from another, and a couple of divisions by
6885 Nx1 division is implemented using repeated 2x1 divisions from high to
6975 formed by recursive Nx(N/2) divisions.
7004 For the largest divisions, a block-wise Barrett division algorithm is
7046 big then many divisions are saved, or if Q is small then the
/netbsd/src/regress/lib/libc/ieeefp/testfloat/notes/
Dtestfloat.txt114 divisions and square roots. It also makes no attempt to find bugs specific
115 to SRT divisions and the like (such as the infamous Pentium divide bug).
/netbsd/src/external/gpl3/gcc/dist/gcc/config/arm/
Dexynos-m1.md424 ;; TODO: assume the median latency; blocks other divisions
/netbsd/src/sys/arch/m68k/060sp/dist/
Dilsp.s306 # the last two divisions to get a quotient longword and word remainder:
/netbsd/src/external/bsd/ntp/dist/ntpsnmpd/
Dntpv4-mib.mib166 is represented as divisions of a second, e.g., a value of 1000
/netbsd/src/external/gpl3/gcc/dist/gcc/config/mmix/
Dmmix.md319 ;; One day we might persuade GCC to expand divisions with constants the
/netbsd/src/external/lgpl3/mpfr/dist/doc/
DREADME.dev324 divisions by 0 are avoided in the MPFR library.
606 check that all divisions by 0 have been protected
/netbsd/src/external/gpl3/gcc/dist/gcc/doc/
Dpasses.texi649 divisions to multiplications by the reciprocal. The pass is located
Dgeneric.texi1579 The @code{EXACT_DIV_EXPR} code is used to represent integer divisions where
Dextend.texi20520 the vector returned. If an attempt is made to perform any of the divisions
20534 perform any of the divisions 0x8000_0000_0000_0000 ÷ -1 or <anything> ÷ 0 then
20549 divisions <anything> ÷ 0 then the quotient is undefined.
20575 the vector returned. If an attempt is made to perform any of the divisions
/netbsd/src/crypto/external/bsd/heimdal/dist/lib/wind/
Drfc3492.txt382 (base * the number of divisions performed in step 3) +
/netbsd/src/external/gpl3/gcc/dist/gcc/
Dmatch.pd390 /* Preserve explicit divisions by 0: the C++ front-end wants to detect
468 /* Combine two successive divisions. Note that combining ceil_div
Dtarget.def3169 /* Return the number of divisions in the given MODE that should be present,
3175 divisions by the same divisor, by turning them into multiplications by\n\
3176 the reciprocal. This target hook specifies the minimum number of divisions\n\
DFSFChangeLog.113937 * rtlanal.c (may_trap_p): Fix unintended fall-through so divisions by
3938 nonzero constants are handled properly. Return 1 for FP divisions.
/netbsd/src/external/gpl3/binutils/dist/ld/
DChangeLog-02031381 Add @group divisions to improve page breaks in long examples.
/netbsd/src/external/lgpl3/gmp/dist/
DChangeLog2389 * mpn/generic/rootrem.c: Avoid divisions if not needed.
6771 (mpz_oddswing_1): Reduce the number of divisions.
8476 divisions. Misc minor cleanup.
14038 divisions.
14077 * mpn/generic/mul_fft.c: Optimize many scalar divisions and mod
14388 * mpn/generic/mul_fft.c: Remove many scalar divisions.
25384 * gmp.texi (Integer Division): Another rewording of 2exp divisions.
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/
DChangeLog-20044069 Rearrange arithmetic to avoid computing two divisions at
/netbsd/src/external/gpl3/gcc/dist/
DNEWS1270 divisions of two sizeof operators when the first one is
4200 + -Wsizeof-pointer-div warns for suspicious divisions of the
6586 divisions of integer constants which are truncated. This option is
15896 moment a conversion of expensive divisions into cheaper

12