if_ieee1394subr.c revision 1.68 1 1.68 thorpej /* $NetBSD: if_ieee1394subr.c,v 1.68 2022/09/03 01:35:03 thorpej Exp $ */
2 1.1 onoe
3 1.1 onoe /*
4 1.1 onoe * Copyright (c) 2000 The NetBSD Foundation, Inc.
5 1.1 onoe * All rights reserved.
6 1.1 onoe *
7 1.1 onoe * This code is derived from software contributed to The NetBSD Foundation
8 1.1 onoe * by Atsushi Onoe.
9 1.1 onoe *
10 1.1 onoe * Redistribution and use in source and binary forms, with or without
11 1.1 onoe * modification, are permitted provided that the following conditions
12 1.1 onoe * are met:
13 1.1 onoe * 1. Redistributions of source code must retain the above copyright
14 1.1 onoe * notice, this list of conditions and the following disclaimer.
15 1.1 onoe * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 onoe * notice, this list of conditions and the following disclaimer in the
17 1.1 onoe * documentation and/or other materials provided with the distribution.
18 1.1 onoe *
19 1.1 onoe * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 onoe * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 onoe * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 onoe * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 onoe * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 onoe * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 onoe * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 onoe * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 onoe * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 onoe * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 onoe * POSSIBILITY OF SUCH DAMAGE.
30 1.1 onoe */
31 1.12 lukem
32 1.12 lukem #include <sys/cdefs.h>
33 1.68 thorpej __KERNEL_RCSID(0, "$NetBSD: if_ieee1394subr.c,v 1.68 2022/09/03 01:35:03 thorpej Exp $");
34 1.1 onoe
35 1.50 pooka #ifdef _KERNEL_OPT
36 1.1 onoe #include "opt_inet.h"
37 1.50 pooka #endif
38 1.1 onoe
39 1.1 onoe #include <sys/param.h>
40 1.1 onoe #include <sys/systm.h>
41 1.43 kiyohara #include <sys/bus.h>
42 1.43 kiyohara #include <sys/device.h>
43 1.43 kiyohara #include <sys/kernel.h>
44 1.43 kiyohara #include <sys/mbuf.h>
45 1.1 onoe #include <sys/socket.h>
46 1.1 onoe #include <sys/sockio.h>
47 1.44 pgoyette #include <sys/select.h>
48 1.1 onoe
49 1.1 onoe #include <net/if.h>
50 1.1 onoe #include <net/if_dl.h>
51 1.1 onoe #include <net/if_ieee1394.h>
52 1.1 onoe #include <net/if_types.h>
53 1.1 onoe #include <net/if_media.h>
54 1.1 onoe #include <net/ethertypes.h>
55 1.1 onoe #include <net/netisr.h>
56 1.1 onoe #include <net/route.h>
57 1.1 onoe
58 1.1 onoe #include <net/bpf.h>
59 1.1 onoe
60 1.1 onoe #ifdef INET
61 1.1 onoe #include <netinet/in.h>
62 1.1 onoe #include <netinet/in_var.h>
63 1.16 itojun #include <netinet/if_inarp.h>
64 1.1 onoe #endif /* INET */
65 1.1 onoe #ifdef INET6
66 1.1 onoe #include <netinet/in.h>
67 1.1 onoe #include <netinet6/in6_var.h>
68 1.1 onoe #include <netinet6/nd6.h>
69 1.1 onoe #endif /* INET6 */
70 1.1 onoe
71 1.29 kiyohara #include <dev/ieee1394/firewire.h>
72 1.29 kiyohara
73 1.29 kiyohara #include <dev/ieee1394/firewirereg.h>
74 1.29 kiyohara #include <dev/ieee1394/iec13213.h>
75 1.29 kiyohara #include <dev/ieee1394/if_fwipvar.h>
76 1.29 kiyohara
77 1.3 onoe #define IEEE1394_REASS_TIMEOUT 3 /* 3 sec */
78 1.3 onoe
79 1.1 onoe #define senderr(e) do { error = (e); goto bad; } while(0/*CONSTCOND*/)
80 1.1 onoe
81 1.33 dyoung static int ieee1394_output(struct ifnet *, struct mbuf *,
82 1.54 ozaki const struct sockaddr *, const struct rtentry *);
83 1.39 matt static struct mbuf *ieee1394_reass(struct ifnet *, struct mbuf *, uint16_t);
84 1.1 onoe
85 1.1 onoe static int
86 1.33 dyoung ieee1394_output(struct ifnet *ifp, struct mbuf *m0, const struct sockaddr *dst,
87 1.54 ozaki const struct rtentry *rt)
88 1.1 onoe {
89 1.39 matt uint16_t etype = 0;
90 1.2 onoe struct mbuf *m;
91 1.55 knakahar int hdrlen, error = 0;
92 1.1 onoe struct mbuf *mcopy = NULL;
93 1.36 dyoung struct ieee1394_hwaddr *hwdst, baddr;
94 1.36 dyoung const struct ieee1394_hwaddr *myaddr;
95 1.18 onoe #ifdef INET
96 1.18 onoe struct arphdr *ah;
97 1.18 onoe #endif /* INET */
98 1.29 kiyohara struct m_tag *mtag;
99 1.29 kiyohara int unicast;
100 1.1 onoe
101 1.1 onoe if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) != (IFF_UP|IFF_RUNNING))
102 1.1 onoe senderr(ENETDOWN);
103 1.14 itojun
104 1.14 itojun /*
105 1.14 itojun * If the queueing discipline needs packet classification,
106 1.14 itojun * do it before prepending link headers.
107 1.14 itojun */
108 1.53 knakahar IFQ_CLASSIFY(&ifp->if_snd, m0, dst->sa_family);
109 1.14 itojun
110 1.29 kiyohara /*
111 1.29 kiyohara * For unicast, we make a tag to store the lladdr of the
112 1.29 kiyohara * destination. This might not be the first time we have seen
113 1.29 kiyohara * the packet (for instance, the arp code might be trying to
114 1.29 kiyohara * re-send it after receiving an arp reply) so we only
115 1.29 kiyohara * allocate a tag if there isn't one there already. For
116 1.29 kiyohara * multicast, we will eventually use a different tag to store
117 1.29 kiyohara * the channel number.
118 1.29 kiyohara */
119 1.29 kiyohara unicast = !(m0->m_flags & (M_BCAST | M_MCAST));
120 1.29 kiyohara if (unicast) {
121 1.64 maxv mtag = m_tag_find(m0, MTAG_FIREWIRE_HWADDR);
122 1.29 kiyohara if (!mtag) {
123 1.43 kiyohara mtag = m_tag_get(MTAG_FIREWIRE_HWADDR,
124 1.29 kiyohara sizeof (struct ieee1394_hwaddr), M_NOWAIT);
125 1.29 kiyohara if (!mtag) {
126 1.29 kiyohara error = ENOMEM;
127 1.29 kiyohara goto bad;
128 1.29 kiyohara }
129 1.29 kiyohara m_tag_prepend(m0, mtag);
130 1.29 kiyohara }
131 1.29 kiyohara hwdst = (struct ieee1394_hwaddr *)(mtag + 1);
132 1.29 kiyohara } else {
133 1.29 kiyohara hwdst = &baddr;
134 1.29 kiyohara }
135 1.29 kiyohara
136 1.1 onoe switch (dst->sa_family) {
137 1.1 onoe #ifdef INET
138 1.1 onoe case AF_INET:
139 1.51 roy if (unicast &&
140 1.52 christos (error = arpresolve(ifp, rt, m0, dst, hwdst,
141 1.52 christos sizeof(*hwdst))) != 0)
142 1.51 roy return error == EWOULDBLOCK ? 0 : error;
143 1.1 onoe /* if broadcasting on a simplex interface, loopback a copy */
144 1.2 onoe if ((m0->m_flags & M_BCAST) && (ifp->if_flags & IFF_SIMPLEX))
145 1.62 maxv mcopy = m_copypacket(m0, M_DONTWAIT);
146 1.1 onoe etype = htons(ETHERTYPE_IP);
147 1.1 onoe break;
148 1.1 onoe case AF_ARP:
149 1.18 onoe ah = mtod(m0, struct arphdr *);
150 1.18 onoe ah->ar_hrd = htons(ARPHRD_IEEE1394);
151 1.1 onoe etype = htons(ETHERTYPE_ARP);
152 1.1 onoe break;
153 1.1 onoe #endif /* INET */
154 1.1 onoe #ifdef INET6
155 1.1 onoe case AF_INET6:
156 1.59 ozaki #if 0
157 1.59 ozaki /*
158 1.59 ozaki * XXX This code was in nd6_storelladdr, which was replaced with
159 1.59 ozaki * nd6_resolve, but it never be used because nd6_storelladdr was
160 1.59 ozaki * called only if unicast. Should it be enabled?
161 1.59 ozaki */
162 1.59 ozaki if (m0->m_flags & M_BCAST)
163 1.59 ozaki memcpy(hwdst->iha_uid, ifp->if_broadcastaddr,
164 1.59 ozaki MIN(IEEE1394_ADDR_LEN, ifp->if_addrlen));
165 1.59 ozaki #endif
166 1.59 ozaki if (unicast) {
167 1.59 ozaki error = nd6_resolve(ifp, rt, m0, dst, hwdst->iha_uid,
168 1.59 ozaki IEEE1394_ADDR_LEN);
169 1.59 ozaki if (error != 0)
170 1.59 ozaki return error == EWOULDBLOCK ? 0 : error;
171 1.1 onoe }
172 1.1 onoe etype = htons(ETHERTYPE_IPV6);
173 1.1 onoe break;
174 1.1 onoe #endif /* INET6 */
175 1.1 onoe
176 1.1 onoe case pseudo_AF_HDRCMPLT:
177 1.1 onoe case AF_UNSPEC:
178 1.1 onoe /* TODO? */
179 1.1 onoe default:
180 1.1 onoe printf("%s: can't handle af%d\n", ifp->if_xname,
181 1.1 onoe dst->sa_family);
182 1.1 onoe senderr(EAFNOSUPPORT);
183 1.1 onoe break;
184 1.1 onoe }
185 1.1 onoe
186 1.1 onoe if (mcopy)
187 1.1 onoe looutput(ifp, mcopy, dst, rt);
188 1.36 dyoung myaddr = (const struct ieee1394_hwaddr *)CLLADDR(ifp->if_sadl);
189 1.30 kiyohara if (ifp->if_bpf) {
190 1.30 kiyohara struct ieee1394_bpfhdr h;
191 1.30 kiyohara if (unicast)
192 1.30 kiyohara memcpy(h.ibh_dhost, hwdst->iha_uid, 8);
193 1.30 kiyohara else
194 1.30 kiyohara memcpy(h.ibh_dhost,
195 1.30 kiyohara ((const struct ieee1394_hwaddr *)
196 1.30 kiyohara ifp->if_broadcastaddr)->iha_uid, 8);
197 1.30 kiyohara memcpy(h.ibh_shost, myaddr->iha_uid, 8);
198 1.30 kiyohara h.ibh_type = etype;
199 1.63 msaitoh bpf_mtap2(ifp->if_bpf, &h, sizeof(h), m0, BPF_D_OUT);
200 1.30 kiyohara }
201 1.2 onoe if ((ifp->if_flags & IFF_SIMPLEX) &&
202 1.29 kiyohara unicast &&
203 1.29 kiyohara memcmp(hwdst, myaddr, IEEE1394_ADDR_LEN) == 0)
204 1.2 onoe return looutput(ifp, m0, dst, rt);
205 1.2 onoe
206 1.3 onoe /*
207 1.3 onoe * XXX:
208 1.3 onoe * The maximum possible rate depends on the topology.
209 1.3 onoe * So the determination of maxrec and fragmentation should be
210 1.3 onoe * called from the driver after probing the topology map.
211 1.3 onoe */
212 1.29 kiyohara if (unicast) {
213 1.2 onoe hdrlen = IEEE1394_GASP_LEN;
214 1.29 kiyohara hwdst->iha_speed = 0; /* XXX */
215 1.2 onoe } else
216 1.2 onoe hdrlen = 0;
217 1.1 onoe
218 1.29 kiyohara if (hwdst->iha_speed > myaddr->iha_speed)
219 1.29 kiyohara hwdst->iha_speed = myaddr->iha_speed;
220 1.29 kiyohara if (hwdst->iha_maxrec > myaddr->iha_maxrec)
221 1.29 kiyohara hwdst->iha_maxrec = myaddr->iha_maxrec;
222 1.29 kiyohara if (hwdst->iha_maxrec > (8 + hwdst->iha_speed))
223 1.29 kiyohara hwdst->iha_maxrec = 8 + hwdst->iha_speed;
224 1.29 kiyohara if (hwdst->iha_maxrec < 8)
225 1.29 kiyohara hwdst->iha_maxrec = 8;
226 1.29 kiyohara
227 1.29 kiyohara m0 = ieee1394_fragment(ifp, m0, (2<<hwdst->iha_maxrec) - hdrlen, etype);
228 1.2 onoe if (m0 == NULL)
229 1.2 onoe senderr(ENOBUFS);
230 1.3 onoe
231 1.2 onoe while ((m = m0) != NULL) {
232 1.2 onoe m0 = m->m_nextpkt;
233 1.55 knakahar
234 1.56 knakahar error = if_transmit_lock(ifp, m);
235 1.14 itojun if (error) {
236 1.14 itojun /* mbuf is already freed */
237 1.14 itojun goto bad;
238 1.14 itojun }
239 1.2 onoe }
240 1.2 onoe return 0;
241 1.1 onoe
242 1.1 onoe bad:
243 1.1 onoe while (m0 != NULL) {
244 1.1 onoe m = m0->m_nextpkt;
245 1.1 onoe m_freem(m0);
246 1.1 onoe m0 = m;
247 1.1 onoe }
248 1.1 onoe
249 1.1 onoe return error;
250 1.1 onoe }
251 1.1 onoe
252 1.2 onoe struct mbuf *
253 1.2 onoe ieee1394_fragment(struct ifnet *ifp, struct mbuf *m0, int maxsize,
254 1.39 matt uint16_t etype)
255 1.2 onoe {
256 1.2 onoe struct ieee1394com *ic = (struct ieee1394com *)ifp;
257 1.2 onoe int totlen, fraglen, off;
258 1.2 onoe struct mbuf *m, **mp;
259 1.2 onoe struct ieee1394_fraghdr *ifh;
260 1.2 onoe struct ieee1394_unfraghdr *iuh;
261 1.2 onoe
262 1.2 onoe totlen = m0->m_pkthdr.len;
263 1.2 onoe if (totlen + sizeof(struct ieee1394_unfraghdr) <= maxsize) {
264 1.2 onoe M_PREPEND(m0, sizeof(struct ieee1394_unfraghdr), M_DONTWAIT);
265 1.2 onoe if (m0 == NULL)
266 1.2 onoe goto bad;
267 1.2 onoe iuh = mtod(m0, struct ieee1394_unfraghdr *);
268 1.2 onoe iuh->iuh_ft = 0;
269 1.2 onoe iuh->iuh_etype = etype;
270 1.2 onoe return m0;
271 1.2 onoe }
272 1.2 onoe
273 1.2 onoe fraglen = maxsize - sizeof(struct ieee1394_fraghdr);
274 1.2 onoe
275 1.2 onoe M_PREPEND(m0, sizeof(struct ieee1394_fraghdr), M_DONTWAIT);
276 1.2 onoe if (m0 == NULL)
277 1.2 onoe goto bad;
278 1.2 onoe ifh = mtod(m0, struct ieee1394_fraghdr *);
279 1.2 onoe ifh->ifh_ft_size = htons(IEEE1394_FT_MORE | (totlen - 1));
280 1.2 onoe ifh->ifh_etype_off = etype;
281 1.2 onoe ifh->ifh_dgl = htons(ic->ic_dgl);
282 1.2 onoe ifh->ifh_reserved = 0;
283 1.2 onoe off = fraglen;
284 1.2 onoe mp = &m0->m_nextpkt;
285 1.2 onoe while (off < totlen) {
286 1.2 onoe if (off + fraglen > totlen)
287 1.2 onoe fraglen = totlen - off;
288 1.2 onoe MGETHDR(m, M_DONTWAIT, MT_HEADER);
289 1.2 onoe if (m == NULL)
290 1.2 onoe goto bad;
291 1.2 onoe m->m_flags |= m0->m_flags & (M_BCAST|M_MCAST); /* copy bcast */
292 1.65 maxv m_align(m, sizeof(struct ieee1394_fraghdr));
293 1.2 onoe m->m_len = sizeof(struct ieee1394_fraghdr);
294 1.2 onoe ifh = mtod(m, struct ieee1394_fraghdr *);
295 1.2 onoe ifh->ifh_ft_size =
296 1.2 onoe htons(IEEE1394_FT_SUBSEQ | IEEE1394_FT_MORE | (totlen - 1));
297 1.2 onoe ifh->ifh_etype_off = htons(off);
298 1.2 onoe ifh->ifh_dgl = htons(ic->ic_dgl);
299 1.2 onoe ifh->ifh_reserved = 0;
300 1.60 maxv m->m_next = m_copym(m0, sizeof(*ifh) + off, fraglen, M_DONTWAIT);
301 1.57 maxv if (m->m_next == NULL) {
302 1.57 maxv m_freem(m);
303 1.2 onoe goto bad;
304 1.57 maxv }
305 1.3 onoe m->m_pkthdr.len = sizeof(*ifh) + fraglen;
306 1.2 onoe off += fraglen;
307 1.2 onoe *mp = m;
308 1.2 onoe mp = &m->m_nextpkt;
309 1.2 onoe }
310 1.2 onoe ifh->ifh_ft_size &= ~htons(IEEE1394_FT_MORE); /* last fragment */
311 1.2 onoe m_adj(m0, -(m0->m_pkthdr.len - maxsize));
312 1.2 onoe
313 1.2 onoe ic->ic_dgl++;
314 1.2 onoe return m0;
315 1.2 onoe
316 1.2 onoe bad:
317 1.2 onoe while ((m = m0) != NULL) {
318 1.2 onoe m0 = m->m_nextpkt;
319 1.2 onoe m->m_nextpkt = NULL;
320 1.2 onoe m_freem(m);
321 1.2 onoe }
322 1.2 onoe return NULL;
323 1.2 onoe }
324 1.2 onoe
325 1.29 kiyohara void
326 1.39 matt ieee1394_input(struct ifnet *ifp, struct mbuf *m, uint16_t src)
327 1.1 onoe {
328 1.47 rmind pktqueue_t *pktq = NULL;
329 1.39 matt uint16_t etype;
330 1.1 onoe struct ieee1394_unfraghdr *iuh;
331 1.1 onoe
332 1.1 onoe if ((ifp->if_flags & IFF_UP) == 0) {
333 1.1 onoe m_freem(m);
334 1.1 onoe return;
335 1.1 onoe }
336 1.29 kiyohara if (m->m_len < sizeof(*iuh)) {
337 1.29 kiyohara if ((m = m_pullup(m, sizeof(*iuh))) == NULL)
338 1.2 onoe return;
339 1.2 onoe }
340 1.1 onoe
341 1.29 kiyohara iuh = mtod(m, struct ieee1394_unfraghdr *);
342 1.2 onoe
343 1.2 onoe if (ntohs(iuh->iuh_ft) & (IEEE1394_FT_SUBSEQ | IEEE1394_FT_MORE)) {
344 1.29 kiyohara if ((m = ieee1394_reass(ifp, m, src)) == NULL)
345 1.2 onoe return;
346 1.29 kiyohara iuh = mtod(m, struct ieee1394_unfraghdr *);
347 1.1 onoe }
348 1.1 onoe etype = ntohs(iuh->iuh_etype);
349 1.1 onoe
350 1.1 onoe /* strip off the ieee1394 header */
351 1.29 kiyohara m_adj(m, sizeof(*iuh));
352 1.30 kiyohara if (ifp->if_bpf) {
353 1.30 kiyohara struct ieee1394_bpfhdr h;
354 1.30 kiyohara struct m_tag *mtag;
355 1.36 dyoung const struct ieee1394_hwaddr *myaddr;
356 1.30 kiyohara
357 1.64 maxv mtag = m_tag_find(m, MTAG_FIREWIRE_SENDER_EUID);
358 1.30 kiyohara if (mtag)
359 1.30 kiyohara memcpy(h.ibh_shost, mtag + 1, 8);
360 1.30 kiyohara else
361 1.30 kiyohara memset(h.ibh_shost, 0, 8);
362 1.30 kiyohara if (m->m_flags & M_BCAST)
363 1.30 kiyohara memcpy(h.ibh_dhost,
364 1.30 kiyohara ((const struct ieee1394_hwaddr *)
365 1.30 kiyohara ifp->if_broadcastaddr)->iha_uid, 8);
366 1.30 kiyohara else {
367 1.36 dyoung myaddr =
368 1.36 dyoung (const struct ieee1394_hwaddr *)CLLADDR(ifp->if_sadl);
369 1.30 kiyohara memcpy(h.ibh_dhost, myaddr->iha_uid, 8);
370 1.30 kiyohara }
371 1.30 kiyohara h.ibh_type = htons(etype);
372 1.63 msaitoh bpf_mtap2(ifp->if_bpf, &h, sizeof(h), m, BPF_D_IN);
373 1.30 kiyohara }
374 1.1 onoe
375 1.1 onoe switch (etype) {
376 1.1 onoe #ifdef INET
377 1.1 onoe case ETHERTYPE_IP:
378 1.47 rmind pktq = ip_pktq;
379 1.1 onoe break;
380 1.1 onoe
381 1.1 onoe case ETHERTYPE_ARP:
382 1.68 thorpej pktq = arp_pktq;
383 1.17 enami break;
384 1.1 onoe #endif /* INET */
385 1.1 onoe
386 1.1 onoe #ifdef INET6
387 1.1 onoe case ETHERTYPE_IPV6:
388 1.47 rmind pktq = ip6_pktq;
389 1.1 onoe break;
390 1.1 onoe #endif /* INET6 */
391 1.1 onoe
392 1.1 onoe default:
393 1.1 onoe m_freem(m);
394 1.1 onoe return;
395 1.1 onoe }
396 1.1 onoe
397 1.68 thorpej KASSERT(pktq != NULL);
398 1.68 thorpej if (__predict_false(!pktq_enqueue(pktq, m, 0))) {
399 1.68 thorpej m_freem(m);
400 1.47 rmind }
401 1.1 onoe }
402 1.1 onoe
403 1.2 onoe static struct mbuf *
404 1.39 matt ieee1394_reass(struct ifnet *ifp, struct mbuf *m0, uint16_t src)
405 1.2 onoe {
406 1.2 onoe struct ieee1394com *ic = (struct ieee1394com *)ifp;
407 1.2 onoe struct ieee1394_fraghdr *ifh;
408 1.2 onoe struct ieee1394_unfraghdr *iuh;
409 1.2 onoe struct ieee1394_reassq *rq;
410 1.25 christos struct ieee1394_reass_pkt *rp, *trp, *nrp = NULL;
411 1.2 onoe int len;
412 1.39 matt uint16_t etype, off, ftype, size, dgl;
413 1.39 matt uint32_t id;
414 1.2 onoe
415 1.29 kiyohara if (m0->m_len < sizeof(*ifh)) {
416 1.29 kiyohara if ((m0 = m_pullup(m0, sizeof(*ifh))) == NULL)
417 1.2 onoe return NULL;
418 1.2 onoe }
419 1.29 kiyohara ifh = mtod(m0, struct ieee1394_fraghdr *);
420 1.29 kiyohara m_adj(m0, sizeof(*ifh));
421 1.2 onoe size = ntohs(ifh->ifh_ft_size);
422 1.2 onoe ftype = size & (IEEE1394_FT_SUBSEQ | IEEE1394_FT_MORE);
423 1.2 onoe size = (size & ~ftype) + 1;
424 1.29 kiyohara dgl = ntohs(ifh->ifh_dgl);
425 1.2 onoe len = m0->m_pkthdr.len;
426 1.29 kiyohara id = dgl | (src << 16);
427 1.2 onoe if (ftype & IEEE1394_FT_SUBSEQ) {
428 1.61 maxv m_remove_pkthdr(m0);
429 1.29 kiyohara etype = 0;
430 1.2 onoe off = ntohs(ifh->ifh_etype_off);
431 1.29 kiyohara } else {
432 1.29 kiyohara etype = ifh->ifh_etype_off;
433 1.2 onoe off = 0;
434 1.29 kiyohara }
435 1.2 onoe
436 1.2 onoe for (rq = LIST_FIRST(&ic->ic_reassq); ; rq = LIST_NEXT(rq, rq_node)) {
437 1.2 onoe if (rq == NULL) {
438 1.2 onoe /*
439 1.2 onoe * Create a new reassemble queue head for the node.
440 1.2 onoe */
441 1.2 onoe rq = malloc(sizeof(*rq), M_FTABLE, M_NOWAIT);
442 1.2 onoe if (rq == NULL) {
443 1.2 onoe m_freem(m0);
444 1.2 onoe return NULL;
445 1.2 onoe }
446 1.29 kiyohara rq->fr_id = id;
447 1.2 onoe LIST_INIT(&rq->rq_pkt);
448 1.2 onoe LIST_INSERT_HEAD(&ic->ic_reassq, rq, rq_node);
449 1.2 onoe break;
450 1.2 onoe }
451 1.29 kiyohara if (rq->fr_id == id)
452 1.2 onoe break;
453 1.2 onoe }
454 1.2 onoe for (rp = LIST_FIRST(&rq->rq_pkt); rp != NULL; rp = nrp) {
455 1.2 onoe nrp = LIST_NEXT(rp, rp_next);
456 1.2 onoe if (rp->rp_dgl != dgl)
457 1.2 onoe continue;
458 1.3 onoe /*
459 1.3 onoe * sanity check:
460 1.3 onoe * datagram size must be same for all fragments, and
461 1.3 onoe * no overlap is allowed.
462 1.3 onoe */
463 1.3 onoe if (rp->rp_size != size ||
464 1.3 onoe (off < rp->rp_off + rp->rp_len && off + len > rp->rp_off)) {
465 1.2 onoe /*
466 1.3 onoe * This happens probably due to wrapping dgl value.
467 1.3 onoe * Destroy all previously received fragment and
468 1.3 onoe * enqueue current fragment.
469 1.2 onoe */
470 1.3 onoe for (rp = LIST_FIRST(&rq->rq_pkt); rp != NULL;
471 1.3 onoe rp = nrp) {
472 1.3 onoe nrp = LIST_NEXT(rp, rp_next);
473 1.3 onoe if (rp->rp_dgl == dgl) {
474 1.3 onoe LIST_REMOVE(rp, rp_next);
475 1.3 onoe m_freem(rp->rp_m);
476 1.3 onoe free(rp, M_FTABLE);
477 1.3 onoe }
478 1.3 onoe }
479 1.3 onoe break;
480 1.2 onoe }
481 1.2 onoe if (rp->rp_off + rp->rp_len == off) {
482 1.2 onoe /*
483 1.2 onoe * All the subsequent fragments received in sequence
484 1.2 onoe * come here.
485 1.2 onoe * Concatinate mbuf to previous one instead of
486 1.2 onoe * allocating new reassemble queue structure,
487 1.2 onoe * and try to merge more with the subsequent fragment
488 1.2 onoe * in the queue.
489 1.2 onoe */
490 1.2 onoe m_cat(rp->rp_m, m0);
491 1.2 onoe rp->rp_len += len;
492 1.2 onoe while (rp->rp_off + rp->rp_len < size &&
493 1.2 onoe nrp != NULL && nrp->rp_dgl == dgl &&
494 1.2 onoe nrp->rp_off == rp->rp_off + rp->rp_len) {
495 1.2 onoe LIST_REMOVE(nrp, rp_next);
496 1.2 onoe m_cat(rp->rp_m, nrp->rp_m);
497 1.2 onoe rp->rp_len += nrp->rp_len;
498 1.3 onoe free(nrp, M_FTABLE);
499 1.2 onoe nrp = LIST_NEXT(rp, rp_next);
500 1.2 onoe }
501 1.2 onoe m0 = NULL; /* mark merged */
502 1.2 onoe break;
503 1.2 onoe }
504 1.2 onoe if (off + m0->m_pkthdr.len == rp->rp_off) {
505 1.2 onoe m_cat(m0, rp->rp_m);
506 1.2 onoe rp->rp_m = m0;
507 1.2 onoe rp->rp_off = off;
508 1.29 kiyohara rp->rp_etype = etype; /* over writing trust etype */
509 1.2 onoe rp->rp_len += len;
510 1.2 onoe m0 = NULL; /* mark merged */
511 1.2 onoe break;
512 1.2 onoe }
513 1.2 onoe if (rp->rp_off > off) {
514 1.2 onoe /* insert before rp */
515 1.2 onoe nrp = rp;
516 1.2 onoe break;
517 1.2 onoe }
518 1.2 onoe if (nrp == NULL || nrp->rp_dgl != dgl) {
519 1.2 onoe /* insert after rp */
520 1.2 onoe nrp = NULL;
521 1.2 onoe break;
522 1.2 onoe }
523 1.2 onoe }
524 1.2 onoe if (m0 == NULL) {
525 1.2 onoe if (rp->rp_off != 0 || rp->rp_len != size)
526 1.2 onoe return NULL;
527 1.2 onoe /* fragment done */
528 1.2 onoe LIST_REMOVE(rp, rp_next);
529 1.2 onoe m0 = rp->rp_m;
530 1.2 onoe m0->m_pkthdr.len = rp->rp_len;
531 1.29 kiyohara M_PREPEND(m0, sizeof(*iuh), M_DONTWAIT);
532 1.2 onoe if (m0 != NULL) {
533 1.29 kiyohara iuh = mtod(m0, struct ieee1394_unfraghdr *);
534 1.2 onoe iuh->iuh_ft = 0;
535 1.2 onoe iuh->iuh_etype = rp->rp_etype;
536 1.2 onoe }
537 1.2 onoe free(rp, M_FTABLE);
538 1.2 onoe return m0;
539 1.2 onoe }
540 1.2 onoe
541 1.2 onoe /*
542 1.2 onoe * New fragment received. Allocate reassemble queue structure.
543 1.2 onoe */
544 1.2 onoe trp = malloc(sizeof(*trp), M_FTABLE, M_NOWAIT);
545 1.2 onoe if (trp == NULL) {
546 1.2 onoe m_freem(m0);
547 1.2 onoe return NULL;
548 1.2 onoe }
549 1.2 onoe trp->rp_m = m0;
550 1.2 onoe trp->rp_size = size;
551 1.29 kiyohara trp->rp_etype = etype; /* valid only if off==0 */
552 1.2 onoe trp->rp_off = off;
553 1.2 onoe trp->rp_dgl = dgl;
554 1.2 onoe trp->rp_len = len;
555 1.3 onoe trp->rp_ttl = IEEE1394_REASS_TIMEOUT;
556 1.3 onoe if (trp->rp_ttl <= ifp->if_timer)
557 1.3 onoe trp->rp_ttl = ifp->if_timer + 1;
558 1.2 onoe
559 1.2 onoe if (rp == NULL) {
560 1.2 onoe /* first fragment for the dgl */
561 1.2 onoe LIST_INSERT_HEAD(&rq->rq_pkt, trp, rp_next);
562 1.2 onoe } else if (nrp == NULL) {
563 1.2 onoe /* no next fragment for the dgl */
564 1.2 onoe LIST_INSERT_AFTER(rp, trp, rp_next);
565 1.2 onoe } else {
566 1.2 onoe /* there is a hole */
567 1.2 onoe LIST_INSERT_BEFORE(nrp, trp, rp_next);
568 1.2 onoe }
569 1.2 onoe return NULL;
570 1.2 onoe }
571 1.2 onoe
572 1.3 onoe void
573 1.3 onoe ieee1394_drain(struct ifnet *ifp)
574 1.3 onoe {
575 1.3 onoe struct ieee1394com *ic = (struct ieee1394com *)ifp;
576 1.3 onoe struct ieee1394_reassq *rq;
577 1.3 onoe struct ieee1394_reass_pkt *rp;
578 1.3 onoe
579 1.3 onoe while ((rq = LIST_FIRST(&ic->ic_reassq)) != NULL) {
580 1.3 onoe LIST_REMOVE(rq, rq_node);
581 1.3 onoe while ((rp = LIST_FIRST(&rq->rq_pkt)) != NULL) {
582 1.3 onoe LIST_REMOVE(rp, rp_next);
583 1.3 onoe m_freem(rp->rp_m);
584 1.3 onoe free(rp, M_FTABLE);
585 1.3 onoe }
586 1.3 onoe free(rq, M_FTABLE);
587 1.3 onoe }
588 1.3 onoe }
589 1.3 onoe
590 1.3 onoe void
591 1.3 onoe ieee1394_watchdog(struct ifnet *ifp)
592 1.3 onoe {
593 1.3 onoe struct ieee1394com *ic = (struct ieee1394com *)ifp;
594 1.3 onoe struct ieee1394_reassq *rq;
595 1.3 onoe struct ieee1394_reass_pkt *rp, *nrp;
596 1.3 onoe int dec;
597 1.3 onoe
598 1.3 onoe dec = (ifp->if_timer > 0) ? ifp->if_timer : 1;
599 1.3 onoe for (rq = LIST_FIRST(&ic->ic_reassq); rq != NULL;
600 1.3 onoe rq = LIST_NEXT(rq, rq_node)) {
601 1.3 onoe for (rp = LIST_FIRST(&rq->rq_pkt); rp != NULL; rp = nrp) {
602 1.3 onoe nrp = LIST_NEXT(rp, rp_next);
603 1.3 onoe if (rp->rp_ttl >= dec)
604 1.3 onoe rp->rp_ttl -= dec;
605 1.3 onoe else {
606 1.3 onoe LIST_REMOVE(rp, rp_next);
607 1.3 onoe m_freem(rp->rp_m);
608 1.3 onoe free(rp, M_FTABLE);
609 1.3 onoe }
610 1.3 onoe }
611 1.3 onoe }
612 1.3 onoe }
613 1.3 onoe
614 1.1 onoe const char *
615 1.39 matt ieee1394_sprintf(const uint8_t *laddr)
616 1.1 onoe {
617 1.1 onoe static char buf[3*8];
618 1.1 onoe
619 1.1 onoe snprintf(buf, sizeof(buf), "%02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x",
620 1.1 onoe laddr[0], laddr[1], laddr[2], laddr[3],
621 1.1 onoe laddr[4], laddr[5], laddr[6], laddr[7]);
622 1.1 onoe return buf;
623 1.1 onoe }
624 1.1 onoe
625 1.1 onoe void
626 1.1 onoe ieee1394_ifattach(struct ifnet *ifp, const struct ieee1394_hwaddr *hwaddr)
627 1.1 onoe {
628 1.2 onoe struct ieee1394_hwaddr *baddr;
629 1.2 onoe struct ieee1394com *ic = (struct ieee1394com *)ifp;
630 1.1 onoe
631 1.1 onoe ifp->if_type = IFT_IEEE1394;
632 1.1 onoe ifp->if_hdrlen = sizeof(struct ieee1394_header);
633 1.6 thorpej ifp->if_dlt = DLT_EN10MB; /* XXX */
634 1.1 onoe ifp->if_mtu = IEEE1394MTU;
635 1.1 onoe ifp->if_output = ieee1394_output;
636 1.3 onoe ifp->if_drain = ieee1394_drain;
637 1.3 onoe ifp->if_watchdog = ieee1394_watchdog;
638 1.3 onoe ifp->if_timer = 1;
639 1.1 onoe if (ifp->if_baudrate == 0)
640 1.1 onoe ifp->if_baudrate = IF_Mbps(100);
641 1.7 thorpej
642 1.41 dyoung if_set_sadl(ifp, hwaddr, sizeof(struct ieee1394_hwaddr), true);
643 1.7 thorpej
644 1.28 yamt baddr = malloc(ifp->if_addrlen, M_DEVBUF, M_WAITOK);
645 1.2 onoe memset(baddr->iha_uid, 0xff, IEEE1394_ADDR_LEN);
646 1.3 onoe baddr->iha_speed = 0; /*XXX: how to determine the speed for bcast? */
647 1.2 onoe baddr->iha_maxrec = 512 << baddr->iha_speed;
648 1.2 onoe memset(baddr->iha_offset, 0, sizeof(baddr->iha_offset));
649 1.28 yamt ifp->if_broadcastaddr = (uint8_t *)baddr;
650 1.2 onoe LIST_INIT(&ic->ic_reassq);
651 1.45 joerg bpf_attach(ifp, DLT_APPLE_IP_OVER_IEEE1394,
652 1.45 joerg sizeof(struct ieee1394_hwaddr));
653 1.1 onoe }
654 1.1 onoe
655 1.1 onoe void
656 1.1 onoe ieee1394_ifdetach(struct ifnet *ifp)
657 1.1 onoe {
658 1.3 onoe ieee1394_drain(ifp);
659 1.45 joerg bpf_detach(ifp);
660 1.28 yamt free(__UNCONST(ifp->if_broadcastaddr), M_DEVBUF);
661 1.7 thorpej ifp->if_broadcastaddr = NULL;
662 1.1 onoe }
663 1.1 onoe
664 1.1 onoe int
665 1.34 christos ieee1394_ioctl(struct ifnet *ifp, u_long cmd, void *data)
666 1.1 onoe {
667 1.1 onoe struct ifreq *ifr = (struct ifreq *)data;
668 1.1 onoe struct ifaddr *ifa = (struct ifaddr *)data;
669 1.1 onoe int error = 0;
670 1.1 onoe
671 1.1 onoe switch (cmd) {
672 1.41 dyoung case SIOCINITIFADDR:
673 1.1 onoe ifp->if_flags |= IFF_UP;
674 1.1 onoe switch (ifa->ifa_addr->sa_family) {
675 1.1 onoe #ifdef INET
676 1.1 onoe case AF_INET:
677 1.67 riastrad if ((error = if_init(ifp)) != 0)
678 1.1 onoe break;
679 1.16 itojun arp_ifinit(ifp, ifa);
680 1.1 onoe break;
681 1.1 onoe #endif /* INET */
682 1.1 onoe default:
683 1.67 riastrad error = if_init(ifp);
684 1.1 onoe break;
685 1.1 onoe }
686 1.1 onoe break;
687 1.1 onoe
688 1.1 onoe case SIOCSIFMTU:
689 1.1 onoe if (ifr->ifr_mtu > IEEE1394MTU)
690 1.1 onoe error = EINVAL;
691 1.38 dyoung else if ((error = ifioctl_common(ifp, cmd, data)) == ENETRESET)
692 1.38 dyoung error = 0;
693 1.1 onoe break;
694 1.1 onoe
695 1.1 onoe default:
696 1.41 dyoung error = ifioctl_common(ifp, cmd, data);
697 1.1 onoe break;
698 1.1 onoe }
699 1.1 onoe
700 1.1 onoe return error;
701 1.1 onoe }
702