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