Home
last modified time | relevance | path

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

/linux/net/sched/
H A Dsch_prio.c25 u8 prio2band[TC_PRIO_MAX+1];
57 return q->queues[q->prio2band[band & TC_PRIO_MAX]]; in prio_classify()
155 TC_PRIO_MAX + 1); in prio_offload()
191 for (i = 0; i <= TC_PRIO_MAX; i++) { in prio_tune()
211 memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1); in prio_tune()
270 memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1); in prio_dump()
H A Dsch_ets.c54 u8 prio2band[TC_PRIO_MAX + 1];
409 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()
H A Dsch_fq.c109 #define FQ_PRIO2BAND_CRUMB_SIZE ((TC_PRIO_MAX + 1) >> 2)
602 band = fq_prio2band(q->prio2band, skb->priority & TC_PRIO_MAX); in fq_enqueue()
1008 const int num_elems = TC_PRIO_MAX + 1; in fq_load_priomap()
1022 const int num_elems = TC_PRIO_MAX + 1; in fq_change()
1059 for (i = 0; i < TC_PRIO_MAX + 1; i++) { in fq_change()
H A Dsch_generic.c754 const u8 sch_default_prio2band[TC_PRIO_MAX + 1] = { in band2list()
782 int band = sch_default_prio2band[skb->priority & TC_PRIO_MAX]; in pfifo_fast_dequeue()
893 memcpy(&opt.priomap, sch_default_prio2band, TC_PRIO_MAX + 1); in pfifo_fast_init()
/linux/tools/include/uapi/linux/
H A Dpkt_sched.h27 #define TC_PRIO_MAX 15 macro
149 __u8 priomap[TC_PRIO_MAX+1]; /* Map: logical priority -> PRIO band */