Lines Matching defs:link
104 struct cbq_class link;
161 it allows us to combine link sharing and priority scheduling
164 Namely, you can put link sharing rules (f.e. route based) at root of CBQ,
174 struct cbq_class *head = &q->link;
224 * Step 3+n. If classifier selected a link sharing class,
711 idle -= L2T(&q->link, len);
747 only if link is completely congested.
909 incr2 = L2T(&q->link, q->tx_len);
947 q->link.undertime == PSCHED_PASTPERFECT)
951 q->link.undertime = PSCHED_PASTPERFECT;
1318 if ((q->link.R_tab = qdisc_get_rtab(r, tb[TCA_CBQ_RTAB])) == NULL)
1325 q->link.refcnt = 1;
1326 q->link.sibling = &q->link;
1327 q->link.common.classid = sch->handle;
1328 q->link.qdisc = sch;
1329 if (!(q->link.q = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
1332 q->link.q = &noop_qdisc;
1334 q->link.priority = TC_CBQ_MAXPRIO-1;
1335 q->link.priority2 = TC_CBQ_MAXPRIO-1;
1336 q->link.cpriority = TC_CBQ_MAXPRIO-1;
1337 q->link.ovl_strategy = TC_CBQ_OVL_CLASSIC;
1338 q->link.overlimit = cbq_ovl_classic;
1339 q->link.allot = psched_mtu(qdisc_dev(sch));
1340 q->link.quantum = q->link.allot;
1341 q->link.weight = q->link.R_tab->rate.rate;
1343 q->link.ewma_log = TC_CBQ_DEF_EWMA;
1344 q->link.avpkt = q->link.allot/2;
1345 q->link.minidle = -0x7FFFFFFF;
1354 cbq_link_class(&q->link);
1357 cbq_set_lss(&q->link, nla_data(tb[TCA_CBQ_LSSOPT]));
1359 cbq_addprio(q, &q->link);
1363 qdisc_put_rtab(q->link.R_tab);
1499 if (cbq_dump_attr(skb, &q->link) < 0)
1514 q->link.xstats.avgidle = q->link.avgidle;
1515 return gnet_stats_copy_app(d, &q->link.xstats, sizeof(q->link.xstats));
1631 if (cl != &q->link)
1798 parent = &q->link;
1837 if (cl->tparent != &q->link)
1844 cl->ewma_log = q->link.ewma_log;
1846 cl->maxidle = q->link.maxidle;
1848 cl->avpkt = q->link.avpkt;
1876 if (cl->filters || cl->children || cl == &q->link)
1922 cl = &q->link;