1 /* 2 * Copyright (c) 1987, 1989 Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * from if_sl.c,v 1.11 84/10/04 12:54:47 rick Exp 34 * 35 * from: @(#)if_sl.c 7.22 (Berkeley) 4/20/91 36 * if_sl.c,v 1.8 1993/05/22 11:42:11 cgd Exp 37 */ 38 39 /* 40 * Serial Line interface 41 * 42 * Rick Adams 43 * Center for Seismic Studies 44 * 1300 N 17th Street, Suite 1450 45 * Arlington, Virginia 22209 46 * (703)276-7900 47 * rick@seismo.ARPA 48 * seismo!rick 49 * 50 * Pounded on heavily by Chris Torek (chris@mimsy.umd.edu, umcp-cs!chris). 51 * N.B.: this belongs in netinet, not net, the way it stands now. 52 * Should have a link-layer type designation, but wouldn't be 53 * backwards-compatible. 54 * 55 * Converted to 4.3BSD Beta by Chris Torek. 56 * Other changes made at Berkeley, based in part on code by Kirk Smith. 57 * W. Jolitz added slip abort. 58 * 59 * Hacked almost beyond recognition by Van Jacobson (van@helios.ee.lbl.gov). 60 * Added priority queuing for "interactive" traffic; hooks for TCP 61 * header compression; ICMP filtering (at 2400 baud, some cretin 62 * pinging you can use up all your bandwidth). Made low clist behavior 63 * more robust and slightly less likely to hang serial line. 64 * Sped up a bunch of things. 65 * 66 * Note that splimp() is used throughout to block both (tty) input 67 * interrupts and network activity; thus, splimp must be >= spltty. 68 */ 69 70 #include "sl.h" 71 #if NSL > 0 72 73 #include "param.h" 74 #include "proc.h" 75 #include "mbuf.h" 76 #include "buf.h" 77 #include "dkstat.h" 78 #include "socket.h" 79 #include "ioctl.h" 80 #include "file.h" 81 #include "tty.h" 82 #include "kernel.h" 83 #include "conf.h" 84 85 #include "if.h" 86 #include "if_types.h" 87 #include "netisr.h" 88 #include "route.h" 89 #if INET 90 #include "netinet/in.h" 91 #include "netinet/in_systm.h" 92 #include "netinet/in_var.h" 93 #include "netinet/ip.h" 94 #else 95 Huh? Slip without inet? 96 #endif 97 98 #include "machine/mtpr.h" 99 100 #include "slcompress.h" 101 #include "if_slvar.h" 102 #include "slip.h" 103 104 #include "bpfilter.h" 105 #if NBPFILTER > 0 106 #include <sys/time.h> 107 #include <net/bpf.h> 108 #endif 109 110 /* 111 * SLMAX is a hard limit on input packet size. To simplify the code 112 * and improve performance, we require that packets fit in an mbuf 113 * cluster, and if we get a compressed packet, there's enough extra 114 * room to expand the header into a max length tcp/ip header (128 115 * bytes). So, SLMAX can be at most 116 * MCLBYTES - 128 117 * 118 * SLMTU is a hard limit on output packet size. To insure good 119 * interactive response, SLMTU wants to be the smallest size that 120 * amortizes the header cost. (Remember that even with 121 * type-of-service queuing, we have to wait for any in-progress 122 * packet to finish. I.e., we wait, on the average, 1/2 * mtu / 123 * cps, where cps is the line speed in characters per second. 124 * E.g., 533ms wait for a 1024 byte MTU on a 9600 baud line. The 125 * average compressed header size is 6-8 bytes so any MTU > 90 126 * bytes will give us 90% of the line bandwidth. A 100ms wait is 127 * tolerable (500ms is not), so want an MTU around 296. (Since TCP 128 * will send 256 byte segments (to allow for 40 byte headers), the 129 * typical packet size on the wire will be around 260 bytes). In 130 * 4.3tahoe+ systems, we can set an MTU in a route so we do that & 131 * leave the interface MTU relatively high (so we don't IP fragment 132 * when acting as a gateway to someone using a stupid MTU). 133 * 134 * Similar considerations apply to SLIP_HIWAT: It's the amount of 135 * data that will be queued 'downstream' of us (i.e., in clists 136 * waiting to be picked up by the tty output interrupt). If we 137 * queue a lot of data downstream, it's immune to our t.o.s. queuing. 138 * E.g., if SLIP_HIWAT is 1024, the interactive traffic in mixed 139 * telnet/ftp will see a 1 sec wait, independent of the mtu (the 140 * wait is dependent on the ftp window size but that's typically 141 * 1k - 4k). So, we want SLIP_HIWAT just big enough to amortize 142 * the cost (in idle time on the wire) of the tty driver running 143 * off the end of its clists & having to call back slstart for a 144 * new packet. For a tty interface with any buffering at all, this 145 * cost will be zero. Even with a totally brain dead interface (like 146 * the one on a typical workstation), the cost will be <= 1 character 147 * time. So, setting SLIP_HIWAT to ~100 guarantees that we'll lose 148 * at most 1% while maintaining good interactive response. 149 */ 150 #if NBPFILTER > 0 151 #define BUFOFFSET (128+sizeof(struct ifnet **)+SLIP_HDRLEN) 152 #else 153 #define BUFOFFSET (128+sizeof(struct ifnet **)) 154 #endif 155 #define SLMAX (MCLBYTES - BUFOFFSET) 156 #define SLBUFSIZE (SLMAX + BUFOFFSET) 157 #define SLMTU 296 /* try 1006 later */ 158 #define SLIP_HIWAT roundup(50,CBSIZE) 159 160 /* 161 * SLIP ABORT ESCAPE MECHANISM: 162 * (inspired by HAYES modem escape arrangement) 163 * 1sec escape 1sec escape 1sec escape { 1sec escape 1sec escape } 164 * signals a "soft" exit from slip mode by usermode process 165 */ 166 167 #ifdef ABT_ESC 168 #undef ABT_ESC 169 #define ABT_ESC '\033' /* can't be t_intr - distant host must know it*/ 170 #define ABT_WAIT 1 /* in seconds - idle before an escape & after */ 171 #define ABT_RECYCLE (5*2+2) /* in seconds - time window processing abort */ 172 #define ABT_SOFT 3 /* count of escapes */ 173 #endif /* ABT_ESC */ 174 175 /* 176 * The following disgusting hack gets around the problem that IP TOS 177 * can't be set yet. We want to put "interactive" traffic on a high 178 * priority queue. To decide if traffic is interactive, we check that 179 * a) it is TCP and b) one of its ports is telnet, rlogin or ftp control. 180 */ 181 static u_short interactive_ports[8] = { 182 0, 513, 0, 0, 183 0, 21, 0, 23, 184 }; 185 #define INTERACTIVE(p) (interactive_ports[(p) & 7] == (p)) 186 187 struct sl_softc sl_softc[NSL]; 188 189 #define FRAME_END 0xc0 /* Frame End */ 190 #define FRAME_ESCAPE 0xdb /* Frame Esc */ 191 #define TRANS_FRAME_END 0xdc /* transposed frame end */ 192 #define TRANS_FRAME_ESCAPE 0xdd /* transposed frame esc */ 193 194 #define t_sc T_LINEP 195 196 int sloutput(), slioctl(), ttrstrt(); 197 extern struct timeval time; 198 199 /* 200 * Called from boot code to establish sl interfaces. 201 */ 202 slattach() 203 { 204 register struct sl_softc *sc; 205 register int i = 0; 206 207 for (sc = sl_softc; i < NSL; sc++) { 208 sc->sc_if.if_name = "sl"; 209 sc->sc_if.if_unit = i++; 210 sc->sc_if.if_mtu = SLMTU; 211 sc->sc_if.if_flags = IFF_POINTOPOINT; 212 sc->sc_if.if_type = IFT_SLIP; 213 sc->sc_if.if_ioctl = slioctl; 214 sc->sc_if.if_output = sloutput; 215 sc->sc_if.if_snd.ifq_maxlen = 50; 216 sc->sc_fastq.ifq_maxlen = 32; 217 if_attach(&sc->sc_if); 218 #if NBPFILTER > 0 219 bpfattach(&sc->sc_bpf, &sc->sc_if, DLT_SLIP, 220 SLIP_HDRLEN); 221 #endif 222 } 223 } 224 225 static int 226 slinit(sc) 227 register struct sl_softc *sc; 228 { 229 register caddr_t p; 230 231 if (sc->sc_ep == (u_char *) 0) { 232 MCLALLOC(p, M_WAIT); 233 if (p) 234 sc->sc_ep = (u_char *)p + SLBUFSIZE; 235 else { 236 printf("sl%d: can't allocate buffer\n", sc - sl_softc); 237 sc->sc_if.if_flags &= ~IFF_UP; 238 return (0); 239 } 240 } 241 sc->sc_buf = sc->sc_ep - SLMAX; 242 sc->sc_mp = sc->sc_buf; 243 sl_compress_init(&sc->sc_comp); 244 return (1); 245 } 246 247 /* 248 * Line specific open routine. 249 * Attach the given tty to the first available sl unit. 250 */ 251 /* ARGSUSED */ 252 int 253 slopen(dev_t dev, struct tty *tp) 254 { 255 struct proc *p = curproc; /* XXX */ 256 register struct sl_softc *sc; 257 register int nsl; 258 int error; 259 260 if (error = suser(p->p_ucred, &p->p_acflag)) 261 return (error); 262 263 if (tp->t_line == SLIPDISC) 264 return (0); 265 266 for (nsl = NSL, sc = sl_softc; --nsl >= 0; sc++) 267 if (sc->sc_ttyp == NULL) { 268 if (slinit(sc) == 0) 269 return (ENOBUFS); 270 tp->t_sc = (caddr_t)sc; 271 sc->sc_ttyp = tp; 272 sc->sc_if.if_baudrate = tp->t_ospeed; 273 ttyflush(tp, FREAD | FWRITE); 274 return (0); 275 } 276 return (ENXIO); 277 } 278 279 /* 280 * Line specific close routine. 281 * Detach the tty from the sl unit. 282 * Mimics part of ttyclose(). 283 */ 284 void 285 slclose(tp, flag) 286 struct tty *tp; 287 int flag; 288 { 289 register struct sl_softc *sc; 290 int s; 291 292 ttywflush(tp); 293 s = splimp(); /* actually, max(spltty, splnet) */ 294 tp->t_line = 0; 295 sc = (struct sl_softc *)tp->t_sc; 296 if (sc != NULL) { 297 if_down(&sc->sc_if); 298 sc->sc_ttyp = NULL; 299 tp->t_sc = NULL; 300 MCLFREE((caddr_t)(sc->sc_ep - SLBUFSIZE)); 301 sc->sc_ep = 0; 302 sc->sc_mp = 0; 303 sc->sc_buf = 0; 304 } 305 splx(s); 306 } 307 308 /* 309 * Line specific (tty) ioctl routine. 310 * Provide a way to get the sl unit number. 311 */ 312 /* ARGSUSED */ 313 sltioctl(tp, cmd, data, flag) 314 struct tty *tp; 315 caddr_t data; 316 { 317 struct sl_softc *sc = (struct sl_softc *)tp->t_sc; 318 int s; 319 320 switch (cmd) { 321 case SLIOCGUNIT: 322 *(int *)data = sc->sc_if.if_unit; 323 break; 324 325 case SLIOCGFLAGS: 326 *(int *)data = sc->sc_flags; 327 break; 328 329 case SLIOCSFLAGS: 330 #define SC_MASK 0xffff 331 s = splimp(); 332 sc->sc_flags = 333 (sc->sc_flags &~ SC_MASK) | ((*(int *)data) & SC_MASK); 334 splx(s); 335 break; 336 337 default: 338 return (-1); 339 } 340 return (0); 341 } 342 343 /* 344 * Queue a packet. Start transmission if not active. 345 */ 346 sloutput(ifp, m, dst) 347 struct ifnet *ifp; 348 register struct mbuf *m; 349 struct sockaddr *dst; 350 { 351 register struct sl_softc *sc = &sl_softc[ifp->if_unit]; 352 register struct ip *ip; 353 register struct ifqueue *ifq; 354 int s; 355 356 /* 357 * `Cannot happen' (see slioctl). Someday we will extend 358 * the line protocol to support other address families. 359 */ 360 if (dst->sa_family != AF_INET) { 361 printf("sl%d: af%d not supported\n", sc->sc_if.if_unit, 362 dst->sa_family); 363 m_freem(m); 364 return (EAFNOSUPPORT); 365 } 366 367 if (sc->sc_ttyp == NULL) { 368 m_freem(m); 369 return (ENETDOWN); /* sort of */ 370 } 371 if ((sc->sc_ttyp->t_state & TS_CARR_ON) == 0) { 372 m_freem(m); 373 return (EHOSTUNREACH); 374 } 375 ifq = &sc->sc_if.if_snd; 376 if ((ip = mtod(m, struct ip *))->ip_p == IPPROTO_TCP) { 377 u_short srcport = ntohs(((short *)ip)[ip->ip_hl << 1]); 378 u_short dstport = ntohs(((short *)ip)[(ip->ip_hl << 1) + 1]); 379 380 if (INTERACTIVE(srcport) || INTERACTIVE(dstport)) { 381 ifq = &sc->sc_fastq; 382 } 383 384 } else if (sc->sc_flags & SC_NOICMP && ip->ip_p == IPPROTO_ICMP) { 385 m_freem(m); 386 return (0); 387 } 388 s = splimp(); 389 if (IF_QFULL(ifq)) { 390 IF_DROP(ifq); 391 m_freem(m); 392 splx(s); 393 sc->sc_if.if_oerrors++; 394 return (ENOBUFS); 395 } 396 IF_ENQUEUE(ifq, m); 397 sc->sc_if.if_lastchange = time; 398 if (sc->sc_ttyp->t_outq.c_cc == 0) 399 slstart(sc->sc_ttyp); 400 splx(s); 401 return (0); 402 } 403 404 /* 405 * Start output on interface. Get another datagram 406 * to send from the interface queue and map it to 407 * the interface before starting output. 408 */ 409 void 410 slstart(tp) 411 register struct tty *tp; 412 { 413 register struct sl_softc *sc = (struct sl_softc *)tp->t_sc; 414 register struct mbuf *m; 415 register u_char *cp; 416 register struct ip *ip; 417 int s; 418 struct mbuf *m2; 419 #if NBPFILTER > 0 420 u_char bpfbuf[SLMTU + SLIP_HDRLEN]; 421 register int len; 422 #endif 423 424 for (;;) { 425 /* 426 * If there is more in the output queue, just send it now. 427 * We are being called in lieu of ttstart and must do what 428 * it would. 429 */ 430 if (tp->t_outq.c_cc != 0) { 431 (*tp->t_oproc)(tp); 432 if (tp->t_outq.c_cc > SLIP_HIWAT) 433 return; 434 } 435 /* 436 * This happens briefly when the line shuts down. 437 */ 438 if (sc == NULL) 439 return; 440 441 /* 442 * Do not remove the packet from the IP queue if it 443 * doesn't look like the packet will fit into the 444 * current COM output queue, with a packet full of 445 * escapes this could be as bad as SLMTU*2. The size 446 * of the ring buffer must be at least SLMTU*2 to 447 * avoid deadlock. 448 */ 449 if (tp->t_outq.c_cn - tp->t_outq.c_cc < 2 * SLMTU) 450 return; 451 452 /* 453 * Get a packet and send it to the interface. 454 */ 455 s = splimp(); 456 IF_DEQUEUE(&sc->sc_fastq, m); 457 if (m == NULL) 458 IF_DEQUEUE(&sc->sc_if.if_snd, m); 459 splx(s); 460 if (m == NULL) 461 return; 462 /* 463 * We do the header compression here rather than in sl_output 464 * because the packets will be out of order if we are using TOS 465 * queueing, and the connection id compression will get messed 466 * up when this happens. 467 */ 468 #if NBPFILTER > 0 469 if (sc->sc_bpf) { 470 /* 471 * We need to save the TCP/IP header before it's compressed. 472 * To avoid complicated code, we just copy the entire packet 473 * into a stack buffer (since this is a serial line, packets 474 * should be short and/or the copy should be negligible cost 475 * compared to the packet transmission time). 476 */ 477 register struct mbuf *m1 = m; 478 register u_char *cp = bpfbuf + SLIP_HDRLEN; 479 len = 0; 480 do { 481 register int mlen = m1->m_len; 482 483 bcopy(mtod(m1, caddr_t), cp, mlen); 484 cp += mlen; 485 len += mlen; 486 } while (m1 = m1->m_next); 487 } 488 #endif 489 if ((ip = mtod(m, struct ip *))->ip_p == IPPROTO_TCP) { 490 if (sc->sc_flags & SC_COMPRESS) 491 *mtod(m, u_char *) |= sl_compress_tcp(m, ip, &sc->sc_comp, 1); 492 } 493 #if NBPFILTER > 0 494 if (sc->sc_bpf) { 495 /* 496 * Put the SLIP pseudo-"link header" in place. The compressed 497 * header is now at the beginning of the mbuf. 498 */ 499 bpfbuf[SLX_DIR] = SLIPDIR_OUT; 500 bcopy(mtod(m, caddr_t), &bpfbuf[SLX_CHDR], CHDR_LEN); 501 bpf_tap(sc->sc_bpf, bpfbuf, len + SLIP_HDRLEN); 502 } 503 #endif 504 505 sc->sc_if.if_lastchange = time; 506 507 /* 508 * The extra FRAME_END will start up a new packet, and thus 509 * will flush any accumulated garbage. We do this whenever 510 * the line may have been idle for some time. 511 */ 512 if (tp->t_outq.c_cc == 0) { 513 ++sc->sc_bytessent; 514 (void) putc(FRAME_END, &tp->t_outq); 515 } 516 517 while (m) { 518 register u_char *ep; 519 520 cp = mtod(m, u_char *); ep = cp + m->m_len; 521 while (cp < ep) { 522 /* 523 * Find out how many bytes in the string we can 524 * handle without doing something special. 525 */ 526 register u_char *bp = cp; 527 528 while (cp < ep) { 529 switch (*cp++) { 530 case FRAME_ESCAPE: 531 case FRAME_END: 532 --cp; 533 goto out; 534 } 535 } 536 out: 537 if (cp > bp) { 538 /* 539 * Put n characters at once 540 * into the tty output queue. 541 */ 542 if (b_to_q((u_char *)bp, cp - bp, &tp->t_outq)) 543 break; 544 sc->sc_bytessent += cp - bp; 545 } 546 /* 547 * If there are characters left in the mbuf, 548 * the first one must be special.. 549 * Put it out in a different form. 550 */ 551 if (cp < ep) { 552 if (putc(FRAME_ESCAPE, &tp->t_outq)) 553 break; 554 if (putc(*cp++ == FRAME_ESCAPE ? 555 TRANS_FRAME_ESCAPE : TRANS_FRAME_END, 556 &tp->t_outq)) { 557 (void) unputc(&tp->t_outq); 558 break; 559 } 560 sc->sc_bytessent += 2; 561 } 562 } 563 MFREE(m, m2); 564 m = m2; 565 } 566 567 if (putc(FRAME_END, &tp->t_outq)) { 568 /* 569 * Not enough room. Remove a char to make room 570 * and end the packet normally. 571 * If you get many collisions (more than one or two 572 * a day) you probably do not have enough clists 573 * and you should increase "nclist" in param.c. 574 */ 575 (void) unputc(&tp->t_outq); 576 (void) putc(FRAME_END, &tp->t_outq); 577 sc->sc_if.if_collisions++; 578 } else { 579 ++sc->sc_bytessent; 580 sc->sc_if.if_opackets++; 581 } 582 sc->sc_if.if_obytes = sc->sc_bytessent; 583 } 584 } 585 586 /* 587 * Copy data buffer to mbuf chain; add ifnet pointer. 588 */ 589 static struct mbuf * 590 sl_btom(sc, len) 591 register struct sl_softc *sc; 592 register int len; 593 { 594 register struct mbuf *m; 595 596 MGETHDR(m, M_DONTWAIT, MT_DATA); 597 if (m == NULL) 598 return (NULL); 599 600 /* 601 * If we have more than MHLEN bytes, it's cheaper to 602 * queue the cluster we just filled & allocate a new one 603 * for the input buffer. Otherwise, fill the mbuf we 604 * allocated above. Note that code in the input routine 605 * guarantees that packet will fit in a cluster. 606 */ 607 if (len >= MHLEN) { 608 MCLGET(m, M_DONTWAIT); 609 if ((m->m_flags & M_EXT) == 0) { 610 /* 611 * we couldn't get a cluster - if memory's this 612 * low, it's time to start dropping packets. 613 */ 614 (void) m_free(m); 615 return (NULL); 616 } 617 sc->sc_ep = mtod(m, u_char *) + SLBUFSIZE; 618 m->m_data = (caddr_t)sc->sc_buf; 619 m->m_ext.ext_buf = (caddr_t)((int)sc->sc_buf &~ MCLOFSET); 620 } else 621 bcopy((caddr_t)sc->sc_buf, mtod(m, caddr_t), len); 622 623 m->m_len = len; 624 m->m_pkthdr.len = len; 625 m->m_pkthdr.rcvif = &sc->sc_if; 626 return (m); 627 } 628 629 /* 630 * tty interface receiver interrupt. 631 */ 632 void 633 slinput(c, tp) 634 register int c; 635 register struct tty *tp; 636 { 637 register struct sl_softc *sc; 638 register struct mbuf *m; 639 register int len; 640 int s; 641 #if NBPFILTER > 0 642 u_char chdr[CHDR_LEN]; 643 #endif 644 tk_nin++; 645 sc = (struct sl_softc *)tp->t_sc; 646 if (sc == NULL) 647 return; 648 if (c & TTY_ERRORMASK|| !(tp->t_state&TS_CARR_ON)) { 649 sc->sc_flags |= SC_ERROR; 650 return; 651 } 652 653 ++sc->sc_bytesrcvd; 654 ++sc->sc_if.if_ibytes; 655 656 #ifdef ABT_ESC 657 if (sc->sc_flags & SC_ABORT) { 658 /* if we see an abort after "idle" time, count it */ 659 if (c == ABT_ESC && time.tv_sec >= sc->sc_lasttime + ABT_WAIT) { 660 sc->sc_abortcount++; 661 /* record when the first abort escape arrived */ 662 if (sc->sc_abortcount == 1) 663 sc->sc_starttime = time.tv_sec; 664 } 665 /* 666 * if we have an abort, see that we have not run out of time, 667 * or that we have an "idle" time after the complete escape 668 * sequence 669 */ 670 if (sc->sc_abortcount) { 671 if (time.tv_sec >= sc->sc_starttime + ABT_RECYCLE) 672 sc->sc_abortcount = 0; 673 if (sc->sc_abortcount >= ABT_SOFT && 674 time.tv_sec >= sc->sc_lasttime + ABT_WAIT) { 675 slclose(tp); 676 return; 677 } 678 } 679 sc->sc_lasttime = time.tv_sec; 680 } 681 #endif 682 683 switch (c) { 684 685 case TRANS_FRAME_ESCAPE: 686 if (sc->sc_escape) 687 c = FRAME_ESCAPE; 688 break; 689 690 case TRANS_FRAME_END: 691 if (sc->sc_escape) 692 c = FRAME_END; 693 break; 694 695 case FRAME_ESCAPE: 696 sc->sc_escape = 1; 697 return; 698 699 case FRAME_END: 700 if(sc->sc_flags & SC_ERROR) { 701 sc->sc_flags &= ~SC_ERROR; 702 goto newpack; 703 } 704 len = sc->sc_mp - sc->sc_buf; 705 706 if (len < 3) 707 /* less than min length packet - ignore */ 708 goto newpack; 709 710 #if NBPFILTER > 0 711 if (sc->sc_bpf) 712 /* 713 * Save the compressed header, so we can 714 * tack it on later. Note that we just 715 * we will end up copying garbage in some 716 * cases but this is okay. We remember 717 * where the buffer started so we can 718 * compute the new header length. 719 */ 720 bcopy(sc->sc_buf, chdr, CHDR_LEN); 721 #endif 722 if ((c = (*sc->sc_buf & 0xf0)) != (IPVERSION << 4)) { 723 if (c & 0x80) 724 c = TYPE_COMPRESSED_TCP; 725 else if (c == TYPE_UNCOMPRESSED_TCP) 726 *sc->sc_buf &= 0x4f; /* XXX */ 727 /* 728 * We've got something that's not an IP packet. 729 * If compression is enabled, try to decompress it. 730 * Otherwise, if `auto-enable' compression is on and 731 * it's a reasonable packet, decompress it and then 732 * enable compression. Otherwise, drop it. 733 */ 734 if (sc->sc_flags & SC_COMPRESS) { 735 len = sl_uncompress_tcp(&sc->sc_buf, len, 736 (u_int)c, &sc->sc_comp); 737 if (len <= 0) 738 goto error; 739 } else if ((sc->sc_flags & SC_AUTOCOMP) && 740 c == TYPE_UNCOMPRESSED_TCP && len >= 40) { 741 len = sl_uncompress_tcp(&sc->sc_buf, len, 742 (u_int)c, &sc->sc_comp); 743 if (len <= 0) 744 goto error; 745 sc->sc_flags |= SC_COMPRESS; 746 } else 747 goto error; 748 } 749 #if NBPFILTER > 0 750 if (sc->sc_bpf) { 751 /* 752 * Put the SLIP pseudo-"link header" in place. 753 * We couldn't do this any earlier since 754 * decompression probably moved the buffer 755 * pointer. Then, invoke BPF. 756 */ 757 register u_char *hp = sc->sc_buf - SLIP_HDRLEN; 758 759 hp[SLX_DIR] = SLIPDIR_IN; 760 bcopy(chdr, &hp[SLX_CHDR], CHDR_LEN); 761 bpf_tap(sc->sc_bpf, hp, len + SLIP_HDRLEN); 762 } 763 #endif 764 m = sl_btom(sc, len); 765 if (m == NULL) 766 goto error; 767 768 sc->sc_if.if_ipackets++; 769 sc->sc_if.if_lastchange = time; 770 s = splimp(); 771 if (IF_QFULL(&ipintrq)) { 772 IF_DROP(&ipintrq); 773 sc->sc_if.if_ierrors++; 774 sc->sc_if.if_iqdrops++; 775 m_freem(m); 776 } else { 777 IF_ENQUEUE(&ipintrq, m); 778 schednetisr(NETISR_IP); 779 } 780 splx(s); 781 goto newpack; 782 } 783 if (sc->sc_mp < sc->sc_ep) { 784 *sc->sc_mp++ = c; 785 sc->sc_escape = 0; 786 return; 787 } 788 sc->sc_flags |= SC_ERROR; 789 error: 790 sc->sc_if.if_ierrors++; 791 newpack: 792 sc->sc_mp = sc->sc_buf = sc->sc_ep - SLMAX; 793 sc->sc_escape = 0; 794 } 795 796 /* 797 * Process an ioctl request. 798 */ 799 slioctl(ifp, cmd, data) 800 register struct ifnet *ifp; 801 int cmd; 802 caddr_t data; 803 { 804 register struct ifaddr *ifa = (struct ifaddr *)data; 805 int s = splimp(), error = 0; 806 807 switch (cmd) { 808 809 case SIOCSIFADDR: 810 if (ifa->ifa_addr->sa_family == AF_INET) 811 ifp->if_flags |= IFF_UP; 812 else 813 error = EAFNOSUPPORT; 814 break; 815 816 case SIOCSIFDSTADDR: 817 if (ifa->ifa_addr->sa_family != AF_INET) 818 error = EAFNOSUPPORT; 819 break; 820 821 default: 822 error = EINVAL; 823 } 824 splx(s); 825 return (error); 826 } 827 #endif 828