Home
last modified time | relevance | path

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

1234

/netbsd/sys/sys/
H A 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/usr.bin/midirecord/
H A Dmidirecord.c335 prev_div = e.t_WAIT_ABS.divisions; in midi_event_timer_wait_abs_to_output()
336 cur_div = e.t_WAIT_ABS.divisions; in midi_event_timer_wait_abs_to_output()
387 LOG("UNHANDLED TMR_WAIT_REL: divisions: %x", e.t_WAIT_REL.divisions); in midi_event_timer_to_output()
/netbsd/external/mpl/bind/dist/lib/dns/
H A Drrl.c97 int divisions, tries; in hash_divisor() local
115 divisions = 0; in hash_divisor()
120 ++divisions; in hash_divisor()
133 divisions, tries, result, initial); in hash_divisor()
/netbsd/sys/dev/
H A 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/external/apache2/llvm/dist/llvm/docs/_ocamldoc/
H A Dstyle.css46 /* Sections and document divisions */
/netbsd/external/gpl3/gcc.old/dist/gcc/config/microblaze/
H A Dmicroblaze.opt48 Use table lookup optimization for small signed integer divisions.
/netbsd/external/gpl3/gcc/dist/gcc/config/microblaze/
H A Dmicroblaze.opt48 Use table lookup optimization for small signed integer divisions.
/netbsd/external/lgpl3/gmp/dist/tune/
H A 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/external/gpl3/gcc.old/dist/gcc/config/mips/
H A D10000.md120 ;; Only ALU2 does int multiplications and divisions.
/netbsd/external/gpl3/gcc/dist/gcc/config/mips/
H A D10000.md120 ;; Only ALU2 does int multiplications and divisions.
/netbsd/usr.bin/midiplay/
H A Dmidiplay.c593 .divisions=tp->delta)); in playdata()
/netbsd/external/gpl3/gcc/dist/libgfortran/
H A DChangeLog-202120 64-bit functions to avoid many slow divisions.
/netbsd/external/lgpl3/gmp/dist/doc/
H A 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
H A Dgmp.texi3551 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.
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
9256 The advantage of this algorithm is that big divisions can make use of the
9258 Division}), and big divisions tend to have less overheads than lots of
9259 separate single limb divisions anyway. But in any case the cost of
[all …]
H A 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/regress/lib/libc/ieeefp/testfloat/notes/
H A 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/external/gpl3/gcc.old/dist/gcc/config/arm/
H A Dexynos-m1.md424 ;; TODO: assume the median latency; blocks other divisions
/netbsd/external/gpl3/gcc/dist/gcc/config/arm/
H A Dexynos-m1.md424 ;; TODO: assume the median latency; blocks other divisions
/netbsd/external/bsd/ntp/dist/ntpsnmpd/
H A Dntpv4-mib.mib166 is represented as divisions of a second, e.g., a value of 1000
/netbsd/sys/arch/m68k/060sp/dist/
H A Dilsp.s306 # the last two divisions to get a quotient longword and word remainder:
/netbsd/external/gpl3/gcc.old/dist/gcc/fortran/
H A Dlang.opt266 Warn about constant integer divisions with truncated results.
/netbsd/external/gpl3/gcc/dist/gcc/fortran/
H A Dlang.opt266 Warn about constant integer divisions with truncated results.
/netbsd/external/gpl3/gcc.old/dist/gcc/config/mmix/
H A Dmmix.md295 ;; One day we might persuade GCC to expand divisions with constants the
/netbsd/external/gpl3/gcc/dist/gcc/config/mmix/
H A Dmmix.md319 ;; One day we might persuade GCC to expand divisions with constants the
/netbsd/external/lgpl3/mpfr/dist/doc/
H A DREADME.dev323 divisions by 0 are avoided in the MPFR library.
600 check that all divisions by 0 have been protected

1234