[deliverable/linux.git] / drivers / net / wireless / marvell / mwifiex / wmm.h

/*
 * Marvell Wireless LAN device driver: WMM
 *
 * Copyright (C) 2011-2014, Marvell International Ltd.
 *
 * This software file (the "File") is distributed by Marvell International
 * Ltd. under the terms of the GNU General Public License Version 2, June 1991
 * (the "License").  You may use, redistribute and/or modify this File in
 * accordance with the terms and conditions of the License, a copy of which
 * is available by writing to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA or on the
 * worldwide web at http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt.
 *
 * THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE
 * ARE EXPRESSLY DISCLAIMED.  The License provides additional details about
 * this warranty disclaimer.
 */

#ifndef _MWIFIEX_WMM_H_
#define _MWIFIEX_WMM_H_

enum ieee_types_wmm_aciaifsn_bitmasks {
	MWIFIEX_AIFSN = (BIT(0) | BIT(1) | BIT(2) | BIT(3)),
	MWIFIEX_ACM = BIT(4),
	MWIFIEX_ACI = (BIT(5) | BIT(6)),
};

enum ieee_types_wmm_ecw_bitmasks {
	MWIFIEX_ECW_MIN = (BIT(0) | BIT(1) | BIT(2) | BIT(3)),
	MWIFIEX_ECW_MAX = (BIT(4) | BIT(5) | BIT(6) | BIT(7)),
};

static const u16 mwifiex_1d_to_wmm_queue[8] = { 1, 0, 0, 1, 2, 2, 3, 3 };

/*
 * This table inverses the tos_to_tid operation to get a priority
 * which is in sequential order, and can be compared.
 * Use this to compare the priority of two different TIDs.
 */
static const u8 tos_to_tid_inv[] = {
	0x02,  /* from tos_to_tid[2] = 0 */
	0x00,  /* from tos_to_tid[0] = 1 */
	0x01,  /* from tos_to_tid[1] = 2 */
	0x03,
	0x04,
	0x05,
	0x06,
	0x07};

/*
 * This function retrieves the TID of the given RA list.
 */
static inline int
mwifiex_get_tid(struct mwifiex_ra_list_tbl *ptr)
{
	struct sk_buff *skb;

	if (skb_queue_empty(&ptr->skb_head))
		return 0;

	skb = skb_peek(&ptr->skb_head);

	return skb->priority;
}

/*
 * This function gets the length of a list.
 */
static inline int
mwifiex_wmm_list_len(struct list_head *head)
{
	struct list_head *pos;
	int count = 0;

	list_for_each(pos, head)
		++count;

	return count;
}

/*
 * This function checks if a RA list is empty or not.
 */
static inline u8
mwifiex_wmm_is_ra_list_empty(struct list_head *ra_list_hhead)
{
	struct mwifiex_ra_list_tbl *ra_list;
	int is_list_empty;

	list_for_each_entry(ra_list, ra_list_hhead, list) {
		is_list_empty = skb_queue_empty(&ra_list->skb_head);
		if (!is_list_empty)
			return false;
	}

	return true;
}

void mwifiex_wmm_add_buf_txqueue(struct mwifiex_private *priv,
				 struct sk_buff *skb);
void mwifiex_wmm_add_buf_bypass_txqueue(struct mwifiex_private *priv,
					struct sk_buff *skb);
void mwifiex_ralist_add(struct mwifiex_private *priv, const u8 *ra);
void mwifiex_rotate_priolists(struct mwifiex_private *priv,
			      struct mwifiex_ra_list_tbl *ra, int tid);

int mwifiex_wmm_lists_empty(struct mwifiex_adapter *adapter);
int mwifiex_bypass_txlist_empty(struct mwifiex_adapter *adapter);
void mwifiex_wmm_process_tx(struct mwifiex_adapter *adapter);
void mwifiex_process_bypass_tx(struct mwifiex_adapter *adapter);
int mwifiex_is_ralist_valid(struct mwifiex_private *priv,
			    struct mwifiex_ra_list_tbl *ra_list, int tid);

u8 mwifiex_wmm_compute_drv_pkt_delay(struct mwifiex_private *priv,
				     const struct sk_buff *skb);
void mwifiex_wmm_init(struct mwifiex_adapter *adapter);

u32 mwifiex_wmm_process_association_req(struct mwifiex_private *priv,
					u8 **assoc_buf,
					struct ieee_types_wmm_parameter *wmmie,
					struct ieee80211_ht_cap *htcap);

