Searched refs:flows (Results 1 – 14 of 14) sorted by relevance
345 int flows; in parse_flowsets() local358 if (flows == 0) in parse_flowsets()359 flows = 1; in parse_flowsets()363 flows == 0) { in parse_flowsets()384 wsum += wi * flows; in parse_flowsets()388 fs->n_flows = flows; in parse_flowsets()391 fs->y = x * flows; in parse_flowsets()398 c->flows = n_flows; in parse_flowsets()450 c->flows = 1; in init()513 if (c->flows <= 0) in init()[all …]
317 if (!si->flows[idx].active ) { in fq_codel_enqueue()320 si->flows[idx].cst.dropping = false; in fq_codel_enqueue()322 si->flows[idx].active = 1; in fq_codel_enqueue()332 if (si->flows[maxidx].active) in fq_codel_enqueue()337 if (si->flows[i].active && si->flows[i].stats.length > in fq_codel_enqueue()338 si->flows[maxidx].stats.length) in fq_codel_enqueue()445 if(si->flows) { in fq_codel_new_sched()459 if (si->flows == NULL) { in fq_codel_new_sched()474 si->flows[i].cst.maxpkt_size = 500; in fq_codel_new_sched()490 free(si->flows , M_DUMMYNET); in fq_codel_free_sched()[all …]
867 struct fq_pie_flow *flows; in fq_pie_enqueue() local872 flows = si->si_extra->flows; in fq_pie_enqueue()891 if (!flows[idx].active) { in fq_pie_enqueue()895 flows[idx].active = 1; in fq_pie_enqueue()909 if (flows[i].active && flows[i].stats.length > in fq_pie_enqueue()1012 struct fq_pie_flow *flows; in fq_pie_new_sched() local1039 flows = si->si_extra->flows; in fq_pie_new_sched()1040 if (flows == NULL) { in fq_pie_new_sched()1076 struct fq_pie_flow *flows; in fq_pie_free_sched() local1081 flows = si->si_extra->flows; in fq_pie_free_sched()[all …]
80 struct fq_codel_flow *flows; /* array of flows (queues) */ member
51 of flows which can be further partitioned according to a mask.68 collect packets into independent flows on each scheduler.688 instance, as local status variable depending for example by flows that
1158 int flows; local1169 flows = 0;1189 flows++;1208 flows++;1217 fv->fv_flows = flows; /* save the number of active fve's */
39 … 1112 bsnmp-pcap monitor traffic for specific network flows (Stef Walter <[email protected]>)
85 <0x4013000 0x400>; /* 32 Rx flows */
164 general, code flow begins at the top of the diagram and flows
388 in the table, are not passed through the list. For TCP flows, the filter
1262 the incoming edge through which @var{var} flows.
994 cleanups multiple times, on disjoint control flows, so we cannot
1806 network in order to continue with a task at hand. As such, these flows
24458 SSA_NAME flows through an abnormal edge.