^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) * Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * This program is free software; you can redistribute it and/or modify
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) * it under the terms of the GNU General Public License version 2 as
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) * published by the Free Software Foundation.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) * Based on minstrel.c:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) * Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) * Sponsored by Indranet Technologies Ltd
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) * Based on sample.c:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) * Copyright (c) 2005 John Bicket
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) * All rights reserved.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) * Redistribution and use in source and binary forms, with or without
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) * modification, are permitted provided that the following conditions
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) * are met:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) * 1. Redistributions of source code must retain the above copyright
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) * notice, this list of conditions and the following disclaimer,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) * without modification.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) * 2. Redistributions in binary form must reproduce at minimum a disclaimer
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) * redistribution must be conditioned upon including a substantially
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) * similar Disclaimer requirement for further binary redistribution.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) * 3. Neither the names of the above-listed copyright holders nor the names
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) * of any contributors may be used to endorse or promote products derived
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) * from this software without specific prior written permission.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) * Alternatively, this software may be distributed under the terms of the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) * GNU General Public License ("GPL") version 2 as published by the Free
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) * Software Foundation.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) * NO WARRANTY
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) * THE POSSIBILITY OF SUCH DAMAGES.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) #include <linux/netdevice.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) #include <linux/types.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) #include <linux/skbuff.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) #include <linux/debugfs.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) #include <linux/random.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) #include <linux/ieee80211.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) #include <net/mac80211.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) #include "rate.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) #include "rc80211_minstrel.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) #define SAMPLE_TBL(_mi, _idx, _col) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) _mi->sample_table[(_idx * SAMPLE_COLUMNS) + _col]
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) /* convert mac80211 rate index to local array index */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) static inline int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) rix_to_ndx(struct minstrel_sta_info *mi, int rix)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) int i = rix;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) for (i = rix; i >= 0; i--)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) if (mi->r[i].rix == rix)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) return i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) /* return current EMWA throughput */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) int minstrel_get_tp_avg(struct minstrel_rate *mr, int prob_avg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) int usecs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) usecs = mr->perfect_tx_time;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) if (!usecs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) usecs = 1000000;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) /* reset thr. below 10% success */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) if (mr->stats.prob_avg < MINSTREL_FRAC(10, 100))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) if (prob_avg > MINSTREL_FRAC(90, 100))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) return MINSTREL_TRUNC(100000 * (MINSTREL_FRAC(90, 100) / usecs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) return MINSTREL_TRUNC(100000 * (prob_avg / usecs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) /* find & sort topmost throughput rates */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) static inline void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) minstrel_sort_best_tp_rates(struct minstrel_sta_info *mi, int i, u8 *tp_list)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) int j;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) struct minstrel_rate_stats *tmp_mrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) struct minstrel_rate_stats *cur_mrs = &mi->r[i].stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) for (j = MAX_THR_RATES; j > 0; --j) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) tmp_mrs = &mi->r[tp_list[j - 1]].stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) if (minstrel_get_tp_avg(&mi->r[i], cur_mrs->prob_avg) <=
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) minstrel_get_tp_avg(&mi->r[tp_list[j - 1]], tmp_mrs->prob_avg))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) if (j < MAX_THR_RATES - 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) memmove(&tp_list[j + 1], &tp_list[j], MAX_THR_RATES - (j + 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) if (j < MAX_THR_RATES)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) tp_list[j] = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) minstrel_set_rate(struct minstrel_sta_info *mi, struct ieee80211_sta_rates *ratetbl,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) int offset, int idx)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) struct minstrel_rate *r = &mi->r[idx];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) ratetbl->rate[offset].idx = r->rix;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) ratetbl->rate[offset].count = r->adjusted_retry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) ratetbl->rate[offset].count_cts = r->retry_count_cts;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) ratetbl->rate[offset].count_rts = r->stats.retry_count_rtscts;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) minstrel_update_rates(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) struct ieee80211_sta_rates *ratetbl;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) int i = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) ratetbl = kzalloc(sizeof(*ratetbl), GFP_ATOMIC);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) if (!ratetbl)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) /* Start with max_tp_rate */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) minstrel_set_rate(mi, ratetbl, i++, mi->max_tp_rate[0]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) if (mp->hw->max_rates >= 3) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) /* At least 3 tx rates supported, use max_tp_rate2 next */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) minstrel_set_rate(mi, ratetbl, i++, mi->max_tp_rate[1]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) if (mp->hw->max_rates >= 2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) /* At least 2 tx rates supported, use max_prob_rate next */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) minstrel_set_rate(mi, ratetbl, i++, mi->max_prob_rate);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) /* Use lowest rate last */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) ratetbl->rate[i].idx = mi->lowest_rix;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) ratetbl->rate[i].count = mp->max_retry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) ratetbl->rate[i].count_cts = mp->max_retry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) ratetbl->rate[i].count_rts = mp->max_retry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) rate_control_set_rates(mp->hw, mi->sta, ratetbl);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) * Recalculate statistics and counters of a given rate
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) minstrel_calc_rate_stats(struct minstrel_priv *mp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) struct minstrel_rate_stats *mrs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) unsigned int cur_prob;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) if (unlikely(mrs->attempts > 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) mrs->sample_skipped = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) cur_prob = MINSTREL_FRAC(mrs->success, mrs->attempts);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) if (mp->new_avg) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) minstrel_filter_avg_add(&mrs->prob_avg,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) &mrs->prob_avg_1, cur_prob);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) } else if (unlikely(!mrs->att_hist)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) mrs->prob_avg = cur_prob;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) /*update exponential weighted moving avarage */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) mrs->prob_avg = minstrel_ewma(mrs->prob_avg,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) cur_prob,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) EWMA_LEVEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) mrs->att_hist += mrs->attempts;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) mrs->succ_hist += mrs->success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) mrs->sample_skipped++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) mrs->last_success = mrs->success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) mrs->last_attempts = mrs->attempts;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) mrs->success = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) mrs->attempts = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) minstrel_update_stats(struct minstrel_priv *mp, struct minstrel_sta_info *mi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) u8 tmp_tp_rate[MAX_THR_RATES];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) u8 tmp_prob_rate = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) int i, tmp_cur_tp, tmp_prob_tp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) for (i = 0; i < MAX_THR_RATES; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) tmp_tp_rate[i] = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) for (i = 0; i < mi->n_rates; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) struct minstrel_rate *mr = &mi->r[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) struct minstrel_rate_stats *mrs = &mi->r[i].stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) struct minstrel_rate_stats *tmp_mrs = &mi->r[tmp_prob_rate].stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) /* Update statistics of success probability per rate */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) minstrel_calc_rate_stats(mp, mrs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) /* Sample less often below the 10% chance of success.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) * Sample less often above the 95% chance of success. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) if (mrs->prob_avg > MINSTREL_FRAC(95, 100) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) mrs->prob_avg < MINSTREL_FRAC(10, 100)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) mr->adjusted_retry_count = mrs->retry_count >> 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) if (mr->adjusted_retry_count > 2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) mr->adjusted_retry_count = 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) mr->sample_limit = 4;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) mr->sample_limit = -1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) mr->adjusted_retry_count = mrs->retry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) if (!mr->adjusted_retry_count)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) mr->adjusted_retry_count = 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) minstrel_sort_best_tp_rates(mi, i, tmp_tp_rate);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) /* To determine the most robust rate (max_prob_rate) used at
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) * 3rd mmr stage we distinct between two cases:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) * (1) if any success probabilitiy >= 95%, out of those rates
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) * choose the maximum throughput rate as max_prob_rate
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) * (2) if all success probabilities < 95%, the rate with
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) * highest success probability is chosen as max_prob_rate */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) if (mrs->prob_avg >= MINSTREL_FRAC(95, 100)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) tmp_cur_tp = minstrel_get_tp_avg(mr, mrs->prob_avg);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) tmp_prob_tp = minstrel_get_tp_avg(&mi->r[tmp_prob_rate],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) tmp_mrs->prob_avg);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) if (tmp_cur_tp >= tmp_prob_tp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) tmp_prob_rate = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) if (mrs->prob_avg >= tmp_mrs->prob_avg)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) tmp_prob_rate = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) /* Assign the new rate set */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) memcpy(mi->max_tp_rate, tmp_tp_rate, sizeof(mi->max_tp_rate));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) mi->max_prob_rate = tmp_prob_rate;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) #ifdef CONFIG_MAC80211_DEBUGFS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) /* use fixed index if set */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) if (mp->fixed_rate_idx != -1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) mi->max_tp_rate[0] = mp->fixed_rate_idx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) mi->max_tp_rate[1] = mp->fixed_rate_idx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) mi->max_prob_rate = mp->fixed_rate_idx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) /* Reset update timer */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) mi->last_stats_update = jiffies;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) minstrel_update_rates(mp, mi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) minstrel_tx_status(void *priv, struct ieee80211_supported_band *sband,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) void *priv_sta, struct ieee80211_tx_status *st)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) struct ieee80211_tx_info *info = st->info;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) struct minstrel_priv *mp = priv;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) struct minstrel_sta_info *mi = priv_sta;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) struct ieee80211_tx_rate *ar = info->status.rates;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) int i, ndx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) int success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) success = !!(info->flags & IEEE80211_TX_STAT_ACK);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) if (ar[i].idx < 0 || !ar[i].count)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) ndx = rix_to_ndx(mi, ar[i].idx);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) if (ndx < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) mi->r[ndx].stats.attempts += ar[i].count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) if ((i != IEEE80211_TX_MAX_RATES - 1) && (ar[i + 1].idx < 0))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) mi->r[ndx].stats.success += success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) if (time_after(jiffies, mi->last_stats_update +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) mp->update_interval / (mp->new_avg ? 2 : 1)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) minstrel_update_stats(mp, mi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) static inline unsigned int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) minstrel_get_retry_count(struct minstrel_rate *mr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) struct ieee80211_tx_info *info)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) u8 retry = mr->adjusted_retry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) if (info->control.use_rts)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) retry = max_t(u8, 2, min(mr->stats.retry_count_rtscts, retry));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) else if (info->control.use_cts_prot)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) retry = max_t(u8, 2, min(mr->retry_count_cts, retry));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) return retry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) static int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) minstrel_get_next_sample(struct minstrel_sta_info *mi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) unsigned int sample_ndx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) sample_ndx = SAMPLE_TBL(mi, mi->sample_row, mi->sample_column);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) mi->sample_row++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) if ((int) mi->sample_row >= mi->n_rates) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317) mi->sample_row = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) mi->sample_column++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) if (mi->sample_column >= SAMPLE_COLUMNS)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) mi->sample_column = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) return sample_ndx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) minstrel_get_rate(void *priv, struct ieee80211_sta *sta,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) void *priv_sta, struct ieee80211_tx_rate_control *txrc)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) struct sk_buff *skb = txrc->skb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) struct minstrel_sta_info *mi = priv_sta;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) struct minstrel_priv *mp = priv;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) struct ieee80211_tx_rate *rate = &info->control.rates[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) struct minstrel_rate *msr, *mr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) unsigned int ndx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) bool mrr_capable;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) bool prev_sample;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) int delta;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) int sampling_ratio;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) /* check multi-rate-retry capabilities & adjust lookaround_rate */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) mrr_capable = mp->has_mrr &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) !txrc->rts &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) !txrc->bss_conf->use_cts_prot;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) if (mrr_capable)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) sampling_ratio = mp->lookaround_rate_mrr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) sampling_ratio = mp->lookaround_rate;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) /* increase sum packet counter */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) mi->total_packets++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) #ifdef CONFIG_MAC80211_DEBUGFS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) if (mp->fixed_rate_idx != -1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) /* Don't use EAPOL frames for sampling on non-mrr hw */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) if (mp->hw->max_rates == 1 &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) (info->control.flags & IEEE80211_TX_CTRL_PORT_CTRL_PROTO))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) delta = (mi->total_packets * sampling_ratio / 100) -
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) mi->sample_packets;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) /* delta < 0: no sampling required */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) prev_sample = mi->prev_sample;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) mi->prev_sample = false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) if (delta < 0 || (!mrr_capable && prev_sample))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) if (mi->total_packets >= 10000) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) mi->sample_packets = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) mi->total_packets = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) } else if (delta > mi->n_rates * 2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) /* With multi-rate retry, not every planned sample
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) * attempt actually gets used, due to the way the retry
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) * chain is set up - [max_tp,sample,prob,lowest] for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) * sample_rate < max_tp.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) * If there's too much sampling backlog and the link
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) * starts getting worse, minstrel would start bursting
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) * out lots of sampling frames, which would result
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) * in a large throughput loss. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) mi->sample_packets += (delta - mi->n_rates * 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) /* get next random rate sample */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) ndx = minstrel_get_next_sample(mi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) msr = &mi->r[ndx];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) mr = &mi->r[mi->max_tp_rate[0]];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) /* Decide if direct ( 1st mrr stage) or indirect (2nd mrr stage)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) * rate sampling method should be used.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) * Respect such rates that are not sampled for 20 interations.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) if (msr->perfect_tx_time < mr->perfect_tx_time ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) msr->stats.sample_skipped >= 20) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) if (!msr->sample_limit)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) mi->sample_packets++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) if (msr->sample_limit > 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) msr->sample_limit--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) /* If we're not using MRR and the sampling rate already
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) * has a probability of >95%, we shouldn't be attempting
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) * to use it, as this only wastes precious airtime */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) if (!mrr_capable &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) (mi->r[ndx].stats.prob_avg > MINSTREL_FRAC(95, 100)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) mi->prev_sample = true;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) rate->idx = mi->r[ndx].rix;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) rate->count = minstrel_get_retry_count(&mi->r[ndx], info);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) info->flags |= IEEE80211_TX_CTL_RATE_CTRL_PROBE;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) calc_rate_durations(enum nl80211_band band,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) struct minstrel_rate *d,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) struct ieee80211_rate *rate,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) struct cfg80211_chan_def *chandef)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) int erp = !!(rate->flags & IEEE80211_RATE_ERP_G);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) int shift = ieee80211_chandef_get_shift(chandef);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) d->perfect_tx_time = ieee80211_frame_duration(band, 1200,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) shift);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) d->ack_time = ieee80211_frame_duration(band, 10,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) DIV_ROUND_UP(rate->bitrate, 1 << shift), erp, 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) shift);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) init_sample_table(struct minstrel_sta_info *mi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) unsigned int i, col, new_idx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) u8 rnd[8];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) mi->sample_column = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) mi->sample_row = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) memset(mi->sample_table, 0xff, SAMPLE_COLUMNS * mi->n_rates);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) for (col = 0; col < SAMPLE_COLUMNS; col++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) prandom_bytes(rnd, sizeof(rnd));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) for (i = 0; i < mi->n_rates; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) new_idx = (i + rnd[i & 7]) % mi->n_rates;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) while (SAMPLE_TBL(mi, new_idx, col) != 0xff)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) new_idx = (new_idx + 1) % mi->n_rates;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) SAMPLE_TBL(mi, new_idx, col) = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) minstrel_rate_init(void *priv, struct ieee80211_supported_band *sband,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) struct cfg80211_chan_def *chandef,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) struct ieee80211_sta *sta, void *priv_sta)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) struct minstrel_sta_info *mi = priv_sta;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) struct minstrel_priv *mp = priv;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) struct ieee80211_rate *ctl_rate;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) unsigned int i, n = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) unsigned int t_slot = 9; /* FIXME: get real slot time */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) u32 rate_flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) mi->sta = sta;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) mi->lowest_rix = rate_lowest_index(sband, sta);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) ctl_rate = &sband->bitrates[mi->lowest_rix];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) mi->sp_ack_dur = ieee80211_frame_duration(sband->band, 10,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) ctl_rate->bitrate,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) !!(ctl_rate->flags & IEEE80211_RATE_ERP_G), 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) ieee80211_chandef_get_shift(chandef));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) rate_flags = ieee80211_chandef_rate_flags(&mp->hw->conf.chandef);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) memset(mi->max_tp_rate, 0, sizeof(mi->max_tp_rate));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) mi->max_prob_rate = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) for (i = 0; i < sband->n_bitrates; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) struct minstrel_rate *mr = &mi->r[n];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) struct minstrel_rate_stats *mrs = &mi->r[n].stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) unsigned int tx_time = 0, tx_time_cts = 0, tx_time_rtscts = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) unsigned int tx_time_single;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) unsigned int cw = mp->cw_min;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) int shift;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) if (!rate_supported(sta, sband->band, i))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) if ((rate_flags & sband->bitrates[i].flags) != rate_flags)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) n++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) memset(mr, 0, sizeof(*mr));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) memset(mrs, 0, sizeof(*mrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) mr->rix = i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) shift = ieee80211_chandef_get_shift(chandef);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) mr->bitrate = DIV_ROUND_UP(sband->bitrates[i].bitrate,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) (1 << shift) * 5);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506) calc_rate_durations(sband->band, mr, &sband->bitrates[i],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) chandef);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) /* calculate maximum number of retransmissions before
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510) * fallback (based on maximum segment size) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) mr->sample_limit = -1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) mrs->retry_count = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513) mr->retry_count_cts = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) mrs->retry_count_rtscts = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) tx_time = mr->perfect_tx_time + mi->sp_ack_dur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) do {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517) /* add one retransmission */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) tx_time_single = mr->ack_time + mr->perfect_tx_time;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) /* contention window */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) tx_time_single += (t_slot * cw) >> 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) cw = min((cw << 1) | 1, mp->cw_max);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) tx_time += tx_time_single;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525) tx_time_cts += tx_time_single + mi->sp_ack_dur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) tx_time_rtscts += tx_time_single + 2 * mi->sp_ack_dur;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527) if ((tx_time_cts < mp->segment_size) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528) (mr->retry_count_cts < mp->max_retry))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529) mr->retry_count_cts++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530) if ((tx_time_rtscts < mp->segment_size) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) (mrs->retry_count_rtscts < mp->max_retry))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) mrs->retry_count_rtscts++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) } while ((tx_time < mp->segment_size) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) (++mr->stats.retry_count < mp->max_retry));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) mr->adjusted_retry_count = mrs->retry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) if (!(sband->bitrates[i].flags & IEEE80211_RATE_ERP_G))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) mr->retry_count_cts = mrs->retry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) for (i = n; i < sband->n_bitrates; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) struct minstrel_rate *mr = &mi->r[i];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542) mr->rix = -1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545) mi->n_rates = n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) mi->last_stats_update = jiffies;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) init_sample_table(mi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549) minstrel_update_rates(mp, mi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552) static u32 minstrel_get_expected_throughput(void *priv_sta)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) struct minstrel_sta_info *mi = priv_sta;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555) struct minstrel_rate_stats *tmp_mrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) int idx = mi->max_tp_rate[0];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) int tmp_cur_tp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) /* convert pkt per sec in kbps (1200 is the average pkt size used for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560) * computing cur_tp
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) tmp_mrs = &mi->r[idx].stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) tmp_cur_tp = minstrel_get_tp_avg(&mi->r[idx], tmp_mrs->prob_avg) * 10;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564) tmp_cur_tp = tmp_cur_tp * 1200 * 8 / 1024;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566) return tmp_cur_tp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569) const struct rate_control_ops mac80211_minstrel = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) .tx_status_ext = minstrel_tx_status,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) .get_rate = minstrel_get_rate,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572) .rate_init = minstrel_rate_init,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) .get_expected_throughput = minstrel_get_expected_throughput,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) };
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags
| Donate