Home
last modified time | relevance | path

Searched full:median (Results 1 – 25 of 92) sorted by relevance

1234

/freebsd/tools/test/arc4random/
H A Dbiastest.c130 long long histogram[UCHAR_MAX + 1] = { 0 }, sum, n, median; in analyze_sample() local
136 /* find median, average, deviation, smallest, and largest bucket */ in analyze_sample()
146 median = threshold; in analyze_sample()
158 if (median == threshold && n > tries / 2) in analyze_sample()
159 median = i; in analyze_sample()
171 assert(median < threshold); in analyze_sample()
177 printf("\tmedian: %lld (expected %lu)\n", median, (unsigned long)threshold / 2); in analyze_sample()
185 /* find median, average, and deviation */ in analyze_sample()
197 median = UCHAR_MAX + 1; in analyze_sample()
201 median = i; in analyze_sample()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-graph.h45 double Median; member
168 return {A.Count + B.Count, A.Min + B.Min, A.Median + B.Median,
177 return {A.Count - B.Count, A.Min - B.Min, A.Median - B.Median,
188 A.Median / B,
200 A.Median * B,
216 return {A.Count * B.Count, A.Min * B.Min, A.Median * B.Median,
224 return {A.Count / B.Count, A.Min / B.Min, A.Median / B.Median,
H A Dxray-graph.cpp72 "median function durations"),
96 "median function durations"),
120 "median function durations"),
144 "median function durations"),
282 S.Median = *(begin + MedianOff); in getStats()
295 M.Median = std::max(M.Median, S.Median); in updateMaxStats()
356 double TimeStat::*DoubleStatPtrs[] = {&TimeStat::Min, &TimeStat::Median, in getString()
378 double TimeStat::*DoubleStatPtrs[] = {&TimeStat::Min, &TimeStat::Median, in getDouble()
H A Dxray-account.cpp85 clEnumValN(SortField::MED, "med", "median function durations"),
265 double Median; member
285 R.Median = Timings[MedianOff]; in getStats()
323 Row.Median /= CycleFrequency; in exportStats()
346 sortByKey(Results, [](const TupleType &X) { return std::get<2>(X).Median; }); in exportStats()
387 // - min, median, 90pct, 99pct, max: double precision, but we want to keep in exportStatsAsText()
404 OS << llvm::formatv(StatsFormat, FuncId, Count, Row.Min, Row.Median, in exportStatsAsText()
412 OS << "funcid,count,min,median,90%ile,99%ile,max,sum,debug,function\n"; in exportStatsAsCSV()
414 OS << FuncId << ',' << Count << ',' << Row.Min << ',' << Row.Median << ',' in exportStatsAsCSV()
H A Dxray-graph-diff.cpp116 "median function durations"),
139 "median function durations"),
163 "median function durations"),
187 "median function durations"),
/freebsd/sys/contrib/device-tree/Bindings/input/touchscreen/
H A Dad7879.txt24 - adi,median-filter-size : 0: disabled
29 - adi,averaging : 0: 2 middle values (1 if median disabled)
50 adi,median-filter-size = /bits/ 8 <2>;
68 adi,median-filter-size = /bits/ 8 <2>;
H A Dadi,ad7879.yaml62 adi,median-filter-size:
78 0: 2 middle values (1 if median disabled)
122 adi,median-filter-size = /bits/ 8 <2>;
146 adi,median-filter-size = /bits/ 8 <2>;
/freebsd/lib/libsys/
H A Dntp_adjtime.2197 PPS frequency offset produced by the frequency median filter (scaled
200 PPS jitter measured by the time median filter in microseconds
207 frequency median filter (read-only).
210 by the time median filter exceeded the limit
/freebsd/usr.bin/ministat/
H A Dministat.159 Print the average/median/stddev bars on separate lines in the ASCII-art
88 N Min Max Median Avg Stddev
111 N Min Max Median Avg Stddev
H A DREADME21 N Min Max Median Avg Stddev
39 N Min Max Median Avg Stddev
H A Dministat.c200 Median(const struct dataset *ds) in Median() function
235 printf(" N Min Max Median Avg Stddev\n"); in VitalsHead()
243 ds->n, Min(ds), Max(ds), Median(ds), Avg(ds), Stddev(ds)); in Vitals()
413 x = (Median(ds) - pl->x0) / pl->dx; in PlotSet()
546 fprintf(stderr, "\t-s : print avg/median/stddev bars on separate lines\n"); in usage()
/freebsd/sys/contrib/device-tree/Bindings/mfd/
H A Dallwinner,sun4i-a10-ts.yaml48 Select median and averaging filter. Sample used for median /
/freebsd/contrib/unbound/doc/
H A Dunbound-control.8418 .I threadX.recursion.time.median
419 The median of the time it took to answer queries that needed recursive
420 processing. The median means that 50% of the user queries were answered in
422 responsive servers), the average can be bigger than the median. This median
475 .I total.recursion.time.median
H A Dunbound-control.8.in487 .I threadX.recursion.time.median
488 The median of the time it took to answer queries that needed recursive
489 processing. The median means that 50% of the user queries were answered in
491 responsive servers), the average can be bigger than the median. This median
562 .I total.recursion.time.median
/freebsd/contrib/ntp/include/
H A Dntp_refclock.h133 #define MAXSTAGE 64 /* max median filter stages */
134 #define NSTAGE 5 /* default median filter stages */
169 double filter[MAXSTAGE]; /* median filter */
/freebsd/contrib/ntp/html/
H A Dparsenew.html178 u_long cl_samples; /* samples for median filter */
179 u_long cl_keep; /* samples for median filter to keep */
180 median filter parameters - smoothing and rejection of bad samples
/freebsd/contrib/ntp/ntpd/
H A Dntp_refclock.c491 * refclock_process_offset - update median filter
494 * entry in the median filter circular buffer. Samples that overflow the
523 * then constructs a new entry in the median filter circular buffer.
573 * This routine implements a recursive median filter to suppress spikes
602 * Reject the furthest from the median of the samples until in refclock_sample()
606 * definition of the median. The true median is not calculated in refclock_sample()
679 * the median filter samples and give the data to the clock in refclock_receive()
1595 * record this time stamp and stuff in median filter in refclock_pps()
H A Drefclock_arbiter.c278 * median filter is full, send B0. in arb_receive()
417 * Process the new sample in the median filter and determine the in arb_receive()
459 * Process median filter samples. If none received, declare a in arb_poll()
H A Drefclock_wwvb.c432 * Process the new sample in the median filter and determine the in wwvb_receive()
523 * Process median filter samples. If none received, declare a in wwvb_poll()
/freebsd/contrib/ntp/html/drivers/
H A Ddriver22.html25 …ator reject noise and signals with incorrect frequency. A multiple-stage median filter rejects jit…
43 a good deal of signal processing to reduce jitter using the median
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dinplace_merge.h159 _BidirectionalIterator __m1; // "median" of [__first, __middle) in __inplace_merge()
160 _BidirectionalIterator __m2; // "median" of [__middle, __last) in __inplace_merge()
H A Dsort.h560 // It will be always guarded because __introsort will do the median-of-three
637 // guarded because __introsort will do the median-of-three before calling
718 // median-of-three before calling this.
767 // Lower bound for using Tuckey's ninther technique for median computation.
813 // Use Tuckey's ninther technique or median of 3 for pivot selection
/freebsd/contrib/ntp/libntp/
H A Dmktime.c228 ** If time_t is signed, then 0 is the median value, in time2()
229 ** if time_t is unsigned, then 1 << bits is median. in time2()
/freebsd/contrib/unbound/util/
H A Dtimehist.h100 * @param q: quartile, 0.50 results in the median. Must be >0 and <1.
/freebsd/contrib/ntp/kernel/sys/
H A Dbsd_audioirig.h78 struct timeval tv1,tv2,tv3; /* time stamps (median filter) */

1234