2 * Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
9 * Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
10 * Sponsored by Indranet Technologies Ltd
13 * Copyright (c) 2005 John Bicket
14 * All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer,
21 * without modification.
22 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
23 * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
24 * redistribution must be conditioned upon including a substantially
25 * similar Disclaimer requirement for further binary redistribution.
26 * 3. Neither the names of the above-listed copyright holders nor the names
27 * of any contributors may be used to endorse or promote products derived
28 * from this software without specific prior written permission.
30 * Alternatively, this software may be distributed under the terms of the
31 * GNU General Public License ("GPL") version 2 as published by the Free
32 * Software Foundation.
35 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
36 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
37 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
38 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
39 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
40 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
41 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
42 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
43 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
44 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
45 * THE POSSIBILITY OF SUCH DAMAGES.
47 #include <linux/netdevice.h>
48 #include <linux/types.h>
49 #include <linux/skbuff.h>
50 #include <linux/debugfs.h>
51 #include <linux/random.h>
52 #include <linux/ieee80211.h>
53 #include <linux/slab.h>
54 #include <net/mac80211.h>
56 #include "rc80211_minstrel.h"
58 #define SAMPLE_COLUMNS 10
59 #define SAMPLE_TBL(_mi, _idx, _col) \
60 _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
62 /* convert mac80211 rate index to local array index */
64 rix_to_ndx(struct minstrel_sta_info *mi, int rix)
67 for (i = rix; i >= 0; i--)
68 if (mi->r[i].rix == rix)
74 minstrel_update_stats(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
76 u32 max_tp = 0, index_max_tp = 0, index_max_tp2 = 0;
77 u32 max_prob = 0, index_max_prob = 0;
81 mi->stats_update = jiffies;
82 for (i = 0; i < mi->n_rates; i++) {
83 struct minstrel_rate *mr = &mi->r[i];
85 usecs = mr->perfect_tx_time;
89 /* To avoid rounding issues, probabilities scale from 0 (0%)
92 mr->cur_prob = (mr->success * 18000) / mr->attempts;
93 mr->succ_hist += mr->success;
94 mr->att_hist += mr->attempts;
95 mr->probability = minstrel_ewma(mr->probability,
98 mr->cur_tp = mr->probability * (1000000 / usecs);
101 mr->last_success = mr->success;
102 mr->last_attempts = mr->attempts;
106 /* Sample less often below the 10% chance of success.
107 * Sample less often above the 95% chance of success. */
108 if ((mr->probability > 17100) || (mr->probability < 1800)) {
109 mr->adjusted_retry_count = mr->retry_count >> 1;
110 if (mr->adjusted_retry_count > 2)
111 mr->adjusted_retry_count = 2;
112 mr->sample_limit = 4;
114 mr->sample_limit = -1;
115 mr->adjusted_retry_count = mr->retry_count;
117 if (!mr->adjusted_retry_count)
118 mr->adjusted_retry_count = 2;
121 for (i = 0; i < mi->n_rates; i++) {
122 struct minstrel_rate *mr = &mi->r[i];
123 if (max_tp < mr->cur_tp) {
127 if (max_prob < mr->probability) {
129 max_prob = mr->probability;
134 for (i = 0; i < mi->n_rates; i++) {
135 struct minstrel_rate *mr = &mi->r[i];
137 if (i == index_max_tp)
140 if (max_tp < mr->cur_tp) {
145 mi->max_tp_rate = index_max_tp;
146 mi->max_tp_rate2 = index_max_tp2;
147 mi->max_prob_rate = index_max_prob;
151 minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
152 struct ieee80211_sta *sta, void *priv_sta,
155 struct minstrel_priv *mp = priv;
156 struct minstrel_sta_info *mi = priv_sta;
157 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
158 struct ieee80211_tx_rate *ar = info->status.rates;
162 success = !!(info->flags & IEEE80211_TX_STAT_ACK);
164 for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
168 ndx = rix_to_ndx(mi, ar[i].idx);
172 mi->r[ndx].attempts += ar[i].count;
174 if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
175 mi->r[ndx].success += success;
178 if ((info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE) && (i >= 0))
181 if (mi->sample_deferred > 0)
182 mi->sample_deferred--;
184 if (time_after(jiffies, mi->stats_update +
185 (mp->update_interval * HZ) / 1000))
186 minstrel_update_stats(mp, mi);
190 static inline unsigned int
191 minstrel_get_retry_count(struct minstrel_rate *mr,
192 struct ieee80211_tx_info *info)
194 unsigned int retry = mr->adjusted_retry_count;
196 if (info->control.rates[0].flags & IEEE80211_TX_RC_USE_RTS_CTS)
197 retry = max(2U, min(mr->retry_count_rtscts, retry));
198 else if (info->control.rates[0].flags & IEEE80211_TX_RC_USE_CTS_PROTECT)
199 retry = max(2U, min(mr->retry_count_cts, retry));
205 minstrel_get_next_sample(struct minstrel_sta_info *mi)
207 unsigned int sample_ndx;
208 sample_ndx = SAMPLE_TBL(mi, mi->sample_idx, mi->sample_column);
210 if ((int) mi->sample_idx > (mi->n_rates - 2)) {
213 if (mi->sample_column >= SAMPLE_COLUMNS)
214 mi->sample_column = 0;
220 minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
221 void *priv_sta, struct ieee80211_tx_rate_control *txrc)
223 struct sk_buff *skb = txrc->skb;
224 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
225 struct minstrel_sta_info *mi = priv_sta;
226 struct minstrel_priv *mp = priv;
227 struct ieee80211_tx_rate *ar = info->control.rates;
228 unsigned int ndx, sample_ndx = 0;
230 bool sample_slower = false;
236 if (rate_control_send_low(sta, priv_sta, txrc))
239 mrr = mp->has_mrr && !txrc->rts && !txrc->bss_conf->use_cts_prot;
241 ndx = mi->max_tp_rate;
244 sample_rate = mp->lookaround_rate_mrr;
246 sample_rate = mp->lookaround_rate;
249 delta = (mi->packet_count * sample_rate / 100) -
250 (mi->sample_count + mi->sample_deferred / 2);
252 /* delta > 0: sampling required */
253 if ((delta > 0) && (mrr || !mi->prev_sample)) {
254 struct minstrel_rate *msr;
255 if (mi->packet_count >= 10000) {
256 mi->sample_deferred = 0;
257 mi->sample_count = 0;
258 mi->packet_count = 0;
259 } else if (delta > mi->n_rates * 2) {
260 /* With multi-rate retry, not every planned sample
261 * attempt actually gets used, due to the way the retry
262 * chain is set up - [max_tp,sample,prob,lowest] for
263 * sample_rate < max_tp.
265 * If there's too much sampling backlog and the link
266 * starts getting worse, minstrel would start bursting
267 * out lots of sampling frames, which would result
268 * in a large throughput loss. */
269 mi->sample_count += (delta - mi->n_rates * 2);
272 sample_ndx = minstrel_get_next_sample(mi);
273 msr = &mi->r[sample_ndx];
275 sample_slower = mrr && (msr->perfect_tx_time >
276 mi->r[ndx].perfect_tx_time);
278 if (!sample_slower) {
279 if (msr->sample_limit != 0) {
282 if (msr->sample_limit > 0)
288 /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
289 * packets that have the sampling rate deferred to the
290 * second MRR stage. Increase the sample counter only
291 * if the deferred sample rate was actually used.
292 * Use the sample_deferred counter to make sure that
293 * the sampling is not done in large bursts */
294 info->flags |= IEEE80211_TX_CTL_RATE_CTRL_PROBE;
295 mi->sample_deferred++;
298 mi->prev_sample = sample;
300 /* If we're not using MRR and the sampling rate already
301 * has a probability of >95%, we shouldn't be attempting
302 * to use it, as this only wastes precious airtime */
303 if (!mrr && sample && (mi->r[ndx].probability > 17100))
304 ndx = mi->max_tp_rate;
306 ar[0].idx = mi->r[ndx].rix;
307 ar[0].count = minstrel_get_retry_count(&mi->r[ndx], info);
311 ar[0].count = mp->max_retry;
312 ar[1].idx = mi->lowest_rix;
313 ar[1].count = mp->max_retry;
320 mrr_ndx[0] = sample_ndx;
322 mrr_ndx[0] = mi->max_tp_rate;
324 mrr_ndx[0] = mi->max_tp_rate2;
326 mrr_ndx[1] = mi->max_prob_rate;
328 for (i = 1; i < 4; i++) {
329 ar[i].idx = mi->r[mrr_ndx[i - 1]].rix;
330 ar[i].count = mi->r[mrr_ndx[i - 1]].adjusted_retry_count;
336 calc_rate_durations(enum ieee80211_band band,
337 struct minstrel_rate *d,
338 struct ieee80211_rate *rate)
340 int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
342 d->perfect_tx_time = ieee80211_frame_duration(band, 1200,
343 rate->bitrate, erp, 1);
344 d->ack_time = ieee80211_frame_duration(band, 10,
345 rate->bitrate, erp, 1);
349 init_sample_table(struct minstrel_sta_info *mi)
351 unsigned int i, col, new_idx;
352 unsigned int n_srates = mi->n_rates - 1;
355 mi->sample_column = 0;
357 memset(mi->sample_table, 0, SAMPLE_COLUMNS * mi->n_rates);
359 for (col = 0; col < SAMPLE_COLUMNS; col++) {
360 for (i = 0; i < n_srates; i++) {
361 get_random_bytes(rnd, sizeof(rnd));
362 new_idx = (i + rnd[i & 7]) % n_srates;
364 while (SAMPLE_TBL(mi, new_idx, col) != 0)
365 new_idx = (new_idx + 1) % n_srates;
367 /* Don't sample the slowest rate (i.e. slowest base
368 * rate). We must presume that the slowest rate works
369 * fine, or else other management frames will also be
370 * failing and the link will break */
371 SAMPLE_TBL(mi, new_idx, col) = i + 1;
377 minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
378 struct ieee80211_sta *sta, void *priv_sta)
380 struct minstrel_sta_info *mi = priv_sta;
381 struct minstrel_priv *mp = priv;
382 struct ieee80211_rate *ctl_rate;
383 unsigned int i, n = 0;
384 unsigned int t_slot = 9; /* FIXME: get real slot time */
386 mi->lowest_rix = rate_lowest_index(sband, sta);
387 ctl_rate = &sband->bitrates[mi->lowest_rix];
388 mi->sp_ack_dur = ieee80211_frame_duration(sband->band, 10,
390 !!(ctl_rate->flags & IEEE80211_RATE_ERP_G), 1);
392 for (i = 0; i < sband->n_bitrates; i++) {
393 struct minstrel_rate *mr = &mi->r[n];
394 unsigned int tx_time = 0, tx_time_cts = 0, tx_time_rtscts = 0;
395 unsigned int tx_time_single;
396 unsigned int cw = mp->cw_min;
398 if (!rate_supported(sta, sband->band, i))
401 memset(mr, 0, sizeof(*mr));
404 mr->bitrate = sband->bitrates[i].bitrate / 5;
405 calc_rate_durations(sband->band, mr, &sband->bitrates[i]);
407 /* calculate maximum number of retransmissions before
408 * fallback (based on maximum segment size) */
409 mr->sample_limit = -1;
411 mr->retry_count_cts = 1;
412 mr->retry_count_rtscts = 1;
413 tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
415 /* add one retransmission */
416 tx_time_single = mr->ack_time + mr->perfect_tx_time;
418 /* contention window */
419 tx_time_single += (t_slot * cw) >> 1;
420 cw = min((cw << 1) | 1, mp->cw_max);
422 tx_time += tx_time_single;
423 tx_time_cts += tx_time_single + mi->sp_ack_dur;
424 tx_time_rtscts += tx_time_single + 2 * mi->sp_ack_dur;
425 if ((tx_time_cts < mp->segment_size) &&
426 (mr->retry_count_cts < mp->max_retry))
427 mr->retry_count_cts++;
428 if ((tx_time_rtscts < mp->segment_size) &&
429 (mr->retry_count_rtscts < mp->max_retry))
430 mr->retry_count_rtscts++;
431 } while ((tx_time < mp->segment_size) &&
432 (++mr->retry_count < mp->max_retry));
433 mr->adjusted_retry_count = mr->retry_count;
436 for (i = n; i < sband->n_bitrates; i++) {
437 struct minstrel_rate *mr = &mi->r[i];
442 mi->stats_update = jiffies;
444 init_sample_table(mi);
448 minstrel_alloc_sta(void *priv, struct ieee80211_sta *sta, gfp_t gfp)
450 struct ieee80211_supported_band *sband;
451 struct minstrel_sta_info *mi;
452 struct minstrel_priv *mp = priv;
453 struct ieee80211_hw *hw = mp->hw;
457 mi = kzalloc(sizeof(struct minstrel_sta_info), gfp);
461 for (i = 0; i < IEEE80211_NUM_BANDS; i++) {
462 sband = hw->wiphy->bands[i];
463 if (sband && sband->n_bitrates > max_rates)
464 max_rates = sband->n_bitrates;
467 mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);
471 mi->sample_table = kmalloc(SAMPLE_COLUMNS * max_rates, gfp);
472 if (!mi->sample_table)
475 mi->stats_update = jiffies;
486 minstrel_free_sta(void *priv, struct ieee80211_sta *sta, void *priv_sta)
488 struct minstrel_sta_info *mi = priv_sta;
490 kfree(mi->sample_table);
496 minstrel_init_cck_rates(struct minstrel_priv *mp)
498 static const int bitrates[4] = { 10, 20, 55, 110 };
499 struct ieee80211_supported_band *sband;
502 sband = mp->hw->wiphy->bands[IEEE80211_BAND_2GHZ];
506 for (i = 0, j = 0; i < sband->n_bitrates; i++) {
507 struct ieee80211_rate *rate = &sband->bitrates[i];
509 if (rate->flags & IEEE80211_RATE_ERP_G)
512 for (j = 0; j < ARRAY_SIZE(bitrates); j++) {
513 if (rate->bitrate != bitrates[j])
516 mp->cck_rates[j] = i;
523 minstrel_alloc(struct ieee80211_hw *hw, struct dentry *debugfsdir)
525 struct minstrel_priv *mp;
527 mp = kzalloc(sizeof(struct minstrel_priv), GFP_ATOMIC);
531 /* contention window settings
532 * Just an approximation. Using the per-queue values would complicate
533 * the calculations and is probably unnecessary */
537 /* number of packets (in %) to use for sampling other rates
538 * sample less often for non-mrr packets, because the overhead
539 * is much higher than with mrr */
540 mp->lookaround_rate = 5;
541 mp->lookaround_rate_mrr = 10;
543 /* maximum time that the hw is allowed to stay in one MRR segment */
544 mp->segment_size = 6000;
546 if (hw->max_rate_tries > 0)
547 mp->max_retry = hw->max_rate_tries;
549 /* safe default, does not necessarily have to match hw properties */
552 if (hw->max_rates >= 4)
556 mp->update_interval = 100;
558 #ifdef CONFIG_MAC80211_DEBUGFS
559 mp->fixed_rate_idx = (u32) -1;
560 mp->dbg_fixed_rate = debugfs_create_u32("fixed_rate_idx",
561 S_IRUGO | S_IWUGO, debugfsdir, &mp->fixed_rate_idx);
564 minstrel_init_cck_rates(mp);
570 minstrel_free(void *priv)
572 #ifdef CONFIG_MAC80211_DEBUGFS
573 debugfs_remove(((struct minstrel_priv *)priv)->dbg_fixed_rate);
578 struct rate_control_ops mac80211_minstrel = {
580 .tx_status = minstrel_tx_status,
581 .get_rate = minstrel_get_rate,
582 .rate_init = minstrel_rate_init,
583 .alloc = minstrel_alloc,
584 .free = minstrel_free,
585 .alloc_sta = minstrel_alloc_sta,
586 .free_sta = minstrel_free_sta,
587 #ifdef CONFIG_MAC80211_DEBUGFS
588 .add_sta_debugfs = minstrel_add_sta_debugfs,
589 .remove_sta_debugfs = minstrel_remove_sta_debugfs,
594 rc80211_minstrel_init(void)
596 return ieee80211_rate_control_register(&mac80211_minstrel);
600 rc80211_minstrel_exit(void)
602 ieee80211_rate_control_unregister(&mac80211_minstrel);