2001-06-13 21:52:19 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1996 - 2001 Brian Somers <brian@Awfulhak.org>
|
|
|
|
* based on work by Toshiharu OHNO <tony-o@iij.ad.jp>
|
|
|
|
* Internet Initiative Japan, Inc (IIJ)
|
|
|
|
* All rights reserved.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
2001-06-13 21:52:19 +00:00
|
|
|
* 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.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
2001-06-13 21:52:19 +00:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
1999-08-28 01:35:59 +00:00
|
|
|
* $FreeBSD$
|
1995-01-31 06:29:58 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#define CCP_MAXCODE CODE_RESETACK
|
|
|
|
|
|
|
|
#define TY_OUI 0 /* OUI */
|
|
|
|
#define TY_PRED1 1 /* Predictor type 1 */
|
|
|
|
#define TY_PRED2 2 /* Predictor type 2 */
|
|
|
|
#define TY_PUDDLE 3 /* Puddle Jumper */
|
|
|
|
#define TY_HWPPC 16 /* Hewlett-Packard PPC */
|
|
|
|
#define TY_STAC 17 /* Stac Electronics LZS */
|
|
|
|
#define TY_MSPPC 18 /* Microsoft PPC */
|
2000-10-30 00:15:04 +00:00
|
|
|
#define TY_MPPE 18 /* Microsoft PPE */
|
1995-01-31 06:29:58 +00:00
|
|
|
#define TY_GAND 19 /* Gandalf FZA */
|
|
|
|
#define TY_V42BIS 20 /* V.42bis compression */
|
|
|
|
#define TY_BSD 21 /* BSD LZW Compress */
|
1997-12-03 23:28:02 +00:00
|
|
|
#define TY_PPPD_DEFLATE 24 /* Deflate (gzip) - (mis) numbered by pppd */
|
|
|
|
#define TY_DEFLATE 26 /* Deflate (gzip) - rfc 1979 */
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1998-04-16 00:26:21 +00:00
|
|
|
#define CCP_NEG_DEFLATE 0
|
|
|
|
#define CCP_NEG_PRED1 1
|
|
|
|
#define CCP_NEG_DEFLATE24 2
|
2002-03-30 12:30:09 +00:00
|
|
|
#ifndef NODES
|
2000-10-30 00:15:04 +00:00
|
|
|
#define CCP_NEG_MPPE 3
|
|
|
|
#define CCP_NEG_TOTAL 4
|
|
|
|
#else
|
1998-04-16 00:26:21 +00:00
|
|
|
#define CCP_NEG_TOTAL 3
|
2000-10-30 00:15:04 +00:00
|
|
|
#endif
|
1998-04-16 00:26:21 +00:00
|
|
|
|
2002-03-30 12:30:09 +00:00
|
|
|
#ifndef NODES
|
2001-06-18 15:00:22 +00:00
|
|
|
enum mppe_negstate {
|
|
|
|
MPPE_ANYSTATE,
|
|
|
|
MPPE_STATELESS,
|
|
|
|
MPPE_STATEFUL
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
1998-04-07 00:54:26 +00:00
|
|
|
struct mbuf;
|
1998-04-24 19:15:26 +00:00
|
|
|
struct link;
|
1998-04-07 00:54:26 +00:00
|
|
|
|
1998-03-17 22:29:12 +00:00
|
|
|
struct ccp_config {
|
|
|
|
struct {
|
|
|
|
struct {
|
|
|
|
int winsize;
|
|
|
|
} in, out;
|
|
|
|
} deflate;
|
2002-03-30 12:30:09 +00:00
|
|
|
#ifndef NODES
|
2000-10-30 00:15:04 +00:00
|
|
|
struct {
|
|
|
|
int keybits;
|
2001-06-18 15:00:22 +00:00
|
|
|
enum mppe_negstate state;
|
|
|
|
unsigned required : 1;
|
2000-10-30 00:15:04 +00:00
|
|
|
} mppe;
|
|
|
|
#endif
|
Allow control over the number of ConfigREQ & TermREQ attempts
that are made in each of the FSMs (LCP, CCP & IPCP) and the
number of REQs/Challenges for PAP/CHAP by accepting more arguments
in the ``set {c,ip,l}cpretry'' and ``set {ch,p}apretry'' commands.
Change the non-convergence thresholds to 3 times the number of configured
REQ tries (rather than the previous fixed ``10''). We now notice
repeated NAKs and REJs rather than just REQs.
Don't suggest that CHAP 0x05 isn't supported when it's not configured.
Fix some bugs that expose themselves with smaller numbers of retries:
o Handle instantaneous disconnects (set device /dev/null) correctly
by stopping all fsm timers in fsm2initial.
o Don't forget to uu_unlock() devices that are files but are not
ttys (set device /dev/zero).
Fix a *HORRENDOUS* bug in RFC1661 (already fixed for an Open event in state
``Closed''):
According to the state transition table, a RCR+ or RCR- received in
the ``Stopped'' state are supposed to InitRestartCounter, SendConfigReq
and SendConfig{Ack,Nak}. However, in ``Stopped'', we haven't yet
done a TLS (or the last thing we did is a TLF). We must therefore
do the TLS at this point !
This was never noticed before because LCP and CCP used not use
LayerStart() for anything interesting, and IPCP tends to go into
Stopped then get a Down because of an LCP RTR rather than getting a
RCR again.
1999-02-26 21:28:14 +00:00
|
|
|
struct fsm_retry fsm; /* How often/frequently to resend requests */
|
1998-04-16 00:26:21 +00:00
|
|
|
unsigned neg[CCP_NEG_TOTAL];
|
1998-03-17 22:29:12 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct ccp_opt {
|
|
|
|
struct ccp_opt *next;
|
|
|
|
int algorithm;
|
|
|
|
struct lcp_opt val;
|
|
|
|
};
|
|
|
|
|
1998-02-08 11:05:01 +00:00
|
|
|
struct ccp {
|
1998-01-31 02:48:30 +00:00
|
|
|
struct fsm fsm; /* The finite state machine */
|
|
|
|
|
1998-01-11 17:50:49 +00:00
|
|
|
int his_proto; /* peer's compression protocol */
|
|
|
|
int my_proto; /* our compression protocol */
|
1995-01-31 06:29:58 +00:00
|
|
|
|
Implement Reset{Req,Ack} properly, as per rfc 1962.
(I completely mis-read the rfc last time 'round!)
This means:
o Better CCP/WARN Reset diagnostics.
o After we've sent a REQ and before we've received an ACK, we drop
incoming compressed data and send another REQ.
o Before sending an ACK, re-sequence all pending PRI_NORMAL data in
the modem queue so that pending packets won't get to the peer
*after* the ResetAck.
o Send ACKs with the `identifier' from the REQ frame.
o After we've received a correct ACK, duplicate ACKs are ok (and will
reset our history).
o Incorrect ACKs (not matching the last REQ) are moaned about and dropped.
Also,
o Calculate the correct FCS after compressing a packet. DEFLATE
*may* produce an mbuf with more than a single link in the chain,
but HdlcOutput didn't know how to calculate the FCS :-(
o Make `struct fsm'::reqid a u_char, not an int.
This fix will prevent us from sending id `255' 2,000,000,000 times
before wrapping to `0' for another 2,000,000,000 sends :-/
o Bump the version number a little.
The end result: DEFLATE now works over an unreliable link layer.
I can txfr a 1.5Mb kernel over a (rather bad) null-modem
cable at an average of 21679 bytes per second using rcp.
Repeat after me: Don't test compression using a loopback ppp/tcp setup as
we never lose packets and therefore never have to reset!
1998-01-10 01:55:11 +00:00
|
|
|
int reset_sent; /* If != -1, ignore compressed 'till ack */
|
|
|
|
int last_reset; /* We can receive more (dups) w/ this id */
|
|
|
|
|
1998-03-17 22:29:12 +00:00
|
|
|
struct {
|
|
|
|
int algorithm; /* Algorithm in use */
|
|
|
|
void *state; /* Returned by implementations Init() */
|
2000-11-07 04:29:33 +00:00
|
|
|
struct lcp_opt opt; /* Set by implementation's OptInit() */
|
1998-03-17 22:29:12 +00:00
|
|
|
} in;
|
|
|
|
|
|
|
|
struct {
|
|
|
|
int algorithm; /* Algorithm in use */
|
|
|
|
void *state; /* Returned by implementations Init() */
|
2000-11-07 04:29:33 +00:00
|
|
|
struct ccp_opt *opt; /* Set by implementation's OptInit() */
|
1998-03-17 22:29:12 +00:00
|
|
|
} out;
|
1998-01-29 20:45:16 +00:00
|
|
|
|
1998-01-11 17:50:49 +00:00
|
|
|
u_int32_t his_reject; /* Request codes rejected by peer */
|
|
|
|
u_int32_t my_reject; /* Request codes I have rejected */
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1998-06-27 23:48:54 +00:00
|
|
|
u_long uncompout, compout; /* Outgoing bytes before/after compression */
|
|
|
|
u_long uncompin, compin; /* Incoming bytes after/before decompression */
|
1998-03-17 22:29:12 +00:00
|
|
|
|
|
|
|
struct ccp_config cfg;
|
1995-01-31 06:29:58 +00:00
|
|
|
};
|
|
|
|
|
1998-02-08 11:05:01 +00:00
|
|
|
#define fsm2ccp(fp) (fp->proto == PROTO_CCP ? (struct ccp *)fp : NULL)
|
1997-12-03 10:23:54 +00:00
|
|
|
|
|
|
|
struct ccp_algorithm {
|
|
|
|
int id;
|
1998-06-15 19:06:58 +00:00
|
|
|
int Neg; /* ccp_config neg array item */
|
|
|
|
const char *(*Disp)(struct lcp_opt *); /* Use result immediately ! */
|
2001-02-04 22:53:11 +00:00
|
|
|
int (*Usable)(struct fsm *); /* Ok to negotiate ? */
|
2001-06-18 15:00:22 +00:00
|
|
|
int (*Required)(struct fsm *); /* Must negotiate ? */
|
1997-12-03 10:23:54 +00:00
|
|
|
struct {
|
1998-03-17 22:29:12 +00:00
|
|
|
int (*Set)(struct lcp_opt *, const struct ccp_config *);
|
|
|
|
void *(*Init)(struct lcp_opt *);
|
|
|
|
void (*Term)(void *);
|
|
|
|
void (*Reset)(void *);
|
|
|
|
struct mbuf *(*Read)(void *, struct ccp *, u_short *, struct mbuf *);
|
|
|
|
void (*DictSetup)(void *, struct ccp *, u_short, struct mbuf *);
|
1997-12-03 10:23:54 +00:00
|
|
|
} i;
|
|
|
|
struct {
|
2001-07-03 22:20:19 +00:00
|
|
|
int MTUOverhead;
|
1998-03-17 22:29:12 +00:00
|
|
|
void (*OptInit)(struct lcp_opt *, const struct ccp_config *);
|
2001-06-18 15:00:22 +00:00
|
|
|
int (*Set)(struct lcp_opt *, const struct ccp_config *);
|
1998-03-17 22:29:12 +00:00
|
|
|
void *(*Init)(struct lcp_opt *);
|
|
|
|
void (*Term)(void *);
|
2001-06-18 15:00:22 +00:00
|
|
|
int (*Reset)(void *);
|
1999-05-08 11:07:56 +00:00
|
|
|
struct mbuf *(*Write)(void *, struct ccp *, struct link *, int, u_short *,
|
|
|
|
struct mbuf *);
|
1997-12-03 10:23:54 +00:00
|
|
|
} o;
|
|
|
|
};
|
|
|
|
|
1998-02-27 01:22:39 +00:00
|
|
|
extern void ccp_Init(struct ccp *, struct bundle *, struct link *,
|
|
|
|
const struct fsm_parent *);
|
1998-02-21 01:45:26 +00:00
|
|
|
extern void ccp_Setup(struct ccp *);
|
2001-06-18 15:00:22 +00:00
|
|
|
extern int ccp_Required(struct ccp *);
|
2001-07-03 22:20:19 +00:00
|
|
|
extern int ccp_MTUOverhead(struct ccp *);
|
1998-02-21 01:45:26 +00:00
|
|
|
|
1998-05-01 19:26:12 +00:00
|
|
|
extern void ccp_SendResetReq(struct fsm *);
|
1999-05-08 11:07:56 +00:00
|
|
|
extern struct mbuf *ccp_Input(struct bundle *, struct link *, struct mbuf *);
|
1998-02-21 01:45:26 +00:00
|
|
|
extern int ccp_ReportStatus(struct cmdargs const *);
|
1998-04-24 19:15:26 +00:00
|
|
|
extern u_short ccp_Proto(struct ccp *);
|
1998-04-30 23:53:56 +00:00
|
|
|
extern void ccp_SetupCallbacks(struct ccp *);
|
1998-06-30 23:04:17 +00:00
|
|
|
extern int ccp_SetOpenMode(struct ccp *);
|
2001-06-18 15:00:22 +00:00
|
|
|
extern int ccp_DefaultUsable(struct fsm *);
|
|
|
|
extern int ccp_DefaultRequired(struct fsm *);
|
1999-05-08 11:07:56 +00:00
|
|
|
|
|
|
|
extern struct layer ccplayer;
|