Lines Matching defs:flows

36 	int flows;	/* number of flows */
38 int wsum; /* sum of weights of all flows */
91 double *q_wfi; /* (byte) Worst-case Fair Index of the flows */
255 for (i=0; i < c->flows; i++) {
313 * weight:maxlen:flows
314 * indicating how many flows are hooked to that fs.
316 * The first pass (fs != NULL) justs count the number of flowsets and flows,
328 DX(3, "--- pass %d flows %d flowsets %d", pass, c->flows, c->flowsets);
345 int flows;
357 flows = getnum(strsep(&cur, ":"), NULL, "flows");
358 if (flows == 0)
359 flows = 1;
360 DX(4, "weight %d..%d (%d) len %d..%d (%d) flows %d",
361 w, w_h, w_steps, len, len_h, l_steps, flows);
363 flows == 0) {
367 n_flows += flows * w_steps * l_steps;
376 DX(3, "----- fs %4d weight %4d lmax %4d X %4d flows %d",
377 n_fs, wi, li, x, flows);
384 wsum += wi * flows;
388 fs->n_flows = flows;
391 fs->y = x * flows;
398 c->flows = n_flows;
404 /* now link all flows to their parent flowsets */
405 DX(1,"%d flows on %d flowsets", c->flows, c->flowsets);
408 DX(1,"%d flows on %d flowsets max_y %d", c->flows, c->flowsets, c->max_y);
450 c->flows = 1;
496 } else if (!strcmp(*av, "-flows")) {
497 c->flows = getnum(av[1], NULL, av[0]);
498 DX(3, "setting flows to %d", c->flows);
513 if (c->flows <= 0)
514 c->flows = 1;
523 c->th_min = c->flows * -c->th_min;
525 c->th_max = c->flows * -c->th_max;
547 D("using %d flows, %d flowsets", c->flows, c->flowsets);
554 c->q = calloc(c->flows, c->q_len); /* one queue per flow */
555 c->q_wfi = calloc(c->flows, sizeof(double)); /* stats, one per flow */
583 * all flows in the list for backlog = 0
588 for (i = 0; i < c->flows; i++) {
598 c->llmask = 1; /* all flows are in the first list */
627 sprintf(msg, "1::%d", c.flows);
628 for (i = 0; i < c.flows; i++) {