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 /* return current EMWA throughput */
73 int minstrel_get_tp_avg(struct minstrel_rate
*mr
, int prob_ewma
)
77 usecs
= mr
->perfect_tx_time
;
81 /* reset thr. below 10% success */
82 if (mr
->stats
.prob_ewma
< MINSTREL_FRAC(10, 100))
85 if (prob_ewma
> MINSTREL_FRAC(90, 100))
86 return MINSTREL_TRUNC(100000 * (MINSTREL_FRAC(90, 100) / usecs
));
88 return MINSTREL_TRUNC(100000 * (prob_ewma
/ usecs
));
91 /* find & sort topmost throughput rates */
93 minstrel_sort_best_tp_rates(struct minstrel_sta_info
*mi
, int i
, u8
*tp_list
)
95 int j
= MAX_THR_RATES
;
96 struct minstrel_rate_stats
*tmp_mrs
= &mi
->r
[j
- 1].stats
;
97 struct minstrel_rate_stats
*cur_mrs
= &mi
->r
[i
].stats
;
99 while (j
> 0 && (minstrel_get_tp_avg(&mi
->r
[i
], cur_mrs
->prob_ewma
) >
100 minstrel_get_tp_avg(&mi
->r
[tp_list
[j
- 1]], tmp_mrs
->prob_ewma
))) {
102 tmp_mrs
= &mi
->r
[tp_list
[j
- 1]].stats
;
105 if (j
< MAX_THR_RATES
- 1)
106 memmove(&tp_list
[j
+ 1], &tp_list
[j
], MAX_THR_RATES
- (j
+ 1));
107 if (j
< MAX_THR_RATES
)
112 minstrel_set_rate(struct minstrel_sta_info
*mi
, struct ieee80211_sta_rates
*ratetbl
,
115 struct minstrel_rate
*r
= &mi
->r
[idx
];
117 ratetbl
->rate
[offset
].idx
= r
->rix
;
118 ratetbl
->rate
[offset
].count
= r
->adjusted_retry_count
;
119 ratetbl
->rate
[offset
].count_cts
= r
->retry_count_cts
;
120 ratetbl
->rate
[offset
].count_rts
= r
->stats
.retry_count_rtscts
;
124 minstrel_update_rates(struct minstrel_priv
*mp
, struct minstrel_sta_info
*mi
)
126 struct ieee80211_sta_rates
*ratetbl
;
129 ratetbl
= kzalloc(sizeof(*ratetbl
), GFP_ATOMIC
);
133 /* Start with max_tp_rate */
134 minstrel_set_rate(mi
, ratetbl
, i
++, mi
->max_tp_rate
[0]);
136 if (mp
->hw
->max_rates
>= 3) {
137 /* At least 3 tx rates supported, use max_tp_rate2 next */
138 minstrel_set_rate(mi
, ratetbl
, i
++, mi
->max_tp_rate
[1]);
141 if (mp
->hw
->max_rates
>= 2) {
142 /* At least 2 tx rates supported, use max_prob_rate next */
143 minstrel_set_rate(mi
, ratetbl
, i
++, mi
->max_prob_rate
);
146 /* Use lowest rate last */
147 ratetbl
->rate
[i
].idx
= mi
->lowest_rix
;
148 ratetbl
->rate
[i
].count
= mp
->max_retry
;
149 ratetbl
->rate
[i
].count_cts
= mp
->max_retry
;
150 ratetbl
->rate
[i
].count_rts
= mp
->max_retry
;
152 rate_control_set_rates(mp
->hw
, mi
->sta
, ratetbl
);
156 * Recalculate success probabilities and counters for a given rate using EWMA
159 minstrel_calc_rate_stats(struct minstrel_rate_stats
*mrs
)
161 if (unlikely(mrs
->attempts
> 0)) {
162 mrs
->sample_skipped
= 0;
163 mrs
->cur_prob
= MINSTREL_FRAC(mrs
->success
, mrs
->attempts
);
164 if (unlikely(!mrs
->att_hist
))
165 mrs
->prob_ewma
= mrs
->cur_prob
;
167 mrs
->prob_ewma
= minstrel_ewma(mrs
->prob_ewma
,
168 mrs
->cur_prob
, EWMA_LEVEL
);
169 mrs
->att_hist
+= mrs
->attempts
;
170 mrs
->succ_hist
+= mrs
->success
;
172 mrs
->sample_skipped
++;
175 mrs
->last_success
= mrs
->success
;
176 mrs
->last_attempts
= mrs
->attempts
;
182 minstrel_update_stats(struct minstrel_priv
*mp
, struct minstrel_sta_info
*mi
)
184 u8 tmp_tp_rate
[MAX_THR_RATES
];
185 u8 tmp_prob_rate
= 0;
186 int i
, tmp_cur_tp
, tmp_prob_tp
;
188 for (i
= 0; i
< MAX_THR_RATES
; i
++)
191 for (i
= 0; i
< mi
->n_rates
; i
++) {
192 struct minstrel_rate
*mr
= &mi
->r
[i
];
193 struct minstrel_rate_stats
*mrs
= &mi
->r
[i
].stats
;
194 struct minstrel_rate_stats
*tmp_mrs
= &mi
->r
[tmp_prob_rate
].stats
;
196 /* Update success probabilities per rate */
197 minstrel_calc_rate_stats(mrs
);
199 /* Sample less often below the 10% chance of success.
200 * Sample less often above the 95% chance of success. */
201 if (mrs
->prob_ewma
> MINSTREL_FRAC(95, 100) ||
202 mrs
->prob_ewma
< MINSTREL_FRAC(10, 100)) {
203 mr
->adjusted_retry_count
= mrs
->retry_count
>> 1;
204 if (mr
->adjusted_retry_count
> 2)
205 mr
->adjusted_retry_count
= 2;
206 mr
->sample_limit
= 4;
208 mr
->sample_limit
= -1;
209 mr
->adjusted_retry_count
= mrs
->retry_count
;
211 if (!mr
->adjusted_retry_count
)
212 mr
->adjusted_retry_count
= 2;
214 minstrel_sort_best_tp_rates(mi
, i
, tmp_tp_rate
);
216 /* To determine the most robust rate (max_prob_rate) used at
217 * 3rd mmr stage we distinct between two cases:
218 * (1) if any success probabilitiy >= 95%, out of those rates
219 * choose the maximum throughput rate as max_prob_rate
220 * (2) if all success probabilities < 95%, the rate with
221 * highest success probability is chosen as max_prob_rate */
222 if (mrs
->prob_ewma
>= MINSTREL_FRAC(95, 100)) {
223 tmp_cur_tp
= minstrel_get_tp_avg(mr
, mrs
->prob_ewma
);
224 tmp_prob_tp
= minstrel_get_tp_avg(&mi
->r
[tmp_prob_rate
],
226 if (tmp_cur_tp
>= tmp_prob_tp
)
229 if (mrs
->prob_ewma
>= tmp_mrs
->prob_ewma
)
234 /* Assign the new rate set */
235 memcpy(mi
->max_tp_rate
, tmp_tp_rate
, sizeof(mi
->max_tp_rate
));
236 mi
->max_prob_rate
= tmp_prob_rate
;
238 #ifdef CONFIG_MAC80211_DEBUGFS
239 /* use fixed index if set */
240 if (mp
->fixed_rate_idx
!= -1) {
241 mi
->max_tp_rate
[0] = mp
->fixed_rate_idx
;
242 mi
->max_tp_rate
[1] = mp
->fixed_rate_idx
;
243 mi
->max_prob_rate
= mp
->fixed_rate_idx
;
247 /* Reset update timer */
248 mi
->last_stats_update
= jiffies
;
250 minstrel_update_rates(mp
, mi
);
254 minstrel_tx_status(void *priv
, struct ieee80211_supported_band
*sband
,
255 struct ieee80211_sta
*sta
, void *priv_sta
,
256 struct ieee80211_tx_info
*info
)
258 struct minstrel_priv
*mp
= priv
;
259 struct minstrel_sta_info
*mi
= priv_sta
;
260 struct ieee80211_tx_rate
*ar
= info
->status
.rates
;
264 success
= !!(info
->flags
& IEEE80211_TX_STAT_ACK
);
266 for (i
= 0; i
< IEEE80211_TX_MAX_RATES
; i
++) {
270 ndx
= rix_to_ndx(mi
, ar
[i
].idx
);
274 mi
->r
[ndx
].stats
.attempts
+= ar
[i
].count
;
276 if ((i
!= IEEE80211_TX_MAX_RATES
- 1) && (ar
[i
+ 1].idx
< 0))
277 mi
->r
[ndx
].stats
.success
+= success
;
280 if ((info
->flags
& IEEE80211_TX_CTL_RATE_CTRL_PROBE
) && (i
>= 0))
281 mi
->sample_packets
++;
283 if (mi
->sample_deferred
> 0)
284 mi
->sample_deferred
--;
286 if (time_after(jiffies
, mi
->last_stats_update
+
287 (mp
->update_interval
* HZ
) / 1000))
288 minstrel_update_stats(mp
, mi
);
292 static inline unsigned int
293 minstrel_get_retry_count(struct minstrel_rate
*mr
,
294 struct ieee80211_tx_info
*info
)
296 u8 retry
= mr
->adjusted_retry_count
;
298 if (info
->control
.use_rts
)
299 retry
= max_t(u8
, 2, min(mr
->stats
.retry_count_rtscts
, retry
));
300 else if (info
->control
.use_cts_prot
)
301 retry
= max_t(u8
, 2, min(mr
->retry_count_cts
, retry
));
307 minstrel_get_next_sample(struct minstrel_sta_info
*mi
)
309 unsigned int sample_ndx
;
310 sample_ndx
= SAMPLE_TBL(mi
, mi
->sample_row
, mi
->sample_column
);
312 if ((int) mi
->sample_row
>= mi
->n_rates
) {
315 if (mi
->sample_column
>= SAMPLE_COLUMNS
)
316 mi
->sample_column
= 0;
322 minstrel_get_rate(void *priv
, struct ieee80211_sta
*sta
,
323 void *priv_sta
, struct ieee80211_tx_rate_control
*txrc
)
325 struct sk_buff
*skb
= txrc
->skb
;
326 struct ieee80211_tx_info
*info
= IEEE80211_SKB_CB(skb
);
327 struct minstrel_sta_info
*mi
= priv_sta
;
328 struct minstrel_priv
*mp
= priv
;
329 struct ieee80211_tx_rate
*rate
= &info
->control
.rates
[0];
330 struct minstrel_rate
*msr
, *mr
;
337 /* management/no-ack frames do not use rate control */
338 if (rate_control_send_low(sta
, priv_sta
, txrc
))
341 /* check multi-rate-retry capabilities & adjust lookaround_rate */
342 mrr_capable
= mp
->has_mrr
&&
344 !txrc
->bss_conf
->use_cts_prot
;
346 sampling_ratio
= mp
->lookaround_rate_mrr
;
348 sampling_ratio
= mp
->lookaround_rate
;
350 /* increase sum packet counter */
353 #ifdef CONFIG_MAC80211_DEBUGFS
354 if (mp
->fixed_rate_idx
!= -1)
358 delta
= (mi
->total_packets
* sampling_ratio
/ 100) -
359 (mi
->sample_packets
+ mi
->sample_deferred
/ 2);
361 /* delta < 0: no sampling required */
362 prev_sample
= mi
->prev_sample
;
363 mi
->prev_sample
= false;
364 if (delta
< 0 || (!mrr_capable
&& prev_sample
))
367 if (mi
->total_packets
>= 10000) {
368 mi
->sample_deferred
= 0;
369 mi
->sample_packets
= 0;
370 mi
->total_packets
= 0;
371 } else if (delta
> mi
->n_rates
* 2) {
372 /* With multi-rate retry, not every planned sample
373 * attempt actually gets used, due to the way the retry
374 * chain is set up - [max_tp,sample,prob,lowest] for
375 * sample_rate < max_tp.
377 * If there's too much sampling backlog and the link
378 * starts getting worse, minstrel would start bursting
379 * out lots of sampling frames, which would result
380 * in a large throughput loss. */
381 mi
->sample_packets
+= (delta
- mi
->n_rates
* 2);
384 /* get next random rate sample */
385 ndx
= minstrel_get_next_sample(mi
);
387 mr
= &mi
->r
[mi
->max_tp_rate
[0]];
389 /* Decide if direct ( 1st mrr stage) or indirect (2nd mrr stage)
390 * rate sampling method should be used.
391 * Respect such rates that are not sampled for 20 interations.
394 msr
->perfect_tx_time
> mr
->perfect_tx_time
&&
395 msr
->stats
.sample_skipped
< 20) {
396 /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
397 * packets that have the sampling rate deferred to the
398 * second MRR stage. Increase the sample counter only
399 * if the deferred sample rate was actually used.
400 * Use the sample_deferred counter to make sure that
401 * the sampling is not done in large bursts */
402 info
->flags
|= IEEE80211_TX_CTL_RATE_CTRL_PROBE
;
404 mi
->sample_deferred
++;
406 if (!msr
->sample_limit
)
409 mi
->sample_packets
++;
410 if (msr
->sample_limit
> 0)
414 /* If we're not using MRR and the sampling rate already
415 * has a probability of >95%, we shouldn't be attempting
416 * to use it, as this only wastes precious airtime */
418 (mi
->r
[ndx
].stats
.prob_ewma
> MINSTREL_FRAC(95, 100)))
421 mi
->prev_sample
= true;
423 rate
->idx
= mi
->r
[ndx
].rix
;
424 rate
->count
= minstrel_get_retry_count(&mi
->r
[ndx
], info
);
429 calc_rate_durations(enum ieee80211_band band
,
430 struct minstrel_rate
*d
,
431 struct ieee80211_rate
*rate
,
432 struct cfg80211_chan_def
*chandef
)
434 int erp
= !!(rate
->flags
& IEEE80211_RATE_ERP_G
);
435 int shift
= ieee80211_chandef_get_shift(chandef
);
437 d
->perfect_tx_time
= ieee80211_frame_duration(band
, 1200,
438 DIV_ROUND_UP(rate
->bitrate
, 1 << shift
), erp
, 1,
440 d
->ack_time
= ieee80211_frame_duration(band
, 10,
441 DIV_ROUND_UP(rate
->bitrate
, 1 << shift
), erp
, 1,
446 init_sample_table(struct minstrel_sta_info
*mi
)
448 unsigned int i
, col
, new_idx
;
451 mi
->sample_column
= 0;
453 memset(mi
->sample_table
, 0xff, SAMPLE_COLUMNS
* mi
->n_rates
);
455 for (col
= 0; col
< SAMPLE_COLUMNS
; col
++) {
456 prandom_bytes(rnd
, sizeof(rnd
));
457 for (i
= 0; i
< mi
->n_rates
; i
++) {
458 new_idx
= (i
+ rnd
[i
& 7]) % mi
->n_rates
;
459 while (SAMPLE_TBL(mi
, new_idx
, col
) != 0xff)
460 new_idx
= (new_idx
+ 1) % mi
->n_rates
;
462 SAMPLE_TBL(mi
, new_idx
, col
) = i
;
468 minstrel_rate_init(void *priv
, struct ieee80211_supported_band
*sband
,
469 struct cfg80211_chan_def
*chandef
,
470 struct ieee80211_sta
*sta
, void *priv_sta
)
472 struct minstrel_sta_info
*mi
= priv_sta
;
473 struct minstrel_priv
*mp
= priv
;
474 struct ieee80211_rate
*ctl_rate
;
475 unsigned int i
, n
= 0;
476 unsigned int t_slot
= 9; /* FIXME: get real slot time */
480 mi
->lowest_rix
= rate_lowest_index(sband
, sta
);
481 ctl_rate
= &sband
->bitrates
[mi
->lowest_rix
];
482 mi
->sp_ack_dur
= ieee80211_frame_duration(sband
->band
, 10,
484 !!(ctl_rate
->flags
& IEEE80211_RATE_ERP_G
), 1,
485 ieee80211_chandef_get_shift(chandef
));
487 rate_flags
= ieee80211_chandef_rate_flags(&mp
->hw
->conf
.chandef
);
488 memset(mi
->max_tp_rate
, 0, sizeof(mi
->max_tp_rate
));
489 mi
->max_prob_rate
= 0;
491 for (i
= 0; i
< sband
->n_bitrates
; i
++) {
492 struct minstrel_rate
*mr
= &mi
->r
[n
];
493 struct minstrel_rate_stats
*mrs
= &mi
->r
[n
].stats
;
494 unsigned int tx_time
= 0, tx_time_cts
= 0, tx_time_rtscts
= 0;
495 unsigned int tx_time_single
;
496 unsigned int cw
= mp
->cw_min
;
499 if (!rate_supported(sta
, sband
->band
, i
))
501 if ((rate_flags
& sband
->bitrates
[i
].flags
) != rate_flags
)
505 memset(mr
, 0, sizeof(*mr
));
506 memset(mrs
, 0, sizeof(*mrs
));
509 shift
= ieee80211_chandef_get_shift(chandef
);
510 mr
->bitrate
= DIV_ROUND_UP(sband
->bitrates
[i
].bitrate
,
512 calc_rate_durations(sband
->band
, mr
, &sband
->bitrates
[i
],
515 /* calculate maximum number of retransmissions before
516 * fallback (based on maximum segment size) */
517 mr
->sample_limit
= -1;
518 mrs
->retry_count
= 1;
519 mr
->retry_count_cts
= 1;
520 mrs
->retry_count_rtscts
= 1;
521 tx_time
= mr
->perfect_tx_time
+ mi
->sp_ack_dur
;
523 /* add one retransmission */
524 tx_time_single
= mr
->ack_time
+ mr
->perfect_tx_time
;
526 /* contention window */
527 tx_time_single
+= (t_slot
* cw
) >> 1;
528 cw
= min((cw
<< 1) | 1, mp
->cw_max
);
530 tx_time
+= tx_time_single
;
531 tx_time_cts
+= tx_time_single
+ mi
->sp_ack_dur
;
532 tx_time_rtscts
+= tx_time_single
+ 2 * mi
->sp_ack_dur
;
533 if ((tx_time_cts
< mp
->segment_size
) &&
534 (mr
->retry_count_cts
< mp
->max_retry
))
535 mr
->retry_count_cts
++;
536 if ((tx_time_rtscts
< mp
->segment_size
) &&
537 (mrs
->retry_count_rtscts
< mp
->max_retry
))
538 mrs
->retry_count_rtscts
++;
539 } while ((tx_time
< mp
->segment_size
) &&
540 (++mr
->stats
.retry_count
< mp
->max_retry
));
541 mr
->adjusted_retry_count
= mrs
->retry_count
;
542 if (!(sband
->bitrates
[i
].flags
& IEEE80211_RATE_ERP_G
))
543 mr
->retry_count_cts
= mrs
->retry_count
;
546 for (i
= n
; i
< sband
->n_bitrates
; i
++) {
547 struct minstrel_rate
*mr
= &mi
->r
[i
];
552 mi
->last_stats_update
= jiffies
;
554 init_sample_table(mi
);
555 minstrel_update_rates(mp
, mi
);
559 minstrel_alloc_sta(void *priv
, struct ieee80211_sta
*sta
, gfp_t gfp
)
561 struct ieee80211_supported_band
*sband
;
562 struct minstrel_sta_info
*mi
;
563 struct minstrel_priv
*mp
= priv
;
564 struct ieee80211_hw
*hw
= mp
->hw
;
568 mi
= kzalloc(sizeof(struct minstrel_sta_info
), gfp
);
572 for (i
= 0; i
< IEEE80211_NUM_BANDS
; i
++) {
573 sband
= hw
->wiphy
->bands
[i
];
574 if (sband
&& sband
->n_bitrates
> max_rates
)
575 max_rates
= sband
->n_bitrates
;
578 mi
->r
= kzalloc(sizeof(struct minstrel_rate
) * max_rates
, gfp
);
582 mi
->sample_table
= kmalloc(SAMPLE_COLUMNS
* max_rates
, gfp
);
583 if (!mi
->sample_table
)
586 mi
->last_stats_update
= jiffies
;
597 minstrel_free_sta(void *priv
, struct ieee80211_sta
*sta
, void *priv_sta
)
599 struct minstrel_sta_info
*mi
= priv_sta
;
601 kfree(mi
->sample_table
);
607 minstrel_init_cck_rates(struct minstrel_priv
*mp
)
609 static const int bitrates
[4] = { 10, 20, 55, 110 };
610 struct ieee80211_supported_band
*sband
;
611 u32 rate_flags
= ieee80211_chandef_rate_flags(&mp
->hw
->conf
.chandef
);
614 sband
= mp
->hw
->wiphy
->bands
[IEEE80211_BAND_2GHZ
];
618 for (i
= 0, j
= 0; i
< sband
->n_bitrates
; i
++) {
619 struct ieee80211_rate
*rate
= &sband
->bitrates
[i
];
621 if (rate
->flags
& IEEE80211_RATE_ERP_G
)
624 if ((rate_flags
& sband
->bitrates
[i
].flags
) != rate_flags
)
627 for (j
= 0; j
< ARRAY_SIZE(bitrates
); j
++) {
628 if (rate
->bitrate
!= bitrates
[j
])
631 mp
->cck_rates
[j
] = i
;
638 minstrel_alloc(struct ieee80211_hw
*hw
, struct dentry
*debugfsdir
)
640 struct minstrel_priv
*mp
;
642 mp
= kzalloc(sizeof(struct minstrel_priv
), GFP_ATOMIC
);
646 /* contention window settings
647 * Just an approximation. Using the per-queue values would complicate
648 * the calculations and is probably unnecessary */
652 /* number of packets (in %) to use for sampling other rates
653 * sample less often for non-mrr packets, because the overhead
654 * is much higher than with mrr */
655 mp
->lookaround_rate
= 5;
656 mp
->lookaround_rate_mrr
= 10;
658 /* maximum time that the hw is allowed to stay in one MRR segment */
659 mp
->segment_size
= 6000;
661 if (hw
->max_rate_tries
> 0)
662 mp
->max_retry
= hw
->max_rate_tries
;
664 /* safe default, does not necessarily have to match hw properties */
667 if (hw
->max_rates
>= 4)
671 mp
->update_interval
= 100;
673 #ifdef CONFIG_MAC80211_DEBUGFS
674 mp
->fixed_rate_idx
= (u32
) -1;
675 mp
->dbg_fixed_rate
= debugfs_create_u32("fixed_rate_idx",
676 S_IRUGO
| S_IWUGO
, debugfsdir
, &mp
->fixed_rate_idx
);
679 minstrel_init_cck_rates(mp
);
685 minstrel_free(void *priv
)
687 #ifdef CONFIG_MAC80211_DEBUGFS
688 debugfs_remove(((struct minstrel_priv
*)priv
)->dbg_fixed_rate
);
693 static u32
minstrel_get_expected_throughput(void *priv_sta
)
695 struct minstrel_sta_info
*mi
= priv_sta
;
696 struct minstrel_rate_stats
*tmp_mrs
;
697 int idx
= mi
->max_tp_rate
[0];
700 /* convert pkt per sec in kbps (1200 is the average pkt size used for
703 tmp_mrs
= &mi
->r
[idx
].stats
;
704 tmp_cur_tp
= minstrel_get_tp_avg(&mi
->r
[idx
], tmp_mrs
->prob_ewma
);
705 tmp_cur_tp
= tmp_cur_tp
* 1200 * 8 / 1024;
710 const struct rate_control_ops mac80211_minstrel
= {
712 .tx_status_noskb
= minstrel_tx_status
,
713 .get_rate
= minstrel_get_rate
,
714 .rate_init
= minstrel_rate_init
,
715 .alloc
= minstrel_alloc
,
716 .free
= minstrel_free
,
717 .alloc_sta
= minstrel_alloc_sta
,
718 .free_sta
= minstrel_free_sta
,
719 #ifdef CONFIG_MAC80211_DEBUGFS
720 .add_sta_debugfs
= minstrel_add_sta_debugfs
,
721 .remove_sta_debugfs
= minstrel_remove_sta_debugfs
,
723 .get_expected_throughput
= minstrel_get_expected_throughput
,
727 rc80211_minstrel_init(void)
729 return ieee80211_rate_control_register(&mac80211_minstrel
);
733 rc80211_minstrel_exit(void)
735 ieee80211_rate_control_unregister(&mac80211_minstrel
);