Lines Matching defs:classes
14 * classes at will. Instead one specifies number of classes, how many are
20 * The strict classes, if any, are tried for traffic first: first band 0, if it
55 struct ets_class classes[TCQ_ETS_MAX_BANDS];
94 return &q->classes[arg - 1];
100 int band = cl - q->classes;
130 q_sum += q->classes[i].quantum;
133 quantum = q->classes[i].quantum;
192 unsigned int band = cl - q->classes;
408 return &q->classes[q->prio2band[band & TC_PRIO_MAX]];
414 return &q->classes[q->prio2band[0]];
415 return &q->classes[band];
474 cl = &q->classes[band];
651 ets_class_id(sch, &q->classes[i]),
664 INIT_LIST_HEAD(&q->classes[i].alist);
665 if (q->classes[i].qdisc->q.qlen) {
666 list_add_tail(&q->classes[i].alist, &q->active);
667 q->classes[i].deficit = quanta[i];
671 if (i >= q->nstrict && q->classes[i].qdisc->q.qlen)
672 list_del(&q->classes[i].alist);
673 qdisc_tree_flush_backlog(q->classes[i].qdisc);
679 q->classes[i].quantum = quanta[i];
682 q->classes[i].qdisc = queues[i];
683 if (q->classes[i].qdisc != &noop_qdisc)
684 qdisc_hash_add(q->classes[i].qdisc, true);
691 qdisc_put(q->classes[i].qdisc);
692 memset(&q->classes[i], 0, sizeof(q->classes[i]));
720 if (q->classes[band].qdisc->q.qlen)
721 list_del(&q->classes[band].alist);
724 qdisc_reset(q->classes[band].qdisc);
735 qdisc_put(q->classes[band].qdisc);
769 q->classes[band].quantum))