lh | 9ed821d | 2023-04-07 01:36:19 -0700 | [diff] [blame] | 1 | /* |
| 2 | * ppp.c - STREAMS multiplexing pseudo-device driver for PPP. |
| 3 | * |
| 4 | * Copyright (c) 1994 Paul Mackerras. All rights reserved. |
| 5 | * |
| 6 | * Redistribution and use in source and binary forms, with or without |
| 7 | * modification, are permitted provided that the following conditions |
| 8 | * are met: |
| 9 | * |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * |
| 13 | * 2. Redistributions in binary form must reproduce the above copyright |
| 14 | * notice, this list of conditions and the following disclaimer in |
| 15 | * the documentation and/or other materials provided with the |
| 16 | * distribution. |
| 17 | * |
| 18 | * 3. The name(s) of the authors of this software must not be used to |
| 19 | * endorse or promote products derived from this software without |
| 20 | * prior written permission. |
| 21 | * |
| 22 | * 4. Redistributions of any form whatsoever must retain the following |
| 23 | * acknowledgment: |
| 24 | * "This product includes software developed by Paul Mackerras |
| 25 | * <paulus@samba.org>". |
| 26 | * |
| 27 | * THE AUTHORS OF THIS SOFTWARE DISCLAIM ALL WARRANTIES WITH REGARD TO |
| 28 | * THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY |
| 29 | * AND FITNESS, IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY |
| 30 | * SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
| 31 | * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN |
| 32 | * AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING |
| 33 | * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
| 34 | * |
| 35 | * $Id: ppp.c,v 1.2 2007-06-08 04:02:37 gerg Exp $ |
| 36 | */ |
| 37 | |
| 38 | /* |
| 39 | * This file is used under Solaris 2, SVR4, SunOS 4, and Digital UNIX. |
| 40 | */ |
| 41 | |
| 42 | #include <sys/types.h> |
| 43 | #include <sys/param.h> |
| 44 | #include <sys/stat.h> |
| 45 | #include <sys/stream.h> |
| 46 | #include <sys/stropts.h> |
| 47 | #include <sys/errno.h> |
| 48 | #ifdef __osf__ |
| 49 | #include <sys/ioctl.h> |
| 50 | #include <sys/cmn_err.h> |
| 51 | #define queclass(mp) ((mp)->b_band & QPCTL) |
| 52 | #else |
| 53 | #include <sys/ioccom.h> |
| 54 | #endif |
| 55 | #include <sys/time.h> |
| 56 | #ifdef SVR4 |
| 57 | #include <sys/cmn_err.h> |
| 58 | #include <sys/conf.h> |
| 59 | #include <sys/dlpi.h> |
| 60 | #include <sys/ddi.h> |
| 61 | #ifdef SOL2 |
| 62 | #include <sys/ksynch.h> |
| 63 | #include <sys/kstat.h> |
| 64 | #include <sys/sunddi.h> |
| 65 | #include <sys/ethernet.h> |
| 66 | #else |
| 67 | #include <sys/socket.h> |
| 68 | #include <sys/sockio.h> |
| 69 | #include <net/if.h> |
| 70 | #include <netinet/in.h> |
| 71 | #endif /* SOL2 */ |
| 72 | #else /* not SVR4 */ |
| 73 | #include <sys/user.h> |
| 74 | #endif /* SVR4 */ |
| 75 | #include <net/ppp_defs.h> |
| 76 | #include <net/pppio.h> |
| 77 | #include "ppp_mod.h" |
| 78 | |
| 79 | /* |
| 80 | * Modifications marked with #ifdef PRIOQ are for priority queueing of |
| 81 | * interactive traffic, and are due to Marko Zec <zec@japa.tel.fer.hr>. |
| 82 | */ |
| 83 | #ifdef PRIOQ |
| 84 | #endif /* PRIOQ */ |
| 85 | |
| 86 | #include <netinet/in.h> /* leave this outside of PRIOQ for htons */ |
| 87 | |
| 88 | #ifdef __STDC__ |
| 89 | #define __P(x) x |
| 90 | #else |
| 91 | #define __P(x) () |
| 92 | #endif |
| 93 | |
| 94 | /* |
| 95 | * The IP module may use this SAP value for IP packets. |
| 96 | */ |
| 97 | #ifndef ETHERTYPE_IP |
| 98 | #define ETHERTYPE_IP 0x800 |
| 99 | #endif |
| 100 | |
| 101 | #if !defined(ETHERTYPE_IPV6) |
| 102 | #define ETHERTYPE_IPV6 0x86dd |
| 103 | #endif /* !defined(ETHERTYPE_IPV6) */ |
| 104 | |
| 105 | #if !defined(ETHERTYPE_ALLSAP) && defined(SOL2) |
| 106 | #define ETHERTYPE_ALLSAP 0 |
| 107 | #endif /* !defined(ETHERTYPE_ALLSAP) && defined(SOL2) */ |
| 108 | |
| 109 | #if !defined(PPP_ALLSAP) && defined(SOL2) |
| 110 | #define PPP_ALLSAP PPP_ALLSTATIONS |
| 111 | #endif /* !defined(PPP_ALLSAP) && defined(SOL2) */ |
| 112 | |
| 113 | extern time_t time; |
| 114 | |
| 115 | #ifdef SOL2 |
| 116 | /* |
| 117 | * We use this reader-writer lock to ensure that the lower streams |
| 118 | * stay connected to the upper streams while the lower-side put and |
| 119 | * service procedures are running. Essentially it is an existence |
| 120 | * lock for the upper stream associated with each lower stream. |
| 121 | */ |
| 122 | krwlock_t ppp_lower_lock; |
| 123 | #define LOCK_LOWER_W rw_enter(&ppp_lower_lock, RW_WRITER) |
| 124 | #define LOCK_LOWER_R rw_enter(&ppp_lower_lock, RW_READER) |
| 125 | #define TRYLOCK_LOWER_R rw_tryenter(&ppp_lower_lock, RW_READER) |
| 126 | #define UNLOCK_LOWER rw_exit(&ppp_lower_lock) |
| 127 | |
| 128 | #define MT_ENTER(x) mutex_enter(x) |
| 129 | #define MT_EXIT(x) mutex_exit(x) |
| 130 | |
| 131 | /* |
| 132 | * Notes on multithreaded implementation for Solaris 2: |
| 133 | * |
| 134 | * We use an inner perimeter around each queue pair and an outer |
| 135 | * perimeter around the whole driver. The inner perimeter is |
| 136 | * entered exclusively for all entry points (open, close, put, |
| 137 | * service). The outer perimeter is entered exclusively for open |
| 138 | * and close and shared for put and service. This is all done for |
| 139 | * us by the streams framework. |
| 140 | * |
| 141 | * I used to think that the perimeters were entered for the lower |
| 142 | * streams' put and service routines as well as for the upper streams'. |
| 143 | * Because of problems experienced by people, and after reading the |
| 144 | * documentation more closely, I now don't think that is true. So we |
| 145 | * now use ppp_lower_lock to give us an existence guarantee on the |
| 146 | * upper stream controlling each lower stream. |
| 147 | * |
| 148 | * Shared entry to the outer perimeter protects the existence of all |
| 149 | * the upper streams and their upperstr_t structures, and guarantees |
| 150 | * that the following fields of any upperstr_t won't change: |
| 151 | * nextmn, next, nextppa. It guarantees that the lowerq field of an |
| 152 | * upperstr_t won't go from non-zero to zero, that the global `ppas' |
| 153 | * won't change and that the no lower stream will get unlinked. |
| 154 | * |
| 155 | * Shared (reader) access to ppa_lower_lock guarantees that no lower |
| 156 | * stream will be unlinked and that the lowerq field of all upperstr_t |
| 157 | * structures won't change. |
| 158 | */ |
| 159 | |
| 160 | #else /* SOL2 */ |
| 161 | #define LOCK_LOWER_W 0 |
| 162 | #define LOCK_LOWER_R 0 |
| 163 | #define TRYLOCK_LOWER_R 1 |
| 164 | #define UNLOCK_LOWER 0 |
| 165 | #define MT_ENTER(x) 0 |
| 166 | #define MT_EXIT(x) 0 |
| 167 | |
| 168 | #endif /* SOL2 */ |
| 169 | |
| 170 | /* |
| 171 | * Private information; one per upper stream. |
| 172 | */ |
| 173 | typedef struct upperstr { |
| 174 | minor_t mn; /* minor device number */ |
| 175 | struct upperstr *nextmn; /* next minor device */ |
| 176 | queue_t *q; /* read q associated with this upper stream */ |
| 177 | int flags; /* flag bits, see below */ |
| 178 | int state; /* current DLPI state */ |
| 179 | int sap; /* service access point */ |
| 180 | int req_sap; /* which SAP the DLPI client requested */ |
| 181 | struct upperstr *ppa; /* control stream for our ppa */ |
| 182 | struct upperstr *next; /* next stream for this ppa */ |
| 183 | uint ioc_id; /* last ioctl ID for this stream */ |
| 184 | enum NPmode npmode; /* what to do with packets on this SAP */ |
| 185 | unsigned char rblocked; /* flow control has blocked upper read strm */ |
| 186 | /* N.B. rblocked is only changed by control stream's put/srv procs */ |
| 187 | /* |
| 188 | * There is exactly one control stream for each PPA. |
| 189 | * The following fields are only used for control streams. |
| 190 | */ |
| 191 | int ppa_id; |
| 192 | queue_t *lowerq; /* write queue attached below this PPA */ |
| 193 | struct upperstr *nextppa; /* next control stream */ |
| 194 | int mru; |
| 195 | int mtu; |
| 196 | struct pppstat stats; /* statistics */ |
| 197 | time_t last_sent; /* time last NP packet sent */ |
| 198 | time_t last_recv; /* time last NP packet rcvd */ |
| 199 | #ifdef SOL2 |
| 200 | kmutex_t stats_lock; /* lock for stats updates */ |
| 201 | kstat_t *kstats; /* stats for netstat */ |
| 202 | #endif /* SOL2 */ |
| 203 | #ifdef LACHTCP |
| 204 | int ifflags; |
| 205 | char ifname[IFNAMSIZ]; |
| 206 | struct ifstats ifstats; |
| 207 | #endif /* LACHTCP */ |
| 208 | } upperstr_t; |
| 209 | |
| 210 | /* Values for flags */ |
| 211 | #define US_PRIV 1 /* stream was opened by superuser */ |
| 212 | #define US_CONTROL 2 /* stream is a control stream */ |
| 213 | #define US_BLOCKED 4 /* flow ctrl has blocked lower write stream */ |
| 214 | #define US_LASTMOD 8 /* no PPP modules below us */ |
| 215 | #define US_DBGLOG 0x10 /* log various occurrences */ |
| 216 | #define US_RBLOCKED 0x20 /* flow ctrl has blocked upper read stream */ |
| 217 | |
| 218 | #if defined(SOL2) |
| 219 | #if DL_CURRENT_VERSION >= 2 |
| 220 | #define US_PROMISC 0x40 /* stream is promiscuous */ |
| 221 | #endif /* DL_CURRENT_VERSION >= 2 */ |
| 222 | #define US_RAWDATA 0x80 /* raw M_DATA, no DLPI header */ |
| 223 | #endif /* defined(SOL2) */ |
| 224 | |
| 225 | #ifdef PRIOQ |
| 226 | static u_char max_band=0; |
| 227 | static u_char def_band=0; |
| 228 | |
| 229 | #define IPPORT_DEFAULT 65535 |
| 230 | |
| 231 | /* |
| 232 | * Port priority table |
| 233 | * Highest priority ports are listed first, lowest are listed last. |
| 234 | * ICMP & packets using unlisted ports will be treated as "default". |
| 235 | * If IPPORT_DEFAULT is not listed here, "default" packets will be |
| 236 | * assigned lowest priority. |
| 237 | * Each line should be terminated with "0". |
| 238 | * Line containing only "0" marks the end of the list. |
| 239 | */ |
| 240 | |
| 241 | static u_short prioq_table[]= { |
| 242 | 113, 53, 0, |
| 243 | 22, 23, 513, 517, 518, 0, |
| 244 | 514, 21, 79, 111, 0, |
| 245 | 25, 109, 110, 0, |
| 246 | IPPORT_DEFAULT, 0, |
| 247 | 20, 70, 80, 8001, 8008, 8080, 0, /* 8001,8008,8080 - common proxy ports */ |
| 248 | 0 }; |
| 249 | |
| 250 | #endif /* PRIOQ */ |
| 251 | |
| 252 | |
| 253 | static upperstr_t *minor_devs = NULL; |
| 254 | static upperstr_t *ppas = NULL; |
| 255 | |
| 256 | #ifdef SVR4 |
| 257 | static int pppopen __P((queue_t *, dev_t *, int, int, cred_t *)); |
| 258 | static int pppclose __P((queue_t *, int, cred_t *)); |
| 259 | #else |
| 260 | static int pppopen __P((queue_t *, int, int, int)); |
| 261 | static int pppclose __P((queue_t *, int)); |
| 262 | #endif /* SVR4 */ |
| 263 | static int pppurput __P((queue_t *, mblk_t *)); |
| 264 | static int pppuwput __P((queue_t *, mblk_t *)); |
| 265 | static int pppursrv __P((queue_t *)); |
| 266 | static int pppuwsrv __P((queue_t *)); |
| 267 | static int ppplrput __P((queue_t *, mblk_t *)); |
| 268 | static int ppplwput __P((queue_t *, mblk_t *)); |
| 269 | static int ppplrsrv __P((queue_t *)); |
| 270 | static int ppplwsrv __P((queue_t *)); |
| 271 | #ifndef NO_DLPI |
| 272 | static void dlpi_request __P((queue_t *, mblk_t *, upperstr_t *)); |
| 273 | static void dlpi_error __P((queue_t *, upperstr_t *, int, int, int)); |
| 274 | static void dlpi_ok __P((queue_t *, int)); |
| 275 | #endif |
| 276 | static int send_data __P((mblk_t *, upperstr_t *)); |
| 277 | static void new_ppa __P((queue_t *, mblk_t *)); |
| 278 | static void attach_ppa __P((queue_t *, mblk_t *)); |
| 279 | static void detach_ppa __P((queue_t *, mblk_t *)); |
| 280 | static void detach_lower __P((queue_t *, mblk_t *)); |
| 281 | static void debug_dump __P((queue_t *, mblk_t *)); |
| 282 | static upperstr_t *find_dest __P((upperstr_t *, int)); |
| 283 | #if defined(SOL2) |
| 284 | static upperstr_t *find_promisc __P((upperstr_t *, int)); |
| 285 | static mblk_t *prepend_ether __P((upperstr_t *, mblk_t *, int)); |
| 286 | static mblk_t *prepend_udind __P((upperstr_t *, mblk_t *, int)); |
| 287 | static void promisc_sendup __P((upperstr_t *, mblk_t *, int, int)); |
| 288 | #endif /* defined(SOL2) */ |
| 289 | static int putctl2 __P((queue_t *, int, int, int)); |
| 290 | static int putctl4 __P((queue_t *, int, int, int)); |
| 291 | static int pass_packet __P((upperstr_t *ppa, mblk_t *mp, int outbound)); |
| 292 | #ifdef FILTER_PACKETS |
| 293 | static int ip_hard_filter __P((upperstr_t *ppa, mblk_t *mp, int outbound)); |
| 294 | #endif /* FILTER_PACKETS */ |
| 295 | |
| 296 | #define PPP_ID 0xb1a6 |
| 297 | static struct module_info ppp_info = { |
| 298 | #ifdef PRIOQ |
| 299 | PPP_ID, "ppp", 0, 512, 512, 384 |
| 300 | #else |
| 301 | PPP_ID, "ppp", 0, 512, 512, 128 |
| 302 | #endif /* PRIOQ */ |
| 303 | }; |
| 304 | |
| 305 | static struct qinit pppurint = { |
| 306 | pppurput, pppursrv, pppopen, pppclose, NULL, &ppp_info, NULL |
| 307 | }; |
| 308 | |
| 309 | static struct qinit pppuwint = { |
| 310 | pppuwput, pppuwsrv, NULL, NULL, NULL, &ppp_info, NULL |
| 311 | }; |
| 312 | |
| 313 | static struct qinit ppplrint = { |
| 314 | ppplrput, ppplrsrv, NULL, NULL, NULL, &ppp_info, NULL |
| 315 | }; |
| 316 | |
| 317 | static struct qinit ppplwint = { |
| 318 | ppplwput, ppplwsrv, NULL, NULL, NULL, &ppp_info, NULL |
| 319 | }; |
| 320 | |
| 321 | #ifdef LACHTCP |
| 322 | extern struct ifstats *ifstats; |
| 323 | int pppdevflag = 0; |
| 324 | #endif |
| 325 | |
| 326 | struct streamtab pppinfo = { |
| 327 | &pppurint, &pppuwint, |
| 328 | &ppplrint, &ppplwint |
| 329 | }; |
| 330 | |
| 331 | int ppp_count; |
| 332 | |
| 333 | /* |
| 334 | * How we maintain statistics. |
| 335 | */ |
| 336 | #ifdef SOL2 |
| 337 | #define INCR_IPACKETS(ppa) \ |
| 338 | if (ppa->kstats != 0) { \ |
| 339 | KSTAT_NAMED_PTR(ppa->kstats)[0].value.ul++; \ |
| 340 | } |
| 341 | #define INCR_IERRORS(ppa) \ |
| 342 | if (ppa->kstats != 0) { \ |
| 343 | KSTAT_NAMED_PTR(ppa->kstats)[1].value.ul++; \ |
| 344 | } |
| 345 | #define INCR_OPACKETS(ppa) \ |
| 346 | if (ppa->kstats != 0) { \ |
| 347 | KSTAT_NAMED_PTR(ppa->kstats)[2].value.ul++; \ |
| 348 | } |
| 349 | #define INCR_OERRORS(ppa) \ |
| 350 | if (ppa->kstats != 0) { \ |
| 351 | KSTAT_NAMED_PTR(ppa->kstats)[3].value.ul++; \ |
| 352 | } |
| 353 | #endif |
| 354 | |
| 355 | #ifdef LACHTCP |
| 356 | #define INCR_IPACKETS(ppa) ppa->ifstats.ifs_ipackets++; |
| 357 | #define INCR_IERRORS(ppa) ppa->ifstats.ifs_ierrors++; |
| 358 | #define INCR_OPACKETS(ppa) ppa->ifstats.ifs_opackets++; |
| 359 | #define INCR_OERRORS(ppa) ppa->ifstats.ifs_oerrors++; |
| 360 | #endif |
| 361 | |
| 362 | /* |
| 363 | * STREAMS driver entry points. |
| 364 | */ |
| 365 | static int |
| 366 | #ifdef SVR4 |
| 367 | pppopen(q, devp, oflag, sflag, credp) |
| 368 | queue_t *q; |
| 369 | dev_t *devp; |
| 370 | int oflag, sflag; |
| 371 | cred_t *credp; |
| 372 | #else |
| 373 | pppopen(q, dev, oflag, sflag) |
| 374 | queue_t *q; |
| 375 | int dev; /* really dev_t */ |
| 376 | int oflag, sflag; |
| 377 | #endif |
| 378 | { |
| 379 | upperstr_t *up; |
| 380 | upperstr_t **prevp; |
| 381 | minor_t mn; |
| 382 | #ifdef PRIOQ |
| 383 | u_short *ptr; |
| 384 | u_char new_band; |
| 385 | #endif /* PRIOQ */ |
| 386 | |
| 387 | if (q->q_ptr) |
| 388 | DRV_OPEN_OK(dev); /* device is already open */ |
| 389 | |
| 390 | #ifdef PRIOQ |
| 391 | /* Calculate max_bband & def_band from definitions in prioq.h |
| 392 | This colud be done at some more approtiate time (less often) |
| 393 | but this way it works well so I'll just leave it here */ |
| 394 | |
| 395 | max_band = 1; |
| 396 | def_band = 0; |
| 397 | ptr = prioq_table; |
| 398 | while (*ptr) { |
| 399 | new_band = 1; |
| 400 | while (*ptr) |
| 401 | if (*ptr++ == IPPORT_DEFAULT) { |
| 402 | new_band = 0; |
| 403 | def_band = max_band; |
| 404 | } |
| 405 | max_band += new_band; |
| 406 | ptr++; |
| 407 | } |
| 408 | if (def_band) |
| 409 | def_band = max_band - def_band; |
| 410 | --max_band; |
| 411 | #endif /* PRIOQ */ |
| 412 | |
| 413 | if (sflag == CLONEOPEN) { |
| 414 | mn = 0; |
| 415 | for (prevp = &minor_devs; (up = *prevp) != 0; prevp = &up->nextmn) { |
| 416 | if (up->mn != mn) |
| 417 | break; |
| 418 | ++mn; |
| 419 | } |
| 420 | } else { |
| 421 | #ifdef SVR4 |
| 422 | mn = getminor(*devp); |
| 423 | #else |
| 424 | mn = minor(dev); |
| 425 | #endif |
| 426 | for (prevp = &minor_devs; (up = *prevp) != 0; prevp = &up->nextmn) { |
| 427 | if (up->mn >= mn) |
| 428 | break; |
| 429 | } |
| 430 | if (up->mn == mn) { |
| 431 | /* this can't happen */ |
| 432 | q->q_ptr = WR(q)->q_ptr = (caddr_t) up; |
| 433 | DRV_OPEN_OK(dev); |
| 434 | } |
| 435 | } |
| 436 | |
| 437 | /* |
| 438 | * Construct a new minor node. |
| 439 | */ |
| 440 | up = (upperstr_t *) ALLOC_SLEEP(sizeof(upperstr_t)); |
| 441 | bzero((caddr_t) up, sizeof(upperstr_t)); |
| 442 | if (up == 0) { |
| 443 | DPRINT("pppopen: out of kernel memory\n"); |
| 444 | OPEN_ERROR(ENXIO); |
| 445 | } |
| 446 | up->nextmn = *prevp; |
| 447 | *prevp = up; |
| 448 | up->mn = mn; |
| 449 | #ifdef SVR4 |
| 450 | *devp = makedevice(getmajor(*devp), mn); |
| 451 | #endif |
| 452 | up->q = q; |
| 453 | if (NOTSUSER() == 0) |
| 454 | up->flags |= US_PRIV; |
| 455 | #ifndef NO_DLPI |
| 456 | up->state = DL_UNATTACHED; |
| 457 | #endif |
| 458 | #ifdef LACHTCP |
| 459 | up->ifflags = IFF_UP | IFF_POINTOPOINT; |
| 460 | #endif |
| 461 | up->sap = -1; |
| 462 | up->last_sent = up->last_recv = time; |
| 463 | up->npmode = NPMODE_DROP; |
| 464 | q->q_ptr = (caddr_t) up; |
| 465 | WR(q)->q_ptr = (caddr_t) up; |
| 466 | noenable(WR(q)); |
| 467 | #ifdef SOL2 |
| 468 | mutex_init(&up->stats_lock, NULL, MUTEX_DRIVER, NULL); |
| 469 | #endif |
| 470 | ++ppp_count; |
| 471 | |
| 472 | qprocson(q); |
| 473 | DRV_OPEN_OK(makedev(major(dev), mn)); |
| 474 | } |
| 475 | |
| 476 | static int |
| 477 | #ifdef SVR4 |
| 478 | pppclose(q, flag, credp) |
| 479 | queue_t *q; |
| 480 | int flag; |
| 481 | cred_t *credp; |
| 482 | #else |
| 483 | pppclose(q, flag) |
| 484 | queue_t *q; |
| 485 | int flag; |
| 486 | #endif |
| 487 | { |
| 488 | upperstr_t *up, **upp; |
| 489 | upperstr_t *as, *asnext; |
| 490 | upperstr_t **prevp; |
| 491 | |
| 492 | qprocsoff(q); |
| 493 | |
| 494 | up = (upperstr_t *) q->q_ptr; |
| 495 | if (up == 0) { |
| 496 | DPRINT("pppclose: q_ptr = 0\n"); |
| 497 | return 0; |
| 498 | } |
| 499 | if (up->flags & US_DBGLOG) |
| 500 | DPRINT2("ppp/%d: close, flags=%x\n", up->mn, up->flags); |
| 501 | if (up->flags & US_CONTROL) { |
| 502 | #ifdef LACHTCP |
| 503 | struct ifstats *ifp, *pifp; |
| 504 | #endif |
| 505 | if (up->lowerq != 0) { |
| 506 | /* Gack! the lower stream should have be unlinked earlier! */ |
| 507 | DPRINT1("ppp%d: lower stream still connected on close?\n", |
| 508 | up->mn); |
| 509 | LOCK_LOWER_W; |
| 510 | up->lowerq->q_ptr = 0; |
| 511 | RD(up->lowerq)->q_ptr = 0; |
| 512 | up->lowerq = 0; |
| 513 | UNLOCK_LOWER; |
| 514 | } |
| 515 | |
| 516 | /* |
| 517 | * This stream represents a PPA: |
| 518 | * For all streams attached to the PPA, clear their |
| 519 | * references to this PPA. |
| 520 | * Then remove this PPA from the list of PPAs. |
| 521 | */ |
| 522 | for (as = up->next; as != 0; as = asnext) { |
| 523 | asnext = as->next; |
| 524 | as->next = 0; |
| 525 | as->ppa = 0; |
| 526 | if (as->flags & US_BLOCKED) { |
| 527 | as->flags &= ~US_BLOCKED; |
| 528 | flushq(WR(as->q), FLUSHDATA); |
| 529 | } |
| 530 | } |
| 531 | for (upp = &ppas; *upp != 0; upp = &(*upp)->nextppa) |
| 532 | if (*upp == up) { |
| 533 | *upp = up->nextppa; |
| 534 | break; |
| 535 | } |
| 536 | #ifdef LACHTCP |
| 537 | /* Remove the statistics from the active list. */ |
| 538 | for (ifp = ifstats, pifp = 0; ifp; ifp = ifp->ifs_next) { |
| 539 | if (ifp == &up->ifstats) { |
| 540 | if (pifp) |
| 541 | pifp->ifs_next = ifp->ifs_next; |
| 542 | else |
| 543 | ifstats = ifp->ifs_next; |
| 544 | break; |
| 545 | } |
| 546 | pifp = ifp; |
| 547 | } |
| 548 | #endif |
| 549 | } else { |
| 550 | /* |
| 551 | * If this stream is attached to a PPA, |
| 552 | * remove it from the PPA's list. |
| 553 | */ |
| 554 | if ((as = up->ppa) != 0) { |
| 555 | for (; as->next != 0; as = as->next) |
| 556 | if (as->next == up) { |
| 557 | as->next = up->next; |
| 558 | break; |
| 559 | } |
| 560 | } |
| 561 | } |
| 562 | |
| 563 | #ifdef SOL2 |
| 564 | if (up->kstats) |
| 565 | kstat_delete(up->kstats); |
| 566 | mutex_destroy(&up->stats_lock); |
| 567 | #endif |
| 568 | |
| 569 | q->q_ptr = NULL; |
| 570 | WR(q)->q_ptr = NULL; |
| 571 | |
| 572 | for (prevp = &minor_devs; *prevp != 0; prevp = &(*prevp)->nextmn) { |
| 573 | if (*prevp == up) { |
| 574 | *prevp = up->nextmn; |
| 575 | break; |
| 576 | } |
| 577 | } |
| 578 | FREE(up, sizeof(upperstr_t)); |
| 579 | --ppp_count; |
| 580 | |
| 581 | return 0; |
| 582 | } |
| 583 | |
| 584 | /* |
| 585 | * A message from on high. We do one of three things: |
| 586 | * - qreply() |
| 587 | * - put the message on the lower write stream |
| 588 | * - queue it for our service routine |
| 589 | */ |
| 590 | static int |
| 591 | pppuwput(q, mp) |
| 592 | queue_t *q; |
| 593 | mblk_t *mp; |
| 594 | { |
| 595 | upperstr_t *us, *ppa, *nps; |
| 596 | struct iocblk *iop; |
| 597 | struct linkblk *lb; |
| 598 | #ifdef LACHTCP |
| 599 | struct ifreq *ifr; |
| 600 | int i; |
| 601 | #endif |
| 602 | queue_t *lq; |
| 603 | int error, n, sap; |
| 604 | mblk_t *mq; |
| 605 | struct ppp_idle *pip; |
| 606 | #ifdef PRIOQ |
| 607 | queue_t *tlq; |
| 608 | #endif /* PRIOQ */ |
| 609 | #ifdef NO_DLPI |
| 610 | upperstr_t *os; |
| 611 | #endif |
| 612 | |
| 613 | us = (upperstr_t *) q->q_ptr; |
| 614 | if (us == 0) { |
| 615 | DPRINT("pppuwput: q_ptr = 0!\n"); |
| 616 | return 0; |
| 617 | } |
| 618 | if (mp == 0) { |
| 619 | DPRINT1("pppuwput/%d: mp = 0!\n", us->mn); |
| 620 | return 0; |
| 621 | } |
| 622 | if (mp->b_datap == 0) { |
| 623 | DPRINT1("pppuwput/%d: mp->b_datap = 0!\n", us->mn); |
| 624 | return 0; |
| 625 | } |
| 626 | switch (mp->b_datap->db_type) { |
| 627 | #ifndef NO_DLPI |
| 628 | case M_PCPROTO: |
| 629 | case M_PROTO: |
| 630 | dlpi_request(q, mp, us); |
| 631 | break; |
| 632 | #endif /* NO_DLPI */ |
| 633 | |
| 634 | case M_DATA: |
| 635 | if (us->flags & US_DBGLOG) |
| 636 | DPRINT3("ppp/%d: uwput M_DATA len=%d flags=%x\n", |
| 637 | us->mn, msgdsize(mp), us->flags); |
| 638 | if (us->ppa == 0 || msgdsize(mp) > us->ppa->mtu + PPP_HDRLEN |
| 639 | #ifndef NO_DLPI |
| 640 | || (us->flags & US_CONTROL) == 0 |
| 641 | #endif /* NO_DLPI */ |
| 642 | ) { |
| 643 | DPRINT1("pppuwput: junk data len=%d\n", msgdsize(mp)); |
| 644 | freemsg(mp); |
| 645 | break; |
| 646 | } |
| 647 | #ifdef NO_DLPI |
| 648 | if ((us->flags & US_CONTROL) == 0 && !pass_packet(us, mp, 1)) |
| 649 | break; |
| 650 | #endif |
| 651 | if (!send_data(mp, us)) |
| 652 | putq(q, mp); |
| 653 | break; |
| 654 | |
| 655 | case M_IOCTL: |
| 656 | iop = (struct iocblk *) mp->b_rptr; |
| 657 | error = EINVAL; |
| 658 | if (us->flags & US_DBGLOG) |
| 659 | DPRINT3("ppp/%d: ioctl %x count=%d\n", |
| 660 | us->mn, iop->ioc_cmd, iop->ioc_count); |
| 661 | switch (iop->ioc_cmd) { |
| 662 | #if defined(SOL2) |
| 663 | case DLIOCRAW: /* raw M_DATA mode */ |
| 664 | us->flags |= US_RAWDATA; |
| 665 | error = 0; |
| 666 | break; |
| 667 | #endif /* defined(SOL2) */ |
| 668 | case I_LINK: |
| 669 | if ((us->flags & US_CONTROL) == 0 || us->lowerq != 0) |
| 670 | break; |
| 671 | if (mp->b_cont == 0) { |
| 672 | DPRINT1("pppuwput/%d: ioctl I_LINK b_cont = 0!\n", us->mn); |
| 673 | break; |
| 674 | } |
| 675 | lb = (struct linkblk *) mp->b_cont->b_rptr; |
| 676 | lq = lb->l_qbot; |
| 677 | if (lq == 0) { |
| 678 | DPRINT1("pppuwput/%d: ioctl I_LINK l_qbot = 0!\n", us->mn); |
| 679 | break; |
| 680 | } |
| 681 | LOCK_LOWER_W; |
| 682 | us->lowerq = lq; |
| 683 | lq->q_ptr = (caddr_t) q; |
| 684 | RD(lq)->q_ptr = (caddr_t) us->q; |
| 685 | UNLOCK_LOWER; |
| 686 | iop->ioc_count = 0; |
| 687 | error = 0; |
| 688 | us->flags &= ~US_LASTMOD; |
| 689 | /* Unblock upper streams which now feed this lower stream. */ |
| 690 | qenable(q); |
| 691 | /* Send useful information down to the modules which |
| 692 | are now linked below us. */ |
| 693 | putctl2(lq, M_CTL, PPPCTL_UNIT, us->ppa_id); |
| 694 | putctl4(lq, M_CTL, PPPCTL_MRU, us->mru); |
| 695 | putctl4(lq, M_CTL, PPPCTL_MTU, us->mtu); |
| 696 | #ifdef PRIOQ |
| 697 | /* Lower tty driver's queue hiwat/lowat from default 4096/128 |
| 698 | to 256/128 since we don't want queueing of data on |
| 699 | output to physical device */ |
| 700 | |
| 701 | freezestr(lq); |
| 702 | for (tlq = lq; tlq->q_next != NULL; tlq = tlq->q_next) |
| 703 | ; |
| 704 | strqset(tlq, QHIWAT, 0, 256); |
| 705 | strqset(tlq, QLOWAT, 0, 128); |
| 706 | unfreezestr(lq); |
| 707 | #endif /* PRIOQ */ |
| 708 | break; |
| 709 | |
| 710 | case I_UNLINK: |
| 711 | if (mp->b_cont == 0) { |
| 712 | DPRINT1("pppuwput/%d: ioctl I_UNLINK b_cont = 0!\n", us->mn); |
| 713 | break; |
| 714 | } |
| 715 | lb = (struct linkblk *) mp->b_cont->b_rptr; |
| 716 | #if DEBUG |
| 717 | if (us->lowerq != lb->l_qbot) { |
| 718 | DPRINT2("ppp unlink: lowerq=%x qbot=%x\n", |
| 719 | us->lowerq, lb->l_qbot); |
| 720 | break; |
| 721 | } |
| 722 | #endif |
| 723 | iop->ioc_count = 0; |
| 724 | qwriter(q, mp, detach_lower, PERIM_OUTER); |
| 725 | error = -1; |
| 726 | break; |
| 727 | |
| 728 | case PPPIO_NEWPPA: |
| 729 | if (us->flags & US_CONTROL) |
| 730 | break; |
| 731 | if ((us->flags & US_PRIV) == 0) { |
| 732 | error = EPERM; |
| 733 | break; |
| 734 | } |
| 735 | /* Arrange to return an int */ |
| 736 | if ((mq = mp->b_cont) == 0 |
| 737 | || mq->b_datap->db_lim - mq->b_rptr < sizeof(int)) { |
| 738 | mq = allocb(sizeof(int), BPRI_HI); |
| 739 | if (mq == 0) { |
| 740 | error = ENOSR; |
| 741 | break; |
| 742 | } |
| 743 | if (mp->b_cont != 0) |
| 744 | freemsg(mp->b_cont); |
| 745 | mp->b_cont = mq; |
| 746 | mq->b_cont = 0; |
| 747 | } |
| 748 | iop->ioc_count = sizeof(int); |
| 749 | mq->b_wptr = mq->b_rptr + sizeof(int); |
| 750 | qwriter(q, mp, new_ppa, PERIM_OUTER); |
| 751 | error = -1; |
| 752 | break; |
| 753 | |
| 754 | case PPPIO_ATTACH: |
| 755 | /* like dlpi_attach, for programs which can't write to |
| 756 | the stream (like pppstats) */ |
| 757 | if (iop->ioc_count != sizeof(int) || us->ppa != 0) |
| 758 | break; |
| 759 | if (mp->b_cont == 0) { |
| 760 | DPRINT1("pppuwput/%d: ioctl PPPIO_ATTACH b_cont = 0!\n", us->mn); |
| 761 | break; |
| 762 | } |
| 763 | n = *(int *)mp->b_cont->b_rptr; |
| 764 | for (ppa = ppas; ppa != 0; ppa = ppa->nextppa) |
| 765 | if (ppa->ppa_id == n) |
| 766 | break; |
| 767 | if (ppa == 0) |
| 768 | break; |
| 769 | us->ppa = ppa; |
| 770 | iop->ioc_count = 0; |
| 771 | qwriter(q, mp, attach_ppa, PERIM_OUTER); |
| 772 | error = -1; |
| 773 | break; |
| 774 | |
| 775 | #ifdef NO_DLPI |
| 776 | case PPPIO_BIND: |
| 777 | /* Attach to a given SAP. */ |
| 778 | if (iop->ioc_count != sizeof(int) || us->ppa == 0) |
| 779 | break; |
| 780 | if (mp->b_cont == 0) { |
| 781 | DPRINT1("pppuwput/%d: ioctl PPPIO_BIND b_cont = 0!\n", us->mn); |
| 782 | break; |
| 783 | } |
| 784 | n = *(int *)mp->b_cont->b_rptr; |
| 785 | /* n must be a valid PPP network protocol number. */ |
| 786 | if (n < 0x21 || n > 0x3fff || (n & 0x101) != 1) |
| 787 | break; |
| 788 | /* check that no other stream is bound to this sap already. */ |
| 789 | for (os = us->ppa; os != 0; os = os->next) |
| 790 | if (os->sap == n) |
| 791 | break; |
| 792 | if (os != 0) |
| 793 | break; |
| 794 | us->sap = n; |
| 795 | iop->ioc_count = 0; |
| 796 | error = 0; |
| 797 | break; |
| 798 | #endif /* NO_DLPI */ |
| 799 | |
| 800 | case PPPIO_MRU: |
| 801 | if (iop->ioc_count != sizeof(int) || (us->flags & US_CONTROL) == 0) |
| 802 | break; |
| 803 | if (mp->b_cont == 0) { |
| 804 | DPRINT1("pppuwput/%d: ioctl PPPIO_MRU b_cont = 0!\n", us->mn); |
| 805 | break; |
| 806 | } |
| 807 | n = *(int *)mp->b_cont->b_rptr; |
| 808 | if (n <= 0 || n > PPP_MAXMRU) |
| 809 | break; |
| 810 | if (n < PPP_MRU) |
| 811 | n = PPP_MRU; |
| 812 | us->mru = n; |
| 813 | if (us->lowerq) |
| 814 | putctl4(us->lowerq, M_CTL, PPPCTL_MRU, n); |
| 815 | error = 0; |
| 816 | iop->ioc_count = 0; |
| 817 | break; |
| 818 | |
| 819 | case PPPIO_MTU: |
| 820 | if (iop->ioc_count != sizeof(int) || (us->flags & US_CONTROL) == 0) |
| 821 | break; |
| 822 | if (mp->b_cont == 0) { |
| 823 | DPRINT1("pppuwput/%d: ioctl PPPIO_MTU b_cont = 0!\n", us->mn); |
| 824 | break; |
| 825 | } |
| 826 | n = *(int *)mp->b_cont->b_rptr; |
| 827 | if (n <= 0 || n > PPP_MAXMTU) |
| 828 | break; |
| 829 | us->mtu = n; |
| 830 | #ifdef LACHTCP |
| 831 | /* The MTU reported in netstat, not used as IP max packet size! */ |
| 832 | us->ifstats.ifs_mtu = n; |
| 833 | #endif |
| 834 | if (us->lowerq) |
| 835 | putctl4(us->lowerq, M_CTL, PPPCTL_MTU, n); |
| 836 | error = 0; |
| 837 | iop->ioc_count = 0; |
| 838 | break; |
| 839 | |
| 840 | case PPPIO_LASTMOD: |
| 841 | us->flags |= US_LASTMOD; |
| 842 | error = 0; |
| 843 | break; |
| 844 | |
| 845 | case PPPIO_DEBUG: |
| 846 | if (iop->ioc_count != sizeof(int)) |
| 847 | break; |
| 848 | if (mp->b_cont == 0) { |
| 849 | DPRINT1("pppuwput/%d: ioctl PPPIO_DEBUG b_cont = 0!\n", us->mn); |
| 850 | break; |
| 851 | } |
| 852 | n = *(int *)mp->b_cont->b_rptr; |
| 853 | if (n == PPPDBG_DUMP + PPPDBG_DRIVER) { |
| 854 | qwriter(q, NULL, debug_dump, PERIM_OUTER); |
| 855 | iop->ioc_count = 0; |
| 856 | error = -1; |
| 857 | } else if (n == PPPDBG_LOG + PPPDBG_DRIVER) { |
| 858 | DPRINT1("ppp/%d: debug log enabled\n", us->mn); |
| 859 | us->flags |= US_DBGLOG; |
| 860 | iop->ioc_count = 0; |
| 861 | error = 0; |
| 862 | } else { |
| 863 | if (us->ppa == 0 || us->ppa->lowerq == 0) |
| 864 | break; |
| 865 | putnext(us->ppa->lowerq, mp); |
| 866 | error = -1; |
| 867 | } |
| 868 | break; |
| 869 | |
| 870 | case PPPIO_NPMODE: |
| 871 | if (iop->ioc_count != 2 * sizeof(int)) |
| 872 | break; |
| 873 | if ((us->flags & US_CONTROL) == 0) |
| 874 | break; |
| 875 | if (mp->b_cont == 0) { |
| 876 | DPRINT1("pppuwput/%d: ioctl PPPIO_NPMODE b_cont = 0!\n", us->mn); |
| 877 | break; |
| 878 | } |
| 879 | sap = ((int *)mp->b_cont->b_rptr)[0]; |
| 880 | for (nps = us->next; nps != 0; nps = nps->next) { |
| 881 | if (us->flags & US_DBGLOG) |
| 882 | DPRINT2("us = 0x%x, us->next->sap = 0x%x\n", nps, nps->sap); |
| 883 | if (nps->sap == sap) |
| 884 | break; |
| 885 | } |
| 886 | if (nps == 0) { |
| 887 | if (us->flags & US_DBGLOG) |
| 888 | DPRINT2("ppp/%d: no stream for sap %x\n", us->mn, sap); |
| 889 | break; |
| 890 | } |
| 891 | /* XXX possibly should use qwriter here */ |
| 892 | nps->npmode = (enum NPmode) ((int *)mp->b_cont->b_rptr)[1]; |
| 893 | if (nps->npmode != NPMODE_QUEUE && (nps->flags & US_BLOCKED) != 0) |
| 894 | qenable(WR(nps->q)); |
| 895 | iop->ioc_count = 0; |
| 896 | error = 0; |
| 897 | break; |
| 898 | |
| 899 | case PPPIO_GIDLE: |
| 900 | if ((ppa = us->ppa) == 0) |
| 901 | break; |
| 902 | mq = allocb(sizeof(struct ppp_idle), BPRI_HI); |
| 903 | if (mq == 0) { |
| 904 | error = ENOSR; |
| 905 | break; |
| 906 | } |
| 907 | if (mp->b_cont != 0) |
| 908 | freemsg(mp->b_cont); |
| 909 | mp->b_cont = mq; |
| 910 | mq->b_cont = 0; |
| 911 | pip = (struct ppp_idle *) mq->b_wptr; |
| 912 | pip->xmit_idle = time - ppa->last_sent; |
| 913 | pip->recv_idle = time - ppa->last_recv; |
| 914 | mq->b_wptr += sizeof(struct ppp_idle); |
| 915 | iop->ioc_count = sizeof(struct ppp_idle); |
| 916 | error = 0; |
| 917 | break; |
| 918 | |
| 919 | #ifdef LACHTCP |
| 920 | case SIOCSIFNAME: |
| 921 | /* Sent from IP down to us. Attach the ifstats structure. */ |
| 922 | if (iop->ioc_count != sizeof(struct ifreq) || us->ppa == 0) |
| 923 | break; |
| 924 | ifr = (struct ifreq *)mp->b_cont->b_rptr; |
| 925 | /* Find the unit number in the interface name. */ |
| 926 | for (i = 0; i < IFNAMSIZ; i++) { |
| 927 | if (ifr->ifr_name[i] == 0 || |
| 928 | (ifr->ifr_name[i] >= '0' && |
| 929 | ifr->ifr_name[i] <= '9')) |
| 930 | break; |
| 931 | else |
| 932 | us->ifname[i] = ifr->ifr_name[i]; |
| 933 | } |
| 934 | us->ifname[i] = 0; |
| 935 | |
| 936 | /* Convert the unit number to binary. */ |
| 937 | for (n = 0; i < IFNAMSIZ; i++) { |
| 938 | if (ifr->ifr_name[i] == 0) { |
| 939 | break; |
| 940 | } |
| 941 | else { |
| 942 | n = n * 10 + ifr->ifr_name[i] - '0'; |
| 943 | } |
| 944 | } |
| 945 | |
| 946 | /* Verify the ppa. */ |
| 947 | if (us->ppa->ppa_id != n) |
| 948 | break; |
| 949 | ppa = us->ppa; |
| 950 | |
| 951 | /* Set up the netstat block. */ |
| 952 | strncpy (ppa->ifname, us->ifname, IFNAMSIZ); |
| 953 | |
| 954 | ppa->ifstats.ifs_name = ppa->ifname; |
| 955 | ppa->ifstats.ifs_unit = n; |
| 956 | ppa->ifstats.ifs_active = us->state != DL_UNBOUND; |
| 957 | ppa->ifstats.ifs_mtu = ppa->mtu; |
| 958 | |
| 959 | /* Link in statistics used by netstat. */ |
| 960 | ppa->ifstats.ifs_next = ifstats; |
| 961 | ifstats = &ppa->ifstats; |
| 962 | |
| 963 | iop->ioc_count = 0; |
| 964 | error = 0; |
| 965 | break; |
| 966 | |
| 967 | case SIOCGIFFLAGS: |
| 968 | if (!(us->flags & US_CONTROL)) { |
| 969 | if (us->ppa) |
| 970 | us = us->ppa; |
| 971 | else |
| 972 | break; |
| 973 | } |
| 974 | ((struct iocblk_in *)iop)->ioc_ifflags = us->ifflags; |
| 975 | error = 0; |
| 976 | break; |
| 977 | |
| 978 | case SIOCSIFFLAGS: |
| 979 | if (!(us->flags & US_CONTROL)) { |
| 980 | if (us->ppa) |
| 981 | us = us->ppa; |
| 982 | else |
| 983 | break; |
| 984 | } |
| 985 | us->ifflags = ((struct iocblk_in *)iop)->ioc_ifflags; |
| 986 | error = 0; |
| 987 | break; |
| 988 | |
| 989 | case SIOCSIFADDR: |
| 990 | if (!(us->flags & US_CONTROL)) { |
| 991 | if (us->ppa) |
| 992 | us = us->ppa; |
| 993 | else |
| 994 | break; |
| 995 | } |
| 996 | us->ifflags |= IFF_RUNNING; |
| 997 | ((struct iocblk_in *)iop)->ioc_ifflags |= IFF_RUNNING; |
| 998 | error = 0; |
| 999 | break; |
| 1000 | |
| 1001 | case SIOCSIFMTU: |
| 1002 | /* |
| 1003 | * Vanilla SVR4 systems don't handle SIOCSIFMTU, rather |
| 1004 | * they take the MTU from the DL_INFO_ACK we sent in response |
| 1005 | * to their DL_INFO_REQ. Fortunately, they will update the |
| 1006 | * MTU if we send an unsolicited DL_INFO_ACK up. |
| 1007 | */ |
| 1008 | if ((mq = allocb(sizeof(dl_info_req_t), BPRI_HI)) == 0) |
| 1009 | break; /* should do bufcall */ |
| 1010 | ((union DL_primitives *)mq->b_rptr)->dl_primitive = DL_INFO_REQ; |
| 1011 | mq->b_wptr = mq->b_rptr + sizeof(dl_info_req_t); |
| 1012 | dlpi_request(q, mq, us); |
| 1013 | error = 0; |
| 1014 | break; |
| 1015 | |
| 1016 | case SIOCGIFNETMASK: |
| 1017 | case SIOCSIFNETMASK: |
| 1018 | case SIOCGIFADDR: |
| 1019 | case SIOCGIFDSTADDR: |
| 1020 | case SIOCSIFDSTADDR: |
| 1021 | case SIOCGIFMETRIC: |
| 1022 | error = 0; |
| 1023 | break; |
| 1024 | #endif /* LACHTCP */ |
| 1025 | |
| 1026 | default: |
| 1027 | if (us->ppa == 0 || us->ppa->lowerq == 0) |
| 1028 | break; |
| 1029 | us->ioc_id = iop->ioc_id; |
| 1030 | error = -1; |
| 1031 | switch (iop->ioc_cmd) { |
| 1032 | case PPPIO_GETSTAT: |
| 1033 | case PPPIO_GETCSTAT: |
| 1034 | if (us->flags & US_LASTMOD) { |
| 1035 | error = EINVAL; |
| 1036 | break; |
| 1037 | } |
| 1038 | putnext(us->ppa->lowerq, mp); |
| 1039 | break; |
| 1040 | default: |
| 1041 | if (us->flags & US_PRIV) |
| 1042 | putnext(us->ppa->lowerq, mp); |
| 1043 | else { |
| 1044 | DPRINT1("ppp ioctl %x rejected\n", iop->ioc_cmd); |
| 1045 | error = EPERM; |
| 1046 | } |
| 1047 | break; |
| 1048 | } |
| 1049 | break; |
| 1050 | } |
| 1051 | |
| 1052 | if (error > 0) { |
| 1053 | iop->ioc_error = error; |
| 1054 | mp->b_datap->db_type = M_IOCNAK; |
| 1055 | qreply(q, mp); |
| 1056 | } else if (error == 0) { |
| 1057 | mp->b_datap->db_type = M_IOCACK; |
| 1058 | qreply(q, mp); |
| 1059 | } |
| 1060 | break; |
| 1061 | |
| 1062 | case M_FLUSH: |
| 1063 | if (us->flags & US_DBGLOG) |
| 1064 | DPRINT2("ppp/%d: flush %x\n", us->mn, *mp->b_rptr); |
| 1065 | if (*mp->b_rptr & FLUSHW) |
| 1066 | flushq(q, FLUSHDATA); |
| 1067 | if (*mp->b_rptr & FLUSHR) { |
| 1068 | *mp->b_rptr &= ~FLUSHW; |
| 1069 | qreply(q, mp); |
| 1070 | } else |
| 1071 | freemsg(mp); |
| 1072 | break; |
| 1073 | |
| 1074 | default: |
| 1075 | freemsg(mp); |
| 1076 | break; |
| 1077 | } |
| 1078 | return 0; |
| 1079 | } |
| 1080 | |
| 1081 | #ifndef NO_DLPI |
| 1082 | static void |
| 1083 | dlpi_request(q, mp, us) |
| 1084 | queue_t *q; |
| 1085 | mblk_t *mp; |
| 1086 | upperstr_t *us; |
| 1087 | { |
| 1088 | union DL_primitives *d = (union DL_primitives *) mp->b_rptr; |
| 1089 | int size = mp->b_wptr - mp->b_rptr; |
| 1090 | mblk_t *reply, *np; |
| 1091 | upperstr_t *ppa, *os; |
| 1092 | int sap, len; |
| 1093 | dl_info_ack_t *info; |
| 1094 | dl_bind_ack_t *ackp; |
| 1095 | #if DL_CURRENT_VERSION >= 2 |
| 1096 | dl_phys_addr_ack_t *paddrack; |
| 1097 | static struct ether_addr eaddr = {0}; |
| 1098 | #endif |
| 1099 | |
| 1100 | if (us->flags & US_DBGLOG) |
| 1101 | DPRINT3("ppp/%d: dlpi prim %x len=%d\n", us->mn, |
| 1102 | d->dl_primitive, size); |
| 1103 | switch (d->dl_primitive) { |
| 1104 | case DL_INFO_REQ: |
| 1105 | if (size < sizeof(dl_info_req_t)) |
| 1106 | goto badprim; |
| 1107 | if ((reply = allocb(sizeof(dl_info_ack_t), BPRI_HI)) == 0) |
| 1108 | break; /* should do bufcall */ |
| 1109 | reply->b_datap->db_type = M_PCPROTO; |
| 1110 | info = (dl_info_ack_t *) reply->b_wptr; |
| 1111 | reply->b_wptr += sizeof(dl_info_ack_t); |
| 1112 | bzero((caddr_t) info, sizeof(dl_info_ack_t)); |
| 1113 | info->dl_primitive = DL_INFO_ACK; |
| 1114 | info->dl_max_sdu = us->ppa? us->ppa->mtu: PPP_MAXMTU; |
| 1115 | info->dl_min_sdu = 1; |
| 1116 | info->dl_addr_length = sizeof(uint); |
| 1117 | info->dl_mac_type = DL_ETHER; /* a bigger lie */ |
| 1118 | info->dl_current_state = us->state; |
| 1119 | info->dl_service_mode = DL_CLDLS; |
| 1120 | info->dl_provider_style = DL_STYLE2; |
| 1121 | #if DL_CURRENT_VERSION >= 2 |
| 1122 | info->dl_sap_length = sizeof(uint); |
| 1123 | info->dl_version = DL_CURRENT_VERSION; |
| 1124 | #endif |
| 1125 | qreply(q, reply); |
| 1126 | break; |
| 1127 | |
| 1128 | case DL_ATTACH_REQ: |
| 1129 | if (size < sizeof(dl_attach_req_t)) |
| 1130 | goto badprim; |
| 1131 | if (us->state != DL_UNATTACHED || us->ppa != 0) { |
| 1132 | dlpi_error(q, us, DL_ATTACH_REQ, DL_OUTSTATE, 0); |
| 1133 | break; |
| 1134 | } |
| 1135 | for (ppa = ppas; ppa != 0; ppa = ppa->nextppa) |
| 1136 | if (ppa->ppa_id == d->attach_req.dl_ppa) |
| 1137 | break; |
| 1138 | if (ppa == 0) { |
| 1139 | dlpi_error(q, us, DL_ATTACH_REQ, DL_BADPPA, 0); |
| 1140 | break; |
| 1141 | } |
| 1142 | us->ppa = ppa; |
| 1143 | qwriter(q, mp, attach_ppa, PERIM_OUTER); |
| 1144 | return; |
| 1145 | |
| 1146 | case DL_DETACH_REQ: |
| 1147 | if (size < sizeof(dl_detach_req_t)) |
| 1148 | goto badprim; |
| 1149 | if (us->state != DL_UNBOUND || us->ppa == 0) { |
| 1150 | dlpi_error(q, us, DL_DETACH_REQ, DL_OUTSTATE, 0); |
| 1151 | break; |
| 1152 | } |
| 1153 | qwriter(q, mp, detach_ppa, PERIM_OUTER); |
| 1154 | return; |
| 1155 | |
| 1156 | case DL_BIND_REQ: |
| 1157 | if (size < sizeof(dl_bind_req_t)) |
| 1158 | goto badprim; |
| 1159 | if (us->state != DL_UNBOUND || us->ppa == 0) { |
| 1160 | dlpi_error(q, us, DL_BIND_REQ, DL_OUTSTATE, 0); |
| 1161 | break; |
| 1162 | } |
| 1163 | #if 0 |
| 1164 | /* apparently this test fails (unnecessarily?) on some systems */ |
| 1165 | if (d->bind_req.dl_service_mode != DL_CLDLS) { |
| 1166 | dlpi_error(q, us, DL_BIND_REQ, DL_UNSUPPORTED, 0); |
| 1167 | break; |
| 1168 | } |
| 1169 | #endif |
| 1170 | |
| 1171 | /* saps must be valid PPP network protocol numbers, |
| 1172 | except that we accept ETHERTYPE_IP in place of PPP_IP. */ |
| 1173 | sap = d->bind_req.dl_sap; |
| 1174 | us->req_sap = sap; |
| 1175 | |
| 1176 | #if defined(SOL2) |
| 1177 | if (us->flags & US_DBGLOG) |
| 1178 | DPRINT2("DL_BIND_REQ: ip gives sap = 0x%x, us = 0x%x", sap, us); |
| 1179 | |
| 1180 | if (sap == ETHERTYPE_IP) /* normal IFF_IPV4 */ |
| 1181 | sap = PPP_IP; |
| 1182 | else if (sap == ETHERTYPE_IPV6) /* when IFF_IPV6 is set */ |
| 1183 | sap = PPP_IPV6; |
| 1184 | else if (sap == ETHERTYPE_ALLSAP) /* snoop gives sap of 0 */ |
| 1185 | sap = PPP_ALLSAP; |
| 1186 | else { |
| 1187 | DPRINT2("DL_BIND_REQ: unrecognized sap = 0x%x, us = 0x%x", sap, us); |
| 1188 | dlpi_error(q, us, DL_BIND_REQ, DL_BADADDR, 0); |
| 1189 | break; |
| 1190 | } |
| 1191 | #else |
| 1192 | if (sap == ETHERTYPE_IP) |
| 1193 | sap = PPP_IP; |
| 1194 | if (sap < 0x21 || sap > 0x3fff || (sap & 0x101) != 1) { |
| 1195 | dlpi_error(q, us, DL_BIND_REQ, DL_BADADDR, 0); |
| 1196 | break; |
| 1197 | } |
| 1198 | #endif /* defined(SOL2) */ |
| 1199 | |
| 1200 | /* check that no other stream is bound to this sap already. */ |
| 1201 | for (os = us->ppa; os != 0; os = os->next) |
| 1202 | if (os->sap == sap) |
| 1203 | break; |
| 1204 | if (os != 0) { |
| 1205 | dlpi_error(q, us, DL_BIND_REQ, DL_NOADDR, 0); |
| 1206 | break; |
| 1207 | } |
| 1208 | |
| 1209 | us->sap = sap; |
| 1210 | us->state = DL_IDLE; |
| 1211 | |
| 1212 | if ((reply = allocb(sizeof(dl_bind_ack_t) + sizeof(uint), |
| 1213 | BPRI_HI)) == 0) |
| 1214 | break; /* should do bufcall */ |
| 1215 | ackp = (dl_bind_ack_t *) reply->b_wptr; |
| 1216 | reply->b_wptr += sizeof(dl_bind_ack_t) + sizeof(uint); |
| 1217 | reply->b_datap->db_type = M_PCPROTO; |
| 1218 | bzero((caddr_t) ackp, sizeof(dl_bind_ack_t)); |
| 1219 | ackp->dl_primitive = DL_BIND_ACK; |
| 1220 | ackp->dl_sap = sap; |
| 1221 | ackp->dl_addr_length = sizeof(uint); |
| 1222 | ackp->dl_addr_offset = sizeof(dl_bind_ack_t); |
| 1223 | *(uint *)(ackp+1) = sap; |
| 1224 | qreply(q, reply); |
| 1225 | break; |
| 1226 | |
| 1227 | case DL_UNBIND_REQ: |
| 1228 | if (size < sizeof(dl_unbind_req_t)) |
| 1229 | goto badprim; |
| 1230 | if (us->state != DL_IDLE) { |
| 1231 | dlpi_error(q, us, DL_UNBIND_REQ, DL_OUTSTATE, 0); |
| 1232 | break; |
| 1233 | } |
| 1234 | us->sap = -1; |
| 1235 | us->state = DL_UNBOUND; |
| 1236 | #ifdef LACHTCP |
| 1237 | us->ppa->ifstats.ifs_active = 0; |
| 1238 | #endif |
| 1239 | dlpi_ok(q, DL_UNBIND_REQ); |
| 1240 | break; |
| 1241 | |
| 1242 | case DL_UNITDATA_REQ: |
| 1243 | if (size < sizeof(dl_unitdata_req_t)) |
| 1244 | goto badprim; |
| 1245 | if (us->state != DL_IDLE) { |
| 1246 | dlpi_error(q, us, DL_UNITDATA_REQ, DL_OUTSTATE, 0); |
| 1247 | break; |
| 1248 | } |
| 1249 | if ((ppa = us->ppa) == 0) { |
| 1250 | cmn_err(CE_CONT, "ppp: in state dl_idle but ppa == 0?\n"); |
| 1251 | break; |
| 1252 | } |
| 1253 | len = mp->b_cont == 0? 0: msgdsize(mp->b_cont); |
| 1254 | if (len > ppa->mtu) { |
| 1255 | DPRINT2("dlpi data too large (%d > %d)\n", len, ppa->mtu); |
| 1256 | break; |
| 1257 | } |
| 1258 | |
| 1259 | #if defined(SOL2) |
| 1260 | /* |
| 1261 | * Should there be any promiscuous stream(s), send the data |
| 1262 | * up for each promiscuous stream that we recognize. |
| 1263 | */ |
| 1264 | if (mp->b_cont) |
| 1265 | promisc_sendup(ppa, mp->b_cont, us->sap, 0); |
| 1266 | #endif /* defined(SOL2) */ |
| 1267 | |
| 1268 | mp->b_band = 0; |
| 1269 | #ifdef PRIOQ |
| 1270 | /* Extract s_port & d_port from IP-packet, the code is a bit |
| 1271 | dirty here, but so am I, too... */ |
| 1272 | if (mp->b_datap->db_type == M_PROTO && us->sap == PPP_IP |
| 1273 | && mp->b_cont != 0) { |
| 1274 | u_char *bb, *tlh; |
| 1275 | int iphlen, len; |
| 1276 | u_short *ptr; |
| 1277 | u_char band_unset, cur_band, syn; |
| 1278 | u_short s_port, d_port; |
| 1279 | |
| 1280 | bb = mp->b_cont->b_rptr; /* bb points to IP-header*/ |
| 1281 | len = mp->b_cont->b_wptr - mp->b_cont->b_rptr; |
| 1282 | syn = 0; |
| 1283 | s_port = IPPORT_DEFAULT; |
| 1284 | d_port = IPPORT_DEFAULT; |
| 1285 | if (len >= 20) { /* 20 = minimum length of IP header */ |
| 1286 | iphlen = (bb[0] & 0x0f) * 4; |
| 1287 | tlh = bb + iphlen; |
| 1288 | len -= iphlen; |
| 1289 | switch (bb[9]) { |
| 1290 | case IPPROTO_TCP: |
| 1291 | if (len >= 20) { /* min length of TCP header */ |
| 1292 | s_port = (tlh[0] << 8) + tlh[1]; |
| 1293 | d_port = (tlh[2] << 8) + tlh[3]; |
| 1294 | syn = tlh[13] & 0x02; |
| 1295 | } |
| 1296 | break; |
| 1297 | case IPPROTO_UDP: |
| 1298 | if (len >= 8) { /* min length of UDP header */ |
| 1299 | s_port = (tlh[0] << 8) + tlh[1]; |
| 1300 | d_port = (tlh[2] << 8) + tlh[3]; |
| 1301 | } |
| 1302 | break; |
| 1303 | } |
| 1304 | } |
| 1305 | |
| 1306 | /* |
| 1307 | * Now calculate b_band for this packet from the |
| 1308 | * port-priority table. |
| 1309 | */ |
| 1310 | ptr = prioq_table; |
| 1311 | cur_band = max_band; |
| 1312 | band_unset = 1; |
| 1313 | while (*ptr) { |
| 1314 | while (*ptr && band_unset) |
| 1315 | if (s_port == *ptr || d_port == *ptr++) { |
| 1316 | mp->b_band = cur_band; |
| 1317 | band_unset = 0; |
| 1318 | break; |
| 1319 | } |
| 1320 | ptr++; |
| 1321 | cur_band--; |
| 1322 | } |
| 1323 | if (band_unset) |
| 1324 | mp->b_band = def_band; |
| 1325 | /* It may be usable to urge SYN packets a bit */ |
| 1326 | if (syn) |
| 1327 | mp->b_band++; |
| 1328 | } |
| 1329 | #endif /* PRIOQ */ |
| 1330 | /* this assumes PPP_HDRLEN <= sizeof(dl_unitdata_req_t) */ |
| 1331 | if (mp->b_datap->db_ref > 1) { |
| 1332 | np = allocb(PPP_HDRLEN, BPRI_HI); |
| 1333 | if (np == 0) |
| 1334 | break; /* gak! */ |
| 1335 | np->b_cont = mp->b_cont; |
| 1336 | mp->b_cont = 0; |
| 1337 | freeb(mp); |
| 1338 | mp = np; |
| 1339 | } else |
| 1340 | mp->b_datap->db_type = M_DATA; |
| 1341 | /* XXX should use dl_dest_addr_offset/length here, |
| 1342 | but we would have to translate ETHERTYPE_IP -> PPP_IP */ |
| 1343 | mp->b_wptr = mp->b_rptr + PPP_HDRLEN; |
| 1344 | mp->b_rptr[0] = PPP_ALLSTATIONS; |
| 1345 | mp->b_rptr[1] = PPP_UI; |
| 1346 | mp->b_rptr[2] = us->sap >> 8; |
| 1347 | mp->b_rptr[3] = us->sap; |
| 1348 | if (pass_packet(us, mp, 1)) { |
| 1349 | if (!send_data(mp, us)) |
| 1350 | putq(q, mp); |
| 1351 | } |
| 1352 | return; |
| 1353 | |
| 1354 | #if DL_CURRENT_VERSION >= 2 |
| 1355 | case DL_PHYS_ADDR_REQ: |
| 1356 | if (size < sizeof(dl_phys_addr_req_t)) |
| 1357 | goto badprim; |
| 1358 | |
| 1359 | /* |
| 1360 | * Don't check state because ifconfig sends this one down too |
| 1361 | */ |
| 1362 | |
| 1363 | if ((reply = allocb(sizeof(dl_phys_addr_ack_t)+ETHERADDRL, |
| 1364 | BPRI_HI)) == 0) |
| 1365 | break; /* should do bufcall */ |
| 1366 | reply->b_datap->db_type = M_PCPROTO; |
| 1367 | paddrack = (dl_phys_addr_ack_t *) reply->b_wptr; |
| 1368 | reply->b_wptr += sizeof(dl_phys_addr_ack_t); |
| 1369 | bzero((caddr_t) paddrack, sizeof(dl_phys_addr_ack_t)+ETHERADDRL); |
| 1370 | paddrack->dl_primitive = DL_PHYS_ADDR_ACK; |
| 1371 | paddrack->dl_addr_length = ETHERADDRL; |
| 1372 | paddrack->dl_addr_offset = sizeof(dl_phys_addr_ack_t); |
| 1373 | bcopy(&eaddr, reply->b_wptr, ETHERADDRL); |
| 1374 | reply->b_wptr += ETHERADDRL; |
| 1375 | qreply(q, reply); |
| 1376 | break; |
| 1377 | |
| 1378 | #if defined(SOL2) |
| 1379 | case DL_PROMISCON_REQ: |
| 1380 | if (size < sizeof(dl_promiscon_req_t)) |
| 1381 | goto badprim; |
| 1382 | us->flags |= US_PROMISC; |
| 1383 | dlpi_ok(q, DL_PROMISCON_REQ); |
| 1384 | break; |
| 1385 | |
| 1386 | case DL_PROMISCOFF_REQ: |
| 1387 | if (size < sizeof(dl_promiscoff_req_t)) |
| 1388 | goto badprim; |
| 1389 | us->flags &= ~US_PROMISC; |
| 1390 | dlpi_ok(q, DL_PROMISCOFF_REQ); |
| 1391 | break; |
| 1392 | #else |
| 1393 | case DL_PROMISCON_REQ: /* fall thru */ |
| 1394 | case DL_PROMISCOFF_REQ: /* fall thru */ |
| 1395 | #endif /* defined(SOL2) */ |
| 1396 | #endif /* DL_CURRENT_VERSION >= 2 */ |
| 1397 | |
| 1398 | #if DL_CURRENT_VERSION >= 2 |
| 1399 | case DL_SET_PHYS_ADDR_REQ: |
| 1400 | case DL_SUBS_BIND_REQ: |
| 1401 | case DL_SUBS_UNBIND_REQ: |
| 1402 | case DL_ENABMULTI_REQ: |
| 1403 | case DL_DISABMULTI_REQ: |
| 1404 | case DL_XID_REQ: |
| 1405 | case DL_TEST_REQ: |
| 1406 | case DL_REPLY_UPDATE_REQ: |
| 1407 | case DL_REPLY_REQ: |
| 1408 | case DL_DATA_ACK_REQ: |
| 1409 | #endif |
| 1410 | case DL_CONNECT_REQ: |
| 1411 | case DL_TOKEN_REQ: |
| 1412 | dlpi_error(q, us, d->dl_primitive, DL_NOTSUPPORTED, 0); |
| 1413 | break; |
| 1414 | |
| 1415 | case DL_CONNECT_RES: |
| 1416 | case DL_DISCONNECT_REQ: |
| 1417 | case DL_RESET_REQ: |
| 1418 | case DL_RESET_RES: |
| 1419 | dlpi_error(q, us, d->dl_primitive, DL_OUTSTATE, 0); |
| 1420 | break; |
| 1421 | |
| 1422 | case DL_UDQOS_REQ: |
| 1423 | dlpi_error(q, us, d->dl_primitive, DL_BADQOSTYPE, 0); |
| 1424 | break; |
| 1425 | |
| 1426 | #if DL_CURRENT_VERSION >= 2 |
| 1427 | case DL_TEST_RES: |
| 1428 | case DL_XID_RES: |
| 1429 | break; |
| 1430 | #endif |
| 1431 | |
| 1432 | default: |
| 1433 | cmn_err(CE_CONT, "ppp: unknown dlpi prim 0x%x\n", d->dl_primitive); |
| 1434 | /* fall through */ |
| 1435 | badprim: |
| 1436 | dlpi_error(q, us, d->dl_primitive, DL_BADPRIM, 0); |
| 1437 | break; |
| 1438 | } |
| 1439 | freemsg(mp); |
| 1440 | } |
| 1441 | |
| 1442 | static void |
| 1443 | dlpi_error(q, us, prim, err, uerr) |
| 1444 | queue_t *q; |
| 1445 | upperstr_t *us; |
| 1446 | int prim, err, uerr; |
| 1447 | { |
| 1448 | mblk_t *reply; |
| 1449 | dl_error_ack_t *errp; |
| 1450 | |
| 1451 | if (us->flags & US_DBGLOG) |
| 1452 | DPRINT3("ppp/%d: dlpi error, prim=%x, err=%x\n", us->mn, prim, err); |
| 1453 | reply = allocb(sizeof(dl_error_ack_t), BPRI_HI); |
| 1454 | if (reply == 0) |
| 1455 | return; /* XXX should do bufcall */ |
| 1456 | reply->b_datap->db_type = M_PCPROTO; |
| 1457 | errp = (dl_error_ack_t *) reply->b_wptr; |
| 1458 | reply->b_wptr += sizeof(dl_error_ack_t); |
| 1459 | errp->dl_primitive = DL_ERROR_ACK; |
| 1460 | errp->dl_error_primitive = prim; |
| 1461 | errp->dl_errno = err; |
| 1462 | errp->dl_unix_errno = uerr; |
| 1463 | qreply(q, reply); |
| 1464 | } |
| 1465 | |
| 1466 | static void |
| 1467 | dlpi_ok(q, prim) |
| 1468 | queue_t *q; |
| 1469 | int prim; |
| 1470 | { |
| 1471 | mblk_t *reply; |
| 1472 | dl_ok_ack_t *okp; |
| 1473 | |
| 1474 | reply = allocb(sizeof(dl_ok_ack_t), BPRI_HI); |
| 1475 | if (reply == 0) |
| 1476 | return; /* XXX should do bufcall */ |
| 1477 | reply->b_datap->db_type = M_PCPROTO; |
| 1478 | okp = (dl_ok_ack_t *) reply->b_wptr; |
| 1479 | reply->b_wptr += sizeof(dl_ok_ack_t); |
| 1480 | okp->dl_primitive = DL_OK_ACK; |
| 1481 | okp->dl_correct_primitive = prim; |
| 1482 | qreply(q, reply); |
| 1483 | } |
| 1484 | #endif /* NO_DLPI */ |
| 1485 | |
| 1486 | static int |
| 1487 | pass_packet(us, mp, outbound) |
| 1488 | upperstr_t *us; |
| 1489 | mblk_t *mp; |
| 1490 | int outbound; |
| 1491 | { |
| 1492 | int pass; |
| 1493 | upperstr_t *ppa; |
| 1494 | |
| 1495 | if ((ppa = us->ppa) == 0) { |
| 1496 | freemsg(mp); |
| 1497 | return 0; |
| 1498 | } |
| 1499 | |
| 1500 | #ifdef FILTER_PACKETS |
| 1501 | pass = ip_hard_filter(us, mp, outbound); |
| 1502 | #else |
| 1503 | /* |
| 1504 | * Here is where we might, in future, decide whether to pass |
| 1505 | * or drop the packet, and whether it counts as link activity. |
| 1506 | */ |
| 1507 | pass = 1; |
| 1508 | #endif /* FILTER_PACKETS */ |
| 1509 | |
| 1510 | if (pass < 0) { |
| 1511 | /* pass only if link already up, and don't update time */ |
| 1512 | if (ppa->lowerq == 0) { |
| 1513 | freemsg(mp); |
| 1514 | return 0; |
| 1515 | } |
| 1516 | pass = 1; |
| 1517 | } else if (pass) { |
| 1518 | if (outbound) |
| 1519 | ppa->last_sent = time; |
| 1520 | else |
| 1521 | ppa->last_recv = time; |
| 1522 | } |
| 1523 | |
| 1524 | return pass; |
| 1525 | } |
| 1526 | |
| 1527 | /* |
| 1528 | * We have some data to send down to the lower stream (or up the |
| 1529 | * control stream, if we don't have a lower stream attached). |
| 1530 | * Returns 1 if the message was dealt with, 0 if it wasn't able |
| 1531 | * to be sent on and should therefore be queued up. |
| 1532 | */ |
| 1533 | static int |
| 1534 | send_data(mp, us) |
| 1535 | mblk_t *mp; |
| 1536 | upperstr_t *us; |
| 1537 | { |
| 1538 | upperstr_t *ppa; |
| 1539 | |
| 1540 | if ((us->flags & US_BLOCKED) || us->npmode == NPMODE_QUEUE) |
| 1541 | return 0; |
| 1542 | ppa = us->ppa; |
| 1543 | if (ppa == 0 || us->npmode == NPMODE_DROP || us->npmode == NPMODE_ERROR) { |
| 1544 | if (us->flags & US_DBGLOG) |
| 1545 | DPRINT2("ppp/%d: dropping pkt (npmode=%d)\n", us->mn, us->npmode); |
| 1546 | freemsg(mp); |
| 1547 | return 1; |
| 1548 | } |
| 1549 | if (ppa->lowerq == 0) { |
| 1550 | /* try to send it up the control stream */ |
| 1551 | if (bcanputnext(ppa->q, mp->b_band)) { |
| 1552 | /* |
| 1553 | * The message seems to get corrupted for some reason if |
| 1554 | * we just send the message up as it is, so we send a copy. |
| 1555 | */ |
| 1556 | mblk_t *np = copymsg(mp); |
| 1557 | freemsg(mp); |
| 1558 | if (np != 0) |
| 1559 | putnext(ppa->q, np); |
| 1560 | return 1; |
| 1561 | } |
| 1562 | } else { |
| 1563 | if (bcanputnext(ppa->lowerq, mp->b_band)) { |
| 1564 | MT_ENTER(&ppa->stats_lock); |
| 1565 | ppa->stats.ppp_opackets++; |
| 1566 | ppa->stats.ppp_obytes += msgdsize(mp); |
| 1567 | #ifdef INCR_OPACKETS |
| 1568 | INCR_OPACKETS(ppa); |
| 1569 | #endif |
| 1570 | MT_EXIT(&ppa->stats_lock); |
| 1571 | /* |
| 1572 | * The lower queue is only ever detached while holding an |
| 1573 | * exclusive lock on the whole driver. So we can be confident |
| 1574 | * that the lower queue is still there. |
| 1575 | */ |
| 1576 | putnext(ppa->lowerq, mp); |
| 1577 | return 1; |
| 1578 | } |
| 1579 | } |
| 1580 | us->flags |= US_BLOCKED; |
| 1581 | return 0; |
| 1582 | } |
| 1583 | |
| 1584 | /* |
| 1585 | * Allocate a new PPA id and link this stream into the list of PPAs. |
| 1586 | * This procedure is called with an exclusive lock on all queues in |
| 1587 | * this driver. |
| 1588 | */ |
| 1589 | static void |
| 1590 | new_ppa(q, mp) |
| 1591 | queue_t *q; |
| 1592 | mblk_t *mp; |
| 1593 | { |
| 1594 | upperstr_t *us, *up, **usp; |
| 1595 | int ppa_id; |
| 1596 | |
| 1597 | us = (upperstr_t *) q->q_ptr; |
| 1598 | if (us == 0) { |
| 1599 | DPRINT("new_ppa: q_ptr = 0!\n"); |
| 1600 | return; |
| 1601 | } |
| 1602 | |
| 1603 | usp = &ppas; |
| 1604 | ppa_id = 0; |
| 1605 | while ((up = *usp) != 0 && ppa_id == up->ppa_id) { |
| 1606 | ++ppa_id; |
| 1607 | usp = &up->nextppa; |
| 1608 | } |
| 1609 | us->ppa_id = ppa_id; |
| 1610 | us->ppa = us; |
| 1611 | us->next = 0; |
| 1612 | us->nextppa = *usp; |
| 1613 | *usp = us; |
| 1614 | us->flags |= US_CONTROL; |
| 1615 | us->npmode = NPMODE_PASS; |
| 1616 | |
| 1617 | us->mtu = PPP_MTU; |
| 1618 | us->mru = PPP_MRU; |
| 1619 | |
| 1620 | #ifdef SOL2 |
| 1621 | /* |
| 1622 | * Create a kstats record for our statistics, so netstat -i works. |
| 1623 | */ |
| 1624 | if (us->kstats == 0) { |
| 1625 | char unit[32]; |
| 1626 | |
| 1627 | sprintf(unit, "ppp%d", us->ppa->ppa_id); |
| 1628 | us->kstats = kstat_create("ppp", us->ppa->ppa_id, unit, |
| 1629 | "net", KSTAT_TYPE_NAMED, 4, 0); |
| 1630 | if (us->kstats != 0) { |
| 1631 | kstat_named_t *kn = KSTAT_NAMED_PTR(us->kstats); |
| 1632 | |
| 1633 | strcpy(kn[0].name, "ipackets"); |
| 1634 | kn[0].data_type = KSTAT_DATA_ULONG; |
| 1635 | strcpy(kn[1].name, "ierrors"); |
| 1636 | kn[1].data_type = KSTAT_DATA_ULONG; |
| 1637 | strcpy(kn[2].name, "opackets"); |
| 1638 | kn[2].data_type = KSTAT_DATA_ULONG; |
| 1639 | strcpy(kn[3].name, "oerrors"); |
| 1640 | kn[3].data_type = KSTAT_DATA_ULONG; |
| 1641 | kstat_install(us->kstats); |
| 1642 | } |
| 1643 | } |
| 1644 | #endif /* SOL2 */ |
| 1645 | |
| 1646 | *(int *)mp->b_cont->b_rptr = ppa_id; |
| 1647 | mp->b_datap->db_type = M_IOCACK; |
| 1648 | qreply(q, mp); |
| 1649 | } |
| 1650 | |
| 1651 | static void |
| 1652 | attach_ppa(q, mp) |
| 1653 | queue_t *q; |
| 1654 | mblk_t *mp; |
| 1655 | { |
| 1656 | upperstr_t *us, *t; |
| 1657 | |
| 1658 | us = (upperstr_t *) q->q_ptr; |
| 1659 | if (us == 0) { |
| 1660 | DPRINT("attach_ppa: q_ptr = 0!\n"); |
| 1661 | return; |
| 1662 | } |
| 1663 | |
| 1664 | #ifndef NO_DLPI |
| 1665 | us->state = DL_UNBOUND; |
| 1666 | #endif |
| 1667 | for (t = us->ppa; t->next != 0; t = t->next) |
| 1668 | ; |
| 1669 | t->next = us; |
| 1670 | us->next = 0; |
| 1671 | if (mp->b_datap->db_type == M_IOCTL) { |
| 1672 | mp->b_datap->db_type = M_IOCACK; |
| 1673 | qreply(q, mp); |
| 1674 | } else { |
| 1675 | #ifndef NO_DLPI |
| 1676 | dlpi_ok(q, DL_ATTACH_REQ); |
| 1677 | #endif |
| 1678 | } |
| 1679 | } |
| 1680 | |
| 1681 | static void |
| 1682 | detach_ppa(q, mp) |
| 1683 | queue_t *q; |
| 1684 | mblk_t *mp; |
| 1685 | { |
| 1686 | upperstr_t *us, *t; |
| 1687 | |
| 1688 | us = (upperstr_t *) q->q_ptr; |
| 1689 | if (us == 0) { |
| 1690 | DPRINT("detach_ppa: q_ptr = 0!\n"); |
| 1691 | return; |
| 1692 | } |
| 1693 | |
| 1694 | for (t = us->ppa; t->next != 0; t = t->next) |
| 1695 | if (t->next == us) { |
| 1696 | t->next = us->next; |
| 1697 | break; |
| 1698 | } |
| 1699 | us->next = 0; |
| 1700 | us->ppa = 0; |
| 1701 | #ifndef NO_DLPI |
| 1702 | us->state = DL_UNATTACHED; |
| 1703 | dlpi_ok(q, DL_DETACH_REQ); |
| 1704 | #endif |
| 1705 | } |
| 1706 | |
| 1707 | /* |
| 1708 | * We call this with qwriter in order to give the upper queue procedures |
| 1709 | * the guarantee that the lower queue is not going to go away while |
| 1710 | * they are executing. |
| 1711 | */ |
| 1712 | static void |
| 1713 | detach_lower(q, mp) |
| 1714 | queue_t *q; |
| 1715 | mblk_t *mp; |
| 1716 | { |
| 1717 | upperstr_t *us; |
| 1718 | |
| 1719 | us = (upperstr_t *) q->q_ptr; |
| 1720 | if (us == 0) { |
| 1721 | DPRINT("detach_lower: q_ptr = 0!\n"); |
| 1722 | return; |
| 1723 | } |
| 1724 | |
| 1725 | LOCK_LOWER_W; |
| 1726 | us->lowerq->q_ptr = 0; |
| 1727 | RD(us->lowerq)->q_ptr = 0; |
| 1728 | us->lowerq = 0; |
| 1729 | UNLOCK_LOWER; |
| 1730 | |
| 1731 | /* Unblock streams which now feed back up the control stream. */ |
| 1732 | qenable(us->q); |
| 1733 | |
| 1734 | mp->b_datap->db_type = M_IOCACK; |
| 1735 | qreply(q, mp); |
| 1736 | } |
| 1737 | |
| 1738 | static int |
| 1739 | pppuwsrv(q) |
| 1740 | queue_t *q; |
| 1741 | { |
| 1742 | upperstr_t *us, *as; |
| 1743 | mblk_t *mp; |
| 1744 | |
| 1745 | us = (upperstr_t *) q->q_ptr; |
| 1746 | if (us == 0) { |
| 1747 | DPRINT("pppuwsrv: q_ptr = 0!\n"); |
| 1748 | return 0; |
| 1749 | } |
| 1750 | |
| 1751 | /* |
| 1752 | * If this is a control stream, then this service procedure |
| 1753 | * probably got enabled because of flow control in the lower |
| 1754 | * stream being enabled (or because of the lower stream going |
| 1755 | * away). Therefore we enable the service procedure of all |
| 1756 | * attached upper streams. |
| 1757 | */ |
| 1758 | if (us->flags & US_CONTROL) { |
| 1759 | for (as = us->next; as != 0; as = as->next) |
| 1760 | qenable(WR(as->q)); |
| 1761 | } |
| 1762 | |
| 1763 | /* Try to send on any data queued here. */ |
| 1764 | us->flags &= ~US_BLOCKED; |
| 1765 | while ((mp = getq(q)) != 0) { |
| 1766 | if (!send_data(mp, us)) { |
| 1767 | putbq(q, mp); |
| 1768 | break; |
| 1769 | } |
| 1770 | } |
| 1771 | |
| 1772 | return 0; |
| 1773 | } |
| 1774 | |
| 1775 | /* should never get called... */ |
| 1776 | static int |
| 1777 | ppplwput(q, mp) |
| 1778 | queue_t *q; |
| 1779 | mblk_t *mp; |
| 1780 | { |
| 1781 | putnext(q, mp); |
| 1782 | return 0; |
| 1783 | } |
| 1784 | |
| 1785 | static int |
| 1786 | ppplwsrv(q) |
| 1787 | queue_t *q; |
| 1788 | { |
| 1789 | queue_t *uq; |
| 1790 | |
| 1791 | /* |
| 1792 | * Flow control has back-enabled this stream: |
| 1793 | * enable the upper write service procedure for |
| 1794 | * the upper control stream for this lower stream. |
| 1795 | */ |
| 1796 | LOCK_LOWER_R; |
| 1797 | uq = (queue_t *) q->q_ptr; |
| 1798 | if (uq != 0) |
| 1799 | qenable(uq); |
| 1800 | UNLOCK_LOWER; |
| 1801 | return 0; |
| 1802 | } |
| 1803 | |
| 1804 | /* |
| 1805 | * This should only get called for control streams. |
| 1806 | */ |
| 1807 | static int |
| 1808 | pppurput(q, mp) |
| 1809 | queue_t *q; |
| 1810 | mblk_t *mp; |
| 1811 | { |
| 1812 | upperstr_t *ppa, *us; |
| 1813 | int proto, len; |
| 1814 | struct iocblk *iop; |
| 1815 | |
| 1816 | ppa = (upperstr_t *) q->q_ptr; |
| 1817 | if (ppa == 0) { |
| 1818 | DPRINT("pppurput: q_ptr = 0!\n"); |
| 1819 | return 0; |
| 1820 | } |
| 1821 | |
| 1822 | switch (mp->b_datap->db_type) { |
| 1823 | case M_CTL: |
| 1824 | MT_ENTER(&ppa->stats_lock); |
| 1825 | switch (*mp->b_rptr) { |
| 1826 | case PPPCTL_IERROR: |
| 1827 | #ifdef INCR_IERRORS |
| 1828 | INCR_IERRORS(ppa); |
| 1829 | #endif |
| 1830 | ppa->stats.ppp_ierrors++; |
| 1831 | break; |
| 1832 | case PPPCTL_OERROR: |
| 1833 | #ifdef INCR_OERRORS |
| 1834 | INCR_OERRORS(ppa); |
| 1835 | #endif |
| 1836 | ppa->stats.ppp_oerrors++; |
| 1837 | break; |
| 1838 | } |
| 1839 | MT_EXIT(&ppa->stats_lock); |
| 1840 | freemsg(mp); |
| 1841 | break; |
| 1842 | |
| 1843 | case M_IOCACK: |
| 1844 | case M_IOCNAK: |
| 1845 | /* |
| 1846 | * Attempt to match up the response with the stream |
| 1847 | * that the request came from. |
| 1848 | */ |
| 1849 | iop = (struct iocblk *) mp->b_rptr; |
| 1850 | for (us = ppa; us != 0; us = us->next) |
| 1851 | if (us->ioc_id == iop->ioc_id) |
| 1852 | break; |
| 1853 | if (us == 0) |
| 1854 | freemsg(mp); |
| 1855 | else |
| 1856 | putnext(us->q, mp); |
| 1857 | break; |
| 1858 | |
| 1859 | case M_HANGUP: |
| 1860 | /* |
| 1861 | * The serial device has hung up. We don't want to send |
| 1862 | * the M_HANGUP message up to pppd because that will stop |
| 1863 | * us from using the control stream any more. Instead we |
| 1864 | * send a zero-length message as an end-of-file indication. |
| 1865 | */ |
| 1866 | freemsg(mp); |
| 1867 | mp = allocb(1, BPRI_HI); |
| 1868 | if (mp == 0) { |
| 1869 | DPRINT1("ppp/%d: couldn't allocate eof message!\n", ppa->mn); |
| 1870 | break; |
| 1871 | } |
| 1872 | putnext(ppa->q, mp); |
| 1873 | break; |
| 1874 | |
| 1875 | default: |
| 1876 | if (mp->b_datap->db_type == M_DATA) { |
| 1877 | len = msgdsize(mp); |
| 1878 | if (mp->b_wptr - mp->b_rptr < PPP_HDRLEN) { |
| 1879 | PULLUP(mp, PPP_HDRLEN); |
| 1880 | if (mp == 0) { |
| 1881 | DPRINT1("ppp_urput: msgpullup failed (len=%d)\n", len); |
| 1882 | break; |
| 1883 | } |
| 1884 | } |
| 1885 | MT_ENTER(&ppa->stats_lock); |
| 1886 | ppa->stats.ppp_ipackets++; |
| 1887 | ppa->stats.ppp_ibytes += len; |
| 1888 | #ifdef INCR_IPACKETS |
| 1889 | INCR_IPACKETS(ppa); |
| 1890 | #endif |
| 1891 | MT_EXIT(&ppa->stats_lock); |
| 1892 | |
| 1893 | proto = PPP_PROTOCOL(mp->b_rptr); |
| 1894 | |
| 1895 | #if defined(SOL2) |
| 1896 | /* |
| 1897 | * Should there be any promiscuous stream(s), send the data |
| 1898 | * up for each promiscuous stream that we recognize. |
| 1899 | */ |
| 1900 | promisc_sendup(ppa, mp, proto, 1); |
| 1901 | #endif /* defined(SOL2) */ |
| 1902 | |
| 1903 | if (proto < 0x8000 && (us = find_dest(ppa, proto)) != 0) { |
| 1904 | /* |
| 1905 | * A data packet for some network protocol. |
| 1906 | * Queue it on the upper stream for that protocol. |
| 1907 | * XXX could we just putnext it? (would require thought) |
| 1908 | * The rblocked flag is there to ensure that we keep |
| 1909 | * messages in order for each network protocol. |
| 1910 | */ |
| 1911 | if (!pass_packet(us, mp, 0)) |
| 1912 | break; |
| 1913 | if (!us->rblocked && !canput(us->q)) |
| 1914 | us->rblocked = 1; |
| 1915 | if (!us->rblocked) |
| 1916 | putq(us->q, mp); |
| 1917 | else |
| 1918 | putq(q, mp); |
| 1919 | break; |
| 1920 | } |
| 1921 | } |
| 1922 | /* |
| 1923 | * A control frame, a frame for an unknown protocol, |
| 1924 | * or some other message type. |
| 1925 | * Send it up to pppd via the control stream. |
| 1926 | */ |
| 1927 | if (queclass(mp) == QPCTL || canputnext(ppa->q)) |
| 1928 | putnext(ppa->q, mp); |
| 1929 | else |
| 1930 | putq(q, mp); |
| 1931 | break; |
| 1932 | } |
| 1933 | |
| 1934 | return 0; |
| 1935 | } |
| 1936 | |
| 1937 | static int |
| 1938 | pppursrv(q) |
| 1939 | queue_t *q; |
| 1940 | { |
| 1941 | upperstr_t *us, *as; |
| 1942 | mblk_t *mp, *hdr; |
| 1943 | #ifndef NO_DLPI |
| 1944 | dl_unitdata_ind_t *ud; |
| 1945 | #endif |
| 1946 | int proto; |
| 1947 | |
| 1948 | us = (upperstr_t *) q->q_ptr; |
| 1949 | if (us == 0) { |
| 1950 | DPRINT("pppursrv: q_ptr = 0!\n"); |
| 1951 | return 0; |
| 1952 | } |
| 1953 | |
| 1954 | if (us->flags & US_CONTROL) { |
| 1955 | /* |
| 1956 | * A control stream. |
| 1957 | * If there is no lower queue attached, run the write service |
| 1958 | * routines of other upper streams attached to this PPA. |
| 1959 | */ |
| 1960 | if (us->lowerq == 0) { |
| 1961 | as = us; |
| 1962 | do { |
| 1963 | if (as->flags & US_BLOCKED) |
| 1964 | qenable(WR(as->q)); |
| 1965 | as = as->next; |
| 1966 | } while (as != 0); |
| 1967 | } |
| 1968 | |
| 1969 | /* |
| 1970 | * Messages get queued on this stream's read queue if they |
| 1971 | * can't be queued on the read queue of the attached stream |
| 1972 | * that they are destined for. This is for flow control - |
| 1973 | * when this queue fills up, the lower read put procedure will |
| 1974 | * queue messages there and the flow control will propagate |
| 1975 | * down from there. |
| 1976 | */ |
| 1977 | while ((mp = getq(q)) != 0) { |
| 1978 | proto = PPP_PROTOCOL(mp->b_rptr); |
| 1979 | if (proto < 0x8000 && (as = find_dest(us, proto)) != 0) { |
| 1980 | if (!canput(as->q)) |
| 1981 | break; |
| 1982 | putq(as->q, mp); |
| 1983 | } else { |
| 1984 | if (!canputnext(q)) |
| 1985 | break; |
| 1986 | putnext(q, mp); |
| 1987 | } |
| 1988 | } |
| 1989 | if (mp) { |
| 1990 | putbq(q, mp); |
| 1991 | } else { |
| 1992 | /* can now put stuff directly on network protocol streams again */ |
| 1993 | for (as = us->next; as != 0; as = as->next) |
| 1994 | as->rblocked = 0; |
| 1995 | } |
| 1996 | |
| 1997 | /* |
| 1998 | * If this stream has a lower stream attached, |
| 1999 | * enable the read queue's service routine. |
| 2000 | * XXX we should really only do this if the queue length |
| 2001 | * has dropped below the low-water mark. |
| 2002 | */ |
| 2003 | if (us->lowerq != 0) |
| 2004 | qenable(RD(us->lowerq)); |
| 2005 | |
| 2006 | } else { |
| 2007 | /* |
| 2008 | * A network protocol stream. Put a DLPI header on each |
| 2009 | * packet and send it on. |
| 2010 | * (Actually, it seems that the IP module will happily |
| 2011 | * accept M_DATA messages without the DL_UNITDATA_IND header.) |
| 2012 | */ |
| 2013 | while ((mp = getq(q)) != 0) { |
| 2014 | if (!canputnext(q)) { |
| 2015 | putbq(q, mp); |
| 2016 | break; |
| 2017 | } |
| 2018 | #ifndef NO_DLPI |
| 2019 | proto = PPP_PROTOCOL(mp->b_rptr); |
| 2020 | mp->b_rptr += PPP_HDRLEN; |
| 2021 | hdr = allocb(sizeof(dl_unitdata_ind_t) + 2 * sizeof(uint), |
| 2022 | BPRI_MED); |
| 2023 | if (hdr == 0) { |
| 2024 | /* XXX should put it back and use bufcall */ |
| 2025 | freemsg(mp); |
| 2026 | continue; |
| 2027 | } |
| 2028 | hdr->b_datap->db_type = M_PROTO; |
| 2029 | ud = (dl_unitdata_ind_t *) hdr->b_wptr; |
| 2030 | hdr->b_wptr += sizeof(dl_unitdata_ind_t) + 2 * sizeof(uint); |
| 2031 | hdr->b_cont = mp; |
| 2032 | ud->dl_primitive = DL_UNITDATA_IND; |
| 2033 | ud->dl_dest_addr_length = sizeof(uint); |
| 2034 | ud->dl_dest_addr_offset = sizeof(dl_unitdata_ind_t); |
| 2035 | ud->dl_src_addr_length = sizeof(uint); |
| 2036 | ud->dl_src_addr_offset = ud->dl_dest_addr_offset + sizeof(uint); |
| 2037 | #if DL_CURRENT_VERSION >= 2 |
| 2038 | ud->dl_group_address = 0; |
| 2039 | #endif |
| 2040 | /* Send the DLPI client the data with the SAP they requested, |
| 2041 | (e.g. ETHERTYPE_IP) rather than the PPP protocol number |
| 2042 | (e.g. PPP_IP) */ |
| 2043 | ((uint *)(ud + 1))[0] = us->req_sap; /* dest SAP */ |
| 2044 | ((uint *)(ud + 1))[1] = us->req_sap; /* src SAP */ |
| 2045 | putnext(q, hdr); |
| 2046 | #else /* NO_DLPI */ |
| 2047 | putnext(q, mp); |
| 2048 | #endif /* NO_DLPI */ |
| 2049 | } |
| 2050 | /* |
| 2051 | * Now that we have consumed some packets from this queue, |
| 2052 | * enable the control stream's read service routine so that we |
| 2053 | * can process any packets for us that might have got queued |
| 2054 | * there for flow control reasons. |
| 2055 | */ |
| 2056 | if (us->ppa) |
| 2057 | qenable(us->ppa->q); |
| 2058 | } |
| 2059 | |
| 2060 | return 0; |
| 2061 | } |
| 2062 | |
| 2063 | static upperstr_t * |
| 2064 | find_dest(ppa, proto) |
| 2065 | upperstr_t *ppa; |
| 2066 | int proto; |
| 2067 | { |
| 2068 | upperstr_t *us; |
| 2069 | |
| 2070 | for (us = ppa->next; us != 0; us = us->next) |
| 2071 | if (proto == us->sap) |
| 2072 | break; |
| 2073 | return us; |
| 2074 | } |
| 2075 | |
| 2076 | #if defined (SOL2) |
| 2077 | /* |
| 2078 | * Test upstream promiscuous conditions. As of now, only pass IPv4 and |
| 2079 | * Ipv6 packets upstream (let PPP packets be decoded elsewhere). |
| 2080 | */ |
| 2081 | static upperstr_t * |
| 2082 | find_promisc(us, proto) |
| 2083 | upperstr_t *us; |
| 2084 | int proto; |
| 2085 | { |
| 2086 | |
| 2087 | if ((proto != PPP_IP) && (proto != PPP_IPV6)) |
| 2088 | return (upperstr_t *)0; |
| 2089 | |
| 2090 | for ( ; us; us = us->next) { |
| 2091 | if ((us->flags & US_PROMISC) && (us->state == DL_IDLE)) |
| 2092 | return us; |
| 2093 | } |
| 2094 | |
| 2095 | return (upperstr_t *)0; |
| 2096 | } |
| 2097 | |
| 2098 | /* |
| 2099 | * Prepend an empty Ethernet header to msg for snoop, et al. |
| 2100 | */ |
| 2101 | static mblk_t * |
| 2102 | prepend_ether(us, mp, proto) |
| 2103 | upperstr_t *us; |
| 2104 | mblk_t *mp; |
| 2105 | int proto; |
| 2106 | { |
| 2107 | mblk_t *eh; |
| 2108 | int type; |
| 2109 | |
| 2110 | if ((eh = allocb(sizeof(struct ether_header), BPRI_HI)) == 0) { |
| 2111 | freemsg(mp); |
| 2112 | return (mblk_t *)0; |
| 2113 | } |
| 2114 | |
| 2115 | if (proto == PPP_IP) |
| 2116 | type = ETHERTYPE_IP; |
| 2117 | else if (proto == PPP_IPV6) |
| 2118 | type = ETHERTYPE_IPV6; |
| 2119 | else |
| 2120 | type = proto; /* What else? Let decoder decide */ |
| 2121 | |
| 2122 | eh->b_wptr += sizeof(struct ether_header); |
| 2123 | bzero((caddr_t)eh->b_rptr, sizeof(struct ether_header)); |
| 2124 | ((struct ether_header *)eh->b_rptr)->ether_type = htons((short)type); |
| 2125 | eh->b_cont = mp; |
| 2126 | return (eh); |
| 2127 | } |
| 2128 | |
| 2129 | /* |
| 2130 | * Prepend DL_UNITDATA_IND mblk to msg |
| 2131 | */ |
| 2132 | static mblk_t * |
| 2133 | prepend_udind(us, mp, proto) |
| 2134 | upperstr_t *us; |
| 2135 | mblk_t *mp; |
| 2136 | int proto; |
| 2137 | { |
| 2138 | dl_unitdata_ind_t *dlu; |
| 2139 | mblk_t *dh; |
| 2140 | size_t size; |
| 2141 | |
| 2142 | size = sizeof(dl_unitdata_ind_t); |
| 2143 | if ((dh = allocb(size, BPRI_MED)) == 0) { |
| 2144 | freemsg(mp); |
| 2145 | return (mblk_t *)0; |
| 2146 | } |
| 2147 | |
| 2148 | dh->b_datap->db_type = M_PROTO; |
| 2149 | dh->b_wptr = dh->b_datap->db_lim; |
| 2150 | dh->b_rptr = dh->b_wptr - size; |
| 2151 | |
| 2152 | dlu = (dl_unitdata_ind_t *)dh->b_rptr; |
| 2153 | dlu->dl_primitive = DL_UNITDATA_IND; |
| 2154 | dlu->dl_dest_addr_length = 0; |
| 2155 | dlu->dl_dest_addr_offset = sizeof(dl_unitdata_ind_t); |
| 2156 | dlu->dl_src_addr_length = 0; |
| 2157 | dlu->dl_src_addr_offset = sizeof(dl_unitdata_ind_t); |
| 2158 | dlu->dl_group_address = 0; |
| 2159 | |
| 2160 | dh->b_cont = mp; |
| 2161 | return (dh); |
| 2162 | } |
| 2163 | |
| 2164 | /* |
| 2165 | * For any recognized promiscuous streams, send data upstream |
| 2166 | */ |
| 2167 | static void |
| 2168 | promisc_sendup(ppa, mp, proto, skip) |
| 2169 | upperstr_t *ppa; |
| 2170 | mblk_t *mp; |
| 2171 | int proto, skip; |
| 2172 | { |
| 2173 | mblk_t *dup_mp, *dup_dup_mp; |
| 2174 | upperstr_t *prus, *nprus; |
| 2175 | |
| 2176 | if ((prus = find_promisc(ppa, proto)) != 0) { |
| 2177 | if (dup_mp = dupmsg(mp)) { |
| 2178 | |
| 2179 | if (skip) |
| 2180 | dup_mp->b_rptr += PPP_HDRLEN; |
| 2181 | |
| 2182 | for ( ; nprus = find_promisc(prus->next, proto); |
| 2183 | prus = nprus) { |
| 2184 | |
| 2185 | if (dup_dup_mp = dupmsg(dup_mp)) { |
| 2186 | if (canputnext(prus->q)) { |
| 2187 | if (prus->flags & US_RAWDATA) { |
| 2188 | dup_dup_mp = prepend_ether(prus, dup_dup_mp, proto); |
| 2189 | putnext(prus->q, dup_dup_mp); |
| 2190 | } else { |
| 2191 | dup_dup_mp = prepend_udind(prus, dup_dup_mp, proto); |
| 2192 | putnext(prus->q, dup_dup_mp); |
| 2193 | } |
| 2194 | } else { |
| 2195 | DPRINT("ppp_urput: data to promisc q dropped\n"); |
| 2196 | freemsg(dup_dup_mp); |
| 2197 | } |
| 2198 | } |
| 2199 | } |
| 2200 | |
| 2201 | if (canputnext(prus->q)) { |
| 2202 | if (prus->flags & US_RAWDATA) { |
| 2203 | dup_mp = prepend_ether(prus, dup_mp, proto); |
| 2204 | putnext(prus->q, dup_mp); |
| 2205 | } else { |
| 2206 | dup_mp = prepend_udind(prus, dup_mp, proto); |
| 2207 | putnext(prus->q, dup_mp); |
| 2208 | } |
| 2209 | } else { |
| 2210 | DPRINT("ppp_urput: data to promisc q dropped\n"); |
| 2211 | freemsg(dup_mp); |
| 2212 | } |
| 2213 | } |
| 2214 | } |
| 2215 | } |
| 2216 | #endif /* defined(SOL2) */ |
| 2217 | |
| 2218 | /* |
| 2219 | * We simply put the message on to the associated upper control stream |
| 2220 | * (either here or in ppplrsrv). That way we enter the perimeters |
| 2221 | * before looking through the list of attached streams to decide which |
| 2222 | * stream it should go up. |
| 2223 | */ |
| 2224 | static int |
| 2225 | ppplrput(q, mp) |
| 2226 | queue_t *q; |
| 2227 | mblk_t *mp; |
| 2228 | { |
| 2229 | queue_t *uq; |
| 2230 | struct iocblk *iop; |
| 2231 | |
| 2232 | switch (mp->b_datap->db_type) { |
| 2233 | case M_IOCTL: |
| 2234 | iop = (struct iocblk *) mp->b_rptr; |
| 2235 | iop->ioc_error = EINVAL; |
| 2236 | mp->b_datap->db_type = M_IOCNAK; |
| 2237 | qreply(q, mp); |
| 2238 | return 0; |
| 2239 | case M_FLUSH: |
| 2240 | if (*mp->b_rptr & FLUSHR) |
| 2241 | flushq(q, FLUSHDATA); |
| 2242 | if (*mp->b_rptr & FLUSHW) { |
| 2243 | *mp->b_rptr &= ~FLUSHR; |
| 2244 | qreply(q, mp); |
| 2245 | } else |
| 2246 | freemsg(mp); |
| 2247 | return 0; |
| 2248 | } |
| 2249 | |
| 2250 | /* |
| 2251 | * If we can't get the lower lock straight away, queue this one |
| 2252 | * rather than blocking, to avoid the possibility of deadlock. |
| 2253 | */ |
| 2254 | if (!TRYLOCK_LOWER_R) { |
| 2255 | putq(q, mp); |
| 2256 | return 0; |
| 2257 | } |
| 2258 | |
| 2259 | /* |
| 2260 | * Check that we're still connected to the driver. |
| 2261 | */ |
| 2262 | uq = (queue_t *) q->q_ptr; |
| 2263 | if (uq == 0) { |
| 2264 | UNLOCK_LOWER; |
| 2265 | DPRINT1("ppplrput: q = %x, uq = 0??\n", q); |
| 2266 | freemsg(mp); |
| 2267 | return 0; |
| 2268 | } |
| 2269 | |
| 2270 | /* |
| 2271 | * Try to forward the message to the put routine for the upper |
| 2272 | * control stream for this lower stream. |
| 2273 | * If there are already messages queued here, queue this one so |
| 2274 | * they don't get out of order. |
| 2275 | */ |
| 2276 | if (queclass(mp) == QPCTL || (qsize(q) == 0 && canput(uq))) |
| 2277 | put(uq, mp); |
| 2278 | else |
| 2279 | putq(q, mp); |
| 2280 | |
| 2281 | UNLOCK_LOWER; |
| 2282 | return 0; |
| 2283 | } |
| 2284 | |
| 2285 | static int |
| 2286 | ppplrsrv(q) |
| 2287 | queue_t *q; |
| 2288 | { |
| 2289 | mblk_t *mp; |
| 2290 | queue_t *uq; |
| 2291 | |
| 2292 | /* |
| 2293 | * Packets get queued here for flow control reasons |
| 2294 | * or if the lrput routine couldn't get the lower lock |
| 2295 | * without blocking. |
| 2296 | */ |
| 2297 | LOCK_LOWER_R; |
| 2298 | uq = (queue_t *) q->q_ptr; |
| 2299 | if (uq == 0) { |
| 2300 | UNLOCK_LOWER; |
| 2301 | flushq(q, FLUSHALL); |
| 2302 | DPRINT1("ppplrsrv: q = %x, uq = 0??\n", q); |
| 2303 | return 0; |
| 2304 | } |
| 2305 | while ((mp = getq(q)) != 0) { |
| 2306 | if (queclass(mp) == QPCTL || canput(uq)) |
| 2307 | put(uq, mp); |
| 2308 | else { |
| 2309 | putbq(q, mp); |
| 2310 | break; |
| 2311 | } |
| 2312 | } |
| 2313 | UNLOCK_LOWER; |
| 2314 | return 0; |
| 2315 | } |
| 2316 | |
| 2317 | static int |
| 2318 | putctl2(q, type, code, val) |
| 2319 | queue_t *q; |
| 2320 | int type, code, val; |
| 2321 | { |
| 2322 | mblk_t *mp; |
| 2323 | |
| 2324 | mp = allocb(2, BPRI_HI); |
| 2325 | if (mp == 0) |
| 2326 | return 0; |
| 2327 | mp->b_datap->db_type = type; |
| 2328 | mp->b_wptr[0] = code; |
| 2329 | mp->b_wptr[1] = val; |
| 2330 | mp->b_wptr += 2; |
| 2331 | putnext(q, mp); |
| 2332 | return 1; |
| 2333 | } |
| 2334 | |
| 2335 | static int |
| 2336 | putctl4(q, type, code, val) |
| 2337 | queue_t *q; |
| 2338 | int type, code, val; |
| 2339 | { |
| 2340 | mblk_t *mp; |
| 2341 | |
| 2342 | mp = allocb(4, BPRI_HI); |
| 2343 | if (mp == 0) |
| 2344 | return 0; |
| 2345 | mp->b_datap->db_type = type; |
| 2346 | mp->b_wptr[0] = code; |
| 2347 | ((short *)mp->b_wptr)[1] = val; |
| 2348 | mp->b_wptr += 4; |
| 2349 | putnext(q, mp); |
| 2350 | return 1; |
| 2351 | } |
| 2352 | |
| 2353 | static void |
| 2354 | debug_dump(q, mp) |
| 2355 | queue_t *q; |
| 2356 | mblk_t *mp; |
| 2357 | { |
| 2358 | upperstr_t *us; |
| 2359 | queue_t *uq, *lq; |
| 2360 | |
| 2361 | DPRINT("ppp upper streams:\n"); |
| 2362 | for (us = minor_devs; us != 0; us = us->nextmn) { |
| 2363 | uq = us->q; |
| 2364 | DPRINT3(" %d: q=%x rlev=%d", |
| 2365 | us->mn, uq, (uq? qsize(uq): 0)); |
| 2366 | DPRINT3(" wlev=%d flags=0x%b", (uq? qsize(WR(uq)): 0), |
| 2367 | us->flags, "\020\1priv\2control\3blocked\4last"); |
| 2368 | DPRINT3(" state=%x sap=%x req_sap=%x", us->state, us->sap, |
| 2369 | us->req_sap); |
| 2370 | if (us->ppa == 0) |
| 2371 | DPRINT(" ppa=?\n"); |
| 2372 | else |
| 2373 | DPRINT1(" ppa=%d\n", us->ppa->ppa_id); |
| 2374 | if (us->flags & US_CONTROL) { |
| 2375 | lq = us->lowerq; |
| 2376 | DPRINT3(" control for %d lq=%x rlev=%d", |
| 2377 | us->ppa_id, lq, (lq? qsize(RD(lq)): 0)); |
| 2378 | DPRINT3(" wlev=%d mru=%d mtu=%d\n", |
| 2379 | (lq? qsize(lq): 0), us->mru, us->mtu); |
| 2380 | } |
| 2381 | } |
| 2382 | mp->b_datap->db_type = M_IOCACK; |
| 2383 | qreply(q, mp); |
| 2384 | } |
| 2385 | |
| 2386 | #ifdef FILTER_PACKETS |
| 2387 | #include <netinet/in_systm.h> |
| 2388 | #include <netinet/ip.h> |
| 2389 | #include <netinet/udp.h> |
| 2390 | #include <netinet/tcp.h> |
| 2391 | |
| 2392 | #define MAX_IPHDR 128 /* max TCP/IP header size */ |
| 2393 | |
| 2394 | |
| 2395 | /* The following table contains a hard-coded list of protocol/port pairs. |
| 2396 | * Any matching packets are either discarded unconditionally, or, |
| 2397 | * if ok_if_link_up is non-zero when a connection does not currently exist |
| 2398 | * (i.e., they go through if the connection is present, but never initiate |
| 2399 | * a dial-out). |
| 2400 | * This idea came from a post by dm@garage.uun.org (David Mazieres) |
| 2401 | */ |
| 2402 | static struct pktfilt_tab { |
| 2403 | int proto; |
| 2404 | u_short port; |
| 2405 | u_short ok_if_link_up; |
| 2406 | } pktfilt_tab[] = { |
| 2407 | { IPPROTO_UDP, 520, 1 }, /* RIP, ok to pass if link is up */ |
| 2408 | { IPPROTO_UDP, 123, 1 }, /* NTP, don't keep up the link for it */ |
| 2409 | { -1, 0, 0 } /* terminator entry has port == -1 */ |
| 2410 | }; |
| 2411 | |
| 2412 | |
| 2413 | static int |
| 2414 | ip_hard_filter(us, mp, outbound) |
| 2415 | upperstr_t *us; |
| 2416 | mblk_t *mp; |
| 2417 | int outbound; |
| 2418 | { |
| 2419 | struct ip *ip; |
| 2420 | struct pktfilt_tab *pft; |
| 2421 | mblk_t *temp_mp; |
| 2422 | int proto; |
| 2423 | int len, hlen; |
| 2424 | |
| 2425 | |
| 2426 | /* Note, the PPP header has already been pulled up in all cases */ |
| 2427 | proto = PPP_PROTOCOL(mp->b_rptr); |
| 2428 | if (us->flags & US_DBGLOG) |
| 2429 | DPRINT3("ppp/%d: filter, proto=0x%x, out=%d\n", us->mn, proto, outbound); |
| 2430 | |
| 2431 | switch (proto) |
| 2432 | { |
| 2433 | case PPP_IP: |
| 2434 | if ((mp->b_wptr - mp->b_rptr) == PPP_HDRLEN && mp->b_cont != 0) { |
| 2435 | temp_mp = mp->b_cont; |
| 2436 | len = msgdsize(temp_mp); |
| 2437 | hlen = (len < MAX_IPHDR) ? len : MAX_IPHDR; |
| 2438 | PULLUP(temp_mp, hlen); |
| 2439 | if (temp_mp == 0) { |
| 2440 | DPRINT2("ppp/%d: filter, pullup next failed, len=%d\n", |
| 2441 | us->mn, hlen); |
| 2442 | mp->b_cont = 0; /* PULLUP() freed the rest */ |
| 2443 | freemsg(mp); |
| 2444 | return 0; |
| 2445 | } |
| 2446 | ip = (struct ip *)mp->b_cont->b_rptr; |
| 2447 | } |
| 2448 | else { |
| 2449 | len = msgdsize(mp); |
| 2450 | hlen = (len < (PPP_HDRLEN+MAX_IPHDR)) ? len : (PPP_HDRLEN+MAX_IPHDR); |
| 2451 | PULLUP(mp, hlen); |
| 2452 | if (mp == 0) { |
| 2453 | DPRINT2("ppp/%d: filter, pullup failed, len=%d\n", |
| 2454 | us->mn, hlen); |
| 2455 | return 0; |
| 2456 | } |
| 2457 | ip = (struct ip *)(mp->b_rptr + PPP_HDRLEN); |
| 2458 | } |
| 2459 | |
| 2460 | /* For IP traffic, certain packets (e.g., RIP) may be either |
| 2461 | * 1. ignored - dropped completely |
| 2462 | * 2. will not initiate a connection, but |
| 2463 | * will be passed if a connection is currently up. |
| 2464 | */ |
| 2465 | for (pft=pktfilt_tab; pft->proto != -1; pft++) { |
| 2466 | if (ip->ip_p == pft->proto) { |
| 2467 | switch(pft->proto) { |
| 2468 | case IPPROTO_UDP: |
| 2469 | if (((struct udphdr *) &((int *)ip)[ip->ip_hl])->uh_dport |
| 2470 | == htons(pft->port)) goto endfor; |
| 2471 | break; |
| 2472 | case IPPROTO_TCP: |
| 2473 | if (((struct tcphdr *) &((int *)ip)[ip->ip_hl])->th_dport |
| 2474 | == htons(pft->port)) goto endfor; |
| 2475 | break; |
| 2476 | } |
| 2477 | } |
| 2478 | } |
| 2479 | endfor: |
| 2480 | if (pft->proto != -1) { |
| 2481 | if (us->flags & US_DBGLOG) |
| 2482 | DPRINT3("ppp/%d: found IP pkt, proto=0x%x (%d)\n", |
| 2483 | us->mn, pft->proto, pft->port); |
| 2484 | /* Discard if not connected, or if not pass_with_link_up */ |
| 2485 | /* else, if link is up let go by, but don't update time */ |
| 2486 | return pft->ok_if_link_up? -1: 0; |
| 2487 | } |
| 2488 | break; |
| 2489 | } /* end switch (proto) */ |
| 2490 | |
| 2491 | return 1; |
| 2492 | } |
| 2493 | #endif /* FILTER_PACKETS */ |
| 2494 | |