checkpatch: if should not continue a preceeding brace
[linux-2.6/mini2440.git] / net / mac80211 / rc80211_minstrel.c
blob2b3b490a6073467755e3b83998d1480398864148
1 /*
2 * Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
8 * Based on minstrel.c:
9 * Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
10 * Sponsored by Indranet Technologies Ltd
12 * Based on sample.c:
13 * Copyright (c) 2005 John Bicket
14 * All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
18 * are met:
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer,
21 * without modification.
22 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
23 * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
24 * redistribution must be conditioned upon including a substantially
25 * similar Disclaimer requirement for further binary redistribution.
26 * 3. Neither the names of the above-listed copyright holders nor the names
27 * of any contributors may be used to endorse or promote products derived
28 * from this software without specific prior written permission.
30 * Alternatively, this software may be distributed under the terms of the
31 * GNU General Public License ("GPL") version 2 as published by the Free
32 * Software Foundation.
34 * NO WARRANTY
35 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
36 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
37 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
38 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
39 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
40 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
41 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
42 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
43 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
44 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
45 * THE POSSIBILITY OF SUCH DAMAGES.
47 #include <linux/netdevice.h>
48 #include <linux/types.h>
49 #include <linux/skbuff.h>
50 #include <linux/debugfs.h>
51 #include <linux/random.h>
52 #include <linux/ieee80211.h>
53 #include <net/mac80211.h>
54 #include "rate.h"
55 #include "rc80211_minstrel.h"
57 #define SAMPLE_COLUMNS 10
58 #define SAMPLE_TBL(_mi, _idx, _col) \
59 _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
61 /* convert mac80211 rate index to local array index */
62 static inline int
63 rix_to_ndx(struct minstrel_sta_info *mi, int rix)
65 int i = rix;
66 for (i = rix; i >= 0; i--)
67 if (mi->r[i].rix == rix)
68 break;
69 WARN_ON(mi->r[i].rix != rix);
70 return i;
73 static inline bool
74 use_low_rate(struct sk_buff *skb)
76 struct ieee80211_hdr *hdr = (struct ieee80211_hdr *) skb->data;
77 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
78 u16 fc;
80 fc = le16_to_cpu(hdr->frame_control);
82 return ((info->flags & IEEE80211_TX_CTL_NO_ACK) ||
83 (fc & IEEE80211_FCTL_FTYPE) != IEEE80211_FTYPE_DATA ||
84 is_multicast_ether_addr(hdr->addr1));
88 static void
89 minstrel_update_stats(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
91 u32 max_tp = 0, index_max_tp = 0, index_max_tp2 = 0;
92 u32 max_prob = 0, index_max_prob = 0;
93 u32 usecs;
94 u32 p;
95 int i;
97 mi->stats_update = jiffies;
98 for (i = 0; i < mi->n_rates; i++) {
99 struct minstrel_rate *mr = &mi->r[i];
101 usecs = mr->perfect_tx_time;
102 if (!usecs)
103 usecs = 1000000;
105 /* To avoid rounding issues, probabilities scale from 0 (0%)
106 * to 18000 (100%) */
107 if (mr->attempts) {
108 p = (mr->success * 18000) / mr->attempts;
109 mr->succ_hist += mr->success;
110 mr->att_hist += mr->attempts;
111 mr->cur_prob = p;
112 p = ((p * (100 - mp->ewma_level)) + (mr->probability *
113 mp->ewma_level)) / 100;
114 mr->probability = p;
115 mr->cur_tp = p * (1000000 / usecs);
118 mr->last_success = mr->success;
119 mr->last_attempts = mr->attempts;
120 mr->success = 0;
121 mr->attempts = 0;
123 /* Sample less often below the 10% chance of success.
124 * Sample less often above the 95% chance of success. */
125 if ((mr->probability > 17100) || (mr->probability < 1800)) {
126 mr->adjusted_retry_count = mr->retry_count >> 1;
127 if (mr->adjusted_retry_count > 2)
128 mr->adjusted_retry_count = 2;
129 mr->sample_limit = 4;
130 } else {
131 mr->sample_limit = -1;
132 mr->adjusted_retry_count = mr->retry_count;
134 if (!mr->adjusted_retry_count)
135 mr->adjusted_retry_count = 2;
138 for (i = 0; i < mi->n_rates; i++) {
139 struct minstrel_rate *mr = &mi->r[i];
140 if (max_tp < mr->cur_tp) {
141 index_max_tp = i;
142 max_tp = mr->cur_tp;
144 if (max_prob < mr->probability) {
145 index_max_prob = i;
146 max_prob = mr->probability;
150 max_tp = 0;
151 for (i = 0; i < mi->n_rates; i++) {
152 struct minstrel_rate *mr = &mi->r[i];
154 if (i == index_max_tp)
155 continue;
157 if (max_tp < mr->cur_tp) {
158 index_max_tp2 = i;
159 max_tp = mr->cur_tp;
162 mi->max_tp_rate = index_max_tp;
163 mi->max_tp_rate2 = index_max_tp2;
164 mi->max_prob_rate = index_max_prob;
167 static void
168 minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
169 struct ieee80211_sta *sta, void *priv_sta,
170 struct sk_buff *skb)
172 struct minstrel_sta_info *mi = priv_sta;
173 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
174 struct ieee80211_tx_rate *ar = info->status.rates;
175 int i, ndx;
176 int success;
178 success = !!(info->flags & IEEE80211_TX_STAT_ACK);
180 for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
181 if (ar[i].idx < 0)
182 break;
184 ndx = rix_to_ndx(mi, ar[i].idx);
185 mi->r[ndx].attempts += ar[i].count;
187 if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
188 mi->r[ndx].success += success;
191 if ((info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE) && (i >= 0))
192 mi->sample_count++;
194 if (mi->sample_deferred > 0)
195 mi->sample_deferred--;
199 static inline unsigned int
200 minstrel_get_retry_count(struct minstrel_rate *mr,
201 struct ieee80211_tx_info *info)
203 unsigned int retry = mr->adjusted_retry_count;
205 if (info->control.rates[0].flags & IEEE80211_TX_RC_USE_RTS_CTS)
206 retry = max(2U, min(mr->retry_count_rtscts, retry));
207 else if (info->control.rates[0].flags & IEEE80211_TX_RC_USE_CTS_PROTECT)
208 retry = max(2U, min(mr->retry_count_cts, retry));
209 return retry;
213 static int
214 minstrel_get_next_sample(struct minstrel_sta_info *mi)
216 unsigned int sample_ndx;
217 sample_ndx = SAMPLE_TBL(mi, mi->sample_idx, mi->sample_column);
218 mi->sample_idx++;
219 if (mi->sample_idx > (mi->n_rates - 2)) {
220 mi->sample_idx = 0;
221 mi->sample_column++;
222 if (mi->sample_column >= SAMPLE_COLUMNS)
223 mi->sample_column = 0;
225 return sample_ndx;
228 static void
229 minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
230 void *priv_sta, struct ieee80211_tx_rate_control *txrc)
232 struct sk_buff *skb = txrc->skb;
233 struct ieee80211_supported_band *sband = txrc->sband;
234 struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
235 struct minstrel_sta_info *mi = priv_sta;
236 struct minstrel_priv *mp = priv;
237 struct ieee80211_tx_rate *ar = info->control.rates;
238 unsigned int ndx, sample_ndx = 0;
239 bool mrr;
240 bool sample_slower = false;
241 bool sample = false;
242 int i, delta;
243 int mrr_ndx[3];
244 int sample_rate;
246 if (!sta || !mi || use_low_rate(skb)) {
247 ar[0].idx = rate_lowest_index(sband, sta);
248 ar[0].count = mp->max_retry;
249 return;
252 mrr = mp->has_mrr && !txrc->rts && !txrc->bss_conf->use_cts_prot;
254 if (time_after(jiffies, mi->stats_update + (mp->update_interval *
255 HZ) / 1000))
256 minstrel_update_stats(mp, mi);
258 ndx = mi->max_tp_rate;
260 if (mrr)
261 sample_rate = mp->lookaround_rate_mrr;
262 else
263 sample_rate = mp->lookaround_rate;
265 mi->packet_count++;
266 delta = (mi->packet_count * sample_rate / 100) -
267 (mi->sample_count + mi->sample_deferred / 2);
269 /* delta > 0: sampling required */
270 if ((delta > 0) && (mrr || !mi->prev_sample)) {
271 struct minstrel_rate *msr;
272 if (mi->packet_count >= 10000) {
273 mi->sample_deferred = 0;
274 mi->sample_count = 0;
275 mi->packet_count = 0;
276 } else if (delta > mi->n_rates * 2) {
277 /* With multi-rate retry, not every planned sample
278 * attempt actually gets used, due to the way the retry
279 * chain is set up - [max_tp,sample,prob,lowest] for
280 * sample_rate < max_tp.
282 * If there's too much sampling backlog and the link
283 * starts getting worse, minstrel would start bursting
284 * out lots of sampling frames, which would result
285 * in a large throughput loss. */
286 mi->sample_count += (delta - mi->n_rates * 2);
289 sample_ndx = minstrel_get_next_sample(mi);
290 msr = &mi->r[sample_ndx];
291 sample = true;
292 sample_slower = mrr && (msr->perfect_tx_time >
293 mi->r[ndx].perfect_tx_time);
295 if (!sample_slower) {
296 if (msr->sample_limit != 0) {
297 ndx = sample_ndx;
298 mi->sample_count++;
299 if (msr->sample_limit > 0)
300 msr->sample_limit--;
301 } else {
302 sample = false;
304 } else {
305 /* Only use IEEE80211_TX_CTL_RATE_CTRL_PROBE to mark
306 * packets that have the sampling rate deferred to the
307 * second MRR stage. Increase the sample counter only
308 * if the deferred sample rate was actually used.
309 * Use the sample_deferred counter to make sure that
310 * the sampling is not done in large bursts */
311 info->flags |= IEEE80211_TX_CTL_RATE_CTRL_PROBE;
312 mi->sample_deferred++;
315 mi->prev_sample = sample;
317 /* If we're not using MRR and the sampling rate already
318 * has a probability of >95%, we shouldn't be attempting
319 * to use it, as this only wastes precious airtime */
320 if (!mrr && sample && (mi->r[ndx].probability > 17100))
321 ndx = mi->max_tp_rate;
323 ar[0].idx = mi->r[ndx].rix;
324 ar[0].count = minstrel_get_retry_count(&mi->r[ndx], info);
326 if (!mrr) {
327 if (!sample)
328 ar[0].count = mp->max_retry;
329 ar[1].idx = mi->lowest_rix;
330 ar[1].count = mp->max_retry;
331 return;
334 /* MRR setup */
335 if (sample) {
336 if (sample_slower)
337 mrr_ndx[0] = sample_ndx;
338 else
339 mrr_ndx[0] = mi->max_tp_rate;
340 } else {
341 mrr_ndx[0] = mi->max_tp_rate2;
343 mrr_ndx[1] = mi->max_prob_rate;
344 mrr_ndx[2] = 0;
345 for (i = 1; i < 4; i++) {
346 ar[i].idx = mi->r[mrr_ndx[i - 1]].rix;
347 ar[i].count = mi->r[mrr_ndx[i - 1]].adjusted_retry_count;
352 static void
353 calc_rate_durations(struct minstrel_sta_info *mi, struct ieee80211_local *local,
354 struct minstrel_rate *d, struct ieee80211_rate *rate)
356 int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
358 d->perfect_tx_time = ieee80211_frame_duration(local, 1200,
359 rate->bitrate, erp, 1);
360 d->ack_time = ieee80211_frame_duration(local, 10,
361 rate->bitrate, erp, 1);
364 static void
365 init_sample_table(struct minstrel_sta_info *mi)
367 unsigned int i, col, new_idx;
368 unsigned int n_srates = mi->n_rates - 1;
369 u8 rnd[8];
371 mi->sample_column = 0;
372 mi->sample_idx = 0;
373 memset(mi->sample_table, 0, SAMPLE_COLUMNS * mi->n_rates);
375 for (col = 0; col < SAMPLE_COLUMNS; col++) {
376 for (i = 0; i < n_srates; i++) {
377 get_random_bytes(rnd, sizeof(rnd));
378 new_idx = (i + rnd[i & 7]) % n_srates;
380 while (SAMPLE_TBL(mi, new_idx, col) != 0)
381 new_idx = (new_idx + 1) % n_srates;
383 /* Don't sample the slowest rate (i.e. slowest base
384 * rate). We must presume that the slowest rate works
385 * fine, or else other management frames will also be
386 * failing and the link will break */
387 SAMPLE_TBL(mi, new_idx, col) = i + 1;
392 static void
393 minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
394 struct ieee80211_sta *sta, void *priv_sta)
396 struct minstrel_sta_info *mi = priv_sta;
397 struct minstrel_priv *mp = priv;
398 struct minstrel_rate *mr_ctl;
399 unsigned int i, n = 0;
400 unsigned int t_slot = 9; /* FIXME: get real slot time */
402 mi->lowest_rix = rate_lowest_index(sband, sta);
403 mr_ctl = &mi->r[rix_to_ndx(mi, mi->lowest_rix)];
404 mi->sp_ack_dur = mr_ctl->ack_time;
406 for (i = 0; i < sband->n_bitrates; i++) {
407 struct minstrel_rate *mr = &mi->r[n];
408 unsigned int tx_time = 0, tx_time_cts = 0, tx_time_rtscts = 0;
409 unsigned int tx_time_single;
410 unsigned int cw = mp->cw_min;
412 if (!rate_supported(sta, sband->band, i))
413 continue;
414 n++;
415 memset(mr, 0, sizeof(*mr));
417 mr->rix = i;
418 mr->bitrate = sband->bitrates[i].bitrate / 5;
419 calc_rate_durations(mi, hw_to_local(mp->hw), mr,
420 &sband->bitrates[i]);
422 /* calculate maximum number of retransmissions before
423 * fallback (based on maximum segment size) */
424 mr->sample_limit = -1;
425 mr->retry_count = 1;
426 mr->retry_count_cts = 1;
427 mr->retry_count_rtscts = 1;
428 tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
429 do {
430 /* add one retransmission */
431 tx_time_single = mr->ack_time + mr->perfect_tx_time;
433 /* contention window */
434 tx_time_single += t_slot + min(cw, mp->cw_max);
435 cw = (cw + 1) << 1;
437 tx_time += tx_time_single;
438 tx_time_cts += tx_time_single + mi->sp_ack_dur;
439 tx_time_rtscts += tx_time_single + 2 * mi->sp_ack_dur;
440 if ((tx_time_cts < mp->segment_size) &&
441 (mr->retry_count_cts < mp->max_retry))
442 mr->retry_count_cts++;
443 if ((tx_time_rtscts < mp->segment_size) &&
444 (mr->retry_count_rtscts < mp->max_retry))
445 mr->retry_count_rtscts++;
446 } while ((tx_time < mp->segment_size) &&
447 (++mr->retry_count < mp->max_retry));
448 mr->adjusted_retry_count = mr->retry_count;
451 for (i = n; i < sband->n_bitrates; i++) {
452 struct minstrel_rate *mr = &mi->r[i];
453 mr->rix = -1;
456 mi->n_rates = n;
457 mi->stats_update = jiffies;
459 init_sample_table(mi);
462 static void *
463 minstrel_alloc_sta(void *priv, struct ieee80211_sta *sta, gfp_t gfp)
465 struct ieee80211_supported_band *sband;
466 struct minstrel_sta_info *mi;
467 struct minstrel_priv *mp = priv;
468 struct ieee80211_hw *hw = mp->hw;
469 int max_rates = 0;
470 int i;
472 mi = kzalloc(sizeof(struct minstrel_sta_info), gfp);
473 if (!mi)
474 return NULL;
476 for (i = 0; i < IEEE80211_NUM_BANDS; i++) {
477 sband = hw->wiphy->bands[hw->conf.channel->band];
478 if (sband->n_bitrates > max_rates)
479 max_rates = sband->n_bitrates;
482 mi->r = kzalloc(sizeof(struct minstrel_rate) * max_rates, gfp);
483 if (!mi->r)
484 goto error;
486 mi->sample_table = kmalloc(SAMPLE_COLUMNS * max_rates, gfp);
487 if (!mi->sample_table)
488 goto error1;
490 mi->stats_update = jiffies;
491 return mi;
493 error1:
494 kfree(mi->r);
495 error:
496 kfree(mi);
497 return NULL;
500 static void
501 minstrel_free_sta(void *priv, struct ieee80211_sta *sta, void *priv_sta)
503 struct minstrel_sta_info *mi = priv_sta;
505 kfree(mi->sample_table);
506 kfree(mi->r);
507 kfree(mi);
510 static void *
511 minstrel_alloc(struct ieee80211_hw *hw, struct dentry *debugfsdir)
513 struct minstrel_priv *mp;
515 mp = kzalloc(sizeof(struct minstrel_priv), GFP_ATOMIC);
516 if (!mp)
517 return NULL;
519 /* contention window settings
520 * Just an approximation. Using the per-queue values would complicate
521 * the calculations and is probably unnecessary */
522 mp->cw_min = 15;
523 mp->cw_max = 1023;
525 /* number of packets (in %) to use for sampling other rates
526 * sample less often for non-mrr packets, because the overhead
527 * is much higher than with mrr */
528 mp->lookaround_rate = 5;
529 mp->lookaround_rate_mrr = 10;
531 /* moving average weight for EWMA */
532 mp->ewma_level = 75;
534 /* maximum time that the hw is allowed to stay in one MRR segment */
535 mp->segment_size = 6000;
537 if (hw->max_rate_tries > 0)
538 mp->max_retry = hw->max_rate_tries;
539 else
540 /* safe default, does not necessarily have to match hw properties */
541 mp->max_retry = 7;
543 if (hw->max_rates >= 4)
544 mp->has_mrr = true;
546 mp->hw = hw;
547 mp->update_interval = 100;
549 return mp;
552 static void
553 minstrel_free(void *priv)
555 kfree(priv);
558 static struct rate_control_ops mac80211_minstrel = {
559 .name = "minstrel",
560 .tx_status = minstrel_tx_status,
561 .get_rate = minstrel_get_rate,
562 .rate_init = minstrel_rate_init,
563 .alloc = minstrel_alloc,
564 .free = minstrel_free,
565 .alloc_sta = minstrel_alloc_sta,
566 .free_sta = minstrel_free_sta,
567 #ifdef CONFIG_MAC80211_DEBUGFS
568 .add_sta_debugfs = minstrel_add_sta_debugfs,
569 .remove_sta_debugfs = minstrel_remove_sta_debugfs,
570 #endif
573 int __init
574 rc80211_minstrel_init(void)
576 return ieee80211_rate_control_register(&mac80211_minstrel);
579 void
580 rc80211_minstrel_exit(void)
582 ieee80211_rate_control_unregister(&mac80211_minstrel);