From a9b2bdafaf625d10aef2f476aa4014fd36c846bc Mon Sep 17 00:00:00 2001 From: Dexter Morgan Date: Thu, 2 Jun 2011 20:51:35 +0000 Subject: Branch for updates --- mdk-stage1/ppp/modules/bsd-comp.c | 1116 ++++++++++++++++ mdk-stage1/ppp/modules/deflate.c | 760 +++++++++++ mdk-stage1/ppp/modules/if_ppp.c | 865 ++++++++++++ mdk-stage1/ppp/modules/ppp.c | 2486 +++++++++++++++++++++++++++++++++++ mdk-stage1/ppp/modules/ppp_ahdlc.c | 878 +++++++++++++ mdk-stage1/ppp/modules/ppp_comp.c | 1126 ++++++++++++++++ mdk-stage1/ppp/modules/ppp_mod.h | 190 +++ mdk-stage1/ppp/modules/vjcompress.c | 587 +++++++++ 8 files changed, 8008 insertions(+) create mode 100644 mdk-stage1/ppp/modules/bsd-comp.c create mode 100644 mdk-stage1/ppp/modules/deflate.c create mode 100644 mdk-stage1/ppp/modules/if_ppp.c create mode 100644 mdk-stage1/ppp/modules/ppp.c create mode 100644 mdk-stage1/ppp/modules/ppp_ahdlc.c create mode 100644 mdk-stage1/ppp/modules/ppp_comp.c create mode 100644 mdk-stage1/ppp/modules/ppp_mod.h create mode 100644 mdk-stage1/ppp/modules/vjcompress.c (limited to 'mdk-stage1/ppp/modules') diff --git a/mdk-stage1/ppp/modules/bsd-comp.c b/mdk-stage1/ppp/modules/bsd-comp.c new file mode 100644 index 000000000..bbc8625db --- /dev/null +++ b/mdk-stage1/ppp/modules/bsd-comp.c @@ -0,0 +1,1116 @@ +/* Because this code is derived from the 4.3BSD compress source: + * + * + * Copyright (c) 1985, 1986 The Regents of the University of California. + * All rights reserved. + * + * This code is derived from software contributed to Berkeley by + * James A. Woods, derived from original work by Spencer Thomas + * and Joseph Orost. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution. + * 3. All advertising materials mentioning features or use of this software + * must display the following acknowledgement: + * This product includes software developed by the University of + * California, Berkeley and its contributors. + * 4. Neither the name of the University nor the names of its contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + * SUCH DAMAGE. + */ + +/* + * This version is for use with STREAMS under SunOS 4.x, + * Digital UNIX, AIX 4.x, and SVR4 systems including Solaris 2. + * + * $Id: bsd-comp.c 195720 2001-06-11 11:44:34Z gc $ + */ + +#ifdef AIX4 +#include +#endif +#include +#include +#include +#include +#include "ppp_mod.h" + +#ifdef SVR4 +#include +#ifndef _BIG_ENDIAN +#define BSD_LITTLE_ENDIAN +#endif +#endif + +#ifdef __osf__ +#undef FIRST +#undef LAST +#define BSD_LITTLE_ENDIAN +#endif + +#define PACKETPTR mblk_t * +#include + +#if DO_BSD_COMPRESS + +/* + * PPP "BSD compress" compression + * The differences between this compression and the classic BSD LZW + * source are obvious from the requirement that the classic code worked + * with files while this handles arbitrarily long streams that + * are broken into packets. They are: + * + * When the code size expands, a block of junk is not emitted by + * the compressor and not expected by the decompressor. + * + * New codes are not necessarily assigned every time an old + * code is output by the compressor. This is because a packet + * end forces a code to be emitted, but does not imply that a + * new sequence has been seen. + * + * The compression ratio is checked at the first end of a packet + * after the appropriate gap. Besides simplifying and speeding + * things up, this makes it more likely that the transmitter + * and receiver will agree when the dictionary is cleared when + * compression is not going well. + */ + +/* + * A dictionary for doing BSD compress. + */ +struct bsd_db { + int totlen; /* length of this structure */ + u_int hsize; /* size of the hash table */ + u_char hshift; /* used in hash function */ + u_char n_bits; /* current bits/code */ + u_char maxbits; + u_char debug; + u_char unit; + u_short seqno; /* sequence number of next packet */ + u_int hdrlen; /* header length to preallocate */ + u_int mru; + u_int maxmaxcode; /* largest valid code */ + u_int max_ent; /* largest code in use */ + u_int in_count; /* uncompressed bytes, aged */ + u_int bytes_out; /* compressed bytes, aged */ + u_int ratio; /* recent compression ratio */ + u_int checkpoint; /* when to next check the ratio */ + u_int clear_count; /* times dictionary cleared */ + u_int incomp_count; /* incompressible packets */ + u_int incomp_bytes; /* incompressible bytes */ + u_int uncomp_count; /* uncompressed packets */ + u_int uncomp_bytes; /* uncompressed bytes */ + u_int comp_count; /* compressed packets */ + u_int comp_bytes; /* compressed bytes */ + u_short *lens; /* array of lengths of codes */ + struct bsd_dict { + union { /* hash value */ + u_int32_t fcode; + struct { +#ifdef BSD_LITTLE_ENDIAN + u_short prefix; /* preceding code */ + u_char suffix; /* last character of new code */ + u_char pad; +#else + u_char pad; + u_char suffix; /* last character of new code */ + u_short prefix; /* preceding code */ +#endif + } hs; + } f; + u_short codem1; /* output of hash table -1 */ + u_short cptr; /* map code to hash table entry */ + } dict[1]; +}; + +#define BSD_OVHD 2 /* BSD compress overhead/packet */ +#define BSD_INIT_BITS BSD_MIN_BITS + +static void *bsd_comp_alloc __P((u_char *options, int opt_len)); +static void *bsd_decomp_alloc __P((u_char *options, int opt_len)); +static void bsd_free __P((void *state)); +static int bsd_comp_init __P((void *state, u_char *options, int opt_len, + int unit, int hdrlen, int debug)); +static int bsd_decomp_init __P((void *state, u_char *options, int opt_len, + int unit, int hdrlen, int mru, int debug)); +static int bsd_compress __P((void *state, mblk_t **mret, + mblk_t *mp, int slen, int maxolen)); +static void bsd_incomp __P((void *state, mblk_t *dmsg)); +static int bsd_decompress __P((void *state, mblk_t *cmp, mblk_t **dmpp)); +static void bsd_reset __P((void *state)); +static void bsd_comp_stats __P((void *state, struct compstat *stats)); + +/* + * Procedures exported to ppp_comp.c. + */ +struct compressor ppp_bsd_compress = { + CI_BSD_COMPRESS, /* compress_proto */ + bsd_comp_alloc, /* comp_alloc */ + bsd_free, /* comp_free */ + bsd_comp_init, /* comp_init */ + bsd_reset, /* comp_reset */ + bsd_compress, /* compress */ + bsd_comp_stats, /* comp_stat */ + bsd_decomp_alloc, /* decomp_alloc */ + bsd_free, /* decomp_free */ + bsd_decomp_init, /* decomp_init */ + bsd_reset, /* decomp_reset */ + bsd_decompress, /* decompress */ + bsd_incomp, /* incomp */ + bsd_comp_stats, /* decomp_stat */ +}; + +/* + * the next two codes should not be changed lightly, as they must not + * lie within the contiguous general code space. + */ +#define CLEAR 256 /* table clear output code */ +#define FIRST 257 /* first free entry */ +#define LAST 255 + +#define MAXCODE(b) ((1 << (b)) - 1) +#define BADCODEM1 MAXCODE(BSD_MAX_BITS) + +#define BSD_HASH(prefix,suffix,hshift) ((((u_int32_t)(suffix)) << (hshift)) \ + ^ (u_int32_t)(prefix)) +#define BSD_KEY(prefix,suffix) ((((u_int32_t)(suffix)) << 16) \ + + (u_int32_t)(prefix)) + +#define CHECK_GAP 10000 /* Ratio check interval */ + +#define RATIO_SCALE_LOG 8 +#define RATIO_SCALE (1<>RATIO_SCALE_LOG) + +#define DECOMP_CHUNK 256 + +/* + * clear the dictionary + */ +static void +bsd_clear(db) + struct bsd_db *db; +{ + db->clear_count++; + db->max_ent = FIRST-1; + db->n_bits = BSD_INIT_BITS; + db->ratio = 0; + db->bytes_out = 0; + db->in_count = 0; + db->checkpoint = CHECK_GAP; +} + +/* + * If the dictionary is full, then see if it is time to reset it. + * + * Compute the compression ratio using fixed-point arithmetic + * with 8 fractional bits. + * + * Since we have an infinite stream instead of a single file, + * watch only the local compression ratio. + * + * Since both peers must reset the dictionary at the same time even in + * the absence of CLEAR codes (while packets are incompressible), they + * must compute the same ratio. + */ +static int /* 1=output CLEAR */ +bsd_check(db) + struct bsd_db *db; +{ + u_int new_ratio; + + if (db->in_count >= db->checkpoint) { + /* age the ratio by limiting the size of the counts */ + if (db->in_count >= RATIO_MAX + || db->bytes_out >= RATIO_MAX) { + db->in_count -= db->in_count/4; + db->bytes_out -= db->bytes_out/4; + } + + db->checkpoint = db->in_count + CHECK_GAP; + + if (db->max_ent >= db->maxmaxcode) { + /* Reset the dictionary only if the ratio is worse, + * or if it looks as if it has been poisoned + * by incompressible data. + * + * This does not overflow, because + * db->in_count <= RATIO_MAX. + */ + new_ratio = db->in_count << RATIO_SCALE_LOG; + if (db->bytes_out != 0) + new_ratio /= db->bytes_out; + + if (new_ratio < db->ratio || new_ratio < 1 * RATIO_SCALE) { + bsd_clear(db); + return 1; + } + db->ratio = new_ratio; + } + } + return 0; +} + +/* + * Return statistics. + */ +static void +bsd_comp_stats(state, stats) + void *state; + struct compstat *stats; +{ + struct bsd_db *db = (struct bsd_db *) state; + u_int out; + + stats->unc_bytes = db->uncomp_bytes; + stats->unc_packets = db->uncomp_count; + stats->comp_bytes = db->comp_bytes; + stats->comp_packets = db->comp_count; + stats->inc_bytes = db->incomp_bytes; + stats->inc_packets = db->incomp_count; + stats->ratio = db->in_count; + out = db->bytes_out; + if (stats->ratio <= 0x7fffff) + stats->ratio <<= 8; + else + out >>= 8; + if (out != 0) + stats->ratio /= out; +} + +/* + * Reset state, as on a CCP ResetReq. + */ +static void +bsd_reset(state) + void *state; +{ + struct bsd_db *db = (struct bsd_db *) state; + + db->seqno = 0; + bsd_clear(db); + db->clear_count = 0; +} + +/* + * Allocate space for a (de) compressor. + */ +static void * +bsd_alloc(options, opt_len, decomp) + u_char *options; + int opt_len, decomp; +{ + int bits; + u_int newlen, hsize, hshift, maxmaxcode; + struct bsd_db *db; + + if (opt_len != 3 || options[0] != CI_BSD_COMPRESS || options[1] != 3 + || BSD_VERSION(options[2]) != BSD_CURRENT_VERSION) + return NULL; + + bits = BSD_NBITS(options[2]); + switch (bits) { + case 9: /* needs 82152 for both directions */ + case 10: /* needs 84144 */ + case 11: /* needs 88240 */ + case 12: /* needs 96432 */ + hsize = 5003; + hshift = 4; + break; + case 13: /* needs 176784 */ + hsize = 9001; + hshift = 5; + break; + case 14: /* needs 353744 */ + hsize = 18013; + hshift = 6; + break; + case 15: /* needs 691440 */ + hsize = 35023; + hshift = 7; + break; + case 16: /* needs 1366160--far too much, */ + /* hsize = 69001; */ /* and 69001 is too big for cptr */ + /* hshift = 8; */ /* in struct bsd_db */ + /* break; */ + default: + return NULL; + } + + maxmaxcode = MAXCODE(bits); + newlen = sizeof(*db) + (hsize-1) * (sizeof(db->dict[0])); +#ifdef __osf__ + db = (struct bsd_db *) ALLOC_SLEEP(newlen); +#else + db = (struct bsd_db *) ALLOC_NOSLEEP(newlen); +#endif + if (!db) + return NULL; + bzero(db, sizeof(*db) - sizeof(db->dict)); + + if (!decomp) { + db->lens = NULL; + } else { +#ifdef __osf__ + db->lens = (u_short *) ALLOC_SLEEP((maxmaxcode+1) * sizeof(db->lens[0])); +#else + db->lens = (u_short *) ALLOC_NOSLEEP((maxmaxcode+1) * sizeof(db->lens[0])); +#endif + if (!db->lens) { + FREE(db, newlen); + return NULL; + } + } + + db->totlen = newlen; + db->hsize = hsize; + db->hshift = hshift; + db->maxmaxcode = maxmaxcode; + db->maxbits = bits; + + return (void *) db; +} + +static void +bsd_free(state) + void *state; +{ + struct bsd_db *db = (struct bsd_db *) state; + + if (db->lens) + FREE(db->lens, (db->maxmaxcode+1) * sizeof(db->lens[0])); + FREE(db, db->totlen); +} + +static void * +bsd_comp_alloc(options, opt_len) + u_char *options; + int opt_len; +{ + return bsd_alloc(options, opt_len, 0); +} + +static void * +bsd_decomp_alloc(options, opt_len) + u_char *options; + int opt_len; +{ + return bsd_alloc(options, opt_len, 1); +} + +/* + * Initialize the database. + */ +static int +bsd_init(db, options, opt_len, unit, hdrlen, mru, debug, decomp) + struct bsd_db *db; + u_char *options; + int opt_len, unit, hdrlen, mru, debug, decomp; +{ + int i; + + if (opt_len < CILEN_BSD_COMPRESS + || options[0] != CI_BSD_COMPRESS || options[1] != CILEN_BSD_COMPRESS + || BSD_VERSION(options[2]) != BSD_CURRENT_VERSION + || BSD_NBITS(options[2]) != db->maxbits + || decomp && db->lens == NULL) + return 0; + + if (decomp) { + i = LAST+1; + while (i != 0) + db->lens[--i] = 1; + } + i = db->hsize; + while (i != 0) { + db->dict[--i].codem1 = BADCODEM1; + db->dict[i].cptr = 0; + } + + db->unit = unit; + db->hdrlen = hdrlen; + db->mru = mru; + if (debug) + db->debug = 1; + + bsd_reset(db); + + return 1; +} + +static int +bsd_comp_init(state, options, opt_len, unit, hdrlen, debug) + void *state; + u_char *options; + int opt_len, unit, hdrlen, debug; +{ + return bsd_init((struct bsd_db *) state, options, opt_len, + unit, hdrlen, 0, debug, 0); +} + +static int +bsd_decomp_init(state, options, opt_len, unit, hdrlen, mru, debug) + void *state; + u_char *options; + int opt_len, unit, hdrlen, mru, debug; +{ + return bsd_init((struct bsd_db *) state, options, opt_len, + unit, hdrlen, mru, debug, 1); +} + + +/* + * compress a packet + * One change from the BSD compress command is that when the + * code size expands, we do not output a bunch of padding. + * + * N.B. at present, we ignore the hdrlen specified in the comp_init call. + */ +static int /* new slen */ +bsd_compress(state, mretp, mp, slen, maxolen) + void *state; + mblk_t **mretp; /* return compressed mbuf chain here */ + mblk_t *mp; /* from here */ + int slen; /* uncompressed length */ + int maxolen; /* max compressed length */ +{ + struct bsd_db *db = (struct bsd_db *) state; + int hshift = db->hshift; + u_int max_ent = db->max_ent; + u_int n_bits = db->n_bits; + u_int bitno = 32; + u_int32_t accm = 0, fcode; + struct bsd_dict *dictp; + u_char c; + int hval, disp, ent, ilen; + mblk_t *np, *mret; + u_char *rptr, *wptr; + u_char *cp_end; + int olen; + mblk_t *m, **mnp; + +#define PUTBYTE(v) { \ + if (wptr) { \ + *wptr++ = (v); \ + if (wptr >= cp_end) { \ + m->b_wptr = wptr; \ + m = m->b_cont; \ + if (m) { \ + wptr = m->b_wptr; \ + cp_end = m->b_datap->db_lim; \ + } else \ + wptr = NULL; \ + } \ + } \ + ++olen; \ +} + +#define OUTPUT(ent) { \ + bitno -= n_bits; \ + accm |= ((ent) << bitno); \ + do { \ + PUTBYTE(accm >> 24); \ + accm <<= 8; \ + bitno += 8; \ + } while (bitno <= 24); \ +} + + /* + * First get the protocol and check that we're + * interested in this packet. + */ + *mretp = NULL; + rptr = mp->b_rptr; + if (rptr + PPP_HDRLEN > mp->b_wptr) { + if (!pullupmsg(mp, PPP_HDRLEN)) + return 0; + rptr = mp->b_rptr; + } + ent = PPP_PROTOCOL(rptr); /* get the protocol */ + if (ent < 0x21 || ent > 0xf9) + return 0; + + /* Don't generate compressed packets which are larger than + the uncompressed packet. */ + if (maxolen > slen) + maxolen = slen; + + /* Allocate enough message blocks to give maxolen total space. */ + mnp = &mret; + for (olen = maxolen; olen > 0; ) { + m = allocb((olen < 4096? olen: 4096), BPRI_MED); + *mnp = m; + if (m == NULL) { + if (mret != NULL) { + freemsg(mret); + mnp = &mret; + } + break; + } + mnp = &m->b_cont; + olen -= m->b_datap->db_lim - m->b_wptr; + } + *mnp = NULL; + + if ((m = mret) != NULL) { + wptr = m->b_wptr; + cp_end = m->b_datap->db_lim; + } else + wptr = cp_end = NULL; + olen = 0; + + /* + * Copy the PPP header over, changing the protocol, + * and install the 2-byte sequence number. + */ + if (wptr) { + wptr[0] = PPP_ADDRESS(rptr); + wptr[1] = PPP_CONTROL(rptr); + wptr[2] = 0; /* change the protocol */ + wptr[3] = PPP_COMP; + wptr[4] = db->seqno >> 8; + wptr[5] = db->seqno; + wptr += PPP_HDRLEN + BSD_OVHD; + } + ++db->seqno; + rptr += PPP_HDRLEN; + + slen = mp->b_wptr - rptr; + ilen = slen + 1; + np = mp->b_cont; + for (;;) { + if (slen <= 0) { + if (!np) + break; + rptr = np->b_rptr; + slen = np->b_wptr - rptr; + np = np->b_cont; + if (!slen) + continue; /* handle 0-length buffers */ + ilen += slen; + } + + slen--; + c = *rptr++; + fcode = BSD_KEY(ent, c); + hval = BSD_HASH(ent, c, hshift); + dictp = &db->dict[hval]; + + /* Validate and then check the entry. */ + if (dictp->codem1 >= max_ent) + goto nomatch; + if (dictp->f.fcode == fcode) { + ent = dictp->codem1+1; + continue; /* found (prefix,suffix) */ + } + + /* continue probing until a match or invalid entry */ + disp = (hval == 0) ? 1 : hval; + do { + hval += disp; + if (hval >= db->hsize) + hval -= db->hsize; + dictp = &db->dict[hval]; + if (dictp->codem1 >= max_ent) + goto nomatch; + } while (dictp->f.fcode != fcode); + ent = dictp->codem1 + 1; /* finally found (prefix,suffix) */ + continue; + + nomatch: + OUTPUT(ent); /* output the prefix */ + + /* code -> hashtable */ + if (max_ent < db->maxmaxcode) { + struct bsd_dict *dictp2; + /* expand code size if needed */ + if (max_ent >= MAXCODE(n_bits)) + db->n_bits = ++n_bits; + + /* Invalidate old hash table entry using + * this code, and then take it over. + */ + dictp2 = &db->dict[max_ent+1]; + if (db->dict[dictp2->cptr].codem1 == max_ent) + db->dict[dictp2->cptr].codem1 = BADCODEM1; + dictp2->cptr = hval; + dictp->codem1 = max_ent; + dictp->f.fcode = fcode; + + db->max_ent = ++max_ent; + } + ent = c; + } + + OUTPUT(ent); /* output the last code */ + db->bytes_out += olen; + db->in_count += ilen; + if (bitno < 32) + ++db->bytes_out; /* count complete bytes */ + + if (bsd_check(db)) + OUTPUT(CLEAR); /* do not count the CLEAR */ + + /* + * Pad dribble bits of last code with ones. + * Do not emit a completely useless byte of ones. + */ + if (bitno != 32) + PUTBYTE((accm | (0xff << (bitno-8))) >> 24); + + /* + * Increase code size if we would have without the packet + * boundary and as the decompressor will. + */ + if (max_ent >= MAXCODE(n_bits) && max_ent < db->maxmaxcode) + db->n_bits++; + + db->uncomp_bytes += ilen; + ++db->uncomp_count; + if (olen + PPP_HDRLEN + BSD_OVHD > maxolen && mret != NULL) { + /* throw away the compressed stuff if it is longer than uncompressed */ + freemsg(mret); + mret = NULL; + ++db->incomp_count; + db->incomp_bytes += ilen; + } else if (wptr != NULL) { + m->b_wptr = wptr; + if (m->b_cont) { + freemsg(m->b_cont); + m->b_cont = NULL; + } + ++db->comp_count; + db->comp_bytes += olen + BSD_OVHD; + } + + *mretp = mret; + return olen + PPP_HDRLEN + BSD_OVHD; +#undef OUTPUT +#undef PUTBYTE +} + + +/* + * Update the "BSD Compress" dictionary on the receiver for + * incompressible data by pretending to compress the incoming data. + */ +static void +bsd_incomp(state, dmsg) + void *state; + mblk_t *dmsg; +{ + struct bsd_db *db = (struct bsd_db *) state; + u_int hshift = db->hshift; + u_int max_ent = db->max_ent; + u_int n_bits = db->n_bits; + struct bsd_dict *dictp; + u_int32_t fcode; + u_char c; + long hval, disp; + int slen, ilen; + u_int bitno = 7; + u_char *rptr; + u_int ent; + + rptr = dmsg->b_rptr; + if (rptr + PPP_HDRLEN > dmsg->b_wptr) { + if (!pullupmsg(dmsg, PPP_HDRLEN)) + return; + rptr = dmsg->b_rptr; + } + ent = PPP_PROTOCOL(rptr); /* get the protocol */ + if (ent < 0x21 || ent > 0xf9) + return; + + db->seqno++; + ilen = 1; /* count the protocol as 1 byte */ + rptr += PPP_HDRLEN; + for (;;) { + slen = dmsg->b_wptr - rptr; + if (slen <= 0) { + dmsg = dmsg->b_cont; + if (!dmsg) + break; + rptr = dmsg->b_rptr; + continue; /* skip zero-length buffers */ + } + ilen += slen; + + do { + c = *rptr++; + fcode = BSD_KEY(ent, c); + hval = BSD_HASH(ent, c, hshift); + dictp = &db->dict[hval]; + + /* validate and then check the entry */ + if (dictp->codem1 >= max_ent) + goto nomatch; + if (dictp->f.fcode == fcode) { + ent = dictp->codem1+1; + continue; /* found (prefix,suffix) */ + } + + /* continue probing until a match or invalid entry */ + disp = (hval == 0) ? 1 : hval; + do { + hval += disp; + if (hval >= db->hsize) + hval -= db->hsize; + dictp = &db->dict[hval]; + if (dictp->codem1 >= max_ent) + goto nomatch; + } while (dictp->f.fcode != fcode); + ent = dictp->codem1+1; + continue; /* finally found (prefix,suffix) */ + + nomatch: /* output (count) the prefix */ + bitno += n_bits; + + /* code -> hashtable */ + if (max_ent < db->maxmaxcode) { + struct bsd_dict *dictp2; + /* expand code size if needed */ + if (max_ent >= MAXCODE(n_bits)) + db->n_bits = ++n_bits; + + /* Invalidate previous hash table entry + * assigned this code, and then take it over. + */ + dictp2 = &db->dict[max_ent+1]; + if (db->dict[dictp2->cptr].codem1 == max_ent) + db->dict[dictp2->cptr].codem1 = BADCODEM1; + dictp2->cptr = hval; + dictp->codem1 = max_ent; + dictp->f.fcode = fcode; + + db->max_ent = ++max_ent; + db->lens[max_ent] = db->lens[ent]+1; + } + ent = c; + } while (--slen != 0); + } + bitno += n_bits; /* output (count) the last code */ + db->bytes_out += bitno/8; + db->in_count += ilen; + (void)bsd_check(db); + + ++db->incomp_count; + db->incomp_bytes += ilen; + ++db->uncomp_count; + db->uncomp_bytes += ilen; + + /* Increase code size if we would have without the packet + * boundary and as the decompressor will. + */ + if (max_ent >= MAXCODE(n_bits) && max_ent < db->maxmaxcode) + db->n_bits++; +} + + +/* + * Decompress "BSD Compress" + * + * Because of patent problems, we return DECOMP_ERROR for errors + * found by inspecting the input data and for system problems, but + * DECOMP_FATALERROR for any errors which could possibly be said to + * be being detected "after" decompression. For DECOMP_ERROR, + * we can issue a CCP reset-request; for DECOMP_FATALERROR, we may be + * infringing a patent of Motorola's if we do, so we take CCP down + * instead. + * + * Given that the frame has the correct sequence number and a good FCS, + * errors such as invalid codes in the input most likely indicate a + * bug, so we return DECOMP_FATALERROR for them in order to turn off + * compression, even though they are detected by inspecting the input. + */ +static int +bsd_decompress(state, cmsg, dmpp) + void *state; + mblk_t *cmsg, **dmpp; +{ + struct bsd_db *db = (struct bsd_db *) state; + u_int max_ent = db->max_ent; + u_int32_t accm = 0; + u_int bitno = 32; /* 1st valid bit in accm */ + u_int n_bits = db->n_bits; + u_int tgtbitno = 32-n_bits; /* bitno when we have a code */ + struct bsd_dict *dictp; + int explen, i, seq, len; + u_int incode, oldcode, finchar; + u_char *p, *rptr, *wptr; + mblk_t *dmsg, *mret; + int adrs, ctrl, ilen; + int dlen, space, codelen, extra; + + /* + * Get at least the BSD Compress header in the first buffer + */ + rptr = cmsg->b_rptr; + if (rptr + PPP_HDRLEN + BSD_OVHD >= cmsg->b_wptr) { + if (!pullupmsg(cmsg, PPP_HDRLEN + BSD_OVHD + 1)) { + if (db->debug) + printf("bsd_decomp%d: failed to pullup\n", db->unit); + return DECOMP_ERROR; + } + rptr = cmsg->b_rptr; + } + + /* + * Save the address/control from the PPP header + * and then get the sequence number. + */ + adrs = PPP_ADDRESS(rptr); + ctrl = PPP_CONTROL(rptr); + rptr += PPP_HDRLEN; + seq = (rptr[0] << 8) + rptr[1]; + rptr += BSD_OVHD; + ilen = len = cmsg->b_wptr - rptr; + + /* + * Check the sequence number and give up if it is not what we expect. + */ + if (seq != db->seqno++) { + if (db->debug) + printf("bsd_decomp%d: bad sequence # %d, expected %d\n", + db->unit, seq, db->seqno - 1); + return DECOMP_ERROR; + } + + /* + * Allocate one message block to start with. + */ + if ((dmsg = allocb(DECOMP_CHUNK + db->hdrlen, BPRI_MED)) == NULL) + return DECOMP_ERROR; + mret = dmsg; + dmsg->b_wptr += db->hdrlen; + dmsg->b_rptr = wptr = dmsg->b_wptr; + + /* Fill in the ppp header, but not the last byte of the protocol + (that comes from the decompressed data). */ + wptr[0] = adrs; + wptr[1] = ctrl; + wptr[2] = 0; + wptr += PPP_HDRLEN - 1; + space = dmsg->b_datap->db_lim - wptr; + + oldcode = CLEAR; + explen = 0; + for (;;) { + if (len == 0) { + cmsg = cmsg->b_cont; + if (!cmsg) /* quit at end of message */ + break; + rptr = cmsg->b_rptr; + len = cmsg->b_wptr - rptr; + ilen += len; + continue; /* handle 0-length buffers */ + } + + /* + * Accumulate bytes until we have a complete code. + * Then get the next code, relying on the 32-bit, + * unsigned accm to mask the result. + */ + bitno -= 8; + accm |= *rptr++ << bitno; + --len; + if (tgtbitno < bitno) + continue; + incode = accm >> tgtbitno; + accm <<= n_bits; + bitno += n_bits; + + if (incode == CLEAR) { + /* + * The dictionary must only be cleared at + * the end of a packet. But there could be an + * empty message block at the end. + */ + if (len > 0 || cmsg->b_cont != 0) { + if (cmsg->b_cont) + len += msgdsize(cmsg->b_cont); + if (len > 0) { + freemsg(dmsg); + if (db->debug) + printf("bsd_decomp%d: bad CLEAR\n", db->unit); + return DECOMP_FATALERROR; + } + } + bsd_clear(db); + explen = ilen = 0; + break; + } + + if (incode > max_ent + 2 || incode > db->maxmaxcode + || incode > max_ent && oldcode == CLEAR) { + freemsg(dmsg); + if (db->debug) { + printf("bsd_decomp%d: bad code 0x%x oldcode=0x%x ", + db->unit, incode, oldcode); + printf("max_ent=0x%x dlen=%d seqno=%d\n", + max_ent, dlen, db->seqno); + } + return DECOMP_FATALERROR; /* probably a bug */ + } + + /* Special case for KwKwK string. */ + if (incode > max_ent) { + finchar = oldcode; + extra = 1; + } else { + finchar = incode; + extra = 0; + } + + codelen = db->lens[finchar]; + explen += codelen + extra; + if (explen > db->mru + 1) { + freemsg(dmsg); + if (db->debug) + printf("bsd_decomp%d: ran out of mru\n", db->unit); + return DECOMP_FATALERROR; + } + + /* + * Decode this code and install it in the decompressed buffer. + */ + space -= codelen + extra; + if (space < 0) { + /* Allocate another message block. */ + dmsg->b_wptr = wptr; + dlen = codelen + extra; + if (dlen < DECOMP_CHUNK) + dlen = DECOMP_CHUNK; + if ((dmsg->b_cont = allocb(dlen, BPRI_MED)) == NULL) { + freemsg(dmsg); + return DECOMP_ERROR; + } + dmsg = dmsg->b_cont; + wptr = dmsg->b_wptr; + space = dmsg->b_datap->db_lim - wptr - codelen - extra; + } + p = (wptr += codelen); + while (finchar > LAST) { + dictp = &db->dict[db->dict[finchar].cptr]; +#ifdef DEBUG + --codelen; + if (codelen <= 0) { + freemsg(dmsg); + printf("bsd_decomp%d: fell off end of chain ", db->unit); + printf("0x%x at 0x%x by 0x%x, max_ent=0x%x\n", + incode, finchar, db->dict[finchar].cptr, max_ent); + return DECOMP_FATALERROR; + } + if (dictp->codem1 != finchar-1) { + freemsg(dmsg); + printf("bsd_decomp%d: bad code chain 0x%x finchar=0x%x ", + db->unit, incode, finchar); + printf("oldcode=0x%x cptr=0x%x codem1=0x%x\n", oldcode, + db->dict[finchar].cptr, dictp->codem1); + return DECOMP_FATALERROR; + } +#endif + *--p = dictp->f.hs.suffix; + finchar = dictp->f.hs.prefix; + } + *--p = finchar; + +#ifdef DEBUG + if (--codelen != 0) + printf("bsd_decomp%d: short by %d after code 0x%x, max_ent=0x%x\n", + db->unit, codelen, incode, max_ent); +#endif + + if (extra) /* the KwKwK case again */ + *wptr++ = finchar; + + /* + * If not first code in a packet, and + * if not out of code space, then allocate a new code. + * + * Keep the hash table correct so it can be used + * with uncompressed packets. + */ + if (oldcode != CLEAR && max_ent < db->maxmaxcode) { + struct bsd_dict *dictp2; + u_int32_t fcode; + int hval, disp; + + fcode = BSD_KEY(oldcode,finchar); + hval = BSD_HASH(oldcode,finchar,db->hshift); + dictp = &db->dict[hval]; + + /* look for a free hash table entry */ + if (dictp->codem1 < max_ent) { + disp = (hval == 0) ? 1 : hval; + do { + hval += disp; + if (hval >= db->hsize) + hval -= db->hsize; + dictp = &db->dict[hval]; + } while (dictp->codem1 < max_ent); + } + + /* + * Invalidate previous hash table entry + * assigned this code, and then take it over + */ + dictp2 = &db->dict[max_ent+1]; + if (db->dict[dictp2->cptr].codem1 == max_ent) { + db->dict[dictp2->cptr].codem1 = BADCODEM1; + } + dictp2->cptr = hval; + dictp->codem1 = max_ent; + dictp->f.fcode = fcode; + + db->max_ent = ++max_ent; + db->lens[max_ent] = db->lens[oldcode]+1; + + /* Expand code size if needed. */ + if (max_ent >= MAXCODE(n_bits) && max_ent < db->maxmaxcode) { + db->n_bits = ++n_bits; + tgtbitno = 32-n_bits; + } + } + oldcode = incode; + } + dmsg->b_wptr = wptr; + + /* + * Keep the checkpoint right so that incompressible packets + * clear the dictionary at the right times. + */ + db->bytes_out += ilen; + db->in_count += explen; + if (bsd_check(db) && db->debug) { + printf("bsd_decomp%d: peer should have cleared dictionary\n", + db->unit); + } + + ++db->comp_count; + db->comp_bytes += ilen + BSD_OVHD; + ++db->uncomp_count; + db->uncomp_bytes += explen; + + *dmpp = mret; + return DECOMP_OK; +} +#endif /* DO_BSD_COMPRESS */ diff --git a/mdk-stage1/ppp/modules/deflate.c b/mdk-stage1/ppp/modules/deflate.c new file mode 100644 index 000000000..592344f9b --- /dev/null +++ b/mdk-stage1/ppp/modules/deflate.c @@ -0,0 +1,760 @@ +/* + * ppp_deflate.c - interface the zlib procedures for Deflate compression + * and decompression (as used by gzip) to the PPP code. + * This version is for use with STREAMS under SunOS 4.x, Solaris 2, + * SVR4, OSF/1 and AIX 4.x. + * + * Copyright (c) 1994 The Australian National University. + * All rights reserved. + * + * Permission to use, copy, modify, and distribute this software and its + * documentation is hereby granted, provided that the above copyright + * notice appears in all copies. This software is provided without any + * warranty, express or implied. The Australian National University + * makes no representations about the suitability of this software for + * any purpose. + * + * IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY + * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES + * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF + * THE AUSTRALIAN NATIONAL UNIVERSITY HAS BEEN ADVISED OF THE POSSIBILITY + * OF SUCH DAMAGE. + * + * THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY + * AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS + * ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO + * OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, + * OR MODIFICATIONS. + * + * $Id: deflate.c 195720 2001-06-11 11:44:34Z gc $ + */ + +#ifdef AIX4 +#include +#endif +#include +#include +#include +#include +#include "ppp_mod.h" + +#define PACKETPTR mblk_t * +#include + +#ifdef __osf__ +#include "zlib.h" +#else +#include "../common/zlib.h" +#endif + +#if DO_DEFLATE + +#define DEFLATE_DEBUG 1 + +/* + * State for a Deflate (de)compressor. + */ +struct deflate_state { + int seqno; + int w_size; + int unit; + int hdrlen; + int mru; + int debug; + z_stream strm; + struct compstat stats; +}; + +#define DEFLATE_OVHD 2 /* Deflate overhead/packet */ + +static void *z_alloc __P((void *, u_int items, u_int size)); +static void *z_alloc_init __P((void *, u_int items, u_int size)); +static void z_free __P((void *, void *ptr)); +static void *z_comp_alloc __P((u_char *options, int opt_len)); +static void *z_decomp_alloc __P((u_char *options, int opt_len)); +static void z_comp_free __P((void *state)); +static void z_decomp_free __P((void *state)); +static int z_comp_init __P((void *state, u_char *options, int opt_len, + int unit, int hdrlen, int debug)); +static int z_decomp_init __P((void *state, u_char *options, int opt_len, + int unit, int hdrlen, int mru, int debug)); +static int z_compress __P((void *state, mblk_t **mret, + mblk_t *mp, int slen, int maxolen)); +static void z_incomp __P((void *state, mblk_t *dmsg)); +static int z_decompress __P((void *state, mblk_t *cmp, + mblk_t **dmpp)); +static void z_comp_reset __P((void *state)); +static void z_decomp_reset __P((void *state)); +static void z_comp_stats __P((void *state, struct compstat *stats)); + +/* + * Procedures exported to ppp_comp.c. + */ +struct compressor ppp_deflate = { + CI_DEFLATE, /* compress_proto */ + z_comp_alloc, /* comp_alloc */ + z_comp_free, /* comp_free */ + z_comp_init, /* comp_init */ + z_comp_reset, /* comp_reset */ + z_compress, /* compress */ + z_comp_stats, /* comp_stat */ + z_decomp_alloc, /* decomp_alloc */ + z_decomp_free, /* decomp_free */ + z_decomp_init, /* decomp_init */ + z_decomp_reset, /* decomp_reset */ + z_decompress, /* decompress */ + z_incomp, /* incomp */ + z_comp_stats, /* decomp_stat */ +}; + +struct compressor ppp_deflate_draft = { + CI_DEFLATE_DRAFT, /* compress_proto */ + z_comp_alloc, /* comp_alloc */ + z_comp_free, /* comp_free */ + z_comp_init, /* comp_init */ + z_comp_reset, /* comp_reset */ + z_compress, /* compress */ + z_comp_stats, /* comp_stat */ + z_decomp_alloc, /* decomp_alloc */ + z_decomp_free, /* decomp_free */ + z_decomp_init, /* decomp_init */ + z_decomp_reset, /* decomp_reset */ + z_decompress, /* decompress */ + z_incomp, /* incomp */ + z_comp_stats, /* decomp_stat */ +}; + +#define DECOMP_CHUNK 512 + +/* + * Space allocation and freeing routines for use by zlib routines. + */ +struct zchunk { + u_int size; + u_int guard; +}; + +#define GUARD_MAGIC 0x77a6011a + +static void * +z_alloc_init(notused, items, size) + void *notused; + u_int items, size; +{ + struct zchunk *z; + + size = items * size + sizeof(struct zchunk); +#ifdef __osf__ + z = (struct zchunk *) ALLOC_SLEEP(size); +#else + z = (struct zchunk *) ALLOC_NOSLEEP(size); +#endif + z->size = size; + z->guard = GUARD_MAGIC; + return (void *) (z + 1); +} + +static void * +z_alloc(notused, items, size) + void *notused; + u_int items, size; +{ + struct zchunk *z; + + size = items * size + sizeof(struct zchunk); + z = (struct zchunk *) ALLOC_NOSLEEP(size); + z->size = size; + z->guard = GUARD_MAGIC; + return (void *) (z + 1); +} + +static void +z_free(notused, ptr) + void *notused; + void *ptr; +{ + struct zchunk *z = ((struct zchunk *) ptr) - 1; + + if (z->guard != GUARD_MAGIC) { + printf("ppp: z_free of corrupted chunk at %x (%x, %x)\n", + z, z->size, z->guard); + return; + } + FREE(z, z->size); +} + +/* + * Allocate space for a compressor. + */ +static void * +z_comp_alloc(options, opt_len) + u_char *options; + int opt_len; +{ + struct deflate_state *state; + int w_size; + + if (opt_len != CILEN_DEFLATE + || (options[0] != CI_DEFLATE && options[0] != CI_DEFLATE_DRAFT) + || options[1] != CILEN_DEFLATE + || DEFLATE_METHOD(options[2]) != DEFLATE_METHOD_VAL + || options[3] != DEFLATE_CHK_SEQUENCE) + return NULL; + w_size = DEFLATE_SIZE(options[2]); + /* + * N.B. the 9 below should be DEFLATE_MIN_SIZE (8), but using + * 8 will cause kernel crashes because of a bug in zlib. + */ + if (w_size < 9 || w_size > DEFLATE_MAX_SIZE) + return NULL; + + +#ifdef __osf__ + state = (struct deflate_state *) ALLOC_SLEEP(sizeof(*state)); +#else + state = (struct deflate_state *) ALLOC_NOSLEEP(sizeof(*state)); +#endif + + if (state == NULL) + return NULL; + + state->strm.next_in = NULL; + state->strm.zalloc = (alloc_func) z_alloc_init; + state->strm.zfree = (free_func) z_free; + if (deflateInit2(&state->strm, Z_DEFAULT_COMPRESSION, DEFLATE_METHOD_VAL, + -w_size, 8, Z_DEFAULT_STRATEGY) != Z_OK) { + FREE(state, sizeof(*state)); + return NULL; + } + + state->strm.zalloc = (alloc_func) z_alloc; + state->w_size = w_size; + bzero(&state->stats, sizeof(state->stats)); + return (void *) state; +} + +static void +z_comp_free(arg) + void *arg; +{ + struct deflate_state *state = (struct deflate_state *) arg; + + deflateEnd(&state->strm); + FREE(state, sizeof(*state)); +} + +static int +z_comp_init(arg, options, opt_len, unit, hdrlen, debug) + void *arg; + u_char *options; + int opt_len, unit, hdrlen, debug; +{ + struct deflate_state *state = (struct deflate_state *) arg; + + if (opt_len < CILEN_DEFLATE + || (options[0] != CI_DEFLATE && options[0] != CI_DEFLATE_DRAFT) + || options[1] != CILEN_DEFLATE + || DEFLATE_METHOD(options[2]) != DEFLATE_METHOD_VAL + || DEFLATE_SIZE(options[2]) != state->w_size + || options[3] != DEFLATE_CHK_SEQUENCE) + return 0; + + state->seqno = 0; + state->unit = unit; + state->hdrlen = hdrlen; + state->debug = debug; + + deflateReset(&state->strm); + + return 1; +} + +static void +z_comp_reset(arg) + void *arg; +{ + struct deflate_state *state = (struct deflate_state *) arg; + + state->seqno = 0; + deflateReset(&state->strm); +} + +static int +z_compress(arg, mret, mp, orig_len, maxolen) + void *arg; + mblk_t **mret; /* compressed packet (out) */ + mblk_t *mp; /* uncompressed packet (in) */ + int orig_len, maxolen; +{ + struct deflate_state *state = (struct deflate_state *) arg; + u_char *rptr, *wptr; + int proto, olen, wspace, r, flush; + mblk_t *m; + + /* + * Check that the protocol is in the range we handle. + */ + *mret = NULL; + rptr = mp->b_rptr; + if (rptr + PPP_HDRLEN > mp->b_wptr) { + if (!pullupmsg(mp, PPP_HDRLEN)) + return 0; + rptr = mp->b_rptr; + } + proto = PPP_PROTOCOL(rptr); + if (proto > 0x3fff || proto == 0xfd || proto == 0xfb) + return orig_len; + + /* Allocate one mblk initially. */ + if (maxolen > orig_len) + maxolen = orig_len; + if (maxolen <= PPP_HDRLEN + 2) { + wspace = 0; + m = NULL; + } else { + wspace = maxolen + state->hdrlen; + if (wspace > 4096) + wspace = 4096; + m = allocb(wspace, BPRI_MED); + } + if (m != NULL) { + *mret = m; + if (state->hdrlen + PPP_HDRLEN + 2 < wspace) { + m->b_rptr += state->hdrlen; + m->b_wptr = m->b_rptr; + wspace -= state->hdrlen; + } + wptr = m->b_wptr; + + /* + * Copy over the PPP header and store the 2-byte sequence number. + */ + wptr[0] = PPP_ADDRESS(rptr); + wptr[1] = PPP_CONTROL(rptr); + wptr[2] = PPP_COMP >> 8; + wptr[3] = PPP_COMP; + wptr += PPP_HDRLEN; + wptr[0] = state->seqno >> 8; + wptr[1] = state->seqno; + wptr += 2; + state->strm.next_out = wptr; + state->strm.avail_out = wspace - (PPP_HDRLEN + 2); + } else { + state->strm.next_out = NULL; + state->strm.avail_out = 1000000; + } + ++state->seqno; + + rptr += (proto > 0xff)? 2: 3; /* skip 1st proto byte if 0 */ + state->strm.next_in = rptr; + state->strm.avail_in = mp->b_wptr - rptr; + mp = mp->b_cont; + flush = (mp == NULL)? Z_PACKET_FLUSH: Z_NO_FLUSH; + olen = 0; + for (;;) { + r = deflate(&state->strm, flush); + if (r != Z_OK) { + printf("z_compress: deflate returned %d (%s)\n", + r, (state->strm.msg? state->strm.msg: "")); + break; + } + if (flush != Z_NO_FLUSH && state->strm.avail_out != 0) + break; /* all done */ + if (state->strm.avail_in == 0 && mp != NULL) { + state->strm.next_in = mp->b_rptr; + state->strm.avail_in = mp->b_wptr - mp->b_rptr; + mp = mp->b_cont; + if (mp == NULL) + flush = Z_PACKET_FLUSH; + } + if (state->strm.avail_out == 0) { + if (m != NULL) { + m->b_wptr += wspace; + olen += wspace; + wspace = maxolen - olen; + if (wspace <= 0) { + wspace = 0; + m->b_cont = NULL; + } else { + if (wspace < 32) + wspace = 32; + else if (wspace > 4096) + wspace = 4096; + m->b_cont = allocb(wspace, BPRI_MED); + } + m = m->b_cont; + if (m != NULL) { + state->strm.next_out = m->b_wptr; + state->strm.avail_out = wspace; + } + } + if (m == NULL) { + state->strm.next_out = NULL; + state->strm.avail_out = 1000000; + } + } + } + if (m != NULL) { + m->b_wptr += wspace - state->strm.avail_out; + olen += wspace - state->strm.avail_out; + } + + /* + * See if we managed to reduce the size of the packet. + */ + if (olen < orig_len && m != NULL) { + state->stats.comp_bytes += olen; + state->stats.comp_packets++; + } else { + if (*mret != NULL) { + freemsg(*mret); + *mret = NULL; + } + state->stats.inc_bytes += orig_len; + state->stats.inc_packets++; + olen = orig_len; + } + state->stats.unc_bytes += orig_len; + state->stats.unc_packets++; + + return olen; +} + +static void +z_comp_stats(arg, stats) + void *arg; + struct compstat *stats; +{ + struct deflate_state *state = (struct deflate_state *) arg; + u_int out; + + *stats = state->stats; + stats->ratio = stats->unc_bytes; + out = stats->comp_bytes + stats->unc_bytes; + if (stats->ratio <= 0x7ffffff) + stats->ratio <<= 8; + else + out >>= 8; + if (out != 0) + stats->ratio /= out; +} + +/* + * Allocate space for a decompressor. + */ +static void * +z_decomp_alloc(options, opt_len) + u_char *options; + int opt_len; +{ + struct deflate_state *state; + int w_size; + + if (opt_len != CILEN_DEFLATE + || (options[0] != CI_DEFLATE && options[0] != CI_DEFLATE_DRAFT) + || options[1] != CILEN_DEFLATE + || DEFLATE_METHOD(options[2]) != DEFLATE_METHOD_VAL + || options[3] != DEFLATE_CHK_SEQUENCE) + return NULL; + w_size = DEFLATE_SIZE(options[2]); + /* + * N.B. the 9 below should be DEFLATE_MIN_SIZE (8), but using + * 8 will cause kernel crashes because of a bug in zlib. + */ + if (w_size < 9 || w_size > DEFLATE_MAX_SIZE) + return NULL; + +#ifdef __osf__ + state = (struct deflate_state *) ALLOC_SLEEP(sizeof(*state)); +#else + state = (struct deflate_state *) ALLOC_NOSLEEP(sizeof(*state)); +#endif + if (state == NULL) + return NULL; + + state->strm.next_out = NULL; + state->strm.zalloc = (alloc_func) z_alloc_init; + state->strm.zfree = (free_func) z_free; + if (inflateInit2(&state->strm, -w_size) != Z_OK) { + FREE(state, sizeof(*state)); + return NULL; + } + + state->strm.zalloc = (alloc_func) z_alloc; + state->w_size = w_size; + bzero(&state->stats, sizeof(state->stats)); + return (void *) state; +} + +static void +z_decomp_free(arg) + void *arg; +{ + struct deflate_state *state = (struct deflate_state *) arg; + + inflateEnd(&state->strm); + FREE(state, sizeof(*state)); +} + +static int +z_decomp_init(arg, options, opt_len, unit, hdrlen, mru, debug) + void *arg; + u_char *options; + int opt_len, unit, hdrlen, mru, debug; +{ + struct deflate_state *state = (struct deflate_state *) arg; + + if (opt_len < CILEN_DEFLATE + || (options[0] != CI_DEFLATE && options[0] != CI_DEFLATE_DRAFT) + || options[1] != CILEN_DEFLATE + || DEFLATE_METHOD(options[2]) != DEFLATE_METHOD_VAL + || DEFLATE_SIZE(options[2]) != state->w_size + || options[3] != DEFLATE_CHK_SEQUENCE) + return 0; + + state->seqno = 0; + state->unit = unit; + state->hdrlen = hdrlen; + state->debug = debug; + state->mru = mru; + + inflateReset(&state->strm); + + return 1; +} + +static void +z_decomp_reset(arg) + void *arg; +{ + struct deflate_state *state = (struct deflate_state *) arg; + + state->seqno = 0; + inflateReset(&state->strm); +} + +/* + * Decompress a Deflate-compressed packet. + * + * Because of patent problems, we return DECOMP_ERROR for errors + * found by inspecting the input data and for system problems, but + * DECOMP_FATALERROR for any errors which could possibly be said to + * be being detected "after" decompression. For DECOMP_ERROR, + * we can issue a CCP reset-request; for DECOMP_FATALERROR, we may be + * infringing a patent of Motorola's if we do, so we take CCP down + * instead. + * + * Given that the frame has the correct sequence number and a good FCS, + * errors such as invalid codes in the input most likely indicate a + * bug, so we return DECOMP_FATALERROR for them in order to turn off + * compression, even though they are detected by inspecting the input. + */ +static int +z_decompress(arg, mi, mop) + void *arg; + mblk_t *mi, **mop; +{ + struct deflate_state *state = (struct deflate_state *) arg; + mblk_t *mo, *mo_head; + u_char *rptr, *wptr; + int rlen, olen, ospace; + int seq, i, flush, r, decode_proto; + u_char hdr[PPP_HDRLEN + DEFLATE_OVHD]; + + *mop = NULL; + rptr = mi->b_rptr; + for (i = 0; i < PPP_HDRLEN + DEFLATE_OVHD; ++i) { + while (rptr >= mi->b_wptr) { + mi = mi->b_cont; + if (mi == NULL) + return DECOMP_ERROR; + rptr = mi->b_rptr; + } + hdr[i] = *rptr++; + } + + /* Check the sequence number. */ + seq = (hdr[PPP_HDRLEN] << 8) + hdr[PPP_HDRLEN+1]; + if (seq != state->seqno) { +#if !DEFLATE_DEBUG + if (state->debug) +#endif + printf("z_decompress%d: bad seq # %d, expected %d\n", + state->unit, seq, state->seqno); + return DECOMP_ERROR; + } + ++state->seqno; + + /* Allocate an output message block. */ + mo = allocb(DECOMP_CHUNK + state->hdrlen, BPRI_MED); + if (mo == NULL) + return DECOMP_ERROR; + mo_head = mo; + mo->b_cont = NULL; + mo->b_rptr += state->hdrlen; + mo->b_wptr = wptr = mo->b_rptr; + ospace = DECOMP_CHUNK; + olen = 0; + + /* + * Fill in the first part of the PPP header. The protocol field + * comes from the decompressed data. + */ + wptr[0] = PPP_ADDRESS(hdr); + wptr[1] = PPP_CONTROL(hdr); + wptr[2] = 0; + + /* + * Set up to call inflate. We set avail_out to 1 initially so we can + * look at the first byte of the output and decide whether we have + * a 1-byte or 2-byte protocol field. + */ + state->strm.next_in = rptr; + state->strm.avail_in = mi->b_wptr - rptr; + mi = mi->b_cont; + flush = (mi == NULL)? Z_PACKET_FLUSH: Z_NO_FLUSH; + rlen = state->strm.avail_in + PPP_HDRLEN + DEFLATE_OVHD; + state->strm.next_out = wptr + 3; + state->strm.avail_out = 1; + decode_proto = 1; + + /* + * Call inflate, supplying more input or output as needed. + */ + for (;;) { + r = inflate(&state->strm, flush); + if (r != Z_OK) { +#if !DEFLATE_DEBUG + if (state->debug) +#endif + printf("z_decompress%d: inflate returned %d (%s)\n", + state->unit, r, (state->strm.msg? state->strm.msg: "")); + freemsg(mo_head); + return DECOMP_FATALERROR; + } + if (flush != Z_NO_FLUSH && state->strm.avail_out != 0) + break; /* all done */ + if (state->strm.avail_in == 0 && mi != NULL) { + state->strm.next_in = mi->b_rptr; + state->strm.avail_in = mi->b_wptr - mi->b_rptr; + rlen += state->strm.avail_in; + mi = mi->b_cont; + if (mi == NULL) + flush = Z_PACKET_FLUSH; + } + if (state->strm.avail_out == 0) { + if (decode_proto) { + state->strm.avail_out = ospace - PPP_HDRLEN; + if ((wptr[3] & 1) == 0) { + /* 2-byte protocol field */ + wptr[2] = wptr[3]; + --state->strm.next_out; + ++state->strm.avail_out; + } + decode_proto = 0; + } else { + mo->b_wptr += ospace; + olen += ospace; + mo->b_cont = allocb(DECOMP_CHUNK, BPRI_MED); + mo = mo->b_cont; + if (mo == NULL) { + freemsg(mo_head); + return DECOMP_ERROR; + } + state->strm.next_out = mo->b_rptr; + state->strm.avail_out = ospace = DECOMP_CHUNK; + } + } + } + if (decode_proto) { + freemsg(mo_head); + return DECOMP_ERROR; + } + mo->b_wptr += ospace - state->strm.avail_out; + olen += ospace - state->strm.avail_out; + +#if DEFLATE_DEBUG + if (olen > state->mru + PPP_HDRLEN) + printf("ppp_deflate%d: exceeded mru (%d > %d)\n", + state->unit, olen, state->mru + PPP_HDRLEN); +#endif + + state->stats.unc_bytes += olen; + state->stats.unc_packets++; + state->stats.comp_bytes += rlen; + state->stats.comp_packets++; + + *mop = mo_head; + return DECOMP_OK; +} + +/* + * Incompressible data has arrived - add it to the history. + */ +static void +z_incomp(arg, mi) + void *arg; + mblk_t *mi; +{ + struct deflate_state *state = (struct deflate_state *) arg; + u_char *rptr; + int rlen, proto, r; + + /* + * Check that the protocol is one we handle. + */ + rptr = mi->b_rptr; + if (rptr + PPP_HDRLEN > mi->b_wptr) { + if (!pullupmsg(mi, PPP_HDRLEN)) + return; + rptr = mi->b_rptr; + } + proto = PPP_PROTOCOL(rptr); + if (proto > 0x3fff || proto == 0xfd || proto == 0xfb) + return; + + ++state->seqno; + + /* + * Iterate through the message blocks, adding the characters in them + * to the decompressor's history. For the first block, we start + * at the either the 1st or 2nd byte of the protocol field, + * depending on whether the protocol value is compressible. + */ + rlen = mi->b_wptr - mi->b_rptr; + state->strm.next_in = rptr + 3; + state->strm.avail_in = rlen - 3; + if (proto > 0xff) { + --state->strm.next_in; + ++state->strm.avail_in; + } + for (;;) { + r = inflateIncomp(&state->strm); + if (r != Z_OK) { + /* gak! */ +#if !DEFLATE_DEBUG + if (state->debug) +#endif + printf("z_incomp%d: inflateIncomp returned %d (%s)\n", + state->unit, r, (state->strm.msg? state->strm.msg: "")); + return; + } + mi = mi->b_cont; + if (mi == NULL) + break; + state->strm.next_in = mi->b_rptr; + state->strm.avail_in = mi->b_wptr - mi->b_rptr; + rlen += state->strm.avail_in; + } + + /* + * Update stats. + */ + state->stats.inc_bytes += rlen; + state->stats.inc_packets++; + state->stats.unc_bytes += rlen; + state->stats.unc_packets++; +} + +#endif /* DO_DEFLATE */ diff --git a/mdk-stage1/ppp/modules/if_ppp.c b/mdk-stage1/ppp/modules/if_ppp.c new file mode 100644 index 000000000..9792708d1 --- /dev/null +++ b/mdk-stage1/ppp/modules/if_ppp.c @@ -0,0 +1,865 @@ +/* + * if_ppp.c - a network interface connected to a STREAMS module. + * + * Copyright (c) 1994 The Australian National University. + * All rights reserved. + * + * Permission to use, copy, modify, and distribute this software and its + * documentation is hereby granted, provided that the above copyright + * notice appears in all copies. This software is provided without any + * warranty, express or implied. The Australian National University + * makes no representations about the suitability of this software for + * any purpose. + * + * IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY + * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES + * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF + * THE AUSTRALIAN NATIONAL UNIVERSITY HAVE BEEN ADVISED OF THE POSSIBILITY + * OF SUCH DAMAGE. + * + * THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY + * AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS + * ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO + * OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, + * OR MODIFICATIONS. + * + * $Id: if_ppp.c 195720 2001-06-11 11:44:34Z gc $ + */ + +/* + * This file is used under SunOS 4 and Digital UNIX. + * + * This file provides the glue between PPP and IP. + */ + +#define INET 1 + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#ifdef __osf__ +#include +#include +#else +#include +#endif +#include "ppp_mod.h" + +#include + +#ifdef SNIT_SUPPORT +#include +#include +#include +#endif + +#ifdef __osf__ +#define SIOCSIFMTU SIOCSIPMTU +#define SIOCGIFMTU SIOCRIPMTU +#define IFA_ADDR(ifa) (*(ifa)->ifa_addr) +#else +#define IFA_ADDR(ifa) ((ifa)->ifa_addr) +#endif + +#define ifr_mtu ifr_metric + +static int if_ppp_open __P((queue_t *, int, int, int)); +static int if_ppp_close __P((queue_t *, int)); +static int if_ppp_wput __P((queue_t *, mblk_t *)); +static int if_ppp_rput __P((queue_t *, mblk_t *)); + +#define PPP_IF_ID 0x8021 +static struct module_info minfo = { + PPP_IF_ID, "if_ppp", 0, INFPSZ, 4096, 128 +}; + +static struct qinit rinit = { + if_ppp_rput, NULL, if_ppp_open, if_ppp_close, NULL, &minfo, NULL +}; + +static struct qinit winit = { + if_ppp_wput, NULL, NULL, NULL, NULL, &minfo, NULL +}; + +struct streamtab if_pppinfo = { + &rinit, &winit, NULL, NULL +}; + +typedef struct if_ppp_state { + int unit; + queue_t *q; + int flags; +} if_ppp_t; + +/* Values for flags */ +#define DBGLOG 1 + +static int if_ppp_count; /* Number of currently-active streams */ + +static int ppp_nalloc; /* Number of elements of ifs and states */ +static struct ifnet **ifs; /* Array of pointers to interface structs */ +static if_ppp_t **states; /* Array of pointers to state structs */ + +static int if_ppp_output __P((struct ifnet *, struct mbuf *, + struct sockaddr *)); +static int if_ppp_ioctl __P((struct ifnet *, u_int, caddr_t)); +static struct mbuf *make_mbufs __P((mblk_t *, int)); +static mblk_t *make_message __P((struct mbuf *, int)); + +#ifdef SNIT_SUPPORT +/* Fake ether header for SNIT */ +static struct ether_header snit_ehdr = {{0}, {0}, ETHERTYPE_IP}; +#endif + +#ifndef __osf__ +static void ppp_if_detach __P((struct ifnet *)); + +/* + * Detach all the interfaces before unloading. + * Not sure this works. + */ +int +if_ppp_unload() +{ + int i; + + if (if_ppp_count > 0) + return EBUSY; + for (i = 0; i < ppp_nalloc; ++i) + if (ifs[i] != 0) + ppp_if_detach(ifs[i]); + if (ifs) { + FREE(ifs, ppp_nalloc * sizeof (struct ifnet *)); + FREE(states, ppp_nalloc * sizeof (struct if_ppp_t *)); + } + ppp_nalloc = 0; + return 0; +} +#endif /* __osf__ */ + +/* + * STREAMS module entry points. + */ +static int +if_ppp_open(q, dev, flag, sflag) + queue_t *q; + int dev; + int flag, sflag; +{ + if_ppp_t *sp; + + if (q->q_ptr == 0) { + sp = (if_ppp_t *) ALLOC_SLEEP(sizeof (if_ppp_t)); + if (sp == 0) + return OPENFAIL; + bzero(sp, sizeof (if_ppp_t)); + q->q_ptr = (caddr_t) sp; + WR(q)->q_ptr = (caddr_t) sp; + sp->unit = -1; /* no interface unit attached at present */ + sp->q = WR(q); + sp->flags = 0; + ++if_ppp_count; + } + return 0; +} + +static int +if_ppp_close(q, flag) + queue_t *q; + int flag; +{ + if_ppp_t *sp; + struct ifnet *ifp; + + sp = (if_ppp_t *) q->q_ptr; + if (sp != 0) { + if (sp->flags & DBGLOG) + printf("if_ppp closed, q=%x sp=%x\n", q, sp); + if (sp->unit >= 0) { + if (sp->unit < ppp_nalloc) { + states[sp->unit] = 0; + ifp = ifs[sp->unit]; + if (ifp != 0) + ifp->if_flags &= ~(IFF_UP | IFF_RUNNING); +#ifdef DEBUG + } else { + printf("if_ppp: unit %d nonexistent!\n", sp->unit); +#endif + } + } + FREE(sp, sizeof (if_ppp_t)); + --if_ppp_count; + } + return 0; +} + +static int +if_ppp_wput(q, mp) + queue_t *q; + mblk_t *mp; +{ + if_ppp_t *sp; + struct iocblk *iop; + int error, unit; + struct ifnet *ifp; + + sp = (if_ppp_t *) q->q_ptr; + switch (mp->b_datap->db_type) { + case M_DATA: + /* + * Now why would we be getting data coming in here?? + */ + if (sp->flags & DBGLOG) + printf("if_ppp: got M_DATA len=%d\n", msgdsize(mp)); + freemsg(mp); + break; + + case M_IOCTL: + iop = (struct iocblk *) mp->b_rptr; + error = EINVAL; + + if (sp->flags & DBGLOG) + printf("if_ppp: got ioctl cmd=%x count=%d\n", + iop->ioc_cmd, iop->ioc_count); + + switch (iop->ioc_cmd) { + case PPPIO_NEWPPA: /* well almost */ + if (iop->ioc_count != sizeof(int) || sp->unit >= 0) + break; + if ((error = NOTSUSER()) != 0) + break; + unit = *(int *)mp->b_cont->b_rptr; + + /* Check that this unit isn't already in use */ + if (unit < ppp_nalloc && states[unit] != 0) { + error = EADDRINUSE; + break; + } + + /* Extend ifs and states arrays if necessary. */ + error = ENOSR; + if (unit >= ppp_nalloc) { + int newn; + struct ifnet **newifs; + if_ppp_t **newstates; + + newn = unit + 4; + if (sp->flags & DBGLOG) + printf("if_ppp: extending ifs to %d\n", newn); + newifs = (struct ifnet **) + ALLOC_NOSLEEP(newn * sizeof (struct ifnet *)); + if (newifs == 0) + break; + bzero(newifs, newn * sizeof (struct ifnet *)); + newstates = (if_ppp_t **) + ALLOC_NOSLEEP(newn * sizeof (struct if_ppp_t *)); + if (newstates == 0) { + FREE(newifs, newn * sizeof (struct ifnet *)); + break; + } + bzero(newstates, newn * sizeof (struct if_ppp_t *)); + bcopy(ifs, newifs, ppp_nalloc * sizeof(struct ifnet *)); + bcopy(states, newstates, ppp_nalloc * sizeof(if_ppp_t *)); + if (ifs) { + FREE(ifs, ppp_nalloc * sizeof(struct ifnet *)); + FREE(states, ppp_nalloc * sizeof(if_ppp_t *)); + } + ifs = newifs; + states = newstates; + ppp_nalloc = newn; + } + + /* Allocate a new ifnet struct if necessary. */ + ifp = ifs[unit]; + if (ifp == 0) { + ifp = (struct ifnet *) ALLOC_NOSLEEP(sizeof (struct ifnet)); + if (ifp == 0) + break; + bzero(ifp, sizeof (struct ifnet)); + ifs[unit] = ifp; + ifp->if_name = "ppp"; + ifp->if_unit = unit; + ifp->if_mtu = PPP_MTU; + ifp->if_flags = IFF_POINTOPOINT | IFF_RUNNING; +#ifndef __osf__ +#ifdef IFF_MULTICAST + ifp->if_flags |= IFF_MULTICAST; +#endif +#endif /* __osf__ */ + ifp->if_output = if_ppp_output; +#ifdef __osf__ + ifp->if_version = "Point-to-Point Protocol, version 2.3.11"; + ifp->if_mediamtu = PPP_MTU; + ifp->if_type = IFT_PPP; + ifp->if_hdrlen = PPP_HDRLEN; + ifp->if_addrlen = 0; + ifp->if_flags |= IFF_NOARP | IFF_SIMPLEX | IFF_NOTRAILERS; +#ifdef IFF_VAR_MTU + ifp->if_flags |= IFF_VAR_MTU; +#endif +#ifdef NETMASTERCPU + ifp->if_affinity = NETMASTERCPU; +#endif +#endif + ifp->if_ioctl = if_ppp_ioctl; + ifp->if_snd.ifq_maxlen = IFQ_MAXLEN; + if_attach(ifp); + if (sp->flags & DBGLOG) + printf("if_ppp: created unit %d\n", unit); + } else { + ifp->if_mtu = PPP_MTU; + ifp->if_flags |= IFF_RUNNING; + } + + states[unit] = sp; + sp->unit = unit; + + error = 0; + iop->ioc_count = 0; + if (sp->flags & DBGLOG) + printf("if_ppp: attached unit %d, sp=%x q=%x\n", unit, + sp, sp->q); + break; + + case PPPIO_DEBUG: + error = -1; + if (iop->ioc_count == sizeof(int)) { + if (*(int *)mp->b_cont->b_rptr == PPPDBG_LOG + PPPDBG_IF) { + printf("if_ppp: debug log enabled, q=%x sp=%x\n", q, sp); + sp->flags |= DBGLOG; + error = 0; + iop->ioc_count = 0; + } + } + break; + + default: + error = -1; + break; + } + + if (sp->flags & DBGLOG) + printf("if_ppp: ioctl result %d\n", error); + if (error < 0) + putnext(q, mp); + else if (error == 0) { + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); + } else { + mp->b_datap->db_type = M_IOCNAK; + iop->ioc_count = 0; + iop->ioc_error = error; + qreply(q, mp); + } + break; + + default: + putnext(q, mp); + } + return 0; +} + +static int +if_ppp_rput(q, mp) + queue_t *q; + mblk_t *mp; +{ + if_ppp_t *sp; + int proto, s; + struct mbuf *mb; + struct ifqueue *inq; + struct ifnet *ifp; + int len; + + sp = (if_ppp_t *) q->q_ptr; + switch (mp->b_datap->db_type) { + case M_DATA: + /* + * Convert the message into an mbuf chain + * and inject it into the network code. + */ + if (sp->flags & DBGLOG) + printf("if_ppp: rput pkt len %d data %x %x %x %x %x %x %x %x\n", + msgdsize(mp), mp->b_rptr[0], mp->b_rptr[1], mp->b_rptr[2], + mp->b_rptr[3], mp->b_rptr[4], mp->b_rptr[5], mp->b_rptr[6], + mp->b_rptr[7]); + + if (sp->unit < 0) { + freemsg(mp); + break; + } + if (sp->unit >= ppp_nalloc || (ifp = ifs[sp->unit]) == 0) { +#ifdef DEBUG + printf("if_ppp: no unit %d!\n", sp->unit); +#endif + freemsg(mp); + break; + } + + if ((ifp->if_flags & IFF_UP) == 0) { + freemsg(mp); + break; + } + ++ifp->if_ipackets; + + proto = PPP_PROTOCOL(mp->b_rptr); + adjmsg(mp, PPP_HDRLEN); + len = msgdsize(mp); + mb = make_mbufs(mp, sizeof(struct ifnet *)); + freemsg(mp); + if (mb == NULL) { + if (sp->flags & DBGLOG) + printf("if_ppp%d: make_mbufs failed\n", ifp->if_unit); + ++ifp->if_ierrors; + break; + } + +#ifdef SNIT_SUPPORT + if (proto == PPP_IP && (ifp->if_flags & IFF_PROMISC)) { + struct nit_if nif; + + nif.nif_header = (caddr_t) &snit_ehdr; + nif.nif_hdrlen = sizeof(snit_ehdr); + nif.nif_bodylen = len; + nif.nif_promisc = 0; + snit_intr(ifp, mb, &nif); + } +#endif + +/* + * For Digital UNIX, there's space set aside in the header mbuf + * for the interface info. + * + * For Sun it's smuggled around via a pointer at the front of the mbuf. + */ +#ifdef __osf__ + mb->m_pkthdr.rcvif = ifp; + mb->m_pkthdr.len = len; +#else + mb->m_off -= sizeof(struct ifnet *); + mb->m_len += sizeof(struct ifnet *); + *mtod(mb, struct ifnet **) = ifp; +#endif + + inq = 0; + switch (proto) { + case PPP_IP: + inq = &ipintrq; + schednetisr(NETISR_IP); + } + + if (inq != 0) { + s = splhigh(); + if (IF_QFULL(inq)) { + IF_DROP(inq); + ++ifp->if_ierrors; + if (sp->flags & DBGLOG) + printf("if_ppp: inq full, proto=%x\n", proto); + m_freem(mb); + } else { + IF_ENQUEUE(inq, mb); + } + splx(s); + } else { + if (sp->flags & DBGLOG) + printf("if_ppp%d: proto=%x?\n", ifp->if_unit, proto); + ++ifp->if_ierrors; + m_freem(mb); + } + break; + + default: + putnext(q, mp); + } + return 0; +} + +/* + * Network code wants to output a packet. + * Turn it into a STREAMS message and send it down. + */ +static int +if_ppp_output(ifp, m0, dst) + struct ifnet *ifp; + struct mbuf *m0; + struct sockaddr *dst; +{ + mblk_t *mp; + int proto, s; + if_ppp_t *sp; + u_char *p; + + if ((ifp->if_flags & IFF_UP) == 0) { + m_freem(m0); + return ENETDOWN; + } + + if ((unsigned)ifp->if_unit >= ppp_nalloc) { +#ifdef DEBUG + printf("if_ppp_output: unit %d?\n", ifp->if_unit); +#endif + m_freem(m0); + return EINVAL; + } + sp = states[ifp->if_unit]; + if (sp == 0) { +#ifdef DEBUG + printf("if_ppp_output: no queue?\n"); +#endif + m_freem(m0); + return ENETDOWN; + } + + if (sp->flags & DBGLOG) { + p = mtod(m0, u_char *); + printf("if_ppp_output%d: af=%d data=%x %x %x %x %x %x %x %x q=%x\n", + ifp->if_unit, dst->sa_family, p[0], p[1], p[2], p[3], p[4], + p[5], p[6], p[7], sp->q); + } + + switch (dst->sa_family) { + case AF_INET: + proto = PPP_IP; +#ifdef SNIT_SUPPORT + if (ifp->if_flags & IFF_PROMISC) { + struct nit_if nif; + struct mbuf *m; + int len; + + for (len = 0, m = m0; m != NULL; m = m->m_next) + len += m->m_len; + nif.nif_header = (caddr_t) &snit_ehdr; + nif.nif_hdrlen = sizeof(snit_ehdr); + nif.nif_bodylen = len; + nif.nif_promisc = 0; + snit_intr(ifp, m0, &nif); + } +#endif + break; + + default: + m_freem(m0); + return EAFNOSUPPORT; + } + + ++ifp->if_opackets; + mp = make_message(m0, PPP_HDRLEN); + m_freem(m0); + if (mp == 0) { + ++ifp->if_oerrors; + return ENOBUFS; + } + mp->b_rptr -= PPP_HDRLEN; + mp->b_rptr[0] = PPP_ALLSTATIONS; + mp->b_rptr[1] = PPP_UI; + mp->b_rptr[2] = proto >> 8; + mp->b_rptr[3] = proto; + + s = splstr(); + if (sp->flags & DBGLOG) + printf("if_ppp: putnext(%x, %x), r=%x w=%x p=%x\n", + sp->q, mp, mp->b_rptr, mp->b_wptr, proto); + putnext(sp->q, mp); + splx(s); + + return 0; +} + +/* + * Socket ioctl routine for ppp interfaces. + */ +static int +if_ppp_ioctl(ifp, cmd, data) + struct ifnet *ifp; + u_int cmd; + caddr_t data; +{ + int s, error; + struct ifreq *ifr = (struct ifreq *) data; + struct ifaddr *ifa = (struct ifaddr *) data; + u_short mtu; + + error = 0; + s = splimp(); + switch (cmd) { + case SIOCSIFFLAGS: + if ((ifp->if_flags & IFF_RUNNING) == 0) + ifp->if_flags &= ~IFF_UP; + break; + + case SIOCSIFADDR: + if (IFA_ADDR(ifa).sa_family != AF_INET) + error = EAFNOSUPPORT; + break; + + case SIOCSIFDSTADDR: + if (IFA_ADDR(ifa).sa_family != AF_INET) + error = EAFNOSUPPORT; + break; + + case SIOCSIFMTU: + if ((error = NOTSUSER()) != 0) + break; +#ifdef __osf__ + /* this hack is necessary because ifioctl checks ifr_data + * in 4.0 and 5.0, but ifr_data and ifr_metric overlay each + * other in the definition of struct ifreq so pppd can't set both. + */ + bcopy(ifr->ifr_data, &mtu, sizeof (u_short)); + ifr->ifr_mtu = mtu; +#endif + + if (ifr->ifr_mtu < PPP_MINMTU || ifr->ifr_mtu > PPP_MAXMTU) { + error = EINVAL; + break; + } + ifp->if_mtu = ifr->ifr_mtu; + break; + + case SIOCGIFMTU: + ifr->ifr_mtu = ifp->if_mtu; + break; + + case SIOCADDMULTI: + case SIOCDELMULTI: + switch(ifr->ifr_addr.sa_family) { + case AF_INET: + break; + default: + error = EAFNOSUPPORT; + break; + } + break; + + default: + error = EINVAL; + } + splx(s); + return (error); +} + +/* + * Turn a STREAMS message into an mbuf chain. + */ +static struct mbuf * +make_mbufs(mp, off) + mblk_t *mp; + int off; +{ + struct mbuf *head, **prevp, *m; + int len, space, n; + unsigned char *cp, *dp; + + len = msgdsize(mp); + if (len == 0) + return 0; + prevp = &head; + space = 0; + cp = mp->b_rptr; +#ifdef __osf__ + MGETHDR(m, M_DONTWAIT, MT_DATA); + m->m_len = 0; + space = MHLEN; + *prevp = m; + prevp = &m->m_next; + dp = mtod(m, unsigned char *); + len -= space; + off = 0; +#endif + for (;;) { + while (cp >= mp->b_wptr) { + mp = mp->b_cont; + if (mp == 0) { + *prevp = 0; + return head; + } + cp = mp->b_rptr; + } + n = mp->b_wptr - cp; + if (space == 0) { + MGET(m, M_DONTWAIT, MT_DATA); + *prevp = m; + if (m == 0) { + if (head != 0) + m_freem(head); + return 0; + } + if (len + off > 2 * MLEN) { +#ifdef __osf__ + MCLGET(m, M_DONTWAIT); +#else + MCLGET(m); +#endif + } +#ifdef __osf__ + space = ((m->m_flags & M_EXT) ? MCLBYTES : MLEN); +#else + space = (m->m_off > MMAXOFF? MCLBYTES: MLEN) - off; + m->m_off += off; +#endif + m->m_len = 0; + len -= space; + dp = mtod(m, unsigned char *); + off = 0; + prevp = &m->m_next; + } + if (n > space) + n = space; + bcopy(cp, dp, n); + cp += n; + dp += n; + space -= n; + m->m_len += n; + } +} + +/* + * Turn an mbuf chain into a STREAMS message. + */ +#define ALLOCB_MAX 4096 + +static mblk_t * +make_message(m, off) + struct mbuf *m; + int off; +{ + mblk_t *head, **prevp, *mp; + int len, space, n, nb; + unsigned char *cp, *dp; + struct mbuf *nm; + + len = 0; + for (nm = m; nm != 0; nm = nm->m_next) + len += nm->m_len; + prevp = &head; + space = 0; + cp = mtod(m, unsigned char *); + nb = m->m_len; + for (;;) { + while (nb <= 0) { + m = m->m_next; + if (m == 0) { + *prevp = 0; + return head; + } + cp = mtod(m, unsigned char *); + nb = m->m_len; + } + if (space == 0) { + space = len + off; + if (space > ALLOCB_MAX) + space = ALLOCB_MAX; + mp = allocb(space, BPRI_LO); + *prevp = mp; + if (mp == 0) { + if (head != 0) + freemsg(head); + return 0; + } + dp = mp->b_rptr += off; + space -= off; + len -= space; + off = 0; + prevp = &mp->b_cont; + } + n = nb < space? nb: space; + bcopy(cp, dp, n); + cp += n; + dp += n; + nb -= n; + space -= n; + mp->b_wptr = dp; + } +} + +/* + * Digital UNIX doesn't allow for removing ifnet structures + * from the list. But then we're not using this as a loadable + * module anyway, so that's OK. + * + * Under SunOS, this should allow the module to be unloaded. + * Unfortunately, it doesn't seem to detach all the references, + * so your system may well crash after you unload this module :-( + */ +#ifndef __osf__ + +/* + * Remove an interface from the system. + * This routine contains magic. + */ +#include +#include +#include +#include +#include +#include +#include +#include + +static void +ppp_if_detach(ifp) + struct ifnet *ifp; +{ + int s; + struct inpcb *pcb; + struct ifaddr *ifa; + struct in_ifaddr **inap; + struct ifnet **ifpp; + + s = splhigh(); + + /* + * Clear the interface from any routes currently cached in + * TCP or UDP protocol control blocks. + */ + for (pcb = tcb.inp_next; pcb != &tcb; pcb = pcb->inp_next) + if (pcb->inp_route.ro_rt && pcb->inp_route.ro_rt->rt_ifp == ifp) + in_losing(pcb); + for (pcb = udb.inp_next; pcb != &udb; pcb = pcb->inp_next) + if (pcb->inp_route.ro_rt && pcb->inp_route.ro_rt->rt_ifp == ifp) + in_losing(pcb); + + /* + * Delete routes through all addresses of the interface. + */ + for (ifa = ifp->if_addrlist; ifa != 0; ifa = ifa->ifa_next) { + rtinit(ifa, ifa, SIOCDELRT, RTF_HOST); + rtinit(ifa, ifa, SIOCDELRT, 0); + } + + /* + * Unlink the interface's address(es) from the in_ifaddr list. + */ + for (inap = &in_ifaddr; *inap != 0; ) { + if ((*inap)->ia_ifa.ifa_ifp == ifp) + *inap = (*inap)->ia_next; + else + inap = &(*inap)->ia_next; + } + + /* + * Delete the interface from the ifnet list. + */ + for (ifpp = &ifnet; (*ifpp) != 0; ) { + if (*ifpp == ifp) + break; + ifpp = &(*ifpp)->if_next; + } + if (*ifpp == 0) + printf("couldn't find interface ppp%d in ifnet list\n", ifp->if_unit); + else + *ifpp = ifp->if_next; + + splx(s); +} + +#endif /* __osf__ */ diff --git a/mdk-stage1/ppp/modules/ppp.c b/mdk-stage1/ppp/modules/ppp.c new file mode 100644 index 000000000..f6d8c93df --- /dev/null +++ b/mdk-stage1/ppp/modules/ppp.c @@ -0,0 +1,2486 @@ +/* + * ppp.c - STREAMS multiplexing pseudo-device driver for PPP. + * + * Copyright (c) 1994 The Australian National University. + * All rights reserved. + * + * Permission to use, copy, modify, and distribute this software and its + * documentation is hereby granted, provided that the above copyright + * notice appears in all copies. This software is provided without any + * warranty, express or implied. The Australian National University + * makes no representations about the suitability of this software for + * any purpose. + * + * IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY + * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES + * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF + * THE AUSTRALIAN NATIONAL UNIVERSITY HAS BEEN ADVISED OF THE POSSIBILITY + * OF SUCH DAMAGE. + * + * THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY + * AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS + * ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO + * OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, + * OR MODIFICATIONS. + * + * $Id: ppp.c 195720 2001-06-11 11:44:34Z gc $ + */ + +/* + * This file is used under Solaris 2, SVR4, SunOS 4, and Digital UNIX. + */ + +#include +#include +#include +#include +#include +#include +#ifdef __osf__ +#include +#include +#define queclass(mp) ((mp)->b_band & QPCTL) +#else +#include +#endif +#include +#ifdef SVR4 +#include +#include +#include +#include +#ifdef SOL2 +#include +#include +#include +#include +#else +#include +#include +#include +#include +#endif /* SOL2 */ +#else /* not SVR4 */ +#include +#endif /* SVR4 */ +#include +#include +#include "ppp_mod.h" + +/* + * Modifications marked with #ifdef PRIOQ are for priority queueing of + * interactive traffic, and are due to Marko Zec . + */ +#ifdef PRIOQ +#endif /* PRIOQ */ + +#include /* leave this outside of PRIOQ for htons */ + +#ifdef __STDC__ +#define __P(x) x +#else +#define __P(x) () +#endif + +/* + * The IP module may use this SAP value for IP packets. + */ +#ifndef ETHERTYPE_IP +#define ETHERTYPE_IP 0x800 +#endif + +#if !defined(ETHERTYPE_IPV6) +#define ETHERTYPE_IPV6 0x86dd +#endif /* !defined(ETHERTYPE_IPV6) */ + +#if !defined(ETHERTYPE_ALLSAP) && defined(SOL2) +#define ETHERTYPE_ALLSAP 0 +#endif /* !defined(ETHERTYPE_ALLSAP) && defined(SOL2) */ + +#if !defined(PPP_ALLSAP) && defined(SOL2) +#define PPP_ALLSAP PPP_ALLSTATIONS +#endif /* !defined(PPP_ALLSAP) && defined(SOL2) */ + +extern time_t time; + +#ifdef SOL2 +/* + * We use this reader-writer lock to ensure that the lower streams + * stay connected to the upper streams while the lower-side put and + * service procedures are running. Essentially it is an existence + * lock for the upper stream associated with each lower stream. + */ +krwlock_t ppp_lower_lock; +#define LOCK_LOWER_W rw_enter(&ppp_lower_lock, RW_WRITER) +#define LOCK_LOWER_R rw_enter(&ppp_lower_lock, RW_READER) +#define TRYLOCK_LOWER_R rw_tryenter(&ppp_lower_lock, RW_READER) +#define UNLOCK_LOWER rw_exit(&ppp_lower_lock) + +#define MT_ENTER(x) mutex_enter(x) +#define MT_EXIT(x) mutex_exit(x) + +/* + * Notes on multithreaded implementation for Solaris 2: + * + * We use an inner perimeter around each queue pair and an outer + * perimeter around the whole driver. The inner perimeter is + * entered exclusively for all entry points (open, close, put, + * service). The outer perimeter is entered exclusively for open + * and close and shared for put and service. This is all done for + * us by the streams framework. + * + * I used to think that the perimeters were entered for the lower + * streams' put and service routines as well as for the upper streams'. + * Because of problems experienced by people, and after reading the + * documentation more closely, I now don't think that is true. So we + * now use ppp_lower_lock to give us an existence guarantee on the + * upper stream controlling each lower stream. + * + * Shared entry to the outer perimeter protects the existence of all + * the upper streams and their upperstr_t structures, and guarantees + * that the following fields of any upperstr_t won't change: + * nextmn, next, nextppa. It guarantees that the lowerq field of an + * upperstr_t won't go from non-zero to zero, that the global `ppas' + * won't change and that the no lower stream will get unlinked. + * + * Shared (reader) access to ppa_lower_lock guarantees that no lower + * stream will be unlinked and that the lowerq field of all upperstr_t + * structures won't change. + */ + +#else /* SOL2 */ +#define LOCK_LOWER_W 0 +#define LOCK_LOWER_R 0 +#define TRYLOCK_LOWER_R 1 +#define UNLOCK_LOWER 0 +#define MT_ENTER(x) 0 +#define MT_EXIT(x) 0 + +#endif /* SOL2 */ + +/* + * Private information; one per upper stream. + */ +typedef struct upperstr { + minor_t mn; /* minor device number */ + struct upperstr *nextmn; /* next minor device */ + queue_t *q; /* read q associated with this upper stream */ + int flags; /* flag bits, see below */ + int state; /* current DLPI state */ + int sap; /* service access point */ + int req_sap; /* which SAP the DLPI client requested */ + struct upperstr *ppa; /* control stream for our ppa */ + struct upperstr *next; /* next stream for this ppa */ + uint ioc_id; /* last ioctl ID for this stream */ + enum NPmode npmode; /* what to do with packets on this SAP */ + unsigned char rblocked; /* flow control has blocked upper read strm */ + /* N.B. rblocked is only changed by control stream's put/srv procs */ + /* + * There is exactly one control stream for each PPA. + * The following fields are only used for control streams. + */ + int ppa_id; + queue_t *lowerq; /* write queue attached below this PPA */ + struct upperstr *nextppa; /* next control stream */ + int mru; + int mtu; + struct pppstat stats; /* statistics */ + time_t last_sent; /* time last NP packet sent */ + time_t last_recv; /* time last NP packet rcvd */ +#ifdef SOL2 + kmutex_t stats_lock; /* lock for stats updates */ + kstat_t *kstats; /* stats for netstat */ +#endif /* SOL2 */ +#ifdef LACHTCP + int ifflags; + char ifname[IFNAMSIZ]; + struct ifstats ifstats; +#endif /* LACHTCP */ +} upperstr_t; + +/* Values for flags */ +#define US_PRIV 1 /* stream was opened by superuser */ +#define US_CONTROL 2 /* stream is a control stream */ +#define US_BLOCKED 4 /* flow ctrl has blocked lower write stream */ +#define US_LASTMOD 8 /* no PPP modules below us */ +#define US_DBGLOG 0x10 /* log various occurrences */ +#define US_RBLOCKED 0x20 /* flow ctrl has blocked upper read stream */ + +#if defined(SOL2) +#if DL_CURRENT_VERSION >= 2 +#define US_PROMISC 0x40 /* stream is promiscuous */ +#endif /* DL_CURRENT_VERSION >= 2 */ +#define US_RAWDATA 0x80 /* raw M_DATA, no DLPI header */ +#endif /* defined(SOL2) */ + +#ifdef PRIOQ +static u_char max_band=0; +static u_char def_band=0; + +#define IPPORT_DEFAULT 65535 + +/* + * Port priority table + * Highest priority ports are listed first, lowest are listed last. + * ICMP & packets using unlisted ports will be treated as "default". + * If IPPORT_DEFAULT is not listed here, "default" packets will be + * assigned lowest priority. + * Each line should be terminated with "0". + * Line containing only "0" marks the end of the list. + */ + +static u_short prioq_table[]= { + 113, 53, 0, + 22, 23, 513, 517, 518, 0, + 514, 21, 79, 111, 0, + 25, 109, 110, 0, + IPPORT_DEFAULT, 0, + 20, 70, 80, 8001, 8008, 8080, 0, /* 8001,8008,8080 - common proxy ports */ +0 }; + +#endif /* PRIOQ */ + + +static upperstr_t *minor_devs = NULL; +static upperstr_t *ppas = NULL; + +#ifdef SVR4 +static int pppopen __P((queue_t *, dev_t *, int, int, cred_t *)); +static int pppclose __P((queue_t *, int, cred_t *)); +#else +static int pppopen __P((queue_t *, int, int, int)); +static int pppclose __P((queue_t *, int)); +#endif /* SVR4 */ +static int pppurput __P((queue_t *, mblk_t *)); +static int pppuwput __P((queue_t *, mblk_t *)); +static int pppursrv __P((queue_t *)); +static int pppuwsrv __P((queue_t *)); +static int ppplrput __P((queue_t *, mblk_t *)); +static int ppplwput __P((queue_t *, mblk_t *)); +static int ppplrsrv __P((queue_t *)); +static int ppplwsrv __P((queue_t *)); +#ifndef NO_DLPI +static void dlpi_request __P((queue_t *, mblk_t *, upperstr_t *)); +static void dlpi_error __P((queue_t *, upperstr_t *, int, int, int)); +static void dlpi_ok __P((queue_t *, int)); +#endif +static int send_data __P((mblk_t *, upperstr_t *)); +static void new_ppa __P((queue_t *, mblk_t *)); +static void attach_ppa __P((queue_t *, mblk_t *)); +static void detach_ppa __P((queue_t *, mblk_t *)); +static void detach_lower __P((queue_t *, mblk_t *)); +static void debug_dump __P((queue_t *, mblk_t *)); +static upperstr_t *find_dest __P((upperstr_t *, int)); +#if defined(SOL2) +static upperstr_t *find_promisc __P((upperstr_t *, int)); +static mblk_t *prepend_ether __P((upperstr_t *, mblk_t *, int)); +static mblk_t *prepend_udind __P((upperstr_t *, mblk_t *, int)); +static void promisc_sendup __P((upperstr_t *, mblk_t *, int, int)); +#endif /* defined(SOL2) */ +static int putctl2 __P((queue_t *, int, int, int)); +static int putctl4 __P((queue_t *, int, int, int)); +static int pass_packet __P((upperstr_t *ppa, mblk_t *mp, int outbound)); +#ifdef FILTER_PACKETS +static int ip_hard_filter __P((upperstr_t *ppa, mblk_t *mp, int outbound)); +#endif /* FILTER_PACKETS */ + +#define PPP_ID 0xb1a6 +static struct module_info ppp_info = { +#ifdef PRIOQ + PPP_ID, "ppp", 0, 512, 512, 384 +#else + PPP_ID, "ppp", 0, 512, 512, 128 +#endif /* PRIOQ */ +}; + +static struct qinit pppurint = { + pppurput, pppursrv, pppopen, pppclose, NULL, &ppp_info, NULL +}; + +static struct qinit pppuwint = { + pppuwput, pppuwsrv, NULL, NULL, NULL, &ppp_info, NULL +}; + +static struct qinit ppplrint = { + ppplrput, ppplrsrv, NULL, NULL, NULL, &ppp_info, NULL +}; + +static struct qinit ppplwint = { + ppplwput, ppplwsrv, NULL, NULL, NULL, &ppp_info, NULL +}; + +#ifdef LACHTCP +extern struct ifstats *ifstats; +int pppdevflag = 0; +#endif + +struct streamtab pppinfo = { + &pppurint, &pppuwint, + &ppplrint, &ppplwint +}; + +int ppp_count; + +/* + * How we maintain statistics. + */ +#ifdef SOL2 +#define INCR_IPACKETS(ppa) \ + if (ppa->kstats != 0) { \ + KSTAT_NAMED_PTR(ppa->kstats)[0].value.ul++; \ + } +#define INCR_IERRORS(ppa) \ + if (ppa->kstats != 0) { \ + KSTAT_NAMED_PTR(ppa->kstats)[1].value.ul++; \ + } +#define INCR_OPACKETS(ppa) \ + if (ppa->kstats != 0) { \ + KSTAT_NAMED_PTR(ppa->kstats)[2].value.ul++; \ + } +#define INCR_OERRORS(ppa) \ + if (ppa->kstats != 0) { \ + KSTAT_NAMED_PTR(ppa->kstats)[3].value.ul++; \ + } +#endif + +#ifdef LACHTCP +#define INCR_IPACKETS(ppa) ppa->ifstats.ifs_ipackets++; +#define INCR_IERRORS(ppa) ppa->ifstats.ifs_ierrors++; +#define INCR_OPACKETS(ppa) ppa->ifstats.ifs_opackets++; +#define INCR_OERRORS(ppa) ppa->ifstats.ifs_oerrors++; +#endif + +/* + * STREAMS driver entry points. + */ +static int +#ifdef SVR4 +pppopen(q, devp, oflag, sflag, credp) + queue_t *q; + dev_t *devp; + int oflag, sflag; + cred_t *credp; +#else +pppopen(q, dev, oflag, sflag) + queue_t *q; + int dev; /* really dev_t */ + int oflag, sflag; +#endif +{ + upperstr_t *up; + upperstr_t **prevp; + minor_t mn; +#ifdef PRIOQ + u_short *ptr; + u_char new_band; +#endif /* PRIOQ */ + + if (q->q_ptr) + DRV_OPEN_OK(dev); /* device is already open */ + +#ifdef PRIOQ + /* Calculate max_bband & def_band from definitions in prioq.h + This colud be done at some more approtiate time (less often) + but this way it works well so I'll just leave it here */ + + max_band = 1; + def_band = 0; + ptr = prioq_table; + while (*ptr) { + new_band = 1; + while (*ptr) + if (*ptr++ == IPPORT_DEFAULT) { + new_band = 0; + def_band = max_band; + } + max_band += new_band; + ptr++; + } + if (def_band) + def_band = max_band - def_band; + --max_band; +#endif /* PRIOQ */ + + if (sflag == CLONEOPEN) { + mn = 0; + for (prevp = &minor_devs; (up = *prevp) != 0; prevp = &up->nextmn) { + if (up->mn != mn) + break; + ++mn; + } + } else { +#ifdef SVR4 + mn = getminor(*devp); +#else + mn = minor(dev); +#endif + for (prevp = &minor_devs; (up = *prevp) != 0; prevp = &up->nextmn) { + if (up->mn >= mn) + break; + } + if (up->mn == mn) { + /* this can't happen */ + q->q_ptr = WR(q)->q_ptr = (caddr_t) up; + DRV_OPEN_OK(dev); + } + } + + /* + * Construct a new minor node. + */ + up = (upperstr_t *) ALLOC_SLEEP(sizeof(upperstr_t)); + bzero((caddr_t) up, sizeof(upperstr_t)); + if (up == 0) { + DPRINT("pppopen: out of kernel memory\n"); + OPEN_ERROR(ENXIO); + } + up->nextmn = *prevp; + *prevp = up; + up->mn = mn; +#ifdef SVR4 + *devp = makedevice(getmajor(*devp), mn); +#endif + up->q = q; + if (NOTSUSER() == 0) + up->flags |= US_PRIV; +#ifndef NO_DLPI + up->state = DL_UNATTACHED; +#endif +#ifdef LACHTCP + up->ifflags = IFF_UP | IFF_POINTOPOINT; +#endif + up->sap = -1; + up->last_sent = up->last_recv = time; + up->npmode = NPMODE_DROP; + q->q_ptr = (caddr_t) up; + WR(q)->q_ptr = (caddr_t) up; + noenable(WR(q)); +#ifdef SOL2 + mutex_init(&up->stats_lock, NULL, MUTEX_DRIVER, NULL); +#endif + ++ppp_count; + + qprocson(q); + DRV_OPEN_OK(makedev(major(dev), mn)); +} + +static int +#ifdef SVR4 +pppclose(q, flag, credp) + queue_t *q; + int flag; + cred_t *credp; +#else +pppclose(q, flag) + queue_t *q; + int flag; +#endif +{ + upperstr_t *up, **upp; + upperstr_t *as, *asnext; + upperstr_t **prevp; + + qprocsoff(q); + + up = (upperstr_t *) q->q_ptr; + if (up == 0) { + DPRINT("pppclose: q_ptr = 0\n"); + return 0; + } + if (up->flags & US_DBGLOG) + DPRINT2("ppp/%d: close, flags=%x\n", up->mn, up->flags); + if (up->flags & US_CONTROL) { +#ifdef LACHTCP + struct ifstats *ifp, *pifp; +#endif + if (up->lowerq != 0) { + /* Gack! the lower stream should have be unlinked earlier! */ + DPRINT1("ppp%d: lower stream still connected on close?\n", + up->mn); + LOCK_LOWER_W; + up->lowerq->q_ptr = 0; + RD(up->lowerq)->q_ptr = 0; + up->lowerq = 0; + UNLOCK_LOWER; + } + + /* + * This stream represents a PPA: + * For all streams attached to the PPA, clear their + * references to this PPA. + * Then remove this PPA from the list of PPAs. + */ + for (as = up->next; as != 0; as = asnext) { + asnext = as->next; + as->next = 0; + as->ppa = 0; + if (as->flags & US_BLOCKED) { + as->flags &= ~US_BLOCKED; + flushq(WR(as->q), FLUSHDATA); + } + } + for (upp = &ppas; *upp != 0; upp = &(*upp)->nextppa) + if (*upp == up) { + *upp = up->nextppa; + break; + } +#ifdef LACHTCP + /* Remove the statistics from the active list. */ + for (ifp = ifstats, pifp = 0; ifp; ifp = ifp->ifs_next) { + if (ifp == &up->ifstats) { + if (pifp) + pifp->ifs_next = ifp->ifs_next; + else + ifstats = ifp->ifs_next; + break; + } + pifp = ifp; + } +#endif + } else { + /* + * If this stream is attached to a PPA, + * remove it from the PPA's list. + */ + if ((as = up->ppa) != 0) { + for (; as->next != 0; as = as->next) + if (as->next == up) { + as->next = up->next; + break; + } + } + } + +#ifdef SOL2 + if (up->kstats) + kstat_delete(up->kstats); + mutex_destroy(&up->stats_lock); +#endif + + q->q_ptr = NULL; + WR(q)->q_ptr = NULL; + + for (prevp = &minor_devs; *prevp != 0; prevp = &(*prevp)->nextmn) { + if (*prevp == up) { + *prevp = up->nextmn; + break; + } + } + FREE(up, sizeof(upperstr_t)); + --ppp_count; + + return 0; +} + +/* + * A message from on high. We do one of three things: + * - qreply() + * - put the message on the lower write stream + * - queue it for our service routine + */ +static int +pppuwput(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *us, *ppa, *nps; + struct iocblk *iop; + struct linkblk *lb; +#ifdef LACHTCP + struct ifreq *ifr; + int i; +#endif + queue_t *lq; + int error, n, sap; + mblk_t *mq; + struct ppp_idle *pip; +#ifdef PRIOQ + queue_t *tlq; +#endif /* PRIOQ */ +#ifdef NO_DLPI + upperstr_t *os; +#endif + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("pppuwput: q_ptr = 0!\n"); + return 0; + } + if (mp == 0) { + DPRINT1("pppuwput/%d: mp = 0!\n", us->mn); + return 0; + } + if (mp->b_datap == 0) { + DPRINT1("pppuwput/%d: mp->b_datap = 0!\n", us->mn); + return 0; + } + switch (mp->b_datap->db_type) { +#ifndef NO_DLPI + case M_PCPROTO: + case M_PROTO: + dlpi_request(q, mp, us); + break; +#endif /* NO_DLPI */ + + case M_DATA: + if (us->flags & US_DBGLOG) + DPRINT3("ppp/%d: uwput M_DATA len=%d flags=%x\n", + us->mn, msgdsize(mp), us->flags); + if (us->ppa == 0 || msgdsize(mp) > us->ppa->mtu + PPP_HDRLEN +#ifndef NO_DLPI + || (us->flags & US_CONTROL) == 0 +#endif /* NO_DLPI */ + ) { + DPRINT1("pppuwput: junk data len=%d\n", msgdsize(mp)); + freemsg(mp); + break; + } +#ifdef NO_DLPI + if ((us->flags & US_CONTROL) == 0 && !pass_packet(us, mp, 1)) + break; +#endif + if (!send_data(mp, us)) + putq(q, mp); + break; + + case M_IOCTL: + iop = (struct iocblk *) mp->b_rptr; + error = EINVAL; + if (us->flags & US_DBGLOG) + DPRINT3("ppp/%d: ioctl %x count=%d\n", + us->mn, iop->ioc_cmd, iop->ioc_count); + switch (iop->ioc_cmd) { +#if defined(SOL2) + case DLIOCRAW: /* raw M_DATA mode */ + us->flags |= US_RAWDATA; + error = 0; + break; +#endif /* defined(SOL2) */ + case I_LINK: + if ((us->flags & US_CONTROL) == 0 || us->lowerq != 0) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl I_LINK b_cont = 0!\n", us->mn); + break; + } + lb = (struct linkblk *) mp->b_cont->b_rptr; + lq = lb->l_qbot; + if (lq == 0) { + DPRINT1("pppuwput/%d: ioctl I_LINK l_qbot = 0!\n", us->mn); + break; + } + LOCK_LOWER_W; + us->lowerq = lq; + lq->q_ptr = (caddr_t) q; + RD(lq)->q_ptr = (caddr_t) us->q; + UNLOCK_LOWER; + iop->ioc_count = 0; + error = 0; + us->flags &= ~US_LASTMOD; + /* Unblock upper streams which now feed this lower stream. */ + qenable(q); + /* Send useful information down to the modules which + are now linked below us. */ + putctl2(lq, M_CTL, PPPCTL_UNIT, us->ppa_id); + putctl4(lq, M_CTL, PPPCTL_MRU, us->mru); + putctl4(lq, M_CTL, PPPCTL_MTU, us->mtu); +#ifdef PRIOQ + /* Lower tty driver's queue hiwat/lowat from default 4096/128 + to 256/128 since we don't want queueing of data on + output to physical device */ + + freezestr(lq); + for (tlq = lq; tlq->q_next != NULL; tlq = tlq->q_next) + ; + strqset(tlq, QHIWAT, 0, 256); + strqset(tlq, QLOWAT, 0, 128); + unfreezestr(lq); +#endif /* PRIOQ */ + break; + + case I_UNLINK: + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl I_UNLINK b_cont = 0!\n", us->mn); + break; + } + lb = (struct linkblk *) mp->b_cont->b_rptr; +#if DEBUG + if (us->lowerq != lb->l_qbot) { + DPRINT2("ppp unlink: lowerq=%x qbot=%x\n", + us->lowerq, lb->l_qbot); + break; + } +#endif + iop->ioc_count = 0; + qwriter(q, mp, detach_lower, PERIM_OUTER); + error = -1; + break; + + case PPPIO_NEWPPA: + if (us->flags & US_CONTROL) + break; + if ((us->flags & US_PRIV) == 0) { + error = EPERM; + break; + } + /* Arrange to return an int */ + if ((mq = mp->b_cont) == 0 + || mq->b_datap->db_lim - mq->b_rptr < sizeof(int)) { + mq = allocb(sizeof(int), BPRI_HI); + if (mq == 0) { + error = ENOSR; + break; + } + if (mp->b_cont != 0) + freemsg(mp->b_cont); + mp->b_cont = mq; + mq->b_cont = 0; + } + iop->ioc_count = sizeof(int); + mq->b_wptr = mq->b_rptr + sizeof(int); + qwriter(q, mp, new_ppa, PERIM_OUTER); + error = -1; + break; + + case PPPIO_ATTACH: + /* like dlpi_attach, for programs which can't write to + the stream (like pppstats) */ + if (iop->ioc_count != sizeof(int) || us->ppa != 0) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl PPPIO_ATTACH b_cont = 0!\n", us->mn); + break; + } + n = *(int *)mp->b_cont->b_rptr; + for (ppa = ppas; ppa != 0; ppa = ppa->nextppa) + if (ppa->ppa_id == n) + break; + if (ppa == 0) + break; + us->ppa = ppa; + iop->ioc_count = 0; + qwriter(q, mp, attach_ppa, PERIM_OUTER); + error = -1; + break; + +#ifdef NO_DLPI + case PPPIO_BIND: + /* Attach to a given SAP. */ + if (iop->ioc_count != sizeof(int) || us->ppa == 0) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl PPPIO_BIND b_cont = 0!\n", us->mn); + break; + } + n = *(int *)mp->b_cont->b_rptr; + /* n must be a valid PPP network protocol number. */ + if (n < 0x21 || n > 0x3fff || (n & 0x101) != 1) + break; + /* check that no other stream is bound to this sap already. */ + for (os = us->ppa; os != 0; os = os->next) + if (os->sap == n) + break; + if (os != 0) + break; + us->sap = n; + iop->ioc_count = 0; + error = 0; + break; +#endif /* NO_DLPI */ + + case PPPIO_MRU: + if (iop->ioc_count != sizeof(int) || (us->flags & US_CONTROL) == 0) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl PPPIO_MRU b_cont = 0!\n", us->mn); + break; + } + n = *(int *)mp->b_cont->b_rptr; + if (n <= 0 || n > PPP_MAXMRU) + break; + if (n < PPP_MRU) + n = PPP_MRU; + us->mru = n; + if (us->lowerq) + putctl4(us->lowerq, M_CTL, PPPCTL_MRU, n); + error = 0; + iop->ioc_count = 0; + break; + + case PPPIO_MTU: + if (iop->ioc_count != sizeof(int) || (us->flags & US_CONTROL) == 0) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl PPPIO_MTU b_cont = 0!\n", us->mn); + break; + } + n = *(int *)mp->b_cont->b_rptr; + if (n <= 0 || n > PPP_MAXMTU) + break; + us->mtu = n; +#ifdef LACHTCP + /* The MTU reported in netstat, not used as IP max packet size! */ + us->ifstats.ifs_mtu = n; +#endif + if (us->lowerq) + putctl4(us->lowerq, M_CTL, PPPCTL_MTU, n); + error = 0; + iop->ioc_count = 0; + break; + + case PPPIO_LASTMOD: + us->flags |= US_LASTMOD; + error = 0; + break; + + case PPPIO_DEBUG: + if (iop->ioc_count != sizeof(int)) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl PPPIO_DEBUG b_cont = 0!\n", us->mn); + break; + } + n = *(int *)mp->b_cont->b_rptr; + if (n == PPPDBG_DUMP + PPPDBG_DRIVER) { + qwriter(q, NULL, debug_dump, PERIM_OUTER); + iop->ioc_count = 0; + error = -1; + } else if (n == PPPDBG_LOG + PPPDBG_DRIVER) { + DPRINT1("ppp/%d: debug log enabled\n", us->mn); + us->flags |= US_DBGLOG; + iop->ioc_count = 0; + error = 0; + } else { + if (us->ppa == 0 || us->ppa->lowerq == 0) + break; + putnext(us->ppa->lowerq, mp); + error = -1; + } + break; + + case PPPIO_NPMODE: + if (iop->ioc_count != 2 * sizeof(int)) + break; + if ((us->flags & US_CONTROL) == 0) + break; + if (mp->b_cont == 0) { + DPRINT1("pppuwput/%d: ioctl PPPIO_NPMODE b_cont = 0!\n", us->mn); + break; + } + sap = ((int *)mp->b_cont->b_rptr)[0]; + for (nps = us->next; nps != 0; nps = nps->next) { + if (us->flags & US_DBGLOG) + DPRINT2("us = 0x%x, us->next->sap = 0x%x\n", nps, nps->sap); + if (nps->sap == sap) + break; + } + if (nps == 0) { + if (us->flags & US_DBGLOG) + DPRINT2("ppp/%d: no stream for sap %x\n", us->mn, sap); + break; + } + /* XXX possibly should use qwriter here */ + nps->npmode = (enum NPmode) ((int *)mp->b_cont->b_rptr)[1]; + if (nps->npmode != NPMODE_QUEUE && (nps->flags & US_BLOCKED) != 0) + qenable(WR(nps->q)); + iop->ioc_count = 0; + error = 0; + break; + + case PPPIO_GIDLE: + if ((ppa = us->ppa) == 0) + break; + mq = allocb(sizeof(struct ppp_idle), BPRI_HI); + if (mq == 0) { + error = ENOSR; + break; + } + if (mp->b_cont != 0) + freemsg(mp->b_cont); + mp->b_cont = mq; + mq->b_cont = 0; + pip = (struct ppp_idle *) mq->b_wptr; + pip->xmit_idle = time - ppa->last_sent; + pip->recv_idle = time - ppa->last_recv; + mq->b_wptr += sizeof(struct ppp_idle); + iop->ioc_count = sizeof(struct ppp_idle); + error = 0; + break; + +#ifdef LACHTCP + case SIOCSIFNAME: + /* Sent from IP down to us. Attach the ifstats structure. */ + if (iop->ioc_count != sizeof(struct ifreq) || us->ppa == 0) + break; + ifr = (struct ifreq *)mp->b_cont->b_rptr; + /* Find the unit number in the interface name. */ + for (i = 0; i < IFNAMSIZ; i++) { + if (ifr->ifr_name[i] == 0 || + (ifr->ifr_name[i] >= '0' && + ifr->ifr_name[i] <= '9')) + break; + else + us->ifname[i] = ifr->ifr_name[i]; + } + us->ifname[i] = 0; + + /* Convert the unit number to binary. */ + for (n = 0; i < IFNAMSIZ; i++) { + if (ifr->ifr_name[i] == 0) { + break; + } + else { + n = n * 10 + ifr->ifr_name[i] - '0'; + } + } + + /* Verify the ppa. */ + if (us->ppa->ppa_id != n) + break; + ppa = us->ppa; + + /* Set up the netstat block. */ + strncpy (ppa->ifname, us->ifname, IFNAMSIZ); + + ppa->ifstats.ifs_name = ppa->ifname; + ppa->ifstats.ifs_unit = n; + ppa->ifstats.ifs_active = us->state != DL_UNBOUND; + ppa->ifstats.ifs_mtu = ppa->mtu; + + /* Link in statistics used by netstat. */ + ppa->ifstats.ifs_next = ifstats; + ifstats = &ppa->ifstats; + + iop->ioc_count = 0; + error = 0; + break; + + case SIOCGIFFLAGS: + if (!(us->flags & US_CONTROL)) { + if (us->ppa) + us = us->ppa; + else + break; + } + ((struct iocblk_in *)iop)->ioc_ifflags = us->ifflags; + error = 0; + break; + + case SIOCSIFFLAGS: + if (!(us->flags & US_CONTROL)) { + if (us->ppa) + us = us->ppa; + else + break; + } + us->ifflags = ((struct iocblk_in *)iop)->ioc_ifflags; + error = 0; + break; + + case SIOCSIFADDR: + if (!(us->flags & US_CONTROL)) { + if (us->ppa) + us = us->ppa; + else + break; + } + us->ifflags |= IFF_RUNNING; + ((struct iocblk_in *)iop)->ioc_ifflags |= IFF_RUNNING; + error = 0; + break; + + case SIOCSIFMTU: + /* + * Vanilla SVR4 systems don't handle SIOCSIFMTU, rather + * they take the MTU from the DL_INFO_ACK we sent in response + * to their DL_INFO_REQ. Fortunately, they will update the + * MTU if we send an unsolicited DL_INFO_ACK up. + */ + if ((mq = allocb(sizeof(dl_info_req_t), BPRI_HI)) == 0) + break; /* should do bufcall */ + ((union DL_primitives *)mq->b_rptr)->dl_primitive = DL_INFO_REQ; + mq->b_wptr = mq->b_rptr + sizeof(dl_info_req_t); + dlpi_request(q, mq, us); + error = 0; + break; + + case SIOCGIFNETMASK: + case SIOCSIFNETMASK: + case SIOCGIFADDR: + case SIOCGIFDSTADDR: + case SIOCSIFDSTADDR: + case SIOCGIFMETRIC: + error = 0; + break; +#endif /* LACHTCP */ + + default: + if (us->ppa == 0 || us->ppa->lowerq == 0) + break; + us->ioc_id = iop->ioc_id; + error = -1; + switch (iop->ioc_cmd) { + case PPPIO_GETSTAT: + case PPPIO_GETCSTAT: + if (us->flags & US_LASTMOD) { + error = EINVAL; + break; + } + putnext(us->ppa->lowerq, mp); + break; + default: + if (us->flags & US_PRIV) + putnext(us->ppa->lowerq, mp); + else { + DPRINT1("ppp ioctl %x rejected\n", iop->ioc_cmd); + error = EPERM; + } + break; + } + break; + } + + if (error > 0) { + iop->ioc_error = error; + mp->b_datap->db_type = M_IOCNAK; + qreply(q, mp); + } else if (error == 0) { + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); + } + break; + + case M_FLUSH: + if (us->flags & US_DBGLOG) + DPRINT2("ppp/%d: flush %x\n", us->mn, *mp->b_rptr); + if (*mp->b_rptr & FLUSHW) + flushq(q, FLUSHDATA); + if (*mp->b_rptr & FLUSHR) { + *mp->b_rptr &= ~FLUSHW; + qreply(q, mp); + } else + freemsg(mp); + break; + + default: + freemsg(mp); + break; + } + return 0; +} + +#ifndef NO_DLPI +static void +dlpi_request(q, mp, us) + queue_t *q; + mblk_t *mp; + upperstr_t *us; +{ + union DL_primitives *d = (union DL_primitives *) mp->b_rptr; + int size = mp->b_wptr - mp->b_rptr; + mblk_t *reply, *np; + upperstr_t *ppa, *os; + int sap, len; + dl_info_ack_t *info; + dl_bind_ack_t *ackp; +#if DL_CURRENT_VERSION >= 2 + dl_phys_addr_ack_t *paddrack; + static struct ether_addr eaddr = {0}; +#endif + + if (us->flags & US_DBGLOG) + DPRINT3("ppp/%d: dlpi prim %x len=%d\n", us->mn, + d->dl_primitive, size); + switch (d->dl_primitive) { + case DL_INFO_REQ: + if (size < sizeof(dl_info_req_t)) + goto badprim; + if ((reply = allocb(sizeof(dl_info_ack_t), BPRI_HI)) == 0) + break; /* should do bufcall */ + reply->b_datap->db_type = M_PCPROTO; + info = (dl_info_ack_t *) reply->b_wptr; + reply->b_wptr += sizeof(dl_info_ack_t); + bzero((caddr_t) info, sizeof(dl_info_ack_t)); + info->dl_primitive = DL_INFO_ACK; + info->dl_max_sdu = us->ppa? us->ppa->mtu: PPP_MAXMTU; + info->dl_min_sdu = 1; + info->dl_addr_length = sizeof(uint); + info->dl_mac_type = DL_ETHER; /* a bigger lie */ + info->dl_current_state = us->state; + info->dl_service_mode = DL_CLDLS; + info->dl_provider_style = DL_STYLE2; +#if DL_CURRENT_VERSION >= 2 + info->dl_sap_length = sizeof(uint); + info->dl_version = DL_CURRENT_VERSION; +#endif + qreply(q, reply); + break; + + case DL_ATTACH_REQ: + if (size < sizeof(dl_attach_req_t)) + goto badprim; + if (us->state != DL_UNATTACHED || us->ppa != 0) { + dlpi_error(q, us, DL_ATTACH_REQ, DL_OUTSTATE, 0); + break; + } + for (ppa = ppas; ppa != 0; ppa = ppa->nextppa) + if (ppa->ppa_id == d->attach_req.dl_ppa) + break; + if (ppa == 0) { + dlpi_error(q, us, DL_ATTACH_REQ, DL_BADPPA, 0); + break; + } + us->ppa = ppa; + qwriter(q, mp, attach_ppa, PERIM_OUTER); + return; + + case DL_DETACH_REQ: + if (size < sizeof(dl_detach_req_t)) + goto badprim; + if (us->state != DL_UNBOUND || us->ppa == 0) { + dlpi_error(q, us, DL_DETACH_REQ, DL_OUTSTATE, 0); + break; + } + qwriter(q, mp, detach_ppa, PERIM_OUTER); + return; + + case DL_BIND_REQ: + if (size < sizeof(dl_bind_req_t)) + goto badprim; + if (us->state != DL_UNBOUND || us->ppa == 0) { + dlpi_error(q, us, DL_BIND_REQ, DL_OUTSTATE, 0); + break; + } +#if 0 + /* apparently this test fails (unnecessarily?) on some systems */ + if (d->bind_req.dl_service_mode != DL_CLDLS) { + dlpi_error(q, us, DL_BIND_REQ, DL_UNSUPPORTED, 0); + break; + } +#endif + + /* saps must be valid PPP network protocol numbers, + except that we accept ETHERTYPE_IP in place of PPP_IP. */ + sap = d->bind_req.dl_sap; + us->req_sap = sap; + +#if defined(SOL2) + if (us->flags & US_DBGLOG) + DPRINT2("DL_BIND_REQ: ip gives sap = 0x%x, us = 0x%x", sap, us); + + if (sap == ETHERTYPE_IP) /* normal IFF_IPV4 */ + sap = PPP_IP; + else if (sap == ETHERTYPE_IPV6) /* when IFF_IPV6 is set */ + sap = PPP_IPV6; + else if (sap == ETHERTYPE_ALLSAP) /* snoop gives sap of 0 */ + sap = PPP_ALLSAP; + else { + DPRINT2("DL_BIND_REQ: unrecognized sap = 0x%x, us = 0x%x", sap, us); + dlpi_error(q, us, DL_BIND_REQ, DL_BADADDR, 0); + break; + } +#else + if (sap == ETHERTYPE_IP) + sap = PPP_IP; + if (sap < 0x21 || sap > 0x3fff || (sap & 0x101) != 1) { + dlpi_error(q, us, DL_BIND_REQ, DL_BADADDR, 0); + break; + } +#endif /* defined(SOL2) */ + + /* check that no other stream is bound to this sap already. */ + for (os = us->ppa; os != 0; os = os->next) + if (os->sap == sap) + break; + if (os != 0) { + dlpi_error(q, us, DL_BIND_REQ, DL_NOADDR, 0); + break; + } + + us->sap = sap; + us->state = DL_IDLE; + + if ((reply = allocb(sizeof(dl_bind_ack_t) + sizeof(uint), + BPRI_HI)) == 0) + break; /* should do bufcall */ + ackp = (dl_bind_ack_t *) reply->b_wptr; + reply->b_wptr += sizeof(dl_bind_ack_t) + sizeof(uint); + reply->b_datap->db_type = M_PCPROTO; + bzero((caddr_t) ackp, sizeof(dl_bind_ack_t)); + ackp->dl_primitive = DL_BIND_ACK; + ackp->dl_sap = sap; + ackp->dl_addr_length = sizeof(uint); + ackp->dl_addr_offset = sizeof(dl_bind_ack_t); + *(uint *)(ackp+1) = sap; + qreply(q, reply); + break; + + case DL_UNBIND_REQ: + if (size < sizeof(dl_unbind_req_t)) + goto badprim; + if (us->state != DL_IDLE) { + dlpi_error(q, us, DL_UNBIND_REQ, DL_OUTSTATE, 0); + break; + } + us->sap = -1; + us->state = DL_UNBOUND; +#ifdef LACHTCP + us->ppa->ifstats.ifs_active = 0; +#endif + dlpi_ok(q, DL_UNBIND_REQ); + break; + + case DL_UNITDATA_REQ: + if (size < sizeof(dl_unitdata_req_t)) + goto badprim; + if (us->state != DL_IDLE) { + dlpi_error(q, us, DL_UNITDATA_REQ, DL_OUTSTATE, 0); + break; + } + if ((ppa = us->ppa) == 0) { + cmn_err(CE_CONT, "ppp: in state dl_idle but ppa == 0?\n"); + break; + } + len = mp->b_cont == 0? 0: msgdsize(mp->b_cont); + if (len > ppa->mtu) { + DPRINT2("dlpi data too large (%d > %d)\n", len, ppa->mtu); + break; + } + +#if defined(SOL2) + /* + * Should there be any promiscuous stream(s), send the data + * up for each promiscuous stream that we recognize. + */ + if (mp->b_cont) + promisc_sendup(ppa, mp->b_cont, us->sap, 0); +#endif /* defined(SOL2) */ + + mp->b_band = 0; +#ifdef PRIOQ + /* Extract s_port & d_port from IP-packet, the code is a bit + dirty here, but so am I, too... */ + if (mp->b_datap->db_type == M_PROTO && us->sap == PPP_IP + && mp->b_cont != 0) { + u_char *bb, *tlh; + int iphlen, len; + u_short *ptr; + u_char band_unset, cur_band, syn; + u_short s_port, d_port; + + bb = mp->b_cont->b_rptr; /* bb points to IP-header*/ + len = mp->b_cont->b_wptr - mp->b_cont->b_rptr; + syn = 0; + s_port = IPPORT_DEFAULT; + d_port = IPPORT_DEFAULT; + if (len >= 20) { /* 20 = minimum length of IP header */ + iphlen = (bb[0] & 0x0f) * 4; + tlh = bb + iphlen; + len -= iphlen; + switch (bb[9]) { + case IPPROTO_TCP: + if (len >= 20) { /* min length of TCP header */ + s_port = (tlh[0] << 8) + tlh[1]; + d_port = (tlh[2] << 8) + tlh[3]; + syn = tlh[13] & 0x02; + } + break; + case IPPROTO_UDP: + if (len >= 8) { /* min length of UDP header */ + s_port = (tlh[0] << 8) + tlh[1]; + d_port = (tlh[2] << 8) + tlh[3]; + } + break; + } + } + + /* + * Now calculate b_band for this packet from the + * port-priority table. + */ + ptr = prioq_table; + cur_band = max_band; + band_unset = 1; + while (*ptr) { + while (*ptr && band_unset) + if (s_port == *ptr || d_port == *ptr++) { + mp->b_band = cur_band; + band_unset = 0; + break; + } + ptr++; + cur_band--; + } + if (band_unset) + mp->b_band = def_band; + /* It may be usable to urge SYN packets a bit */ + if (syn) + mp->b_band++; + } +#endif /* PRIOQ */ + /* this assumes PPP_HDRLEN <= sizeof(dl_unitdata_req_t) */ + if (mp->b_datap->db_ref > 1) { + np = allocb(PPP_HDRLEN, BPRI_HI); + if (np == 0) + break; /* gak! */ + np->b_cont = mp->b_cont; + mp->b_cont = 0; + freeb(mp); + mp = np; + } else + mp->b_datap->db_type = M_DATA; + /* XXX should use dl_dest_addr_offset/length here, + but we would have to translate ETHERTYPE_IP -> PPP_IP */ + mp->b_wptr = mp->b_rptr + PPP_HDRLEN; + mp->b_rptr[0] = PPP_ALLSTATIONS; + mp->b_rptr[1] = PPP_UI; + mp->b_rptr[2] = us->sap >> 8; + mp->b_rptr[3] = us->sap; + if (pass_packet(us, mp, 1)) { + if (!send_data(mp, us)) + putq(q, mp); + } + return; + +#if DL_CURRENT_VERSION >= 2 + case DL_PHYS_ADDR_REQ: + if (size < sizeof(dl_phys_addr_req_t)) + goto badprim; + + /* + * Don't check state because ifconfig sends this one down too + */ + + if ((reply = allocb(sizeof(dl_phys_addr_ack_t)+ETHERADDRL, + BPRI_HI)) == 0) + break; /* should do bufcall */ + reply->b_datap->db_type = M_PCPROTO; + paddrack = (dl_phys_addr_ack_t *) reply->b_wptr; + reply->b_wptr += sizeof(dl_phys_addr_ack_t); + bzero((caddr_t) paddrack, sizeof(dl_phys_addr_ack_t)+ETHERADDRL); + paddrack->dl_primitive = DL_PHYS_ADDR_ACK; + paddrack->dl_addr_length = ETHERADDRL; + paddrack->dl_addr_offset = sizeof(dl_phys_addr_ack_t); + bcopy(&eaddr, reply->b_wptr, ETHERADDRL); + reply->b_wptr += ETHERADDRL; + qreply(q, reply); + break; + +#if defined(SOL2) + case DL_PROMISCON_REQ: + if (size < sizeof(dl_promiscon_req_t)) + goto badprim; + us->flags |= US_PROMISC; + dlpi_ok(q, DL_PROMISCON_REQ); + break; + + case DL_PROMISCOFF_REQ: + if (size < sizeof(dl_promiscoff_req_t)) + goto badprim; + us->flags &= ~US_PROMISC; + dlpi_ok(q, DL_PROMISCOFF_REQ); + break; +#else + case DL_PROMISCON_REQ: /* fall thru */ + case DL_PROMISCOFF_REQ: /* fall thru */ +#endif /* defined(SOL2) */ +#endif /* DL_CURRENT_VERSION >= 2 */ + +#if DL_CURRENT_VERSION >= 2 + case DL_SET_PHYS_ADDR_REQ: + case DL_SUBS_BIND_REQ: + case DL_SUBS_UNBIND_REQ: + case DL_ENABMULTI_REQ: + case DL_DISABMULTI_REQ: + case DL_XID_REQ: + case DL_TEST_REQ: + case DL_REPLY_UPDATE_REQ: + case DL_REPLY_REQ: + case DL_DATA_ACK_REQ: +#endif + case DL_CONNECT_REQ: + case DL_TOKEN_REQ: + dlpi_error(q, us, d->dl_primitive, DL_NOTSUPPORTED, 0); + break; + + case DL_CONNECT_RES: + case DL_DISCONNECT_REQ: + case DL_RESET_REQ: + case DL_RESET_RES: + dlpi_error(q, us, d->dl_primitive, DL_OUTSTATE, 0); + break; + + case DL_UDQOS_REQ: + dlpi_error(q, us, d->dl_primitive, DL_BADQOSTYPE, 0); + break; + +#if DL_CURRENT_VERSION >= 2 + case DL_TEST_RES: + case DL_XID_RES: + break; +#endif + + default: + cmn_err(CE_CONT, "ppp: unknown dlpi prim 0x%x\n", d->dl_primitive); + /* fall through */ + badprim: + dlpi_error(q, us, d->dl_primitive, DL_BADPRIM, 0); + break; + } + freemsg(mp); +} + +static void +dlpi_error(q, us, prim, err, uerr) + queue_t *q; + upperstr_t *us; + int prim, err, uerr; +{ + mblk_t *reply; + dl_error_ack_t *errp; + + if (us->flags & US_DBGLOG) + DPRINT3("ppp/%d: dlpi error, prim=%x, err=%x\n", us->mn, prim, err); + reply = allocb(sizeof(dl_error_ack_t), BPRI_HI); + if (reply == 0) + return; /* XXX should do bufcall */ + reply->b_datap->db_type = M_PCPROTO; + errp = (dl_error_ack_t *) reply->b_wptr; + reply->b_wptr += sizeof(dl_error_ack_t); + errp->dl_primitive = DL_ERROR_ACK; + errp->dl_error_primitive = prim; + errp->dl_errno = err; + errp->dl_unix_errno = uerr; + qreply(q, reply); +} + +static void +dlpi_ok(q, prim) + queue_t *q; + int prim; +{ + mblk_t *reply; + dl_ok_ack_t *okp; + + reply = allocb(sizeof(dl_ok_ack_t), BPRI_HI); + if (reply == 0) + return; /* XXX should do bufcall */ + reply->b_datap->db_type = M_PCPROTO; + okp = (dl_ok_ack_t *) reply->b_wptr; + reply->b_wptr += sizeof(dl_ok_ack_t); + okp->dl_primitive = DL_OK_ACK; + okp->dl_correct_primitive = prim; + qreply(q, reply); +} +#endif /* NO_DLPI */ + +static int +pass_packet(us, mp, outbound) + upperstr_t *us; + mblk_t *mp; + int outbound; +{ + int pass; + upperstr_t *ppa; + + if ((ppa = us->ppa) == 0) { + freemsg(mp); + return 0; + } + +#ifdef FILTER_PACKETS + pass = ip_hard_filter(us, mp, outbound); +#else + /* + * Here is where we might, in future, decide whether to pass + * or drop the packet, and whether it counts as link activity. + */ + pass = 1; +#endif /* FILTER_PACKETS */ + + if (pass < 0) { + /* pass only if link already up, and don't update time */ + if (ppa->lowerq == 0) { + freemsg(mp); + return 0; + } + pass = 1; + } else if (pass) { + if (outbound) + ppa->last_sent = time; + else + ppa->last_recv = time; + } + + return pass; +} + +/* + * We have some data to send down to the lower stream (or up the + * control stream, if we don't have a lower stream attached). + * Returns 1 if the message was dealt with, 0 if it wasn't able + * to be sent on and should therefore be queued up. + */ +static int +send_data(mp, us) + mblk_t *mp; + upperstr_t *us; +{ + upperstr_t *ppa; + + if ((us->flags & US_BLOCKED) || us->npmode == NPMODE_QUEUE) + return 0; + ppa = us->ppa; + if (ppa == 0 || us->npmode == NPMODE_DROP || us->npmode == NPMODE_ERROR) { + if (us->flags & US_DBGLOG) + DPRINT2("ppp/%d: dropping pkt (npmode=%d)\n", us->mn, us->npmode); + freemsg(mp); + return 1; + } + if (ppa->lowerq == 0) { + /* try to send it up the control stream */ + if (bcanputnext(ppa->q, mp->b_band)) { + /* + * The message seems to get corrupted for some reason if + * we just send the message up as it is, so we send a copy. + */ + mblk_t *np = copymsg(mp); + freemsg(mp); + if (np != 0) + putnext(ppa->q, np); + return 1; + } + } else { + if (bcanputnext(ppa->lowerq, mp->b_band)) { + MT_ENTER(&ppa->stats_lock); + ppa->stats.ppp_opackets++; + ppa->stats.ppp_obytes += msgdsize(mp); +#ifdef INCR_OPACKETS + INCR_OPACKETS(ppa); +#endif + MT_EXIT(&ppa->stats_lock); + /* + * The lower queue is only ever detached while holding an + * exclusive lock on the whole driver. So we can be confident + * that the lower queue is still there. + */ + putnext(ppa->lowerq, mp); + return 1; + } + } + us->flags |= US_BLOCKED; + return 0; +} + +/* + * Allocate a new PPA id and link this stream into the list of PPAs. + * This procedure is called with an exclusive lock on all queues in + * this driver. + */ +static void +new_ppa(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *us, *up, **usp; + int ppa_id; + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("new_ppa: q_ptr = 0!\n"); + return; + } + + usp = &ppas; + ppa_id = 0; + while ((up = *usp) != 0 && ppa_id == up->ppa_id) { + ++ppa_id; + usp = &up->nextppa; + } + us->ppa_id = ppa_id; + us->ppa = us; + us->next = 0; + us->nextppa = *usp; + *usp = us; + us->flags |= US_CONTROL; + us->npmode = NPMODE_PASS; + + us->mtu = PPP_MTU; + us->mru = PPP_MRU; + +#ifdef SOL2 + /* + * Create a kstats record for our statistics, so netstat -i works. + */ + if (us->kstats == 0) { + char unit[32]; + + sprintf(unit, "ppp%d", us->ppa->ppa_id); + us->kstats = kstat_create("ppp", us->ppa->ppa_id, unit, + "net", KSTAT_TYPE_NAMED, 4, 0); + if (us->kstats != 0) { + kstat_named_t *kn = KSTAT_NAMED_PTR(us->kstats); + + strcpy(kn[0].name, "ipackets"); + kn[0].data_type = KSTAT_DATA_ULONG; + strcpy(kn[1].name, "ierrors"); + kn[1].data_type = KSTAT_DATA_ULONG; + strcpy(kn[2].name, "opackets"); + kn[2].data_type = KSTAT_DATA_ULONG; + strcpy(kn[3].name, "oerrors"); + kn[3].data_type = KSTAT_DATA_ULONG; + kstat_install(us->kstats); + } + } +#endif /* SOL2 */ + + *(int *)mp->b_cont->b_rptr = ppa_id; + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); +} + +static void +attach_ppa(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *us, *t; + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("attach_ppa: q_ptr = 0!\n"); + return; + } + +#ifndef NO_DLPI + us->state = DL_UNBOUND; +#endif + for (t = us->ppa; t->next != 0; t = t->next) + ; + t->next = us; + us->next = 0; + if (mp->b_datap->db_type == M_IOCTL) { + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); + } else { +#ifndef NO_DLPI + dlpi_ok(q, DL_ATTACH_REQ); +#endif + } +} + +static void +detach_ppa(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *us, *t; + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("detach_ppa: q_ptr = 0!\n"); + return; + } + + for (t = us->ppa; t->next != 0; t = t->next) + if (t->next == us) { + t->next = us->next; + break; + } + us->next = 0; + us->ppa = 0; +#ifndef NO_DLPI + us->state = DL_UNATTACHED; + dlpi_ok(q, DL_DETACH_REQ); +#endif +} + +/* + * We call this with qwriter in order to give the upper queue procedures + * the guarantee that the lower queue is not going to go away while + * they are executing. + */ +static void +detach_lower(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *us; + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("detach_lower: q_ptr = 0!\n"); + return; + } + + LOCK_LOWER_W; + us->lowerq->q_ptr = 0; + RD(us->lowerq)->q_ptr = 0; + us->lowerq = 0; + UNLOCK_LOWER; + + /* Unblock streams which now feed back up the control stream. */ + qenable(us->q); + + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); +} + +static int +pppuwsrv(q) + queue_t *q; +{ + upperstr_t *us, *as; + mblk_t *mp; + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("pppuwsrv: q_ptr = 0!\n"); + return 0; + } + + /* + * If this is a control stream, then this service procedure + * probably got enabled because of flow control in the lower + * stream being enabled (or because of the lower stream going + * away). Therefore we enable the service procedure of all + * attached upper streams. + */ + if (us->flags & US_CONTROL) { + for (as = us->next; as != 0; as = as->next) + qenable(WR(as->q)); + } + + /* Try to send on any data queued here. */ + us->flags &= ~US_BLOCKED; + while ((mp = getq(q)) != 0) { + if (!send_data(mp, us)) { + putbq(q, mp); + break; + } + } + + return 0; +} + +/* should never get called... */ +static int +ppplwput(q, mp) + queue_t *q; + mblk_t *mp; +{ + putnext(q, mp); + return 0; +} + +static int +ppplwsrv(q) + queue_t *q; +{ + queue_t *uq; + + /* + * Flow control has back-enabled this stream: + * enable the upper write service procedure for + * the upper control stream for this lower stream. + */ + LOCK_LOWER_R; + uq = (queue_t *) q->q_ptr; + if (uq != 0) + qenable(uq); + UNLOCK_LOWER; + return 0; +} + +/* + * This should only get called for control streams. + */ +static int +pppurput(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *ppa, *us; + int proto, len; + struct iocblk *iop; + + ppa = (upperstr_t *) q->q_ptr; + if (ppa == 0) { + DPRINT("pppurput: q_ptr = 0!\n"); + return 0; + } + + switch (mp->b_datap->db_type) { + case M_CTL: + MT_ENTER(&ppa->stats_lock); + switch (*mp->b_rptr) { + case PPPCTL_IERROR: +#ifdef INCR_IERRORS + INCR_IERRORS(ppa); +#endif + ppa->stats.ppp_ierrors++; + break; + case PPPCTL_OERROR: +#ifdef INCR_OERRORS + INCR_OERRORS(ppa); +#endif + ppa->stats.ppp_oerrors++; + break; + } + MT_EXIT(&ppa->stats_lock); + freemsg(mp); + break; + + case M_IOCACK: + case M_IOCNAK: + /* + * Attempt to match up the response with the stream + * that the request came from. + */ + iop = (struct iocblk *) mp->b_rptr; + for (us = ppa; us != 0; us = us->next) + if (us->ioc_id == iop->ioc_id) + break; + if (us == 0) + freemsg(mp); + else + putnext(us->q, mp); + break; + + case M_HANGUP: + /* + * The serial device has hung up. We don't want to send + * the M_HANGUP message up to pppd because that will stop + * us from using the control stream any more. Instead we + * send a zero-length message as an end-of-file indication. + */ + freemsg(mp); + mp = allocb(1, BPRI_HI); + if (mp == 0) { + DPRINT1("ppp/%d: couldn't allocate eof message!\n", ppa->mn); + break; + } + putnext(ppa->q, mp); + break; + + default: + if (mp->b_datap->db_type == M_DATA) { + len = msgdsize(mp); + if (mp->b_wptr - mp->b_rptr < PPP_HDRLEN) { + PULLUP(mp, PPP_HDRLEN); + if (mp == 0) { + DPRINT1("ppp_urput: msgpullup failed (len=%d)\n", len); + break; + } + } + MT_ENTER(&ppa->stats_lock); + ppa->stats.ppp_ipackets++; + ppa->stats.ppp_ibytes += len; +#ifdef INCR_IPACKETS + INCR_IPACKETS(ppa); +#endif + MT_EXIT(&ppa->stats_lock); + + proto = PPP_PROTOCOL(mp->b_rptr); + +#if defined(SOL2) + /* + * Should there be any promiscuous stream(s), send the data + * up for each promiscuous stream that we recognize. + */ + promisc_sendup(ppa, mp, proto, 1); +#endif /* defined(SOL2) */ + + if (proto < 0x8000 && (us = find_dest(ppa, proto)) != 0) { + /* + * A data packet for some network protocol. + * Queue it on the upper stream for that protocol. + * XXX could we just putnext it? (would require thought) + * The rblocked flag is there to ensure that we keep + * messages in order for each network protocol. + */ + if (!pass_packet(us, mp, 0)) + break; + if (!us->rblocked && !canput(us->q)) + us->rblocked = 1; + if (!us->rblocked) + putq(us->q, mp); + else + putq(q, mp); + break; + } + } + /* + * A control frame, a frame for an unknown protocol, + * or some other message type. + * Send it up to pppd via the control stream. + */ + if (queclass(mp) == QPCTL || canputnext(ppa->q)) + putnext(ppa->q, mp); + else + putq(q, mp); + break; + } + + return 0; +} + +static int +pppursrv(q) + queue_t *q; +{ + upperstr_t *us, *as; + mblk_t *mp, *hdr; +#ifndef NO_DLPI + dl_unitdata_ind_t *ud; +#endif + int proto; + + us = (upperstr_t *) q->q_ptr; + if (us == 0) { + DPRINT("pppursrv: q_ptr = 0!\n"); + return 0; + } + + if (us->flags & US_CONTROL) { + /* + * A control stream. + * If there is no lower queue attached, run the write service + * routines of other upper streams attached to this PPA. + */ + if (us->lowerq == 0) { + as = us; + do { + if (as->flags & US_BLOCKED) + qenable(WR(as->q)); + as = as->next; + } while (as != 0); + } + + /* + * Messages get queued on this stream's read queue if they + * can't be queued on the read queue of the attached stream + * that they are destined for. This is for flow control - + * when this queue fills up, the lower read put procedure will + * queue messages there and the flow control will propagate + * down from there. + */ + while ((mp = getq(q)) != 0) { + proto = PPP_PROTOCOL(mp->b_rptr); + if (proto < 0x8000 && (as = find_dest(us, proto)) != 0) { + if (!canput(as->q)) + break; + putq(as->q, mp); + } else { + if (!canputnext(q)) + break; + putnext(q, mp); + } + } + if (mp) { + putbq(q, mp); + } else { + /* can now put stuff directly on network protocol streams again */ + for (as = us->next; as != 0; as = as->next) + as->rblocked = 0; + } + + /* + * If this stream has a lower stream attached, + * enable the read queue's service routine. + * XXX we should really only do this if the queue length + * has dropped below the low-water mark. + */ + if (us->lowerq != 0) + qenable(RD(us->lowerq)); + + } else { + /* + * A network protocol stream. Put a DLPI header on each + * packet and send it on. + * (Actually, it seems that the IP module will happily + * accept M_DATA messages without the DL_UNITDATA_IND header.) + */ + while ((mp = getq(q)) != 0) { + if (!canputnext(q)) { + putbq(q, mp); + break; + } +#ifndef NO_DLPI + proto = PPP_PROTOCOL(mp->b_rptr); + mp->b_rptr += PPP_HDRLEN; + hdr = allocb(sizeof(dl_unitdata_ind_t) + 2 * sizeof(uint), + BPRI_MED); + if (hdr == 0) { + /* XXX should put it back and use bufcall */ + freemsg(mp); + continue; + } + hdr->b_datap->db_type = M_PROTO; + ud = (dl_unitdata_ind_t *) hdr->b_wptr; + hdr->b_wptr += sizeof(dl_unitdata_ind_t) + 2 * sizeof(uint); + hdr->b_cont = mp; + ud->dl_primitive = DL_UNITDATA_IND; + ud->dl_dest_addr_length = sizeof(uint); + ud->dl_dest_addr_offset = sizeof(dl_unitdata_ind_t); + ud->dl_src_addr_length = sizeof(uint); + ud->dl_src_addr_offset = ud->dl_dest_addr_offset + sizeof(uint); +#if DL_CURRENT_VERSION >= 2 + ud->dl_group_address = 0; +#endif + /* Send the DLPI client the data with the SAP they requested, + (e.g. ETHERTYPE_IP) rather than the PPP protocol number + (e.g. PPP_IP) */ + ((uint *)(ud + 1))[0] = us->req_sap; /* dest SAP */ + ((uint *)(ud + 1))[1] = us->req_sap; /* src SAP */ + putnext(q, hdr); +#else /* NO_DLPI */ + putnext(q, mp); +#endif /* NO_DLPI */ + } + /* + * Now that we have consumed some packets from this queue, + * enable the control stream's read service routine so that we + * can process any packets for us that might have got queued + * there for flow control reasons. + */ + if (us->ppa) + qenable(us->ppa->q); + } + + return 0; +} + +static upperstr_t * +find_dest(ppa, proto) + upperstr_t *ppa; + int proto; +{ + upperstr_t *us; + + for (us = ppa->next; us != 0; us = us->next) + if (proto == us->sap) + break; + return us; +} + +#if defined (SOL2) +/* + * Test upstream promiscuous conditions. As of now, only pass IPv4 and + * Ipv6 packets upstream (let PPP packets be decoded elsewhere). + */ +static upperstr_t * +find_promisc(us, proto) + upperstr_t *us; + int proto; +{ + + if ((proto != PPP_IP) && (proto != PPP_IPV6)) + return (upperstr_t *)0; + + for ( ; us; us = us->next) { + if ((us->flags & US_PROMISC) && (us->state == DL_IDLE)) + return us; + } + + return (upperstr_t *)0; +} + +/* + * Prepend an empty Ethernet header to msg for snoop, et al. + */ +static mblk_t * +prepend_ether(us, mp, proto) + upperstr_t *us; + mblk_t *mp; + int proto; +{ + mblk_t *eh; + int type; + + if ((eh = allocb(sizeof(struct ether_header), BPRI_HI)) == 0) { + freemsg(mp); + return (mblk_t *)0; + } + + if (proto == PPP_IP) + type = ETHERTYPE_IP; + else if (proto == PPP_IPV6) + type = ETHERTYPE_IPV6; + else + type = proto; /* What else? Let decoder decide */ + + eh->b_wptr += sizeof(struct ether_header); + bzero((caddr_t)eh->b_rptr, sizeof(struct ether_header)); + ((struct ether_header *)eh->b_rptr)->ether_type = htons((short)type); + eh->b_cont = mp; + return (eh); +} + +/* + * Prepend DL_UNITDATA_IND mblk to msg + */ +static mblk_t * +prepend_udind(us, mp, proto) + upperstr_t *us; + mblk_t *mp; + int proto; +{ + dl_unitdata_ind_t *dlu; + mblk_t *dh; + size_t size; + + size = sizeof(dl_unitdata_ind_t); + if ((dh = allocb(size, BPRI_MED)) == 0) { + freemsg(mp); + return (mblk_t *)0; + } + + dh->b_datap->db_type = M_PROTO; + dh->b_wptr = dh->b_datap->db_lim; + dh->b_rptr = dh->b_wptr - size; + + dlu = (dl_unitdata_ind_t *)dh->b_rptr; + dlu->dl_primitive = DL_UNITDATA_IND; + dlu->dl_dest_addr_length = 0; + dlu->dl_dest_addr_offset = sizeof(dl_unitdata_ind_t); + dlu->dl_src_addr_length = 0; + dlu->dl_src_addr_offset = sizeof(dl_unitdata_ind_t); + dlu->dl_group_address = 0; + + dh->b_cont = mp; + return (dh); +} + +/* + * For any recognized promiscuous streams, send data upstream + */ +static void +promisc_sendup(ppa, mp, proto, skip) + upperstr_t *ppa; + mblk_t *mp; + int proto, skip; +{ + mblk_t *dup_mp, *dup_dup_mp; + upperstr_t *prus, *nprus; + + if ((prus = find_promisc(ppa, proto)) != 0) { + if (dup_mp = dupmsg(mp)) { + + if (skip) + dup_mp->b_rptr += PPP_HDRLEN; + + for ( ; nprus = find_promisc(prus->next, proto); + prus = nprus) { + + if (dup_dup_mp = dupmsg(dup_mp)) { + if (canputnext(prus->q)) { + if (prus->flags & US_RAWDATA) { + dup_dup_mp = prepend_ether(prus, dup_dup_mp, proto); + putnext(prus->q, dup_dup_mp); + } else { + dup_dup_mp = prepend_udind(prus, dup_dup_mp, proto); + putnext(prus->q, dup_dup_mp); + } + } else { + DPRINT("ppp_urput: data to promisc q dropped\n"); + freemsg(dup_dup_mp); + } + } + } + + if (canputnext(prus->q)) { + if (prus->flags & US_RAWDATA) { + dup_mp = prepend_ether(prus, dup_mp, proto); + putnext(prus->q, dup_mp); + } else { + dup_mp = prepend_udind(prus, dup_mp, proto); + putnext(prus->q, dup_mp); + } + } else { + DPRINT("ppp_urput: data to promisc q dropped\n"); + freemsg(dup_mp); + } + } + } +} +#endif /* defined(SOL2) */ + +/* + * We simply put the message on to the associated upper control stream + * (either here or in ppplrsrv). That way we enter the perimeters + * before looking through the list of attached streams to decide which + * stream it should go up. + */ +static int +ppplrput(q, mp) + queue_t *q; + mblk_t *mp; +{ + queue_t *uq; + struct iocblk *iop; + + switch (mp->b_datap->db_type) { + case M_IOCTL: + iop = (struct iocblk *) mp->b_rptr; + iop->ioc_error = EINVAL; + mp->b_datap->db_type = M_IOCNAK; + qreply(q, mp); + return 0; + case M_FLUSH: + if (*mp->b_rptr & FLUSHR) + flushq(q, FLUSHDATA); + if (*mp->b_rptr & FLUSHW) { + *mp->b_rptr &= ~FLUSHR; + qreply(q, mp); + } else + freemsg(mp); + return 0; + } + + /* + * If we can't get the lower lock straight away, queue this one + * rather than blocking, to avoid the possibility of deadlock. + */ + if (!TRYLOCK_LOWER_R) { + putq(q, mp); + return 0; + } + + /* + * Check that we're still connected to the driver. + */ + uq = (queue_t *) q->q_ptr; + if (uq == 0) { + UNLOCK_LOWER; + DPRINT1("ppplrput: q = %x, uq = 0??\n", q); + freemsg(mp); + return 0; + } + + /* + * Try to forward the message to the put routine for the upper + * control stream for this lower stream. + * If there are already messages queued here, queue this one so + * they don't get out of order. + */ + if (queclass(mp) == QPCTL || (qsize(q) == 0 && canput(uq))) + put(uq, mp); + else + putq(q, mp); + + UNLOCK_LOWER; + return 0; +} + +static int +ppplrsrv(q) + queue_t *q; +{ + mblk_t *mp; + queue_t *uq; + + /* + * Packets get queued here for flow control reasons + * or if the lrput routine couldn't get the lower lock + * without blocking. + */ + LOCK_LOWER_R; + uq = (queue_t *) q->q_ptr; + if (uq == 0) { + UNLOCK_LOWER; + flushq(q, FLUSHALL); + DPRINT1("ppplrsrv: q = %x, uq = 0??\n", q); + return 0; + } + while ((mp = getq(q)) != 0) { + if (queclass(mp) == QPCTL || canput(uq)) + put(uq, mp); + else { + putbq(q, mp); + break; + } + } + UNLOCK_LOWER; + return 0; +} + +static int +putctl2(q, type, code, val) + queue_t *q; + int type, code, val; +{ + mblk_t *mp; + + mp = allocb(2, BPRI_HI); + if (mp == 0) + return 0; + mp->b_datap->db_type = type; + mp->b_wptr[0] = code; + mp->b_wptr[1] = val; + mp->b_wptr += 2; + putnext(q, mp); + return 1; +} + +static int +putctl4(q, type, code, val) + queue_t *q; + int type, code, val; +{ + mblk_t *mp; + + mp = allocb(4, BPRI_HI); + if (mp == 0) + return 0; + mp->b_datap->db_type = type; + mp->b_wptr[0] = code; + ((short *)mp->b_wptr)[1] = val; + mp->b_wptr += 4; + putnext(q, mp); + return 1; +} + +static void +debug_dump(q, mp) + queue_t *q; + mblk_t *mp; +{ + upperstr_t *us; + queue_t *uq, *lq; + + DPRINT("ppp upper streams:\n"); + for (us = minor_devs; us != 0; us = us->nextmn) { + uq = us->q; + DPRINT3(" %d: q=%x rlev=%d", + us->mn, uq, (uq? qsize(uq): 0)); + DPRINT3(" wlev=%d flags=0x%b", (uq? qsize(WR(uq)): 0), + us->flags, "\020\1priv\2control\3blocked\4last"); + DPRINT3(" state=%x sap=%x req_sap=%x", us->state, us->sap, + us->req_sap); + if (us->ppa == 0) + DPRINT(" ppa=?\n"); + else + DPRINT1(" ppa=%d\n", us->ppa->ppa_id); + if (us->flags & US_CONTROL) { + lq = us->lowerq; + DPRINT3(" control for %d lq=%x rlev=%d", + us->ppa_id, lq, (lq? qsize(RD(lq)): 0)); + DPRINT3(" wlev=%d mru=%d mtu=%d\n", + (lq? qsize(lq): 0), us->mru, us->mtu); + } + } + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); +} + +#ifdef FILTER_PACKETS +#include +#include +#include +#include + +#define MAX_IPHDR 128 /* max TCP/IP header size */ + + +/* The following table contains a hard-coded list of protocol/port pairs. + * Any matching packets are either discarded unconditionally, or, + * if ok_if_link_up is non-zero when a connection does not currently exist + * (i.e., they go through if the connection is present, but never initiate + * a dial-out). + * This idea came from a post by dm@garage.uun.org (David Mazieres) + */ +static struct pktfilt_tab { + int proto; + u_short port; + u_short ok_if_link_up; +} pktfilt_tab[] = { + { IPPROTO_UDP, 520, 1 }, /* RIP, ok to pass if link is up */ + { IPPROTO_UDP, 123, 1 }, /* NTP, don't keep up the link for it */ + { -1, 0, 0 } /* terminator entry has port == -1 */ +}; + + +static int +ip_hard_filter(us, mp, outbound) + upperstr_t *us; + mblk_t *mp; + int outbound; +{ + struct ip *ip; + struct pktfilt_tab *pft; + mblk_t *temp_mp; + int proto; + int len, hlen; + + + /* Note, the PPP header has already been pulled up in all cases */ + proto = PPP_PROTOCOL(mp->b_rptr); + if (us->flags & US_DBGLOG) + DPRINT3("ppp/%d: filter, proto=0x%x, out=%d\n", us->mn, proto, outbound); + + switch (proto) + { + case PPP_IP: + if ((mp->b_wptr - mp->b_rptr) == PPP_HDRLEN && mp->b_cont != 0) { + temp_mp = mp->b_cont; + len = msgdsize(temp_mp); + hlen = (len < MAX_IPHDR) ? len : MAX_IPHDR; + PULLUP(temp_mp, hlen); + if (temp_mp == 0) { + DPRINT2("ppp/%d: filter, pullup next failed, len=%d\n", + us->mn, hlen); + mp->b_cont = 0; /* PULLUP() freed the rest */ + freemsg(mp); + return 0; + } + ip = (struct ip *)mp->b_cont->b_rptr; + } + else { + len = msgdsize(mp); + hlen = (len < (PPP_HDRLEN+MAX_IPHDR)) ? len : (PPP_HDRLEN+MAX_IPHDR); + PULLUP(mp, hlen); + if (mp == 0) { + DPRINT2("ppp/%d: filter, pullup failed, len=%d\n", + us->mn, hlen); + return 0; + } + ip = (struct ip *)(mp->b_rptr + PPP_HDRLEN); + } + + /* For IP traffic, certain packets (e.g., RIP) may be either + * 1. ignored - dropped completely + * 2. will not initiate a connection, but + * will be passed if a connection is currently up. + */ + for (pft=pktfilt_tab; pft->proto != -1; pft++) { + if (ip->ip_p == pft->proto) { + switch(pft->proto) { + case IPPROTO_UDP: + if (((struct udphdr *) &((int *)ip)[ip->ip_hl])->uh_dport + == htons(pft->port)) goto endfor; + break; + case IPPROTO_TCP: + if (((struct tcphdr *) &((int *)ip)[ip->ip_hl])->th_dport + == htons(pft->port)) goto endfor; + break; + } + } + } + endfor: + if (pft->proto != -1) { + if (us->flags & US_DBGLOG) + DPRINT3("ppp/%d: found IP pkt, proto=0x%x (%d)\n", + us->mn, pft->proto, pft->port); + /* Discard if not connected, or if not pass_with_link_up */ + /* else, if link is up let go by, but don't update time */ + return pft->ok_if_link_up? -1: 0; + } + break; + } /* end switch (proto) */ + + return 1; +} +#endif /* FILTER_PACKETS */ + diff --git a/mdk-stage1/ppp/modules/ppp_ahdlc.c b/mdk-stage1/ppp/modules/ppp_ahdlc.c new file mode 100644 index 000000000..e3c4baa28 --- /dev/null +++ b/mdk-stage1/ppp/modules/ppp_ahdlc.c @@ -0,0 +1,878 @@ +/* + * ppp_ahdlc.c - STREAMS module for doing PPP asynchronous HDLC. + * + * Re-written by Adi Masputra , based on + * the original ppp_ahdlc.c + * + * Copyright (c) 2000 by Sun Microsystems, Inc. + * All rights reserved. + * + * Permission to use, copy, modify, and distribute this software and its + * documentation is hereby granted, provided that the above copyright + * notice appears in all copies. + * + * SUN MAKES NO REPRESENTATION OR WARRANTIES ABOUT THE SUITABILITY OF + * THE SOFTWARE, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED + * TO THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A + * PARTICULAR PURPOSE, OR NON-INFRINGEMENT. SUN SHALL NOT BE LIABLE FOR + * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR + * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES + * + * Copyright (c) 1994 The Australian National University. + * All rights reserved. + * + * Permission to use, copy, modify, and distribute this software and its + * documentation is hereby granted, provided that the above copyright + * notice appears in all copies. This software is provided without any + * warranty, express or implied. The Australian National University + * makes no representations about the suitability of this software for + * any purpose. + * + * IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY + * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES + * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF + * THE AUSTRALIAN NATIONAL UNIVERSITY HAS BEEN ADVISED OF THE POSSIBILITY + * OF SUCH DAMAGE. + * + * THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY + * AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS + * ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO + * OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, + * OR MODIFICATIONS. + * + * $Id: ppp_ahdlc.c 195720 2001-06-11 11:44:34Z gc $ + */ + +/* + * This file is used under Solaris 2, SVR4, SunOS 4, and Digital UNIX. + */ +#include +#include +#include +#include + +#ifdef SVR4 +#include +#include +#include +#include +#else +#include +#ifdef __osf__ +#include +#endif +#endif /* SVR4 */ + +#include +#include +#include "ppp_mod.h" + +/* + * Right now, mutex is only enabled for Solaris 2.x + */ +#if defined(SOL2) +#define USE_MUTEX +#endif /* SOL2 */ + +/* + * intpointer_t and uintpointer_t are signed and unsigned integer types + * large enough to hold any data pointer; that is, data pointers can be + * assigned into or from these integer types without losing precision. + * On recent Solaris releases, these types are defined in sys/int_types.h, + * but not on SunOS 4.x or the earlier Solaris versions. + */ +#if defined(_LP64) || defined(_I32LPx) +typedef long intpointer_t; +typedef unsigned long uintpointer_t; +#else +typedef int intpointer_t; +typedef unsigned int uintpointer_t; +#endif + +MOD_OPEN_DECL(ahdlc_open); +MOD_CLOSE_DECL(ahdlc_close); +static int ahdlc_wput __P((queue_t *, mblk_t *)); +static int ahdlc_rput __P((queue_t *, mblk_t *)); +static void ahdlc_encode __P((queue_t *, mblk_t *)); +static void ahdlc_decode __P((queue_t *, mblk_t *)); +static int msg_byte __P((mblk_t *, unsigned int)); + +#if defined(SOL2) +/* + * Don't send HDLC start flag is last transmit is within 1.5 seconds - + * FLAG_TIME is defined is microseconds + */ +#define FLAG_TIME 1500 +#define ABS(x) (x >= 0 ? x : (-x)) +#endif /* SOL2 */ + +/* + * Extract byte i of message mp + */ +#define MSG_BYTE(mp, i) ((i) < (mp)->b_wptr - (mp)->b_rptr? (mp)->b_rptr[i]: \ + msg_byte((mp), (i))) + +/* + * Is this LCP packet one we have to transmit using LCP defaults? + */ +#define LCP_USE_DFLT(mp) (1 <= (code = MSG_BYTE((mp), 4)) && code <= 7) + +/* + * Standard STREAMS declarations + */ +static struct module_info minfo = { + 0x7d23, "ppp_ahdl", 0, INFPSZ, 32768, 512 +}; + +static struct qinit rinit = { + ahdlc_rput, NULL, ahdlc_open, ahdlc_close, NULL, &minfo, NULL +}; + +static struct qinit winit = { + ahdlc_wput, NULL, NULL, NULL, NULL, &minfo, NULL +}; + +#if defined(SVR4) && !defined(SOL2) +int phdldevflag = 0; +#define ppp_ahdlcinfo phdlinfo +#endif /* defined(SVR4) && !defined(SOL2) */ + +struct streamtab ppp_ahdlcinfo = { + &rinit, /* ptr to st_rdinit */ + &winit, /* ptr to st_wrinit */ + NULL, /* ptr to st_muxrinit */ + NULL, /* ptr to st_muxwinit */ +#if defined(SUNOS4) + NULL /* ptr to ptr to st_modlist */ +#endif /* SUNOS4 */ +}; + +#if defined(SUNOS4) +int ppp_ahdlc_count = 0; /* open counter */ +#endif /* SUNOS4 */ + +/* + * Per-stream state structure + */ +typedef struct ahdlc_state { +#if defined(USE_MUTEX) + kmutex_t lock; /* lock for this structure */ +#endif /* USE_MUTEX */ + int flags; /* link flags */ + mblk_t *rx_buf; /* ptr to receive buffer */ + int rx_buf_size; /* receive buffer size */ + ushort_t infcs; /* calculated rx HDLC FCS */ + u_int32_t xaccm[8]; /* 256-bit xmit ACCM */ + u_int32_t raccm; /* 32-bit rcv ACCM */ + int mtu; /* interface MTU */ + int mru; /* link MRU */ + int unit; /* current PPP unit number */ + struct pppstat stats; /* statistic structure */ +#if defined(SOL2) + clock_t flag_time; /* time in usec between flags */ + clock_t lbolt; /* last updated lbolt */ +#endif /* SOL2 */ +} ahdlc_state_t; + +/* + * Values for flags + */ +#define ESCAPED 0x100 /* last saw escape char on input */ +#define IFLUSH 0x200 /* flushing input due to error */ + +/* + * RCV_B7_1, etc., defined in net/pppio.h, are stored in flags also. + */ +#define RCV_FLAGS (RCV_B7_1|RCV_B7_0|RCV_ODDP|RCV_EVNP) + +/* + * FCS lookup table as calculated by genfcstab. + */ +static u_short fcstab[256] = { + 0x0000, 0x1189, 0x2312, 0x329b, 0x4624, 0x57ad, 0x6536, 0x74bf, + 0x8c48, 0x9dc1, 0xaf5a, 0xbed3, 0xca6c, 0xdbe5, 0xe97e, 0xf8f7, + 0x1081, 0x0108, 0x3393, 0x221a, 0x56a5, 0x472c, 0x75b7, 0x643e, + 0x9cc9, 0x8d40, 0xbfdb, 0xae52, 0xdaed, 0xcb64, 0xf9ff, 0xe876, + 0x2102, 0x308b, 0x0210, 0x1399, 0x6726, 0x76af, 0x4434, 0x55bd, + 0xad4a, 0xbcc3, 0x8e58, 0x9fd1, 0xeb6e, 0xfae7, 0xc87c, 0xd9f5, + 0x3183, 0x200a, 0x1291, 0x0318, 0x77a7, 0x662e, 0x54b5, 0x453c, + 0xbdcb, 0xac42, 0x9ed9, 0x8f50, 0xfbef, 0xea66, 0xd8fd, 0xc974, + 0x4204, 0x538d, 0x6116, 0x709f, 0x0420, 0x15a9, 0x2732, 0x36bb, + 0xce4c, 0xdfc5, 0xed5e, 0xfcd7, 0x8868, 0x99e1, 0xab7a, 0xbaf3, + 0x5285, 0x430c, 0x7197, 0x601e, 0x14a1, 0x0528, 0x37b3, 0x263a, + 0xdecd, 0xcf44, 0xfddf, 0xec56, 0x98e9, 0x8960, 0xbbfb, 0xaa72, + 0x6306, 0x728f, 0x4014, 0x519d, 0x2522, 0x34ab, 0x0630, 0x17b9, + 0xef4e, 0xfec7, 0xcc5c, 0xddd5, 0xa96a, 0xb8e3, 0x8a78, 0x9bf1, + 0x7387, 0x620e, 0x5095, 0x411c, 0x35a3, 0x242a, 0x16b1, 0x0738, + 0xffcf, 0xee46, 0xdcdd, 0xcd54, 0xb9eb, 0xa862, 0x9af9, 0x8b70, + 0x8408, 0x9581, 0xa71a, 0xb693, 0xc22c, 0xd3a5, 0xe13e, 0xf0b7, + 0x0840, 0x19c9, 0x2b52, 0x3adb, 0x4e64, 0x5fed, 0x6d76, 0x7cff, + 0x9489, 0x8500, 0xb79b, 0xa612, 0xd2ad, 0xc324, 0xf1bf, 0xe036, + 0x18c1, 0x0948, 0x3bd3, 0x2a5a, 0x5ee5, 0x4f6c, 0x7df7, 0x6c7e, + 0xa50a, 0xb483, 0x8618, 0x9791, 0xe32e, 0xf2a7, 0xc03c, 0xd1b5, + 0x2942, 0x38cb, 0x0a50, 0x1bd9, 0x6f66, 0x7eef, 0x4c74, 0x5dfd, + 0xb58b, 0xa402, 0x9699, 0x8710, 0xf3af, 0xe226, 0xd0bd, 0xc134, + 0x39c3, 0x284a, 0x1ad1, 0x0b58, 0x7fe7, 0x6e6e, 0x5cf5, 0x4d7c, + 0xc60c, 0xd785, 0xe51e, 0xf497, 0x8028, 0x91a1, 0xa33a, 0xb2b3, + 0x4a44, 0x5bcd, 0x6956, 0x78df, 0x0c60, 0x1de9, 0x2f72, 0x3efb, + 0xd68d, 0xc704, 0xf59f, 0xe416, 0x90a9, 0x8120, 0xb3bb, 0xa232, + 0x5ac5, 0x4b4c, 0x79d7, 0x685e, 0x1ce1, 0x0d68, 0x3ff3, 0x2e7a, + 0xe70e, 0xf687, 0xc41c, 0xd595, 0xa12a, 0xb0a3, 0x8238, 0x93b1, + 0x6b46, 0x7acf, 0x4854, 0x59dd, 0x2d62, 0x3ceb, 0x0e70, 0x1ff9, + 0xf78f, 0xe606, 0xd49d, 0xc514, 0xb1ab, 0xa022, 0x92b9, 0x8330, + 0x7bc7, 0x6a4e, 0x58d5, 0x495c, 0x3de3, 0x2c6a, 0x1ef1, 0x0f78 +}; + +static u_int32_t paritytab[8] = +{ + 0x96696996, 0x69969669, 0x69969669, 0x96696996, + 0x69969669, 0x96696996, 0x96696996, 0x69969669 +}; + +/* + * STREAMS module open (entry) point + */ +MOD_OPEN(ahdlc_open) +{ + ahdlc_state_t *state; + + /* + * Return if it's already opened + */ + if (q->q_ptr) { + return 0; + } + + /* + * This can only be opened as a module + */ + if (sflag != MODOPEN) { + return 0; + } + + state = (ahdlc_state_t *) ALLOC_NOSLEEP(sizeof(ahdlc_state_t)); + if (state == 0) + OPEN_ERROR(ENOSR); + bzero((caddr_t) state, sizeof(ahdlc_state_t)); + + q->q_ptr = (caddr_t) state; + WR(q)->q_ptr = (caddr_t) state; + +#if defined(USE_MUTEX) + mutex_init(&state->lock, NULL, MUTEX_DEFAULT, NULL); + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + + state->xaccm[0] = ~0; /* escape 0x00 through 0x1f */ + state->xaccm[3] = 0x60000000; /* escape 0x7d and 0x7e */ + state->mru = PPP_MRU; /* default of 1500 bytes */ +#if defined(SOL2) + state->flag_time = drv_usectohz(FLAG_TIME); +#endif /* SOL2 */ + +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + +#if defined(SUNOS4) + ppp_ahdlc_count++; +#endif /* SUNOS4 */ + + qprocson(q); + + return 0; +} + +/* + * STREAMS module close (exit) point + */ +MOD_CLOSE(ahdlc_close) +{ + ahdlc_state_t *state; + + qprocsoff(q); + + state = (ahdlc_state_t *) q->q_ptr; + + if (state == 0) { + DPRINT("state == 0 in ahdlc_close\n"); + return 0; + } + +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + + if (state->rx_buf != 0) { + freemsg(state->rx_buf); + state->rx_buf = 0; + } + +#if defined(USE_MUTEX) + mutex_exit(&state->lock); + mutex_destroy(&state->lock); +#endif /* USE_MUTEX */ + + FREE(q->q_ptr, sizeof(ahdlc_state_t)); + q->q_ptr = NULL; + OTHERQ(q)->q_ptr = NULL; + +#if defined(SUNOS4) + if (ppp_ahdlc_count) + ppp_ahdlc_count--; +#endif /* SUNOS4 */ + + return 0; +} + +/* + * Write side put routine + */ +static int +ahdlc_wput(q, mp) + queue_t *q; + mblk_t *mp; +{ + ahdlc_state_t *state; + struct iocblk *iop; + int error; + mblk_t *np; + struct ppp_stats *psp; + + state = (ahdlc_state_t *) q->q_ptr; + if (state == 0) { + DPRINT("state == 0 in ahdlc_wput\n"); + freemsg(mp); + return 0; + } + + switch (mp->b_datap->db_type) { + case M_DATA: + /* + * A data packet - do character-stuffing and FCS, and + * send it onwards. + */ + ahdlc_encode(q, mp); + freemsg(mp); + break; + + case M_IOCTL: + iop = (struct iocblk *) mp->b_rptr; + error = EINVAL; + switch (iop->ioc_cmd) { + case PPPIO_XACCM: + if ((iop->ioc_count < sizeof(u_int32_t)) || + (iop->ioc_count > sizeof(ext_accm))) { + break; + } + if (mp->b_cont == 0) { + DPRINT1("ahdlc_wput/%d: PPPIO_XACCM b_cont = 0!\n", state->unit); + break; + } +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + bcopy((caddr_t)mp->b_cont->b_rptr, (caddr_t)state->xaccm, + iop->ioc_count); + state->xaccm[2] &= ~0x40000000; /* don't escape 0x5e */ + state->xaccm[3] |= 0x60000000; /* do escape 0x7d, 0x7e */ +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + iop->ioc_count = 0; + error = 0; + break; + + case PPPIO_RACCM: + if (iop->ioc_count != sizeof(u_int32_t)) + break; + if (mp->b_cont == 0) { + DPRINT1("ahdlc_wput/%d: PPPIO_RACCM b_cont = 0!\n", state->unit); + break; + } +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + bcopy((caddr_t)mp->b_cont->b_rptr, (caddr_t)&state->raccm, + sizeof(u_int32_t)); +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + iop->ioc_count = 0; + error = 0; + break; + + case PPPIO_GCLEAN: + np = allocb(sizeof(int), BPRI_HI); + if (np == 0) { + error = ENOSR; + break; + } + if (mp->b_cont != 0) + freemsg(mp->b_cont); + mp->b_cont = np; +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + *(int *)np->b_wptr = state->flags & RCV_FLAGS; +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + np->b_wptr += sizeof(int); + iop->ioc_count = sizeof(int); + error = 0; + break; + + case PPPIO_GETSTAT: + np = allocb(sizeof(struct ppp_stats), BPRI_HI); + if (np == 0) { + error = ENOSR; + break; + } + if (mp->b_cont != 0) + freemsg(mp->b_cont); + mp->b_cont = np; + psp = (struct ppp_stats *) np->b_wptr; + np->b_wptr += sizeof(struct ppp_stats); + bzero((caddr_t)psp, sizeof(struct ppp_stats)); + psp->p = state->stats; + iop->ioc_count = sizeof(struct ppp_stats); + error = 0; + break; + + case PPPIO_LASTMOD: + /* we knew this anyway */ + error = 0; + break; + + default: + error = -1; + break; + } + + if (error < 0) + putnext(q, mp); + else if (error == 0) { + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); + } else { + mp->b_datap->db_type = M_IOCNAK; + iop->ioc_count = 0; + iop->ioc_error = error; + qreply(q, mp); + } + break; + + case M_CTL: + switch (*mp->b_rptr) { + case PPPCTL_MTU: +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + state->mtu = ((unsigned short *)mp->b_rptr)[1]; +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + freemsg(mp); + break; + case PPPCTL_MRU: +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + state->mru = ((unsigned short *)mp->b_rptr)[1]; +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + freemsg(mp); + break; + case PPPCTL_UNIT: +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + state->unit = mp->b_rptr[1]; +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + break; + default: + putnext(q, mp); + } + break; + + default: + putnext(q, mp); + } + + return 0; +} + +/* + * Read side put routine + */ +static int +ahdlc_rput(q, mp) + queue_t *q; + mblk_t *mp; +{ + ahdlc_state_t *state; + + state = (ahdlc_state_t *) q->q_ptr; + if (state == 0) { + DPRINT("state == 0 in ahdlc_rput\n"); + freemsg(mp); + return 0; + } + + switch (mp->b_datap->db_type) { + case M_DATA: + ahdlc_decode(q, mp); + freemsg(mp); + break; + + case M_HANGUP: +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + if (state->rx_buf != 0) { + /* XXX would like to send this up for debugging */ + freemsg(state->rx_buf); + state->rx_buf = 0; + } + state->flags = IFLUSH; +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + putnext(q, mp); + break; + + default: + putnext(q, mp); + } + return 0; +} + +/* + * Extract bit c from map m, to determine if c needs to be escaped + */ +#define IN_TX_MAP(c, m) ((m)[(c) >> 5] & (1 << ((c) & 0x1f))) + +static void +ahdlc_encode(q, mp) + queue_t *q; + mblk_t *mp; +{ + ahdlc_state_t *state; + u_int32_t *xaccm, loc_xaccm[8]; + ushort_t fcs; + size_t outmp_len; + mblk_t *outmp, *tmp; + uchar_t *dp, fcs_val; + int is_lcp, code; +#if defined(SOL2) + clock_t lbolt; +#endif /* SOL2 */ + + if (msgdsize(mp) < 4) { + return; + } + + state = (ahdlc_state_t *)q->q_ptr; +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + + /* + * Allocate an output buffer large enough to handle a case where all + * characters need to be escaped + */ + outmp_len = (msgdsize(mp) << 1) + /* input block x 2 */ + (sizeof(fcs) << 2) + /* HDLC FCS x 4 */ + (sizeof(uchar_t) << 1); /* HDLC flags x 2 */ + + outmp = allocb(outmp_len, BPRI_MED); + if (outmp == NULL) { + state->stats.ppp_oerrors++; +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + putctl1(RD(q)->q_next, M_CTL, PPPCTL_OERROR); + return; + } + +#if defined(SOL2) + /* + * Check if our last transmit happenned within flag_time, using + * the system's LBOLT value in clock ticks + */ + if (drv_getparm(LBOLT, &lbolt) != -1) { + if (ABS((clock_t)lbolt - state->lbolt) > state->flag_time) { + *outmp->b_wptr++ = PPP_FLAG; + } + state->lbolt = lbolt; + } else { + *outmp->b_wptr++ = PPP_FLAG; + } +#else + /* + * If the driver below still has a message to process, skip the + * HDLC flag, otherwise, put one in the beginning + */ + if (qsize(q->q_next) == 0) { + *outmp->b_wptr++ = PPP_FLAG; + } +#endif + + /* + * All control characters must be escaped for LCP packets with code + * values between 1 (Conf-Req) and 7 (Code-Rej). + */ + is_lcp = ((MSG_BYTE(mp, 0) == PPP_ALLSTATIONS) && + (MSG_BYTE(mp, 1) == PPP_UI) && + (MSG_BYTE(mp, 2) == (PPP_LCP >> 8)) && + (MSG_BYTE(mp, 3) == (PPP_LCP & 0xff)) && + LCP_USE_DFLT(mp)); + + xaccm = state->xaccm; + if (is_lcp) { + bcopy((caddr_t)state->xaccm, (caddr_t)loc_xaccm, sizeof(loc_xaccm)); + loc_xaccm[0] = ~0; /* force escape on 0x00 through 0x1f */ + xaccm = loc_xaccm; + } + + fcs = PPP_INITFCS; /* Initial FCS is 0xffff */ + + /* + * Process this block and the rest (if any) attached to the this one + */ + for (tmp = mp; tmp; tmp = tmp->b_cont) { + if (tmp->b_datap->db_type == M_DATA) { + for (dp = tmp->b_rptr; dp < tmp->b_wptr; dp++) { + fcs = PPP_FCS(fcs, *dp); + if (IN_TX_MAP(*dp, xaccm)) { + *outmp->b_wptr++ = PPP_ESCAPE; + *outmp->b_wptr++ = *dp ^ PPP_TRANS; + } else { + *outmp->b_wptr++ = *dp; + } + } + } else { + continue; /* skip if db_type is something other than M_DATA */ + } + } + + /* + * Append the HDLC FCS, making sure that escaping is done on any + * necessary bytes + */ + fcs_val = (fcs ^ 0xffff) & 0xff; + if (IN_TX_MAP(fcs_val, xaccm)) { + *outmp->b_wptr++ = PPP_ESCAPE; + *outmp->b_wptr++ = fcs_val ^ PPP_TRANS; + } else { + *outmp->b_wptr++ = fcs_val; + } + + fcs_val = ((fcs ^ 0xffff) >> 8) & 0xff; + if (IN_TX_MAP(fcs_val, xaccm)) { + *outmp->b_wptr++ = PPP_ESCAPE; + *outmp->b_wptr++ = fcs_val ^ PPP_TRANS; + } else { + *outmp->b_wptr++ = fcs_val; + } + + /* + * And finally, append the HDLC flag, and send it away + */ + *outmp->b_wptr++ = PPP_FLAG; + + state->stats.ppp_obytes += msgdsize(outmp); + state->stats.ppp_opackets++; + +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ + + putnext(q, outmp); + return; +} + +/* + * Checks the 32-bit receive ACCM to see if the byte needs un-escaping + */ +#define IN_RX_MAP(c, m) ((((unsigned int) (uchar_t) (c)) < 0x20) && \ + (m) & (1 << (c))) + + +/* + * Process received characters. + */ +static void +ahdlc_decode(q, mp) + queue_t *q; + mblk_t *mp; +{ + ahdlc_state_t *state; + mblk_t *om; + uchar_t *dp; + ushort_t fcs; +#if defined(SOL2) + mblk_t *zmp; +#endif /* SOL2 */ + +#if defined(SOL2) + /* + * In case the driver (or something below) doesn't send + * data upstream in one message block, concatenate everything + */ + if (!((mp->b_wptr - mp->b_rptr == msgdsize(mp)) && + ((intpointer_t)mp->b_rptr % sizeof(intpointer_t) == 0))) { + + zmp = msgpullup(mp, -1); + freemsg(mp); + mp = zmp; + if (mp == 0) + return; + } +#endif /* SOL2 */ + + state = (ahdlc_state_t *) q->q_ptr; + +#if defined(USE_MUTEX) + mutex_enter(&state->lock); +#endif /* USE_MUTEX */ + + state->stats.ppp_ibytes += msgdsize(mp); + + for (dp = mp->b_rptr; dp < mp->b_wptr; dp++) { + + /* + * This should detect the lack of 8-bit communication channel + * which is necessary for PPP to work. In addition, it also + * checks on the parity. + */ + if (*dp & 0x80) + state->flags |= RCV_B7_1; + else + state->flags |= RCV_B7_0; + + if (paritytab[*dp >> 5] & (1 << (*dp & 0x1f))) + state->flags |= RCV_ODDP; + else + state->flags |= RCV_EVNP; + + /* + * So we have a HDLC flag ... + */ + if (*dp == PPP_FLAG) { + + /* + * If we think that it marks the beginning of the frame, + * then continue to process the next octects + */ + if ((state->flags & IFLUSH) || + (state->rx_buf == 0) || + (msgdsize(state->rx_buf) == 0)) { + + state->flags &= ~IFLUSH; + continue; + } + + /* + * We get here because the above condition isn't true, + * in which case the HDLC flag was there to mark the end + * of the frame (or so we think) + */ + om = state->rx_buf; + + if (state->infcs == PPP_GOODFCS) { + state->stats.ppp_ipackets++; + adjmsg(om, -PPP_FCSLEN); + putnext(q, om); + } else { + DPRINT2("ppp%d: bad fcs (len=%d)\n", + state->unit, msgdsize(state->rx_buf)); + freemsg(state->rx_buf); + state->flags &= ~(IFLUSH | ESCAPED); + state->stats.ppp_ierrors++; + putctl1(q->q_next, M_CTL, PPPCTL_IERROR); + } + + state->rx_buf = 0; + continue; + } + + if (state->flags & IFLUSH) { + continue; + } + + /* + * Allocate a receive buffer, large enough to store a frame (after + * un-escaping) of at least 1500 octets. If MRU is negotiated to + * be more than the default, then allocate that much. In addition, + * we add an extra 32-bytes for a fudge factor + */ + if (state->rx_buf == 0) { + state->rx_buf_size = (state->mru < PPP_MRU ? PPP_MRU : state->mru); + state->rx_buf_size += (sizeof(u_int32_t) << 3); + state->rx_buf = allocb(state->rx_buf_size, BPRI_MED); + + /* + * If allocation fails, try again on the next frame + */ + if (state->rx_buf == 0) { + state->flags |= IFLUSH; + continue; + } + state->flags &= ~(IFLUSH | ESCAPED); + state->infcs = PPP_INITFCS; + } + + if (*dp == PPP_ESCAPE) { + state->flags |= ESCAPED; + continue; + } + + /* + * Make sure we un-escape the necessary characters, as well as the + * ones in our receive async control character map + */ + if (state->flags & ESCAPED) { + *dp ^= PPP_TRANS; + state->flags &= ~ESCAPED; + } else if (IN_RX_MAP(*dp, state->raccm)) + continue; + + /* + * Unless the peer lied to us about the negotiated MRU, we should + * never get a frame which is too long. If it happens, toss it away + * and grab the next incoming one + */ + if (msgdsize(state->rx_buf) < state->rx_buf_size) { + state->infcs = PPP_FCS(state->infcs, *dp); + *state->rx_buf->b_wptr++ = *dp; + } else { + DPRINT2("ppp%d: frame too long (%d)\n", + state->unit, msgdsize(state->rx_buf)); + freemsg(state->rx_buf); + state->rx_buf = 0; + state->flags |= IFLUSH; + } + } + +#if defined(USE_MUTEX) + mutex_exit(&state->lock); +#endif /* USE_MUTEX */ +} + +static int +msg_byte(mp, i) + mblk_t *mp; + unsigned int i; +{ + while (mp != 0 && i >= mp->b_wptr - mp->b_rptr) + mp = mp->b_cont; + if (mp == 0) + return -1; + return mp->b_rptr[i]; +} diff --git a/mdk-stage1/ppp/modules/ppp_comp.c b/mdk-stage1/ppp/modules/ppp_comp.c new file mode 100644 index 000000000..941e9d8c5 --- /dev/null +++ b/mdk-stage1/ppp/modules/ppp_comp.c @@ -0,0 +1,1126 @@ +/* + * ppp_comp.c - STREAMS module for kernel-level compression and CCP support. + * + * Copyright (c) 1994 The Australian National University. + * All rights reserved. + * + * Permission to use, copy, modify, and distribute this software and its + * documentation is hereby granted, provided that the above copyright + * notice appears in all copies. This software is provided without any + * warranty, express or implied. The Australian National University + * makes no representations about the suitability of this software for + * any purpose. + * + * IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY + * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES + * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF + * THE AUSTRALIAN NATIONAL UNIVERSITY HAS BEEN ADVISED OF THE POSSIBILITY + * OF SUCH DAMAGE. + * + * THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES, + * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY + * AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS + * ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO + * OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, + * OR MODIFICATIONS. + * + * $Id: ppp_comp.c 195720 2001-06-11 11:44:34Z gc $ + */ + +/* + * This file is used under SVR4, Solaris 2, SunOS 4, and Digital UNIX. + */ + +#include +#include +#include +#include + +#ifdef SVR4 +#include +#include +#include +#else +#include +#ifdef __osf__ +#include +#endif +#endif /* SVR4 */ + +#include +#include +#include "ppp_mod.h" + +#ifdef __osf__ +#include +#include +#endif + +#include +#include +#include +#include + +#define PACKETPTR mblk_t * +#include + +MOD_OPEN_DECL(ppp_comp_open); +MOD_CLOSE_DECL(ppp_comp_close); +static int ppp_comp_rput __P((queue_t *, mblk_t *)); +static int ppp_comp_rsrv __P((queue_t *)); +static int ppp_comp_wput __P((queue_t *, mblk_t *)); +static int ppp_comp_wsrv __P((queue_t *)); +static void ppp_comp_ccp __P((queue_t *, mblk_t *, int)); +static int msg_byte __P((mblk_t *, unsigned int)); + +/* Extract byte i of message mp. */ +#define MSG_BYTE(mp, i) ((i) < (mp)->b_wptr - (mp)->b_rptr? (mp)->b_rptr[i]: \ + msg_byte((mp), (i))) + +/* Is this LCP packet one we have to transmit using LCP defaults? */ +#define LCP_USE_DFLT(mp) (1 <= (code = MSG_BYTE((mp), 4)) && code <= 7) + +#define PPP_COMP_ID 0xbadf +static struct module_info minfo = { +#ifdef PRIOQ + PPP_COMP_ID, "ppp_comp", 0, INFPSZ, 16512, 16384, +#else + PPP_COMP_ID, "ppp_comp", 0, INFPSZ, 16384, 4096, +#endif +}; + +static struct qinit r_init = { + ppp_comp_rput, ppp_comp_rsrv, ppp_comp_open, ppp_comp_close, + NULL, &minfo, NULL +}; + +static struct qinit w_init = { + ppp_comp_wput, ppp_comp_wsrv, NULL, NULL, NULL, &minfo, NULL +}; + +#if defined(SVR4) && !defined(SOL2) +int pcmpdevflag = 0; +#define ppp_compinfo pcmpinfo +#endif +struct streamtab ppp_compinfo = { + &r_init, &w_init, NULL, NULL +}; + +int ppp_comp_count; /* number of module instances in use */ + +#ifdef __osf__ + +static void ppp_comp_alloc __P((comp_state_t *)); +typedef struct memreq { + unsigned char comp_opts[20]; + int cmd; + int thread_status; + char *returned_mem; +} memreq_t; + +#endif + +typedef struct comp_state { + int flags; + int mru; + int mtu; + int unit; + struct compressor *xcomp; + void *xstate; + struct compressor *rcomp; + void *rstate; + struct vjcompress vj_comp; + int vj_last_ierrors; + struct pppstat stats; +#ifdef __osf__ + memreq_t memreq; + thread_t thread; +#endif +} comp_state_t; + + +#ifdef __osf__ +extern task_t first_task; +#endif + +/* Bits in flags are as defined in pppio.h. */ +#define CCP_ERR (CCP_ERROR | CCP_FATALERROR) +#define LAST_MOD 0x1000000 /* no ppp modules below us */ +#define DBGLOG 0x2000000 /* log debugging stuff */ + +#define MAX_IPHDR 128 /* max TCP/IP header size */ +#define MAX_VJHDR 20 /* max VJ compressed header size (?) */ + +#undef MIN /* just in case */ +#define MIN(a, b) ((a) < (b)? (a): (b)) + +/* + * List of compressors we know about. + */ + +#if DO_BSD_COMPRESS +extern struct compressor ppp_bsd_compress; +#endif +#if DO_DEFLATE +extern struct compressor ppp_deflate, ppp_deflate_draft; +#endif + +struct compressor *ppp_compressors[] = { +#if DO_BSD_COMPRESS + &ppp_bsd_compress, +#endif +#if DO_DEFLATE + &ppp_deflate, + &ppp_deflate_draft, +#endif + NULL +}; + +/* + * STREAMS module entry points. + */ +MOD_OPEN(ppp_comp_open) +{ + comp_state_t *cp; +#ifdef __osf__ + thread_t thread; +#endif + + if (q->q_ptr == NULL) { + cp = (comp_state_t *) ALLOC_SLEEP(sizeof(comp_state_t)); + if (cp == NULL) + OPEN_ERROR(ENOSR); + bzero((caddr_t)cp, sizeof(comp_state_t)); + WR(q)->q_ptr = q->q_ptr = (caddr_t) cp; + cp->mru = PPP_MRU; + cp->mtu = PPP_MTU; + cp->xstate = NULL; + cp->rstate = NULL; + vj_compress_init(&cp->vj_comp, -1); +#ifdef __osf__ + if (!(thread = kernel_thread_w_arg(first_task, ppp_comp_alloc, (void *)cp))) + OPEN_ERROR(ENOSR); + cp->thread = thread; +#endif + ++ppp_comp_count; + qprocson(q); + } + return 0; +} + +MOD_CLOSE(ppp_comp_close) +{ + comp_state_t *cp; + + qprocsoff(q); + cp = (comp_state_t *) q->q_ptr; + if (cp != NULL) { + if (cp->xstate != NULL) + (*cp->xcomp->comp_free)(cp->xstate); + if (cp->rstate != NULL) + (*cp->rcomp->decomp_free)(cp->rstate); +#ifdef __osf__ + if (!cp->thread) + printf("ppp_comp_close: NULL thread!\n"); + else + thread_terminate(cp->thread); +#endif + FREE(cp, sizeof(comp_state_t)); + q->q_ptr = NULL; + OTHERQ(q)->q_ptr = NULL; + --ppp_comp_count; + } + return 0; +} + +#ifdef __osf__ + +/* thread for calling back to a compressor's memory allocator + * Needed for Digital UNIX since it's VM can't handle requests + * for large amounts of memory without blocking. The thread + * provides a context in which we can call a memory allocator + * that may block. + */ +static void +ppp_comp_alloc(comp_state_t *cp) +{ + int len, cmd; + unsigned char *compressor_options; + thread_t thread; + void *(*comp_allocator)(); + + +#if defined(MAJOR_VERSION) && (MAJOR_VERSION <= 2) + + /* In 2.x and earlier the argument gets passed + * in the thread structure itself. Yuck. + */ + thread = current_thread(); + cp = thread->reply_port; + thread->reply_port = PORT_NULL; + +#endif + + for (;;) { + assert_wait((vm_offset_t)&cp->memreq.thread_status, TRUE); + thread_block(); + + if (thread_should_halt(current_thread())) + thread_halt_self(); + cmd = cp->memreq.cmd; + compressor_options = &cp->memreq.comp_opts[0]; + len = compressor_options[1]; + if (cmd == PPPIO_XCOMP) { + cp->memreq.returned_mem = cp->xcomp->comp_alloc(compressor_options, len); + if (!cp->memreq.returned_mem) { + cp->memreq.thread_status = ENOSR; + } else { + cp->memreq.thread_status = 0; + } + } else { + cp->memreq.returned_mem = cp->rcomp->decomp_alloc(compressor_options, len); + if (!cp->memreq.returned_mem) { + cp->memreq.thread_status = ENOSR; + } else { + cp->memreq.thread_status = 0; + } + } + } +} + +#endif /* __osf__ */ + +/* here's the deal with memory allocation under Digital UNIX. + * Some other may also benefit from this... + * We can't ask for huge chunks of memory in a context where + * the caller can't be put to sleep (like, here.) The alloc + * is likely to fail. Instead we do this: the first time we + * get called, kick off a thread to do the allocation. Return + * immediately to the caller with EAGAIN, as an indication that + * they should send down the ioctl again. By the time the + * second call comes in it's likely that the memory allocation + * thread will have returned with the requested memory. We will + * continue to return EAGAIN however until the thread has completed. + * When it has, we return zero (and the memory) if the allocator + * was successful and ENOSR otherwise. + * + * Callers of the RCOMP and XCOMP ioctls are encouraged (but not + * required) to loop for some number of iterations with a small + * delay in the loop body (for instance a 1/10-th second "sleep" + * via select.) + */ +static int +ppp_comp_wput(q, mp) + queue_t *q; + mblk_t *mp; +{ + struct iocblk *iop; + comp_state_t *cp; + int error, len, n; + int flags, mask; + mblk_t *np; + struct compressor **comp; + struct ppp_stats *psp; + struct ppp_comp_stats *csp; + unsigned char *opt_data; + int nxslots, nrslots; + + cp = (comp_state_t *) q->q_ptr; + if (cp == 0) { + DPRINT("cp == 0 in ppp_comp_wput\n"); + freemsg(mp); + return 0; + } + + switch (mp->b_datap->db_type) { + + case M_DATA: + putq(q, mp); + break; + + case M_IOCTL: + iop = (struct iocblk *) mp->b_rptr; + error = EINVAL; + switch (iop->ioc_cmd) { + + case PPPIO_CFLAGS: + /* set/get CCP state */ + if (iop->ioc_count != 2 * sizeof(int)) + break; + if (mp->b_cont == 0) { + DPRINT1("ppp_comp_wput/%d: PPPIO_CFLAGS b_cont = 0!\n", cp->unit); + break; + } + flags = ((int *) mp->b_cont->b_rptr)[0]; + mask = ((int *) mp->b_cont->b_rptr)[1]; + cp->flags = (cp->flags & ~mask) | (flags & mask); + if ((mask & CCP_ISOPEN) && (flags & CCP_ISOPEN) == 0) { + if (cp->xstate != NULL) { + (*cp->xcomp->comp_free)(cp->xstate); + cp->xstate = NULL; + } + if (cp->rstate != NULL) { + (*cp->rcomp->decomp_free)(cp->rstate); + cp->rstate = NULL; + } + cp->flags &= ~CCP_ISUP; + } + error = 0; + iop->ioc_count = sizeof(int); + ((int *) mp->b_cont->b_rptr)[0] = cp->flags; + mp->b_cont->b_wptr = mp->b_cont->b_rptr + sizeof(int); + break; + + case PPPIO_VJINIT: + /* + * Initialize VJ compressor/decompressor + */ + if (iop->ioc_count != 2) + break; + if (mp->b_cont == 0) { + DPRINT1("ppp_comp_wput/%d: PPPIO_VJINIT b_cont = 0!\n", cp->unit); + break; + } + nxslots = mp->b_cont->b_rptr[0] + 1; + nrslots = mp->b_cont->b_rptr[1] + 1; + if (nxslots > MAX_STATES || nrslots > MAX_STATES) + break; + vj_compress_init(&cp->vj_comp, nxslots); + cp->vj_last_ierrors = cp->stats.ppp_ierrors; + error = 0; + iop->ioc_count = 0; + break; + + case PPPIO_XCOMP: + case PPPIO_RCOMP: + if (iop->ioc_count <= 0) + break; + if (mp->b_cont == 0) { + DPRINT1("ppp_comp_wput/%d: PPPIO_[XR]COMP b_cont = 0!\n", cp->unit); + break; + } + opt_data = mp->b_cont->b_rptr; + len = mp->b_cont->b_wptr - opt_data; + if (len > iop->ioc_count) + len = iop->ioc_count; + if (opt_data[1] < 2 || opt_data[1] > len) + break; + for (comp = ppp_compressors; *comp != NULL; ++comp) + if ((*comp)->compress_proto == opt_data[0]) { + /* here's the handler! */ + error = 0; +#ifndef __osf__ + if (iop->ioc_cmd == PPPIO_XCOMP) { + /* A previous call may have fetched memory for a compressor + * that's now being retired or reset. Free it using it's + * mechanism for freeing stuff. + */ + if (cp->xstate != NULL) { + (*cp->xcomp->comp_free)(cp->xstate); + cp->xstate = NULL; + } + cp->xcomp = *comp; + cp->xstate = (*comp)->comp_alloc(opt_data, len); + if (cp->xstate == NULL) + error = ENOSR; + } else { + if (cp->rstate != NULL) { + (*cp->rcomp->decomp_free)(cp->rstate); + cp->rstate = NULL; + } + cp->rcomp = *comp; + cp->rstate = (*comp)->decomp_alloc(opt_data, len); + if (cp->rstate == NULL) + error = ENOSR; + } +#else + if ((error = cp->memreq.thread_status) != EAGAIN) + if (iop->ioc_cmd == PPPIO_XCOMP) { + if (cp->xstate) { + (*cp->xcomp->comp_free)(cp->xstate); + cp->xstate = 0; + } + /* sanity check for compressor options + */ + if (sizeof (cp->memreq.comp_opts) < len) { + printf("can't handle options for compressor %d (%d)\n", opt_data[0], + opt_data[1]); + cp->memreq.thread_status = ENOSR; + cp->memreq.returned_mem = 0; + } + /* fill in request for the thread and kick it off + */ + if (cp->memreq.thread_status == 0 && !cp->memreq.returned_mem) { + bcopy(opt_data, cp->memreq.comp_opts, len); + cp->memreq.cmd = PPPIO_XCOMP; + cp->xcomp = *comp; + error = cp->memreq.thread_status = EAGAIN; + thread_wakeup((vm_offset_t)&cp->memreq.thread_status); + } else { + cp->xstate = cp->memreq.returned_mem; + cp->memreq.returned_mem = 0; + cp->memreq.thread_status = 0; + } + } else { + if (cp->rstate) { + (*cp->rcomp->decomp_free)(cp->rstate); + cp->rstate = NULL; + } + if (sizeof (cp->memreq.comp_opts) < len) { + printf("can't handle options for compressor %d (%d)\n", opt_data[0], + opt_data[1]); + cp->memreq.thread_status = ENOSR; + cp->memreq.returned_mem = 0; + } + if (cp->memreq.thread_status == 0 && !cp->memreq.returned_mem) { + bcopy(opt_data, cp->memreq.comp_opts, len); + cp->memreq.cmd = PPPIO_RCOMP; + cp->rcomp = *comp; + error = cp->memreq.thread_status = EAGAIN; + thread_wakeup((vm_offset_t)&cp->memreq.thread_status); + } else { + cp->rstate = cp->memreq.returned_mem; + cp->memreq.returned_mem = 0; + cp->memreq.thread_status = 0; + } + } +#endif + break; + } + iop->ioc_count = 0; + break; + + case PPPIO_GETSTAT: + if ((cp->flags & LAST_MOD) == 0) { + error = -1; /* let the ppp_ahdl module handle it */ + break; + } + np = allocb(sizeof(struct ppp_stats), BPRI_HI); + if (np == 0) { + error = ENOSR; + break; + } + if (mp->b_cont != 0) + freemsg(mp->b_cont); + mp->b_cont = np; + psp = (struct ppp_stats *) np->b_wptr; + np->b_wptr += sizeof(struct ppp_stats); + iop->ioc_count = sizeof(struct ppp_stats); + psp->p = cp->stats; + psp->vj = cp->vj_comp.stats; + error = 0; + break; + + case PPPIO_GETCSTAT: + np = allocb(sizeof(struct ppp_comp_stats), BPRI_HI); + if (np == 0) { + error = ENOSR; + break; + } + if (mp->b_cont != 0) + freemsg(mp->b_cont); + mp->b_cont = np; + csp = (struct ppp_comp_stats *) np->b_wptr; + np->b_wptr += sizeof(struct ppp_comp_stats); + iop->ioc_count = sizeof(struct ppp_comp_stats); + bzero((caddr_t)csp, sizeof(struct ppp_comp_stats)); + if (cp->xstate != 0) + (*cp->xcomp->comp_stat)(cp->xstate, &csp->c); + if (cp->rstate != 0) + (*cp->rcomp->decomp_stat)(cp->rstate, &csp->d); + error = 0; + break; + + case PPPIO_DEBUG: + if (iop->ioc_count != sizeof(int)) + break; + if (mp->b_cont == 0) { + DPRINT1("ppp_comp_wput/%d: PPPIO_DEBUG b_cont = 0!\n", cp->unit); + break; + } + n = *(int *)mp->b_cont->b_rptr; + if (n == PPPDBG_LOG + PPPDBG_COMP) { + DPRINT1("ppp_comp%d: debug log enabled\n", cp->unit); + cp->flags |= DBGLOG; + error = 0; + iop->ioc_count = 0; + } else { + error = -1; + } + break; + + case PPPIO_LASTMOD: + cp->flags |= LAST_MOD; + error = 0; + break; + + default: + error = -1; + break; + } + + if (error < 0) + putnext(q, mp); + else if (error == 0) { + mp->b_datap->db_type = M_IOCACK; + qreply(q, mp); + } else { + mp->b_datap->db_type = M_IOCNAK; + iop->ioc_error = error; + iop->ioc_count = 0; + qreply(q, mp); + } + break; + + case M_CTL: + switch (*mp->b_rptr) { + case PPPCTL_MTU: + cp->mtu = ((unsigned short *)mp->b_rptr)[1]; + break; + case PPPCTL_MRU: + cp->mru = ((unsigned short *)mp->b_rptr)[1]; + break; + case PPPCTL_UNIT: + cp->unit = mp->b_rptr[1]; + break; + } + putnext(q, mp); + break; + + default: + putnext(q, mp); + } + + return 0; +} + +static int +ppp_comp_wsrv(q) + queue_t *q; +{ + mblk_t *mp, *cmp = NULL; + comp_state_t *cp; + int len, proto, type, hlen, code; + struct ip *ip; + unsigned char *vjhdr, *dp; + + cp = (comp_state_t *) q->q_ptr; + if (cp == 0) { + DPRINT("cp == 0 in ppp_comp_wsrv\n"); + return 0; + } + + while ((mp = getq(q)) != 0) { + /* assert(mp->b_datap->db_type == M_DATA) */ +#ifdef PRIOQ + if (!bcanputnext(q,mp->b_band)) +#else + if (!canputnext(q)) +#endif PRIOQ + { + putbq(q, mp); + break; + } + + /* + * First check the packet length and work out what the protocol is. + */ + len = msgdsize(mp); + if (len < PPP_HDRLEN) { + DPRINT1("ppp_comp_wsrv: bogus short packet (%d)\n", len); + freemsg(mp); + cp->stats.ppp_oerrors++; + putctl1(RD(q)->q_next, M_CTL, PPPCTL_OERROR); + continue; + } + proto = (MSG_BYTE(mp, 2) << 8) + MSG_BYTE(mp, 3); + + /* + * Make sure we've got enough data in the first mblk + * and that we are its only user. + */ + if (proto == PPP_CCP) + hlen = len; + else if (proto == PPP_IP) + hlen = PPP_HDRLEN + MAX_IPHDR; + else + hlen = PPP_HDRLEN; + if (hlen > len) + hlen = len; + if (mp->b_wptr < mp->b_rptr + hlen || mp->b_datap->db_ref > 1) { + PULLUP(mp, hlen); + if (mp == 0) { + DPRINT1("ppp_comp_wsrv: pullup failed (%d)\n", hlen); + cp->stats.ppp_oerrors++; + putctl1(RD(q)->q_next, M_CTL, PPPCTL_OERROR); + continue; + } + } + + /* + * Do VJ compression if requested. + */ + if (proto == PPP_IP && (cp->flags & COMP_VJC)) { + ip = (struct ip *) (mp->b_rptr + PPP_HDRLEN); + if (ip->ip_p == IPPROTO_TCP) { + type = vj_compress_tcp(ip, len - PPP_HDRLEN, &cp->vj_comp, + (cp->flags & COMP_VJCCID), &vjhdr); + switch (type) { + case TYPE_UNCOMPRESSED_TCP: + mp->b_rptr[3] = proto = PPP_VJC_UNCOMP; + break; + case TYPE_COMPRESSED_TCP: + dp = vjhdr - PPP_HDRLEN; + dp[1] = mp->b_rptr[1]; /* copy control field */ + dp[0] = mp->b_rptr[0]; /* copy address field */ + dp[2] = 0; /* set protocol field */ + dp[3] = proto = PPP_VJC_COMP; + mp->b_rptr = dp; + break; + } + } + } + + /* + * Do packet compression if enabled. + */ + if (proto == PPP_CCP) + ppp_comp_ccp(q, mp, 0); + else if (proto != PPP_LCP && (cp->flags & CCP_COMP_RUN) + && cp->xstate != NULL) { + len = msgdsize(mp); + (*cp->xcomp->compress)(cp->xstate, &cmp, mp, len, + (cp->flags & CCP_ISUP? cp->mtu + PPP_HDRLEN: 0)); + if (cmp != NULL) { +#ifdef PRIOQ + cmp->b_band=mp->b_band; +#endif PRIOQ + freemsg(mp); + mp = cmp; + } + } + + /* + * Do address/control and protocol compression if enabled. + */ + if ((cp->flags & COMP_AC) + && !(proto == PPP_LCP && LCP_USE_DFLT(mp))) { + mp->b_rptr += 2; /* drop the address & ctrl fields */ + if (proto < 0x100 && (cp->flags & COMP_PROT)) + ++mp->b_rptr; /* drop the high protocol byte */ + } else if (proto < 0x100 && (cp->flags & COMP_PROT)) { + /* shuffle up the address & ctrl fields */ + mp->b_rptr[2] = mp->b_rptr[1]; + mp->b_rptr[1] = mp->b_rptr[0]; + ++mp->b_rptr; + } + + cp->stats.ppp_opackets++; + cp->stats.ppp_obytes += msgdsize(mp); + putnext(q, mp); + } + + return 0; +} + +static int +ppp_comp_rput(q, mp) + queue_t *q; + mblk_t *mp; +{ + comp_state_t *cp; + struct iocblk *iop; + struct ppp_stats *psp; + + cp = (comp_state_t *) q->q_ptr; + if (cp == 0) { + DPRINT("cp == 0 in ppp_comp_rput\n"); + freemsg(mp); + return 0; + } + + switch (mp->b_datap->db_type) { + + case M_DATA: + putq(q, mp); + break; + + case M_IOCACK: + iop = (struct iocblk *) mp->b_rptr; + switch (iop->ioc_cmd) { + case PPPIO_GETSTAT: + /* + * Catch this on the way back from the ppp_ahdl module + * so we can fill in the VJ stats. + */ + if (mp->b_cont == 0 || iop->ioc_count != sizeof(struct ppp_stats)) + break; + psp = (struct ppp_stats *) mp->b_cont->b_rptr; + psp->vj = cp->vj_comp.stats; + break; + } + putnext(q, mp); + break; + + case M_CTL: + switch (mp->b_rptr[0]) { + case PPPCTL_IERROR: + ++cp->stats.ppp_ierrors; + break; + case PPPCTL_OERROR: + ++cp->stats.ppp_oerrors; + break; + } + putnext(q, mp); + break; + + default: + putnext(q, mp); + } + + return 0; +} + +static int +ppp_comp_rsrv(q) + queue_t *q; +{ + int proto, rv, i; + mblk_t *mp, *dmp = NULL, *np; + uchar_t *dp, *iphdr; + comp_state_t *cp; + int len, hlen, vjlen; + u_int iphlen; + + cp = (comp_state_t *) q->q_ptr; + if (cp == 0) { + DPRINT("cp == 0 in ppp_comp_rsrv\n"); + return 0; + } + + while ((mp = getq(q)) != 0) { + /* assert(mp->b_datap->db_type == M_DATA) */ + if (!canputnext(q)) { + putbq(q, mp); + break; + } + + len = msgdsize(mp); + cp->stats.ppp_ibytes += len; + cp->stats.ppp_ipackets++; + + /* + * First work out the protocol and where the PPP header ends. + */ + i = 0; + proto = MSG_BYTE(mp, 0); + if (proto == PPP_ALLSTATIONS) { + i = 2; + proto = MSG_BYTE(mp, 2); + } + if ((proto & 1) == 0) { + ++i; + proto = (proto << 8) + MSG_BYTE(mp, i); + } + hlen = i + 1; + + /* + * Now reconstruct a complete, contiguous PPP header at the + * start of the packet. + */ + if (hlen < ((cp->flags & DECOMP_AC)? 0: 2) + + ((cp->flags & DECOMP_PROT)? 1: 2)) { + /* count these? */ + goto bad; + } + if (mp->b_rptr + hlen > mp->b_wptr) { + adjmsg(mp, hlen); /* XXX check this call */ + hlen = 0; + } + if (hlen != PPP_HDRLEN) { + /* + * We need to put some bytes on the front of the packet + * to make a full-length PPP header. + * If we can put them in *mp, we do, otherwise we + * tack another mblk on the front. + * XXX we really shouldn't need to carry around + * the address and control at this stage. + */ + dp = mp->b_rptr + hlen - PPP_HDRLEN; + if (dp < mp->b_datap->db_base || mp->b_datap->db_ref > 1) { + np = allocb(PPP_HDRLEN, BPRI_MED); + if (np == 0) + goto bad; + np->b_cont = mp; + mp->b_rptr += hlen; + mp = np; + dp = mp->b_wptr; + mp->b_wptr += PPP_HDRLEN; + } else + mp->b_rptr = dp; + + dp[0] = PPP_ALLSTATIONS; + dp[1] = PPP_UI; + dp[2] = proto >> 8; + dp[3] = proto; + } + + /* + * Now see if we have a compressed packet to decompress, + * or a CCP packet to take notice of. + */ + proto = PPP_PROTOCOL(mp->b_rptr); + if (proto == PPP_CCP) { + len = msgdsize(mp); + if (mp->b_wptr < mp->b_rptr + len) { + PULLUP(mp, len); + if (mp == 0) + goto bad; + } + ppp_comp_ccp(q, mp, 1); + } else if (proto == PPP_COMP) { + if ((cp->flags & CCP_ISUP) + && (cp->flags & CCP_DECOMP_RUN) && cp->rstate + && (cp->flags & CCP_ERR) == 0) { + rv = (*cp->rcomp->decompress)(cp->rstate, mp, &dmp); + switch (rv) { + case DECOMP_OK: + freemsg(mp); + mp = dmp; + if (mp == NULL) { + /* no error, but no packet returned either. */ + continue; + } + break; + case DECOMP_ERROR: + cp->flags |= CCP_ERROR; + ++cp->stats.ppp_ierrors; + putctl1(q->q_next, M_CTL, PPPCTL_IERROR); + break; + case DECOMP_FATALERROR: + cp->flags |= CCP_FATALERROR; + ++cp->stats.ppp_ierrors; + putctl1(q->q_next, M_CTL, PPPCTL_IERROR); + break; + } + } + } else if (cp->rstate && (cp->flags & CCP_DECOMP_RUN)) { + (*cp->rcomp->incomp)(cp->rstate, mp); + } + + /* + * Now do VJ decompression. + */ + proto = PPP_PROTOCOL(mp->b_rptr); + if (proto == PPP_VJC_COMP || proto == PPP_VJC_UNCOMP) { + len = msgdsize(mp) - PPP_HDRLEN; + if ((cp->flags & DECOMP_VJC) == 0 || len <= 0) + goto bad; + + /* + * Advance past the ppp header. + * Here we assume that the whole PPP header is in the first mblk. + */ + np = mp; + dp = np->b_rptr + PPP_HDRLEN; + if (dp >= mp->b_wptr) { + np = np->b_cont; + dp = np->b_rptr; + } + + /* + * Make sure we have sufficient contiguous data at this point. + */ + hlen = (proto == PPP_VJC_COMP)? MAX_VJHDR: MAX_IPHDR; + if (hlen > len) + hlen = len; + if (np->b_wptr < dp + hlen || np->b_datap->db_ref > 1) { + PULLUP(mp, hlen + PPP_HDRLEN); + if (mp == 0) + goto bad; + np = mp; + dp = np->b_rptr + PPP_HDRLEN; + } + + if (proto == PPP_VJC_COMP) { + /* + * Decompress VJ-compressed packet. + * First reset compressor if an input error has occurred. + */ + if (cp->stats.ppp_ierrors != cp->vj_last_ierrors) { + if (cp->flags & DBGLOG) + DPRINT1("ppp%d: resetting VJ\n", cp->unit); + vj_uncompress_err(&cp->vj_comp); + cp->vj_last_ierrors = cp->stats.ppp_ierrors; + } + + vjlen = vj_uncompress_tcp(dp, np->b_wptr - dp, len, + &cp->vj_comp, &iphdr, &iphlen); + if (vjlen < 0) { + if (cp->flags & DBGLOG) + DPRINT2("ppp%d: vj_uncomp_tcp failed, pkt len %d\n", + cp->unit, len); + ++cp->vj_last_ierrors; /* so we don't reset next time */ + goto bad; + } + + /* drop ppp and vj headers off */ + if (mp != np) { + freeb(mp); + mp = np; + } + mp->b_rptr = dp + vjlen; + + /* allocate a new mblk for the ppp and ip headers */ + if ((np = allocb(iphlen + PPP_HDRLEN + 4, BPRI_MED)) == 0) + goto bad; + dp = np->b_rptr; /* prepend mblk with TCP/IP hdr */ + dp[0] = PPP_ALLSTATIONS; /* reconstruct PPP header */ + dp[1] = PPP_UI; + dp[2] = PPP_IP >> 8; + dp[3] = PPP_IP; + bcopy((caddr_t)iphdr, (caddr_t)dp + PPP_HDRLEN, iphlen); + np->b_wptr = dp + iphlen + PPP_HDRLEN; + np->b_cont = mp; + + /* XXX there seems to be a bug which causes panics in strread + if we make an mbuf with only the IP header in it :-( */ + if (mp->b_wptr - mp->b_rptr > 4) { + bcopy((caddr_t)mp->b_rptr, (caddr_t)np->b_wptr, 4); + mp->b_rptr += 4; + np->b_wptr += 4; + } else { + bcopy((caddr_t)mp->b_rptr, (caddr_t)np->b_wptr, + mp->b_wptr - mp->b_rptr); + np->b_wptr += mp->b_wptr - mp->b_rptr; + np->b_cont = mp->b_cont; + freeb(mp); + } + + mp = np; + + } else { + /* + * "Decompress" a VJ-uncompressed packet. + */ + cp->vj_last_ierrors = cp->stats.ppp_ierrors; + if (!vj_uncompress_uncomp(dp, hlen, &cp->vj_comp)) { + if (cp->flags & DBGLOG) + DPRINT2("ppp%d: vj_uncomp_uncomp failed, pkt len %d\n", + cp->unit, len); + ++cp->vj_last_ierrors; /* don't need to reset next time */ + goto bad; + } + mp->b_rptr[3] = PPP_IP; /* fix up the PPP protocol field */ + } + } + + putnext(q, mp); + continue; + + bad: + if (mp != 0) + freemsg(mp); + cp->stats.ppp_ierrors++; + putctl1(q->q_next, M_CTL, PPPCTL_IERROR); + } + + return 0; +} + +/* + * Handle a CCP packet being sent or received. + * Here all the data in the packet is in a single mbuf. + */ +static void +ppp_comp_ccp(q, mp, rcvd) + queue_t *q; + mblk_t *mp; + int rcvd; +{ + int len, clen; + comp_state_t *cp; + unsigned char *dp; + + len = msgdsize(mp); + if (len < PPP_HDRLEN + CCP_HDRLEN) + return; + + cp = (comp_state_t *) q->q_ptr; + dp = mp->b_rptr + PPP_HDRLEN; + len -= PPP_HDRLEN; + clen = CCP_LENGTH(dp); + if (clen > len) + return; + + switch (CCP_CODE(dp)) { + case CCP_CONFREQ: + case CCP_TERMREQ: + case CCP_TERMACK: + cp->flags &= ~CCP_ISUP; + break; + + case CCP_CONFACK: + if ((cp->flags & (CCP_ISOPEN | CCP_ISUP)) == CCP_ISOPEN + && clen >= CCP_HDRLEN + CCP_OPT_MINLEN + && clen >= CCP_HDRLEN + CCP_OPT_LENGTH(dp + CCP_HDRLEN)) { + if (!rcvd) { + if (cp->xstate != NULL + && (*cp->xcomp->comp_init) + (cp->xstate, dp + CCP_HDRLEN, clen - CCP_HDRLEN, + cp->unit, 0, ((cp->flags & DBGLOG) != 0))) + cp->flags |= CCP_COMP_RUN; + } else { + if (cp->rstate != NULL + && (*cp->rcomp->decomp_init) + (cp->rstate, dp + CCP_HDRLEN, clen - CCP_HDRLEN, + cp->unit, 0, cp->mru, ((cp->flags & DBGLOG) != 0))) + cp->flags = (cp->flags & ~CCP_ERR) | CCP_DECOMP_RUN; + } + } + break; + + case CCP_RESETACK: + if (cp->flags & CCP_ISUP) { + if (!rcvd) { + if (cp->xstate && (cp->flags & CCP_COMP_RUN)) + (*cp->xcomp->comp_reset)(cp->xstate); + } else { + if (cp->rstate && (cp->flags & CCP_DECOMP_RUN)) { + (*cp->rcomp->decomp_reset)(cp->rstate); + cp->flags &= ~CCP_ERROR; + } + } + } + break; + } +} + +#if 0 +dump_msg(mp) + mblk_t *mp; +{ + dblk_t *db; + + while (mp != 0) { + db = mp->b_datap; + DPRINT2("mp=%x cont=%x ", mp, mp->b_cont); + DPRINT3("rptr=%x wptr=%x datap=%x\n", mp->b_rptr, mp->b_wptr, db); + DPRINT2(" base=%x lim=%x", db->db_base, db->db_lim); + DPRINT2(" ref=%d type=%d\n", db->db_ref, db->db_type); + mp = mp->b_cont; + } +} +#endif + +static int +msg_byte(mp, i) + mblk_t *mp; + unsigned int i; +{ + while (mp != 0 && i >= mp->b_wptr - mp->b_rptr) + mp = mp->b_cont; + if (mp == 0) + return -1; + return mp->b_rptr[i]; +} diff --git a/mdk-stage1/ppp/modules/ppp_mod.h b/mdk-stage1/ppp/modules/ppp_mod.h new file mode 100644 index 000000000..f0af00886 --- /dev/null +++ b/mdk-stage1/ppp/modules/ppp_mod.h @@ -0,0 +1,190 @@ +/* + * Miscellaneous definitions for PPP STREAMS modules. + */ + +/* + * Macros for allocating and freeing kernel memory. + */ +#ifdef SVR4 /* SVR4, including Solaris 2 */ +#include +#define ALLOC_SLEEP(n) kmem_alloc((n), KM_SLEEP) +#define ALLOC_NOSLEEP(n) kmem_alloc((n), KM_NOSLEEP) +#define FREE(p, n) kmem_free((p), (n)) +#endif + +#ifdef SUNOS4 +#include /* SunOS 4.x */ +#define ALLOC_SLEEP(n) kmem_alloc((n), KMEM_SLEEP) +#define ALLOC_NOSLEEP(n) kmem_alloc((n), KMEM_NOSLEEP) +#define FREE(p, n) kmem_free((p), (n)) +#define NOTSUSER() (suser()? 0: EPERM) +#define bcanputnext(q, band) canputnext((q)) +#endif /* SunOS 4 */ + +#ifdef __osf__ +#include + +/* caution: this mirrors macros in sys/malloc.h, and uses interfaces + * which are subject to change. + * The problems are that: + * - the official MALLOC macro wants the lhs of the assignment as an argument, + * and it takes care of the assignment itself (yuck.) + * - PPP insists on using "FREE" which conflicts with a macro of the same name. + * + */ +#ifdef BUCKETINDX /* V2.0 */ +#define ALLOC_SLEEP(n) (void *)malloc((u_long)(n), BUCKETP(n), M_DEVBUF, M_WAITOK) +#define ALLOC_NOSLEEP(n) (void *)malloc((u_long)(n), BUCKETP(n), M_DEVBUF, M_NOWAIT) +#else +#define ALLOC_SLEEP(n) (void *)malloc((u_long)(n), BUCKETINDEX(n), M_DEVBUF, M_WAITOK) +#define ALLOC_NOSLEEP(n) (void *)malloc((u_long)(n), BUCKETINDEX(n), M_DEVBUF, M_NOWAIT) +#endif + +#define bcanputnext(q, band) canputnext((q)) + +#ifdef FREE +#undef FREE +#endif +#define FREE(p, n) free((void *)(p), M_DEVBUF) + +#define NO_DLPI 1 + +#ifndef IFT_PPP +#define IFT_PPP 0x17 +#endif + +#include +#define NOTSUSER() (suser(u.u_procp->p_rcred, &u.u_acflag) ? EPERM : 0) + +/* #include "ppp_osf.h" */ + +#endif /* __osf__ */ + +#ifdef AIX4 +#define ALLOC_SLEEP(n) xmalloc((n), 0, pinned_heap) /* AIX V4.x */ +#define ALLOC_NOSLEEP(n) xmalloc((n), 0, pinned_heap) /* AIX V4.x */ +#define FREE(p, n) xmfree((p), pinned_heap) +#define NOTSUSER() (suser()? 0: EPERM) +#endif /* AIX */ + +/* + * Macros for printing debugging stuff. + */ +#ifdef DEBUG +#if defined(SVR4) || defined(__osf__) +#if defined(SNI) +#include +#define STRLOG_ID 4712 +#define DPRINT(f) strlog(STRLOG_ID, 0, 0, SL_TRACE, f) +#define DPRINT1(f, a1) strlog(STRLOG_ID, 0, 0, SL_TRACE, f, a1) +#define DPRINT2(f, a1, a2) strlog(STRLOG_ID, 0, 0, SL_TRACE, f, a1, a2) +#define DPRINT3(f, a1, a2, a3) strlog(STRLOG_ID, 0, 0, SL_TRACE, f, a1, a2, a3) +#else +#define DPRINT(f) cmn_err(CE_CONT, f) +#define DPRINT1(f, a1) cmn_err(CE_CONT, f, a1) +#define DPRINT2(f, a1, a2) cmn_err(CE_CONT, f, a1, a2) +#define DPRINT3(f, a1, a2, a3) cmn_err(CE_CONT, f, a1, a2, a3) +#endif /* SNI */ +#else +#define DPRINT(f) printf(f) +#define DPRINT1(f, a1) printf(f, a1) +#define DPRINT2(f, a1, a2) printf(f, a1, a2) +#define DPRINT3(f, a1, a2, a3) printf(f, a1, a2, a3) +#endif /* SVR4 or OSF */ + +#else +#define DPRINT(f) 0 +#define DPRINT1(f, a1) 0 +#define DPRINT2(f, a1, a2) 0 +#define DPRINT3(f, a1, a2, a3) 0 +#endif /* DEBUG */ + +#ifndef SVR4 +typedef unsigned char uchar_t; +typedef unsigned short ushort_t; +#ifndef __osf__ +typedef int minor_t; +#endif +#endif + +/* + * If we don't have multithreading support, define substitutes. + */ +#ifndef D_MP +# define qprocson(q) +# define qprocsoff(q) +# define put(q, mp) ((*(q)->q_qinfo->qi_putp)((q), (mp))) +# define canputnext(q) canput((q)->q_next) +# define qwriter(q, mp, func, scope) (func)((q), (mp)) +#endif + +#ifdef D_MP +/* Use msgpullup if we have other multithreading support. */ +#define PULLUP(mp, len) \ + do { \ + mblk_t *np = msgpullup((mp), (len)); \ + freemsg((mp)); \ + mp = np; \ + } while (0) + +#else +/* Use pullupmsg if we don't have any multithreading support. */ +#define PULLUP(mp, len) \ + do { \ + if (!pullupmsg((mp), (len))) { \ + freemsg((mp)); \ + mp = 0; \ + } \ + } while (0) +#endif + +/* + * How to declare the open and close procedures for a module. + */ +#ifdef SVR4 +#define MOD_OPEN_DECL(name) \ +static int name __P((queue_t *, dev_t *, int, int, cred_t *)) + +#define MOD_CLOSE_DECL(name) \ +static int name __P((queue_t *, int, cred_t *)) + +#define MOD_OPEN(name) \ +static int name(q, devp, flag, sflag, credp) \ + queue_t *q; \ + dev_t *devp; \ + int flag, sflag; \ + cred_t *credp; + +#define MOD_CLOSE(name) \ +static int name(q, flag, credp) \ + queue_t *q; \ + int flag; \ + cred_t *credp; + +#define OPEN_ERROR(x) return (x) +#define DRV_OPEN_OK(dev) return 0 + +#define NOTSUSER() (drv_priv(credp)) + +#else /* not SVR4 */ +#define MOD_OPEN_DECL(name) \ +static int name __P((queue_t *, int, int, int)) + +#define MOD_CLOSE_DECL(name) \ +static int name __P((queue_t *, int)) + +#define MOD_OPEN(name) \ +static int name(q, dev, flag, sflag) \ + queue_t *q; \ + int dev; \ + int flag, sflag; + +#define MOD_CLOSE(name) \ +static int name(q, flag) \ + queue_t *q; \ + int flag; + +#define OPEN_ERROR(x) { u.u_error = (x); return OPENFAIL; } +#define DRV_OPEN_OK(dev) return (dev) + +#endif /* SVR4 */ diff --git a/mdk-stage1/ppp/modules/vjcompress.c b/mdk-stage1/ppp/modules/vjcompress.c new file mode 100644 index 000000000..af519b434 --- /dev/null +++ b/mdk-stage1/ppp/modules/vjcompress.c @@ -0,0 +1,587 @@ +/* + * Routines to compress and uncompess tcp packets (for transmission + * over low speed serial lines. + * + * Copyright (c) 1989 Regents of the University of California. + * All rights reserved. + * + * Redistribution and use in source and binary forms are permitted + * provided that the above copyright notice and this paragraph are + * duplicated in all such forms and that any documentation, + * advertising materials, and other materials related to such + * distribution and use acknowledge that the software was developed + * by the University of California, Berkeley. The name of the + * University may not be used to endorse or promote products derived + * from this software without specific prior written permission. + * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR + * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED + * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. + * + * Van Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989: + * - Initial distribution. + * + * Modified June 1993 by Paul Mackerras, paulus@cs.anu.edu.au, + * so that the entire packet being decompressed doesn't have + * to be in contiguous memory (just the compressed header). + */ + +/* + * This version is used under SunOS 4.x, Digital UNIX, AIX 4.x, + * and SVR4 systems including Solaris 2. + * + * $Id: vjcompress.c 195720 2001-06-11 11:44:34Z gc $ + */ + +#include +#include + +#ifdef SVR4 +#ifndef __GNUC__ +#include /* for ntohl, etc. */ +#else +/* make sure we don't get the gnu "fixed" one! */ +#include "/usr/include/sys/byteorder.h" +#endif +#endif + +#ifdef __osf__ +#include +#endif +#include + +#ifdef AIX4 +#define _NETINET_IN_SYSTM_H_ +typedef u_long n_long; +#else +#include +#endif + +#include +#include + +#include +#include + +#ifndef VJ_NO_STATS +#define INCR(counter) ++comp->stats.counter +#else +#define INCR(counter) +#endif + +#define BCMP(p1, p2, n) bcmp((char *)(p1), (char *)(p2), (int)(n)) +#undef BCOPY +#define BCOPY(p1, p2, n) bcopy((char *)(p1), (char *)(p2), (int)(n)) +#ifndef KERNEL +#define ovbcopy bcopy +#endif + +#ifdef __osf__ +#define getip_hl(base) (((base).ip_vhl)&0xf) +#define getth_off(base) ((((base).th_xoff)&0xf0)>>4) + +#else +#define getip_hl(base) ((base).ip_hl) +#define getth_off(base) ((base).th_off) +#endif + +void +vj_compress_init(comp, max_state) + struct vjcompress *comp; + int max_state; +{ + register u_int i; + register struct cstate *tstate = comp->tstate; + + if (max_state == -1) + max_state = MAX_STATES - 1; + bzero((char *)comp, sizeof(*comp)); + for (i = max_state; i > 0; --i) { + tstate[i].cs_id = i; + tstate[i].cs_next = &tstate[i - 1]; + } + tstate[0].cs_next = &tstate[max_state]; + tstate[0].cs_id = 0; + comp->last_cs = &tstate[0]; + comp->last_recv = 255; + comp->last_xmit = 255; + comp->flags = VJF_TOSS; +} + + +/* ENCODE encodes a number that is known to be non-zero. ENCODEZ + * checks for zero (since zero has to be encoded in the long, 3 byte + * form). + */ +#define ENCODE(n) { \ + if ((u_short)(n) >= 256) { \ + *cp++ = 0; \ + cp[1] = (n); \ + cp[0] = (n) >> 8; \ + cp += 2; \ + } else { \ + *cp++ = (n); \ + } \ +} +#define ENCODEZ(n) { \ + if ((u_short)(n) >= 256 || (u_short)(n) == 0) { \ + *cp++ = 0; \ + cp[1] = (n); \ + cp[0] = (n) >> 8; \ + cp += 2; \ + } else { \ + *cp++ = (n); \ + } \ +} + +#define DECODEL(f) { \ + if (*cp == 0) {\ + u_int32_t tmp = ntohl(f) + ((cp[1] << 8) | cp[2]); \ + (f) = htonl(tmp); \ + cp += 3; \ + } else { \ + u_int32_t tmp = ntohl(f) + (u_int32_t)*cp++; \ + (f) = htonl(tmp); \ + } \ +} + +#define DECODES(f) { \ + if (*cp == 0) {\ + u_short tmp = ntohs(f) + ((cp[1] << 8) | cp[2]); \ + (f) = htons(tmp); \ + cp += 3; \ + } else { \ + u_short tmp = ntohs(f) + (u_int32_t)*cp++; \ + (f) = htons(tmp); \ + } \ +} + +#define DECODEU(f) { \ + if (*cp == 0) {\ + (f) = htons((cp[1] << 8) | cp[2]); \ + cp += 3; \ + } else { \ + (f) = htons((u_int32_t)*cp++); \ + } \ +} + +u_int +vj_compress_tcp(ip, mlen, comp, compress_cid, vjhdrp) + register struct ip *ip; + u_int mlen; + struct vjcompress *comp; + int compress_cid; + u_char **vjhdrp; +{ + register struct cstate *cs = comp->last_cs->cs_next; + register u_int hlen = getip_hl(*ip); + register struct tcphdr *oth; + register struct tcphdr *th; + register u_int deltaS, deltaA; + register u_int changes = 0; + u_char new_seq[16]; + register u_char *cp = new_seq; + + /* + * Bail if this is an IP fragment or if the TCP packet isn't + * `compressible' (i.e., ACK isn't set or some other control bit is + * set). (We assume that the caller has already made sure the + * packet is IP proto TCP). + */ + if ((ip->ip_off & htons(0x3fff)) || mlen < 40) + return (TYPE_IP); + + th = (struct tcphdr *)&((int *)ip)[hlen]; + if ((th->th_flags & (TH_SYN|TH_FIN|TH_RST|TH_ACK)) != TH_ACK) + return (TYPE_IP); + /* + * Packet is compressible -- we're going to send either a + * COMPRESSED_TCP or UNCOMPRESSED_TCP packet. Either way we need + * to locate (or create) the connection state. Special case the + * most recently used connection since it's most likely to be used + * again & we don't have to do any reordering if it's used. + */ + INCR(vjs_packets); + if (ip->ip_src.s_addr != cs->cs_ip.ip_src.s_addr || + ip->ip_dst.s_addr != cs->cs_ip.ip_dst.s_addr || + *(int *)th != ((int *)&cs->cs_ip)[getip_hl(cs->cs_ip)]) { + /* + * Wasn't the first -- search for it. + * + * States are kept in a circularly linked list with + * last_cs pointing to the end of the list. The + * list is kept in lru order by moving a state to the + * head of the list whenever it is referenced. Since + * the list is short and, empirically, the connection + * we want is almost always near the front, we locate + * states via linear search. If we don't find a state + * for the datagram, the oldest state is (re-)used. + */ + register struct cstate *lcs; + register struct cstate *lastcs = comp->last_cs; + + do { + lcs = cs; cs = cs->cs_next; + INCR(vjs_searches); + if (ip->ip_src.s_addr == cs->cs_ip.ip_src.s_addr + && ip->ip_dst.s_addr == cs->cs_ip.ip_dst.s_addr + && *(int *)th == ((int *)&cs->cs_ip)[getip_hl(cs->cs_ip)]) + goto found; + } while (cs != lastcs); + + /* + * Didn't find it -- re-use oldest cstate. Send an + * uncompressed packet that tells the other side what + * connection number we're using for this conversation. + * Note that since the state list is circular, the oldest + * state points to the newest and we only need to set + * last_cs to update the lru linkage. + */ + INCR(vjs_misses); + comp->last_cs = lcs; + hlen += getth_off(*th); + hlen <<= 2; + if (hlen > mlen) + return (TYPE_IP); + goto uncompressed; + + found: + /* + * Found it -- move to the front on the connection list. + */ + if (cs == lastcs) + comp->last_cs = lcs; + else { + lcs->cs_next = cs->cs_next; + cs->cs_next = lastcs->cs_next; + lastcs->cs_next = cs; + } + } + + /* + * Make sure that only what we expect to change changed. The first + * line of the `if' checks the IP protocol version, header length & + * type of service. The 2nd line checks the "Don't fragment" bit. + * The 3rd line checks the time-to-live and protocol (the protocol + * check is unnecessary but costless). The 4th line checks the TCP + * header length. The 5th line checks IP options, if any. The 6th + * line checks TCP options, if any. If any of these things are + * different between the previous & current datagram, we send the + * current datagram `uncompressed'. + */ + oth = (struct tcphdr *)&((int *)&cs->cs_ip)[hlen]; + deltaS = hlen; + hlen += getth_off(*th); + hlen <<= 2; + if (hlen > mlen) + return (TYPE_IP); + + if (((u_short *)ip)[0] != ((u_short *)&cs->cs_ip)[0] || + ((u_short *)ip)[3] != ((u_short *)&cs->cs_ip)[3] || + ((u_short *)ip)[4] != ((u_short *)&cs->cs_ip)[4] || + getth_off(*th) != getth_off(*oth) || + (deltaS > 5 && BCMP(ip + 1, &cs->cs_ip + 1, (deltaS - 5) << 2)) || + (getth_off(*th) > 5 && BCMP(th + 1, oth + 1, (getth_off(*th) - 5) << 2))) + goto uncompressed; + + /* + * Figure out which of the changing fields changed. The + * receiver expects changes in the order: urgent, window, + * ack, seq (the order minimizes the number of temporaries + * needed in this section of code). + */ + if (th->th_flags & TH_URG) { + deltaS = ntohs(th->th_urp); + ENCODEZ(deltaS); + changes |= NEW_U; + } else if (th->th_urp != oth->th_urp) + /* argh! URG not set but urp changed -- a sensible + * implementation should never do this but RFC793 + * doesn't prohibit the change so we have to deal + * with it. */ + goto uncompressed; + + if ((deltaS = (u_short)(ntohs(th->th_win) - ntohs(oth->th_win))) > 0) { + ENCODE(deltaS); + changes |= NEW_W; + } + + if ((deltaA = ntohl(th->th_ack) - ntohl(oth->th_ack)) > 0) { + if (deltaA > 0xffff) + goto uncompressed; + ENCODE(deltaA); + changes |= NEW_A; + } + + if ((deltaS = ntohl(th->th_seq) - ntohl(oth->th_seq)) > 0) { + if (deltaS > 0xffff) + goto uncompressed; + ENCODE(deltaS); + changes |= NEW_S; + } + + switch(changes) { + + case 0: + /* + * Nothing changed. If this packet contains data and the + * last one didn't, this is probably a data packet following + * an ack (normal on an interactive connection) and we send + * it compressed. Otherwise it's probably a retransmit, + * retransmitted ack or window probe. Send it uncompressed + * in case the other side missed the compressed version. + */ + if (ip->ip_len != cs->cs_ip.ip_len && + ntohs(cs->cs_ip.ip_len) == hlen) + break; + + /* (fall through) */ + + case SPECIAL_I: + case SPECIAL_D: + /* + * actual changes match one of our special case encodings -- + * send packet uncompressed. + */ + goto uncompressed; + + case NEW_S|NEW_A: + if (deltaS == deltaA && deltaS == ntohs(cs->cs_ip.ip_len) - hlen) { + /* special case for echoed terminal traffic */ + changes = SPECIAL_I; + cp = new_seq; + } + break; + + case NEW_S: + if (deltaS == ntohs(cs->cs_ip.ip_len) - hlen) { + /* special case for data xfer */ + changes = SPECIAL_D; + cp = new_seq; + } + break; + } + + deltaS = ntohs(ip->ip_id) - ntohs(cs->cs_ip.ip_id); + if (deltaS != 1) { + ENCODEZ(deltaS); + changes |= NEW_I; + } + if (th->th_flags & TH_PUSH) + changes |= TCP_PUSH_BIT; + /* + * Grab the cksum before we overwrite it below. Then update our + * state with this packet's header. + */ + deltaA = ntohs(th->th_sum); + BCOPY(ip, &cs->cs_ip, hlen); + + /* + * We want to use the original packet as our compressed packet. + * (cp - new_seq) is the number of bytes we need for compressed + * sequence numbers. In addition we need one byte for the change + * mask, one for the connection id and two for the tcp checksum. + * So, (cp - new_seq) + 4 bytes of header are needed. hlen is how + * many bytes of the original packet to toss so subtract the two to + * get the new packet size. + */ + deltaS = cp - new_seq; + cp = (u_char *)ip; + if (compress_cid == 0 || comp->last_xmit != cs->cs_id) { + comp->last_xmit = cs->cs_id; + hlen -= deltaS + 4; + *vjhdrp = (cp += hlen); + *cp++ = changes | NEW_C; + *cp++ = cs->cs_id; + } else { + hlen -= deltaS + 3; + *vjhdrp = (cp += hlen); + *cp++ = changes; + } + *cp++ = deltaA >> 8; + *cp++ = deltaA; + BCOPY(new_seq, cp, deltaS); + INCR(vjs_compressed); + return (TYPE_COMPRESSED_TCP); + + /* + * Update connection state cs & send uncompressed packet (that is, + * a regular ip/tcp packet but with the 'conversation id' we hope + * to use on future compressed packets in the protocol field). + */ + uncompressed: + BCOPY(ip, &cs->cs_ip, hlen); + ip->ip_p = cs->cs_id; + comp->last_xmit = cs->cs_id; + return (TYPE_UNCOMPRESSED_TCP); +} + +/* + * Called when we may have missed a packet. + */ +void +vj_uncompress_err(comp) + struct vjcompress *comp; +{ + comp->flags |= VJF_TOSS; + INCR(vjs_errorin); +} + +/* + * "Uncompress" a packet of type TYPE_UNCOMPRESSED_TCP. + */ +int +vj_uncompress_uncomp(buf, buflen, comp) + u_char *buf; + int buflen; + struct vjcompress *comp; +{ + register u_int hlen; + register struct cstate *cs; + register struct ip *ip; + + ip = (struct ip *) buf; + hlen = getip_hl(*ip) << 2; + if (ip->ip_p >= MAX_STATES + || hlen + sizeof(struct tcphdr) > buflen + || (hlen += getth_off(*((struct tcphdr *)&((char *)ip)[hlen])) << 2) + > buflen + || hlen > MAX_HDR) { + comp->flags |= VJF_TOSS; + INCR(vjs_errorin); + return (0); + } + cs = &comp->rstate[comp->last_recv = ip->ip_p]; + comp->flags &=~ VJF_TOSS; + ip->ip_p = IPPROTO_TCP; + BCOPY(ip, &cs->cs_ip, hlen); + cs->cs_hlen = hlen; + INCR(vjs_uncompressedin); + return (1); +} + +/* + * Uncompress a packet of type TYPE_COMPRESSED_TCP. + * The packet starts at buf and is of total length total_len. + * The first buflen bytes are at buf; this must include the entire + * compressed TCP/IP header. This procedure returns the length + * of the VJ header, with a pointer to the uncompressed IP header + * in *hdrp and its length in *hlenp. + */ +int +vj_uncompress_tcp(buf, buflen, total_len, comp, hdrp, hlenp) + u_char *buf; + int buflen, total_len; + struct vjcompress *comp; + u_char **hdrp; + u_int *hlenp; +{ + register u_char *cp; + register u_int hlen, changes; + register struct tcphdr *th; + register struct cstate *cs; + register u_short *bp; + register u_int vjlen; + register u_int32_t tmp; + + INCR(vjs_compressedin); + cp = buf; + changes = *cp++; + if (changes & NEW_C) { + /* Make sure the state index is in range, then grab the state. + * If we have a good state index, clear the 'discard' flag. */ + if (*cp >= MAX_STATES) + goto bad; + + comp->flags &=~ VJF_TOSS; + comp->last_recv = *cp++; + } else { + /* this packet has an implicit state index. If we've + * had a line error since the last time we got an + * explicit state index, we have to toss the packet. */ + if (comp->flags & VJF_TOSS) { + INCR(vjs_tossed); + return (-1); + } + } + cs = &comp->rstate[comp->last_recv]; + hlen = getip_hl(cs->cs_ip) << 2; + th = (struct tcphdr *)&((u_char *)&cs->cs_ip)[hlen]; + th->th_sum = htons((*cp << 8) | cp[1]); + cp += 2; + if (changes & TCP_PUSH_BIT) + th->th_flags |= TH_PUSH; + else + th->th_flags &=~ TH_PUSH; + + switch (changes & SPECIALS_MASK) { + case SPECIAL_I: + { + register u_int32_t i = ntohs(cs->cs_ip.ip_len) - cs->cs_hlen; + /* some compilers can't nest inline assembler.. */ + tmp = ntohl(th->th_ack) + i; + th->th_ack = htonl(tmp); + tmp = ntohl(th->th_seq) + i; + th->th_seq = htonl(tmp); + } + break; + + case SPECIAL_D: + /* some compilers can't nest inline assembler.. */ + tmp = ntohl(th->th_seq) + ntohs(cs->cs_ip.ip_len) - cs->cs_hlen; + th->th_seq = htonl(tmp); + break; + + default: + if (changes & NEW_U) { + th->th_flags |= TH_URG; + DECODEU(th->th_urp); + } else + th->th_flags &=~ TH_URG; + if (changes & NEW_W) + DECODES(th->th_win); + if (changes & NEW_A) + DECODEL(th->th_ack); + if (changes & NEW_S) + DECODEL(th->th_seq); + break; + } + if (changes & NEW_I) { + DECODES(cs->cs_ip.ip_id); + } else { + cs->cs_ip.ip_id = ntohs(cs->cs_ip.ip_id) + 1; + cs->cs_ip.ip_id = htons(cs->cs_ip.ip_id); + } + + /* + * At this point, cp points to the first byte of data in the + * packet. Fill in the IP total length and update the IP + * header checksum. + */ + vjlen = cp - buf; + buflen -= vjlen; + if (buflen < 0) + /* we must have dropped some characters (crc should detect + * this but the old slip framing won't) */ + goto bad; + + total_len += cs->cs_hlen - vjlen; + cs->cs_ip.ip_len = htons(total_len); + + /* recompute the ip header checksum */ + bp = (u_short *) &cs->cs_ip; + cs->cs_ip.ip_sum = 0; + for (changes = 0; hlen > 0; hlen -= 2) + changes += *bp++; + changes = (changes & 0xffff) + (changes >> 16); + changes = (changes & 0xffff) + (changes >> 16); + cs->cs_ip.ip_sum = ~ changes; + + *hdrp = (u_char *) &cs->cs_ip; + *hlenp = cs->cs_hlen; + return vjlen; + + bad: + comp->flags |= VJF_TOSS; + INCR(vjs_errorin); + return (-1); +} -- cgit v1.2.1