Searched refs:w_q (Results 1 - 6 of 6) sorted by relevance

/freebsd-10.2-release/sys/netinet/
H A Dip_dummynet.h156 int w_q ; /* queue weight (scaled) */ member in struct:dn_fs
/freebsd-10.2-release/sbin/ipfw/
H A Ddummynet.c244 "\n\t %cRED w_q %f min_th %d max_th %d max_p %f",
246 1.0 * fs->w_q / (double)(1 << SCALE_RED),
1024 NEED1("red/gred needs w_q/min_th/max_th/max_p\n");
1029 * the format for parameters is w_q/min_th/max_th/max_p
1032 double w_q = strtod(end, NULL); local
1033 if (w_q > 1 || w_q <= 0)
1034 errx(EX_DATAERR, "0 < w_q <= 1");
1035 fs->w_q = (int) (w_q * (
[all...]
/freebsd-10.2-release/sys/netpfil/ipfw/
H A Dip_dn_glue.c111 int w_q ; /* queue weight (scaled) */ member in struct:dn_flow_set
119 u_int * w_q_lookup ; /* lookup table for computing (1-w_q)^t */
122 int lookup_weight ; /* equal to (1-w_q)^t / (1-w_q)^(t+1) */
425 fs->w_q = f->w_q;
647 fs->w_q = f->fs.w_q;
701 fs->w_q = f->fs.w_q;
[all...]
H A Dip_dn_private.h219 int w_q ; /* queue weight (scaled) */ member in struct:dn_fsk
228 u_int * w_q_lookup ; /* lookup table for computing (1-w_q)^t */
231 int lookup_weight ; /* equal to (1-w_q)^t / (1-w_q)^(t+1) */
H A Dip_dummynet.c1050 fs->w_q = fs->fs.w_q;
1058 idle = div64((s * 3) , fs->w_q); /* s, fs->w_q scaled; idle not scaled */
1063 w0 = weight = SCALE(1) - fs->w_q; //fs->w_q scaled
1103 /* Fill the lookup table with (1 - w_q)^x */
1104 fs->w_q_lookup[0] = SCALE(1) - fs->w_q;
H A Dip_dn_io.c291 * with an exponential weighted (w_q) moving average:
292 * avg <- (1-w_q) * avg + w_q * q_size
296 * avg = (1 - w_q)^(idle/s)
313 /* Queue is not empty, avg <- avg + (q_size - avg) * w_q */
315 int64_t v = SCALE_MUL((int64_t)diff, (int64_t)fs->w_q);
322 * (1 - * w_q)^(idle_time/s) where s is the time to send a

Completed in 186 milliseconds