rc80211_minstrel.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604
  1. /*
  2. * Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
  3. *
  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.
  7. *
  8. * Based on minstrel.c:
  9. * Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
  10. * Sponsored by Indranet Technologies Ltd
  11. *
  12. * Based on sample.c:
  13. * Copyright (c) 2005 John Bicket
  14. * All rights reserved.
  15. *
  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.
  29. *
  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.
  33. *
  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.
  46. */
  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"
  57. #define SAMPLE_COLUMNS 10
  58. #define SAMPLE_TBL(_mi, _idx, _col) \
  59. _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
  60. /* convert mac80211 rate index to local array index */
  61. static inline int
  62. rix_to_ndx(struct minstrel_sta_info *mi, int rix)
  63. {
  64. int i = rix;
  65. for (i = rix; i >= 0; i--)
  66. if (mi->r[i].rix == rix)
  67. break;
  68. return i;
  69. }
  70. static void
  71. minstrel_update_stats(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
  72. {
  73. u32 max_tp = 0, index_max_tp = 0, index_max_tp2 = 0;
  74. u32 max_prob = 0, index_max_prob = 0;
  75. u32 usecs;
  76. int i;
  77. mi->stats_update = jiffies;
  78. for (i = 0; i < mi->n_rates; i++) {
  79. struct minstrel_rate *mr = &mi->r[i];
  80. usecs = mr->perfect_tx_time;
  81. if (!usecs)
  82. usecs = 1000000;
  83. /* To avoid rounding issues, probabilities scale from 0 (0%)
  84. * to 18000 (100%) */
  85. if (mr->attempts) {
  86. mr->cur_prob = (mr->success * 18000) / mr->attempts;
  87. mr->succ_hist += mr->success;
  88. mr->att_hist += mr->attempts;
  89. mr->probability = minstrel_ewma(mr->probability,
  90. mr->cur_prob,
  91. EWMA_LEVEL);
  92. mr->cur_tp = mr->probability * (1000000 / usecs);
  93. }
  94. mr->last_success = mr->success;
  95. mr->last_attempts = mr->attempts;
  96. mr->success = 0;
  97. mr->attempts = 0;
  98. /* Sample less often below the 10% chance of success.
  99. * Sample less often above the 95% chance of success. */
  100. if ((mr->probability > 17100) || (mr->probability < 1800)) {
  101. mr->adjusted_retry_count = mr->retry_count >> 1;
  102. if (mr->adjusted_retry_count > 2)
  103. mr->adjusted_retry_count = 2;
  104. mr->sample_limit = 4;
  105. } else {
  106. mr->sample_limit = -1;
  107. mr->adjusted_retry_count = mr->retry_count;
  108. }
  109. if (!mr->adjusted_retry_count)
  110. mr->adjusted_retry_count = 2;
  111. }
  112. for (i = 0; i < mi->n_rates; i++) {
  113. struct minstrel_rate *mr = &mi->r[i];
  114. if (max_tp < mr->cur_tp) {
  115. index_max_tp = i;
  116. max_tp = mr->cur_tp;
  117. }
  118. if (max_prob < mr->probability) {
  119. index_max_prob = i;
  120. max_prob = mr->probability;
  121. }
  122. }
  123. max_tp = 0;
  124. for (i = 0; i < mi->n_rates; i++) {
  125. struct minstrel_rate *mr = &mi->r[i];
  126. if (i == index_max_tp)
  127. continue;
  128. if (max_tp < mr->cur_tp) {
  129. index_max_tp2 = i;
  130. max_tp = mr->cur_tp;
  131. }
  132. }
  133. mi->max_tp_rate = index_max_tp;
  134. mi->max_tp_rate2 = index_max_tp2;
  135. mi->max_prob_rate = index_max_prob;
  136. }
  137. static void
  138. minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
  139. struct ieee80211_sta *sta, void *priv_sta,
  140. struct sk_buff *skb)
  141. {
  142. struct minstrel_priv *mp = priv;
  143. struct minstrel_sta_info *mi = priv_sta;
  144. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
  145. struct ieee80211_tx_rate *ar = info->status.rates;
  146. int i, ndx;
  147. int success;
  148. success = !!(info->flags & IEEE80211_TX_STAT_ACK);
  149. for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
  150. if (ar[i].idx < 0)
  151. break;
  152. ndx = rix_to_ndx(mi, ar[i].idx);
  153. if (ndx < 0)
  154. continue;
  155. mi->r[ndx].attempts += ar[i].count;
  156. if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
  157. mi->r[ndx].success += success;
  158. }
  159. if ((info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE) && (i >= 0))
  160. mi->sample_count++;
  161. if (mi->sample_deferred > 0)
  162. mi->sample_deferred--;
  163. if (time_after(jiffies, mi->stats_update +
  164. (mp->update_interval * HZ) / 1000))
  165. minstrel_update_stats(mp, mi);
  166. }
  167. static inline unsigned int
  168. minstrel_get_retry_count(struct minstrel_rate *mr,
  169. struct ieee80211_tx_info *info)
  170. {
  171. unsigned int retry = mr->adjusted_retry_count;
  172. if (info->control.rates[0].flags & IEEE80211_TX_RC_USE_RTS_CTS)
  173. retry = max(2U, min(mr->retry_count_rtscts, retry));
  174. else if (info->control.rates[0].flags & IEEE80211_TX_RC_USE_CTS_PROTECT)
  175. retry = max(2U, min(mr->retry_count_cts, retry));
  176. return retry;
  177. }
  178. static int
  179. minstrel_get_next_sample(struct minstrel_sta_info *mi)
  180. {
  181. unsigned int sample_ndx;
  182. sample_ndx = SAMPLE_TBL(mi, mi->sample_idx, mi->sample_column);
  183. mi->sample_idx++;
  184. if ((int) mi->sample_idx > (mi->n_rates - 2)) {
  185. mi->sample_idx = 0;
  186. mi->sample_column++;
  187. if (mi->sample_column >= SAMPLE_COLUMNS)
  188. mi->sample_column = 0;
  189. }
  190. return sample_ndx;
  191. }
  192. static void
  193. minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
  194. void *priv_sta, struct ieee80211_tx_rate_control *txrc)
  195. {
  196. struct sk_buff *skb = txrc->skb;
  197. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
  198. struct minstrel_sta_info *mi = priv_sta;
  199. struct minstrel_priv *mp = priv;
  200. struct ieee80211_tx_rate *ar = info->control.rates;
  201. unsigned int ndx, sample_ndx = 0;
  202. bool mrr;
  203. bool sample_slower = false;
  204. bool sample = false;
  205. int i, delta;
  206. int mrr_ndx[3];
  207. int sample_rate;
  208. if (rate_control_send_low(sta, priv_sta, txrc))
  209. return;
  210. mrr = mp->has_mrr && !txrc->rts && !txrc->bss_conf->use_cts_prot;
  211. ndx = mi->max_tp_rate;
  212. if (mrr)
  213. sample_rate = mp->lookaround_rate_mrr;
  214. else
  215. sample_rate = mp->lookaround_rate;
  216. mi->packet_count++;
  217. delta = (mi->packet_count * sample_rate / 100) -
  218. (mi->sample_count + mi->sample_deferred / 2);
  219. /* delta > 0: sampling required */
  220. if ((delta > 0) && (mrr || !mi->prev_sample)) {
  221. struct minstrel_rate *msr;
  222. if (mi->packet_count >= 10000) {
  223. mi->sample_deferred = 0;
  224. mi->sample_count = 0;
  225. mi->packet_count = 0;
  226. } else if (delta > mi->n_rates * 2) {
  227. /* With multi-rate retry, not every planned sample
  228. * attempt actually gets used, due to the way the retry
  229. * chain is set up - [max_tp,sample,prob,lowest] for
  230. * sample_rate < max_tp.
  231. *
  232. * If there's too much sampling backlog and the link
  233. * starts getting worse, minstrel would start bursting
  234. * out lots of sampling frames, which would result
  235. * in a large throughput loss. */
  236. mi->sample_count += (delta - mi->n_rates * 2);
  237. }
  238. sample_ndx = minstrel_get_next_sample(mi);
  239. msr = &mi->r[sample_ndx];
  240. sample = true;
  241. sample_slower = mrr && (msr->perfect_tx_time >
  242. mi->r[ndx].perfect_tx_time);
  243. if (!sample_slower) {
  244. if (msr->sample_limit != 0) {
  245. ndx = sample_ndx;
  246. mi->sample_count++;
  247. if (msr->sample_limit > 0)
  248. msr->sample_limit--;
  249. } else {
  250. sample = false;
  251. }
  252. } else {
  253. /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
  254. * packets that have the sampling rate deferred to the
  255. * second MRR stage. Increase the sample counter only
  256. * if the deferred sample rate was actually used.
  257. * Use the sample_deferred counter to make sure that
  258. * the sampling is not done in large bursts */
  259. info->flags |= IEEE80211_TX_CTL_RATE_CTRL_PROBE;
  260. mi->sample_deferred++;
  261. }
  262. }
  263. mi->prev_sample = sample;
  264. /* If we're not using MRR and the sampling rate already
  265. * has a probability of >95%, we shouldn't be attempting
  266. * to use it, as this only wastes precious airtime */
  267. if (!mrr && sample && (mi->r[ndx].probability > 17100))
  268. ndx = mi->max_tp_rate;
  269. ar[0].idx = mi->r[ndx].rix;
  270. ar[0].count = minstrel_get_retry_count(&mi->r[ndx], info);
  271. if (!mrr) {
  272. if (!sample)
  273. ar[0].count = mp->max_retry;
  274. ar[1].idx = mi->lowest_rix;
  275. ar[1].count = mp->max_retry;
  276. return;
  277. }
  278. /* MRR setup */
  279. if (sample) {
  280. if (sample_slower)
  281. mrr_ndx[0] = sample_ndx;
  282. else
  283. mrr_ndx[0] = mi->max_tp_rate;
  284. } else {
  285. mrr_ndx[0] = mi->max_tp_rate2;
  286. }
  287. mrr_ndx[1] = mi->max_prob_rate;
  288. mrr_ndx[2] = 0;
  289. for (i = 1; i < 4; i++) {
  290. ar[i].idx = mi->r[mrr_ndx[i - 1]].rix;
  291. ar[i].count = mi->r[mrr_ndx[i - 1]].adjusted_retry_count;
  292. }
  293. }
  294. static void
  295. calc_rate_durations(enum ieee80211_band band,
  296. struct minstrel_rate *d,
  297. struct ieee80211_rate *rate)
  298. {
  299. int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
  300. d->perfect_tx_time = ieee80211_frame_duration(band, 1200,
  301. rate->bitrate, erp, 1);
  302. d->ack_time = ieee80211_frame_duration(band, 10,
  303. rate->bitrate, erp, 1);
  304. }
  305. static void
  306. init_sample_table(struct minstrel_sta_info *mi)
  307. {
  308. unsigned int i, col, new_idx;
  309. unsigned int n_srates = mi->n_rates - 1;
  310. u8 rnd[8];
  311. mi->sample_column = 0;
  312. mi->sample_idx = 0;
  313. memset(mi->sample_table, 0, SAMPLE_COLUMNS * mi->n_rates);
  314. for (col = 0; col < SAMPLE_COLUMNS; col++) {
  315. for (i = 0; i < n_srates; i++) {
  316. get_random_bytes(rnd, sizeof(rnd));
  317. new_idx = (i + rnd[i & 7]) % n_srates;
  318. while (SAMPLE_TBL(mi, new_idx, col) != 0)
  319. new_idx = (new_idx + 1) % n_srates;
  320. /* Don't sample the slowest rate (i.e. slowest base
  321. * rate). We must presume that the slowest rate works
  322. * fine, or else other management frames will also be
  323. * failing and the link will break */
  324. SAMPLE_TBL(mi, new_idx, col) = i + 1;
  325. }
  326. }
  327. }
  328. static void
  329. minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
  330. struct ieee80211_sta *sta, void *priv_sta)
  331. {
  332. struct minstrel_sta_info *mi = priv_sta;
  333. struct minstrel_priv *mp = priv;
  334. struct ieee80211_rate *ctl_rate;
  335. unsigned int i, n = 0;
  336. unsigned int t_slot = 9; /* FIXME: get real slot time */
  337. mi->lowest_rix = rate_lowest_index(sband, sta);
  338. ctl_rate = &sband->bitrates[mi->lowest_rix];
  339. mi->sp_ack_dur = ieee80211_frame_duration(sband->band, 10,
  340. ctl_rate->bitrate,
  341. !!(ctl_rate->flags & IEEE80211_RATE_ERP_G), 1);
  342. for (i = 0; i < sband->n_bitrates; i++) {
  343. struct minstrel_rate *mr = &mi->r[n];
  344. unsigned int tx_time = 0, tx_time_cts = 0, tx_time_rtscts = 0;
  345. unsigned int tx_time_single;
  346. unsigned int cw = mp->cw_min;
  347. if (!rate_supported(sta, sband->band, i))
  348. continue;
  349. n++;
  350. memset(mr, 0, sizeof(*mr));
  351. mr->rix = i;
  352. mr->bitrate = sband->bitrates[i].bitrate / 5;
  353. calc_rate_durations(sband->band, mr, &sband->bitrates[i]);
  354. /* calculate maximum number of retransmissions before
  355. * fallback (based on maximum segment size) */
  356. mr->sample_limit = -1;
  357. mr->retry_count = 1;
  358. mr->retry_count_cts = 1;
  359. mr->retry_count_rtscts = 1;
  360. tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
  361. do {
  362. /* add one retransmission */
  363. tx_time_single = mr->ack_time + mr->perfect_tx_time;
  364. /* contention window */
  365. tx_time_single += (t_slot * cw) >> 1;
  366. cw = min((cw << 1) | 1, mp->cw_max);
  367. tx_time += tx_time_single;
  368. tx_time_cts += tx_time_single + mi->sp_ack_dur;
  369. tx_time_rtscts += tx_time_single + 2 * mi->sp_ack_dur;
  370. if ((tx_time_cts < mp->segment_size) &&
  371. (mr->retry_count_cts < mp->max_retry))
  372. mr->retry_count_cts++;
  373. if ((tx_time_rtscts < mp->segment_size) &&
  374. (mr->retry_count_rtscts < mp->max_retry))
  375. mr->retry_count_rtscts++;
  376. } while ((tx_time < mp->segment_size) &&
  377. (++mr->retry_count < mp->max_retry));
  378. mr->adjusted_retry_count = mr->retry_count;
  379. }
  380. for (i = n; i < sband->n_bitrates; i++) {
  381. struct minstrel_rate *mr = &mi->r[i];
  382. mr->rix = -1;
  383. }
  384. mi->n_rates = n;
  385. mi->stats_update = jiffies;
  386. init_sample_table(mi);
  387. }
  388. static void *
  389. minstrel_alloc_sta(void *priv, struct ieee80211_sta *sta, gfp_t gfp)
  390. {
  391. struct ieee80211_supported_band *sband;
  392. struct minstrel_sta_info *mi;
  393. struct minstrel_priv *mp = priv;
  394. struct ieee80211_hw *hw = mp->hw;
  395. int max_rates = 0;
  396. int i;
  397. mi = kzalloc(sizeof(struct minstrel_sta_info), gfp);
  398. if (!mi)
  399. return NULL;
  400. for (i = 0; i < IEEE80211_NUM_BANDS; i++) {
  401. sband = hw->wiphy->bands[i];
  402. if (sband && sband->n_bitrates > max_rates)
  403. max_rates = sband->n_bitrates;
  404. }
  405. mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);
  406. if (!mi->r)
  407. goto error;
  408. mi->sample_table = kmalloc(SAMPLE_COLUMNS * max_rates, gfp);
  409. if (!mi->sample_table)
  410. goto error1;
  411. mi->stats_update = jiffies;
  412. return mi;
  413. error1:
  414. kfree(mi->r);
  415. error:
  416. kfree(mi);
  417. return NULL;
  418. }
  419. static void
  420. minstrel_free_sta(void *priv, struct ieee80211_sta *sta, void *priv_sta)
  421. {
  422. struct minstrel_sta_info *mi = priv_sta;
  423. kfree(mi->sample_table);
  424. kfree(mi->r);
  425. kfree(mi);
  426. }
  427. static void
  428. minstrel_init_cck_rates(struct minstrel_priv *mp)
  429. {
  430. static const int bitrates[4] = { 10, 20, 55, 110 };
  431. struct ieee80211_supported_band *sband;
  432. int i, j;
  433. sband = mp->hw->wiphy->bands[IEEE80211_BAND_2GHZ];
  434. if (!sband)
  435. return;
  436. for (i = 0, j = 0; i < sband->n_bitrates; i++) {
  437. struct ieee80211_rate *rate = &sband->bitrates[i];
  438. if (rate->flags & IEEE80211_RATE_ERP_G)
  439. continue;
  440. for (j = 0; j < ARRAY_SIZE(bitrates); j++) {
  441. if (rate->bitrate != bitrates[j])
  442. continue;
  443. mp->cck_rates[j] = i;
  444. break;
  445. }
  446. }
  447. }
  448. static void *
  449. minstrel_alloc(struct ieee80211_hw *hw, struct dentry *debugfsdir)
  450. {
  451. struct minstrel_priv *mp;
  452. mp = kzalloc(sizeof(struct minstrel_priv), GFP_ATOMIC);
  453. if (!mp)
  454. return NULL;
  455. /* contention window settings
  456. * Just an approximation. Using the per-queue values would complicate
  457. * the calculations and is probably unnecessary */
  458. mp->cw_min = 15;
  459. mp->cw_max = 1023;
  460. /* number of packets (in %) to use for sampling other rates
  461. * sample less often for non-mrr packets, because the overhead
  462. * is much higher than with mrr */
  463. mp->lookaround_rate = 5;
  464. mp->lookaround_rate_mrr = 10;
  465. /* maximum time that the hw is allowed to stay in one MRR segment */
  466. mp->segment_size = 6000;
  467. if (hw->max_rate_tries > 0)
  468. mp->max_retry = hw->max_rate_tries;
  469. else
  470. /* safe default, does not necessarily have to match hw properties */
  471. mp->max_retry = 7;
  472. if (hw->max_rates >= 4)
  473. mp->has_mrr = true;
  474. mp->hw = hw;
  475. mp->update_interval = 100;
  476. #ifdef CONFIG_MAC80211_DEBUGFS
  477. mp->fixed_rate_idx = (u32) -1;
  478. mp->dbg_fixed_rate = debugfs_create_u32("fixed_rate_idx",
  479. S_IRUGO | S_IWUGO, debugfsdir, &mp->fixed_rate_idx);
  480. #endif
  481. minstrel_init_cck_rates(mp);
  482. return mp;
  483. }
  484. static void
  485. minstrel_free(void *priv)
  486. {
  487. #ifdef CONFIG_MAC80211_DEBUGFS
  488. debugfs_remove(((struct minstrel_priv *)priv)->dbg_fixed_rate);
  489. #endif
  490. kfree(priv);
  491. }
  492. struct rate_control_ops mac80211_minstrel = {
  493. .name = "minstrel",
  494. .tx_status = minstrel_tx_status,
  495. .get_rate = minstrel_get_rate,
  496. .rate_init = minstrel_rate_init,
  497. .alloc = minstrel_alloc,
  498. .free = minstrel_free,
  499. .alloc_sta = minstrel_alloc_sta,
  500. .free_sta = minstrel_free_sta,
  501. #ifdef CONFIG_MAC80211_DEBUGFS
  502. .add_sta_debugfs = minstrel_add_sta_debugfs,
  503. .remove_sta_debugfs = minstrel_remove_sta_debugfs,
  504. #endif
  505. };
  506. int __init
  507. rc80211_minstrel_init(void)
  508. {
  509. return ieee80211_rate_control_register(&mac80211_minstrel);
  510. }
  511. void
  512. rc80211_minstrel_exit(void)
  513. {
  514. ieee80211_rate_control_unregister(&mac80211_minstrel);
  515. }