void mwifiex_wmm_setup_queue_priorities(struct mwifiex_private *priv,
					struct ieee_types_wmm_parameter *wmm_ie);
void mwifiex_wmm_setup_ac_downgrade(struct mwifiex_private *priv);
int mwifiex_ret_wmm_get_status(struct mwifiex_private *priv,
			       const struct host_cmd_ds_command *resp);
struct mwifiex_ra_list_tbl *
mwifiex_wmm_get_queue_raptr(struct mwifiex_private *priv, u8 tid,
			    const u8 *ra_addr);
u8 mwifiex_wmm_downgrade_tid(struct mwifiex_private *priv, u32 tid);
void mwifiex_update_ralist_tx_pause(struct mwifiex_private *priv, u8 *mac,
				    u8 tx_pause);
void mwifiex_update_ralist_tx_pause_in_tdls_cs(struct mwifiex_private *priv,
					       u8 *mac, u8 tx_pause);

struct mwifiex_ra_list_tbl *mwifiex_wmm_get_ralist_node(struct mwifiex_private
					*priv, u8 tid, const u8 *ra_addr);
#endif /* !_MWIFIEX_WMM_H_ */
Commit	Line	Data
5e6e3a92 BZ	1	/*
	2	* Marvell Wireless LAN device driver: WMM
	3	*
65da33f5	4	* Copyright (C) 2011-2014, Marvell International Ltd.
5e6e3a92 BZ	5	*
	6	* This software file (the "File") is distributed by Marvell International
	7	* Ltd. under the terms of the GNU General Public License Version 2, June 1991
	8	* (the "License"). You may use, redistribute and/or modify this File in
	9	* accordance with the terms and conditions of the License, a copy of which
	10	* is available by writing to the Free Software Foundation, Inc.,
	11	* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA or on the
	12	* worldwide web at http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt.
	13	*
	14	* THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE
	15	* IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE
	16	* ARE EXPRESSLY DISCLAIMED. The License provides additional details about
	17	* this warranty disclaimer.
	18	*/
	19
	20	#ifndef _MWIFIEX_WMM_H_
	21	#define _MWIFIEX_WMM_H_
	22
	23	enum ieee_types_wmm_aciaifsn_bitmasks {
	24	MWIFIEX_AIFSN = (BIT(0) \| BIT(1) \| BIT(2) \| BIT(3)),
	25	MWIFIEX_ACM = BIT(4),
	26	MWIFIEX_ACI = (BIT(5) \| BIT(6)),
	27	};
	28
	29	enum ieee_types_wmm_ecw_bitmasks {
	30	MWIFIEX_ECW_MIN = (BIT(0) \| BIT(1) \| BIT(2) \| BIT(3)),
	31	MWIFIEX_ECW_MAX = (BIT(4) \| BIT(5) \| BIT(6) \| BIT(7)),
	32	};
	33
47411a06 AP	34	static const u16 mwifiex_1d_to_wmm_queue[8] = { 1, 0, 0, 1, 2, 2, 3, 3 };
47411a06 AP	35
41a24a29 AP	36	/*
	37	* This table inverses the tos_to_tid operation to get a priority
	38	* which is in sequential order, and can be compared.
	39	* Use this to compare the priority of two different TIDs.
	40	*/
	41	static const u8 tos_to_tid_inv[] = {
	42	0x02, /* from tos_to_tid[2] = 0 */
	43	0x00, /* from tos_to_tid[0] = 1 */
	44	0x01, /* from tos_to_tid[1] = 2 */
	45	0x03,
	46	0x04,
	47	0x05,
	48	0x06,
	49	0x07};
	50
5e6e3a92 BZ	51	/*
	52	* This function retrieves the TID of the given RA list.
	53	*/
	54	static inline int
572e8f3e	55	mwifiex_get_tid(struct mwifiex_ra_list_tbl *ptr)
5e6e3a92 BZ	56	{
	57	struct sk_buff *skb;
	58
	59	if (skb_queue_empty(&ptr->skb_head))
	60	return 0;
	61
	62	skb = skb_peek(&ptr->skb_head);
	63
	64	return skb->priority;
	65	}
	66
	67	/*
	68	* This function gets the length of a list.
	69	*/
	70	static inline int
