]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - net/mac80211/rc80211_minstrel.c
mac80211: reduce calculation costs of EWMA
[mirror_ubuntu-artful-kernel.git] / net / mac80211 / rc80211_minstrel.c
CommitLineData
cccf129f
FF
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>
5a0e3ad6 53#include <linux/slab.h>
cccf129f
FF
54#include <net/mac80211.h>
55#include "rate.h"
56#include "rc80211_minstrel.h"
57
cccf129f
FF
58#define SAMPLE_TBL(_mi, _idx, _col) \
59 _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
60
61/* convert mac80211 rate index to local array index */
62static inline int
63rix_to_ndx(struct minstrel_sta_info *mi, int rix)
64{
65 int i = rix;
66 for (i = rix; i >= 0; i--)
67 if (mi->r[i].rix == rix)
68 break;
cccf129f
FF
69 return i;
70}
71
6a27b2c4 72/* return current EMWA throughput */
50e55a8e 73int minstrel_get_tp_avg(struct minstrel_rate *mr, int prob_ewma)
6a27b2c4
TH
74{
75 int usecs;
76
77 usecs = mr->perfect_tx_time;
78 if (!usecs)
79 usecs = 1000000;
80
81 /* reset thr. below 10% success */
82 if (mr->stats.prob_ewma < MINSTREL_FRAC(10, 100))
83 return 0;
50e55a8e
TH
84
85 if (prob_ewma > MINSTREL_FRAC(90, 100))
86 return MINSTREL_TRUNC(100000 * (MINSTREL_FRAC(90, 100) / usecs));
6a27b2c4 87 else
50e55a8e 88 return MINSTREL_TRUNC(100000 * (prob_ewma / usecs));
6a27b2c4
TH
89}
90
2ff2b690
TH
91/* find & sort topmost throughput rates */
92static inline void
93minstrel_sort_best_tp_rates(struct minstrel_sta_info *mi, int i, u8 *tp_list)
94{
95 int j = MAX_THR_RATES;
50e55a8e
TH
96 struct minstrel_rate_stats *tmp_mrs = &mi->r[j - 1].stats;
97 struct minstrel_rate_stats *cur_mrs = &mi->r[i].stats;
2ff2b690 98
50e55a8e
TH
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))) {
2ff2b690 101 j--;
50e55a8e
TH
102 tmp_mrs = &mi->r[tp_list[j - 1]].stats;
103 }
6a27b2c4 104
2ff2b690
TH
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)
108 tp_list[j] = i;
109}
110
06d961a8
FF
111static void
112minstrel_set_rate(struct minstrel_sta_info *mi, struct ieee80211_sta_rates *ratetbl,
113 int offset, int idx)
114{
115 struct minstrel_rate *r = &mi->r[idx];
116
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;
ca12c0c8 120 ratetbl->rate[offset].count_rts = r->stats.retry_count_rtscts;
06d961a8
FF
121}
122
123static void
124minstrel_update_rates(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
125{
126 struct ieee80211_sta_rates *ratetbl;
127 int i = 0;
128
129 ratetbl = kzalloc(sizeof(*ratetbl), GFP_ATOMIC);
130 if (!ratetbl)
131 return;
132
133 /* Start with max_tp_rate */
134 minstrel_set_rate(mi, ratetbl, i++, mi->max_tp_rate[0]);
135
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]);
139 }
140
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);
144 }
145
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;
151
152 rate_control_set_rates(mp->hw, mi->sta, ratetbl);
153}
154
f62838bc
TH
155/*
156* Recalculate success probabilities and counters for a given rate using EWMA
157*/
158void
159minstrel_calc_rate_stats(struct minstrel_rate_stats *mrs)
160{
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))
9134073b 165 mrs->prob_ewma = mrs->cur_prob;
f62838bc 166 else
9134073b 167 mrs->prob_ewma = minstrel_ewma(mrs->prob_ewma,
f62838bc
TH
168 mrs->cur_prob, EWMA_LEVEL);
169 mrs->att_hist += mrs->attempts;
170 mrs->succ_hist += mrs->success;
171 } else {
172 mrs->sample_skipped++;
173 }
174
175 mrs->last_success = mrs->success;
176 mrs->last_attempts = mrs->attempts;
177 mrs->success = 0;
178 mrs->attempts = 0;
179}
180
cccf129f
FF
181static void
182minstrel_update_stats(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
183{
2ff2b690
TH
184 u8 tmp_tp_rate[MAX_THR_RATES];
185 u8 tmp_prob_rate = 0;
6a27b2c4 186 int i, tmp_cur_tp, tmp_prob_tp;
cccf129f 187
f359d3fe 188 for (i = 0; i < MAX_THR_RATES; i++)
2ff2b690
TH
189 tmp_tp_rate[i] = 0;
190
cccf129f
FF
191 for (i = 0; i < mi->n_rates; i++) {
192 struct minstrel_rate *mr = &mi->r[i];
ca12c0c8 193 struct minstrel_rate_stats *mrs = &mi->r[i].stats;
50e55a8e 194 struct minstrel_rate_stats *tmp_mrs = &mi->r[tmp_prob_rate].stats;
cccf129f 195
f62838bc
TH
196 /* Update success probabilities per rate */
197 minstrel_calc_rate_stats(mrs);
cccf129f
FF
198
199 /* Sample less often below the 10% chance of success.
200 * Sample less often above the 95% chance of success. */
9134073b
TH
201 if (mrs->prob_ewma > MINSTREL_FRAC(95, 100) ||
202 mrs->prob_ewma < MINSTREL_FRAC(10, 100)) {
ca12c0c8 203 mr->adjusted_retry_count = mrs->retry_count >> 1;
cccf129f
FF
204 if (mr->adjusted_retry_count > 2)
205 mr->adjusted_retry_count = 2;
f4a8cd94 206 mr->sample_limit = 4;
cccf129f 207 } else {
f4a8cd94 208 mr->sample_limit = -1;
ca12c0c8 209 mr->adjusted_retry_count = mrs->retry_count;
cccf129f
FF
210 }
211 if (!mr->adjusted_retry_count)
212 mr->adjusted_retry_count = 2;
cccf129f 213
2ff2b690
TH
214 minstrel_sort_best_tp_rates(mi, i, tmp_tp_rate);
215
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
d070f913 221 * highest success probability is chosen as max_prob_rate */
9134073b 222 if (mrs->prob_ewma >= MINSTREL_FRAC(95, 100)) {
50e55a8e
TH
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],
225 tmp_mrs->prob_ewma);
6a27b2c4 226 if (tmp_cur_tp >= tmp_prob_tp)
2ff2b690
TH
227 tmp_prob_rate = i;
228 } else {
50e55a8e 229 if (mrs->prob_ewma >= tmp_mrs->prob_ewma)
2ff2b690 230 tmp_prob_rate = i;
cccf129f
FF
231 }
232 }
233
2ff2b690
TH
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;
8f157611 237
45966aeb
LB
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;
244 }
245#endif
246
8f157611 247 /* Reset update timer */
9134073b 248 mi->last_stats_update = jiffies;
06d961a8
FF
249
250 minstrel_update_rates(mp, mi);
cccf129f
FF
251}
252
253static void
254minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
f359d3fe 255 struct ieee80211_sta *sta, void *priv_sta,
fb7acfb8 256 struct ieee80211_tx_info *info)
cccf129f 257{
8acbcddb 258 struct minstrel_priv *mp = priv;
cccf129f 259 struct minstrel_sta_info *mi = priv_sta;
e6a9854b
JB
260 struct ieee80211_tx_rate *ar = info->status.rates;
261 int i, ndx;
262 int success;
cccf129f 263
e6a9854b 264 success = !!(info->flags & IEEE80211_TX_STAT_ACK);
cccf129f 265
e6a9854b
JB
266 for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
267 if (ar[i].idx < 0)
cccf129f
FF
268 break;
269
e6a9854b 270 ndx = rix_to_ndx(mi, ar[i].idx);
3938b45c
LC
271 if (ndx < 0)
272 continue;
273
ca12c0c8 274 mi->r[ndx].stats.attempts += ar[i].count;
cccf129f 275
bfc32e6a 276 if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
ca12c0c8 277 mi->r[ndx].stats.success += success;
cccf129f
FF
278 }
279
280 if ((info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE) && (i >= 0))
ca12c0c8 281 mi->sample_packets++;
cccf129f
FF
282
283 if (mi->sample_deferred > 0)
284 mi->sample_deferred--;
8acbcddb 285
9134073b 286 if (time_after(jiffies, mi->last_stats_update +
8acbcddb
JB
287 (mp->update_interval * HZ) / 1000))
288 minstrel_update_stats(mp, mi);
cccf129f
FF
289}
290
291
292static inline unsigned int
293minstrel_get_retry_count(struct minstrel_rate *mr,
f359d3fe 294 struct ieee80211_tx_info *info)
cccf129f 295{
8d819a92 296 u8 retry = mr->adjusted_retry_count;
cccf129f 297
991fec09 298 if (info->control.use_rts)
8d819a92 299 retry = max_t(u8, 2, min(mr->stats.retry_count_rtscts, retry));
991fec09 300 else if (info->control.use_cts_prot)
8d819a92 301 retry = max_t(u8, 2, min(mr->retry_count_cts, retry));
cccf129f
FF
302 return retry;
303}
304
305
306static int
307minstrel_get_next_sample(struct minstrel_sta_info *mi)
308{
309 unsigned int sample_ndx;
8f157611
TH
310 sample_ndx = SAMPLE_TBL(mi, mi->sample_row, mi->sample_column);
311 mi->sample_row++;
f744bf81 312 if ((int) mi->sample_row >= mi->n_rates) {
8f157611 313 mi->sample_row = 0;
cccf129f
FF
314 mi->sample_column++;
315 if (mi->sample_column >= SAMPLE_COLUMNS)
316 mi->sample_column = 0;
317 }
318 return sample_ndx;
319}
320
2df78167 321static void
e6a9854b
JB
322minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
323 void *priv_sta, struct ieee80211_tx_rate_control *txrc)
cccf129f 324{
e6a9854b 325 struct sk_buff *skb = txrc->skb;
cccf129f
FF
326 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
327 struct minstrel_sta_info *mi = priv_sta;
328 struct minstrel_priv *mp = priv;
06d961a8
FF
329 struct ieee80211_tx_rate *rate = &info->control.rates[0];
330 struct minstrel_rate *msr, *mr;
331 unsigned int ndx;
8f157611 332 bool mrr_capable;
5c9fc93b 333 bool prev_sample;
06d961a8 334 int delta;
8f157611 335 int sampling_ratio;
cccf129f 336
8f157611 337 /* management/no-ack frames do not use rate control */
4c6d4f5c 338 if (rate_control_send_low(sta, priv_sta, txrc))
cccf129f 339 return;
cccf129f 340
8f157611
TH
341 /* check multi-rate-retry capabilities & adjust lookaround_rate */
342 mrr_capable = mp->has_mrr &&
343 !txrc->rts &&
344 !txrc->bss_conf->use_cts_prot;
345 if (mrr_capable)
346 sampling_ratio = mp->lookaround_rate_mrr;
347 else
348 sampling_ratio = mp->lookaround_rate;
cccf129f 349
8f157611 350 /* increase sum packet counter */
ca12c0c8 351 mi->total_packets++;
8f157611 352
45966aeb
LB
353#ifdef CONFIG_MAC80211_DEBUGFS
354 if (mp->fixed_rate_idx != -1)
355 return;
356#endif
357
ca12c0c8
TH
358 delta = (mi->total_packets * sampling_ratio / 100) -
359 (mi->sample_packets + mi->sample_deferred / 2);
cccf129f 360
06d961a8 361 /* delta < 0: no sampling required */
5c9fc93b 362 prev_sample = mi->prev_sample;
06d961a8
FF
363 mi->prev_sample = false;
364 if (delta < 0 || (!mrr_capable && prev_sample))
365 return;
cccf129f 366
ca12c0c8 367 if (mi->total_packets >= 10000) {
06d961a8 368 mi->sample_deferred = 0;
ca12c0c8
TH
369 mi->sample_packets = 0;
370 mi->total_packets = 0;
06d961a8
FF
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.
376 *
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. */
ca12c0c8 381 mi->sample_packets += (delta - mi->n_rates * 2);
06d961a8
FF
382 }
383
384 /* get next random rate sample */
385 ndx = minstrel_get_next_sample(mi);
386 msr = &mi->r[ndx];
387 mr = &mi->r[mi->max_tp_rate[0]];
388
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.
392 */
393 if (mrr_capable &&
394 msr->perfect_tx_time > mr->perfect_tx_time &&
ca12c0c8 395 msr->stats.sample_skipped < 20) {
06d961a8
FF
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;
403 rate++;
404 mi->sample_deferred++;
405 } else {
17dce158 406 if (!msr->sample_limit)
06d961a8
FF
407 return;
408
ca12c0c8 409 mi->sample_packets++;
06d961a8
FF
410 if (msr->sample_limit > 0)
411 msr->sample_limit--;
cccf129f 412 }
f4a8cd94
FF
413
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 */
06d961a8 417 if (!mrr_capable &&
9134073b 418 (mi->r[ndx].stats.prob_ewma > MINSTREL_FRAC(95, 100)))
cccf129f 419 return;
cccf129f 420
06d961a8 421 mi->prev_sample = true;
8f157611 422
06d961a8
FF
423 rate->idx = mi->r[ndx].rix;
424 rate->count = minstrel_get_retry_count(&mi->r[ndx], info);
cccf129f
FF
425}
426
427
428static void
4ee73f33
MK
429calc_rate_durations(enum ieee80211_band band,
430 struct minstrel_rate *d,
438b61b7
SW
431 struct ieee80211_rate *rate,
432 struct cfg80211_chan_def *chandef)
cccf129f
FF
433{
434 int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
438b61b7 435 int shift = ieee80211_chandef_get_shift(chandef);
cccf129f 436
4ee73f33 437 d->perfect_tx_time = ieee80211_frame_duration(band, 1200,
438b61b7
SW
438 DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
439 shift);
4ee73f33 440 d->ack_time = ieee80211_frame_duration(band, 10,
438b61b7
SW
441 DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
442 shift);
cccf129f
FF
443}
444
445static void
446init_sample_table(struct minstrel_sta_info *mi)
447{
448 unsigned int i, col, new_idx;
cccf129f
FF
449 u8 rnd[8];
450
451 mi->sample_column = 0;
8f157611 452 mi->sample_row = 0;
f744bf81 453 memset(mi->sample_table, 0xff, SAMPLE_COLUMNS * mi->n_rates);
cccf129f
FF
454
455 for (col = 0; col < SAMPLE_COLUMNS; col++) {
f7d8ad81 456 prandom_bytes(rnd, sizeof(rnd));
f744bf81 457 for (i = 0; i < mi->n_rates; i++) {
f744bf81 458 new_idx = (i + rnd[i & 7]) % mi->n_rates;
f744bf81
TH
459 while (SAMPLE_TBL(mi, new_idx, col) != 0xff)
460 new_idx = (new_idx + 1) % mi->n_rates;
cccf129f 461
f744bf81 462 SAMPLE_TBL(mi, new_idx, col) = i;
cccf129f
FF
463 }
464 }
465}
466
467static void
468minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
3de805cf
SW
469 struct cfg80211_chan_def *chandef,
470 struct ieee80211_sta *sta, void *priv_sta)
cccf129f
FF
471{
472 struct minstrel_sta_info *mi = priv_sta;
473 struct minstrel_priv *mp = priv;
d57854bb 474 struct ieee80211_rate *ctl_rate;
cccf129f
FF
475 unsigned int i, n = 0;
476 unsigned int t_slot = 9; /* FIXME: get real slot time */
438b61b7 477 u32 rate_flags;
cccf129f 478
06d961a8 479 mi->sta = sta;
cccf129f 480 mi->lowest_rix = rate_lowest_index(sband, sta);
d57854bb 481 ctl_rate = &sband->bitrates[mi->lowest_rix];
4ee73f33
MK
482 mi->sp_ack_dur = ieee80211_frame_duration(sband->band, 10,
483 ctl_rate->bitrate,
438b61b7
SW
484 !!(ctl_rate->flags & IEEE80211_RATE_ERP_G), 1,
485 ieee80211_chandef_get_shift(chandef));
cccf129f 486
438b61b7 487 rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
06d961a8
FF
488 memset(mi->max_tp_rate, 0, sizeof(mi->max_tp_rate));
489 mi->max_prob_rate = 0;
490
cccf129f
FF
491 for (i = 0; i < sband->n_bitrates; i++) {
492 struct minstrel_rate *mr = &mi->r[n];
ca12c0c8 493 struct minstrel_rate_stats *mrs = &mi->r[n].stats;
cccf129f
FF
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;
438b61b7 497 int shift;
cccf129f
FF
498
499 if (!rate_supported(sta, sband->band, i))
500 continue;
438b61b7
SW
501 if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
502 continue;
503
cccf129f
FF
504 n++;
505 memset(mr, 0, sizeof(*mr));
ca12c0c8 506 memset(mrs, 0, sizeof(*mrs));
cccf129f
FF
507
508 mr->rix = i;
438b61b7
SW
509 shift = ieee80211_chandef_get_shift(chandef);
510 mr->bitrate = DIV_ROUND_UP(sband->bitrates[i].bitrate,
511 (1 << shift) * 5);
512 calc_rate_durations(sband->band, mr, &sband->bitrates[i],
513 chandef);
cccf129f
FF
514
515 /* calculate maximum number of retransmissions before
516 * fallback (based on maximum segment size) */
f4a8cd94 517 mr->sample_limit = -1;
ca12c0c8 518 mrs->retry_count = 1;
cccf129f 519 mr->retry_count_cts = 1;
ca12c0c8 520 mrs->retry_count_rtscts = 1;
cccf129f
FF
521 tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
522 do {
523 /* add one retransmission */
524 tx_time_single = mr->ack_time + mr->perfect_tx_time;
525
526 /* contention window */
8fddddff
DH
527 tx_time_single += (t_slot * cw) >> 1;
528 cw = min((cw << 1) | 1, mp->cw_max);
cccf129f
FF
529
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) &&
ca12c0c8
TH
537 (mrs->retry_count_rtscts < mp->max_retry))
538 mrs->retry_count_rtscts++;
cccf129f 539 } while ((tx_time < mp->segment_size) &&
ca12c0c8
TH
540 (++mr->stats.retry_count < mp->max_retry));
541 mr->adjusted_retry_count = mrs->retry_count;
991fec09 542 if (!(sband->bitrates[i].flags & IEEE80211_RATE_ERP_G))
ca12c0c8 543 mr->retry_count_cts = mrs->retry_count;
cccf129f
FF
544 }
545
546 for (i = n; i < sband->n_bitrates; i++) {
547 struct minstrel_rate *mr = &mi->r[i];
548 mr->rix = -1;
549 }
550
551 mi->n_rates = n;
9134073b 552 mi->last_stats_update = jiffies;
cccf129f
FF
553
554 init_sample_table(mi);
06d961a8 555 minstrel_update_rates(mp, mi);
cccf129f
FF
556}
557
558static void *
559minstrel_alloc_sta(void *priv, struct ieee80211_sta *sta, gfp_t gfp)
560{
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;
565 int max_rates = 0;
566 int i;
567
568 mi = kzalloc(sizeof(struct minstrel_sta_info), gfp);
569 if (!mi)
570 return NULL;
571
572 for (i = 0; i < IEEE80211_NUM_BANDS; i++) {
8e532175 573 sband = hw->wiphy->bands[i];
621ad7c9 574 if (sband && sband->n_bitrates > max_rates)
cccf129f
FF
575 max_rates = sband->n_bitrates;
576 }
577
578 mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);
579 if (!mi->r)
580 goto error;
581
582 mi->sample_table = kmalloc(SAMPLE_COLUMNS * max_rates, gfp);
583 if (!mi->sample_table)
584 goto error1;
585
9134073b 586 mi->last_stats_update = jiffies;
cccf129f
FF
587 return mi;
588
589error1:
590 kfree(mi->r);
591error:
592 kfree(mi);
593 return NULL;
594}
595
596static void
597minstrel_free_sta(void *priv, struct ieee80211_sta *sta, void *priv_sta)
598{
599 struct minstrel_sta_info *mi = priv_sta;
600
601 kfree(mi->sample_table);
602 kfree(mi->r);
603 kfree(mi);
604}
605
a0497f9f
FF
606static void
607minstrel_init_cck_rates(struct minstrel_priv *mp)
608{
609 static const int bitrates[4] = { 10, 20, 55, 110 };
610 struct ieee80211_supported_band *sband;
438b61b7 611 u32 rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
a0497f9f
FF
612 int i, j;
613
614 sband = mp->hw->wiphy->bands[IEEE80211_BAND_2GHZ];
615 if (!sband)
616 return;
617
618 for (i = 0, j = 0; i < sband->n_bitrates; i++) {
619 struct ieee80211_rate *rate = &sband->bitrates[i];
620
621 if (rate->flags & IEEE80211_RATE_ERP_G)
622 continue;
623
438b61b7
SW
624 if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
625 continue;
626
a0497f9f
FF
627 for (j = 0; j < ARRAY_SIZE(bitrates); j++) {
628 if (rate->bitrate != bitrates[j])
629 continue;
630
631 mp->cck_rates[j] = i;
632 break;
633 }
634 }
635}
636
cccf129f
FF
637static void *
638minstrel_alloc(struct ieee80211_hw *hw, struct dentry *debugfsdir)
639{
640 struct minstrel_priv *mp;
641
642 mp = kzalloc(sizeof(struct minstrel_priv), GFP_ATOMIC);
643 if (!mp)
644 return NULL;
645
646 /* contention window settings
647 * Just an approximation. Using the per-queue values would complicate
648 * the calculations and is probably unnecessary */
649 mp->cw_min = 15;
650 mp->cw_max = 1023;
651
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;
657
cccf129f
FF
658 /* maximum time that the hw is allowed to stay in one MRR segment */
659 mp->segment_size = 6000;
660
e6a9854b
JB
661 if (hw->max_rate_tries > 0)
662 mp->max_retry = hw->max_rate_tries;
cccf129f
FF
663 else
664 /* safe default, does not necessarily have to match hw properties */
665 mp->max_retry = 7;
666
e6a9854b 667 if (hw->max_rates >= 4)
cccf129f
FF
668 mp->has_mrr = true;
669
670 mp->hw = hw;
671 mp->update_interval = 100;
672
24f7580e
ZK
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);
677#endif
678
a0497f9f
FF
679 minstrel_init_cck_rates(mp);
680
cccf129f
FF
681 return mp;
682}
683
684static void
685minstrel_free(void *priv)
686{
24f7580e
ZK
687#ifdef CONFIG_MAC80211_DEBUGFS
688 debugfs_remove(((struct minstrel_priv *)priv)->dbg_fixed_rate);
689#endif
cccf129f
FF
690 kfree(priv);
691}
692
cca674d4
AQ
693static u32 minstrel_get_expected_throughput(void *priv_sta)
694{
695 struct minstrel_sta_info *mi = priv_sta;
50e55a8e 696 struct minstrel_rate_stats *tmp_mrs;
cca674d4 697 int idx = mi->max_tp_rate[0];
6a27b2c4 698 int tmp_cur_tp;
cca674d4
AQ
699
700 /* convert pkt per sec in kbps (1200 is the average pkt size used for
701 * computing cur_tp
702 */
50e55a8e
TH
703 tmp_mrs = &mi->r[idx].stats;
704 tmp_cur_tp = minstrel_get_tp_avg(&mi->r[idx], tmp_mrs->prob_ewma);
6a27b2c4
TH
705 tmp_cur_tp = tmp_cur_tp * 1200 * 8 / 1024;
706
707 return tmp_cur_tp;
cca674d4
AQ
708}
709
631ad703 710const struct rate_control_ops mac80211_minstrel = {
cccf129f 711 .name = "minstrel",
fb7acfb8 712 .tx_status_noskb = minstrel_tx_status,
cccf129f
FF
713 .get_rate = minstrel_get_rate,
714 .rate_init = minstrel_rate_init,
cccf129f
FF
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,
722#endif
cca674d4 723 .get_expected_throughput = minstrel_get_expected_throughput,
cccf129f
FF
724};
725
726int __init
727rc80211_minstrel_init(void)
728{
729 return ieee80211_rate_control_register(&mac80211_minstrel);
730}
731
732void
733rc80211_minstrel_exit(void)
734{
735 ieee80211_rate_control_unregister(&mac80211_minstrel);
736}
737