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_TBL(_mi, _idx, _col) \
59 _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
61 /* convert mac80211 rate index to local array index */
63 rix_to_ndx(struct minstrel_sta_info
*mi
, int rix
)
66 for (i
= rix
; i
>= 0; i
--)
67 if (mi
->r
[i
].rix
== rix
)
72 /* find & sort topmost throughput rates */
74 minstrel_sort_best_tp_rates(struct minstrel_sta_info
*mi
, int i
, u8
*tp_list
)
76 int j
= MAX_THR_RATES
;
78 while (j
> 0 && mi
->r
[i
].cur_tp
> mi
->r
[tp_list
[j
- 1]].cur_tp
)
80 if (j
< MAX_THR_RATES
- 1)
81 memmove(&tp_list
[j
+ 1], &tp_list
[j
], MAX_THR_RATES
- (j
+ 1));
82 if (j
< MAX_THR_RATES
)
87 minstrel_set_rate(struct minstrel_sta_info
*mi
, struct ieee80211_sta_rates
*ratetbl
,
90 struct minstrel_rate
*r
= &mi
->r
[idx
];
92 ratetbl
->rate
[offset
].idx
= r
->rix
;
93 ratetbl
->rate
[offset
].count
= r
->adjusted_retry_count
;
94 ratetbl
->rate
[offset
].count_cts
= r
->retry_count_cts
;
95 ratetbl
->rate
[offset
].count_rts
= r
->retry_count_rtscts
;
99 minstrel_update_rates(struct minstrel_priv
*mp
, struct minstrel_sta_info
*mi
)
101 struct ieee80211_sta_rates
*ratetbl
;
104 ratetbl
= kzalloc(sizeof(*ratetbl
), GFP_ATOMIC
);
108 /* Start with max_tp_rate */
109 minstrel_set_rate(mi
, ratetbl
, i
++, mi
->max_tp_rate
[0]);
111 if (mp
->hw
->max_rates
>= 3) {
112 /* At least 3 tx rates supported, use max_tp_rate2 next */
113 minstrel_set_rate(mi
, ratetbl
, i
++, mi
->max_tp_rate
[1]);
116 if (mp
->hw
->max_rates
>= 2) {
117 /* At least 2 tx rates supported, use max_prob_rate next */
118 minstrel_set_rate(mi
, ratetbl
, i
++, mi
->max_prob_rate
);
121 /* Use lowest rate last */
122 ratetbl
->rate
[i
].idx
= mi
->lowest_rix
;
123 ratetbl
->rate
[i
].count
= mp
->max_retry
;
124 ratetbl
->rate
[i
].count_cts
= mp
->max_retry
;
125 ratetbl
->rate
[i
].count_rts
= mp
->max_retry
;
127 rate_control_set_rates(mp
->hw
, mi
->sta
, ratetbl
);
131 minstrel_update_stats(struct minstrel_priv
*mp
, struct minstrel_sta_info
*mi
)
133 u8 tmp_tp_rate
[MAX_THR_RATES
];
134 u8 tmp_prob_rate
= 0;
138 for (i
=0; i
< MAX_THR_RATES
; i
++)
141 for (i
= 0; i
< mi
->n_rates
; i
++) {
142 struct minstrel_rate
*mr
= &mi
->r
[i
];
144 usecs
= mr
->perfect_tx_time
;
148 if (unlikely(mr
->attempts
> 0)) {
149 mr
->sample_skipped
= 0;
150 mr
->cur_prob
= MINSTREL_FRAC(mr
->success
, mr
->attempts
);
151 mr
->succ_hist
+= mr
->success
;
152 mr
->att_hist
+= mr
->attempts
;
153 mr
->probability
= minstrel_ewma(mr
->probability
,
157 mr
->sample_skipped
++;
159 mr
->last_success
= mr
->success
;
160 mr
->last_attempts
= mr
->attempts
;
164 /* Update throughput per rate, reset thr. below 10% success */
165 if (mr
->probability
< MINSTREL_FRAC(10, 100))
168 mr
->cur_tp
= mr
->probability
* (1000000 / usecs
);
170 /* Sample less often below the 10% chance of success.
171 * Sample less often above the 95% chance of success. */
172 if (mr
->probability
> MINSTREL_FRAC(95, 100) ||
173 mr
->probability
< MINSTREL_FRAC(10, 100)) {
174 mr
->adjusted_retry_count
= mr
->retry_count
>> 1;
175 if (mr
->adjusted_retry_count
> 2)
176 mr
->adjusted_retry_count
= 2;
177 mr
->sample_limit
= 4;
179 mr
->sample_limit
= -1;
180 mr
->adjusted_retry_count
= mr
->retry_count
;
182 if (!mr
->adjusted_retry_count
)
183 mr
->adjusted_retry_count
= 2;
185 minstrel_sort_best_tp_rates(mi
, i
, tmp_tp_rate
);
187 /* To determine the most robust rate (max_prob_rate) used at
188 * 3rd mmr stage we distinct between two cases:
189 * (1) if any success probabilitiy >= 95%, out of those rates
190 * choose the maximum throughput rate as max_prob_rate
191 * (2) if all success probabilities < 95%, the rate with
192 * highest success probability is choosen as max_prob_rate */
193 if (mr
->probability
>= MINSTREL_FRAC(95,100)) {
194 if (mr
->cur_tp
>= mi
->r
[tmp_prob_rate
].cur_tp
)
197 if (mr
->probability
>= mi
->r
[tmp_prob_rate
].probability
)
202 /* Assign the new rate set */
203 memcpy(mi
->max_tp_rate
, tmp_tp_rate
, sizeof(mi
->max_tp_rate
));
204 mi
->max_prob_rate
= tmp_prob_rate
;
206 /* Reset update timer */
207 mi
->stats_update
= jiffies
;
209 minstrel_update_rates(mp
, mi
);
213 minstrel_tx_status(void *priv
, struct ieee80211_supported_band
*sband
,
214 struct ieee80211_sta
*sta
, void *priv_sta
,
217 struct minstrel_priv
*mp
= priv
;
218 struct minstrel_sta_info
*mi
= priv_sta
;
219 struct ieee80211_tx_info
*info
= IEEE80211_SKB_CB(skb
);
220 struct ieee80211_tx_rate
*ar
= info
->status
.rates
;
224 success
= !!(info
->flags
& IEEE80211_TX_STAT_ACK
);
226 for (i
= 0; i
< IEEE80211_TX_MAX_RATES
; i
++) {
230 ndx
= rix_to_ndx(mi
, ar
[i
].idx
);
234 mi
->r
[ndx
].attempts
+= ar
[i
].count
;
236 if ((i
!= IEEE80211_TX_MAX_RATES
- 1) && (ar
[i
+ 1].idx
< 0))
237 mi
->r
[ndx
].success
+= success
;
240 if ((info
->flags
& IEEE80211_TX_CTL_RATE_CTRL_PROBE
) && (i
>= 0))
243 if (mi
->sample_deferred
> 0)
244 mi
->sample_deferred
--;
246 if (time_after(jiffies
, mi
->stats_update
+
247 (mp
->update_interval
* HZ
) / 1000))
248 minstrel_update_stats(mp
, mi
);
252 static inline unsigned int
253 minstrel_get_retry_count(struct minstrel_rate
*mr
,
254 struct ieee80211_tx_info
*info
)
256 unsigned int retry
= mr
->adjusted_retry_count
;
258 if (info
->control
.use_rts
)
259 retry
= max(2U, min(mr
->retry_count_rtscts
, retry
));
260 else if (info
->control
.use_cts_prot
)
261 retry
= max(2U, min(mr
->retry_count_cts
, retry
));
267 minstrel_get_next_sample(struct minstrel_sta_info
*mi
)
269 unsigned int sample_ndx
;
270 sample_ndx
= SAMPLE_TBL(mi
, mi
->sample_row
, mi
->sample_column
);
272 if ((int) mi
->sample_row
>= mi
->n_rates
) {
275 if (mi
->sample_column
>= SAMPLE_COLUMNS
)
276 mi
->sample_column
= 0;
282 minstrel_get_rate(void *priv
, struct ieee80211_sta
*sta
,
283 void *priv_sta
, struct ieee80211_tx_rate_control
*txrc
)
285 struct sk_buff
*skb
= txrc
->skb
;
286 struct ieee80211_tx_info
*info
= IEEE80211_SKB_CB(skb
);
287 struct minstrel_sta_info
*mi
= priv_sta
;
288 struct minstrel_priv
*mp
= priv
;
289 struct ieee80211_tx_rate
*rate
= &info
->control
.rates
[0];
290 struct minstrel_rate
*msr
, *mr
;
297 /* management/no-ack frames do not use rate control */
298 if (rate_control_send_low(sta
, priv_sta
, txrc
))
301 /* check multi-rate-retry capabilities & adjust lookaround_rate */
302 mrr_capable
= mp
->has_mrr
&&
304 !txrc
->bss_conf
->use_cts_prot
;
306 sampling_ratio
= mp
->lookaround_rate_mrr
;
308 sampling_ratio
= mp
->lookaround_rate
;
310 /* increase sum packet counter */
313 delta
= (mi
->packet_count
* sampling_ratio
/ 100) -
314 (mi
->sample_count
+ mi
->sample_deferred
/ 2);
316 /* delta < 0: no sampling required */
317 prev_sample
= mi
->prev_sample
;
318 mi
->prev_sample
= false;
319 if (delta
< 0 || (!mrr_capable
&& prev_sample
))
322 if (mi
->packet_count
>= 10000) {
323 mi
->sample_deferred
= 0;
324 mi
->sample_count
= 0;
325 mi
->packet_count
= 0;
326 } else if (delta
> mi
->n_rates
* 2) {
327 /* With multi-rate retry, not every planned sample
328 * attempt actually gets used, due to the way the retry
329 * chain is set up - [max_tp,sample,prob,lowest] for
330 * sample_rate < max_tp.
332 * If there's too much sampling backlog and the link
333 * starts getting worse, minstrel would start bursting
334 * out lots of sampling frames, which would result
335 * in a large throughput loss. */
336 mi
->sample_count
+= (delta
- mi
->n_rates
* 2);
339 /* get next random rate sample */
340 ndx
= minstrel_get_next_sample(mi
);
342 mr
= &mi
->r
[mi
->max_tp_rate
[0]];
344 /* Decide if direct ( 1st mrr stage) or indirect (2nd mrr stage)
345 * rate sampling method should be used.
346 * Respect such rates that are not sampled for 20 interations.
349 msr
->perfect_tx_time
> mr
->perfect_tx_time
&&
350 msr
->sample_skipped
< 20) {
351 /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
352 * packets that have the sampling rate deferred to the
353 * second MRR stage. Increase the sample counter only
354 * if the deferred sample rate was actually used.
355 * Use the sample_deferred counter to make sure that
356 * the sampling is not done in large bursts */
357 info
->flags
|= IEEE80211_TX_CTL_RATE_CTRL_PROBE
;
359 mi
->sample_deferred
++;
361 if (!msr
->sample_limit
!= 0)
365 if (msr
->sample_limit
> 0)
369 /* If we're not using MRR and the sampling rate already
370 * has a probability of >95%, we shouldn't be attempting
371 * to use it, as this only wastes precious airtime */
373 (mi
->r
[ndx
].probability
> MINSTREL_FRAC(95, 100)))
376 mi
->prev_sample
= true;
378 rate
->idx
= mi
->r
[ndx
].rix
;
379 rate
->count
= minstrel_get_retry_count(&mi
->r
[ndx
], info
);
384 calc_rate_durations(enum ieee80211_band band
,
385 struct minstrel_rate
*d
,
386 struct ieee80211_rate
*rate
,
387 struct cfg80211_chan_def
*chandef
)
389 int erp
= !!(rate
->flags
& IEEE80211_RATE_ERP_G
);
390 int shift
= ieee80211_chandef_get_shift(chandef
);
392 d
->perfect_tx_time
= ieee80211_frame_duration(band
, 1200,
393 DIV_ROUND_UP(rate
->bitrate
, 1 << shift
), erp
, 1,
395 d
->ack_time
= ieee80211_frame_duration(band
, 10,
396 DIV_ROUND_UP(rate
->bitrate
, 1 << shift
), erp
, 1,
401 init_sample_table(struct minstrel_sta_info
*mi
)
403 unsigned int i
, col
, new_idx
;
406 mi
->sample_column
= 0;
408 memset(mi
->sample_table
, 0xff, SAMPLE_COLUMNS
* mi
->n_rates
);
410 for (col
= 0; col
< SAMPLE_COLUMNS
; col
++) {
411 for (i
= 0; i
< mi
->n_rates
; i
++) {
412 get_random_bytes(rnd
, sizeof(rnd
));
413 new_idx
= (i
+ rnd
[i
& 7]) % mi
->n_rates
;
415 while (SAMPLE_TBL(mi
, new_idx
, col
) != 0xff)
416 new_idx
= (new_idx
+ 1) % mi
->n_rates
;
418 SAMPLE_TBL(mi
, new_idx
, col
) = i
;
424 minstrel_rate_init(void *priv
, struct ieee80211_supported_band
*sband
,
425 struct cfg80211_chan_def
*chandef
,
426 struct ieee80211_sta
*sta
, void *priv_sta
)
428 struct minstrel_sta_info
*mi
= priv_sta
;
429 struct minstrel_priv
*mp
= priv
;
430 struct ieee80211_rate
*ctl_rate
;
431 unsigned int i
, n
= 0;
432 unsigned int t_slot
= 9; /* FIXME: get real slot time */
436 mi
->lowest_rix
= rate_lowest_index(sband
, sta
);
437 ctl_rate
= &sband
->bitrates
[mi
->lowest_rix
];
438 mi
->sp_ack_dur
= ieee80211_frame_duration(sband
->band
, 10,
440 !!(ctl_rate
->flags
& IEEE80211_RATE_ERP_G
), 1,
441 ieee80211_chandef_get_shift(chandef
));
443 rate_flags
= ieee80211_chandef_rate_flags(&mp
->hw
->conf
.chandef
);
444 memset(mi
->max_tp_rate
, 0, sizeof(mi
->max_tp_rate
));
445 mi
->max_prob_rate
= 0;
447 for (i
= 0; i
< sband
->n_bitrates
; i
++) {
448 struct minstrel_rate
*mr
= &mi
->r
[n
];
449 unsigned int tx_time
= 0, tx_time_cts
= 0, tx_time_rtscts
= 0;
450 unsigned int tx_time_single
;
451 unsigned int cw
= mp
->cw_min
;
454 if (!rate_supported(sta
, sband
->band
, i
))
456 if ((rate_flags
& sband
->bitrates
[i
].flags
) != rate_flags
)
460 memset(mr
, 0, sizeof(*mr
));
463 shift
= ieee80211_chandef_get_shift(chandef
);
464 mr
->bitrate
= DIV_ROUND_UP(sband
->bitrates
[i
].bitrate
,
466 calc_rate_durations(sband
->band
, mr
, &sband
->bitrates
[i
],
469 /* calculate maximum number of retransmissions before
470 * fallback (based on maximum segment size) */
471 mr
->sample_limit
= -1;
473 mr
->retry_count_cts
= 1;
474 mr
->retry_count_rtscts
= 1;
475 tx_time
= mr
->perfect_tx_time
+ mi
->sp_ack_dur
;
477 /* add one retransmission */
478 tx_time_single
= mr
->ack_time
+ mr
->perfect_tx_time
;
480 /* contention window */
481 tx_time_single
+= (t_slot
* cw
) >> 1;
482 cw
= min((cw
<< 1) | 1, mp
->cw_max
);
484 tx_time
+= tx_time_single
;
485 tx_time_cts
+= tx_time_single
+ mi
->sp_ack_dur
;
486 tx_time_rtscts
+= tx_time_single
+ 2 * mi
->sp_ack_dur
;
487 if ((tx_time_cts
< mp
->segment_size
) &&
488 (mr
->retry_count_cts
< mp
->max_retry
))
489 mr
->retry_count_cts
++;
490 if ((tx_time_rtscts
< mp
->segment_size
) &&
491 (mr
->retry_count_rtscts
< mp
->max_retry
))
492 mr
->retry_count_rtscts
++;
493 } while ((tx_time
< mp
->segment_size
) &&
494 (++mr
->retry_count
< mp
->max_retry
));
495 mr
->adjusted_retry_count
= mr
->retry_count
;
496 if (!(sband
->bitrates
[i
].flags
& IEEE80211_RATE_ERP_G
))
497 mr
->retry_count_cts
= mr
->retry_count
;
500 for (i
= n
; i
< sband
->n_bitrates
; i
++) {
501 struct minstrel_rate
*mr
= &mi
->r
[i
];
506 mi
->stats_update
= jiffies
;
508 init_sample_table(mi
);
509 minstrel_update_rates(mp
, mi
);
513 minstrel_alloc_sta(void *priv
, struct ieee80211_sta
*sta
, gfp_t gfp
)
515 struct ieee80211_supported_band
*sband
;
516 struct minstrel_sta_info
*mi
;
517 struct minstrel_priv
*mp
= priv
;
518 struct ieee80211_hw
*hw
= mp
->hw
;
522 mi
= kzalloc(sizeof(struct minstrel_sta_info
), gfp
);
526 for (i
= 0; i
< IEEE80211_NUM_BANDS
; i
++) {
527 sband
= hw
->wiphy
->bands
[i
];
528 if (sband
&& sband
->n_bitrates
> max_rates
)
529 max_rates
= sband
->n_bitrates
;
532 mi
->r
= kzalloc(sizeof(struct minstrel_rate
) * max_rates
, gfp
);
536 mi
->sample_table
= kmalloc(SAMPLE_COLUMNS
* max_rates
, gfp
);
537 if (!mi
->sample_table
)
540 mi
->stats_update
= jiffies
;
551 minstrel_free_sta(void *priv
, struct ieee80211_sta
*sta
, void *priv_sta
)
553 struct minstrel_sta_info
*mi
= priv_sta
;
555 kfree(mi
->sample_table
);
561 minstrel_init_cck_rates(struct minstrel_priv
*mp
)
563 static const int bitrates
[4] = { 10, 20, 55, 110 };
564 struct ieee80211_supported_band
*sband
;
565 u32 rate_flags
= ieee80211_chandef_rate_flags(&mp
->hw
->conf
.chandef
);
568 sband
= mp
->hw
->wiphy
->bands
[IEEE80211_BAND_2GHZ
];
572 for (i
= 0, j
= 0; i
< sband
->n_bitrates
; i
++) {
573 struct ieee80211_rate
*rate
= &sband
->bitrates
[i
];
575 if (rate
->flags
& IEEE80211_RATE_ERP_G
)
578 if ((rate_flags
& sband
->bitrates
[i
].flags
) != rate_flags
)
581 for (j
= 0; j
< ARRAY_SIZE(bitrates
); j
++) {
582 if (rate
->bitrate
!= bitrates
[j
])
585 mp
->cck_rates
[j
] = i
;
592 minstrel_alloc(struct ieee80211_hw
*hw
, struct dentry
*debugfsdir
)
594 struct minstrel_priv
*mp
;
596 mp
= kzalloc(sizeof(struct minstrel_priv
), GFP_ATOMIC
);
600 /* contention window settings
601 * Just an approximation. Using the per-queue values would complicate
602 * the calculations and is probably unnecessary */
606 /* number of packets (in %) to use for sampling other rates
607 * sample less often for non-mrr packets, because the overhead
608 * is much higher than with mrr */
609 mp
->lookaround_rate
= 5;
610 mp
->lookaround_rate_mrr
= 10;
612 /* maximum time that the hw is allowed to stay in one MRR segment */
613 mp
->segment_size
= 6000;
615 if (hw
->max_rate_tries
> 0)
616 mp
->max_retry
= hw
->max_rate_tries
;
618 /* safe default, does not necessarily have to match hw properties */
621 if (hw
->max_rates
>= 4)
625 mp
->update_interval
= 100;
627 #ifdef CONFIG_MAC80211_DEBUGFS
628 mp
->fixed_rate_idx
= (u32
) -1;
629 mp
->dbg_fixed_rate
= debugfs_create_u32("fixed_rate_idx",
630 S_IRUGO
| S_IWUGO
, debugfsdir
, &mp
->fixed_rate_idx
);
633 minstrel_init_cck_rates(mp
);
639 minstrel_free(void *priv
)
641 #ifdef CONFIG_MAC80211_DEBUGFS
642 debugfs_remove(((struct minstrel_priv
*)priv
)->dbg_fixed_rate
);
647 struct rate_control_ops mac80211_minstrel
= {
649 .tx_status
= minstrel_tx_status
,
650 .get_rate
= minstrel_get_rate
,
651 .rate_init
= minstrel_rate_init
,
652 .alloc
= minstrel_alloc
,
653 .free
= minstrel_free
,
654 .alloc_sta
= minstrel_alloc_sta
,
655 .free_sta
= minstrel_free_sta
,
656 #ifdef CONFIG_MAC80211_DEBUGFS
657 .add_sta_debugfs
= minstrel_add_sta_debugfs
,
658 .remove_sta_debugfs
= minstrel_remove_sta_debugfs
,
663 rc80211_minstrel_init(void)
665 return ieee80211_rate_control_register(&mac80211_minstrel
);
669 rc80211_minstrel_exit(void)
671 ieee80211_rate_control_unregister(&mac80211_minstrel
);