1 /* $NetBSD: if_ieee1394subr.c,v 1.18 2002/06/25 03:42:28 onoe Exp $ */ 2 3 /* 4 * Copyright (c) 2000 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Atsushi Onoe. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 __KERNEL_RCSID(0, "$NetBSD: if_ieee1394subr.c,v 1.18 2002/06/25 03:42:28 onoe Exp $"); 41 42 #include "opt_inet.h" 43 #include "bpfilter.h" 44 45 #include <sys/param.h> 46 #include <sys/systm.h> 47 #include <sys/socket.h> 48 #include <sys/sockio.h> 49 #include <sys/kernel.h> 50 #include <sys/mbuf.h> 51 #include <sys/device.h> 52 53 #include <net/if.h> 54 #include <net/if_dl.h> 55 #include <net/if_ieee1394.h> 56 #include <net/if_types.h> 57 #include <net/if_media.h> 58 #include <net/ethertypes.h> 59 #include <net/netisr.h> 60 #include <net/route.h> 61 62 #if NBPFILTER > 0 63 #include <net/bpf.h> 64 #endif 65 66 #ifdef INET 67 #include <netinet/in.h> 68 #include <netinet/in_var.h> 69 #include <netinet/if_inarp.h> 70 #endif /* INET */ 71 #ifdef INET6 72 #include <netinet/in.h> 73 #include <netinet6/in6_var.h> 74 #include <netinet6/nd6.h> 75 #endif /* INET6 */ 76 77 #define IEEE1394_REASS_TIMEOUT 3 /* 3 sec */ 78 79 #define senderr(e) do { error = (e); goto bad; } while(0/*CONSTCOND*/) 80 81 static int ieee1394_output(struct ifnet *, struct mbuf *, struct sockaddr *, 82 struct rtentry *); 83 static void ieee1394_input(struct ifnet *, struct mbuf *); 84 static struct mbuf *ieee1394_reass(struct ifnet *, struct mbuf *); 85 86 static int 87 ieee1394_output(struct ifnet *ifp, struct mbuf *m0, struct sockaddr *dst, 88 struct rtentry *rt0) 89 { 90 u_int16_t etype = 0; 91 struct mbuf *m; 92 int s, hdrlen, error = 0; 93 struct rtentry *rt; 94 struct mbuf *mcopy = NULL; 95 struct ieee1394_hwaddr hwdst, *myaddr; 96 ALTQ_DECL(struct altq_pktattr pktattr;) 97 #ifdef INET 98 struct arphdr *ah; 99 #endif /* INET */ 100 101 if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) != (IFF_UP|IFF_RUNNING)) 102 senderr(ENETDOWN); 103 if ((rt = rt0) != NULL) { 104 if ((rt->rt_flags & RTF_UP) == 0) { 105 if ((rt0 = rt = rtalloc1(dst, 1)) != NULL) { 106 rt->rt_refcnt--; 107 if (rt->rt_ifp != ifp) 108 return (*rt->rt_ifp->if_output) 109 (ifp, m0, dst, rt); 110 } else 111 senderr(EHOSTUNREACH); 112 } 113 if (rt->rt_flags & RTF_GATEWAY) { 114 if (rt->rt_gwroute == NULL) 115 goto lookup; 116 if (((rt = rt->rt_gwroute)->rt_flags & RTF_UP) == 0) { 117 rtfree(rt); 118 rt = rt0; 119 lookup: 120 rt->rt_gwroute = rtalloc1(rt->rt_gateway, 1); 121 if ((rt = rt->rt_gwroute) == NULL) 122 senderr(EHOSTUNREACH); 123 /* the "G" test below also prevents rt == rt0 */ 124 if ((rt->rt_flags & RTF_GATEWAY) || 125 (rt->rt_ifp != ifp)) { 126 rt->rt_refcnt--; 127 rt0->rt_gwroute = NULL; 128 senderr(EHOSTUNREACH); 129 } 130 } 131 } 132 if (rt->rt_flags & RTF_REJECT) 133 if (rt->rt_rmx.rmx_expire == 0 || 134 time.tv_sec < rt->rt_rmx.rmx_expire) 135 senderr(rt == rt0 ? EHOSTDOWN : EHOSTUNREACH); 136 } 137 138 /* 139 * If the queueing discipline needs packet classification, 140 * do it before prepending link headers. 141 */ 142 IFQ_CLASSIFY(&ifp->if_snd, m0, dst->sa_family, &pktattr); 143 144 switch (dst->sa_family) { 145 #ifdef INET 146 case AF_INET: 147 if (m0->m_flags & (M_BCAST | M_MCAST)) 148 memcpy(&hwdst, ifp->if_broadcastaddr, sizeof(hwdst)); 149 else if (!arpresolve(ifp, rt, m0, dst, (u_char *)&hwdst)) 150 return 0; /* if not yet resolved */ 151 /* if broadcasting on a simplex interface, loopback a copy */ 152 if ((m0->m_flags & M_BCAST) && (ifp->if_flags & IFF_SIMPLEX)) 153 mcopy = m_copy(m0, 0, M_COPYALL); 154 etype = htons(ETHERTYPE_IP); 155 break; 156 case AF_ARP: 157 ah = mtod(m0, struct arphdr *); 158 memcpy(&hwdst, ifp->if_broadcastaddr, sizeof(hwdst)); 159 ah->ar_hrd = htons(ARPHRD_IEEE1394); 160 etype = htons(ETHERTYPE_ARP); 161 break; 162 #endif /* INET */ 163 #ifdef INET6 164 case AF_INET6: 165 if (m0->m_flags & M_MCAST) 166 memcpy(&hwdst, ifp->if_broadcastaddr, sizeof(hwdst)); 167 else if (!nd6_storelladdr(ifp, rt, m0, dst, (u_char *)&hwdst)) { 168 /* this must be impossible, so we bark */ 169 printf("ieee1394_output: nd6_storelladdr failed\n"); 170 return 0; 171 } 172 etype = htons(ETHERTYPE_IPV6); 173 break; 174 #endif /* INET6 */ 175 176 case pseudo_AF_HDRCMPLT: 177 case AF_UNSPEC: 178 /* TODO? */ 179 default: 180 printf("%s: can't handle af%d\n", ifp->if_xname, 181 dst->sa_family); 182 senderr(EAFNOSUPPORT); 183 break; 184 } 185 186 if (mcopy) 187 looutput(ifp, mcopy, dst, rt); 188 #if NBPFILTER > 0 189 /* XXX: emulate DLT_EN10MB */ 190 if (ifp->if_bpf) { 191 struct mbuf mb; 192 193 mb.m_next = m0; 194 mb.m_len = 14; 195 mb.m_data = mb.m_dat; 196 ((u_int32_t *)mb.m_data)[0] = 0; 197 ((u_int32_t *)mb.m_data)[1] = 0; 198 ((u_int32_t *)mb.m_data)[2] = 0; 199 ((u_int16_t *)mb.m_data)[6] = etype; 200 bpf_mtap(ifp->if_bpf, &mb); 201 } 202 #endif 203 myaddr = (struct ieee1394_hwaddr *)LLADDR(ifp->if_sadl); 204 if ((ifp->if_flags & IFF_SIMPLEX) && 205 memcmp(&hwdst, myaddr, IEEE1394_ADDR_LEN) == 0) 206 return looutput(ifp, m0, dst, rt); 207 208 /* 209 * XXX: 210 * The maximum possible rate depends on the topology. 211 * So the determination of maxrec and fragmentation should be 212 * called from the driver after probing the topology map. 213 */ 214 if (m0->m_flags & (M_BCAST | M_MCAST)) { 215 hdrlen = IEEE1394_GASP_LEN; 216 hwdst.iha_speed = 0; /* XXX */ 217 } else 218 hdrlen = 0; 219 if (hwdst.iha_speed > myaddr->iha_speed) 220 hwdst.iha_speed = myaddr->iha_speed; 221 if (hwdst.iha_maxrec > myaddr->iha_maxrec) 222 hwdst.iha_maxrec = myaddr->iha_maxrec; 223 if (hwdst.iha_maxrec > (8 + hwdst.iha_speed)) 224 hwdst.iha_maxrec = 8 + hwdst.iha_speed; 225 if (hwdst.iha_maxrec < 8) 226 hwdst.iha_maxrec = 8; 227 228 m0 = ieee1394_fragment(ifp, m0, (2<<hwdst.iha_maxrec) - hdrlen, etype); 229 if (m0 == NULL) 230 senderr(ENOBUFS); 231 232 s = splnet(); 233 ifp->if_obytes += m0->m_pkthdr.len; 234 if (m0->m_flags & M_MCAST) 235 ifp->if_omcasts++; 236 while ((m = m0) != NULL) { 237 m0 = m->m_nextpkt; 238 M_PREPEND(m, sizeof(struct ieee1394_header), M_DONTWAIT); 239 if (m == NULL) { 240 splx(s); 241 senderr(ENOBUFS); 242 } 243 memcpy(mtod(m, caddr_t), &hwdst, sizeof(hwdst)); 244 IFQ_ENQUEUE(&ifp->if_snd, m, &pktattr, error); 245 if (error) { 246 /* mbuf is already freed */ 247 splx(s); 248 goto bad; 249 } 250 } 251 if ((ifp->if_flags & IFF_OACTIVE) == 0) 252 (*ifp->if_start)(ifp); 253 splx(s); 254 return 0; 255 256 bad: 257 while (m0 != NULL) { 258 m = m0->m_nextpkt; 259 m_freem(m0); 260 m0 = m; 261 } 262 263 return error; 264 } 265 266 struct mbuf * 267 ieee1394_fragment(struct ifnet *ifp, struct mbuf *m0, int maxsize, 268 u_int16_t etype) 269 { 270 struct ieee1394com *ic = (struct ieee1394com *)ifp; 271 int totlen, fraglen, off; 272 struct mbuf *m, **mp; 273 struct ieee1394_fraghdr *ifh; 274 struct ieee1394_unfraghdr *iuh; 275 276 totlen = m0->m_pkthdr.len; 277 if (totlen + sizeof(struct ieee1394_unfraghdr) <= maxsize) { 278 M_PREPEND(m0, sizeof(struct ieee1394_unfraghdr), M_DONTWAIT); 279 if (m0 == NULL) 280 goto bad; 281 iuh = mtod(m0, struct ieee1394_unfraghdr *); 282 iuh->iuh_ft = 0; 283 iuh->iuh_etype = etype; 284 return m0; 285 } 286 287 fraglen = maxsize - sizeof(struct ieee1394_fraghdr); 288 289 M_PREPEND(m0, sizeof(struct ieee1394_fraghdr), M_DONTWAIT); 290 if (m0 == NULL) 291 goto bad; 292 ifh = mtod(m0, struct ieee1394_fraghdr *); 293 ifh->ifh_ft_size = htons(IEEE1394_FT_MORE | (totlen - 1)); 294 ifh->ifh_etype_off = etype; 295 ifh->ifh_dgl = htons(ic->ic_dgl); 296 ifh->ifh_reserved = 0; 297 off = fraglen; 298 mp = &m0->m_nextpkt; 299 while (off < totlen) { 300 if (off + fraglen > totlen) 301 fraglen = totlen - off; 302 MGETHDR(m, M_DONTWAIT, MT_HEADER); 303 if (m == NULL) 304 goto bad; 305 m->m_flags |= m0->m_flags & (M_BCAST|M_MCAST); /* copy bcast */ 306 MH_ALIGN(m, sizeof(struct ieee1394_fraghdr)); 307 m->m_len = sizeof(struct ieee1394_fraghdr); 308 ifh = mtod(m, struct ieee1394_fraghdr *); 309 ifh->ifh_ft_size = 310 htons(IEEE1394_FT_SUBSEQ | IEEE1394_FT_MORE | (totlen - 1)); 311 ifh->ifh_etype_off = htons(off); 312 ifh->ifh_dgl = htons(ic->ic_dgl); 313 ifh->ifh_reserved = 0; 314 m->m_next = m_copy(m0, sizeof(*ifh) + off, fraglen); 315 if (m->m_next == NULL) 316 goto bad; 317 m->m_pkthdr.len = sizeof(*ifh) + fraglen; 318 off += fraglen; 319 *mp = m; 320 mp = &m->m_nextpkt; 321 } 322 ifh->ifh_ft_size &= ~htons(IEEE1394_FT_MORE); /* last fragment */ 323 m_adj(m0, -(m0->m_pkthdr.len - maxsize)); 324 325 ic->ic_dgl++; 326 return m0; 327 328 bad: 329 while ((m = m0) != NULL) { 330 m0 = m->m_nextpkt; 331 m->m_nextpkt = NULL; 332 m_freem(m); 333 } 334 return NULL; 335 } 336 337 static void 338 ieee1394_input(struct ifnet *ifp, struct mbuf *m) 339 { 340 struct ifqueue *inq; 341 u_int16_t etype; 342 int s; 343 struct ieee1394_header *ih; 344 struct ieee1394_unfraghdr *iuh; 345 346 if ((ifp->if_flags & IFF_UP) == 0) { 347 m_freem(m); 348 return; 349 } 350 if (m->m_len < sizeof(*ih) + sizeof(*iuh)) { 351 if ((m = m_pullup(m, sizeof(*ih) + sizeof(*iuh))) == NULL) 352 return; 353 } 354 355 ih = mtod(m, struct ieee1394_header *); 356 iuh = (struct ieee1394_unfraghdr *)&ih[1]; 357 358 if (ntohs(iuh->iuh_ft) & (IEEE1394_FT_SUBSEQ | IEEE1394_FT_MORE)) { 359 if ((m = ieee1394_reass(ifp, m)) == NULL) 360 return; 361 ih = mtod(m, struct ieee1394_header *); 362 iuh = (struct ieee1394_unfraghdr *)&ih[1]; 363 } 364 etype = ntohs(iuh->iuh_etype); 365 366 /* strip off the ieee1394 header */ 367 m_adj(m, sizeof(*ih) + sizeof(*iuh)); 368 #if NBPFILTER > 0 369 /* XXX: emulate DLT_EN10MB */ 370 if (ifp->if_bpf) { 371 struct mbuf mb; 372 373 mb.m_next = m; 374 mb.m_len = 14; 375 mb.m_data = mb.m_dat; 376 ((u_int32_t *)mb.m_data)[0] = 0; 377 ((u_int32_t *)mb.m_data)[1] = 0; 378 ((u_int32_t *)mb.m_data)[2] = 0; 379 ((u_int16_t *)mb.m_data)[6] = iuh->iuh_etype; 380 bpf_mtap(ifp->if_bpf, &mb); 381 } 382 #endif 383 384 switch (etype) { 385 #ifdef INET 386 case ETHERTYPE_IP: 387 schednetisr(NETISR_IP); 388 inq = &ipintrq; 389 break; 390 391 case ETHERTYPE_ARP: 392 schednetisr(NETISR_ARP); 393 inq = &arpintrq; 394 break; 395 #endif /* INET */ 396 397 #ifdef INET6 398 case ETHERTYPE_IPV6: 399 schednetisr(NETISR_IPV6); 400 inq = &ip6intrq; 401 break; 402 #endif /* INET6 */ 403 404 default: 405 m_freem(m); 406 return; 407 } 408 409 s = splnet(); 410 if (IF_QFULL(inq)) { 411 IF_DROP(inq); 412 m_freem(m); 413 } else 414 IF_ENQUEUE(inq, m); 415 splx(s); 416 } 417 418 static struct mbuf * 419 ieee1394_reass(struct ifnet *ifp, struct mbuf *m0) 420 { 421 struct ieee1394com *ic = (struct ieee1394com *)ifp; 422 struct ieee1394_header *ih; 423 struct ieee1394_fraghdr *ifh; 424 struct ieee1394_unfraghdr *iuh; 425 struct ieee1394_reassq *rq; 426 struct ieee1394_reass_pkt *rp, *trp, *nrp; 427 int len; 428 u_int16_t off, ftype, size, dgl; 429 430 if (m0->m_len < sizeof(*ih) + sizeof(*ifh)) { 431 if ((m0 = m_pullup(m0, sizeof(*ih) + sizeof(*ifh))) == NULL) 432 return NULL; 433 } 434 ih = mtod(m0, struct ieee1394_header *); 435 ifh = (struct ieee1394_fraghdr *)&ih[1]; 436 m_adj(m0, sizeof(*ih) + sizeof(*ifh)); 437 size = ntohs(ifh->ifh_ft_size); 438 ftype = size & (IEEE1394_FT_SUBSEQ | IEEE1394_FT_MORE); 439 size = (size & ~ftype) + 1; 440 dgl = ifh->ifh_dgl; 441 len = m0->m_pkthdr.len; 442 if (ftype & IEEE1394_FT_SUBSEQ) { 443 m0->m_flags &= ~M_PKTHDR; 444 off = ntohs(ifh->ifh_etype_off); 445 } else 446 off = 0; 447 448 for (rq = LIST_FIRST(&ic->ic_reassq); ; rq = LIST_NEXT(rq, rq_node)) { 449 if (rq == NULL) { 450 /* 451 * Create a new reassemble queue head for the node. 452 */ 453 rq = malloc(sizeof(*rq), M_FTABLE, M_NOWAIT); 454 if (rq == NULL) { 455 m_freem(m0); 456 return NULL; 457 } 458 memcpy(rq->rq_uid, ih->ih_uid, IEEE1394_ADDR_LEN); 459 LIST_INIT(&rq->rq_pkt); 460 LIST_INSERT_HEAD(&ic->ic_reassq, rq, rq_node); 461 break; 462 } 463 if (memcmp(rq->rq_uid, ih->ih_uid, IEEE1394_ADDR_LEN) == 0) 464 break; 465 } 466 for (rp = LIST_FIRST(&rq->rq_pkt); rp != NULL; rp = nrp) { 467 nrp = LIST_NEXT(rp, rp_next); 468 if (rp->rp_dgl != dgl) 469 continue; 470 /* 471 * sanity check: 472 * datagram size must be same for all fragments, and 473 * no overlap is allowed. 474 */ 475 if (rp->rp_size != size || 476 (off < rp->rp_off + rp->rp_len && off + len > rp->rp_off)) { 477 /* 478 * This happens probably due to wrapping dgl value. 479 * Destroy all previously received fragment and 480 * enqueue current fragment. 481 */ 482 for (rp = LIST_FIRST(&rq->rq_pkt); rp != NULL; 483 rp = nrp) { 484 nrp = LIST_NEXT(rp, rp_next); 485 if (rp->rp_dgl == dgl) { 486 LIST_REMOVE(rp, rp_next); 487 m_freem(rp->rp_m); 488 free(rp, M_FTABLE); 489 } 490 } 491 break; 492 } 493 if (rp->rp_off + rp->rp_len == off) { 494 /* 495 * All the subsequent fragments received in sequence 496 * come here. 497 * Concatinate mbuf to previous one instead of 498 * allocating new reassemble queue structure, 499 * and try to merge more with the subsequent fragment 500 * in the queue. 501 */ 502 m_cat(rp->rp_m, m0); 503 rp->rp_len += len; 504 while (rp->rp_off + rp->rp_len < size && 505 nrp != NULL && nrp->rp_dgl == dgl && 506 nrp->rp_off == rp->rp_off + rp->rp_len) { 507 LIST_REMOVE(nrp, rp_next); 508 m_cat(rp->rp_m, nrp->rp_m); 509 rp->rp_len += nrp->rp_len; 510 free(nrp, M_FTABLE); 511 nrp = LIST_NEXT(rp, rp_next); 512 } 513 m0 = NULL; /* mark merged */ 514 break; 515 } 516 if (off + m0->m_pkthdr.len == rp->rp_off) { 517 m_cat(m0, rp->rp_m); 518 rp->rp_m = m0; 519 rp->rp_off = off; 520 rp->rp_len += len; 521 m0 = NULL; /* mark merged */ 522 break; 523 } 524 if (rp->rp_off > off) { 525 /* insert before rp */ 526 nrp = rp; 527 break; 528 } 529 if (nrp == NULL || nrp->rp_dgl != dgl) { 530 /* insert after rp */ 531 nrp = NULL; 532 break; 533 } 534 } 535 if (m0 == NULL) { 536 if (rp->rp_off != 0 || rp->rp_len != size) 537 return NULL; 538 /* fragment done */ 539 LIST_REMOVE(rp, rp_next); 540 m0 = rp->rp_m; 541 m0->m_pkthdr.len = rp->rp_len; 542 M_PREPEND(m0, sizeof(*ih) + sizeof(*iuh), M_DONTWAIT); 543 if (m0 != NULL) { 544 ih = mtod(m0, struct ieee1394_header *); 545 iuh = (struct ieee1394_unfraghdr *)&ih[1]; 546 memcpy(ih, &rp->rp_hdr, sizeof(*ih)); 547 iuh->iuh_ft = 0; 548 iuh->iuh_etype = rp->rp_etype; 549 } 550 free(rp, M_FTABLE); 551 return m0; 552 } 553 554 /* 555 * New fragment received. Allocate reassemble queue structure. 556 */ 557 trp = malloc(sizeof(*trp), M_FTABLE, M_NOWAIT); 558 if (trp == NULL) { 559 m_freem(m0); 560 return NULL; 561 } 562 trp->rp_m = m0; 563 memcpy(&trp->rp_hdr, ih, sizeof(*ih)); 564 trp->rp_size = size; 565 trp->rp_etype = ifh->ifh_etype_off; /* valid only if off==0 */ 566 trp->rp_off = off; 567 trp->rp_dgl = dgl; 568 trp->rp_len = len; 569 trp->rp_ttl = IEEE1394_REASS_TIMEOUT; 570 if (trp->rp_ttl <= ifp->if_timer) 571 trp->rp_ttl = ifp->if_timer + 1; 572 573 if (rp == NULL) { 574 /* first fragment for the dgl */ 575 LIST_INSERT_HEAD(&rq->rq_pkt, trp, rp_next); 576 } else if (nrp == NULL) { 577 /* no next fragment for the dgl */ 578 LIST_INSERT_AFTER(rp, trp, rp_next); 579 } else { 580 /* there is a hole */ 581 LIST_INSERT_BEFORE(nrp, trp, rp_next); 582 } 583 return NULL; 584 } 585 586 void 587 ieee1394_drain(struct ifnet *ifp) 588 { 589 struct ieee1394com *ic = (struct ieee1394com *)ifp; 590 struct ieee1394_reassq *rq; 591 struct ieee1394_reass_pkt *rp; 592 593 while ((rq = LIST_FIRST(&ic->ic_reassq)) != NULL) { 594 LIST_REMOVE(rq, rq_node); 595 while ((rp = LIST_FIRST(&rq->rq_pkt)) != NULL) { 596 LIST_REMOVE(rp, rp_next); 597 m_freem(rp->rp_m); 598 free(rp, M_FTABLE); 599 } 600 free(rq, M_FTABLE); 601 } 602 } 603 604 void 605 ieee1394_watchdog(struct ifnet *ifp) 606 { 607 struct ieee1394com *ic = (struct ieee1394com *)ifp; 608 struct ieee1394_reassq *rq; 609 struct ieee1394_reass_pkt *rp, *nrp; 610 int dec; 611 612 dec = (ifp->if_timer > 0) ? ifp->if_timer : 1; 613 for (rq = LIST_FIRST(&ic->ic_reassq); rq != NULL; 614 rq = LIST_NEXT(rq, rq_node)) { 615 for (rp = LIST_FIRST(&rq->rq_pkt); rp != NULL; rp = nrp) { 616 nrp = LIST_NEXT(rp, rp_next); 617 if (rp->rp_ttl >= dec) 618 rp->rp_ttl -= dec; 619 else { 620 LIST_REMOVE(rp, rp_next); 621 m_freem(rp->rp_m); 622 free(rp, M_FTABLE); 623 } 624 } 625 } 626 } 627 628 const char * 629 ieee1394_sprintf(const u_int8_t *laddr) 630 { 631 static char buf[3*8]; 632 633 snprintf(buf, sizeof(buf), "%02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x", 634 laddr[0], laddr[1], laddr[2], laddr[3], 635 laddr[4], laddr[5], laddr[6], laddr[7]); 636 return buf; 637 } 638 639 void 640 ieee1394_ifattach(struct ifnet *ifp, const struct ieee1394_hwaddr *hwaddr) 641 { 642 struct ieee1394_hwaddr *baddr; 643 struct ieee1394com *ic = (struct ieee1394com *)ifp; 644 645 ifp->if_type = IFT_IEEE1394; 646 ifp->if_addrlen = sizeof(struct ieee1394_hwaddr); 647 ifp->if_hdrlen = sizeof(struct ieee1394_header); 648 ifp->if_dlt = DLT_EN10MB; /* XXX */ 649 ifp->if_mtu = IEEE1394MTU; 650 ifp->if_output = ieee1394_output; 651 ifp->if_input = ieee1394_input; 652 ifp->if_drain = ieee1394_drain; 653 ifp->if_watchdog = ieee1394_watchdog; 654 ifp->if_timer = 1; 655 if (ifp->if_baudrate == 0) 656 ifp->if_baudrate = IF_Mbps(100); 657 658 if_alloc_sadl(ifp); 659 memcpy(LLADDR(ifp->if_sadl), hwaddr, ifp->if_addrlen); 660 661 ifp->if_broadcastaddr = malloc(ifp->if_addrlen, M_DEVBUF, M_WAITOK); 662 baddr = (struct ieee1394_hwaddr *)ifp->if_broadcastaddr; 663 memset(baddr->iha_uid, 0xff, IEEE1394_ADDR_LEN); 664 baddr->iha_speed = 0; /*XXX: how to determine the speed for bcast? */ 665 baddr->iha_maxrec = 512 << baddr->iha_speed; 666 memset(baddr->iha_offset, 0, sizeof(baddr->iha_offset)); 667 LIST_INIT(&ic->ic_reassq); 668 #if NBPFILTER > 0 669 bpfattach(ifp, DLT_EN10MB, 14); /* XXX */ 670 #endif 671 } 672 673 void 674 ieee1394_ifdetach(struct ifnet *ifp) 675 { 676 ieee1394_drain(ifp); 677 #if NBPFILTER > 0 678 bpfdetach(ifp); 679 #endif 680 free(ifp->if_broadcastaddr, M_DEVBUF); 681 ifp->if_broadcastaddr = NULL; 682 if_free_sadl(ifp); 683 } 684 685 int 686 ieee1394_ioctl(struct ifnet *ifp, u_long cmd, caddr_t data) 687 { 688 struct ifreq *ifr = (struct ifreq *)data; 689 struct ifaddr *ifa = (struct ifaddr *)data; 690 int error = 0; 691 #if __NetBSD_Version__ < 105080000 692 int fw_init(struct ifnet *); 693 void fw_stop(struct ifnet *, int); 694 #endif 695 696 switch (cmd) { 697 case SIOCSIFADDR: 698 ifp->if_flags |= IFF_UP; 699 switch (ifa->ifa_addr->sa_family) { 700 #ifdef INET 701 case AF_INET: 702 #if __NetBSD_Version__ >= 105080000 703 if ((error = (*ifp->if_init)(ifp)) != 0) 704 #else 705 if ((error = fw_init(ifp)) != 0) 706 #endif 707 break; 708 arp_ifinit(ifp, ifa); 709 break; 710 #endif /* INET */ 711 default: 712 #if __NetBSD_Version__ >= 105080000 713 error = (*ifp->if_init)(ifp); 714 #else 715 error = fw_init(ifp); 716 #endif 717 break; 718 } 719 break; 720 721 case SIOCGIFADDR: 722 memcpy(((struct sockaddr *)&ifr->ifr_data)->sa_data, 723 LLADDR(ifp->if_sadl), IEEE1394_ADDR_LEN); 724 break; 725 726 case SIOCSIFMTU: 727 if (ifr->ifr_mtu > IEEE1394MTU) 728 error = EINVAL; 729 else 730 ifp->if_mtu = ifr->ifr_mtu; 731 break; 732 733 case SIOCSIFFLAGS: 734 #if __NetBSD_Version__ >= 105080000 735 if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) == IFF_RUNNING) 736 (*ifp->if_stop)(ifp, 1); 737 else if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) == IFF_UP) 738 error = (*ifp->if_init)(ifp); 739 else if ((ifp->if_flags & IFF_UP) != 0) 740 error = (*ifp->if_init)(ifp); 741 #else 742 if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) == IFF_RUNNING) 743 fw_stop(ifp, 1); 744 else if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) == IFF_UP) 745 error = fw_init(ifp); 746 else if ((ifp->if_flags & IFF_UP) != 0) 747 error = fw_init(ifp); 748 #endif 749 break; 750 751 case SIOCADDMULTI: 752 case SIOCDELMULTI: 753 /* nothing to do */ 754 break; 755 756 default: 757 error = ENOTTY; 758 break; 759 } 760 761 return error; 762 } 763