1995-01-31 06:29:58 +00:00
|
|
|
/*
|
|
|
|
* Written by Toshiharu OHNO (tony-o@iij.ad.jp)
|
|
|
|
*
|
|
|
|
* Copyright (C) 1993, Internet Initiative Japan, Inc. All rights reserverd.
|
|
|
|
*
|
|
|
|
* 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 Internet Initiative Japan. The name of the
|
|
|
|
* IIJ 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.
|
|
|
|
*
|
1998-06-30 23:04:17 +00:00
|
|
|
* $Id: ccp.h,v 1.18 1998/06/27 23:48:41 brian Exp $
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
|
|
|
* TODO:
|
|
|
|
*/
|
|
|
|
|
|
|
|
#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 */
|
|
|
|
#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
|
|
|
|
#define CCP_NEG_TOTAL 3
|
|
|
|
|
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;
|
1998-04-03 19:24:07 +00:00
|
|
|
u_int fsmretry; /* FSM retry frequency */
|
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() */
|
|
|
|
struct lcp_opt opt; /* Set by implementations OptInit() */
|
|
|
|
} in;
|
|
|
|
|
|
|
|
struct {
|
|
|
|
int algorithm; /* Algorithm in use */
|
|
|
|
void *state; /* Returned by implementations Init() */
|
|
|
|
struct ccp_opt *opt; /* Set by implementations OptInit() */
|
|
|
|
} 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 ! */
|
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 {
|
1998-03-17 22:29:12 +00:00
|
|
|
void (*OptInit)(struct lcp_opt *, const struct ccp_config *);
|
1997-12-03 10:23:54 +00:00
|
|
|
int (*Set)(struct lcp_opt *);
|
1998-03-17 22:29:12 +00:00
|
|
|
void *(*Init)(struct lcp_opt *);
|
|
|
|
void (*Term)(void *);
|
|
|
|
void (*Reset)(void *);
|
|
|
|
int (*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 *);
|
|
|
|
|
1998-05-01 19:26:12 +00:00
|
|
|
extern void ccp_SendResetReq(struct fsm *);
|
|
|
|
extern void ccp_Input(struct ccp *, struct bundle *, struct mbuf *);
|
1998-02-21 01:45:26 +00:00
|
|
|
extern int ccp_ReportStatus(struct cmdargs const *);
|
1998-04-03 19:21:56 +00:00
|
|
|
extern int ccp_Compress(struct ccp *, struct link *, int, u_short, struct mbuf *);
|
1998-02-21 01:45:26 +00:00
|
|
|
extern struct mbuf *ccp_Decompress(struct ccp *, u_short *, struct mbuf *);
|
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 *);
|