572e8f3e	71	mwifiex_wmm_list_len(struct list_head *head)
5e6e3a92 BZ	72	{
	73	struct list_head *pos;
	74	int count = 0;
	75
	76	list_for_each(pos, head)
	77	++count;
	78
	79	return count;
	80	}
	81
	82	/*
	83	* This function checks if a RA list is empty or not.
	84	*/
	85	static inline u8
572e8f3e	86	mwifiex_wmm_is_ra_list_empty(struct list_head *ra_list_hhead)
5e6e3a92 BZ	87	{
	88	struct mwifiex_ra_list_tbl *ra_list;
	89	int is_list_empty;
	90
	91	list_for_each_entry(ra_list, ra_list_hhead, list) {
	92	is_list_empty = skb_queue_empty(&ra_list->skb_head);
	93	if (!is_list_empty)
	94	return false;
	95	}
	96
	97	return true;
	98	}
	99
2690e1bb	100	void mwifiex_wmm_add_buf_txqueue(struct mwifiex_private *priv,
b3a7cd19	101	struct sk_buff *skb);
a1777327 AP	102	void mwifiex_wmm_add_buf_bypass_txqueue(struct mwifiex_private *priv,
a1777327 AP	103	struct sk_buff *skb);
3b3a0162	104	void mwifiex_ralist_add(struct mwifiex_private priv, const u8 ra);
2e237319	105	void mwifiex_rotate_priolists(struct mwifiex_private *priv,
b3a7cd19	106	struct mwifiex_ra_list_tbl *ra, int tid);
5e6e3a92 BZ	107
5e6e3a92 BZ	108	int mwifiex_wmm_lists_empty(struct mwifiex_adapter *adapter);
a1777327	109	int mwifiex_bypass_txlist_empty(struct mwifiex_adapter *adapter);
5e6e3a92	110	void mwifiex_wmm_process_tx(struct mwifiex_adapter *adapter);
a1777327	111	void mwifiex_process_bypass_tx(struct mwifiex_adapter *adapter);
5e6e3a92 BZ	112	int mwifiex_is_ralist_valid(struct mwifiex_private *priv,
	113	struct mwifiex_ra_list_tbl *ra_list, int tid);
	114
	115	u8 mwifiex_wmm_compute_drv_pkt_delay(struct mwifiex_private *priv,
b3a7cd19	116	const struct sk_buff *skb);
5e6e3a92 BZ	117	void mwifiex_wmm_init(struct mwifiex_adapter *adapter);
5e6e3a92 BZ	118
b3a7cd19 JP	119	u32 mwifiex_wmm_process_association_req(struct mwifiex_private *priv,
	120	u8 **assoc_buf,
	121	struct ieee_types_wmm_parameter *wmmie,
	122	struct ieee80211_ht_cap *htcap);
5e6e3a92 BZ	123
5e6e3a92 BZ	124	void mwifiex_wmm_setup_queue_priorities(struct mwifiex_private *priv,
b3a7cd19	125	struct ieee_types_wmm_parameter *wmm_ie);
5e6e3a92	126	void mwifiex_wmm_setup_ac_downgrade(struct mwifiex_private *priv);
b3a7cd19 JP	127	int mwifiex_ret_wmm_get_status(struct mwifiex_private *priv,
b3a7cd19 JP	128	const struct host_cmd_ds_command *resp);
5f2caaf3	129	struct mwifiex_ra_list_tbl *
3b3a0162 JB	130	mwifiex_wmm_get_queue_raptr(struct mwifiex_private *priv, u8 tid,
3b3a0162 JB	131	const u8 *ra_addr);
5f2caaf3	132	u8 mwifiex_wmm_downgrade_tid(struct mwifiex_private *priv, u32 tid);
4e6ee91b AP	133	void mwifiex_update_ralist_tx_pause(struct mwifiex_private priv, u8 mac,
4e6ee91b AP	134	u8 tx_pause);
f7669877 XH	135	void mwifiex_update_ralist_tx_pause_in_tdls_cs(struct mwifiex_private *priv,
f7669877 XH	136	u8 *mac, u8 tx_pause);
5e6e3a92	137
39df5e82 ZL	138	struct mwifiex_ra_list_tbl *mwifiex_wmm_get_ralist_node(struct mwifiex_private
39df5e82 ZL	139	priv, u8 tid, const u8 ra_addr);
5e6e3a92	140	#endif /* !_MWIFIEX_WMM_H_ */