MAX_TID_COUNT
if (unlikely(tid >= MAX_TID_COUNT))
if (WARN_ON_ONCE(tid >= MAX_TID_COUNT)) {
if (unlikely(tid >= MAX_TID_COUNT))
if (tid != MAX_TID_COUNT && (lq_sta->tx_agg_tid_en & (1 << tid))) {
tid != MAX_TID_COUNT) {
return MAX_TID_COUNT;
return MAX_TID_COUNT;
return MAX_TID_COUNT;
struct il_tid_data tid[MAX_TID_COUNT];
for (j = 0; j < MAX_TID_COUNT; j++) {
if (tid >= MAX_TID_COUNT) {
if (unlikely(tid >= MAX_TID_COUNT))
if (unlikely(tid >= MAX_TID_COUNT))
if (unlikely(tid >= MAX_TID_COUNT))
if (unlikely(tid >= MAX_TID_COUNT))
if (unlikely(tid >= MAX_TID_COUNT))
u32 aver_tidtx_inperiod[MAX_TID_COUNT] = {0};
u32 tidtx_inp4eriod[MAX_TID_COUNT] = {0};
if (tid < MAX_TID_COUNT)
struct rtl_tid_data tids[MAX_TID_COUNT];
struct sk_buff_head skb_waitq[MAX_TID_COUNT];
u32 tidtx_in4period[MAX_TID_COUNT][4];
u32 tidtx_inperiod[MAX_TID_COUNT];
bool higher_busytxtraffic[MAX_TID_COUNT];