HomeSort by: relevance | last modified time | path
    Searched defs:median (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.sbin/timed/timed/
networkdelta.c 43 static long median(float, float*, long*, long*, unsigned int);
47 * Compute the median of the reasonable differences. First compute
48 * the median of all authorized differences, and then compute the
49 * median of all differences that are reasonably close to the first
50 * median.
80 * compute the median of the good values
106 fprintf(fd, "median of %d values starting at %ld is about ",
108 med = median(med, &eps, &x[0], xp+1, VALID_RANGE);
111 * compute the median of all values near the good median
154 median(float a, \/* initial guess for the median *\/ function in typeref:typename:long
    [all...]
  /src/sys/dev/ic/
apple_smc.c 487 uint32_t start = 0, end = apple_smc_nkeys(smc), median;
493 median = (start + ((end - start) / 2));
494 error = apple_smc_nth_key(smc, median, NULL, &key);
500 end = median;
502 start = (median + 1);
504 start = end = median; /* stop here */
483 uint32_t start = 0, end = apple_smc_nkeys(smc), median; local in function:apple_smc_key_search
  /src/sys/netinet/
ip_reass.c 468 * reassembly queue, compute and return the median TTL over all
474 u_int nfrags, median, dropfraction, keepfraction; local in function:ip_reass_ttl_decr
498 /* Find median (or other drop fraction) in histogram. */
501 for (i = IPFRAGTTL, median = 0; i >= 0; i--) {
502 median += fragttl_histo[i];
503 if (median >= keepfraction)
507 /* Return TTL of median (or other fraction). */
519 * Compute median TTL of all fragments, and count frags
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/fb/
nouveau_nvkm_subdev_fb_ramgt215.c 108 u8 median[8], bins[4] = {0, 0, 0, 0}, bin = 0, qty = 0; local in function:gt215_link_train_calc
130 median[i] = ((hi - lo) >> 1) + lo;
131 bins[(median[i] & 0xf0) >> 4]++;
132 median[i] += 0x30;
145 median[i] = max(median[i], (u8) (bin << 4));
146 median[i] = min(median[i], (u8) ((bin << 4) | 0xf));
148 train->r_100720 |= ((median[i] & 0x0f) << (i << 2));

Completed in 15 milliseconds