Lines Matching refs:link
68 internal device queueing, but on a permanently loaded link it is true.
149 struct cbq_class link;
208 * it allows us to combine link sharing and priority scheduling
211 * Namely, you can put link sharing rules (f.e. route based) at root of CBQ,
221 struct cbq_class *head = &q->link;
273 * Step 3+n. If classifier selected a link sharing class,
761 idle -= L2T(&q->link, len);
797 * only if link is completely congested.
960 incr2 = L2T(&q->link, q->tx_len);
1002 q->link.undertime == PSCHED_PASTPERFECT)
1006 q->link.undertime = PSCHED_PASTPERFECT;
1375 if ((q->link.R_tab = qdisc_get_rtab(r, tb[TCA_CBQ_RTAB])) == NULL)
1382 q->link.refcnt = 1;
1383 q->link.sibling = &q->link;
1384 q->link.common.classid = sch->handle;
1385 q->link.qdisc = sch;
1386 q->link.q = qdisc_create_dflt(sch->dev_queue, &pfifo_qdisc_ops,
1388 if (!q->link.q)
1389 q->link.q = &noop_qdisc;
1391 q->link.priority = TC_CBQ_MAXPRIO - 1;
1392 q->link.priority2 = TC_CBQ_MAXPRIO - 1;
1393 q->link.cpriority = TC_CBQ_MAXPRIO - 1;
1394 q->link.ovl_strategy = TC_CBQ_OVL_CLASSIC;
1395 q->link.overlimit = cbq_ovl_classic;
1396 q->link.allot = psched_mtu(qdisc_dev(sch));
1397 q->link.quantum = q->link.allot;
1398 q->link.weight = q->link.R_tab->rate.rate;
1400 q->link.ewma_log = TC_CBQ_DEF_EWMA;
1401 q->link.avpkt = q->link.allot/2;
1402 q->link.minidle = -0x7FFFFFFF;
1411 cbq_link_class(&q->link);
1414 cbq_set_lss(&q->link, nla_data(tb[TCA_CBQ_LSSOPT]));
1416 cbq_addprio(q, &q->link);
1420 qdisc_put_rtab(q->link.R_tab);
1562 if (cbq_dump_attr(skb, &q->link) < 0)
1577 q->link.xstats.avgidle = q->link.avgidle;
1578 return gnet_stats_copy_app(d, &q->link.xstats, sizeof(q->link.xstats));
1693 if (cl != &q->link)
1860 parent = &q->link;
1899 if (cl->tparent != &q->link)
1906 cl->ewma_log = q->link.ewma_log;
1908 cl->maxidle = q->link.maxidle;
1910 cl->avpkt = q->link.avpkt;
1938 if (cl->filters || cl->children || cl == &q->link)
1984 cl = &q->link;