athrate-sample.h revision 1.1 1 1.1 dyoung /*-
2 1.1 dyoung * Copyright (c) 2005 John Bicket
3 1.1 dyoung * All rights reserved.
4 1.1 dyoung *
5 1.1 dyoung * Redistribution and use in source and binary forms, with or without
6 1.1 dyoung * modification, are permitted provided that the following conditions
7 1.1 dyoung * are met:
8 1.1 dyoung * 1. Redistributions of source code must retain the above copyright
9 1.1 dyoung * notice, this list of conditions and the following disclaimer,
10 1.1 dyoung * without modification.
11 1.1 dyoung * 2. Redistributions in binary form must reproduce at minimum a disclaimer
12 1.1 dyoung * similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
13 1.1 dyoung * redistribution must be conditioned upon including a substantially
14 1.1 dyoung * similar Disclaimer requirement for further binary redistribution.
15 1.1 dyoung * 3. Neither the names of the above-listed copyright holders nor the names
16 1.1 dyoung * of any contributors may be used to endorse or promote products derived
17 1.1 dyoung * from this software without specific prior written permission.
18 1.1 dyoung *
19 1.1 dyoung * Alternatively, this software may be distributed under the terms of the
20 1.1 dyoung * GNU General Public License ("GPL") version 2 as published by the Free
21 1.1 dyoung * Software Foundation.
22 1.1 dyoung *
23 1.1 dyoung * NO WARRANTY
24 1.1 dyoung * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25 1.1 dyoung * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 1.1 dyoung * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
27 1.1 dyoung * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
28 1.1 dyoung * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
29 1.1 dyoung * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 1.1 dyoung * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 1.1 dyoung * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
32 1.1 dyoung * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 1.1 dyoung * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
34 1.1 dyoung * THE POSSIBILITY OF SUCH DAMAGES.
35 1.1 dyoung *
36 1.1 dyoung * $FreeBSD: src/sys/dev/ath/ath_rate/sample/sample.h,v 1.3 2005/03/20 01:27:33 sam Exp $
37 1.1 dyoung */
38 1.1 dyoung
39 1.1 dyoung /*
40 1.1 dyoung * Defintions for the Atheros Wireless LAN controller driver.
41 1.1 dyoung */
42 1.1 dyoung #ifndef _DEV_ATH_RATE_SAMPLE_H
43 1.1 dyoung #define _DEV_ATH_RATE_SAMPLE_H
44 1.1 dyoung
45 1.1 dyoung /* per-device state */
46 1.1 dyoung struct sample_softc {
47 1.1 dyoung struct ath_ratectrl arc; /* base state */
48 1.1 dyoung int ath_smoothing_rate; /* ewma percentage (out of 100) */
49 1.1 dyoung int ath_sample_rate; /* send a different bit-rate 1/X packets */
50 1.1 dyoung };
51 1.1 dyoung #define ATH_SOFTC_SAMPLE(sc) ((struct sample_softc *)sc->sc_rc)
52 1.1 dyoung
53 1.1 dyoung struct rate_info {
54 1.1 dyoung int rate;
55 1.1 dyoung int rix;
56 1.1 dyoung int rateCode;
57 1.1 dyoung int shortPreambleRateCode;
58 1.1 dyoung };
59 1.1 dyoung
60 1.1 dyoung
61 1.1 dyoung struct rate_stats {
62 1.1 dyoung unsigned average_tx_time;
63 1.1 dyoung int successive_failures;
64 1.1 dyoung int tries;
65 1.1 dyoung int total_packets;
66 1.1 dyoung int packets_acked;
67 1.1 dyoung unsigned perfect_tx_time; /* transmit time for 0 retries */
68 1.1 dyoung int last_tx;
69 1.1 dyoung };
70 1.1 dyoung
71 1.1 dyoung /*
72 1.1 dyoung * for now, we track performance for three different packet
73 1.1 dyoung * size buckets
74 1.1 dyoung */
75 1.1 dyoung #define NUM_PACKET_SIZE_BINS 3
76 1.1 dyoung static int packet_size_bins[NUM_PACKET_SIZE_BINS] = {250, 1600, 3000};
77 1.1 dyoung
78 1.1 dyoung /* per-node state */
79 1.1 dyoung struct sample_node {
80 1.1 dyoung int static_rate_ndx;
81 1.1 dyoung int num_rates;
82 1.1 dyoung
83 1.1 dyoung struct rate_info rates[IEEE80211_RATE_MAXSIZE];
84 1.1 dyoung
85 1.1 dyoung struct rate_stats stats[NUM_PACKET_SIZE_BINS][IEEE80211_RATE_MAXSIZE];
86 1.1 dyoung int last_sample_ndx[NUM_PACKET_SIZE_BINS];
87 1.1 dyoung
88 1.1 dyoung int current_sample_ndx[NUM_PACKET_SIZE_BINS];
89 1.1 dyoung int packets_sent[NUM_PACKET_SIZE_BINS];
90 1.1 dyoung
91 1.1 dyoung int current_rate[NUM_PACKET_SIZE_BINS];
92 1.1 dyoung int packets_since_switch[NUM_PACKET_SIZE_BINS];
93 1.1 dyoung unsigned jiffies_since_switch[NUM_PACKET_SIZE_BINS];
94 1.1 dyoung
95 1.1 dyoung int packets_since_sample[NUM_PACKET_SIZE_BINS];
96 1.1 dyoung unsigned sample_tt[NUM_PACKET_SIZE_BINS];
97 1.1 dyoung };
98 1.1 dyoung #define ATH_NODE_SAMPLE(an) ((struct sample_node *)&an[1])
99 1.1 dyoung
100 1.1 dyoung #ifndef MIN
101 1.1 dyoung #define MIN(a,b) ((a) < (b) ? (a) : (b))
102 1.1 dyoung #endif
103 1.1 dyoung #ifndef MAX
104 1.1 dyoung #define MAX(a,b) ((a) > (b) ? (a) : (b))
105 1.1 dyoung #endif
106 1.1 dyoung
107 1.1 dyoung #define WIFI_CW_MIN 31
108 1.1 dyoung #define WIFI_CW_MAX 1023
109 1.1 dyoung
110 1.1 dyoung struct ar5212_desc {
111 1.1 dyoung /*
112 1.1 dyoung * tx_control_0
113 1.1 dyoung */
114 1.1 dyoung u_int32_t frame_len:12;
115 1.1 dyoung u_int32_t reserved_12_15:4;
116 1.1 dyoung u_int32_t xmit_power:6;
117 1.1 dyoung u_int32_t rts_cts_enable:1;
118 1.1 dyoung u_int32_t veol:1;
119 1.1 dyoung u_int32_t clear_dest_mask:1;
120 1.1 dyoung u_int32_t ant_mode_xmit:4;
121 1.1 dyoung u_int32_t inter_req:1;
122 1.1 dyoung u_int32_t encrypt_key_valid:1;
123 1.1 dyoung u_int32_t cts_enable:1;
124 1.1 dyoung
125 1.1 dyoung /*
126 1.1 dyoung * tx_control_1
127 1.1 dyoung */
128 1.1 dyoung u_int32_t buf_len:12;
129 1.1 dyoung u_int32_t more:1;
130 1.1 dyoung u_int32_t encrypt_key_index:7;
131 1.1 dyoung u_int32_t frame_type:4;
132 1.1 dyoung u_int32_t no_ack:1;
133 1.1 dyoung u_int32_t comp_proc:2;
134 1.1 dyoung u_int32_t comp_iv_len:2;
135 1.1 dyoung u_int32_t comp_icv_len:2;
136 1.1 dyoung u_int32_t reserved_31:1;
137 1.1 dyoung
138 1.1 dyoung /*
139 1.1 dyoung * tx_control_2
140 1.1 dyoung */
141 1.1 dyoung u_int32_t rts_duration:15;
142 1.1 dyoung u_int32_t duration_update_enable:1;
143 1.1 dyoung u_int32_t xmit_tries0:4;
144 1.1 dyoung u_int32_t xmit_tries1:4;
145 1.1 dyoung u_int32_t xmit_tries2:4;
146 1.1 dyoung u_int32_t xmit_tries3:4;
147 1.1 dyoung
148 1.1 dyoung /*
149 1.1 dyoung * tx_control_3
150 1.1 dyoung */
151 1.1 dyoung u_int32_t xmit_rate0:5;
152 1.1 dyoung u_int32_t xmit_rate1:5;
153 1.1 dyoung u_int32_t xmit_rate2:5;
154 1.1 dyoung u_int32_t xmit_rate3:5;
155 1.1 dyoung u_int32_t rts_cts_rate:5;
156 1.1 dyoung u_int32_t reserved_25_31:7;
157 1.1 dyoung
158 1.1 dyoung /*
159 1.1 dyoung * tx_status_0
160 1.1 dyoung */
161 1.1 dyoung u_int32_t frame_xmit_ok:1;
162 1.1 dyoung u_int32_t excessive_retries:1;
163 1.1 dyoung u_int32_t fifo_underrun:1;
164 1.1 dyoung u_int32_t filtered:1;
165 1.1 dyoung u_int32_t rts_fail_count:4;
166 1.1 dyoung u_int32_t data_fail_count:4;
167 1.1 dyoung u_int32_t virt_coll_count:4;
168 1.1 dyoung u_int32_t send_timestamp:16;
169 1.1 dyoung
170 1.1 dyoung /*
171 1.1 dyoung * tx_status_1
172 1.1 dyoung */
173 1.1 dyoung u_int32_t done:1;
174 1.1 dyoung u_int32_t seq_num:12;
175 1.1 dyoung u_int32_t ack_sig_strength:8;
176 1.1 dyoung u_int32_t final_ts_index:2;
177 1.1 dyoung u_int32_t comp_success:1;
178 1.1 dyoung u_int32_t xmit_antenna:1;
179 1.1 dyoung u_int32_t reserved_25_31_x:7;
180 1.1 dyoung } __packed;
181 1.1 dyoung
182 1.1 dyoung /*
183 1.1 dyoung * Calculate the transmit duration of a frame.
184 1.1 dyoung */
185 1.1 dyoung static unsigned calc_usecs_unicast_packet(struct ath_softc *sc,
186 1.1 dyoung int length,
187 1.1 dyoung int rix, int short_retries, int long_retries) {
188 1.1 dyoung const HAL_RATE_TABLE *rt = sc->sc_currates;
189 1.1 dyoung
190 1.1 dyoung /* pg 205 ieee.802.11.pdf */
191 1.1 dyoung unsigned t_slot = 20;
192 1.1 dyoung unsigned t_difs = 50;
193 1.1 dyoung unsigned t_sifs = 10;
194 1.1 dyoung struct ieee80211com *ic = &sc->sc_ic;
195 1.1 dyoung int tt = 0;
196 1.1 dyoung int x = 0;
197 1.1 dyoung int cw = WIFI_CW_MIN;
198 1.1 dyoung int cix = rt->info[rix].controlRate;
199 1.1 dyoung int rts = 0;
200 1.1 dyoung int cts = 0;
201 1.1 dyoung
202 1.1 dyoung KASSERT(rt != NULL, ("no rate table, mode %u", sc->sc_curmode));
203 1.1 dyoung
204 1.1 dyoung if (rt->info[rix].phy == IEEE80211_T_OFDM) {
205 1.1 dyoung t_slot = 9;
206 1.1 dyoung t_sifs = 9;
207 1.1 dyoung t_difs = 28;
208 1.1 dyoung }
209 1.1 dyoung
210 1.1 dyoung if ((ic->ic_flags & IEEE80211_F_USEPROT) &&
211 1.1 dyoung rt->info[rix].phy == IEEE80211_T_OFDM) {
212 1.1 dyoung if (ic->ic_protmode == IEEE80211_PROT_RTSCTS)
213 1.1 dyoung rts = 1;
214 1.1 dyoung else if (ic->ic_protmode == IEEE80211_PROT_CTSONLY)
215 1.1 dyoung cts = 1;
216 1.1 dyoung
217 1.1 dyoung cix = rt->info[sc->sc_protrix].controlRate;
218 1.1 dyoung
219 1.1 dyoung }
220 1.1 dyoung
221 1.1 dyoung if (length > ic->ic_rtsthreshold) {
222 1.1 dyoung rts = 1;
223 1.1 dyoung }
224 1.1 dyoung
225 1.1 dyoung if (rts || cts) {
226 1.1 dyoung int ctsrate = rt->info[cix].rateCode;
227 1.1 dyoung int ctsduration = 0;
228 1.1 dyoung ctsrate |= rt->info[cix].shortPreamble;
229 1.1 dyoung if (rts) /* SIFS + CTS */
230 1.1 dyoung ctsduration += rt->info[cix].spAckDuration;
231 1.1 dyoung
232 1.1 dyoung ctsduration += ath_hal_computetxtime(sc->sc_ah,
233 1.1 dyoung rt, length, rix, AH_TRUE);
234 1.1 dyoung
235 1.1 dyoung if (cts) /* SIFS + ACK */
236 1.1 dyoung ctsduration += rt->info[cix].spAckDuration;
237 1.1 dyoung
238 1.1 dyoung tt += (short_retries + 1) * ctsduration;
239 1.1 dyoung }
240 1.1 dyoung tt += t_difs;
241 1.1 dyoung tt += (long_retries+1)*(t_sifs + rt->info[cix].spAckDuration);
242 1.1 dyoung tt += (long_retries+1)*ath_hal_computetxtime(sc->sc_ah, rt, length,
243 1.1 dyoung rix, AH_TRUE);
244 1.1 dyoung for (x = 0; x <= short_retries + long_retries; x++) {
245 1.1 dyoung cw = MIN(WIFI_CW_MAX, (cw + 1) * 2);
246 1.1 dyoung tt += (t_slot * cw/2);
247 1.1 dyoung }
248 1.1 dyoung return tt;
249 1.1 dyoung }
250 1.1 dyoung #endif /* _DEV_ATH_RATE_SAMPLE_H */
251