Home
last modified time | relevance | path

Searched refs:TC_PRIO_MAX (Results 1 – 8 of 8) sorted by relevance

/linux-5.19.10/net/sched/
Dsch_prio.c25 u8 prio2band[TC_PRIO_MAX+1];
57 return q->queues[q->prio2band[band & TC_PRIO_MAX]]; in prio_classify()
157 TC_PRIO_MAX + 1); in prio_offload()
193 for (i = 0; i <= TC_PRIO_MAX; i++) { in prio_tune()
213 memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1); in prio_tune()
272 memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1); in prio_dump()
Dsch_ets.c54 u8 prio2band[TC_PRIO_MAX + 1];
407 return &q->classes[q->prio2band[band & TC_PRIO_MAX]]; in ets_classify()
526 if (prio > TC_PRIO_MAX) { in ets_qdisc_priomap_parse()
591 u8 priomap[TC_PRIO_MAX + 1]; in ets_qdisc_change()
787 for (prio = 0; prio <= TC_PRIO_MAX; prio++) { in ets_qdisc_dump()
Dsch_cbq.c129 struct cbq_class *defaults[TC_PRIO_MAX + 1];
239 else if ((cl = defmap[res.classid & TC_PRIO_MAX]) == NULL) in cbq_classify()
278 !(cl = head->defaults[prio & TC_PRIO_MAX]) && in cbq_classify()
920 for (i = 0; i <= TC_PRIO_MAX; i++) { in cbq_sync_defmap()
925 for (i = 0; i <= TC_PRIO_MAX; i++) { in cbq_sync_defmap()
Dsch_generic.c700 static const u8 prio2band[TC_PRIO_MAX + 1] = {
727 int band = prio2band[skb->priority & TC_PRIO_MAX]; in pfifo_fast_enqueue()
836 memcpy(&opt.priomap, prio2band, TC_PRIO_MAX + 1); in pfifo_fast_dump()
Dsch_fq.c269 if (unlikely((skb->priority & TC_PRIO_MAX) == TC_PRIO_CONTROL)) in fq_classify()
/linux-5.19.10/tools/include/uapi/linux/
Dpkt_sched.h27 #define TC_PRIO_MAX 15 macro
149 __u8 priomap[TC_PRIO_MAX+1]; /* Map: logical priority -> PRIO band */
/linux-5.19.10/include/uapi/linux/
Dpkt_sched.h28 #define TC_PRIO_MAX 15 macro
150 __u8 priomap[TC_PRIO_MAX+1]; /* Map: logical priority -> PRIO band */
/linux-5.19.10/include/net/
Dpkt_cls.h930 u8 priomap[TC_PRIO_MAX + 1];
972 u8 priomap[TC_PRIO_MAX + 1];