Home
last modified time | relevance | path

Searched full:worst (Results 1 – 25 of 479) sorted by relevance

12345678910>>...20

/freebsd-src/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMBasicBlockInfo.h27 /// UnknownPadding - Return the worst case padding that could result from
45 /// Offsets are computed assuming worst case padding before an aligned
49 /// Because worst case padding is used, the computed offset of an aligned
54 /// inline assembly, this is a worst case estimate.
76 /// This number should be used to predict worst case padding when
81 // worst case padding. in internalKnownBits()
/freebsd-src/contrib/arm-optimized-routines/math/
H A Dlog.c60 /* Worst-case error is around 0.516 ULP. */ in log()
68 /* Worst-case error is around 0.516 ULP. */ in log()
81 /* Worst-case error is around 0.532 ULP. */ in log()
87 /* Worst-case error is around 0.507 ULP. */ in log()
144 /* Worst case error if |y| > 0x1p-5: in log()
146 Worst case error if |y| > 0x1p-4: in log()
H A Dexp2.c53 E is the worst-case ulp error outside the subnormal range. So this in specialcase()
54 is only useful if the goal is better than 1 ulp worst-case error. */ in specialcase()
123 /* Without fma the worst case error is 0.5/N ulp larger. */ in exp2()
124 /* Worst case error is less than 0.5+0.86/N+(abs poly error * 2^53) ulp. */ in exp2()
H A Dexp.c55 E is the worst-case ulp error outside the subnormal range. So this in specialcase()
56 is only useful if the goal is better than 1 ulp worst-case error. */ in specialcase()
141 /* Without fma the worst case error is 0.25/N ulp larger. */ in exp_inline()
142 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
H A Dpow.c15 Worst-case error: 0.54 ULP (~= ulperr_exp + 1024*Ln2*relerr_log*2^53)
150 E is the worst-case ulp error outside the subnormal range. So this in specialcase()
151 is only useful if the goal is better than 1 ulp worst-case error. */ in specialcase()
232 /* Without fma the worst case error is 0.25/N ulp larger. */ in exp_inline()
233 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
H A Dexp10.c45 E is the worst-case ulp error outside the subnormal range. So this in special_case()
46 is only useful if the goal is better than 1 ulp worst-case error. */ in special_case()
H A Dlog2.c67 /* Worst-case error is less than 0.54 ULP (0.55 ULP without fma). */ in log2()
130 /* Worst-case error if |y| > 0x1p-4: 0.547 ULP (0.550 ULP without fma). in log2()
/freebsd-src/contrib/arm-optimized-routines/pl/math/
H A Dlog.c
H A Dexp.c
H A Dv_cexpif_1u8.c
H A Dsv_cexpif_1u8.c
H A Dv_sincosf_1u8.c
H A Dsv_sincosf_1u8.c
H A Dv_sincosf_common.h
H A Dsv_sincosf_common.h
/freebsd-src/usr.bin/posixmqcontrol/
H A Dposixmqcontrol.c828 int worst = 0; in main() local
836 worst = result; in main()
839 return (grace(worst)); in main()
846 int worst = 0; in main() local
854 worst = result; in main()
857 return (grace(worst)); in main()
864 int worst = 0; in main() local
876 worst = result; in main()
880 return (grace(worst)); in main()
888 int worst = recv(queue); in main() local
[all …]
/freebsd-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/refreserv/
H A Drefreserv_multi_raidz.ksh22 # raidz refreservation=auto picks worst raidz vdev
55 log_assert "raidz refreservation=auto picks worst raidz vdev"
134 # space inefficient as the worst one.
201 log_pass "raidz refreservation=auto picks worst raidz vdev"
/freebsd-src/sys/contrib/device-tree/Bindings/power/
H A Ddomain-idle-state.yaml33 The worst case latency in microseconds required to enter the idle
39 The worst case latency in microseconds required to exit the idle
/freebsd-src/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsScheduleP5600.td166 // Estimated worst case
171 // Estimated worst case
242 // Best/Common/Worst case = 7 / 23 / 27
247 // Best/Common/Worst case = 7 / 23 / 27
252 // Best/Common/Worst case = 7 / 31 / 35
257 // Best/Common/Worst case = 7 / 19 / 23
262 // Best/Common/Worst case = 7 / 27 / 31
267 // Best/Common/Worst case = 7 / 27 / 27
272 // Best/Common/Worst case = 7 / 27 / 31
277 // Best/Common/Worst case = 7 / 27 / 31
[all …]
/freebsd-src/lib/libc/stdlib/
H A Dqsort.3206 O N**2 worst-case behavior.
218 takes O N lg N worst-case time.
236 is optimized for data with pre-existing order; its worst case
H A Dheapsort.c145 * and worst. While heapsort is faster than the worst case of quicksort,
147 * a data set that will trigger the worst case is nonexistent. Heapsort's
/freebsd-src/crypto/openssl/test/recipes/15-test_mp_rsa_data/
H A Dplain_text1 It was the best of times, it was the worst of times,
/freebsd-src/sys/contrib/device-tree/Bindings/arm/
H A Didle-states.yaml87 entry-latency: Worst case latency required to enter the idle state. The
114 the worst case since it depends on the CPU operating conditions, i.e. caches
119 worst case wake-up latency it can incur if a CPU is allowed to enter an
288 Worst case latency in microseconds required to enter the idle state.
292 Worst case latency in microseconds required to exit the idle state.
/freebsd-src/contrib/arm-optimized-routines/pl/
H A DREADME.contributors
/freebsd-src/sys/contrib/xz-embedded/linux/lib/
H A Ddecompress_unxz.c21 * The worst case for in-place decompression is that the beginning of
23 * incompressible. Thus, we must look for worst-case expansion when the
69 * the worst case for this would be tricky. Instead of trying to do that,

12345678910>>...20