2 * lcp.h - Link Control Protocol definitions.
4 * Copyright (c) 1989 Carnegie Mellon University.
7 * Redistribution and use in source and binary forms are permitted
8 * provided that the above copyright notice and this paragraph are
9 * duplicated in all such forms and that any documentation,
10 * advertising materials, and other materials related to such
11 * distribution and use acknowledge that the software was developed
12 * by Carnegie Mellon University. The name of the
13 * University may not be used to endorse or promote products derived
14 * from this software without specific prior written permission.
15 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19 * $Id: lcp.h,v 1.1 1993/11/11 03:54:25 paulus Exp $
25 #define CI_MRU 1 /* Maximum Receive Unit */
26 #define CI_ASYNCMAP 2 /* Async Control Character Map */
27 #define CI_AUTHTYPE 3 /* Authentication Type */
28 #define CI_QUALITY 4 /* Quality Protocol */
29 #define CI_MAGICNUMBER 5 /* Magic Number */
30 #define CI_KEEPALIVE 6 /* Keep Alive Parameters - OBSOLETE */
31 #define CI_PCOMPRESSION 7 /* Protocol Field Compression */
32 #define CI_ACCOMPRESSION 8 /* Address/Control Field Compression */
36 * The state of options is described by an lcp_options structure.
38 typedef struct lcp_options {
39 int passive : 1; /* Don't die if we don't get a response */
40 int silent : 1; /* Wait for the other end to start first */
41 int restart : 1; /* Restart vs. exit after close */
42 int neg_mru : 1; /* Negotiate the MRU? */
43 int neg_asyncmap : 1; /* Negotiate the async map? */
44 int neg_upap : 1; /* Ask for UPAP authentication? */
45 int neg_chap : 1; /* Ask for CHAP authentication? */
46 int neg_magicnumber : 1; /* Ask for magic number? */
47 int neg_pcompression : 1; /* HDLC Protocol Field Compression? */
48 int neg_accompression : 1; /* HDLC Address/Control Field Compression? */
49 int neg_lqr : 1; /* Negotiate use of Link Quality Reports */
50 u_short mru; /* Value of MRU */
51 char chap_mdtype; /* which MD type (hashing algorithm) */
52 u_long asyncmap; /* Value of async map */
54 int numloops; /* Number of loops during magic number neg. */
55 u_long lqr_period; /* Reporting period for link quality */
59 extern lcp_options lcp_wantoptions[];
60 extern lcp_options lcp_gotoptions[];
61 extern lcp_options lcp_allowoptions[];
62 extern lcp_options lcp_hisoptions[];
64 #define DEFMRU 1500 /* Try for this */
65 #define MINMRU 128 /* No MRUs below this */
66 #define MAXMRU 16384 /* Normally limit MRU to this */
68 void lcp_init __ARGS((int));
69 void lcp_open __ARGS((int));
70 void lcp_close __ARGS((int));
71 void lcp_lowerup __ARGS((int));
72 void lcp_lowerdown __ARGS((int));
73 void lcp_input __ARGS((int, u_char *, int));
74 void lcp_protrej __ARGS((int));
75 void lcp_sprotrej __ARGS((int, u_char *, int));
77 extern int lcp_warnloops; /* Warn about a loopback this often */
78 #define DEFWARNLOOPS 10 /* Default value for above */