⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 amrr.c.svn-base

📁 最新之atheros芯片driver source code, 基于linux操作系统,內含atheros芯片HAL全部代码
💻 SVN-BASE
📖 第 1 页 / 共 2 页
字号:
/*- * Copyright (c) 2004 INRIA * Copyright (c) 2002-2005 Sam Leffler, Errno Consulting * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer, *    without modification. * 2. Redistributions in binary form must reproduce at minimum a disclaimer *    similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any *    redistribution must be conditioned upon including a substantially *    similar Disclaimer requirement for further binary redistribution. * 3. Neither the names of the above-listed copyright holders nor the names *    of any contributors may be used to endorse or promote products derived *    from this software without specific prior written permission. * * Alternatively, this software may be distributed under the terms of the * GNU General Public License ("GPL") version 2 as published by the Free * Software Foundation. * * NO WARRANTY * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF * THE POSSIBILITY OF SUCH DAMAGES. * * $Id$ *//* * AMRR rate control. See: * http://www-sop.inria.fr/rapports/sophia/RR-5208.html * "IEEE 802.11 Rate Adaptation: A Practical Approach" by *    Mathieu Lacage, Hossein Manshaei, Thierry Turletti */#ifndef AUTOCONF_INCLUDED#include <linux/config.h>#endif#include <linux/version.h>#include <linux/module.h>#include <linux/init.h>#include <linux/skbuff.h>#include <linux/netdevice.h>#include <linux/random.h>#include <linux/delay.h>#include <linux/cache.h>#include <linux/sysctl.h>#include <linux/proc_fs.h>#include <linux/if_arp.h>#include <asm/uaccess.h>#include <net80211/if_media.h>#include <net80211/ieee80211_var.h>#include <net80211/ieee80211_rate.h>#include "if_athvar.h"#include "if_ath_hal.h"#include "ah_desc.h"#include "amrr.h"#define	AMRR_DEBUG#ifdef AMRR_DEBUG#define	DPRINTF(sc, _fmt, ...) do {					\	if (sc->sc_debug & 0x10)					\		printk(_fmt, __VA_ARGS__);				\} while (0)#else#define	DPRINTF(sc, _fmt, ...)#endifstatic int ath_rateinterval = 1000;		/* rate ctl interval (ms)  */static int ath_rate_max_success_threshold = 10;static int ath_rate_min_success_threshold = 1;static void ath_ratectl(unsigned long);static void ath_rate_update(struct ath_softc *, struct ieee80211_node *, int);static void ath_rate_ctl_start(struct ath_softc *, struct ieee80211_node *);static void ath_rate_ctl(void *, struct ieee80211_node *);static voidath_rate_node_init(struct ath_softc *sc, struct ath_node *an){	/* NB: assumed to be zero'd by caller */	ath_rate_update(sc, &an->an_node, 0);}static voidath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an){}static voidath_rate_findrate(struct ath_softc *sc, struct ath_node *an,	int shortPreamble, size_t frameLen,	u_int8_t *rix, unsigned int *try0, u_int8_t *txrate){	struct amrr_node *amn = ATH_NODE_AMRR(an);	*rix = amn->amn_tx_rix0;	*try0 = amn->amn_tx_try0;	if (shortPreamble)		*txrate = amn->amn_tx_rate0sp;	else		*txrate = amn->amn_tx_rate0;}static voidath_rate_get_mrr(struct ath_softc *sc, struct ath_node *an, int shortPreamble,		 size_t frame_size, u_int8_t rix, struct ieee80211_mrr *mrr){	struct amrr_node *amn = ATH_NODE_AMRR(an);	mrr->rate1 = amn->amn_tx_rate1sp;	mrr->retries1 = amn->amn_tx_try1;	mrr->rate2 = amn->amn_tx_rate2sp;	mrr->retries2 = amn->amn_tx_try2;	mrr->rate3 = amn->amn_tx_rate3sp;	mrr->retries3 = amn->amn_tx_try3;}static voidath_rate_tx_complete(struct ath_softc *sc,	struct ath_node *an, const struct ath_buf *bf){	struct amrr_node *amn = ATH_NODE_AMRR(an);	const struct ath_tx_status *ts = &bf->bf_dsstatus.ds_txstat;	int sr = ts->ts_shortretry;	int lr = ts->ts_longretry;	int retry_count = sr + lr;	amn->amn_tx_try0_cnt++;	if (retry_count == 1) {		amn->amn_tx_try1_cnt++;	} else if (retry_count == 2) {		amn->amn_tx_try1_cnt++;		amn->amn_tx_try2_cnt++;	} else if (retry_count == 3) {		amn->amn_tx_try1_cnt++;		amn->amn_tx_try2_cnt++;		amn->amn_tx_try3_cnt++;	} else if (retry_count > 3) {		amn->amn_tx_try1_cnt++;		amn->amn_tx_try2_cnt++;		amn->amn_tx_try3_cnt++;		amn->amn_tx_failure_cnt++;	}}static voidath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew){	if (isnew)		ath_rate_ctl_start(sc, &an->an_node);}static voidnode_reset (struct amrr_node *amn){	amn->amn_tx_try0_cnt = 0;	amn->amn_tx_try1_cnt = 0;	amn->amn_tx_try2_cnt = 0;	amn->amn_tx_try3_cnt = 0;	amn->amn_tx_failure_cnt = 0;  	amn->amn_success = 0;  	amn->amn_recovery = 0;  	amn->amn_success_threshold = ath_rate_min_success_threshold;}/** * The code below assumes that we are dealing with hardware multi rate retry * I have no idea what will happen if you try to use this module with another * type of hardware. Your machine might catch fire or it might work with * horrible performance... */static voidath_rate_update(struct ath_softc *sc, struct ieee80211_node *ni, int rate){	struct ath_node *an = ATH_NODE(ni);	struct amrr_node *amn = ATH_NODE_AMRR(an);	const HAL_RATE_TABLE *rt = sc->sc_currates;	u_int8_t rix;	KASSERT(rt != NULL, ("no rate table, mode %u", sc->sc_curmode));	DPRINTF(sc, "%s: set xmit rate for " MAC_FMT " to %dM\n",		__func__, MAC_ADDR(ni->ni_macaddr),		ni->ni_rates.rs_nrates > 0 ?			(ni->ni_rates.rs_rates[rate] & IEEE80211_RATE_VAL) / 2 : 0);	ni->ni_txrate = rate;	/*	 * Before associating a node has no rate set setup	 * so we can't calculate any transmit codes to use.	 * This is ok since we should never be sending anything	 * but management frames and those always go at the	 * lowest hardware rate.	 */	if (ni->ni_rates.rs_nrates > 0) {		amn->amn_tx_rix0 =			sc->sc_rixmap[ni->ni_rates.rs_rates[rate] & IEEE80211_RATE_VAL];		amn->amn_tx_rate0 = rt->info[amn->amn_tx_rix0].rateCode;		amn->amn_tx_rate0sp = amn->amn_tx_rate0 |			rt->info[amn->amn_tx_rix0].shortPreamble;		if (sc->sc_mrretry) {			amn->amn_tx_try0 = 1;			amn->amn_tx_try1 = 1;			amn->amn_tx_try2 = 1;			amn->amn_tx_try3 = 1;			if (--rate >= 0) {				rix = sc->sc_rixmap[ni->ni_rates.rs_rates[rate]&IEEE80211_RATE_VAL];				amn->amn_tx_rate1 = rt->info[rix].rateCode;				amn->amn_tx_rate1sp = amn->amn_tx_rate1 |					rt->info[rix].shortPreamble;			} else {				amn->amn_tx_rate1 = amn->amn_tx_rate1sp = 0;			}			if (--rate >= 0) {				rix = sc->sc_rixmap[ni->ni_rates.rs_rates[rate]&IEEE80211_RATE_VAL];				amn->amn_tx_rate2 = rt->info[rix].rateCode;				amn->amn_tx_rate2sp = amn->amn_tx_rate2 |					rt->info[rix].shortPreamble;			} else {				amn->amn_tx_rate2 = amn->amn_tx_rate2sp = 0;			}			if (rate > 0) {				/* NB: only do this if we didn't already do it above */				amn->amn_tx_rate3 = rt->info[0].rateCode;				amn->amn_tx_rate3sp = amn->amn_tx_rate3 |					rt->info[0].shortPreamble;			} else {				amn->amn_tx_rate3 = amn->amn_tx_rate3sp = 0;			}		} else {			amn->amn_tx_try0 = ATH_TXMAXTRY;			/* theorically, these statements are useless because			 *  the code which uses them tests for an_tx_try0 == ATH_TXMAXTRY			 */			amn->amn_tx_try1 = 0;			amn->amn_tx_try2 = 0;			amn->amn_tx_try3 = 0;			amn->amn_tx_rate1 = amn->amn_tx_rate1sp = 0;			amn->amn_tx_rate2 = amn->amn_tx_rate2sp = 0;			amn->amn_tx_rate3 = amn->amn_tx_rate3sp = 0;		}	}	node_reset(amn);}/* * Set the starting transmit rate for a node. */static voidath_rate_ctl_start(struct ath_softc *sc, struct ieee80211_node *ni){#define	RATE(_ix)	(ni->ni_rates.rs_rates[(_ix)] & IEEE80211_RATE_VAL)	struct ieee80211vap *vap = ni->ni_vap;	int srate;	KASSERT(ni->ni_rates.rs_nrates > 0, ("no rates"));	if (vap->iv_fixed_rate == IEEE80211_FIXED_RATE_NONE) {		/*		 * No fixed rate is requested. For 11b start with		 * the highest negotiated rate; otherwise, for 11g		 * and 11a, we start "in the middle" at 24Mb or 36Mb.		 */		srate = ni->ni_rates.rs_nrates - 1;		if (sc->sc_curmode != IEEE80211_MODE_11B) {			/*			 * Scan the negotiated rate set to find the			 * closest rate.			 */			/* NB: the rate set is assumed sorted */			for (; srate >= 0 && RATE(srate) > 72; srate--);			KASSERT(srate >= 0, ("bogus rate set"));		}	} else {		/*		 * A fixed rate is to be used; ic_fixed_rate is an		 * index into the supported rate set.  Convert this		 * to the index into the negotiated rate set for		 * the node.  We know the rate is there because the		 * rate set is checked when the station associates.		 */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -