1*e07d9cb8Szf /*
2*e07d9cb8Szf * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
3*e07d9cb8Szf * Use is subject to license terms.
4*e07d9cb8Szf */
5*e07d9cb8Szf
6*e07d9cb8Szf /*
7*e07d9cb8Szf * Copyright (c) 2003, 2004 David Young. All rights reserved.
8*e07d9cb8Szf *
9*e07d9cb8Szf * Redistribution and use in source and binary forms, with or
10*e07d9cb8Szf * without modification, are permitted provided that the following
11*e07d9cb8Szf * conditions are met:
12*e07d9cb8Szf * 1. Redistributions of source code must retain the above copyright
13*e07d9cb8Szf * notice, this list of conditions and the following disclaimer.
14*e07d9cb8Szf * 2. Redistributions in binary form must reproduce the above
15*e07d9cb8Szf * copyright notice, this list of conditions and the following
16*e07d9cb8Szf * disclaimer in the documentation and/or other materials provided
17*e07d9cb8Szf * with the distribution.
18*e07d9cb8Szf * 3. The name of David Young may not be used to endorse or promote
19*e07d9cb8Szf * products derived from this software without specific prior
20*e07d9cb8Szf * written permission.
21*e07d9cb8Szf *
22*e07d9cb8Szf * THIS SOFTWARE IS PROVIDED BY David Young ``AS IS'' AND ANY
23*e07d9cb8Szf * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
24*e07d9cb8Szf * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
25*e07d9cb8Szf * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL David
26*e07d9cb8Szf * Young BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
27*e07d9cb8Szf * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
28*e07d9cb8Szf * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29*e07d9cb8Szf * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
30*e07d9cb8Szf * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
31*e07d9cb8Szf * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32*e07d9cb8Szf * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
33*e07d9cb8Szf * OF SUCH DAMAGE.
34*e07d9cb8Szf */
35*e07d9cb8Szf
36*e07d9cb8Szf #include <sys/types.h>
37*e07d9cb8Szf #include <sys/byteorder.h>
38*e07d9cb8Szf #include <sys/conf.h>
39*e07d9cb8Szf #include <sys/cmn_err.h>
40*e07d9cb8Szf #include <sys/ddi.h>
41*e07d9cb8Szf #include <sys/sunddi.h>
42*e07d9cb8Szf #include <sys/stream.h>
43*e07d9cb8Szf #include <sys/strsun.h>
44*e07d9cb8Szf #include <sys/modctl.h>
45*e07d9cb8Szf #include <sys/devops.h>
46*e07d9cb8Szf #include <sys/dlpi.h>
47*e07d9cb8Szf #include <sys/gld.h>
48*e07d9cb8Szf #include <sys/varargs.h>
49*e07d9cb8Szf #include <sys/pci.h>
50*e07d9cb8Szf #include <sys/net80211.h>
51*e07d9cb8Szf
52*e07d9cb8Szf #include "ral_rate.h"
53*e07d9cb8Szf
54*e07d9cb8Szf #define MAX(a, b) ((a) > (b) ? (a) : (b))
55*e07d9cb8Szf
56*e07d9cb8Szf #ifdef interpolate
57*e07d9cb8Szf #undef interpolate
58*e07d9cb8Szf #endif
59*e07d9cb8Szf #define interpolate(parm, old, new) \
60*e07d9cb8Szf ((parm##_old * (old) + \
61*e07d9cb8Szf (parm##_denom - parm##_old) * (new)) / \
62*e07d9cb8Szf parm##_denom)
63*e07d9cb8Szf
64*e07d9cb8Szf static struct ral_rssadapt_expavgctl master_expavgctl;
65*e07d9cb8Szf
66*e07d9cb8Szf void
ral_rate_init(void)67*e07d9cb8Szf ral_rate_init(void)
68*e07d9cb8Szf {
69*e07d9cb8Szf master_expavgctl.rc_decay_denom = 16;
70*e07d9cb8Szf master_expavgctl.rc_decay_old = 15;
71*e07d9cb8Szf master_expavgctl.rc_thresh_denom = 8;
72*e07d9cb8Szf master_expavgctl.rc_thresh_old = 4;
73*e07d9cb8Szf master_expavgctl.rc_avgrssi_denom = 8;
74*e07d9cb8Szf master_expavgctl.rc_avgrssi_old = 4;
75*e07d9cb8Szf }
76*e07d9cb8Szf
77*e07d9cb8Szf /* ARGSUSED */
78*e07d9cb8Szf int
ral_rssadapt_choose(struct ral_rssadapt * ra,struct ieee80211_rateset * rs,struct ieee80211_frame * wh,uint32_t len,const char * dvname,int do_not_adapt)79*e07d9cb8Szf ral_rssadapt_choose(struct ral_rssadapt *ra, struct ieee80211_rateset *rs,
80*e07d9cb8Szf struct ieee80211_frame *wh, uint32_t len,
81*e07d9cb8Szf const char *dvname, int do_not_adapt)
82*e07d9cb8Szf {
83*e07d9cb8Szf uint16_t (*thrs)[IEEE80211_RATE_SIZE];
84*e07d9cb8Szf int flags = 0, i, rateidx = 0, thridx, top;
85*e07d9cb8Szf
86*e07d9cb8Szf if ((wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) == IEEE80211_FC0_TYPE_CTL)
87*e07d9cb8Szf flags |= IEEE80211_RATE_BASIC;
88*e07d9cb8Szf
89*e07d9cb8Szf for (i = 0, top = RAL_RSSADAPT_BKT0;
90*e07d9cb8Szf i < RAL_RSSADAPT_BKTS;
91*e07d9cb8Szf i++, top <<= RAL_RSSADAPT_BKTPOWER) {
92*e07d9cb8Szf thridx = i;
93*e07d9cb8Szf if (len <= top)
94*e07d9cb8Szf break;
95*e07d9cb8Szf }
96*e07d9cb8Szf
97*e07d9cb8Szf thrs = &ra->ra_rate_thresh[thridx];
98*e07d9cb8Szf
99*e07d9cb8Szf i = rs->ir_nrates;
100*e07d9cb8Szf while (--i >= 0) {
101*e07d9cb8Szf rateidx = i;
102*e07d9cb8Szf if ((rs->ir_rates[i] & flags) != flags)
103*e07d9cb8Szf continue;
104*e07d9cb8Szf if (do_not_adapt)
105*e07d9cb8Szf break;
106*e07d9cb8Szf if ((*thrs)[i] < ra->ra_avg_rssi)
107*e07d9cb8Szf break;
108*e07d9cb8Szf }
109*e07d9cb8Szf
110*e07d9cb8Szf return (rateidx);
111*e07d9cb8Szf }
112*e07d9cb8Szf
113*e07d9cb8Szf void
ral_rssadapt_updatestats(struct ral_rssadapt * ra)114*e07d9cb8Szf ral_rssadapt_updatestats(struct ral_rssadapt *ra)
115*e07d9cb8Szf {
116*e07d9cb8Szf long interval;
117*e07d9cb8Szf
118*e07d9cb8Szf ra->ra_pktrate =
119*e07d9cb8Szf (ra->ra_pktrate + 10 * (ra->ra_nfail + ra->ra_nok)) / 2;
120*e07d9cb8Szf ra->ra_nfail = ra->ra_nok = 0;
121*e07d9cb8Szf
122*e07d9cb8Szf /*
123*e07d9cb8Szf * a node is eligible for its rate to be raised every 1/10 to 10
124*e07d9cb8Szf * seconds, more eligible in proportion to recent packet rates.
125*e07d9cb8Szf */
126*e07d9cb8Szf interval = MAX(100000, 10000000 / MAX(1, 10 * ra->ra_pktrate));
127*e07d9cb8Szf ra->ra_raise_interval.tv_sec = interval / (1000 * 1000);
128*e07d9cb8Szf ra->ra_raise_interval.tv_usec = interval % (1000 * 1000);
129*e07d9cb8Szf }
130*e07d9cb8Szf
131*e07d9cb8Szf /* ARGSUSED */
132*e07d9cb8Szf void
ral_rssadapt_input(struct ieee80211com * ic,struct ieee80211_node * ni,struct ral_rssadapt * ra,int rssi)133*e07d9cb8Szf ral_rssadapt_input(struct ieee80211com *ic, struct ieee80211_node *ni,
134*e07d9cb8Szf struct ral_rssadapt *ra, int rssi)
135*e07d9cb8Szf {
136*e07d9cb8Szf ra->ra_avg_rssi = interpolate(master_expavgctl.rc_avgrssi,
137*e07d9cb8Szf ra->ra_avg_rssi, (rssi << 8));
138*e07d9cb8Szf }
139*e07d9cb8Szf
140*e07d9cb8Szf /*
141*e07d9cb8Szf * Adapt the data rate to suit the conditions. When a transmitted
142*e07d9cb8Szf * packet is dropped after RAL_RSSADAPT_RETRY_LIMIT retransmissions,
143*e07d9cb8Szf * raise the RSS threshold for transmitting packets of similar length at
144*e07d9cb8Szf * the same data rate.
145*e07d9cb8Szf */
146*e07d9cb8Szf /* ARGSUSED */
147*e07d9cb8Szf void
ral_rssadapt_lower_rate(struct ieee80211com * ic,struct ieee80211_node * ni,struct ral_rssadapt * ra,struct ral_rssdesc * id)148*e07d9cb8Szf ral_rssadapt_lower_rate(struct ieee80211com *ic, struct ieee80211_node *ni,
149*e07d9cb8Szf struct ral_rssadapt *ra, struct ral_rssdesc *id)
150*e07d9cb8Szf {
151*e07d9cb8Szf struct ieee80211_rateset *rs = &ni->in_rates;
152*e07d9cb8Szf uint16_t last_thr;
153*e07d9cb8Szf uint32_t i, thridx, top;
154*e07d9cb8Szf
155*e07d9cb8Szf ra->ra_nfail++;
156*e07d9cb8Szf
157*e07d9cb8Szf if (id->id_rateidx >= rs->ir_nrates)
158*e07d9cb8Szf return;
159*e07d9cb8Szf
160*e07d9cb8Szf for (i = 0, top = RAL_RSSADAPT_BKT0;
161*e07d9cb8Szf i < RAL_RSSADAPT_BKTS;
162*e07d9cb8Szf i++, top <<= RAL_RSSADAPT_BKTPOWER) {
163*e07d9cb8Szf thridx = i;
164*e07d9cb8Szf if (id->id_len <= top)
165*e07d9cb8Szf break;
166*e07d9cb8Szf }
167*e07d9cb8Szf
168*e07d9cb8Szf last_thr = ra->ra_rate_thresh[thridx][id->id_rateidx];
169*e07d9cb8Szf ra->ra_rate_thresh[thridx][id->id_rateidx] =
170*e07d9cb8Szf interpolate(master_expavgctl.rc_thresh, last_thr,
171*e07d9cb8Szf (id->id_rssi << 8));
172*e07d9cb8Szf }
173*e07d9cb8Szf
174*e07d9cb8Szf /* ARGSUSED */
175*e07d9cb8Szf void
ral_rssadapt_raise_rate(struct ieee80211com * ic,struct ral_rssadapt * ra,struct ral_rssdesc * id)176*e07d9cb8Szf ral_rssadapt_raise_rate(struct ieee80211com *ic, struct ral_rssadapt *ra,
177*e07d9cb8Szf struct ral_rssdesc *id)
178*e07d9cb8Szf {
179*e07d9cb8Szf uint16_t (*thrs)[IEEE80211_RATE_SIZE], newthr, oldthr;
180*e07d9cb8Szf struct ieee80211_node *ni = id->id_node;
181*e07d9cb8Szf struct ieee80211_rateset *rs = &ni->in_rates;
182*e07d9cb8Szf int i, top;
183*e07d9cb8Szf
184*e07d9cb8Szf ra->ra_nok++;
185*e07d9cb8Szf
186*e07d9cb8Szf for (i = 0, top = RAL_RSSADAPT_BKT0;
187*e07d9cb8Szf i < RAL_RSSADAPT_BKTS;
188*e07d9cb8Szf i++, top <<= RAL_RSSADAPT_BKTPOWER) {
189*e07d9cb8Szf thrs = &ra->ra_rate_thresh[i];
190*e07d9cb8Szf if (id->id_len <= top)
191*e07d9cb8Szf break;
192*e07d9cb8Szf }
193*e07d9cb8Szf
194*e07d9cb8Szf if (id->id_rateidx + 1 < rs->ir_nrates &&
195*e07d9cb8Szf (*thrs)[id->id_rateidx + 1] > (*thrs)[id->id_rateidx]) {
196*e07d9cb8Szf oldthr = (*thrs)[id->id_rateidx + 1];
197*e07d9cb8Szf if ((*thrs)[id->id_rateidx] == 0)
198*e07d9cb8Szf newthr = ra->ra_avg_rssi;
199*e07d9cb8Szf else
200*e07d9cb8Szf newthr = (*thrs)[id->id_rateidx];
201*e07d9cb8Szf (*thrs)[id->id_rateidx + 1] =
202*e07d9cb8Szf interpolate(master_expavgctl.rc_decay, oldthr, newthr);
203*e07d9cb8Szf }
204*e07d9cb8Szf }
205