109 	struct ath_atx_ac *ac = tid->ac;  in ath_tx_queue_tid()  local
121 	list_add_tail(&tid->list, &ac->tid_q);  in ath_tx_queue_tid()
123 	if (ac->sched)  in ath_tx_queue_tid()
126 	ac->sched = true;  in ath_tx_queue_tid()
129 	list_add_tail(&ac->list, list);  in ath_tx_queue_tid()
211 	struct ath_txq *txq = tid->ac->txq;  in ath_tx_tid_change_state()
240 	struct ath_txq *txq = tid->ac->txq;  in ath_tx_flush_tid()
647 				tid->ac->clear_ps_filter = true;  in ath_tx_complete_aggr()
737 	int q = tid->ac->txq->mac80211_qnum;  in ath_lookup_rate()
1474 	if (tid->ac->clear_ps_filter || tid->an->no_ps_filter) {  in ath_tx_sched_aggr()
1475 		tid->ac->clear_ps_filter = false;  in ath_tx_sched_aggr()
1494 	txq = txtid->ac->txq;  in ath_tx_aggr_start()
1528 	struct ath_txq *txq = txtid->ac->txq;  in ath_tx_aggr_stop()
1541 	struct ath_atx_ac *ac;  in ath_tx_aggr_sleep()  local
1549 		ac = tid->ac;  in ath_tx_aggr_sleep()
1550 		txq = ac->txq;  in ath_tx_aggr_sleep()
1564 		if (ac->sched) {  in ath_tx_aggr_sleep()
1565 			ac->sched = false;  in ath_tx_aggr_sleep()
1566 			list_del(&ac->list);  in ath_tx_aggr_sleep()
1578 	struct ath_atx_ac *ac;  in ath_tx_aggr_wakeup()  local
1585 		ac = tid->ac;  in ath_tx_aggr_wakeup()
1586 		txq = ac->txq;  in ath_tx_aggr_wakeup()
1589 		ac->clear_ps_filter = true;  in ath_tx_aggr_wakeup()
1609 	txq = tid->ac->txq;  in ath_tx_aggr_resume()
1648 		ath_txq_lock(sc, tid->ac->txq);  in ath9k_release_buffered_frames()
1672 		ath_txq_unlock_complete(sc, tid->ac->txq);  in ath9k_release_buffered_frames()
1918 	struct ath_atx_ac *ac, *last_ac;  in ath_txq_schedule()  local
1946 		ac = list_first_entry(ac_list, struct ath_atx_ac, list);  in ath_txq_schedule()
1947 		last_tid = list_entry(ac->tid_q.prev, struct ath_atx_tid, list);  in ath_txq_schedule()
1948 		list_del(&ac->list);  in ath_txq_schedule()
1949 		ac->sched = false;  in ath_txq_schedule()
1951 		while (!list_empty(&ac->tid_q)) {  in ath_txq_schedule()
1953 			tid = list_first_entry(&ac->tid_q, struct ath_atx_tid,  in ath_txq_schedule()
1972 		if (!list_empty(&ac->tid_q) && !ac->sched) {  in ath_txq_schedule()
1973 			ac->sched = true;  in ath_txq_schedule()
1974 			list_add_tail(&ac->list, ac_list);  in ath_txq_schedule()
1980 		if (ac == last_ac) {  in ath_txq_schedule()
2376 		WARN_ON(tid->ac->txq != txctl->txq);  in ath_tx_start()
2379 			tid->ac->clear_ps_filter = true;  in ath_tx_start()
2873 	struct ath_atx_ac *ac;  in ath_tx_node_init()  local
2889 		tid->ac = &an->ac[acno];  in ath_tx_node_init()
2892 	for (acno = 0, ac = &an->ac[acno];  in ath_tx_node_init()
2893 	     acno < IEEE80211_NUM_ACS; acno++, ac++) {  in ath_tx_node_init()
2894 		ac->sched    = false;  in ath_tx_node_init()
2895 		ac->clear_ps_filter = true;  in ath_tx_node_init()
2896 		ac->txq = sc->tx.txq_map[acno];  in ath_tx_node_init()
2897 		INIT_LIST_HEAD(&ac->tid_q);  in ath_tx_node_init()
2903 	struct ath_atx_ac *ac;  in ath_tx_node_cleanup()  local
2911 		ac = tid->ac;  in ath_tx_node_cleanup()
2912 		txq = ac->txq;  in ath_tx_node_cleanup()
2921 		if (ac->sched) {  in ath_tx_node_cleanup()
2922 			list_del(&ac->list);  in ath_tx_node_cleanup()
2923 			tid->ac->sched = false;  in ath_tx_node_cleanup()