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