athrate-amrr.c revision 1.6 1 /* $NetBSD: athrate-amrr.c,v 1.6 2006/02/05 06:03:26 xtraeme Exp $ */
2
3 /*-
4 * Copyright (c) 2004 INRIA
5 * Copyright (c) 2002-2005 Sam Leffler, Errno Consulting
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer,
13 * without modification.
14 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
15 * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
16 * redistribution must be conditioned upon including a substantially
17 * similar Disclaimer requirement for further binary redistribution.
18 * 3. Neither the names of the above-listed copyright holders nor the names
19 * of any contributors may be used to endorse or promote products derived
20 * from this software without specific prior written permission.
21 *
22 * Alternatively, this software may be distributed under the terms of the
23 * GNU General Public License ("GPL") version 2 as published by the Free
24 * Software Foundation.
25 *
26 * NO WARRANTY
27 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
29 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
30 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
31 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
32 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
35 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
37 * THE POSSIBILITY OF SUCH DAMAGES.
38 *
39 */
40
41 #include <sys/cdefs.h>
42 #ifdef __FreeBSD__
43 __FBSDID("$FreeBSD: src/sys/dev/ath/ath_rate/amrr/amrr.c,v 1.10 2005/08/09 10:19:43 rwatson Exp $");
44 #endif
45 #ifdef __NetBSD__
46 __KERNEL_RCSID(0, "$NetBSD: athrate-amrr.c,v 1.6 2006/02/05 06:03:26 xtraeme Exp $");
47 #endif
48
49 /*
50 * AMRR rate control. See:
51 * http://www-sop.inria.fr/rapports/sophia/RR-5208.html
52 * "IEEE 802.11 Rate Adaptation: A Practical Approach" by
53 * Mathieu Lacage, Hossein Manshaei, Thierry Turletti
54 */
55 #include "opt_inet.h"
56
57 #include <sys/param.h>
58 #include <sys/systm.h>
59 #include <sys/sysctl.h>
60 #include <sys/kernel.h>
61 #include <sys/lock.h>
62 #include <sys/errno.h>
63
64 #include <machine/bus.h>
65
66 #include <sys/socket.h>
67
68 #include <net/if.h>
69 #include <net/if_media.h>
70 #include <net/if_arp.h>
71 #include <net/if_ether.h> /* XXX for ether_sprintf */
72
73 #include <net80211/ieee80211_var.h>
74
75 #include <net/bpf.h>
76
77 #ifdef INET
78 #include <netinet/in.h>
79 #endif
80
81 #include <dev/ic/athvar.h>
82 #include <dev/ic/athrate-amrr.h>
83 #include <contrib/dev/ic/athhal_desc.h>
84
85 #define AMRR_DEBUG
86 #ifdef AMRR_DEBUG
87 #define DPRINTF(sc, _fmt, ...) do { \
88 if (sc->sc_debug & 0x10) \
89 printf(_fmt, __VA_ARGS__); \
90 } while (0)
91 #else
92 #define DPRINTF(sc, _fmt, ...)
93 #endif
94
95 static int ath_rateinterval = 1000; /* rate ctl interval (ms) */
96 static int ath_rate_max_success_threshold = 10;
97 static int ath_rate_min_success_threshold = 1;
98
99 static void ath_ratectl(void *);
100 static void ath_rate_update(struct ath_softc *, struct ieee80211_node *,
101 int rate);
102 static void ath_rate_ctl_start(struct ath_softc *, struct ieee80211_node *);
103 static void ath_rate_ctl(void *, struct ieee80211_node *);
104
105 void
106 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an)
107 {
108 /* NB: assumed to be zero'd by caller */
109 ath_rate_update(sc, &an->an_node, 0);
110 }
111
112 void
113 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an)
114 {
115 }
116
117 void
118 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an,
119 int shortPreamble, size_t frameLen,
120 u_int8_t *rix, int *try0, u_int8_t *txrate)
121 {
122 struct amrr_node *amn = ATH_NODE_AMRR(an);
123
124 *rix = amn->amn_tx_rix0;
125 *try0 = amn->amn_tx_try0;
126 if (shortPreamble)
127 *txrate = amn->amn_tx_rate0sp;
128 else
129 *txrate = amn->amn_tx_rate0;
130 }
131
132 void
133 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an,
134 struct ath_desc *ds, int shortPreamble, u_int8_t rix)
135 {
136 struct amrr_node *amn = ATH_NODE_AMRR(an);
137
138 ath_hal_setupxtxdesc(sc->sc_ah, ds
139 , amn->amn_tx_rate1sp, amn->amn_tx_try1 /* series 1 */
140 , amn->amn_tx_rate2sp, amn->amn_tx_try2 /* series 2 */
141 , amn->amn_tx_rate3sp, amn->amn_tx_try3 /* series 3 */
142 );
143 }
144
145 void
146 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an,
147 const struct ath_desc *ds, const struct ath_desc *ds0)
148 {
149 struct amrr_node *amn = ATH_NODE_AMRR(an);
150 int sr = ds->ds_txstat.ts_shortretry;
151 int lr = ds->ds_txstat.ts_longretry;
152 int retry_count = sr + lr;
153
154 amn->amn_tx_try0_cnt++;
155 if (retry_count == 1) {
156 amn->amn_tx_try1_cnt++;
157 } else if (retry_count == 2) {
158 amn->amn_tx_try1_cnt++;
159 amn->amn_tx_try2_cnt++;
160 } else if (retry_count == 3) {
161 amn->amn_tx_try1_cnt++;
162 amn->amn_tx_try2_cnt++;
163 amn->amn_tx_try3_cnt++;
164 } else if (retry_count > 3) {
165 amn->amn_tx_try1_cnt++;
166 amn->amn_tx_try2_cnt++;
167 amn->amn_tx_try3_cnt++;
168 amn->amn_tx_failure_cnt++;
169 }
170 }
171
172 void
173 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew)
174 {
175 if (isnew)
176 ath_rate_ctl_start(sc, &an->an_node);
177 }
178
179 static void
180 node_reset (struct amrr_node *amn)
181 {
182 amn->amn_tx_try0_cnt = 0;
183 amn->amn_tx_try1_cnt = 0;
184 amn->amn_tx_try2_cnt = 0;
185 amn->amn_tx_try3_cnt = 0;
186 amn->amn_tx_failure_cnt = 0;
187 amn->amn_success = 0;
188 amn->amn_recovery = 0;
189 amn->amn_success_threshold = ath_rate_min_success_threshold;
190 }
191
192
193 /**
194 * The code below assumes that we are dealing with hardware multi rate retry
195 * I have no idea what will happen if you try to use this module with another
196 * type of hardware. Your machine might catch fire or it might work with
197 * horrible performance...
198 */
199 static void
200 ath_rate_update(struct ath_softc *sc, struct ieee80211_node *ni, int rate)
201 {
202 struct ath_node *an = ATH_NODE(ni);
203 struct amrr_node *amn = ATH_NODE_AMRR(an);
204 const HAL_RATE_TABLE *rt = sc->sc_currates;
205 u_int8_t rix;
206
207 KASSERT(rt != NULL, ("no rate table, mode %u", sc->sc_curmode));
208
209 DPRINTF(sc, "%s: set xmit rate for %s to %dM\n",
210 __func__, ether_sprintf(ni->ni_macaddr),
211 ni->ni_rates.rs_nrates > 0 ?
212 (ni->ni_rates.rs_rates[rate] & IEEE80211_RATE_VAL) / 2 : 0);
213
214 ni->ni_txrate = rate;
215 /* XXX management/control frames always go at the lowest speed */
216 an->an_tx_mgtrate = rt->info[0].rateCode;
217 an->an_tx_mgtratesp = an->an_tx_mgtrate | rt->info[0].shortPreamble;
218 /*
219 * Before associating a node has no rate set setup
220 * so we can't calculate any transmit codes to use.
221 * This is ok since we should never be sending anything
222 * but management frames and those always go at the
223 * lowest hardware rate.
224 */
225 if (ni->ni_rates.rs_nrates > 0) {
226 amn->amn_tx_rix0 = sc->sc_rixmap[
227 ni->ni_rates.rs_rates[rate] & IEEE80211_RATE_VAL];
228 amn->amn_tx_rate0 = rt->info[amn->amn_tx_rix0].rateCode;
229 amn->amn_tx_rate0sp = amn->amn_tx_rate0 |
230 rt->info[amn->amn_tx_rix0].shortPreamble;
231 if (sc->sc_mrretry) {
232 amn->amn_tx_try0 = 1;
233 amn->amn_tx_try1 = 1;
234 amn->amn_tx_try2 = 1;
235 amn->amn_tx_try3 = 1;
236 if (--rate >= 0) {
237 rix = sc->sc_rixmap[
238 ni->ni_rates.rs_rates[rate]&IEEE80211_RATE_VAL];
239 amn->amn_tx_rate1 = rt->info[rix].rateCode;
240 amn->amn_tx_rate1sp = amn->amn_tx_rate1 |
241 rt->info[rix].shortPreamble;
242 } else {
243 amn->amn_tx_rate1 = amn->amn_tx_rate1sp = 0;
244 }
245 if (--rate >= 0) {
246 rix = sc->sc_rixmap[
247 ni->ni_rates.rs_rates[rate]&IEEE80211_RATE_VAL];
248 amn->amn_tx_rate2 = rt->info[rix].rateCode;
249 amn->amn_tx_rate2sp = amn->amn_tx_rate2 |
250 rt->info[rix].shortPreamble;
251 } else {
252 amn->amn_tx_rate2 = amn->amn_tx_rate2sp = 0;
253 }
254 if (rate > 0) {
255 /* NB: only do this if we didn't already do it above */
256 amn->amn_tx_rate3 = rt->info[0].rateCode;
257 amn->amn_tx_rate3sp =
258 an->an_tx_mgtrate | rt->info[0].shortPreamble;
259 } else {
260 amn->amn_tx_rate3 = amn->amn_tx_rate3sp = 0;
261 }
262 } else {
263 amn->amn_tx_try0 = ATH_TXMAXTRY;
264 /* theorically, these statements are useless because
265 * the code which uses them tests for an_tx_try0 == ATH_TXMAXTRY
266 */
267 amn->amn_tx_try1 = 0;
268 amn->amn_tx_try2 = 0;
269 amn->amn_tx_try3 = 0;
270 amn->amn_tx_rate1 = amn->amn_tx_rate1sp = 0;
271 amn->amn_tx_rate2 = amn->amn_tx_rate2sp = 0;
272 amn->amn_tx_rate3 = amn->amn_tx_rate3sp = 0;
273 }
274 }
275 node_reset (amn);
276 }
277
278 /*
279 * Set the starting transmit rate for a node.
280 */
281 static void
282 ath_rate_ctl_start(struct ath_softc *sc, struct ieee80211_node *ni)
283 {
284 #define RATE(_ix) (ni->ni_rates.rs_rates[(_ix)] & IEEE80211_RATE_VAL)
285 struct ieee80211com *ic = &sc->sc_ic;
286 int srate;
287
288 KASSERT(ni->ni_rates.rs_nrates > 0, ("no rates"));
289 if (ic->ic_fixed_rate == IEEE80211_FIXED_RATE_NONE) {
290 /*
291 * No fixed rate is requested. For 11b start with
292 * the highest negotiated rate; otherwise, for 11g
293 * and 11a, we start "in the middle" at 24Mb or 36Mb.
294 */
295 srate = ni->ni_rates.rs_nrates - 1;
296 if (sc->sc_curmode != IEEE80211_MODE_11B) {
297 /*
298 * Scan the negotiated rate set to find the
299 * closest rate.
300 */
301 /* NB: the rate set is assumed sorted */
302 for (; srate >= 0 && RATE(srate) > 72; srate--)
303 ;
304 KASSERT(srate >= 0, ("bogus rate set"));
305 }
306 } else {
307 /*
308 * A fixed rate is to be used; ic_fixed_rate is an
309 * index into the supported rate set. Convert this
310 * to the index into the negotiated rate set for
311 * the node. We know the rate is there because the
312 * rate set is checked when the station associates.
313 */
314 const struct ieee80211_rateset *rs =
315 &ic->ic_sup_rates[ic->ic_curmode];
316 int r = rs->rs_rates[ic->ic_fixed_rate] & IEEE80211_RATE_VAL;
317 /* NB: the rate set is assumed sorted */
318 srate = ni->ni_rates.rs_nrates - 1;
319 for (; srate >= 0 && RATE(srate) != r; srate--)
320 ;
321 KASSERT(srate >= 0,
322 ("fixed rate %d not in rate set", ic->ic_fixed_rate));
323 }
324 ath_rate_update(sc, ni, srate);
325 #undef RATE
326 }
327
328 static void
329 ath_rate_cb(void *arg, struct ieee80211_node *ni)
330 {
331 struct ath_softc *sc = arg;
332
333 ath_rate_update(sc, ni, 0);
334 }
335
336 /*
337 * Reset the rate control state for each 802.11 state transition.
338 */
339 void
340 ath_rate_newstate(struct ath_softc *sc, enum ieee80211_state state)
341 {
342 struct amrr_softc *asc = (struct amrr_softc *) sc->sc_rc;
343 struct ieee80211com *ic = &sc->sc_ic;
344 struct ieee80211_node *ni;
345
346 if (state == IEEE80211_S_INIT) {
347 callout_stop(&asc->timer);
348 return;
349 }
350 if (ic->ic_opmode == IEEE80211_M_STA) {
351 /*
352 * Reset local xmit state; this is really only
353 * meaningful when operating in station mode.
354 */
355 ni = ic->ic_bss;
356 if (state == IEEE80211_S_RUN) {
357 ath_rate_ctl_start(sc, ni);
358 } else {
359 ath_rate_update(sc, ni, 0);
360 }
361 } else {
362 /*
363 * When operating as a station the node table holds
364 * the AP's that were discovered during scanning.
365 * For any other operating mode we want to reset the
366 * tx rate state of each node.
367 */
368 ieee80211_iterate_nodes(&ic->ic_sta, ath_rate_cb, sc);
369 ath_rate_update(sc, ic->ic_bss, 0);
370 }
371 if (ic->ic_fixed_rate == IEEE80211_FIXED_RATE_NONE &&
372 state == IEEE80211_S_RUN) {
373 int interval;
374 /*
375 * Start the background rate control thread if we
376 * are not configured to use a fixed xmit rate.
377 */
378 interval = ath_rateinterval;
379 if (ic->ic_opmode == IEEE80211_M_STA)
380 interval /= 2;
381 callout_reset(&asc->timer, (interval * hz) / 1000,
382 ath_ratectl, &sc->sc_if);
383 }
384 }
385
386 /*
387 * Examine and potentially adjust the transmit rate.
388 */
389 static void
390 ath_rate_ctl(void *arg, struct ieee80211_node *ni)
391 {
392 struct ath_softc *sc = arg;
393 struct amrr_node *amn = ATH_NODE_AMRR(ATH_NODE (ni));
394 int old_rate;
395
396 #define is_success(amn) \
397 (amn->amn_tx_try1_cnt < (amn->amn_tx_try0_cnt/10))
398 #define is_enough(amn) \
399 (amn->amn_tx_try0_cnt > 10)
400 #define is_failure(amn) \
401 (amn->amn_tx_try1_cnt > (amn->amn_tx_try0_cnt/3))
402 #define is_max_rate(ni) \
403 ((ni->ni_txrate + 1) >= ni->ni_rates.rs_nrates)
404 #define is_min_rate(ni) \
405 (ni->ni_txrate == 0)
406
407 old_rate = ni->ni_txrate;
408
409 DPRINTF (sc, "cnt0: %d cnt1: %d cnt2: %d cnt3: %d -- threshold: %d\n",
410 amn->amn_tx_try0_cnt,
411 amn->amn_tx_try1_cnt,
412 amn->amn_tx_try2_cnt,
413 amn->amn_tx_try3_cnt,
414 amn->amn_success_threshold);
415 if (is_success (amn) && is_enough (amn)) {
416 amn->amn_success++;
417 if (amn->amn_success == amn->amn_success_threshold &&
418 !is_max_rate (ni)) {
419 amn->amn_recovery = 1;
420 amn->amn_success = 0;
421 ni->ni_txrate++;
422 DPRINTF (sc, "increase rate to %d\n", ni->ni_txrate);
423 } else {
424 amn->amn_recovery = 0;
425 }
426 } else if (is_failure (amn)) {
427 amn->amn_success = 0;
428 if (!is_min_rate (ni)) {
429 if (amn->amn_recovery) {
430 /* recovery failure. */
431 amn->amn_success_threshold *= 2;
432 amn->amn_success_threshold = min (amn->amn_success_threshold,
433 (u_int)ath_rate_max_success_threshold);
434 DPRINTF (sc, "decrease rate recovery thr: %d\n", amn->amn_success_threshold);
435 } else {
436 /* simple failure. */
437 amn->amn_success_threshold = ath_rate_min_success_threshold;
438 DPRINTF (sc, "decrease rate normal thr: %d\n", amn->amn_success_threshold);
439 }
440 amn->amn_recovery = 0;
441 ni->ni_txrate--;
442 } else {
443 amn->amn_recovery = 0;
444 }
445
446 }
447 if (is_enough (amn) || old_rate != ni->ni_txrate) {
448 /* reset counters. */
449 amn->amn_tx_try0_cnt = 0;
450 amn->amn_tx_try1_cnt = 0;
451 amn->amn_tx_try2_cnt = 0;
452 amn->amn_tx_try3_cnt = 0;
453 amn->amn_tx_failure_cnt = 0;
454 }
455 if (old_rate != ni->ni_txrate) {
456 ath_rate_update(sc, ni, ni->ni_txrate);
457 }
458 }
459
460 static void
461 ath_ratectl(void *arg)
462 {
463 struct ifnet *ifp = arg;
464 struct ath_softc *sc = ifp->if_softc;
465 struct amrr_softc *asc = (struct amrr_softc *) sc->sc_rc;
466 struct ieee80211com *ic = &sc->sc_ic;
467 int interval;
468
469 if (ifp->if_drv_flags & IFF_DRV_RUNNING) {
470 sc->sc_stats.ast_rate_calls++;
471
472 if (ic->ic_opmode == IEEE80211_M_STA)
473 ath_rate_ctl(sc, ic->ic_bss); /* NB: no reference */
474 else
475 ieee80211_iterate_nodes(&ic->ic_sta, ath_rate_ctl, sc);
476 }
477 interval = ath_rateinterval;
478 if (ic->ic_opmode == IEEE80211_M_STA)
479 interval /= 2;
480 callout_reset(&asc->timer, (interval * hz) / 1000,
481 ath_ratectl, &sc->sc_if);
482 }
483
484 static void
485 ath_rate_sysctlattach(struct ath_softc *sc)
486 {
487 struct sysctl_ctx_list *ctx = device_get_sysctl_ctx(sc->sc_dev);
488 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev);
489
490 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
491 "rate_interval", CTLFLAG_RW, &ath_rateinterval, 0,
492 "rate control: operation interval (ms)");
493 /* XXX bounds check values */
494 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
495 "max_sucess_threshold", CTLFLAG_RW,
496 &ath_rate_max_success_threshold, 0, "");
497 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
498 "min_sucess_threshold", CTLFLAG_RW,
499 &ath_rate_min_success_threshold, 0, "");
500 }
501
502 struct ath_ratectrl *
503 ath_rate_attach(struct ath_softc *sc)
504 {
505 struct amrr_softc *asc;
506
507 asc = malloc(sizeof(struct amrr_softc), M_DEVBUF, M_NOWAIT|M_ZERO);
508 if (asc == NULL)
509 return NULL;
510 asc->arc.arc_space = sizeof(struct amrr_node);
511 callout_init(&asc->timer, debug_mpsafenet ? CALLOUT_MPSAFE : 0);
512 ath_rate_sysctlattach(sc);
513
514 return &asc->arc;
515 }
516
517 void
518 ath_rate_detach(struct ath_ratectrl *arc)
519 {
520 struct amrr_softc *asc = (struct amrr_softc *) arc;
521
522 callout_drain(&asc->timer);
523 free(asc, M_DEVBUF);
524 }
525