2 * lcp.c - PPP Link Control Protocol.
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.
20 #define RCSID "$Id: lcp.c,v 1.54 2000/04/27 03:51:18 masputra Exp $"
36 static const char rcsid[] = RCSID;
39 * LCP-related command-line options.
41 int lcp_echo_interval = 0; /* Interval between LCP echo-requests */
42 int lcp_echo_fails = 0; /* Tolerance to unanswered echo-requests */
43 bool lax_recv = 0; /* accept control chars in asyncmap */
45 static int setescape __P((char **));
48 bool noendpoint = 0; /* don't send/accept endpoint discriminator */
49 static int setendpoint __P((char **));
50 #endif /* HAVE_MULTILINK */
52 static option_t lcp_option_list[] = {
54 { "noaccomp", o_bool, &lcp_wantoptions[0].neg_accompression,
55 "Disable address/control compression",
56 OPT_A2COPY, &lcp_allowoptions[0].neg_accompression },
57 { "-ac", o_bool, &lcp_wantoptions[0].neg_accompression,
58 "Disable address/control compression",
59 OPT_A2COPY, &lcp_allowoptions[0].neg_accompression },
60 { "default-asyncmap", o_bool, &lcp_wantoptions[0].neg_asyncmap,
61 "Disable asyncmap negotiation",
62 OPT_A2COPY, &lcp_allowoptions[0].neg_asyncmap },
63 { "-am", o_bool, &lcp_wantoptions[0].neg_asyncmap,
64 "Disable asyncmap negotiation",
65 OPT_A2COPY, &lcp_allowoptions[0].neg_asyncmap },
66 { "asyncmap", o_uint32, &lcp_wantoptions[0].asyncmap,
67 "Set asyncmap (for received packets)",
68 OPT_OR, &lcp_wantoptions[0].neg_asyncmap },
69 { "-as", o_uint32, &lcp_wantoptions[0].asyncmap,
70 "Set asyncmap (for received packets)",
71 OPT_OR, &lcp_wantoptions[0].neg_asyncmap },
72 { "nomagic", o_bool, &lcp_wantoptions[0].neg_magicnumber,
73 "Disable magic number negotiation (looped-back line detection)",
74 OPT_A2COPY, &lcp_allowoptions[0].neg_magicnumber },
75 { "-mn", o_bool, &lcp_wantoptions[0].neg_magicnumber,
76 "Disable magic number negotiation (looped-back line detection)",
77 OPT_A2COPY, &lcp_allowoptions[0].neg_magicnumber },
78 { "default-mru", o_bool, &lcp_wantoptions[0].neg_mru,
79 "Disable MRU negotiation (use default 1500)",
80 OPT_A2COPY, &lcp_allowoptions[0].neg_mru },
81 { "-mru", o_bool, &lcp_wantoptions[0].neg_mru,
82 "Disable MRU negotiation (use default 1500)",
83 OPT_A2COPY, &lcp_allowoptions[0].neg_mru },
84 { "mru", o_int, &lcp_wantoptions[0].mru,
85 "Set MRU (maximum received packet size) for negotiation",
86 0, &lcp_wantoptions[0].neg_mru },
87 { "nopcomp", o_bool, &lcp_wantoptions[0].neg_pcompression,
88 "Disable protocol field compression",
89 OPT_A2COPY, &lcp_allowoptions[0].neg_pcompression },
90 { "-pc", o_bool, &lcp_wantoptions[0].neg_pcompression,
91 "Disable protocol field compression",
92 OPT_A2COPY, &lcp_allowoptions[0].neg_pcompression },
93 { "-p", o_bool, &lcp_wantoptions[0].passive,
94 "Set passive mode", 1 },
95 { "passive", o_bool, &lcp_wantoptions[0].passive,
96 "Set passive mode", 1 },
97 { "silent", o_bool, &lcp_wantoptions[0].silent,
98 "Set silent mode", 1 },
99 { "escape", o_special, (void *)setescape,
100 "List of character codes to escape on transmission" },
101 { "lcp-echo-failure", o_int, &lcp_echo_fails,
102 "Set number of consecutive echo failures to indicate link failure" },
103 { "lcp-echo-interval", o_int, &lcp_echo_interval,
104 "Set time in seconds between LCP echo requests" },
105 { "lcp-restart", o_int, &lcp_fsm[0].timeouttime,
106 "Set time in seconds between LCP retransmissions" },
107 { "lcp-max-terminate", o_int, &lcp_fsm[0].maxtermtransmits,
108 "Set maximum number of LCP terminate-request transmissions" },
109 { "lcp-max-configure", o_int, &lcp_fsm[0].maxconfreqtransmits,
110 "Set maximum number of LCP configure-request transmissions" },
111 { "lcp-max-failure", o_int, &lcp_fsm[0].maxnakloops,
112 "Set limit on number of LCP configure-naks" },
113 { "receive-all", o_bool, &lax_recv,
114 "Accept all received control characters", 1 },
115 #ifdef HAVE_MULTILINK
116 { "mrru", o_int, &lcp_wantoptions[0].mrru,
117 "Maximum received packet size for multilink bundle",
118 0, &lcp_wantoptions[0].neg_mrru },
119 { "mpshortseq", o_bool, &lcp_wantoptions[0].neg_ssnhf,
120 "Use short sequence numbers in multilink headers",
121 OPT_A2COPY | 1, &lcp_allowoptions[0].neg_ssnhf },
122 { "nompshortseq", o_bool, &lcp_wantoptions[0].neg_ssnhf,
123 "Don't use short sequence numbers in multilink headers",
124 OPT_A2COPY, &lcp_allowoptions[0].neg_ssnhf },
125 { "endpoint", o_special, setendpoint,
126 "Endpoint discriminator for multilink" },
127 { "noendpoint", o_bool, &noendpoint,
128 "Don't send or accept multilink endpoint discriminator", 1 },
129 #endif /* HAVE_MULTILINK */
134 fsm lcp_fsm[NUM_PPP]; /* LCP fsm structure (global)*/
135 lcp_options lcp_wantoptions[NUM_PPP]; /* Options that we want to request */
136 lcp_options lcp_gotoptions[NUM_PPP]; /* Options that peer ack'd */
137 lcp_options lcp_allowoptions[NUM_PPP]; /* Options we allow peer to request */
138 lcp_options lcp_hisoptions[NUM_PPP]; /* Options that we ack'd */
139 u_int32_t xmit_accm[NUM_PPP][8]; /* extended transmit ACCM */
141 static int lcp_echos_pending = 0; /* Number of outstanding echo msgs */
142 static int lcp_echo_number = 0; /* ID number of next echo frame */
143 static int lcp_echo_timer_running = 0; /* set if a timer is running */
145 static u_char nak_buffer[PPP_MRU]; /* where we construct a nak packet */
148 * Callbacks for fsm code. (CI = Configuration Information)
150 static void lcp_resetci __P((fsm *)); /* Reset our CI */
151 static int lcp_cilen __P((fsm *)); /* Return length of our CI */
152 static void lcp_addci __P((fsm *, u_char *, int *)); /* Add our CI to pkt */
153 static int lcp_ackci __P((fsm *, u_char *, int)); /* Peer ack'd our CI */
154 static int lcp_nakci __P((fsm *, u_char *, int)); /* Peer nak'd our CI */
155 static int lcp_rejci __P((fsm *, u_char *, int)); /* Peer rej'd our CI */
156 static int lcp_reqci __P((fsm *, u_char *, int *, int)); /* Rcv peer CI */
157 static void lcp_up __P((fsm *)); /* We're UP */
158 static void lcp_down __P((fsm *)); /* We're DOWN */
159 static void lcp_starting __P((fsm *)); /* We need lower layer up */
160 static void lcp_finished __P((fsm *)); /* We need lower layer down */
161 static int lcp_extcode __P((fsm *, int, int, u_char *, int));
162 static void lcp_rprotrej __P((fsm *, u_char *, int));
165 * routines to send LCP echos to peer
168 static void lcp_echo_lowerup __P((int));
169 static void lcp_echo_lowerdown __P((int));
170 static void LcpEchoTimeout __P((void *));
171 static void lcp_received_echo_reply __P((fsm *, int, u_char *, int));
172 static void LcpSendEchoRequest __P((fsm *));
173 static void LcpLinkFailure __P((fsm *));
174 static void LcpEchoCheck __P((fsm *));
176 static fsm_callbacks lcp_callbacks = { /* LCP callback routines */
177 lcp_resetci, /* Reset our Configuration Information */
178 lcp_cilen, /* Length of our Configuration Information */
179 lcp_addci, /* Add our Configuration Information */
180 lcp_ackci, /* ACK our Configuration Information */
181 lcp_nakci, /* NAK our Configuration Information */
182 lcp_rejci, /* Reject our Configuration Information */
183 lcp_reqci, /* Request peer's Configuration Information */
184 lcp_up, /* Called when fsm reaches OPENED state */
185 lcp_down, /* Called when fsm leaves OPENED state */
186 lcp_starting, /* Called when we want the lower layer up */
187 lcp_finished, /* Called when we want the lower layer down */
188 NULL, /* Called when Protocol-Reject received */
189 NULL, /* Retransmission is necessary */
190 lcp_extcode, /* Called to handle LCP-specific codes */
191 "LCP" /* String name of protocol */
195 * Protocol entry points.
196 * Some of these are called directly.
199 static void lcp_init __P((int));
200 static void lcp_input __P((int, u_char *, int));
201 static void lcp_protrej __P((int));
202 static int lcp_printpkt __P((u_char *, int,
203 void (*) __P((void *, char *, ...)), void *));
205 struct protent lcp_protent = {
225 int lcp_loopbackfail = DEFLOOPBACKFAIL;
228 * Length of each type of configuration option (in octets)
232 #define CILEN_SHORT 4 /* CILEN_VOID + 2 */
233 #define CILEN_CHAP 5 /* CILEN_VOID + 2 + 1 */
234 #define CILEN_LONG 6 /* CILEN_VOID + 4 */
235 #define CILEN_LQR 8 /* CILEN_VOID + 2 + 4 */
238 #define CODENAME(x) ((x) == CONFACK ? "ACK" : \
239 (x) == CONFNAK ? "NAK" : "REJ")
243 * setescape - add chars to the set we escape on transmission.
255 n = strtol(p, &endp, 16);
257 option_error("escape parameter contains invalid hex number '%s'",
262 if (n < 0 || n == 0x5E || n > 0xFF) {
263 option_error("can't escape character 0x%x", n);
266 xmit_accm[0][n >> 5] |= 1 << (n & 0x1F);
267 while (*p == ',' || *p == ' ')
273 #ifdef HAVE_MULTILINK
278 if (str_to_epdisc(&lcp_wantoptions[0].endpoint, *argv)) {
279 lcp_wantoptions[0].neg_endpoint = 1;
282 option_error("Can't parse '%s' as an endpoint discriminator", *argv);
285 #endif /* HAVE_MULTILINK */
288 * lcp_init - Initialize LCP.
294 fsm *f = &lcp_fsm[unit];
295 lcp_options *wo = &lcp_wantoptions[unit];
296 lcp_options *ao = &lcp_allowoptions[unit];
299 f->protocol = PPP_LCP;
300 f->callbacks = &lcp_callbacks;
304 BZERO(wo, sizeof(*wo));
307 wo->neg_asyncmap = 1;
308 wo->chap_mdtype = CHAP_DIGEST_MD5;
309 wo->neg_magicnumber = 1;
310 wo->neg_pcompression = 1;
311 wo->neg_accompression = 1;
313 BZERO(ao, sizeof(*ao));
316 ao->neg_asyncmap = 1;
318 ao->chap_mdtype = CHAP_DIGEST_MD5;
320 ao->neg_magicnumber = 1;
321 ao->neg_pcompression = 1;
322 ao->neg_accompression = 1;
326 ao->neg_endpoint = 1;
328 BZERO(xmit_accm[unit], sizeof(xmit_accm[0]));
329 xmit_accm[unit][3] = 0x60000000;
334 * lcp_open - LCP is allowed to come up.
340 fsm *f = &lcp_fsm[unit];
341 lcp_options *wo = &lcp_wantoptions[unit];
345 f->flags |= OPT_PASSIVE;
347 f->flags |= OPT_SILENT;
353 * lcp_close - Take LCP down.
356 lcp_close(unit, reason)
360 fsm *f = &lcp_fsm[unit];
362 if (phase != PHASE_DEAD)
363 new_phase(PHASE_TERMINATE);
364 if (f->state == STOPPED && f->flags & (OPT_PASSIVE|OPT_SILENT)) {
366 * This action is not strictly according to the FSM in RFC1548,
367 * but it does mean that the program terminates if you do a
368 * lcp_close() in passive/silent mode when a connection hasn't
375 fsm_close(&lcp_fsm[unit], reason);
380 * lcp_lowerup - The lower layer is up.
386 lcp_options *wo = &lcp_wantoptions[unit];
389 * Don't use A/C or protocol compression on transmission,
390 * but accept A/C and protocol compressed packets
391 * if we are going to ask for A/C and protocol compression.
393 ppp_set_xaccm(unit, xmit_accm[unit]);
394 ppp_send_config(unit, PPP_MRU, 0xffffffff, 0, 0);
395 ppp_recv_config(unit, PPP_MRU, (lax_recv? 0: 0xffffffff),
396 wo->neg_pcompression, wo->neg_accompression);
397 peer_mru[unit] = PPP_MRU;
398 lcp_allowoptions[unit].asyncmap = xmit_accm[unit][0];
400 fsm_lowerup(&lcp_fsm[unit]);
405 * lcp_lowerdown - The lower layer is down.
411 fsm_lowerdown(&lcp_fsm[unit]);
416 * lcp_input - Input LCP packet.
419 lcp_input(unit, p, len)
424 fsm *f = &lcp_fsm[unit];
426 fsm_input(f, p, len);
431 * lcp_extcode - Handle a LCP-specific code.
434 lcp_extcode(f, code, id, inp, len)
444 lcp_rprotrej(f, inp, len);
448 if (f->state != OPENED)
451 PUTLONG(lcp_gotoptions[f->unit].magicnumber, magp);
452 fsm_sdata(f, ECHOREP, id, inp, len);
456 lcp_received_echo_reply(f, id, inp, len);
470 * lcp_rprotrej - Receive an Protocol-Reject.
472 * Figure out which protocol is rejected and inform it.
475 lcp_rprotrej(f, inp, len)
481 struct protent *protp;
485 LCPDEBUG(("lcp_rprotrej: Rcvd short Protocol-Reject packet!"));
492 * Protocol-Reject packets received in any state other than the LCP
493 * OPENED state SHOULD be silently discarded.
495 if( f->state != OPENED ){
496 LCPDEBUG(("Protocol-Reject discarded: LCP in state %d", f->state));
501 * Upcall the proper Protocol-Reject routine.
503 for (i = 0; (protp = protocols[i]) != NULL; ++i)
504 if (protp->protocol == prot && protp->enabled_flag) {
505 (*protp->protrej)(f->unit);
509 warn("Protocol-Reject for unsupported protocol 0x%x", prot);
514 * lcp_protrej - A Protocol-Reject was received.
524 error("Received Protocol-Reject for LCP!");
525 fsm_protreject(&lcp_fsm[unit]);
530 * lcp_sprotrej - Send a Protocol-Reject for some protocol.
533 lcp_sprotrej(unit, p, len)
539 * Send back the protocol and the information field of the
540 * rejected packet. We only get here if LCP is in the OPENED state.
545 fsm_sdata(&lcp_fsm[unit], PROTREJ, ++lcp_fsm[unit].id,
551 * lcp_resetci - Reset our CI.
557 lcp_options *wo = &lcp_wantoptions[f->unit];
558 lcp_options *go = &lcp_gotoptions[f->unit];
559 lcp_options *ao = &lcp_allowoptions[f->unit];
561 wo->magicnumber = magic();
567 go->neg_endpoint = 0;
569 #ifdef HAVE_MULTILINK
571 ao->neg_endpoint = 0;
572 #endif /* HAVE_MULTILINK */
573 peer_mru[f->unit] = PPP_MRU;
579 * lcp_cilen - Return length of our CI.
585 lcp_options *go = &lcp_gotoptions[f->unit];
587 #define LENCIVOID(neg) ((neg) ? CILEN_VOID : 0)
588 #define LENCICHAP(neg) ((neg) ? CILEN_CHAP : 0)
589 #define LENCISHORT(neg) ((neg) ? CILEN_SHORT : 0)
590 #define LENCILONG(neg) ((neg) ? CILEN_LONG : 0)
591 #define LENCILQR(neg) ((neg) ? CILEN_LQR: 0)
592 #define LENCICBCP(neg) ((neg) ? CILEN_CBCP: 0)
594 * NB: we only ask for one of CHAP and UPAP, even if we will
597 return (LENCISHORT(go->neg_mru && go->mru != DEFMRU) +
598 LENCILONG(go->neg_asyncmap && go->asyncmap != 0xFFFFFFFF) +
599 LENCICHAP(go->neg_chap) +
600 LENCISHORT(!go->neg_chap && go->neg_upap) +
601 LENCILQR(go->neg_lqr) +
602 LENCICBCP(go->neg_cbcp) +
603 LENCILONG(go->neg_magicnumber) +
604 LENCIVOID(go->neg_pcompression) +
605 LENCIVOID(go->neg_accompression) +
606 LENCISHORT(go->neg_mrru) +
607 LENCIVOID(go->neg_ssnhf) +
608 (go->neg_endpoint? CILEN_CHAR + go->endpoint.length: 0));
613 * lcp_addci - Add our desired CIs to a packet.
616 lcp_addci(f, ucp, lenp)
621 lcp_options *go = &lcp_gotoptions[f->unit];
622 u_char *start_ucp = ucp;
624 #define ADDCIVOID(opt, neg) \
627 PUTCHAR(CILEN_VOID, ucp); \
629 #define ADDCISHORT(opt, neg, val) \
632 PUTCHAR(CILEN_SHORT, ucp); \
633 PUTSHORT(val, ucp); \
635 #define ADDCICHAP(opt, neg, val, digest) \
638 PUTCHAR(CILEN_CHAP, ucp); \
639 PUTSHORT(val, ucp); \
640 PUTCHAR(digest, ucp); \
642 #define ADDCILONG(opt, neg, val) \
645 PUTCHAR(CILEN_LONG, ucp); \
648 #define ADDCILQR(opt, neg, val) \
651 PUTCHAR(CILEN_LQR, ucp); \
652 PUTSHORT(PPP_LQR, ucp); \
655 #define ADDCICHAR(opt, neg, val) \
658 PUTCHAR(CILEN_CHAR, ucp); \
661 #define ADDCIENDP(opt, neg, class, val, len) \
665 PUTCHAR(CILEN_CHAR + len, ucp); \
666 PUTCHAR(class, ucp); \
667 for (i = 0; i < len; ++i) \
668 PUTCHAR(val[i], ucp); \
671 ADDCISHORT(CI_MRU, go->neg_mru && go->mru != DEFMRU, go->mru);
672 ADDCILONG(CI_ASYNCMAP, go->neg_asyncmap && go->asyncmap != 0xFFFFFFFF,
674 ADDCICHAP(CI_AUTHTYPE, go->neg_chap, PPP_CHAP, go->chap_mdtype);
675 ADDCISHORT(CI_AUTHTYPE, !go->neg_chap && go->neg_upap, PPP_PAP);
676 ADDCILQR(CI_QUALITY, go->neg_lqr, go->lqr_period);
677 ADDCICHAR(CI_CALLBACK, go->neg_cbcp, CBCP_OPT);
678 ADDCILONG(CI_MAGICNUMBER, go->neg_magicnumber, go->magicnumber);
679 ADDCIVOID(CI_PCOMPRESSION, go->neg_pcompression);
680 ADDCIVOID(CI_ACCOMPRESSION, go->neg_accompression);
681 ADDCISHORT(CI_MRRU, go->neg_mrru, go->mrru);
682 ADDCIVOID(CI_SSNHF, go->neg_ssnhf);
683 ADDCIENDP(CI_EPDISC, go->neg_endpoint, go->endpoint.class,
684 go->endpoint.value, go->endpoint.length);
686 if (ucp - start_ucp != *lenp) {
687 /* this should never happen, because peer_mtu should be 1500 */
688 error("Bug in lcp_addci: wrong length");
694 * lcp_ackci - Ack our CIs.
695 * This should not modify any state if the Ack is bad.
707 lcp_options *go = &lcp_gotoptions[f->unit];
708 u_char cilen, citype, cichar;
713 * CIs must be in exactly the same order that we sent.
714 * Check packet length and CI length at each step.
715 * If we find any deviations, then this packet is bad.
717 #define ACKCIVOID(opt, neg) \
719 if ((len -= CILEN_VOID) < 0) \
721 GETCHAR(citype, p); \
723 if (cilen != CILEN_VOID || \
727 #define ACKCISHORT(opt, neg, val) \
729 if ((len -= CILEN_SHORT) < 0) \
731 GETCHAR(citype, p); \
733 if (cilen != CILEN_SHORT || \
736 GETSHORT(cishort, p); \
737 if (cishort != val) \
740 #define ACKCICHAR(opt, neg, val) \
742 if ((len -= CILEN_CHAR) < 0) \
744 GETCHAR(citype, p); \
746 if (cilen != CILEN_CHAR || \
749 GETCHAR(cichar, p); \
753 #define ACKCICHAP(opt, neg, val, digest) \
755 if ((len -= CILEN_CHAP) < 0) \
757 GETCHAR(citype, p); \
759 if (cilen != CILEN_CHAP || \
762 GETSHORT(cishort, p); \
763 if (cishort != val) \
765 GETCHAR(cichar, p); \
766 if (cichar != digest) \
769 #define ACKCILONG(opt, neg, val) \
771 if ((len -= CILEN_LONG) < 0) \
773 GETCHAR(citype, p); \
775 if (cilen != CILEN_LONG || \
778 GETLONG(cilong, p); \
782 #define ACKCILQR(opt, neg, val) \
784 if ((len -= CILEN_LQR) < 0) \
786 GETCHAR(citype, p); \
788 if (cilen != CILEN_LQR || \
791 GETSHORT(cishort, p); \
792 if (cishort != PPP_LQR) \
794 GETLONG(cilong, p); \
798 #define ACKCIENDP(opt, neg, class, val, vlen) \
801 if ((len -= CILEN_CHAR + vlen) < 0) \
803 GETCHAR(citype, p); \
805 if (cilen != CILEN_CHAR + vlen || \
808 GETCHAR(cichar, p); \
809 if (cichar != class) \
811 for (i = 0; i < vlen; ++i) { \
812 GETCHAR(cichar, p); \
813 if (cichar != val[i]) \
818 ACKCISHORT(CI_MRU, go->neg_mru && go->mru != DEFMRU, go->mru);
819 ACKCILONG(CI_ASYNCMAP, go->neg_asyncmap && go->asyncmap != 0xFFFFFFFF,
821 ACKCICHAP(CI_AUTHTYPE, go->neg_chap, PPP_CHAP, go->chap_mdtype);
822 ACKCISHORT(CI_AUTHTYPE, !go->neg_chap && go->neg_upap, PPP_PAP);
823 ACKCILQR(CI_QUALITY, go->neg_lqr, go->lqr_period);
824 ACKCICHAR(CI_CALLBACK, go->neg_cbcp, CBCP_OPT);
825 ACKCILONG(CI_MAGICNUMBER, go->neg_magicnumber, go->magicnumber);
826 ACKCIVOID(CI_PCOMPRESSION, go->neg_pcompression);
827 ACKCIVOID(CI_ACCOMPRESSION, go->neg_accompression);
828 ACKCISHORT(CI_MRRU, go->neg_mrru, go->mrru);
829 ACKCIVOID(CI_SSNHF, go->neg_ssnhf);
830 ACKCIENDP(CI_EPDISC, go->neg_endpoint, go->endpoint.class,
831 go->endpoint.value, go->endpoint.length);
834 * If there are any remaining CIs, then this packet is bad.
840 LCPDEBUG(("lcp_acki: received bad Ack!"));
846 * lcp_nakci - Peer has sent a NAK for some of our CIs.
847 * This should not modify any state if the Nak is bad
848 * or if LCP is in the OPENED state.
860 lcp_options *go = &lcp_gotoptions[f->unit];
861 lcp_options *wo = &lcp_wantoptions[f->unit];
862 u_char citype, cichar, *next;
865 lcp_options no; /* options we've seen Naks for */
866 lcp_options try; /* options to request next time */
870 BZERO(&no, sizeof(no));
874 * Any Nak'd CIs must be in exactly the same order that we sent.
875 * Check packet length and CI length at each step.
876 * If we find any deviations, then this packet is bad.
878 #define NAKCIVOID(opt, neg) \
880 len >= CILEN_VOID && \
881 p[1] == CILEN_VOID && \
884 INCPTR(CILEN_VOID, p); \
888 #define NAKCICHAP(opt, neg, code) \
890 len >= CILEN_CHAP && \
891 p[1] == CILEN_CHAP && \
895 GETSHORT(cishort, p); \
896 GETCHAR(cichar, p); \
900 #define NAKCICHAR(opt, neg, code) \
902 len >= CILEN_CHAR && \
903 p[1] == CILEN_CHAR && \
907 GETCHAR(cichar, p); \
911 #define NAKCISHORT(opt, neg, code) \
913 len >= CILEN_SHORT && \
914 p[1] == CILEN_SHORT && \
916 len -= CILEN_SHORT; \
918 GETSHORT(cishort, p); \
922 #define NAKCILONG(opt, neg, code) \
924 len >= CILEN_LONG && \
925 p[1] == CILEN_LONG && \
929 GETLONG(cilong, p); \
933 #define NAKCILQR(opt, neg, code) \
935 len >= CILEN_LQR && \
936 p[1] == CILEN_LQR && \
940 GETSHORT(cishort, p); \
941 GETLONG(cilong, p); \
945 #define NAKCIENDP(opt, neg) \
947 len >= CILEN_CHAR && \
949 p[1] >= CILEN_CHAR && \
958 * We don't care if they want to send us smaller packets than
959 * we want. Therefore, accept any MRU less than what we asked for,
960 * but then ignore the new value when setting the MRU in the kernel.
961 * If they send us a bigger MRU than what we asked, accept it, up to
962 * the limit of the default MRU we'd get if we didn't negotiate.
964 if (go->neg_mru && go->mru != DEFMRU) {
965 NAKCISHORT(CI_MRU, neg_mru,
966 if (cishort <= wo->mru || cishort <= DEFMRU)
972 * Add any characters they want to our (receive-side) asyncmap.
974 if (go->neg_asyncmap && go->asyncmap != 0xFFFFFFFF) {
975 NAKCILONG(CI_ASYNCMAP, neg_asyncmap,
976 try.asyncmap = go->asyncmap | cilong;
981 * If they've nak'd our authentication-protocol, check whether
982 * they are proposing a different protocol, or a different
983 * hash algorithm for CHAP.
985 if ((go->neg_chap || go->neg_upap)
986 && len >= CILEN_SHORT
987 && p[0] == CI_AUTHTYPE && p[1] >= CILEN_SHORT && p[1] <= len) {
990 no.neg_chap = go->neg_chap;
991 no.neg_upap = go->neg_upap;
993 GETSHORT(cishort, p);
994 if (cishort == PPP_PAP && cilen == CILEN_SHORT) {
996 * If we were asking for CHAP, they obviously don't want to do it.
997 * If we weren't asking for CHAP, then we were asking for PAP,
998 * in which case this Nak is bad.
1004 } else if (cishort == PPP_CHAP && cilen == CILEN_CHAP) {
1008 * We were asking for CHAP/MD5; they must want a different
1009 * algorithm. If they can't do MD5, we can ask for M$-CHAP
1010 * if we support it, otherwise we'll have to stop
1013 if (cichar != go->chap_mdtype) {
1015 if (cichar == CHAP_MICROSOFT)
1016 go->chap_mdtype = CHAP_MICROSOFT;
1023 * Stop asking for PAP if we were asking for it.
1030 * We don't recognize what they're suggesting.
1031 * Stop asking for what we were asking for.
1037 p += cilen - CILEN_SHORT;
1042 * If they can't cope with our link quality protocol, we'll have
1043 * to stop asking for LQR. We haven't got any other protocol.
1044 * If they Nak the reporting period, take their value XXX ?
1046 NAKCILQR(CI_QUALITY, neg_lqr,
1047 if (cishort != PPP_LQR)
1050 try.lqr_period = cilong;
1054 * Only implementing CBCP...not the rest of the callback options
1056 NAKCICHAR(CI_CALLBACK, neg_cbcp,
1061 * Check for a looped-back line.
1063 NAKCILONG(CI_MAGICNUMBER, neg_magicnumber,
1064 try.magicnumber = magic();
1069 * Peer shouldn't send Nak for protocol compression or
1070 * address/control compression requests; they should send
1071 * a Reject instead. If they send a Nak, treat it as a Reject.
1073 NAKCIVOID(CI_PCOMPRESSION, neg_pcompression);
1074 NAKCIVOID(CI_ACCOMPRESSION, neg_accompression);
1077 * Nak for MRRU option - accept their value if it is smaller
1078 * than the one we want.
1081 NAKCISHORT(CI_MRRU, neg_mrru,
1082 if (cishort <= wo->mrru)
1088 * Nak for short sequence numbers shouldn't be sent, treat it
1091 NAKCIVOID(CI_SSNHF, neg_ssnhf);
1094 * Nak of the endpoint discriminator option is not permitted,
1095 * treat it like a reject.
1097 NAKCIENDP(CI_EPDISC, neg_endpoint);
1100 * There may be remaining CIs, if the peer is requesting negotiation
1101 * on an option that we didn't include in our request packet.
1102 * If we see an option that we requested, or one we've already seen
1103 * in this packet, then this packet is bad.
1104 * If we wanted to respond by starting to negotiate on the requested
1105 * option(s), we could, but we don't, because except for the
1106 * authentication type and quality protocol, if we are not negotiating
1107 * an option, it is because we were told not to.
1108 * For the authentication type, the Nak from the peer means
1109 * `let me authenticate myself with you' which is a bit pointless.
1110 * For the quality protocol, the Nak means `ask me to send you quality
1111 * reports', but if we didn't ask for them, we don't want them.
1112 * An option we don't recognize represents the peer asking to
1113 * negotiate some option we don't support, so ignore it.
1115 while (len > CILEN_VOID) {
1118 if (cilen < CILEN_VOID || (len -= cilen) < 0)
1120 next = p + cilen - 2;
1124 if ((go->neg_mru && go->mru != DEFMRU)
1125 || no.neg_mru || cilen != CILEN_SHORT)
1127 GETSHORT(cishort, p);
1128 if (cishort < DEFMRU) {
1134 if ((go->neg_asyncmap && go->asyncmap != 0xFFFFFFFF)
1135 || no.neg_asyncmap || cilen != CILEN_LONG)
1139 if (go->neg_chap || no.neg_chap || go->neg_upap || no.neg_upap)
1142 case CI_MAGICNUMBER:
1143 if (go->neg_magicnumber || no.neg_magicnumber ||
1144 cilen != CILEN_LONG)
1147 case CI_PCOMPRESSION:
1148 if (go->neg_pcompression || no.neg_pcompression
1149 || cilen != CILEN_VOID)
1152 case CI_ACCOMPRESSION:
1153 if (go->neg_accompression || no.neg_accompression
1154 || cilen != CILEN_VOID)
1158 if (go->neg_lqr || no.neg_lqr || cilen != CILEN_LQR)
1162 if (go->neg_mrru || no.neg_mrru || cilen != CILEN_SHORT)
1166 if (go->neg_ssnhf || no.neg_ssnhf || cilen != CILEN_VOID)
1171 if (go->neg_endpoint || no.neg_endpoint || cilen < CILEN_CHAR)
1179 * OK, the Nak is good. Now we can update state.
1180 * If there are any options left we ignore them.
1182 if (f->state != OPENED) {
1184 if (++try.numloops >= lcp_loopbackfail) {
1185 notice("Serial line is looped back.");
1186 lcp_close(f->unit, "Loopback detected");
1187 status = EXIT_LOOPBACK;
1197 LCPDEBUG(("lcp_nakci: received bad Nak!"));
1203 * lcp_rejci - Peer has Rejected some of our CIs.
1204 * This should not modify any state if the Reject is bad
1205 * or if LCP is in the OPENED state.
1208 * 0 - Reject was bad.
1209 * 1 - Reject was good.
1212 lcp_rejci(f, p, len)
1217 lcp_options *go = &lcp_gotoptions[f->unit];
1221 lcp_options try; /* options to request next time */
1226 * Any Rejected CIs must be in exactly the same order that we sent.
1227 * Check packet length and CI length at each step.
1228 * If we find any deviations, then this packet is bad.
1230 #define REJCIVOID(opt, neg) \
1232 len >= CILEN_VOID && \
1233 p[1] == CILEN_VOID && \
1235 len -= CILEN_VOID; \
1236 INCPTR(CILEN_VOID, p); \
1239 #define REJCISHORT(opt, neg, val) \
1241 len >= CILEN_SHORT && \
1242 p[1] == CILEN_SHORT && \
1244 len -= CILEN_SHORT; \
1246 GETSHORT(cishort, p); \
1247 /* Check rejected value. */ \
1248 if (cishort != val) \
1252 #define REJCICHAP(opt, neg, val, digest) \
1254 len >= CILEN_CHAP && \
1255 p[1] == CILEN_CHAP && \
1257 len -= CILEN_CHAP; \
1259 GETSHORT(cishort, p); \
1260 GETCHAR(cichar, p); \
1261 /* Check rejected value. */ \
1262 if (cishort != val || cichar != digest) \
1267 #define REJCILONG(opt, neg, val) \
1269 len >= CILEN_LONG && \
1270 p[1] == CILEN_LONG && \
1272 len -= CILEN_LONG; \
1274 GETLONG(cilong, p); \
1275 /* Check rejected value. */ \
1276 if (cilong != val) \
1280 #define REJCILQR(opt, neg, val) \
1282 len >= CILEN_LQR && \
1283 p[1] == CILEN_LQR && \
1287 GETSHORT(cishort, p); \
1288 GETLONG(cilong, p); \
1289 /* Check rejected value. */ \
1290 if (cishort != PPP_LQR || cilong != val) \
1294 #define REJCICBCP(opt, neg, val) \
1296 len >= CILEN_CBCP && \
1297 p[1] == CILEN_CBCP && \
1299 len -= CILEN_CBCP; \
1301 GETCHAR(cichar, p); \
1302 /* Check rejected value. */ \
1303 if (cichar != val) \
1307 #define REJCIENDP(opt, neg, class, val, vlen) \
1309 len >= CILEN_CHAR + vlen && \
1311 p[1] == CILEN_CHAR + vlen) { \
1313 len -= CILEN_CHAR + vlen; \
1315 GETCHAR(cichar, p); \
1316 if (cichar != class) \
1318 for (i = 0; i < vlen; ++i) { \
1319 GETCHAR(cichar, p); \
1320 if (cichar != val[i]) \
1326 REJCISHORT(CI_MRU, neg_mru, go->mru);
1327 REJCILONG(CI_ASYNCMAP, neg_asyncmap, go->asyncmap);
1328 REJCICHAP(CI_AUTHTYPE, neg_chap, PPP_CHAP, go->chap_mdtype);
1329 if (!go->neg_chap) {
1330 REJCISHORT(CI_AUTHTYPE, neg_upap, PPP_PAP);
1332 REJCILQR(CI_QUALITY, neg_lqr, go->lqr_period);
1333 REJCICBCP(CI_CALLBACK, neg_cbcp, CBCP_OPT);
1334 REJCILONG(CI_MAGICNUMBER, neg_magicnumber, go->magicnumber);
1335 REJCIVOID(CI_PCOMPRESSION, neg_pcompression);
1336 REJCIVOID(CI_ACCOMPRESSION, neg_accompression);
1337 REJCISHORT(CI_MRRU, neg_mrru, go->mrru);
1338 REJCIVOID(CI_SSNHF, neg_ssnhf);
1339 REJCIENDP(CI_EPDISC, neg_endpoint, go->endpoint.class,
1340 go->endpoint.value, go->endpoint.length);
1343 * If there are any remaining CIs, then this packet is bad.
1348 * Now we can update state.
1350 if (f->state != OPENED)
1355 LCPDEBUG(("lcp_rejci: received bad Reject!"));
1361 * lcp_reqci - Check the peer's requested CIs and send appropriate response.
1363 * Returns: CONFACK, CONFNAK or CONFREJ and input packet modified
1364 * appropriately. If reject_if_disagree is non-zero, doesn't return
1365 * CONFNAK; returns CONFREJ if it can't return CONFACK.
1368 lcp_reqci(f, inp, lenp, reject_if_disagree)
1370 u_char *inp; /* Requested CIs */
1371 int *lenp; /* Length of requested CIs */
1372 int reject_if_disagree;
1374 lcp_options *go = &lcp_gotoptions[f->unit];
1375 lcp_options *ho = &lcp_hisoptions[f->unit];
1376 lcp_options *ao = &lcp_allowoptions[f->unit];
1377 u_char *cip, *next; /* Pointer to current and next CIs */
1378 int cilen, citype, cichar; /* Parsed len, type, char value */
1379 u_short cishort; /* Parsed short value */
1380 u_int32_t cilong; /* Parse long value */
1381 int rc = CONFACK; /* Final packet return code */
1382 int orc; /* Individual option return code */
1383 u_char *p; /* Pointer to next char to parse */
1384 u_char *rejp; /* Pointer to next char in reject frame */
1385 u_char *nakp; /* Pointer to next char in Nak frame */
1386 int l = *lenp; /* Length left */
1389 * Reset all his options.
1391 BZERO(ho, sizeof(*ho));
1394 * Process all his options.
1400 orc = CONFACK; /* Assume success */
1401 cip = p = next; /* Remember begining of CI */
1402 if (l < 2 || /* Not enough data for CI header or */
1403 p[1] < 2 || /* CI length too small or */
1404 p[1] > l) { /* CI length too big? */
1405 LCPDEBUG(("lcp_reqci: bad CI length!"));
1406 orc = CONFREJ; /* Reject bad CI */
1407 cilen = l; /* Reject till end of packet */
1408 l = 0; /* Don't loop again */
1412 GETCHAR(citype, p); /* Parse CI type */
1413 GETCHAR(cilen, p); /* Parse CI length */
1414 l -= cilen; /* Adjust remaining length */
1415 next += cilen; /* Step to next CI */
1417 switch (citype) { /* Check CI type */
1419 if (!ao->neg_mru || /* Allow option? */
1420 cilen != CILEN_SHORT) { /* Check CI length */
1421 orc = CONFREJ; /* Reject CI */
1424 GETSHORT(cishort, p); /* Parse MRU */
1427 * He must be able to receive at least our minimum.
1428 * No need to check a maximum. If he sends a large number,
1429 * we'll just ignore it.
1431 if (cishort < MINMRU) {
1432 orc = CONFNAK; /* Nak CI */
1433 PUTCHAR(CI_MRU, nakp);
1434 PUTCHAR(CILEN_SHORT, nakp);
1435 PUTSHORT(MINMRU, nakp); /* Give him a hint */
1438 ho->neg_mru = 1; /* Remember he sent MRU */
1439 ho->mru = cishort; /* And remember value */
1443 if (!ao->neg_asyncmap ||
1444 cilen != CILEN_LONG) {
1451 * Asyncmap must have set at least the bits
1452 * which are set in lcp_allowoptions[unit].asyncmap.
1454 if ((ao->asyncmap & ~cilong) != 0) {
1456 PUTCHAR(CI_ASYNCMAP, nakp);
1457 PUTCHAR(CILEN_LONG, nakp);
1458 PUTLONG(ao->asyncmap | cilong, nakp);
1461 ho->neg_asyncmap = 1;
1462 ho->asyncmap = cilong;
1466 if (cilen < CILEN_SHORT ||
1467 !(ao->neg_upap || ao->neg_chap)) {
1469 * Reject the option if we're not willing to authenticate.
1474 GETSHORT(cishort, p);
1477 * Authtype must be PAP or CHAP.
1479 * Note: if both ao->neg_upap and ao->neg_chap are set,
1480 * and the peer sends a Configure-Request with two
1481 * authenticate-protocol requests, one for CHAP and one
1482 * for UPAP, then we will reject the second request.
1483 * Whether we end up doing CHAP or UPAP depends then on
1484 * the ordering of the CIs in the peer's Configure-Request.
1487 if (cishort == PPP_PAP) {
1488 if (ho->neg_chap || /* we've already accepted CHAP */
1489 cilen != CILEN_SHORT) {
1490 LCPDEBUG(("lcp_reqci: rcvd AUTHTYPE PAP, rejecting..."));
1494 if (!ao->neg_upap) { /* we don't want to do PAP */
1495 orc = CONFNAK; /* NAK it and suggest CHAP */
1496 PUTCHAR(CI_AUTHTYPE, nakp);
1497 PUTCHAR(CILEN_CHAP, nakp);
1498 PUTSHORT(PPP_CHAP, nakp);
1499 PUTCHAR(ao->chap_mdtype, nakp);
1500 /* XXX if we can do CHAP_MICROSOFT as well, we should
1501 probably put in another option saying so */
1507 if (cishort == PPP_CHAP) {
1508 if (ho->neg_upap || /* we've already accepted PAP */
1509 cilen != CILEN_CHAP) {
1510 LCPDEBUG(("lcp_reqci: rcvd AUTHTYPE CHAP, rejecting..."));
1514 if (!ao->neg_chap) { /* we don't want to do CHAP */
1515 orc = CONFNAK; /* NAK it and suggest PAP */
1516 PUTCHAR(CI_AUTHTYPE, nakp);
1517 PUTCHAR(CILEN_SHORT, nakp);
1518 PUTSHORT(PPP_PAP, nakp);
1521 GETCHAR(cichar, p); /* get digest type*/
1522 if (cichar != CHAP_DIGEST_MD5
1524 && cichar != CHAP_MICROSOFT
1528 PUTCHAR(CI_AUTHTYPE, nakp);
1529 PUTCHAR(CILEN_CHAP, nakp);
1530 PUTSHORT(PPP_CHAP, nakp);
1531 PUTCHAR(ao->chap_mdtype, nakp);
1534 ho->chap_mdtype = cichar; /* save md type */
1540 * We don't recognize the protocol they're asking for.
1541 * Nak it with something we're willing to do.
1542 * (At this point we know ao->neg_upap || ao->neg_chap.)
1545 PUTCHAR(CI_AUTHTYPE, nakp);
1547 PUTCHAR(CILEN_CHAP, nakp);
1548 PUTSHORT(PPP_CHAP, nakp);
1549 PUTCHAR(ao->chap_mdtype, nakp);
1551 PUTCHAR(CILEN_SHORT, nakp);
1552 PUTSHORT(PPP_PAP, nakp);
1558 cilen != CILEN_LQR) {
1563 GETSHORT(cishort, p);
1567 * Check the protocol and the reporting period.
1568 * XXX When should we Nak this, and what with?
1570 if (cishort != PPP_LQR) {
1572 PUTCHAR(CI_QUALITY, nakp);
1573 PUTCHAR(CILEN_LQR, nakp);
1574 PUTSHORT(PPP_LQR, nakp);
1575 PUTLONG(ao->lqr_period, nakp);
1580 case CI_MAGICNUMBER:
1581 if (!(ao->neg_magicnumber || go->neg_magicnumber) ||
1582 cilen != CILEN_LONG) {
1589 * He must have a different magic number.
1591 if (go->neg_magicnumber &&
1592 cilong == go->magicnumber) {
1593 cilong = magic(); /* Don't put magic() inside macro! */
1595 PUTCHAR(CI_MAGICNUMBER, nakp);
1596 PUTCHAR(CILEN_LONG, nakp);
1597 PUTLONG(cilong, nakp);
1600 ho->neg_magicnumber = 1;
1601 ho->magicnumber = cilong;
1605 case CI_PCOMPRESSION:
1606 if (!ao->neg_pcompression ||
1607 cilen != CILEN_VOID) {
1611 ho->neg_pcompression = 1;
1614 case CI_ACCOMPRESSION:
1615 if (!ao->neg_accompression ||
1616 cilen != CILEN_VOID) {
1620 ho->neg_accompression = 1;
1624 if (!ao->neg_mrru || !multilink ||
1625 cilen != CILEN_SHORT) {
1630 GETSHORT(cishort, p);
1631 /* possibly should insist on a minimum/maximum MRRU here */
1637 if (!ao->neg_ssnhf || !multilink ||
1638 cilen != CILEN_VOID) {
1646 if (!ao->neg_endpoint ||
1647 cilen < CILEN_CHAR ||
1648 cilen > CILEN_CHAR + MAX_ENDP_LEN) {
1653 cilen -= CILEN_CHAR;
1654 ho->neg_endpoint = 1;
1655 ho->endpoint.class = cichar;
1656 ho->endpoint.length = cilen;
1657 BCOPY(p, ho->endpoint.value, cilen);
1662 LCPDEBUG(("lcp_reqci: rcvd unknown option %d", citype));
1668 if (orc == CONFACK && /* Good CI */
1669 rc != CONFACK) /* but prior CI wasnt? */
1670 continue; /* Don't send this one */
1672 if (orc == CONFNAK) { /* Nak this CI? */
1673 if (reject_if_disagree /* Getting fed up with sending NAKs? */
1674 && citype != CI_MAGICNUMBER) {
1675 orc = CONFREJ; /* Get tough if so */
1677 if (rc == CONFREJ) /* Rejecting prior CI? */
1678 continue; /* Don't send this one */
1682 if (orc == CONFREJ) { /* Reject this CI */
1684 if (cip != rejp) /* Need to move rejected CI? */
1685 BCOPY(cip, rejp, cilen); /* Move it */
1686 INCPTR(cilen, rejp); /* Update output pointer */
1691 * If we wanted to send additional NAKs (for unsent CIs), the
1692 * code would go here. The extra NAKs would go at *nakp.
1693 * At present there are no cases where we want to ask the
1694 * peer to negotiate an option.
1703 * Copy the Nak'd options from the nak_buffer to the caller's buffer.
1705 *lenp = nakp - nak_buffer;
1706 BCOPY(nak_buffer, inp, *lenp);
1713 LCPDEBUG(("lcp_reqci: returning CONF%s.", CODENAME(rc)));
1714 return (rc); /* Return final code */
1719 * lcp_up - LCP has come UP.
1725 lcp_options *wo = &lcp_wantoptions[f->unit];
1726 lcp_options *ho = &lcp_hisoptions[f->unit];
1727 lcp_options *go = &lcp_gotoptions[f->unit];
1728 lcp_options *ao = &lcp_allowoptions[f->unit];
1730 if (!go->neg_magicnumber)
1731 go->magicnumber = 0;
1732 if (!ho->neg_magicnumber)
1733 ho->magicnumber = 0;
1736 * Set our MTU to the smaller of the MTU we wanted and
1737 * the MRU our peer wanted. If we negotiated an MRU,
1738 * set our MRU to the larger of value we wanted and
1739 * the value we got in the negotiation.
1741 ppp_send_config(f->unit, MIN(ao->mru, (ho->neg_mru? ho->mru: PPP_MRU)),
1742 (ho->neg_asyncmap? ho->asyncmap: 0xffffffff),
1743 ho->neg_pcompression, ho->neg_accompression);
1744 ppp_recv_config(f->unit, (go->neg_mru? MAX(wo->mru, go->mru): PPP_MRU),
1745 (lax_recv? 0: go->neg_asyncmap? go->asyncmap: 0xffffffff),
1746 go->neg_pcompression, go->neg_accompression);
1749 peer_mru[f->unit] = ho->mru;
1751 lcp_echo_lowerup(f->unit); /* Enable echo messages */
1753 link_established(f->unit);
1758 * lcp_down - LCP has gone DOWN.
1760 * Alert other protocols.
1766 lcp_options *go = &lcp_gotoptions[f->unit];
1768 lcp_echo_lowerdown(f->unit);
1772 ppp_send_config(f->unit, PPP_MRU, 0xffffffff, 0, 0);
1773 ppp_recv_config(f->unit, PPP_MRU,
1774 (go->neg_asyncmap? go->asyncmap: 0xffffffff),
1775 go->neg_pcompression, go->neg_accompression);
1776 peer_mru[f->unit] = PPP_MRU;
1781 * lcp_starting - LCP needs the lower layer up.
1787 link_required(f->unit);
1792 * lcp_finished - LCP has finished with the lower layer.
1798 link_terminated(f->unit);
1803 * lcp_printpkt - print the contents of an LCP packet.
1805 static char *lcp_codenames[] = {
1806 "ConfReq", "ConfAck", "ConfNak", "ConfRej",
1807 "TermReq", "TermAck", "CodeRej", "ProtRej",
1808 "EchoReq", "EchoRep", "DiscReq"
1812 lcp_printpkt(p, plen, printer, arg)
1815 void (*printer) __P((void *, char *, ...));
1818 int code, id, len, olen, i;
1819 u_char *pstart, *optend;
1823 if (plen < HEADERLEN)
1829 if (len < HEADERLEN || len > plen)
1832 if (code >= 1 && code <= sizeof(lcp_codenames) / sizeof(char *))
1833 printer(arg, " %s", lcp_codenames[code-1]);
1835 printer(arg, " code=0x%x", code);
1836 printer(arg, " id=0x%x", id);
1843 /* print option list */
1848 if (olen < 2 || olen > len) {
1856 if (olen == CILEN_SHORT) {
1858 GETSHORT(cishort, p);
1859 printer(arg, "mru %d", cishort);
1863 if (olen == CILEN_LONG) {
1866 printer(arg, "asyncmap 0x%x", cilong);
1870 if (olen >= CILEN_SHORT) {
1872 printer(arg, "auth ");
1873 GETSHORT(cishort, p);
1876 printer(arg, "pap");
1879 printer(arg, "chap");
1882 case CHAP_DIGEST_MD5:
1883 printer(arg, " MD5");
1887 case CHAP_MICROSOFT:
1888 printer(arg, " m$oft");
1896 printer(arg, "0x%x", cishort);
1901 if (olen >= CILEN_SHORT) {
1903 printer(arg, "quality ");
1904 GETSHORT(cishort, p);
1907 printer(arg, "lqr");
1910 printer(arg, "0x%x", cishort);
1915 if (olen >= CILEN_CHAR) {
1917 printer(arg, "callback ");
1918 GETCHAR(cishort, p);
1921 printer(arg, "CBCP");
1924 printer(arg, "0x%x", cishort);
1928 case CI_MAGICNUMBER:
1929 if (olen == CILEN_LONG) {
1932 printer(arg, "magic 0x%x", cilong);
1935 case CI_PCOMPRESSION:
1936 if (olen == CILEN_VOID) {
1938 printer(arg, "pcomp");
1941 case CI_ACCOMPRESSION:
1942 if (olen == CILEN_VOID) {
1944 printer(arg, "accomp");
1948 if (olen == CILEN_SHORT) {
1950 GETSHORT(cishort, p);
1951 printer(arg, "mrru %d", cishort);
1955 if (olen == CILEN_VOID) {
1957 printer(arg, "ssnhf");
1961 #ifdef HAVE_MULTILINK
1962 if (olen >= CILEN_CHAR) {
1965 GETCHAR(epd.class, p);
1966 epd.length = olen - CILEN_CHAR;
1967 if (epd.length > MAX_ENDP_LEN)
1968 epd.length = MAX_ENDP_LEN;
1969 if (epd.length > 0) {
1970 BCOPY(p, epd.value, epd.length);
1973 printer(arg, "endpoint [%s]", epdisc_to_str(&epd));
1976 printer(arg, "endpoint");
1980 while (p < optend) {
1982 printer(arg, " %.2x", code);
1990 if (len > 0 && *p >= ' ' && *p < 0x7f) {
1992 print_string((char *)p, len, printer, arg);
2003 printer(arg, " magic=0x%x", cilong);
2010 /* print the rest of the bytes in the packet */
2011 for (i = 0; i < len && i < 32; ++i) {
2013 printer(arg, " %.2x", code);
2016 printer(arg, " ...");
2024 * Time to shut down the link because there is nothing out there.
2028 void LcpLinkFailure (f)
2031 if (f->state == OPENED) {
2032 info("No response to %d echo-requests", lcp_echos_pending);
2033 notice("Serial link appears to be disconnected.");
2034 lcp_close(f->unit, "Peer not responding");
2035 status = EXIT_PEER_DEAD;
2040 * Timer expired for the LCP echo requests from this process.
2047 LcpSendEchoRequest (f);
2048 if (f->state != OPENED)
2052 * Start the timer for the next interval.
2054 if (lcp_echo_timer_running)
2055 warn("assertion lcp_echo_timer_running==0 failed");
2056 TIMEOUT (LcpEchoTimeout, f, lcp_echo_interval);
2057 lcp_echo_timer_running = 1;
2061 * LcpEchoTimeout - Timer expired on the LCP echo
2065 LcpEchoTimeout (arg)
2068 if (lcp_echo_timer_running != 0) {
2069 lcp_echo_timer_running = 0;
2070 LcpEchoCheck ((fsm *) arg);
2075 * LcpEchoReply - LCP has received a reply to the echo
2079 lcp_received_echo_reply (f, id, inp, len)
2087 /* Check the magic number - don't count replies from ourselves. */
2089 dbglog("lcp: received short Echo-Reply, length %d", len);
2092 GETLONG(magic, inp);
2093 if (lcp_gotoptions[f->unit].neg_magicnumber
2094 && magic == lcp_gotoptions[f->unit].magicnumber) {
2095 warn("appear to have received our own echo-reply!");
2099 /* Reset the number of outstanding echo frames */
2100 lcp_echos_pending = 0;
2104 * LcpSendEchoRequest - Send an echo request frame to the peer
2108 LcpSendEchoRequest (f)
2111 u_int32_t lcp_magic;
2112 u_char pkt[4], *pktp;
2115 * Detect the failure of the peer at this point.
2117 if (lcp_echo_fails != 0) {
2118 if (lcp_echos_pending >= lcp_echo_fails) {
2120 lcp_echos_pending = 0;
2125 * Make and send the echo request frame.
2127 if (f->state == OPENED) {
2128 lcp_magic = lcp_gotoptions[f->unit].magicnumber;
2130 PUTLONG(lcp_magic, pktp);
2131 fsm_sdata(f, ECHOREQ, lcp_echo_number++ & 0xFF, pkt, pktp - pkt);
2132 ++lcp_echos_pending;
2137 * lcp_echo_lowerup - Start the timer for the LCP frame
2141 lcp_echo_lowerup (unit)
2144 fsm *f = &lcp_fsm[unit];
2146 /* Clear the parameters for generating echo frames */
2147 lcp_echos_pending = 0;
2148 lcp_echo_number = 0;
2149 lcp_echo_timer_running = 0;
2151 /* If a timeout interval is specified then start the timer */
2152 if (lcp_echo_interval != 0)
2157 * lcp_echo_lowerdown - Stop the timer for the LCP frame
2161 lcp_echo_lowerdown (unit)
2164 fsm *f = &lcp_fsm[unit];
2166 if (lcp_echo_timer_running != 0) {
2167 UNTIMEOUT (LcpEchoTimeout, f);
2168 lcp_echo_timer_running = 0;