/freebsd/sys/contrib/device-tree/Bindings/clock/ |
H A D | ti-keystone-pllctrl.txt | 6 divisions, gating, and synchronization.
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ExpandLargeDivRem.cpp | 11 // This is useful for targets like x86_64 that cannot lower divisions 12 // with more than 128 bits or targets like x86_32 that cannot lower divisions
|
/freebsd/contrib/lua/src/ |
H A D | ldebug.h | 32 ** information. (A power of two allows fast divisions.)
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | DivisionByConstantInfo.h | 9 /// This file implements support for optimizing divisions by a constant
|
/freebsd/sys/contrib/device-tree/Bindings/i2c/ |
H A D | st,nomadik-i2c.yaml | 12 DB8500 after the merge of these two companies wireless divisions.
|
/freebsd/contrib/ntp/libntp/ |
H A D | timetoa.c | 77 * Since conversion to string uses lots of divisions anyway, in format_time_fraction()
|
H A D | ntp_calendar.c | 12 * abysmal performance is the fact that all divisions are divisions by 30 * For all this, all divisions by constant are coded manually, even when 485 * 32/16bit divisions and is still performant is a bit more 570 * divisions. 619 * divisions. 694 /* We rely on the compiler to do efficient 64bit divisions as in ntpcal_daysplit() 838 /* Do 3 chained floor divisions by positive constants, using the in priv_timesplit() 1836 /* Use two fast cycle-split divisions again. Herew e want to in isocal_split_eraweeks()
|
/freebsd/contrib/bearssl/src/codec/ |
H A D | pemenc.c | 75 /* FIXME: try to avoid divisions here, as they may pull in br_pem_encode()
|
/freebsd/sys/fs/ext2fs/ |
H A D | fs.h | 127 * quantities by using shifts and masks in place of divisions
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BypassSlowDivision.cpp | 247 // Long integer divisions are often used in hashtable implementations. It's in getValueRange() 248 // not worth bypassing such divisions because hash values are extremely in getValueRange()
|
/freebsd/sys/kern/ |
H A D | subr_clockcalib.c | 123 /* Precompute to save on divisions later. */ in clockcalib()
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | DivisionByConstantInfo.cpp | 9 /// This file implements support for optimizing divisions by a constant
|
/freebsd/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_collapse.h | 140 // negative, but it'll remove multiplications and divisions in several places.
|
/freebsd/contrib/llvm-project/libcxx/src/include/ryu/ |
H A D | d2s_intrinsics.h | 155 // functions for 64-bit divisions, even if the divisor is a constant.
|
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMSchedule.td | 88 // Divisions.
|
/freebsd/contrib/bc/manuals/ |
H A D | algorithms.md | 350 It has a complexity of `O(n^4)` because it has a linear number of divisions.
|
/freebsd/contrib/ntp/ntpsnmpd/ |
H A D | ntpSnmpSubagentObject.c | 408 * is represented as divisions of a second, e.g., a value of 1000
|
H A D | ntpv4-mib.mib | 166 is represented as divisions of a second, e.g., a value of 1000
|
/freebsd/contrib/ntp/include/ |
H A D | ntp_calendar.h | 495 * This needs (in theory) 2 true divisions -- most compilers check the
|
/freebsd/sys/x86/isa/ |
H A D | clock.c | 252 * multiplications and divisions to scale the count take a while). in i8254_delay()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86.td | 480 // True if 8-bit divisions are significantly faster than 481 // 32-bit divisions and should be used when possible. 487 // 64-bit divisions and should be used when possible.
|
/freebsd/sys/netinet/cc/ |
H A D | cc_htcp.c | 105 * HTCP_ALPHA_INC_SHIFT is used to ensure the integer divisions don't
|
/freebsd/contrib/ntp/ntpd/ |
H A D | check_y2k.c | 378 * **divisions proved well founded) */ in main()
|
/freebsd/crypto/openssl/crypto/bn/ |
H A D | bn_prime.c | 71 * Calculate the number of trial divisions that gives the best speed in
|
/freebsd/lib/msun/src/ |
H A D | e_sqrt.c | 208 Section A) uses newton iterations and involves four divisions.
|