1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2002-2007 Sam Leffler, Errno Consulting 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer, 12 * without modification. 13 * 2. Redistributions in binary form must reproduce at minimum a disclaimer 14 * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any 15 * redistribution must be conditioned upon including a substantially 16 * similar Disclaimer requirement for further binary redistribution. 17 * 18 * NO WARRANTY 19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 21 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY 22 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL 23 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, 24 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER 27 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 29 * THE POSSIBILITY OF SUCH DAMAGES. 30 */ 31 32 #include <sys/cdefs.h> 33 /* 34 * Atsushi Onoe's rate control algorithm. 35 */ 36 #include "opt_ath.h" 37 #include "opt_inet.h" 38 #include "opt_wlan.h" 39 40 #include <sys/param.h> 41 #include <sys/systm.h> 42 #include <sys/sysctl.h> 43 #include <sys/kernel.h> 44 #include <sys/lock.h> 45 #include <sys/mutex.h> 46 #include <sys/errno.h> 47 48 #include <machine/bus.h> 49 #include <machine/resource.h> 50 #include <sys/bus.h> 51 52 #include <sys/socket.h> 53 54 #include <net/if.h> 55 #include <net/if_media.h> 56 #include <net/if_arp.h> 57 #include <net/ethernet.h> /* XXX for ether_sprintf */ 58 59 #include <net80211/ieee80211_var.h> 60 61 #include <net/bpf.h> 62 63 #ifdef INET 64 #include <netinet/in.h> 65 #include <netinet/if_ether.h> 66 #endif 67 68 #include <dev/ath/if_athvar.h> 69 #include <dev/ath/ath_rate/onoe/onoe.h> 70 #include <dev/ath/ath_hal/ah_desc.h> 71 72 /* 73 * Default parameters for the rate control algorithm. These are 74 * all tunable with sysctls. The rate controller runs periodically 75 * (each ath_rateinterval ms) analyzing transmit statistics for each 76 * neighbor/station (when operating in station mode this is only the AP). 77 * If transmits look to be working well over a sampling period then 78 * it gives a "raise rate credit". If transmits look to not be working 79 * well than it deducts a credit. If the credits cross a threshold then 80 * the transmit rate is raised. Various error conditions force the 81 * the transmit rate to be dropped. 82 * 83 * The decision to issue/deduct a credit is based on the errors and 84 * retries accumulated over the sampling period. ath_rate_raise defines 85 * the percent of retransmits for which a credit is issued/deducted. 86 * ath_rate_raise_threshold defines the threshold on credits at which 87 * the transmit rate is increased. 88 * 89 * XXX this algorithm is flawed. 90 */ 91 static int ath_rateinterval = 1000; /* rate ctl interval (ms) */ 92 static int ath_rate_raise = 10; /* add credit threshold */ 93 static int ath_rate_raise_threshold = 10; /* rate ctl raise threshold */ 94 95 static void ath_rate_update(struct ath_softc *, struct ieee80211_node *, 96 int rate); 97 static void ath_rate_ctl_start(struct ath_softc *, struct ieee80211_node *); 98 static void ath_rate_ctl(void *, struct ieee80211_node *); 99 100 void 101 ath_rate_node_init(struct ath_softc *sc, struct ath_node *an) 102 { 103 /* NB: assumed to be zero'd by caller */ 104 } 105 106 void 107 ath_rate_node_cleanup(struct ath_softc *sc, struct ath_node *an) 108 { 109 } 110 111 void 112 ath_rate_findrate(struct ath_softc *sc, struct ath_node *an, 113 int shortPreamble, size_t frameLen, int tid, int is_aggr, 114 u_int8_t *rix, int *try0, u_int8_t *txrate, int *maxdur, 115 int *maxpktlen) 116 { 117 struct onoe_node *on = ATH_NODE_ONOE(an); 118 119 *rix = on->on_tx_rix0; 120 *try0 = on->on_tx_try0; 121 if (shortPreamble) 122 *txrate = on->on_tx_rate0sp; 123 else 124 *txrate = on->on_tx_rate0; 125 *maxdur = -1; 126 *maxpktlen = -1; 127 } 128 129 /* 130 * Get the TX rates. 131 * 132 * The short preamble bits aren't set here; the caller should augment 133 * the returned rate with the relevant preamble rate flag. 134 */ 135 void 136 ath_rate_getxtxrates(struct ath_softc *sc, struct ath_node *an, 137 uint8_t rix0, int is_aggr, struct ath_rc_series *rc) 138 { 139 struct onoe_node *on = ATH_NODE_ONOE(an); 140 141 rc[0].flags = rc[1].flags = rc[2].flags = rc[3].flags = 0; 142 143 rc[0].rix = on->on_tx_rate0; 144 rc[1].rix = on->on_tx_rate1; 145 rc[2].rix = on->on_tx_rate2; 146 rc[3].rix = on->on_tx_rate3; 147 148 rc[0].tries = on->on_tx_try0; 149 rc[1].tries = 2; 150 rc[2].tries = 2; 151 rc[3].tries = 2; 152 } 153 154 void 155 ath_rate_setupxtxdesc(struct ath_softc *sc, struct ath_node *an, 156 struct ath_desc *ds, int shortPreamble, u_int8_t rix) 157 { 158 struct onoe_node *on = ATH_NODE_ONOE(an); 159 160 ath_hal_setupxtxdesc(sc->sc_ah, ds 161 , on->on_tx_rate1sp, 2 /* series 1 */ 162 , on->on_tx_rate2sp, 2 /* series 2 */ 163 , on->on_tx_rate3sp, 2 /* series 3 */ 164 ); 165 } 166 167 void 168 ath_rate_tx_complete(struct ath_softc *sc, struct ath_node *an, 169 const struct ath_rc_series *rc, const struct ath_tx_status *ts, 170 int frame_size, int rc_framesize, int nframes, int nbad) 171 { 172 struct onoe_node *on = ATH_NODE_ONOE(an); 173 174 if (ts->ts_status == 0) 175 on->on_tx_ok++; 176 else 177 on->on_tx_err++; 178 on->on_tx_retr += ts->ts_shortretry 179 + ts->ts_longretry; 180 if (on->on_interval != 0 && ticks - on->on_ticks > on->on_interval) { 181 ath_rate_ctl(sc, &an->an_node); 182 on->on_ticks = ticks; 183 } 184 } 185 186 void 187 ath_rate_newassoc(struct ath_softc *sc, struct ath_node *an, int isnew) 188 { 189 if (isnew) 190 ath_rate_ctl_start(sc, &an->an_node); 191 } 192 193 void 194 ath_rate_update_rx_rssi(struct ath_softc *sc, struct ath_node *an, int rssi) 195 { 196 } 197 198 static void 199 ath_rate_update(struct ath_softc *sc, struct ieee80211_node *ni, int rate) 200 { 201 struct ath_node *an = ATH_NODE(ni); 202 struct onoe_node *on = ATH_NODE_ONOE(an); 203 struct ieee80211vap *vap = ni->ni_vap; 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 IEEE80211_NOTE(vap, IEEE80211_MSG_RATECTL, ni, 210 "%s: set xmit rate to %dM", __func__, 211 ni->ni_rates.rs_nrates > 0 ? 212 (ni->ni_rates.rs_rates[rate] & IEEE80211_RATE_VAL) / 2 : 0); 213 214 /* 215 * Before associating a node has no rate set setup 216 * so we can't calculate any transmit codes to use. 217 * This is ok since we should never be sending anything 218 * but management frames and those always go at the 219 * lowest hardware rate. 220 */ 221 if (ni->ni_rates.rs_nrates == 0) 222 goto done; 223 on->on_rix = rate; 224 ni->ni_txrate = ni->ni_rates.rs_rates[rate] & IEEE80211_RATE_VAL; 225 on->on_tx_rix0 = sc->sc_rixmap[ni->ni_txrate]; 226 on->on_tx_rate0 = rt->info[on->on_tx_rix0].rateCode; 227 228 on->on_tx_rate0sp = on->on_tx_rate0 | 229 rt->info[on->on_tx_rix0].shortPreamble; 230 if (sc->sc_mrretry) { 231 /* 232 * Hardware supports multi-rate retry; setup two 233 * step-down retry rates and make the lowest rate 234 * be the ``last chance''. We use 4, 2, 2, 2 tries 235 * respectively (4 is set here, the rest are fixed 236 * in the xmit routine). 237 */ 238 on->on_tx_try0 = 1 + 3; /* 4 tries at rate 0 */ 239 if (--rate >= 0) { 240 rix = sc->sc_rixmap[ 241 ni->ni_rates.rs_rates[rate]&IEEE80211_RATE_VAL]; 242 on->on_tx_rate1 = rt->info[rix].rateCode; 243 on->on_tx_rate1sp = on->on_tx_rate1 | 244 rt->info[rix].shortPreamble; 245 } else { 246 on->on_tx_rate1 = on->on_tx_rate1sp = 0; 247 } 248 if (--rate >= 0) { 249 rix = sc->sc_rixmap[ 250 ni->ni_rates.rs_rates[rate]&IEEE80211_RATE_VAL]; 251 on->on_tx_rate2 = rt->info[rix].rateCode; 252 on->on_tx_rate2sp = on->on_tx_rate2 | 253 rt->info[rix].shortPreamble; 254 } else { 255 on->on_tx_rate2 = on->on_tx_rate2sp = 0; 256 } 257 if (rate > 0) { 258 /* NB: only do this if we didn't already do it above */ 259 on->on_tx_rate3 = rt->info[0].rateCode; 260 on->on_tx_rate3sp = 261 on->on_tx_rate3 | rt->info[0].shortPreamble; 262 } else { 263 on->on_tx_rate3 = on->on_tx_rate3sp = 0; 264 } 265 } else { 266 on->on_tx_try0 = ATH_TXMAXTRY; /* max tries at rate 0 */ 267 on->on_tx_rate1 = on->on_tx_rate1sp = 0; 268 on->on_tx_rate2 = on->on_tx_rate2sp = 0; 269 on->on_tx_rate3 = on->on_tx_rate3sp = 0; 270 } 271 done: 272 on->on_tx_ok = on->on_tx_err = on->on_tx_retr = on->on_tx_upper = 0; 273 274 on->on_interval = ath_rateinterval; 275 if (vap->iv_opmode == IEEE80211_M_STA) 276 on->on_interval /= 2; 277 on->on_interval = (on->on_interval * hz) / 1000; 278 } 279 280 /* 281 * Set the starting transmit rate for a node. 282 */ 283 static void 284 ath_rate_ctl_start(struct ath_softc *sc, struct ieee80211_node *ni) 285 { 286 #define RATE(_ix) (ni->ni_rates.rs_rates[(_ix)] & IEEE80211_RATE_VAL) 287 const struct ieee80211_txparam *tp = ni->ni_txparms; 288 int srate; 289 290 KASSERT(ni->ni_rates.rs_nrates > 0, ("no rates")); 291 if (tp == NULL || tp->ucastrate == IEEE80211_FIXED_RATE_NONE) { 292 /* 293 * No fixed rate is requested. For 11b start with 294 * the highest negotiated rate; otherwise, for 11g 295 * and 11a, we start "in the middle" at 24Mb or 36Mb. 296 */ 297 srate = ni->ni_rates.rs_nrates - 1; 298 if (sc->sc_curmode != IEEE80211_MODE_11B) { 299 /* 300 * Scan the negotiated rate set to find the 301 * closest rate. 302 */ 303 /* NB: the rate set is assumed sorted */ 304 for (; srate >= 0 && RATE(srate) > 72; srate--) 305 ; 306 } 307 } else { 308 /* 309 * A fixed rate is to be used; ic_fixed_rate is the 310 * IEEE code for this rate (sans basic bit). Convert this 311 * to the index into the negotiated rate set for 312 * the node. We know the rate is there because the 313 * rate set is checked when the station associates. 314 */ 315 /* NB: the rate set is assumed sorted */ 316 srate = ni->ni_rates.rs_nrates - 1; 317 for (; srate >= 0 && RATE(srate) != tp->ucastrate; srate--) 318 ; 319 } 320 /* 321 * The selected rate may not be available due to races 322 * and mode settings. Also orphaned nodes created in 323 * adhoc mode may not have any rate set so this lookup 324 * can fail. This is not fatal. 325 */ 326 ath_rate_update(sc, ni, srate < 0 ? 0 : srate); 327 #undef RATE 328 } 329 330 /* 331 * Examine and potentially adjust the transmit rate. 332 */ 333 static void 334 ath_rate_ctl(void *arg, struct ieee80211_node *ni) 335 { 336 struct ath_softc *sc = arg; 337 struct onoe_node *on = ATH_NODE_ONOE(ATH_NODE(ni)); 338 struct ieee80211_rateset *rs = &ni->ni_rates; 339 int dir = 0, nrate, enough; 340 341 /* 342 * Rate control 343 * XXX: very primitive version. 344 */ 345 enough = (on->on_tx_ok + on->on_tx_err >= 10); 346 347 /* no packet reached -> down */ 348 if (on->on_tx_err > 0 && on->on_tx_ok == 0) 349 dir = -1; 350 351 /* all packets needs retry in average -> down */ 352 if (enough && on->on_tx_ok < on->on_tx_retr) 353 dir = -1; 354 355 /* no error and less than rate_raise% of packets need retry -> up */ 356 if (enough && on->on_tx_err == 0 && 357 on->on_tx_retr < (on->on_tx_ok * ath_rate_raise) / 100) 358 dir = 1; 359 360 IEEE80211_NOTE(ni->ni_vap, IEEE80211_MSG_RATECTL, ni, 361 "ok %d err %d retr %d upper %d dir %d", 362 on->on_tx_ok, on->on_tx_err, on->on_tx_retr, on->on_tx_upper, dir); 363 364 nrate = on->on_rix; 365 switch (dir) { 366 case 0: 367 if (enough && on->on_tx_upper > 0) 368 on->on_tx_upper--; 369 break; 370 case -1: 371 if (nrate > 0) { 372 nrate--; 373 sc->sc_stats.ast_rate_drop++; 374 } 375 on->on_tx_upper = 0; 376 break; 377 case 1: 378 /* raise rate if we hit rate_raise_threshold */ 379 if (++on->on_tx_upper < ath_rate_raise_threshold) 380 break; 381 on->on_tx_upper = 0; 382 if (nrate + 1 < rs->rs_nrates) { 383 nrate++; 384 sc->sc_stats.ast_rate_raise++; 385 } 386 break; 387 } 388 389 if (nrate != on->on_rix) { 390 IEEE80211_NOTE(ni->ni_vap, IEEE80211_MSG_RATECTL, ni, 391 "%s: %dM -> %dM (%d ok, %d err, %d retr)", __func__, 392 ni->ni_txrate / 2, 393 (rs->rs_rates[nrate] & IEEE80211_RATE_VAL) / 2, 394 on->on_tx_ok, on->on_tx_err, on->on_tx_retr); 395 ath_rate_update(sc, ni, nrate); 396 } else if (enough) 397 on->on_tx_ok = on->on_tx_err = on->on_tx_retr = 0; 398 } 399 400 static void 401 ath_rate_sysctlattach(struct ath_softc *sc) 402 { 403 struct sysctl_ctx_list *ctx = device_get_sysctl_ctx(sc->sc_dev); 404 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); 405 406 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 407 "rate_interval", CTLFLAG_RW, &ath_rateinterval, 0, 408 "rate control: operation interval (ms)"); 409 /* XXX bounds check values */ 410 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 411 "rate_raise", CTLFLAG_RW, &ath_rate_raise, 0, 412 "rate control: retry threshold to credit rate raise (%%)"); 413 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 414 "rate_raise_threshold", CTLFLAG_RW, &ath_rate_raise_threshold,0, 415 "rate control: # good periods before raising rate"); 416 } 417 418 static int 419 ath_rate_fetch_node_stats(struct ath_softc *sc, struct ath_node *an, 420 struct ath_rateioctl *re) 421 { 422 423 return (EINVAL); 424 } 425 426 struct ath_ratectrl * 427 ath_rate_attach(struct ath_softc *sc) 428 { 429 struct onoe_softc *osc; 430 431 osc = malloc(sizeof(struct onoe_softc), M_DEVBUF, M_NOWAIT|M_ZERO); 432 if (osc == NULL) 433 return NULL; 434 osc->arc.arc_space = sizeof(struct onoe_node); 435 ath_rate_sysctlattach(sc); 436 437 return &osc->arc; 438 } 439 440 void 441 ath_rate_detach(struct ath_ratectrl *arc) 442 { 443 struct onoe_softc *osc = (struct onoe_softc *) arc; 444 445 free(osc, M_DEVBUF); 446 } 447