rc80211_minstrel.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747
  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_TBL(_mi, _idx, _col) \
  58. _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
  59. /* convert mac80211 rate index to local array index */
  60. static inline int
  61. rix_to_ndx(struct minstrel_sta_info *mi, int rix)
  62. {
  63. int i = rix;
  64. for (i = rix; i >= 0; i--)
  65. if (mi->r[i].rix == rix)
  66. break;
  67. return i;
  68. }
  69. /* return current EMWA throughput */
  70. int minstrel_get_tp_avg(struct minstrel_rate *mr, int prob_ewma)
  71. {
  72. int usecs;
  73. usecs = mr->perfect_tx_time;
  74. if (!usecs)
  75. usecs = 1000000;
  76. /* reset thr. below 10% success */
  77. if (mr->stats.prob_ewma < MINSTREL_FRAC(10, 100))
  78. return 0;
  79. if (prob_ewma > MINSTREL_FRAC(90, 100))
  80. return MINSTREL_TRUNC(100000 * (MINSTREL_FRAC(90, 100) / usecs));
  81. else
  82. return MINSTREL_TRUNC(100000 * (prob_ewma / usecs));
  83. }
  84. /* find & sort topmost throughput rates */
  85. static inline void
  86. minstrel_sort_best_tp_rates(struct minstrel_sta_info *mi, int i, u8 *tp_list)
  87. {
  88. int j;
  89. struct minstrel_rate_stats *tmp_mrs;
  90. struct minstrel_rate_stats *cur_mrs = &mi->r[i].stats;
  91. for (j = MAX_THR_RATES; j > 0; --j) {
  92. tmp_mrs = &mi->r[tp_list[j - 1]].stats;
  93. if (minstrel_get_tp_avg(&mi->r[i], cur_mrs->prob_ewma) <=
  94. minstrel_get_tp_avg(&mi->r[tp_list[j - 1]], tmp_mrs->prob_ewma))
  95. break;
  96. }
  97. if (j < MAX_THR_RATES - 1)
  98. memmove(&tp_list[j + 1], &tp_list[j], MAX_THR_RATES - (j + 1));
  99. if (j < MAX_THR_RATES)
  100. tp_list[j] = i;
  101. }
  102. static void
  103. minstrel_set_rate(struct minstrel_sta_info *mi, struct ieee80211_sta_rates *ratetbl,
  104. int offset, int idx)
  105. {
  106. struct minstrel_rate *r = &mi->r[idx];
  107. ratetbl->rate[offset].idx = r->rix;
  108. ratetbl->rate[offset].count = r->adjusted_retry_count;
  109. ratetbl->rate[offset].count_cts = r->retry_count_cts;
  110. ratetbl->rate[offset].count_rts = r->stats.retry_count_rtscts;
  111. }
  112. static void
  113. minstrel_update_rates(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
  114. {
  115. struct ieee80211_sta_rates *ratetbl;
  116. int i = 0;
  117. ratetbl = kzalloc(sizeof(*ratetbl), GFP_ATOMIC);
  118. if (!ratetbl)
  119. return;
  120. /* Start with max_tp_rate */
  121. minstrel_set_rate(mi, ratetbl, i++, mi->max_tp_rate[0]);
  122. if (mp->hw->max_rates >= 3) {
  123. /* At least 3 tx rates supported, use max_tp_rate2 next */
  124. minstrel_set_rate(mi, ratetbl, i++, mi->max_tp_rate[1]);
  125. }
  126. if (mp->hw->max_rates >= 2) {
  127. /* At least 2 tx rates supported, use max_prob_rate next */
  128. minstrel_set_rate(mi, ratetbl, i++, mi->max_prob_rate);
  129. }
  130. /* Use lowest rate last */
  131. ratetbl->rate[i].idx = mi->lowest_rix;
  132. ratetbl->rate[i].count = mp->max_retry;
  133. ratetbl->rate[i].count_cts = mp->max_retry;
  134. ratetbl->rate[i].count_rts = mp->max_retry;
  135. rate_control_set_rates(mp->hw, mi->sta, ratetbl);
  136. }
  137. /*
  138. * Recalculate statistics and counters of a given rate
  139. */
  140. void
  141. minstrel_calc_rate_stats(struct minstrel_rate_stats *mrs)
  142. {
  143. if (unlikely(mrs->attempts > 0)) {
  144. mrs->sample_skipped = 0;
  145. mrs->cur_prob = MINSTREL_FRAC(mrs->success, mrs->attempts);
  146. if (unlikely(!mrs->att_hist)) {
  147. mrs->prob_ewma = mrs->cur_prob;
  148. } else {
  149. /* update exponential weighted moving variance */
  150. mrs->prob_ewmsd = minstrel_ewmsd(mrs->prob_ewmsd,
  151. mrs->cur_prob,
  152. mrs->prob_ewma,
  153. EWMA_LEVEL);
  154. /*update exponential weighted moving avarage */
  155. mrs->prob_ewma = minstrel_ewma(mrs->prob_ewma,
  156. mrs->cur_prob,
  157. EWMA_LEVEL);
  158. }
  159. mrs->att_hist += mrs->attempts;
  160. mrs->succ_hist += mrs->success;
  161. } else {
  162. mrs->sample_skipped++;
  163. }
  164. mrs->last_success = mrs->success;
  165. mrs->last_attempts = mrs->attempts;
  166. mrs->success = 0;
  167. mrs->attempts = 0;
  168. }
  169. static void
  170. minstrel_update_stats(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
  171. {
  172. u8 tmp_tp_rate[MAX_THR_RATES];
  173. u8 tmp_prob_rate = 0;
  174. int i, tmp_cur_tp, tmp_prob_tp;
  175. for (i = 0; i < MAX_THR_RATES; i++)
  176. tmp_tp_rate[i] = 0;
  177. for (i = 0; i < mi->n_rates; i++) {
  178. struct minstrel_rate *mr = &mi->r[i];
  179. struct minstrel_rate_stats *mrs = &mi->r[i].stats;
  180. struct minstrel_rate_stats *tmp_mrs = &mi->r[tmp_prob_rate].stats;
  181. /* Update statistics of success probability per rate */
  182. minstrel_calc_rate_stats(mrs);
  183. /* Sample less often below the 10% chance of success.
  184. * Sample less often above the 95% chance of success. */
  185. if (mrs->prob_ewma > MINSTREL_FRAC(95, 100) ||
  186. mrs->prob_ewma < MINSTREL_FRAC(10, 100)) {
  187. mr->adjusted_retry_count = mrs->retry_count >> 1;
  188. if (mr->adjusted_retry_count > 2)
  189. mr->adjusted_retry_count = 2;
  190. mr->sample_limit = 4;
  191. } else {
  192. mr->sample_limit = -1;
  193. mr->adjusted_retry_count = mrs->retry_count;
  194. }
  195. if (!mr->adjusted_retry_count)
  196. mr->adjusted_retry_count = 2;
  197. minstrel_sort_best_tp_rates(mi, i, tmp_tp_rate);
  198. /* To determine the most robust rate (max_prob_rate) used at
  199. * 3rd mmr stage we distinct between two cases:
  200. * (1) if any success probabilitiy >= 95%, out of those rates
  201. * choose the maximum throughput rate as max_prob_rate
  202. * (2) if all success probabilities < 95%, the rate with
  203. * highest success probability is chosen as max_prob_rate */
  204. if (mrs->prob_ewma >= MINSTREL_FRAC(95, 100)) {
  205. tmp_cur_tp = minstrel_get_tp_avg(mr, mrs->prob_ewma);
  206. tmp_prob_tp = minstrel_get_tp_avg(&mi->r[tmp_prob_rate],
  207. tmp_mrs->prob_ewma);
  208. if (tmp_cur_tp >= tmp_prob_tp)
  209. tmp_prob_rate = i;
  210. } else {
  211. if (mrs->prob_ewma >= tmp_mrs->prob_ewma)
  212. tmp_prob_rate = i;
  213. }
  214. }
  215. /* Assign the new rate set */
  216. memcpy(mi->max_tp_rate, tmp_tp_rate, sizeof(mi->max_tp_rate));
  217. mi->max_prob_rate = tmp_prob_rate;
  218. #ifdef CONFIG_MAC80211_DEBUGFS
  219. /* use fixed index if set */
  220. if (mp->fixed_rate_idx != -1) {
  221. mi->max_tp_rate[0] = mp->fixed_rate_idx;
  222. mi->max_tp_rate[1] = mp->fixed_rate_idx;
  223. mi->max_prob_rate = mp->fixed_rate_idx;
  224. }
  225. #endif
  226. /* Reset update timer */
  227. mi->last_stats_update = jiffies;
  228. minstrel_update_rates(mp, mi);
  229. }
  230. static void
  231. minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
  232. struct ieee80211_sta *sta, void *priv_sta,
  233. struct ieee80211_tx_info *info)
  234. {
  235. struct minstrel_priv *mp = priv;
  236. struct minstrel_sta_info *mi = priv_sta;
  237. struct ieee80211_tx_rate *ar = info->status.rates;
  238. int i, ndx;
  239. int success;
  240. success = !!(info->flags & IEEE80211_TX_STAT_ACK);
  241. for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
  242. if (ar[i].idx < 0)
  243. break;
  244. ndx = rix_to_ndx(mi, ar[i].idx);
  245. if (ndx < 0)
  246. continue;
  247. mi->r[ndx].stats.attempts += ar[i].count;
  248. if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
  249. mi->r[ndx].stats.success += success;
  250. }
  251. if ((info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE) && (i >= 0))
  252. mi->sample_packets++;
  253. if (mi->sample_deferred > 0)
  254. mi->sample_deferred--;
  255. if (time_after(jiffies, mi->last_stats_update +
  256. (mp->update_interval * HZ) / 1000))
  257. minstrel_update_stats(mp, mi);
  258. }
  259. static inline unsigned int
  260. minstrel_get_retry_count(struct minstrel_rate *mr,
  261. struct ieee80211_tx_info *info)
  262. {
  263. u8 retry = mr->adjusted_retry_count;
  264. if (info->control.use_rts)
  265. retry = max_t(u8, 2, min(mr->stats.retry_count_rtscts, retry));
  266. else if (info->control.use_cts_prot)
  267. retry = max_t(u8, 2, min(mr->retry_count_cts, retry));
  268. return retry;
  269. }
  270. static int
  271. minstrel_get_next_sample(struct minstrel_sta_info *mi)
  272. {
  273. unsigned int sample_ndx;
  274. sample_ndx = SAMPLE_TBL(mi, mi->sample_row, mi->sample_column);
  275. mi->sample_row++;
  276. if ((int) mi->sample_row >= mi->n_rates) {
  277. mi->sample_row = 0;
  278. mi->sample_column++;
  279. if (mi->sample_column >= SAMPLE_COLUMNS)
  280. mi->sample_column = 0;
  281. }
  282. return sample_ndx;
  283. }
  284. static void
  285. minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
  286. void *priv_sta, struct ieee80211_tx_rate_control *txrc)
  287. {
  288. struct sk_buff *skb = txrc->skb;
  289. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
  290. struct minstrel_sta_info *mi = priv_sta;
  291. struct minstrel_priv *mp = priv;
  292. struct ieee80211_tx_rate *rate = &info->control.rates[0];
  293. struct minstrel_rate *msr, *mr;
  294. unsigned int ndx;
  295. bool mrr_capable;
  296. bool prev_sample;
  297. int delta;
  298. int sampling_ratio;
  299. /* management/no-ack frames do not use rate control */
  300. if (rate_control_send_low(sta, priv_sta, txrc))
  301. return;
  302. /* check multi-rate-retry capabilities & adjust lookaround_rate */
  303. mrr_capable = mp->has_mrr &&
  304. !txrc->rts &&
  305. !txrc->bss_conf->use_cts_prot;
  306. if (mrr_capable)
  307. sampling_ratio = mp->lookaround_rate_mrr;
  308. else
  309. sampling_ratio = mp->lookaround_rate;
  310. /* increase sum packet counter */
  311. mi->total_packets++;
  312. #ifdef CONFIG_MAC80211_DEBUGFS
  313. if (mp->fixed_rate_idx != -1)
  314. return;
  315. #endif
  316. delta = (mi->total_packets * sampling_ratio / 100) -
  317. (mi->sample_packets + mi->sample_deferred / 2);
  318. /* delta < 0: no sampling required */
  319. prev_sample = mi->prev_sample;
  320. mi->prev_sample = false;
  321. if (delta < 0 || (!mrr_capable && prev_sample))
  322. return;
  323. if (mi->total_packets >= 10000) {
  324. mi->sample_deferred = 0;
  325. mi->sample_packets = 0;
  326. mi->total_packets = 0;
  327. } else if (delta > mi->n_rates * 2) {
  328. /* With multi-rate retry, not every planned sample
  329. * attempt actually gets used, due to the way the retry
  330. * chain is set up - [max_tp,sample,prob,lowest] for
  331. * sample_rate < max_tp.
  332. *
  333. * If there's too much sampling backlog and the link
  334. * starts getting worse, minstrel would start bursting
  335. * out lots of sampling frames, which would result
  336. * in a large throughput loss. */
  337. mi->sample_packets += (delta - mi->n_rates * 2);
  338. }
  339. /* get next random rate sample */
  340. ndx = minstrel_get_next_sample(mi);
  341. msr = &mi->r[ndx];
  342. mr = &mi->r[mi->max_tp_rate[0]];
  343. /* Decide if direct ( 1st mrr stage) or indirect (2nd mrr stage)
  344. * rate sampling method should be used.
  345. * Respect such rates that are not sampled for 20 interations.
  346. */
  347. if (mrr_capable &&
  348. msr->perfect_tx_time > mr->perfect_tx_time &&
  349. msr->stats.sample_skipped < 20) {
  350. /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
  351. * packets that have the sampling rate deferred to the
  352. * second MRR stage. Increase the sample counter only
  353. * if the deferred sample rate was actually used.
  354. * Use the sample_deferred counter to make sure that
  355. * the sampling is not done in large bursts */
  356. info->flags |= IEEE80211_TX_CTL_RATE_CTRL_PROBE;
  357. rate++;
  358. mi->sample_deferred++;
  359. } else {
  360. if (!msr->sample_limit)
  361. return;
  362. mi->sample_packets++;
  363. if (msr->sample_limit > 0)
  364. msr->sample_limit--;
  365. }
  366. /* If we're not using MRR and the sampling rate already
  367. * has a probability of >95%, we shouldn't be attempting
  368. * to use it, as this only wastes precious airtime */
  369. if (!mrr_capable &&
  370. (mi->r[ndx].stats.prob_ewma > MINSTREL_FRAC(95, 100)))
  371. return;
  372. mi->prev_sample = true;
  373. rate->idx = mi->r[ndx].rix;
  374. rate->count = minstrel_get_retry_count(&mi->r[ndx], info);
  375. }
  376. static void
  377. calc_rate_durations(enum ieee80211_band band,
  378. struct minstrel_rate *d,
  379. struct ieee80211_rate *rate,
  380. struct cfg80211_chan_def *chandef)
  381. {
  382. int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
  383. int shift = ieee80211_chandef_get_shift(chandef);
  384. d->perfect_tx_time = ieee80211_frame_duration(band, 1200,
  385. DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
  386. shift);
  387. d->ack_time = ieee80211_frame_duration(band, 10,
  388. DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
  389. shift);
  390. }
  391. static void
  392. init_sample_table(struct minstrel_sta_info *mi)
  393. {
  394. unsigned int i, col, new_idx;
  395. u8 rnd[8];
  396. mi->sample_column = 0;
  397. mi->sample_row = 0;
  398. memset(mi->sample_table, 0xff, SAMPLE_COLUMNS * mi->n_rates);
  399. for (col = 0; col < SAMPLE_COLUMNS; col++) {
  400. prandom_bytes(rnd, sizeof(rnd));
  401. for (i = 0; i < mi->n_rates; i++) {
  402. new_idx = (i + rnd[i & 7]) % mi->n_rates;
  403. while (SAMPLE_TBL(mi, new_idx, col) != 0xff)
  404. new_idx = (new_idx + 1) % mi->n_rates;
  405. SAMPLE_TBL(mi, new_idx, col) = i;
  406. }
  407. }
  408. }
  409. static void
  410. minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
  411. struct cfg80211_chan_def *chandef,
  412. struct ieee80211_sta *sta, void *priv_sta)
  413. {
  414. struct minstrel_sta_info *mi = priv_sta;
  415. struct minstrel_priv *mp = priv;
  416. struct ieee80211_rate *ctl_rate;
  417. unsigned int i, n = 0;
  418. unsigned int t_slot = 9; /* FIXME: get real slot time */
  419. u32 rate_flags;
  420. mi->sta = sta;
  421. mi->lowest_rix = rate_lowest_index(sband, sta);
  422. ctl_rate = &sband->bitrates[mi->lowest_rix];
  423. mi->sp_ack_dur = ieee80211_frame_duration(sband->band, 10,
  424. ctl_rate->bitrate,
  425. !!(ctl_rate->flags & IEEE80211_RATE_ERP_G), 1,
  426. ieee80211_chandef_get_shift(chandef));
  427. rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
  428. memset(mi->max_tp_rate, 0, sizeof(mi->max_tp_rate));
  429. mi->max_prob_rate = 0;
  430. for (i = 0; i < sband->n_bitrates; i++) {
  431. struct minstrel_rate *mr = &mi->r[n];
  432. struct minstrel_rate_stats *mrs = &mi->r[n].stats;
  433. unsigned int tx_time = 0, tx_time_cts = 0, tx_time_rtscts = 0;
  434. unsigned int tx_time_single;
  435. unsigned int cw = mp->cw_min;
  436. int shift;
  437. if (!rate_supported(sta, sband->band, i))
  438. continue;
  439. if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
  440. continue;
  441. n++;
  442. memset(mr, 0, sizeof(*mr));
  443. memset(mrs, 0, sizeof(*mrs));
  444. mr->rix = i;
  445. shift = ieee80211_chandef_get_shift(chandef);
  446. mr->bitrate = DIV_ROUND_UP(sband->bitrates[i].bitrate,
  447. (1 << shift) * 5);
  448. calc_rate_durations(sband->band, mr, &sband->bitrates[i],
  449. chandef);
  450. /* calculate maximum number of retransmissions before
  451. * fallback (based on maximum segment size) */
  452. mr->sample_limit = -1;
  453. mrs->retry_count = 1;
  454. mr->retry_count_cts = 1;
  455. mrs->retry_count_rtscts = 1;
  456. tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
  457. do {
  458. /* add one retransmission */
  459. tx_time_single = mr->ack_time + mr->perfect_tx_time;
  460. /* contention window */
  461. tx_time_single += (t_slot * cw) >> 1;
  462. cw = min((cw << 1) | 1, mp->cw_max);
  463. tx_time += tx_time_single;
  464. tx_time_cts += tx_time_single + mi->sp_ack_dur;
  465. tx_time_rtscts += tx_time_single + 2 * mi->sp_ack_dur;
  466. if ((tx_time_cts < mp->segment_size) &&
  467. (mr->retry_count_cts < mp->max_retry))
  468. mr->retry_count_cts++;
  469. if ((tx_time_rtscts < mp->segment_size) &&
  470. (mrs->retry_count_rtscts < mp->max_retry))
  471. mrs->retry_count_rtscts++;
  472. } while ((tx_time < mp->segment_size) &&
  473. (++mr->stats.retry_count < mp->max_retry));
  474. mr->adjusted_retry_count = mrs->retry_count;
  475. if (!(sband->bitrates[i].flags & IEEE80211_RATE_ERP_G))
  476. mr->retry_count_cts = mrs->retry_count;
  477. }
  478. for (i = n; i < sband->n_bitrates; i++) {
  479. struct minstrel_rate *mr = &mi->r[i];
  480. mr->rix = -1;
  481. }
  482. mi->n_rates = n;
  483. mi->last_stats_update = jiffies;
  484. init_sample_table(mi);
  485. minstrel_update_rates(mp, mi);
  486. }
  487. static void *
  488. minstrel_alloc_sta(void *priv, struct ieee80211_sta *sta, gfp_t gfp)
  489. {
  490. struct ieee80211_supported_band *sband;
  491. struct minstrel_sta_info *mi;
  492. struct minstrel_priv *mp = priv;
  493. struct ieee80211_hw *hw = mp->hw;
  494. int max_rates = 0;
  495. int i;
  496. mi = kzalloc(sizeof(struct minstrel_sta_info), gfp);
  497. if (!mi)
  498. return NULL;
  499. for (i = 0; i < IEEE80211_NUM_BANDS; i++) {
  500. sband = hw->wiphy->bands[i];
  501. if (sband && sband->n_bitrates > max_rates)
  502. max_rates = sband->n_bitrates;
  503. }
  504. mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);
  505. if (!mi->r)
  506. goto error;
  507. mi->sample_table = kmalloc(SAMPLE_COLUMNS * max_rates, gfp);
  508. if (!mi->sample_table)
  509. goto error1;
  510. mi->last_stats_update = jiffies;
  511. return mi;
  512. error1:
  513. kfree(mi->r);
  514. error:
  515. kfree(mi);
  516. return NULL;
  517. }
  518. static void
  519. minstrel_free_sta(void *priv, struct ieee80211_sta *sta, void *priv_sta)
  520. {
  521. struct minstrel_sta_info *mi = priv_sta;
  522. kfree(mi->sample_table);
  523. kfree(mi->r);
  524. kfree(mi);
  525. }
  526. static void
  527. minstrel_init_cck_rates(struct minstrel_priv *mp)
  528. {
  529. static const int bitrates[4] = { 10, 20, 55, 110 };
  530. struct ieee80211_supported_band *sband;
  531. u32 rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
  532. int i, j;
  533. sband = mp->hw->wiphy->bands[IEEE80211_BAND_2GHZ];
  534. if (!sband)
  535. return;
  536. for (i = 0, j = 0; i < sband->n_bitrates; i++) {
  537. struct ieee80211_rate *rate = &sband->bitrates[i];
  538. if (rate->flags & IEEE80211_RATE_ERP_G)
  539. continue;
  540. if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
  541. continue;
  542. for (j = 0; j < ARRAY_SIZE(bitrates); j++) {
  543. if (rate->bitrate != bitrates[j])
  544. continue;
  545. mp->cck_rates[j] = i;
  546. break;
  547. }
  548. }
  549. }
  550. static void *
  551. minstrel_alloc(struct ieee80211_hw *hw, struct dentry *debugfsdir)
  552. {
  553. struct minstrel_priv *mp;
  554. mp = kzalloc(sizeof(struct minstrel_priv), GFP_ATOMIC);
  555. if (!mp)
  556. return NULL;
  557. /* contention window settings
  558. * Just an approximation. Using the per-queue values would complicate
  559. * the calculations and is probably unnecessary */
  560. mp->cw_min = 15;
  561. mp->cw_max = 1023;
  562. /* number of packets (in %) to use for sampling other rates
  563. * sample less often for non-mrr packets, because the overhead
  564. * is much higher than with mrr */
  565. mp->lookaround_rate = 5;
  566. mp->lookaround_rate_mrr = 10;
  567. /* maximum time that the hw is allowed to stay in one MRR segment */
  568. mp->segment_size = 6000;
  569. if (hw->max_rate_tries > 0)
  570. mp->max_retry = hw->max_rate_tries;
  571. else
  572. /* safe default, does not necessarily have to match hw properties */
  573. mp->max_retry = 7;
  574. if (hw->max_rates >= 4)
  575. mp->has_mrr = true;
  576. mp->hw = hw;
  577. mp->update_interval = 100;
  578. #ifdef CONFIG_MAC80211_DEBUGFS
  579. mp->fixed_rate_idx = (u32) -1;
  580. mp->dbg_fixed_rate = debugfs_create_u32("fixed_rate_idx",
  581. S_IRUGO | S_IWUGO, debugfsdir, &mp->fixed_rate_idx);
  582. #endif
  583. minstrel_init_cck_rates(mp);
  584. return mp;
  585. }
  586. static void
  587. minstrel_free(void *priv)
  588. {
  589. #ifdef CONFIG_MAC80211_DEBUGFS
  590. debugfs_remove(((struct minstrel_priv *)priv)->dbg_fixed_rate);
  591. #endif
  592. kfree(priv);
  593. }
  594. static u32 minstrel_get_expected_throughput(void *priv_sta)
  595. {
  596. struct minstrel_sta_info *mi = priv_sta;
  597. struct minstrel_rate_stats *tmp_mrs;
  598. int idx = mi->max_tp_rate[0];
  599. int tmp_cur_tp;
  600. /* convert pkt per sec in kbps (1200 is the average pkt size used for
  601. * computing cur_tp
  602. */
  603. tmp_mrs = &mi->r[idx].stats;
  604. tmp_cur_tp = minstrel_get_tp_avg(&mi->r[idx], tmp_mrs->prob_ewma) * 10;
  605. tmp_cur_tp = tmp_cur_tp * 1200 * 8 / 1024;
  606. return tmp_cur_tp;
  607. }
  608. const struct rate_control_ops mac80211_minstrel = {
  609. .name = "minstrel",
  610. .tx_status_noskb = minstrel_tx_status,
  611. .get_rate = minstrel_get_rate,
  612. .rate_init = minstrel_rate_init,
  613. .alloc = minstrel_alloc,
  614. .free = minstrel_free,
  615. .alloc_sta = minstrel_alloc_sta,
  616. .free_sta = minstrel_free_sta,
  617. #ifdef CONFIG_MAC80211_DEBUGFS
  618. .add_sta_debugfs = minstrel_add_sta_debugfs,
  619. .remove_sta_debugfs = minstrel_remove_sta_debugfs,
  620. #endif
  621. .get_expected_throughput = minstrel_get_expected_throughput,
  622. };
  623. int __init
  624. rc80211_minstrel_init(void)
  625. {
  626. return ieee80211_rate_control_register(&mac80211_minstrel);
  627. }
  628. void
  629. rc80211_minstrel_exit(void)
  630. {
  631. ieee80211_rate_control_unregister(&mac80211_minstrel);
  632. }