Home
last modified time | relevance | path

Searched full:estimate (Results 1 – 25 of 508) sorted by relevance

12345678910>>...21

/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/redacted_send/
H A Dredacted_size.ksh26 # size estimate is the same as the size of the actual send.
28 # -nv and without, and verify the size estimate is the same as
51 log_fail "Full sizes differ: estimate $bytes1 and actual $bytes2"
59 log_fail "Incremental sizes differ: estimate $bytes1 and actual $bytes2"
61 log_pass "Size estimates of redacted sends estimate accurately."
/freebsd/sys/net80211/
H A Dieee80211_ht.h94 * Traffic estimator support. We estimate packets/sec for
107 * Reset packet estimate. in ieee80211_txampdu_init_pps()
123 * Count a packet towards the pps estimate.
129 /* XXX bound loop/do more crude estimate? */ in ieee80211_txampdu_count_packet()
144 * Get the current pps estimate. If the average is out of
145 * date due to lack of traffic then we decay the estimate
151 /* XXX bound loop/do more crude estimate? */ in ieee80211_txampdu_getpps()
/freebsd/contrib/unbound/util/
H A Drtt.h39 * This file contains a data type and functions to help estimate good
92 * Update the statistics with a new roundtrip estimate observation.
94 * @param ms: estimate of roundtrip time in milliseconds.
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/MCTargetDesc/
H A DRISCVMatInt.h64 // Helper to estimate the number of instructions required to materialise the
65 // given immediate value into a register. This estimate does not account for
66 // `Val` possibly fitting into an immediate, and so may over-estimate.
/freebsd/contrib/ntp/html/
H A Dstats.html28 …<li>Nominal estimate of the server clock time relative to the client clock time. This is called <e…
50 …ted error in determining the clock offset estimate. Root distance represents the maximum error of …
58 …<li>Root distance defines the maximum error of the clock offset estimate due to all causes as long…
65 …ood estimate of the system clock offset, while system jitter, also called estimated error, is best…
H A Dselect.html25 …estimate of the offset for each candidate. The best point is at the midpoint &theta;<sub>0</sub> …
30 …rrectness interval? Fortunately, we already have the maximum likelihood estimate at the midpoint o…
31 …ample produced by the clock filter algorithm is the maximum likelihood estimate and thus best r…
/freebsd/sys/gnu/dev/bwn/phy_n/
H A Dif_bwn_phy_n_regs.h470 #define BWN_NPHY_IQEST_CMD BWN_PHY_N(0x129) /* I/Q estimate command */
473 #define BWN_NPHY_IQEST_WT BWN_PHY_N(0x12A) /* I/Q estimate wait time */
476 #define BWN_NPHY_IQEST_SAMCNT BWN_PHY_N(0x12B) /* I/Q estimate sample count */
477 #define BWN_NPHY_IQEST_IQACC_LO0 BWN_PHY_N(0x12C) /* I/Q estimate I/Q acc lo 0 */
478 #define BWN_NPHY_IQEST_IQACC_HI0 BWN_PHY_N(0x12D) /* I/Q estimate I/Q acc hi 0 */
479 #define BWN_NPHY_IQEST_IPACC_LO0 BWN_PHY_N(0x12E) /* I/Q estimate I power acc lo 0 */
480 #define BWN_NPHY_IQEST_IPACC_HI0 BWN_PHY_N(0x12F) /* I/Q estimate I power acc hi 0 */
481 #define BWN_NPHY_IQEST_QPACC_LO0 BWN_PHY_N(0x130) /* I/Q estimate Q power acc lo 0 */
482 #define BWN_NPHY_IQEST_QPACC_HI0 BWN_PHY_N(0x131) /* I/Q estimate Q power acc hi 0 */
483 #define BWN_NPHY_IQEST_IQACC_LO1 BWN_PHY_N(0x134) /* I/Q estimate I/Q acc lo 1 */
[all …]
H A Dif_bwn_phy_n_tables.h132 #define BWN_NTAB_CHANEST BWN_NTAB32(0x16, 0x000) /* Channel Estimate Table */
142 #define BWN_NTAB_C0_ESTPLT BWN_NTAB8 (0x1A, 0x000) /* Estimate Power Lookup Table Core 0 */
152 #define BWN_NTAB_C1_ESTPLT BWN_NTAB8 (0x1B, 0x000) /* Estimate Power Lookup Table Core 1 */
179 #define BWN_NTAB_CHANEST_R3 BWN_NTAB32(22, 0) /* channel estimate */
/freebsd/lib/msun/src/
H A Ds_cbrtl.c88 /* ~5-bit estimate: */ in cbrtl()
93 /* ~16-bit estimate: */ in cbrtl()
99 /* ~47-bit estimate: */ in cbrtl()
H A De_sqrtl.c123 xn = sqrt(u.e); /* 53-bit estimate of sqrtl(x). */ in sqrtl()
125 xn = (xn + (u.e / xn)) * 0.5; /* 106-bit estimate. */ in sqrtl()
130 xn = xn + (u.e / xn); /* High portion of estimate. */ in sqrtl()
/freebsd/contrib/bearssl/src/int/
H A Di32_muladd.c52 * Principle: we estimate the quotient (x*2^32+z)/m by in br_i32_muladd_small()
70 * If a = b*q + r (with 0 <= r < q), we can estimate q by in br_i32_muladd_small()
85 * We estimate a divisor q. If the quotient returned by br_div() in br_i32_muladd_small()
H A Di31_muladd.c58 * Principle: we estimate the quotient (x*2^31+z)/m by in br_i31_muladd_small()
76 * If a = b*q + r (with 0 <= r < q), we can estimate q by in br_i31_muladd_small()
102 * We estimate a divisor q. If the quotient returned by br_div() in br_i31_muladd_small()
H A Di15_muladd.c84 * Principle: we estimate the quotient (x*2^15+z)/m by in br_i15_muladd_small()
102 * If a = b*q + r (with 0 <= r < q), then we can estimate q by in br_i15_muladd_small()
127 * We computed an estimate for q, but the real one may be q, in br_i15_muladd_small()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h123 /// Produce an estimate of the unrolled cost of the specified loop. This
124 /// is used to a) produce a cost estimate for partial unrolling and b) to
125 /// cheaply estimate cost for full unrolling when we don't want to symbolically
H A DCodeLayout.h47 /// Estimate the "quality" of a given node order in CFG. The higher the score,
55 /// Estimate the "quality" of the current node order in CFG.
/freebsd/sys/contrib/openzfs/module/lua/
H A Dlgc.c911 static void setpause (global_State *g, l_mem estimate) { in setpause() argument
913 estimate = estimate / PAUSEADJ; /* adjust 'estimate' */ in setpause()
914 threshold = (g->gcpause < MAX_LMEM / estimate) /* overflow? */ in setpause()
915 ? estimate * g->gcpause /* no overflow */ in setpause()
1034 return work; /* estimate of memory marked by 'atomic' */ in atomic()
1061 g->GCestimate += work; /* estimate of total memory traversed */ in singlestep()
1123 lu_mem estimate = g->GCestimate; in generationalcollection() local
1126 if (gettotalbytes(g) > (estimate / 100) * g->gcmajorinc) in generationalcollection()
1129 g->GCestimate = estimate; /* keep estimate from last major coll. */ in generationalcollection()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86Schedule.td287 defm WriteFRcp : X86SchedWritePair<ReadAfterVecLd>; // Floating point reciprocal estimate.
288 defm WriteFRcpX : X86SchedWritePair<ReadAfterVecXLd>; // Floating point reciprocal estimate (XMM).
289 defm WriteFRcpY : X86SchedWritePair<ReadAfterVecYLd>; // Floating point reciprocal estimate (YMM).
290 defm WriteFRcpZ : X86SchedWritePair<ReadAfterVecYLd>; // Floating point reciprocal estimate (ZMM).
291 defm WriteFRsqrt : X86SchedWritePair<ReadAfterVecLd>; // Floating point reciprocal square root estimate.
292 defm WriteFRsqrtX: X86SchedWritePair<ReadAfterVecXLd>; // Floating point reciprocal square root estimate (XMM).
293 defm WriteFRsqrtY: X86SchedWritePair<ReadAfterVecYLd>; // Floating point reciprocal square root estimate (YMM).
294 defm WriteFRsqrtZ: X86SchedWritePair<ReadAfterVecYLd>; // Floating point reciprocal square root estimate (ZMM).
/freebsd/crypto/openssl/doc/man3/
H A DRAND_add.pod49 The B<randomness> argument is an estimate of how much randomness is
52 Details about sources of randomness and how to estimate their randomness
/freebsd/contrib/arm-optimized-routines/math/aarch64/experimental/
H A Derfinvl.c81 /* Extended-precision variant, which uses the above (or asymptotic estimate) as
97 /* Double overflowed, use asymptotic estimate instead. */ in erfinvl()
/freebsd/contrib/googletest/googlemock/include/gmock/
H A Dgmock-cardinalities.h70 // Conservative estimate on the lower/upper bound of the number of
100 // Conservative estimate on the lower/upper bound of the number of
/freebsd/sys/sys/
H A Dtimeffc.h38 * Feed-forward clock estimate
40 * timecounter period and offset estimate passed by the synchronization daemon.
47 uint64_t period; /* Estimate of counter period. */
/freebsd/contrib/lua/src/
H A Dlgc.c370 int work = 0; /* estimate of how much work was done here */ in remarkupvals()
874 g->GCestimate += g->GCdebt - olddebt; /* correct estimate */ in checkSizes()
1053 ** start when memory use hits the threshold of ('estimate' * pause /
1054 ** PAUSEADJ). (Division by 'estimate' should be OK: it cannot be zero,
1060 l_mem estimate = g->GCestimate / PAUSEADJ; /* adjust 'estimate' */ in setpause() local
1061 lua_assert(estimate > 0); in setpause()
1062 threshold = (pause < MAX_LMEM / estimate) /* overflow? */ in setpause()
1063 ? estimate * pause /* no overflow */ in setpause()
1412 g->GCestimate = gettotalbytes(g); /* first estimate */; in stepgenfull()
1562 return work; /* estimate of slots marked by 'atomic' */ in atomic()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dformatter_tuple.h101 // it depends on the format-spec. As an initial estimate we guess 6 in format()
106 // So estimate 8 times the range size as buffer. in format()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMBasicBlockInfo.h47 /// conservative estimate of the real distance which may be smaller.
54 /// inline assembly, this is a worst case estimate.
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInlineModelFeatureMaps.h65 "Estimate of the accumulated cost of nested inlines") \
111 M(int64_t, {1}, cost_estimate, "total cost estimate (threshold - free)") \

12345678910>>...21