Merge tag 'fixes-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/arm...
[linux-2.6.git] / net / mac80211 / rc80211_minstrel.c
blob7fa1b36e620247ed5c14e97d54b2d72d7a0b43cb
1 /*
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.
8 * Based on minstrel.c:
9 * Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
10 * Sponsored by Indranet Technologies Ltd
12 * Based on sample.c:
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
18 * are met:
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.
34 * NO WARRANTY
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>
55 #include "rate.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 */
62 static inline int
63 rix_to_ndx(struct minstrel_sta_info *mi, int rix)
65 int i = rix;
66 for (i = rix; i >= 0; i--)
67 if (mi->r[i].rix == rix)
68 break;
69 return i;
72 /* find & sort topmost throughput rates */
73 static inline void
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)
79 j--;
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)
83 tp_list[j] = i;
86 static void
87 minstrel_set_rate(struct minstrel_sta_info *mi, struct ieee80211_sta_rates *ratetbl,
88 int offset, int idx)
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;
98 static void
99 minstrel_update_rates(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
101 struct ieee80211_sta_rates *ratetbl;
102 int i = 0;
104 ratetbl = kzalloc(sizeof(*ratetbl), GFP_ATOMIC);
105 if (!ratetbl)
106 return;
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);
130 static void
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;
135 u32 usecs;
136 int i;
138 for (i=0; i < MAX_THR_RATES; i++)
139 tmp_tp_rate[i] = 0;
141 for (i = 0; i < mi->n_rates; i++) {
142 struct minstrel_rate *mr = &mi->r[i];
144 usecs = mr->perfect_tx_time;
145 if (!usecs)
146 usecs = 1000000;
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,
154 mr->cur_prob,
155 EWMA_LEVEL);
156 } else
157 mr->sample_skipped++;
159 mr->last_success = mr->success;
160 mr->last_attempts = mr->attempts;
161 mr->success = 0;
162 mr->attempts = 0;
164 /* Update throughput per rate, reset thr. below 10% success */
165 if (mr->probability < MINSTREL_FRAC(10, 100))
166 mr->cur_tp = 0;
167 else
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;
178 } else {
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)
195 tmp_prob_rate = i;
196 } else {
197 if (mr->probability >= mi->r[tmp_prob_rate].probability)
198 tmp_prob_rate = i;
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 #ifdef CONFIG_MAC80211_DEBUGFS
207 /* use fixed index if set */
208 if (mp->fixed_rate_idx != -1) {
209 mi->max_tp_rate[0] = mp->fixed_rate_idx;
210 mi->max_tp_rate[1] = mp->fixed_rate_idx;
211 mi->max_prob_rate = mp->fixed_rate_idx;
213 #endif
215 /* Reset update timer */
216 mi->stats_update = jiffies;
218 minstrel_update_rates(mp, mi);
221 static void
222 minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
223 struct ieee80211_sta *sta, void *priv_sta,
224 struct sk_buff *skb)
226 struct minstrel_priv *mp = priv;
227 struct minstrel_sta_info *mi = priv_sta;
228 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
229 struct ieee80211_tx_rate *ar = info->status.rates;
230 int i, ndx;
231 int success;
233 success = !!(info->flags & IEEE80211_TX_STAT_ACK);
235 for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
236 if (ar[i].idx < 0)
237 break;
239 ndx = rix_to_ndx(mi, ar[i].idx);
240 if (ndx < 0)
241 continue;
243 mi->r[ndx].attempts += ar[i].count;
245 if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
246 mi->r[ndx].success += success;
249 if ((info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE) && (i >= 0))
250 mi->sample_count++;
252 if (mi->sample_deferred > 0)
253 mi->sample_deferred--;
255 if (time_after(jiffies, mi->stats_update +
256 (mp->update_interval * HZ) / 1000))
257 minstrel_update_stats(mp, mi);
261 static inline unsigned int
262 minstrel_get_retry_count(struct minstrel_rate *mr,
263 struct ieee80211_tx_info *info)
265 unsigned int retry = mr->adjusted_retry_count;
267 if (info->control.use_rts)
268 retry = max(2U, min(mr->retry_count_rtscts, retry));
269 else if (info->control.use_cts_prot)
270 retry = max(2U, min(mr->retry_count_cts, retry));
271 return retry;
275 static int
276 minstrel_get_next_sample(struct minstrel_sta_info *mi)
278 unsigned int sample_ndx;
279 sample_ndx = SAMPLE_TBL(mi, mi->sample_row, mi->sample_column);
280 mi->sample_row++;
281 if ((int) mi->sample_row >= mi->n_rates) {
282 mi->sample_row = 0;
283 mi->sample_column++;
284 if (mi->sample_column >= SAMPLE_COLUMNS)
285 mi->sample_column = 0;
287 return sample_ndx;
290 static void
291 minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
292 void *priv_sta, struct ieee80211_tx_rate_control *txrc)
294 struct sk_buff *skb = txrc->skb;
295 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
296 struct minstrel_sta_info *mi = priv_sta;
297 struct minstrel_priv *mp = priv;
298 struct ieee80211_tx_rate *rate = &info->control.rates[0];
299 struct minstrel_rate *msr, *mr;
300 unsigned int ndx;
301 bool mrr_capable;
302 bool prev_sample;
303 int delta;
304 int sampling_ratio;
306 /* management/no-ack frames do not use rate control */
307 if (rate_control_send_low(sta, priv_sta, txrc))
308 return;
310 /* check multi-rate-retry capabilities & adjust lookaround_rate */
311 mrr_capable = mp->has_mrr &&
312 !txrc->rts &&
313 !txrc->bss_conf->use_cts_prot;
314 if (mrr_capable)
315 sampling_ratio = mp->lookaround_rate_mrr;
316 else
317 sampling_ratio = mp->lookaround_rate;
319 /* increase sum packet counter */
320 mi->packet_count++;
322 #ifdef CONFIG_MAC80211_DEBUGFS
323 if (mp->fixed_rate_idx != -1)
324 return;
325 #endif
327 delta = (mi->packet_count * sampling_ratio / 100) -
328 (mi->sample_count + mi->sample_deferred / 2);
330 /* delta < 0: no sampling required */
331 prev_sample = mi->prev_sample;
332 mi->prev_sample = false;
333 if (delta < 0 || (!mrr_capable && prev_sample))
334 return;
336 if (mi->packet_count >= 10000) {
337 mi->sample_deferred = 0;
338 mi->sample_count = 0;
339 mi->packet_count = 0;
340 } else if (delta > mi->n_rates * 2) {
341 /* With multi-rate retry, not every planned sample
342 * attempt actually gets used, due to the way the retry
343 * chain is set up - [max_tp,sample,prob,lowest] for
344 * sample_rate < max_tp.
346 * If there's too much sampling backlog and the link
347 * starts getting worse, minstrel would start bursting
348 * out lots of sampling frames, which would result
349 * in a large throughput loss. */
350 mi->sample_count += (delta - mi->n_rates * 2);
353 /* get next random rate sample */
354 ndx = minstrel_get_next_sample(mi);
355 msr = &mi->r[ndx];
356 mr = &mi->r[mi->max_tp_rate[0]];
358 /* Decide if direct ( 1st mrr stage) or indirect (2nd mrr stage)
359 * rate sampling method should be used.
360 * Respect such rates that are not sampled for 20 interations.
362 if (mrr_capable &&
363 msr->perfect_tx_time > mr->perfect_tx_time &&
364 msr->sample_skipped < 20) {
365 /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
366 * packets that have the sampling rate deferred to the
367 * second MRR stage. Increase the sample counter only
368 * if the deferred sample rate was actually used.
369 * Use the sample_deferred counter to make sure that
370 * the sampling is not done in large bursts */
371 info->flags |= IEEE80211_TX_CTL_RATE_CTRL_PROBE;
372 rate++;
373 mi->sample_deferred++;
374 } else {
375 if (!msr->sample_limit != 0)
376 return;
378 mi->sample_count++;
379 if (msr->sample_limit > 0)
380 msr->sample_limit--;
383 /* If we're not using MRR and the sampling rate already
384 * has a probability of >95%, we shouldn't be attempting
385 * to use it, as this only wastes precious airtime */
386 if (!mrr_capable &&
387 (mi->r[ndx].probability > MINSTREL_FRAC(95, 100)))
388 return;
390 mi->prev_sample = true;
392 rate->idx = mi->r[ndx].rix;
393 rate->count = minstrel_get_retry_count(&mi->r[ndx], info);
397 static void
398 calc_rate_durations(enum ieee80211_band band,
399 struct minstrel_rate *d,
400 struct ieee80211_rate *rate,
401 struct cfg80211_chan_def *chandef)
403 int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
404 int shift = ieee80211_chandef_get_shift(chandef);
406 d->perfect_tx_time = ieee80211_frame_duration(band, 1200,
407 DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
408 shift);
409 d->ack_time = ieee80211_frame_duration(band, 10,
410 DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
411 shift);
414 static void
415 init_sample_table(struct minstrel_sta_info *mi)
417 unsigned int i, col, new_idx;
418 u8 rnd[8];
420 mi->sample_column = 0;
421 mi->sample_row = 0;
422 memset(mi->sample_table, 0xff, SAMPLE_COLUMNS * mi->n_rates);
424 for (col = 0; col < SAMPLE_COLUMNS; col++) {
425 for (i = 0; i < mi->n_rates; i++) {
426 get_random_bytes(rnd, sizeof(rnd));
427 new_idx = (i + rnd[i & 7]) % mi->n_rates;
429 while (SAMPLE_TBL(mi, new_idx, col) != 0xff)
430 new_idx = (new_idx + 1) % mi->n_rates;
432 SAMPLE_TBL(mi, new_idx, col) = i;
437 static void
438 minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
439 struct cfg80211_chan_def *chandef,
440 struct ieee80211_sta *sta, void *priv_sta)
442 struct minstrel_sta_info *mi = priv_sta;
443 struct minstrel_priv *mp = priv;
444 struct ieee80211_rate *ctl_rate;
445 unsigned int i, n = 0;
446 unsigned int t_slot = 9; /* FIXME: get real slot time */
447 u32 rate_flags;
449 mi->sta = sta;
450 mi->lowest_rix = rate_lowest_index(sband, sta);
451 ctl_rate = &sband->bitrates[mi->lowest_rix];
452 mi->sp_ack_dur = ieee80211_frame_duration(sband->band, 10,
453 ctl_rate->bitrate,
454 !!(ctl_rate->flags & IEEE80211_RATE_ERP_G), 1,
455 ieee80211_chandef_get_shift(chandef));
457 rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
458 memset(mi->max_tp_rate, 0, sizeof(mi->max_tp_rate));
459 mi->max_prob_rate = 0;
461 for (i = 0; i < sband->n_bitrates; i++) {
462 struct minstrel_rate *mr = &mi->r[n];
463 unsigned int tx_time = 0, tx_time_cts = 0, tx_time_rtscts = 0;
464 unsigned int tx_time_single;
465 unsigned int cw = mp->cw_min;
466 int shift;
468 if (!rate_supported(sta, sband->band, i))
469 continue;
470 if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
471 continue;
473 n++;
474 memset(mr, 0, sizeof(*mr));
476 mr->rix = i;
477 shift = ieee80211_chandef_get_shift(chandef);
478 mr->bitrate = DIV_ROUND_UP(sband->bitrates[i].bitrate,
479 (1 << shift) * 5);
480 calc_rate_durations(sband->band, mr, &sband->bitrates[i],
481 chandef);
483 /* calculate maximum number of retransmissions before
484 * fallback (based on maximum segment size) */
485 mr->sample_limit = -1;
486 mr->retry_count = 1;
487 mr->retry_count_cts = 1;
488 mr->retry_count_rtscts = 1;
489 tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
490 do {
491 /* add one retransmission */
492 tx_time_single = mr->ack_time + mr->perfect_tx_time;
494 /* contention window */
495 tx_time_single += (t_slot * cw) >> 1;
496 cw = min((cw << 1) | 1, mp->cw_max);
498 tx_time += tx_time_single;
499 tx_time_cts += tx_time_single + mi->sp_ack_dur;
500 tx_time_rtscts += tx_time_single + 2 * mi->sp_ack_dur;
501 if ((tx_time_cts < mp->segment_size) &&
502 (mr->retry_count_cts < mp->max_retry))
503 mr->retry_count_cts++;
504 if ((tx_time_rtscts < mp->segment_size) &&
505 (mr->retry_count_rtscts < mp->max_retry))
506 mr->retry_count_rtscts++;
507 } while ((tx_time < mp->segment_size) &&
508 (++mr->retry_count < mp->max_retry));
509 mr->adjusted_retry_count = mr->retry_count;
510 if (!(sband->bitrates[i].flags & IEEE80211_RATE_ERP_G))
511 mr->retry_count_cts = mr->retry_count;
514 for (i = n; i < sband->n_bitrates; i++) {
515 struct minstrel_rate *mr = &mi->r[i];
516 mr->rix = -1;
519 mi->n_rates = n;
520 mi->stats_update = jiffies;
522 init_sample_table(mi);
523 minstrel_update_rates(mp, mi);
526 static void *
527 minstrel_alloc_sta(void *priv, struct ieee80211_sta *sta, gfp_t gfp)
529 struct ieee80211_supported_band *sband;
530 struct minstrel_sta_info *mi;
531 struct minstrel_priv *mp = priv;
532 struct ieee80211_hw *hw = mp->hw;
533 int max_rates = 0;
534 int i;
536 mi = kzalloc(sizeof(struct minstrel_sta_info), gfp);
537 if (!mi)
538 return NULL;
540 for (i = 0; i < IEEE80211_NUM_BANDS; i++) {
541 sband = hw->wiphy->bands[i];
542 if (sband && sband->n_bitrates > max_rates)
543 max_rates = sband->n_bitrates;
546 mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);
547 if (!mi->r)
548 goto error;
550 mi->sample_table = kmalloc(SAMPLE_COLUMNS * max_rates, gfp);
551 if (!mi->sample_table)
552 goto error1;
554 mi->stats_update = jiffies;
555 return mi;
557 error1:
558 kfree(mi->r);
559 error:
560 kfree(mi);
561 return NULL;
564 static void
565 minstrel_free_sta(void *priv, struct ieee80211_sta *sta, void *priv_sta)
567 struct minstrel_sta_info *mi = priv_sta;
569 kfree(mi->sample_table);
570 kfree(mi->r);
571 kfree(mi);
574 static void
575 minstrel_init_cck_rates(struct minstrel_priv *mp)
577 static const int bitrates[4] = { 10, 20, 55, 110 };
578 struct ieee80211_supported_band *sband;
579 u32 rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
580 int i, j;
582 sband = mp->hw->wiphy->bands[IEEE80211_BAND_2GHZ];
583 if (!sband)
584 return;
586 for (i = 0, j = 0; i < sband->n_bitrates; i++) {
587 struct ieee80211_rate *rate = &sband->bitrates[i];
589 if (rate->flags & IEEE80211_RATE_ERP_G)
590 continue;
592 if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
593 continue;
595 for (j = 0; j < ARRAY_SIZE(bitrates); j++) {
596 if (rate->bitrate != bitrates[j])
597 continue;
599 mp->cck_rates[j] = i;
600 break;
605 static void *
606 minstrel_alloc(struct ieee80211_hw *hw, struct dentry *debugfsdir)
608 struct minstrel_priv *mp;
610 mp = kzalloc(sizeof(struct minstrel_priv), GFP_ATOMIC);
611 if (!mp)
612 return NULL;
614 /* contention window settings
615 * Just an approximation. Using the per-queue values would complicate
616 * the calculations and is probably unnecessary */
617 mp->cw_min = 15;
618 mp->cw_max = 1023;
620 /* number of packets (in %) to use for sampling other rates
621 * sample less often for non-mrr packets, because the overhead
622 * is much higher than with mrr */
623 mp->lookaround_rate = 5;
624 mp->lookaround_rate_mrr = 10;
626 /* maximum time that the hw is allowed to stay in one MRR segment */
627 mp->segment_size = 6000;
629 if (hw->max_rate_tries > 0)
630 mp->max_retry = hw->max_rate_tries;
631 else
632 /* safe default, does not necessarily have to match hw properties */
633 mp->max_retry = 7;
635 if (hw->max_rates >= 4)
636 mp->has_mrr = true;
638 mp->hw = hw;
639 mp->update_interval = 100;
641 #ifdef CONFIG_MAC80211_DEBUGFS
642 mp->fixed_rate_idx = (u32) -1;
643 mp->dbg_fixed_rate = debugfs_create_u32("fixed_rate_idx",
644 S_IRUGO | S_IWUGO, debugfsdir, &mp->fixed_rate_idx);
645 #endif
647 minstrel_init_cck_rates(mp);
649 return mp;
652 static void
653 minstrel_free(void *priv)
655 #ifdef CONFIG_MAC80211_DEBUGFS
656 debugfs_remove(((struct minstrel_priv *)priv)->dbg_fixed_rate);
657 #endif
658 kfree(priv);
661 struct rate_control_ops mac80211_minstrel = {
662 .name = "minstrel",
663 .tx_status = minstrel_tx_status,
664 .get_rate = minstrel_get_rate,
665 .rate_init = minstrel_rate_init,
666 .alloc = minstrel_alloc,
667 .free = minstrel_free,
668 .alloc_sta = minstrel_alloc_sta,
669 .free_sta = minstrel_free_sta,
670 #ifdef CONFIG_MAC80211_DEBUGFS
671 .add_sta_debugfs = minstrel_add_sta_debugfs,
672 .remove_sta_debugfs = minstrel_remove_sta_debugfs,
673 #endif
676 int __init
677 rc80211_minstrel_init(void)
679 return ieee80211_rate_control_register(&mac80211_minstrel);
682 void
683 rc80211_minstrel_exit(void)
685 ieee80211_rate_control_unregister(&mac80211_minstrel);