1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/* $OpenBSD: if_casvar.h,v 1.8 2022/01/09 05:42:50 jsg Exp $ */
/*
*
* Copyright (C) 2007 Mark Kettenis.
* Copyright (C) 2001 Eduardo Horvath.
* All rights reserved.
*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*/
#ifndef _IF_CASVAR_H
#define _IF_CASVAR_H
#include <sys/queue.h>
#include <sys/timeout.h>
/*
* Misc. definitions for Sun Cassini ethernet controllers.
*/
/*
* Preferred page size. Cassini has a configurable page size, but
* needs at least 8k to handle jumbo frames. This happens to be the
* default anyway.
*/
#define CAS_PAGE_SIZE 8192
/*
* Transmit descriptor ring size. This is arbitrary, but allocate
* enough descriptors for 64 pending transmissions and 16 segments
* per packet.
*/
#define CAS_NTXSEGS 16
#define CAS_TXQUEUELEN 64
#define CAS_NTXDESC (CAS_TXQUEUELEN * CAS_NTXSEGS)
#define CAS_NTXDESC_MASK (CAS_NTXDESC - 1)
#define CAS_NEXTTX(x) ((x + 1) & CAS_NTXDESC_MASK)
struct cas_sxd {
struct mbuf *sd_mbuf;
bus_dmamap_t sd_map;
};
/*
* Receive descriptor ring size. We have one Rx buffer per incoming
* packet, so this logic is a little simpler.
*/
#define CAS_NRXDESC 128
#define CAS_NRXDESC_MASK (CAS_NRXDESC - 1)
/*
* Receive completion ring size.
*/
#define CAS_NRXCOMP 256
#define CAS_NRXCOMP_MASK (CAS_NRXCOMP - 1)
#define CAS_NEXTRX(x) ((x + 1) & CAS_NRXCOMP_MASK)
/*
* Control structures are DMA'd to the Cassini chip. We allocate them in
* a single clump that maps to a single DMA segment to make several things
* easier.
*/
struct cas_control_data {
/*
* The transmit descriptors.
*/
struct cas_desc ccd_txdescs[CAS_NTXDESC];
/*
* The receive completions.
*/
struct cas_comp ccd_rxcomps[CAS_NRXCOMP];
/*
* The receive descriptors.
*/
struct cas_desc ccd_rxdescs[CAS_NRXDESC];
char ccd_unused[CAS_PAGE_SIZE - CAS_NRXDESC * 16];
struct cas_desc ccd_rxdescs2[CAS_NRXDESC];
};
#define CAS_CDOFF(x) offsetof(struct cas_control_data, x)
#define CAS_CDTXOFF(x) CAS_CDOFF(ccd_txdescs[(x)])
#define CAS_CDRXOFF(x) CAS_CDOFF(ccd_rxdescs[(x)])
#define CAS_CDRXOFF2(x) CAS_CDOFF(ccd_rxdescs2[(x)])
#define CAS_CDRXCOFF(x) CAS_CDOFF(ccd_rxcomps[(x)])
/*
* Software state for receive jobs.
*/
struct cas_rxsoft {
bus_dmamap_t rxs_dmamap; /* our DMA map */
bus_dma_segment_t rxs_dmaseg; /* our DMA segment */
caddr_t rxs_kva;
};
/*
* Software state per device.
*/
struct cas_softc {
struct device sc_dev; /* generic device information */
struct arpcom sc_arpcom; /* ethernet common data */
struct mii_data sc_mii; /* MII media control */
#define sc_media sc_mii.mii_media/* shorthand */
struct timeout sc_tick_ch; /* tick callout */
bus_space_tag_t sc_memt;
bus_space_handle_t sc_memh;
void *sc_ih;
bus_dma_tag_t sc_dmatag; /* bus dma tag */
bus_dmamap_t sc_dmamap; /* bus dma handle */
int sc_burst; /* DVMA burst size in effect */
int sc_phys[2]; /* MII instance -> PHY map */
int sc_mif_config; /* Selected MII reg setting */
/*
* Ring buffer DMA stuff.
*/
bus_dma_segment_t sc_cdseg; /* control data memory */
int sc_cdnseg; /* number of segments */
bus_dmamap_t sc_cddmamap; /* control data DMA map */
#define sc_cddma sc_cddmamap->dm_segs[0].ds_addr
/*
* Software state for transmit and receive descriptors.
*/
struct cas_sxd sc_txd[CAS_NTXDESC];
u_int32_t sc_tx_cnt, sc_tx_prod, sc_tx_cons;
struct cas_rxsoft sc_rxsoft[CAS_NRXDESC];
struct cas_rxsoft sc_rxsoft2[CAS_NRXDESC];
/*
* Control data structures.
*/
struct cas_control_data *sc_control_data;
#define sc_txdescs sc_control_data->ccd_txdescs
#define sc_rxdescs sc_control_data->ccd_rxdescs
#define sc_rxdescs2 sc_control_data->ccd_rxdescs2
#define sc_rxcomps sc_control_data->ccd_rxcomps
int sc_rxptr; /* next ready RX descriptor/descsoft */
int sc_rxfifosize;
int sc_rxdptr;
int sc_rev;
int sc_inited;
int sc_debug;
};
/*
* This macro determines whether we have a Cassini+.
*/
#define CAS_PLUS(sc) (sc->sc_rev > 0x10)
#define CAS_DMA_READ(v) letoh64(v)
#define CAS_DMA_WRITE(v) htole64(v)
#define CAS_CDTXADDR(sc, x) ((sc)->sc_cddma + CAS_CDTXOFF((x)))
#define CAS_CDRXADDR(sc, x) ((sc)->sc_cddma + CAS_CDRXOFF((x)))
#define CAS_CDRXADDR2(sc, x) ((sc)->sc_cddma + CAS_CDRXOFF2((x)))
#define CAS_CDRXCADDR(sc, x) ((sc)->sc_cddma + CAS_CDRXCOFF((x)))
#define CAS_CDTXSYNC(sc, x, n, ops) \
do { \
int __x, __n; \
\
__x = (x); \
__n = (n); \
\
/* If it will wrap around, sync to the end of the ring. */ \
if ((__x + __n) > CAS_NTXDESC) { \
bus_dmamap_sync((sc)->sc_dmatag, (sc)->sc_cddmamap, \
CAS_CDTXOFF(__x), sizeof(struct cas_desc) * \
(CAS_NTXDESC - __x), (ops)); \
__n -= (CAS_NTXDESC - __x); \
__x = 0; \
} \
\
/* Now sync whatever is left. */ \
bus_dmamap_sync((sc)->sc_dmatag, (sc)->sc_cddmamap, \
CAS_CDTXOFF(__x), sizeof(struct cas_desc) * __n, (ops)); \
} while (0)
#define CAS_CDRXSYNC(sc, x, ops) \
bus_dmamap_sync((sc)->sc_dmatag, (sc)->sc_cddmamap, \
CAS_CDRXOFF((x)), sizeof(struct cas_desc), (ops))
#define CAS_CDRXCSYNC(sc, x, ops) \
bus_dmamap_sync((sc)->sc_dmatag, (sc)->sc_cddmamap, \
CAS_CDRXCOFF((x)), sizeof(struct cas_desc), (ops))
#define CAS_INIT_RXDESC(sc, d, s) \
do { \
struct cas_rxsoft *__rxs = &sc->sc_rxsoft[(s)]; \
struct cas_desc *__rxd = &sc->sc_rxdescs[(d)]; \
\
__rxd->cd_addr = \
CAS_DMA_WRITE(__rxs->rxs_dmamap->dm_segs[0].ds_addr); \
__rxd->cd_flags = \
CAS_DMA_WRITE((s)); \
CAS_CDRXSYNC((sc), (d), BUS_DMASYNC_PREREAD|BUS_DMASYNC_PREWRITE); \
} while (0)
#endif
|
