1/*-
2 * SPDX-License-Identifier: BSD-2-Clause
3 *
4 * Copyright (c) 2002-2009 Sam Leffler, Errno Consulting
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer,
12 *    without modification.
13 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
14 *    similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
15 *    redistribution must be conditioned upon including a substantially
16 *    similar Disclaimer requirement for further binary redistribution.
17 *
18 * NO WARRANTY
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
22 * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
23 * THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
24 * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
27 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
29 * THE POSSIBILITY OF SUCH DAMAGES.
30 */
31
32#include <sys/cdefs.h>
33#include "opt_inet.h"
34#include "opt_ath.h"
35#include "opt_wlan.h"
36
37#include <sys/param.h>
38#include <sys/systm.h>
39#include <sys/sysctl.h>
40#include <sys/mbuf.h>
41#include <sys/malloc.h>
42#include <sys/lock.h>
43#include <sys/mutex.h>
44#include <sys/kernel.h>
45#include <sys/socket.h>
46#include <sys/sockio.h>
47#include <sys/errno.h>
48#include <sys/callout.h>
49#include <sys/bus.h>
50#include <sys/endian.h>
51#include <sys/kthread.h>
52#include <sys/taskqueue.h>
53#include <sys/priv.h>
54
55#include <machine/bus.h>
56
57#include <net/if.h>
58#include <net/if_dl.h>
59#include <net/if_media.h>
60#include <net/if_types.h>
61#include <net/if_arp.h>
62#include <net/ethernet.h>
63#include <net/if_llc.h>
64
65#include <net80211/ieee80211_var.h>
66#include <net80211/ieee80211_regdomain.h>
67#ifdef IEEE80211_SUPPORT_SUPERG
68#include <net80211/ieee80211_superg.h>
69#endif
70#ifdef IEEE80211_SUPPORT_TDMA
71#include <net80211/ieee80211_tdma.h>
72#endif
73
74#include <net/bpf.h>
75
76#ifdef INET
77#include <netinet/in.h>
78#include <netinet/if_ether.h>
79#endif
80
81#include <dev/ath/if_athvar.h>
82#include <dev/ath/ath_hal/ah_devid.h>		/* XXX for softled */
83#include <dev/ath/ath_hal/ah_diagcodes.h>
84
85#ifdef ATH_TX99_DIAG
86#include <dev/ath/ath_tx99/ath_tx99.h>
87#endif
88
89#ifdef ATH_DEBUG
90#include <dev/ath/if_ath_debug.h>
91
92uint64_t ath_debug = 0;
93
94SYSCTL_DECL(_hw_ath);
95SYSCTL_QUAD(_hw_ath, OID_AUTO, debug, CTLFLAG_RWTUN, &ath_debug,
96	    0, "control debugging printfs");
97
98void
99ath_printrxbuf(struct ath_softc *sc, const struct ath_buf *bf,
100	u_int ix, int done)
101{
102	const struct ath_rx_status *rs = &bf->bf_status.ds_rxstat;
103	struct ath_hal *ah = sc->sc_ah;
104	const struct ath_desc *ds;
105	int i;
106
107	for (i = 0, ds = bf->bf_desc; i < bf->bf_nseg; i++, ds++) {
108		printf("R[%2u] (DS.V:%p DS.P:%p) L:%08x D:%08x%s\n"
109		       "      %08x %08x %08x %08x\n",
110		    ix, ds, (const struct ath_desc *)bf->bf_daddr + i,
111		    ds->ds_link, ds->ds_data,
112		    !done ? "" : (rs->rs_status == 0) ? " *" : " !",
113		    ds->ds_ctl0, ds->ds_ctl1,
114		    ds->ds_hw[0], ds->ds_hw[1]);
115		if (ah->ah_magic == 0x20065416) {
116			printf("        %08x %08x %08x %08x %08x %08x %08x\n",
117			    ds->ds_hw[2], ds->ds_hw[3], ds->ds_hw[4],
118			    ds->ds_hw[5], ds->ds_hw[6], ds->ds_hw[7],
119			    ds->ds_hw[8]);
120		} else if (ah->ah_magic == 0x19741014) {
121			printf("        %08x %08x %08x %08x %08x %08x %08x\n",
122			    ds->ds_hw[2], ds->ds_hw[3], ds->ds_hw[4],
123			    ds->ds_hw[5], ds->ds_hw[6], ds->ds_hw[7],
124			    ds->ds_hw[8]);
125
126			printf("        %08x %08x %08x %08x %08x %08x %08x\n",
127			    ds->ds_hw[9], ds->ds_hw[10], ds->ds_hw[11],
128			    ds->ds_hw[12], ds->ds_hw[13], ds->ds_hw[14],
129			    ds->ds_hw[15]);
130		}
131	}
132}
133
134static void
135ath_printtxbuf_edma(struct ath_softc *sc, const struct ath_buf *first_bf,
136	u_int qnum, u_int ix, int done)
137{
138	const struct ath_tx_status *ts =
139	    &first_bf->bf_last->bf_status.ds_txstat;
140	const struct ath_buf *bf = first_bf;
141	const char *ds;
142	const struct ath_desc_txedma *eds;
143	int i, n;
144
145	printf("Q%u[%3u] (nseg=%d)", qnum, ix, bf->bf_nseg);
146	while (bf != NULL) {
147		/*
148		 * XXX For now, assume the txmap size is 4.
149		 */
150
151		/*
152		 * Assume the TX map size is 4 for now and only walk
153		 * the appropriate number of segments.
154		 */
155		n = ((bf->bf_nseg - 1) / 4) + 1;
156
157		for (i = 0, ds = (const char *) bf->bf_desc;
158		    i < n;
159		    i ++, ds += sc->sc_tx_desclen) {
160			eds = (const struct ath_desc_txedma *) ds;
161			printf(" (DS.V:%p DS.P:%p) I: %08x L:%08x F:%04x%s\n",
162			    eds, (const struct ath_desc *)bf->bf_daddr + i,
163			    eds->ds_info, eds->ds_link,
164			    bf->bf_state.bfs_txflags,
165			    !done ? "" : (ts->ts_status == 0) ? " *" : " !");
166			printf(" (D[0] = %08x(%08x), D[1] = %08x(%08x)\n",
167			    eds->ds_hw[0], eds->ds_hw[1],
168			    eds->ds_hw[2], eds->ds_hw[3]);
169			printf(" (D[2] = %08x(%08x), D[3] = %08x(%08x)\n",
170			    eds->ds_hw[4], eds->ds_hw[5],
171			    eds->ds_hw[6], eds->ds_hw[7]);
172			printf("        Seq: %d swtry: %d ADDBAW?: %d DOBAW?: %d\n",
173			    bf->bf_state.bfs_seqno,
174			    bf->bf_state.bfs_retries,
175			    bf->bf_state.bfs_addedbaw,
176			    bf->bf_state.bfs_dobaw);
177			printf("        %08x %08x %08x %08x %08x %08x\n",
178			    eds->ds_hw[8], eds->ds_hw[9],
179			    eds->ds_hw[10], eds->ds_hw[11],
180			    eds->ds_hw[12], eds->ds_hw[13]);
181			printf("        %08x %08x %08x %08x %08x %08x %08x\n",
182			    eds->ds_hw[14], eds->ds_hw[15], eds->ds_hw[16],
183			    eds->ds_hw[17], eds->ds_hw[18], eds->ds_hw[19],
184			    eds->ds_hw[20]);
185#if 0
186			printf("        %08x %08x %08x %08x %08x %08x %08x %08x\n",
187			    ds->ds_hw[22],ds->ds_hw[23],ds->ds_hw[24],
188			    ds->ds_hw[25],ds->ds_hw[26],ds->ds_hw[27],
189			    ds->ds_hw[28], ds->ds_hw[29]);
190#endif
191		}
192		printf("  [end]\n");
193		bf = bf->bf_next;
194	}
195}
196
197static void
198ath_printtxbuf_legacy(struct ath_softc *sc, const struct ath_buf *first_bf,
199	u_int qnum, u_int ix, int done)
200{
201	const struct ath_tx_status *ts = &first_bf->bf_status.ds_txstat;
202	const struct ath_buf *bf = first_bf;
203	struct ath_hal *ah = sc->sc_ah;
204	const struct ath_desc *ds;
205	int i;
206
207	printf("Q%u[%3u]", qnum, ix);
208	while (bf != NULL) {
209		printf("    (bf=%p, lastds=%p)\n", bf, first_bf->bf_lastds);
210		printf("        Seq: %d swtry: %d ADDBAW?: %d DOBAW?: %d\n",
211		    bf->bf_state.bfs_seqno,
212		    bf->bf_state.bfs_retries,
213		    bf->bf_state.bfs_addedbaw,
214		    bf->bf_state.bfs_dobaw);
215		for (i = 0, ds = bf->bf_desc; i < bf->bf_nseg; i++, ds++) {
216			printf(" (DS.V:%p DS.P:%p) L:%08x D:%08x F:%04x%s\n",
217			    ds, (const struct ath_desc *)bf->bf_daddr + i,
218			    ds->ds_link, ds->ds_data, bf->bf_state.bfs_txflags,
219			    !done ? "" : (ts->ts_status == 0) ? " *" : " !");
220			printf("        %08x %08x %08x %08x %08x %08x\n",
221			    ds->ds_ctl0, ds->ds_ctl1,
222			    ds->ds_hw[0], ds->ds_hw[1],
223			    ds->ds_hw[2], ds->ds_hw[3]);
224			if (ah->ah_magic == 0x20065416) {
225				printf("        %08x %08x %08x %08x %08x %08x %08x %08x\n",
226				    ds->ds_hw[4], ds->ds_hw[5], ds->ds_hw[6],
227				    ds->ds_hw[7], ds->ds_hw[8], ds->ds_hw[9],
228				    ds->ds_hw[10],ds->ds_hw[11]);
229				printf("        %08x %08x %08x %08x %08x %08x %08x %08x\n",
230				    ds->ds_hw[12],ds->ds_hw[13],ds->ds_hw[14],
231				    ds->ds_hw[15],ds->ds_hw[16],ds->ds_hw[17],
232				    ds->ds_hw[18], ds->ds_hw[19]);
233			}
234		}
235		printf("  [end]\n");
236		bf = bf->bf_next;
237	}
238}
239
240void
241ath_printtxbuf(struct ath_softc *sc, const struct ath_buf *first_bf,
242	u_int qnum, u_int ix, int done)
243{
244	if (sc->sc_ah->ah_magic == 0x19741014)
245		ath_printtxbuf_edma(sc, first_bf, qnum, ix, done);
246	else
247		ath_printtxbuf_legacy(sc, first_bf, qnum, ix, done);
248}
249
250void
251ath_printtxstatbuf(struct ath_softc *sc, const struct ath_buf *first_bf,
252	const uint32_t *ds, u_int qnum, u_int ix, int done)
253{
254
255	printf("Q%u[%3u] ", qnum, ix);
256	printf("        %08x %08x %08x %08x %08x %08x\n",
257	    ds[0], ds[1], ds[2], ds[3], ds[4], ds[5]);
258	printf("        %08x %08x %08x %08x %08x\n",
259	    ds[6], ds[7], ds[8], ds[9], ds[10]);
260}
261
262#endif	/* ATH_DEBUG */
263