CK Sin / Mbed 2 deprecated Ethernetwebsocket

Ethernetwebsoc

Dependencies:   C12832_lcd LM75B WebSocketClient mbed-rtos mbed Socket lwip-eth lwip-sys lwip

EthernetInterface/lwip/netif/ppp/lcp.c@0:0ed2a7c7190c, 2013-05-31 (annotated)

Committer:
GordonSin
Date:
Fri May 31 04:09:54 2013 +0000
Revision:
0:0ed2a7c7190c
31/5/2013;

Who changed what in which revision?

UserRevisionLine numberNew contents of line
GordonSin 0:0ed2a7c7190c 1 /*****************************************************************************
GordonSin 0:0ed2a7c7190c 2 * lcp.c - Network Link Control Protocol program file.
GordonSin 0:0ed2a7c7190c 3 *
GordonSin 0:0ed2a7c7190c 4 * Copyright (c) 2003 by Marc Boucher, Services Informatiques (MBSI) inc.
GordonSin 0:0ed2a7c7190c 5 * portions Copyright (c) 1997 by Global Election Systems Inc.
GordonSin 0:0ed2a7c7190c 6 *
GordonSin 0:0ed2a7c7190c 7 * The authors hereby grant permission to use, copy, modify, distribute,
GordonSin 0:0ed2a7c7190c 8 * and license this software and its documentation for any purpose, provided
GordonSin 0:0ed2a7c7190c 9 * that existing copyright notices are retained in all copies and that this
GordonSin 0:0ed2a7c7190c 10 * notice and the following disclaimer are included verbatim in any
GordonSin 0:0ed2a7c7190c 11 * distributions. No written agreement, license, or royalty fee is required
GordonSin 0:0ed2a7c7190c 12 * for any of the authorized uses.
GordonSin 0:0ed2a7c7190c 13 *
GordonSin 0:0ed2a7c7190c 14 * THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS *AS IS* AND ANY EXPRESS OR
GordonSin 0:0ed2a7c7190c 15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
GordonSin 0:0ed2a7c7190c 16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
GordonSin 0:0ed2a7c7190c 17 * IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
GordonSin 0:0ed2a7c7190c 18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
GordonSin 0:0ed2a7c7190c 19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
GordonSin 0:0ed2a7c7190c 20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
GordonSin 0:0ed2a7c7190c 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
GordonSin 0:0ed2a7c7190c 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
GordonSin 0:0ed2a7c7190c 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
GordonSin 0:0ed2a7c7190c 24 *
GordonSin 0:0ed2a7c7190c 25 ******************************************************************************
GordonSin 0:0ed2a7c7190c 26 * REVISION HISTORY
GordonSin 0:0ed2a7c7190c 27 *
GordonSin 0:0ed2a7c7190c 28 * 03-01-01 Marc Boucher <marc@mbsi.ca>
GordonSin 0:0ed2a7c7190c 29 * Ported to lwIP.
GordonSin 0:0ed2a7c7190c 30 * 97-12-01 Guy Lancaster <lancasterg@acm.org>, Global Election Systems Inc.
GordonSin 0:0ed2a7c7190c 31 * Original.
GordonSin 0:0ed2a7c7190c 32 *****************************************************************************/
GordonSin 0:0ed2a7c7190c 33
GordonSin 0:0ed2a7c7190c 34 /*
GordonSin 0:0ed2a7c7190c 35 * lcp.c - PPP Link Control Protocol.
GordonSin 0:0ed2a7c7190c 36 *
GordonSin 0:0ed2a7c7190c 37 * Copyright (c) 1989 Carnegie Mellon University.
GordonSin 0:0ed2a7c7190c 38 * All rights reserved.
GordonSin 0:0ed2a7c7190c 39 *
GordonSin 0:0ed2a7c7190c 40 * Redistribution and use in source and binary forms are permitted
GordonSin 0:0ed2a7c7190c 41 * provided that the above copyright notice and this paragraph are
GordonSin 0:0ed2a7c7190c 42 * duplicated in all such forms and that any documentation,
GordonSin 0:0ed2a7c7190c 43 * advertising materials, and other materials related to such
GordonSin 0:0ed2a7c7190c 44 * distribution and use acknowledge that the software was developed
GordonSin 0:0ed2a7c7190c 45 * by Carnegie Mellon University. The name of the
GordonSin 0:0ed2a7c7190c 46 * University may not be used to endorse or promote products derived
GordonSin 0:0ed2a7c7190c 47 * from this software without specific prior written permission.
GordonSin 0:0ed2a7c7190c 48 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
GordonSin 0:0ed2a7c7190c 49 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
GordonSin 0:0ed2a7c7190c 50 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
GordonSin 0:0ed2a7c7190c 51 */
GordonSin 0:0ed2a7c7190c 52
GordonSin 0:0ed2a7c7190c 53
GordonSin 0:0ed2a7c7190c 54 #include "lwip/opt.h"
GordonSin 0:0ed2a7c7190c 55
GordonSin 0:0ed2a7c7190c 56 #if PPP_SUPPORT /* don't build if not configured for use in lwipopts.h */
GordonSin 0:0ed2a7c7190c 57
GordonSin 0:0ed2a7c7190c 58 #include "ppp.h"
GordonSin 0:0ed2a7c7190c 59 #include "pppdebug.h"
GordonSin 0:0ed2a7c7190c 60
GordonSin 0:0ed2a7c7190c 61 #include "fsm.h"
GordonSin 0:0ed2a7c7190c 62 #include "chap.h"
GordonSin 0:0ed2a7c7190c 63 #include "magic.h"
GordonSin 0:0ed2a7c7190c 64 #include "auth.h"
GordonSin 0:0ed2a7c7190c 65 #include "lcp.h"
GordonSin 0:0ed2a7c7190c 66
GordonSin 0:0ed2a7c7190c 67 #include <string.h>
GordonSin 0:0ed2a7c7190c 68
GordonSin 0:0ed2a7c7190c 69 #if PPPOE_SUPPORT
GordonSin 0:0ed2a7c7190c 70 #include "netif/ppp_oe.h"
GordonSin 0:0ed2a7c7190c 71 #else
GordonSin 0:0ed2a7c7190c 72 #define PPPOE_MAXMTU PPP_MAXMRU
GordonSin 0:0ed2a7c7190c 73 #endif
GordonSin 0:0ed2a7c7190c 74
GordonSin 0:0ed2a7c7190c 75 #if 0 /* UNUSED */
GordonSin 0:0ed2a7c7190c 76 /*
GordonSin 0:0ed2a7c7190c 77 * LCP-related command-line options.
GordonSin 0:0ed2a7c7190c 78 */
GordonSin 0:0ed2a7c7190c 79 int lcp_echo_interval = 0; /* Interval between LCP echo-requests */
GordonSin 0:0ed2a7c7190c 80 int lcp_echo_fails = 0; /* Tolerance to unanswered echo-requests */
GordonSin 0:0ed2a7c7190c 81 bool lax_recv = 0; /* accept control chars in asyncmap */
GordonSin 0:0ed2a7c7190c 82
GordonSin 0:0ed2a7c7190c 83 static int setescape (char **);
GordonSin 0:0ed2a7c7190c 84
GordonSin 0:0ed2a7c7190c 85 static option_t lcp_option_list[] = {
GordonSin 0:0ed2a7c7190c 86 /* LCP options */
GordonSin 0:0ed2a7c7190c 87 /* list stripped for simplicity */
GordonSin 0:0ed2a7c7190c 88 {NULL}
GordonSin 0:0ed2a7c7190c 89 };
GordonSin 0:0ed2a7c7190c 90 #endif /* UNUSED */
GordonSin 0:0ed2a7c7190c 91
GordonSin 0:0ed2a7c7190c 92 /* options */
GordonSin 0:0ed2a7c7190c 93 LinkPhase lcp_phase[NUM_PPP]; /* Phase of link session (RFC 1661) */
GordonSin 0:0ed2a7c7190c 94 static u_int lcp_echo_interval = LCP_ECHOINTERVAL; /* Interval between LCP echo-requests */
GordonSin 0:0ed2a7c7190c 95 static u_int lcp_echo_fails = LCP_MAXECHOFAILS; /* Tolerance to unanswered echo-requests */
GordonSin 0:0ed2a7c7190c 96
GordonSin 0:0ed2a7c7190c 97 /* global vars */
GordonSin 0:0ed2a7c7190c 98 static fsm lcp_fsm[NUM_PPP]; /* LCP fsm structure (global)*/
GordonSin 0:0ed2a7c7190c 99 lcp_options lcp_wantoptions[NUM_PPP]; /* Options that we want to request */
GordonSin 0:0ed2a7c7190c 100 lcp_options lcp_gotoptions[NUM_PPP]; /* Options that peer ack'd */
GordonSin 0:0ed2a7c7190c 101 lcp_options lcp_allowoptions[NUM_PPP]; /* Options we allow peer to request */
GordonSin 0:0ed2a7c7190c 102 lcp_options lcp_hisoptions[NUM_PPP]; /* Options that we ack'd */
GordonSin 0:0ed2a7c7190c 103 ext_accm xmit_accm[NUM_PPP]; /* extended transmit ACCM */
GordonSin 0:0ed2a7c7190c 104
GordonSin 0:0ed2a7c7190c 105 static u32_t lcp_echos_pending = 0; /* Number of outstanding echo msgs */
GordonSin 0:0ed2a7c7190c 106 static u32_t lcp_echo_number = 0; /* ID number of next echo frame */
GordonSin 0:0ed2a7c7190c 107 static u32_t lcp_echo_timer_running = 0; /* TRUE if a timer is running */
GordonSin 0:0ed2a7c7190c 108
GordonSin 0:0ed2a7c7190c 109 /* @todo: do we really need such a large buffer? The typical 1500 bytes seem too much. */
GordonSin 0:0ed2a7c7190c 110 static u_char nak_buffer[PPP_MRU] __attribute((section("AHBSRAM1"))); /* where we construct a nak packet */
GordonSin 0:0ed2a7c7190c 111
GordonSin 0:0ed2a7c7190c 112 /*
GordonSin 0:0ed2a7c7190c 113 * Callbacks for fsm code. (CI = Configuration Information)
GordonSin 0:0ed2a7c7190c 114 */
GordonSin 0:0ed2a7c7190c 115 static void lcp_resetci (fsm*); /* Reset our CI */
GordonSin 0:0ed2a7c7190c 116 static int lcp_cilen (fsm*); /* Return length of our CI */
GordonSin 0:0ed2a7c7190c 117 static void lcp_addci (fsm*, u_char*, int*); /* Add our CI to pkt */
GordonSin 0:0ed2a7c7190c 118 static int lcp_ackci (fsm*, u_char*, int); /* Peer ack'd our CI */
GordonSin 0:0ed2a7c7190c 119 static int lcp_nakci (fsm*, u_char*, int); /* Peer nak'd our CI */
GordonSin 0:0ed2a7c7190c 120 static int lcp_rejci (fsm*, u_char*, int); /* Peer rej'd our CI */
GordonSin 0:0ed2a7c7190c 121 static int lcp_reqci (fsm*, u_char*, int*, int); /* Rcv peer CI */
GordonSin 0:0ed2a7c7190c 122 static void lcp_up (fsm*); /* We're UP */
GordonSin 0:0ed2a7c7190c 123 static void lcp_down (fsm*); /* We're DOWN */
GordonSin 0:0ed2a7c7190c 124 static void lcp_starting (fsm*); /* We need lower layer up */
GordonSin 0:0ed2a7c7190c 125 static void lcp_finished (fsm*); /* We need lower layer down */
GordonSin 0:0ed2a7c7190c 126 static int lcp_extcode (fsm*, int, u_char, u_char*, int);
GordonSin 0:0ed2a7c7190c 127 static void lcp_rprotrej (fsm*, u_char*, int);
GordonSin 0:0ed2a7c7190c 128
GordonSin 0:0ed2a7c7190c 129 /*
GordonSin 0:0ed2a7c7190c 130 * routines to send LCP echos to peer
GordonSin 0:0ed2a7c7190c 131 */
GordonSin 0:0ed2a7c7190c 132
GordonSin 0:0ed2a7c7190c 133 static void lcp_echo_lowerup (int);
GordonSin 0:0ed2a7c7190c 134 static void lcp_echo_lowerdown (int);
GordonSin 0:0ed2a7c7190c 135 static void LcpEchoTimeout (void*);
GordonSin 0:0ed2a7c7190c 136 static void lcp_received_echo_reply (fsm*, int, u_char*, int);
GordonSin 0:0ed2a7c7190c 137 static void LcpSendEchoRequest (fsm*);
GordonSin 0:0ed2a7c7190c 138 static void LcpLinkFailure (fsm*);
GordonSin 0:0ed2a7c7190c 139 static void LcpEchoCheck (fsm*);
GordonSin 0:0ed2a7c7190c 140
GordonSin 0:0ed2a7c7190c 141 static fsm_callbacks lcp_callbacks = { /* LCP callback routines */
GordonSin 0:0ed2a7c7190c 142 lcp_resetci, /* Reset our Configuration Information */
GordonSin 0:0ed2a7c7190c 143 lcp_cilen, /* Length of our Configuration Information */
GordonSin 0:0ed2a7c7190c 144 lcp_addci, /* Add our Configuration Information */
GordonSin 0:0ed2a7c7190c 145 lcp_ackci, /* ACK our Configuration Information */
GordonSin 0:0ed2a7c7190c 146 lcp_nakci, /* NAK our Configuration Information */
GordonSin 0:0ed2a7c7190c 147 lcp_rejci, /* Reject our Configuration Information */
GordonSin 0:0ed2a7c7190c 148 lcp_reqci, /* Request peer's Configuration Information */
GordonSin 0:0ed2a7c7190c 149 lcp_up, /* Called when fsm reaches LS_OPENED state */
GordonSin 0:0ed2a7c7190c 150 lcp_down, /* Called when fsm leaves LS_OPENED state */
GordonSin 0:0ed2a7c7190c 151 lcp_starting, /* Called when we want the lower layer up */
GordonSin 0:0ed2a7c7190c 152 lcp_finished, /* Called when we want the lower layer down */
GordonSin 0:0ed2a7c7190c 153 NULL, /* Called when Protocol-Reject received */
GordonSin 0:0ed2a7c7190c 154 NULL, /* Retransmission is necessary */
GordonSin 0:0ed2a7c7190c 155 lcp_extcode, /* Called to handle LCP-specific codes */
GordonSin 0:0ed2a7c7190c 156 "LCP" /* String name of protocol */
GordonSin 0:0ed2a7c7190c 157 };
GordonSin 0:0ed2a7c7190c 158
GordonSin 0:0ed2a7c7190c 159 /*
GordonSin 0:0ed2a7c7190c 160 * Protocol entry points.
GordonSin 0:0ed2a7c7190c 161 * Some of these are called directly.
GordonSin 0:0ed2a7c7190c 162 */
GordonSin 0:0ed2a7c7190c 163
GordonSin 0:0ed2a7c7190c 164 static void lcp_input (int, u_char *, int);
GordonSin 0:0ed2a7c7190c 165 static void lcp_protrej (int);
GordonSin 0:0ed2a7c7190c 166
GordonSin 0:0ed2a7c7190c 167 struct protent lcp_protent = {
GordonSin 0:0ed2a7c7190c 168 PPP_LCP,
GordonSin 0:0ed2a7c7190c 169 lcp_init,
GordonSin 0:0ed2a7c7190c 170 lcp_input,
GordonSin 0:0ed2a7c7190c 171 lcp_protrej,
GordonSin 0:0ed2a7c7190c 172 lcp_lowerup,
GordonSin 0:0ed2a7c7190c 173 lcp_lowerdown,
GordonSin 0:0ed2a7c7190c 174 lcp_open,
GordonSin 0:0ed2a7c7190c 175 lcp_close,
GordonSin 0:0ed2a7c7190c 176 #if PPP_ADDITIONAL_CALLBACKS
GordonSin 0:0ed2a7c7190c 177 lcp_printpkt,
GordonSin 0:0ed2a7c7190c 178 NULL,
GordonSin 0:0ed2a7c7190c 179 #endif /* PPP_ADDITIONAL_CALLBACKS */
GordonSin 0:0ed2a7c7190c 180 1,
GordonSin 0:0ed2a7c7190c 181 "LCP",
GordonSin 0:0ed2a7c7190c 182 #if PPP_ADDITIONAL_CALLBACKS
GordonSin 0:0ed2a7c7190c 183 NULL,
GordonSin 0:0ed2a7c7190c 184 NULL,
GordonSin 0:0ed2a7c7190c 185 NULL
GordonSin 0:0ed2a7c7190c 186 #endif /* PPP_ADDITIONAL_CALLBACKS */
GordonSin 0:0ed2a7c7190c 187 };
GordonSin 0:0ed2a7c7190c 188
GordonSin 0:0ed2a7c7190c 189 int lcp_loopbackfail = DEFLOOPBACKFAIL;
GordonSin 0:0ed2a7c7190c 190
GordonSin 0:0ed2a7c7190c 191 /*
GordonSin 0:0ed2a7c7190c 192 * Length of each type of configuration option (in octets)
GordonSin 0:0ed2a7c7190c 193 */
GordonSin 0:0ed2a7c7190c 194 #define CILEN_VOID 2
GordonSin 0:0ed2a7c7190c 195 #define CILEN_CHAR 3
GordonSin 0:0ed2a7c7190c 196 #define CILEN_SHORT 4 /* CILEN_VOID + sizeof(short) */
GordonSin 0:0ed2a7c7190c 197 #define CILEN_CHAP 5 /* CILEN_VOID + sizeof(short) + 1 */
GordonSin 0:0ed2a7c7190c 198 #define CILEN_LONG 6 /* CILEN_VOID + sizeof(long) */
GordonSin 0:0ed2a7c7190c 199 #define CILEN_LQR 8 /* CILEN_VOID + sizeof(short) + sizeof(long) */
GordonSin 0:0ed2a7c7190c 200 #define CILEN_CBCP 3
GordonSin 0:0ed2a7c7190c 201
GordonSin 0:0ed2a7c7190c 202 #define CODENAME(x) ((x) == CONFACK ? "ACK" : (x) == CONFNAK ? "NAK" : "REJ")
GordonSin 0:0ed2a7c7190c 203
GordonSin 0:0ed2a7c7190c 204 #if 0 /* UNUSED */
GordonSin 0:0ed2a7c7190c 205 /*
GordonSin 0:0ed2a7c7190c 206 * setescape - add chars to the set we escape on transmission.
GordonSin 0:0ed2a7c7190c 207 */
GordonSin 0:0ed2a7c7190c 208 static int
GordonSin 0:0ed2a7c7190c 209 setescape(argv)
GordonSin 0:0ed2a7c7190c 210 char **argv;
GordonSin 0:0ed2a7c7190c 211 {
GordonSin 0:0ed2a7c7190c 212 int n, ret;
GordonSin 0:0ed2a7c7190c 213 char *p, *endp;
GordonSin 0:0ed2a7c7190c 214
GordonSin 0:0ed2a7c7190c 215 p = *argv;
GordonSin 0:0ed2a7c7190c 216 ret = 1;
GordonSin 0:0ed2a7c7190c 217 while (*p) {
GordonSin 0:0ed2a7c7190c 218 n = strtol(p, &endp, 16);
GordonSin 0:0ed2a7c7190c 219 if (p == endp) {
GordonSin 0:0ed2a7c7190c 220 option_error("escape parameter contains invalid hex number '%s'", p);
GordonSin 0:0ed2a7c7190c 221 return 0;
GordonSin 0:0ed2a7c7190c 222 }
GordonSin 0:0ed2a7c7190c 223 p = endp;
GordonSin 0:0ed2a7c7190c 224 if (n < 0 || n == 0x5E || n > 0xFF) {
GordonSin 0:0ed2a7c7190c 225 option_error("can't escape character 0x%x", n);
GordonSin 0:0ed2a7c7190c 226 ret = 0;
GordonSin 0:0ed2a7c7190c 227 } else
GordonSin 0:0ed2a7c7190c 228 xmit_accm[0][n >> 5] |= 1 << (n & 0x1F);
GordonSin 0:0ed2a7c7190c 229 while (*p == ',' || *p == ' ')
GordonSin 0:0ed2a7c7190c 230 ++p;
GordonSin 0:0ed2a7c7190c 231 }
GordonSin 0:0ed2a7c7190c 232 return ret;
GordonSin 0:0ed2a7c7190c 233 }
GordonSin 0:0ed2a7c7190c 234 #endif /* UNUSED */
GordonSin 0:0ed2a7c7190c 235
GordonSin 0:0ed2a7c7190c 236 /*
GordonSin 0:0ed2a7c7190c 237 * lcp_init - Initialize LCP.
GordonSin 0:0ed2a7c7190c 238 */
GordonSin 0:0ed2a7c7190c 239 void
GordonSin 0:0ed2a7c7190c 240 lcp_init(int unit)
GordonSin 0:0ed2a7c7190c 241 {
GordonSin 0:0ed2a7c7190c 242 fsm *f = &lcp_fsm[unit];
GordonSin 0:0ed2a7c7190c 243 lcp_options *wo = &lcp_wantoptions[unit];
GordonSin 0:0ed2a7c7190c 244 lcp_options *ao = &lcp_allowoptions[unit];
GordonSin 0:0ed2a7c7190c 245
GordonSin 0:0ed2a7c7190c 246 f->unit = unit;
GordonSin 0:0ed2a7c7190c 247 f->protocol = PPP_LCP;
GordonSin 0:0ed2a7c7190c 248 f->callbacks = &lcp_callbacks;
GordonSin 0:0ed2a7c7190c 249
GordonSin 0:0ed2a7c7190c 250 fsm_init(f);
GordonSin 0:0ed2a7c7190c 251
GordonSin 0:0ed2a7c7190c 252 wo->passive = 0;
GordonSin 0:0ed2a7c7190c 253 wo->silent = 0;
GordonSin 0:0ed2a7c7190c 254 wo->restart = 0; /* Set to 1 in kernels or multi-line implementations */
GordonSin 0:0ed2a7c7190c 255 wo->neg_mru = 1;
GordonSin 0:0ed2a7c7190c 256 wo->mru = PPP_DEFMRU;
GordonSin 0:0ed2a7c7190c 257 wo->neg_asyncmap = 1;
GordonSin 0:0ed2a7c7190c 258 wo->asyncmap = 0x00000000l; /* Assume don't need to escape any ctl chars. */
GordonSin 0:0ed2a7c7190c 259 wo->neg_chap = 0; /* Set to 1 on server */
GordonSin 0:0ed2a7c7190c 260 wo->neg_upap = 0; /* Set to 1 on server */
GordonSin 0:0ed2a7c7190c 261 wo->chap_mdtype = CHAP_DIGEST_MD5;
GordonSin 0:0ed2a7c7190c 262 wo->neg_magicnumber = 1;
GordonSin 0:0ed2a7c7190c 263 wo->neg_pcompression = 1;
GordonSin 0:0ed2a7c7190c 264 wo->neg_accompression = 1;
GordonSin 0:0ed2a7c7190c 265 wo->neg_lqr = 0; /* no LQR implementation yet */
GordonSin 0:0ed2a7c7190c 266 wo->neg_cbcp = 0;
GordonSin 0:0ed2a7c7190c 267
GordonSin 0:0ed2a7c7190c 268 ao->neg_mru = 1;
GordonSin 0:0ed2a7c7190c 269 ao->mru = PPP_MAXMRU;
GordonSin 0:0ed2a7c7190c 270 ao->neg_asyncmap = 1;
GordonSin 0:0ed2a7c7190c 271 ao->asyncmap = 0x00000000l; /* Assume don't need to escape any ctl chars. */
GordonSin 0:0ed2a7c7190c 272 ao->neg_chap = (CHAP_SUPPORT != 0);
GordonSin 0:0ed2a7c7190c 273 ao->chap_mdtype = CHAP_DIGEST_MD5;
GordonSin 0:0ed2a7c7190c 274 ao->neg_upap = (PAP_SUPPORT != 0);
GordonSin 0:0ed2a7c7190c 275 ao->neg_magicnumber = 1;
GordonSin 0:0ed2a7c7190c 276 ao->neg_pcompression = 1;
GordonSin 0:0ed2a7c7190c 277 ao->neg_accompression = 1;
GordonSin 0:0ed2a7c7190c 278 ao->neg_lqr = 0; /* no LQR implementation yet */
GordonSin 0:0ed2a7c7190c 279 ao->neg_cbcp = (CBCP_SUPPORT != 0);
GordonSin 0:0ed2a7c7190c 280
GordonSin 0:0ed2a7c7190c 281 /*
GordonSin 0:0ed2a7c7190c 282 * Set transmit escape for the flag and escape characters plus anything
GordonSin 0:0ed2a7c7190c 283 * set for the allowable options.
GordonSin 0:0ed2a7c7190c 284 */
GordonSin 0:0ed2a7c7190c 285 memset(xmit_accm[unit], 0, sizeof(xmit_accm[0]));
GordonSin 0:0ed2a7c7190c 286 xmit_accm[unit][15] = 0x60;
GordonSin 0:0ed2a7c7190c 287 xmit_accm[unit][0] = (u_char)((ao->asyncmap & 0xFF));
GordonSin 0:0ed2a7c7190c 288 xmit_accm[unit][1] = (u_char)((ao->asyncmap >> 8) & 0xFF);
GordonSin 0:0ed2a7c7190c 289 xmit_accm[unit][2] = (u_char)((ao->asyncmap >> 16) & 0xFF);
GordonSin 0:0ed2a7c7190c 290 xmit_accm[unit][3] = (u_char)((ao->asyncmap >> 24) & 0xFF);
GordonSin 0:0ed2a7c7190c 291 LCPDEBUG(LOG_INFO, ("lcp_init: xmit_accm=%X %X %X %X\n",
GordonSin 0:0ed2a7c7190c 292 xmit_accm[unit][0],
GordonSin 0:0ed2a7c7190c 293 xmit_accm[unit][1],
GordonSin 0:0ed2a7c7190c 294 xmit_accm[unit][2],
GordonSin 0:0ed2a7c7190c 295 xmit_accm[unit][3]));
GordonSin 0:0ed2a7c7190c 296
GordonSin 0:0ed2a7c7190c 297 lcp_phase[unit] = PHASE_INITIALIZE;
GordonSin 0:0ed2a7c7190c 298 }
GordonSin 0:0ed2a7c7190c 299
GordonSin 0:0ed2a7c7190c 300
GordonSin 0:0ed2a7c7190c 301 /*
GordonSin 0:0ed2a7c7190c 302 * lcp_open - LCP is allowed to come up.
GordonSin 0:0ed2a7c7190c 303 */
GordonSin 0:0ed2a7c7190c 304 void
GordonSin 0:0ed2a7c7190c 305 lcp_open(int unit)
GordonSin 0:0ed2a7c7190c 306 {
GordonSin 0:0ed2a7c7190c 307 fsm *f = &lcp_fsm[unit];
GordonSin 0:0ed2a7c7190c 308 lcp_options *wo = &lcp_wantoptions[unit];
GordonSin 0:0ed2a7c7190c 309
GordonSin 0:0ed2a7c7190c 310 f->flags = 0;
GordonSin 0:0ed2a7c7190c 311 if (wo->passive) {
GordonSin 0:0ed2a7c7190c 312 f->flags |= OPT_PASSIVE;
GordonSin 0:0ed2a7c7190c 313 }
GordonSin 0:0ed2a7c7190c 314 if (wo->silent) {
GordonSin 0:0ed2a7c7190c 315 f->flags |= OPT_SILENT;
GordonSin 0:0ed2a7c7190c 316 }
GordonSin 0:0ed2a7c7190c 317 fsm_open(f);
GordonSin 0:0ed2a7c7190c 318
GordonSin 0:0ed2a7c7190c 319 lcp_phase[unit] = PHASE_ESTABLISH;
GordonSin 0:0ed2a7c7190c 320 }
GordonSin 0:0ed2a7c7190c 321
GordonSin 0:0ed2a7c7190c 322
GordonSin 0:0ed2a7c7190c 323 /*
GordonSin 0:0ed2a7c7190c 324 * lcp_close - Take LCP down.
GordonSin 0:0ed2a7c7190c 325 */
GordonSin 0:0ed2a7c7190c 326 void
GordonSin 0:0ed2a7c7190c 327 lcp_close(int unit, char *reason)
GordonSin 0:0ed2a7c7190c 328 {
GordonSin 0:0ed2a7c7190c 329 fsm *f = &lcp_fsm[unit];
GordonSin 0:0ed2a7c7190c 330
GordonSin 0:0ed2a7c7190c 331 if (lcp_phase[unit] != PHASE_DEAD) {
GordonSin 0:0ed2a7c7190c 332 lcp_phase[unit] = PHASE_TERMINATE;
GordonSin 0:0ed2a7c7190c 333 }
GordonSin 0:0ed2a7c7190c 334 if (f->state == LS_STOPPED && f->flags & (OPT_PASSIVE|OPT_SILENT)) {
GordonSin 0:0ed2a7c7190c 335 /*
GordonSin 0:0ed2a7c7190c 336 * This action is not strictly according to the FSM in RFC1548,
GordonSin 0:0ed2a7c7190c 337 * but it does mean that the program terminates if you do an
GordonSin 0:0ed2a7c7190c 338 * lcp_close() in passive/silent mode when a connection hasn't
GordonSin 0:0ed2a7c7190c 339 * been established.
GordonSin 0:0ed2a7c7190c 340 */
GordonSin 0:0ed2a7c7190c 341 f->state = LS_CLOSED;
GordonSin 0:0ed2a7c7190c 342 lcp_finished(f);
GordonSin 0:0ed2a7c7190c 343 } else {
GordonSin 0:0ed2a7c7190c 344 fsm_close(f, reason);
GordonSin 0:0ed2a7c7190c 345 }
GordonSin 0:0ed2a7c7190c 346 }
GordonSin 0:0ed2a7c7190c 347
GordonSin 0:0ed2a7c7190c 348
GordonSin 0:0ed2a7c7190c 349 /*
GordonSin 0:0ed2a7c7190c 350 * lcp_lowerup - The lower layer is up.
GordonSin 0:0ed2a7c7190c 351 */
GordonSin 0:0ed2a7c7190c 352 void
GordonSin 0:0ed2a7c7190c 353 lcp_lowerup(int unit)
GordonSin 0:0ed2a7c7190c 354 {
GordonSin 0:0ed2a7c7190c 355 lcp_options *wo = &lcp_wantoptions[unit];
GordonSin 0:0ed2a7c7190c 356
GordonSin 0:0ed2a7c7190c 357 /*
GordonSin 0:0ed2a7c7190c 358 * Don't use A/C or protocol compression on transmission,
GordonSin 0:0ed2a7c7190c 359 * but accept A/C and protocol compressed packets
GordonSin 0:0ed2a7c7190c 360 * if we are going to ask for A/C and protocol compression.
GordonSin 0:0ed2a7c7190c 361 */
GordonSin 0:0ed2a7c7190c 362 ppp_set_xaccm(unit, &xmit_accm[unit]);
GordonSin 0:0ed2a7c7190c 363 ppp_send_config(unit, PPP_MRU, 0xffffffffl, 0, 0);
GordonSin 0:0ed2a7c7190c 364 ppp_recv_config(unit, PPP_MRU, 0x00000000l,
GordonSin 0:0ed2a7c7190c 365 wo->neg_pcompression, wo->neg_accompression);
GordonSin 0:0ed2a7c7190c 366 peer_mru[unit] = PPP_MRU;
GordonSin 0:0ed2a7c7190c 367 lcp_allowoptions[unit].asyncmap = (u_long)xmit_accm[unit][0]
GordonSin 0:0ed2a7c7190c 368 | ((u_long)xmit_accm[unit][1] << 8)
GordonSin 0:0ed2a7c7190c 369 | ((u_long)xmit_accm[unit][2] << 16)
GordonSin 0:0ed2a7c7190c 370 | ((u_long)xmit_accm[unit][3] << 24);
GordonSin 0:0ed2a7c7190c 371 LCPDEBUG(LOG_INFO, ("lcp_lowerup: asyncmap=%X %X %X %X\n",
GordonSin 0:0ed2a7c7190c 372 xmit_accm[unit][3],
GordonSin 0:0ed2a7c7190c 373 xmit_accm[unit][2],
GordonSin 0:0ed2a7c7190c 374 xmit_accm[unit][1],
GordonSin 0:0ed2a7c7190c 375 xmit_accm[unit][0]));
GordonSin 0:0ed2a7c7190c 376
GordonSin 0:0ed2a7c7190c 377 fsm_lowerup(&lcp_fsm[unit]);
GordonSin 0:0ed2a7c7190c 378 }
GordonSin 0:0ed2a7c7190c 379
GordonSin 0:0ed2a7c7190c 380
GordonSin 0:0ed2a7c7190c 381 /*
GordonSin 0:0ed2a7c7190c 382 * lcp_lowerdown - The lower layer is down.
GordonSin 0:0ed2a7c7190c 383 */
GordonSin 0:0ed2a7c7190c 384 void
GordonSin 0:0ed2a7c7190c 385 lcp_lowerdown(int unit)
GordonSin 0:0ed2a7c7190c 386 {
GordonSin 0:0ed2a7c7190c 387 fsm_lowerdown(&lcp_fsm[unit]);
GordonSin 0:0ed2a7c7190c 388 }
GordonSin 0:0ed2a7c7190c 389
GordonSin 0:0ed2a7c7190c 390
GordonSin 0:0ed2a7c7190c 391 /*
GordonSin 0:0ed2a7c7190c 392 * lcp_input - Input LCP packet.
GordonSin 0:0ed2a7c7190c 393 */
GordonSin 0:0ed2a7c7190c 394 static void
GordonSin 0:0ed2a7c7190c 395 lcp_input(int unit, u_char *p, int len)
GordonSin 0:0ed2a7c7190c 396 {
GordonSin 0:0ed2a7c7190c 397 fsm *f = &lcp_fsm[unit];
GordonSin 0:0ed2a7c7190c 398
GordonSin 0:0ed2a7c7190c 399 fsm_input(f, p, len);
GordonSin 0:0ed2a7c7190c 400 }
GordonSin 0:0ed2a7c7190c 401
GordonSin 0:0ed2a7c7190c 402
GordonSin 0:0ed2a7c7190c 403 /*
GordonSin 0:0ed2a7c7190c 404 * lcp_extcode - Handle a LCP-specific code.
GordonSin 0:0ed2a7c7190c 405 */
GordonSin 0:0ed2a7c7190c 406 static int
GordonSin 0:0ed2a7c7190c 407 lcp_extcode(fsm *f, int code, u_char id, u_char *inp, int len)
GordonSin 0:0ed2a7c7190c 408 {
GordonSin 0:0ed2a7c7190c 409 u_char *magp;
GordonSin 0:0ed2a7c7190c 410
GordonSin 0:0ed2a7c7190c 411 switch( code ){
GordonSin 0:0ed2a7c7190c 412 case PROTREJ:
GordonSin 0:0ed2a7c7190c 413 lcp_rprotrej(f, inp, len);
GordonSin 0:0ed2a7c7190c 414 break;
GordonSin 0:0ed2a7c7190c 415
GordonSin 0:0ed2a7c7190c 416 case ECHOREQ:
GordonSin 0:0ed2a7c7190c 417 if (f->state != LS_OPENED) {
GordonSin 0:0ed2a7c7190c 418 break;
GordonSin 0:0ed2a7c7190c 419 }
GordonSin 0:0ed2a7c7190c 420 LCPDEBUG(LOG_INFO, ("lcp: Echo-Request, Rcvd id %d\n", id));
GordonSin 0:0ed2a7c7190c 421 magp = inp;
GordonSin 0:0ed2a7c7190c 422 PUTLONG(lcp_gotoptions[f->unit].magicnumber, magp);
GordonSin 0:0ed2a7c7190c 423 fsm_sdata(f, ECHOREP, id, inp, len);
GordonSin 0:0ed2a7c7190c 424 break;
GordonSin 0:0ed2a7c7190c 425
GordonSin 0:0ed2a7c7190c 426 case ECHOREP:
GordonSin 0:0ed2a7c7190c 427 lcp_received_echo_reply(f, id, inp, len);
GordonSin 0:0ed2a7c7190c 428 break;
GordonSin 0:0ed2a7c7190c 429
GordonSin 0:0ed2a7c7190c 430 case DISCREQ:
GordonSin 0:0ed2a7c7190c 431 break;
GordonSin 0:0ed2a7c7190c 432
GordonSin 0:0ed2a7c7190c 433 default:
GordonSin 0:0ed2a7c7190c 434 return 0;
GordonSin 0:0ed2a7c7190c 435 }
GordonSin 0:0ed2a7c7190c 436 return 1;
GordonSin 0:0ed2a7c7190c 437 }
GordonSin 0:0ed2a7c7190c 438
GordonSin 0:0ed2a7c7190c 439
GordonSin 0:0ed2a7c7190c 440 /*
GordonSin 0:0ed2a7c7190c 441 * lcp_rprotrej - Receive an Protocol-Reject.
GordonSin 0:0ed2a7c7190c 442 *
GordonSin 0:0ed2a7c7190c 443 * Figure out which protocol is rejected and inform it.
GordonSin 0:0ed2a7c7190c 444 */
GordonSin 0:0ed2a7c7190c 445 static void
GordonSin 0:0ed2a7c7190c 446 lcp_rprotrej(fsm *f, u_char *inp, int len)
GordonSin 0:0ed2a7c7190c 447 {
GordonSin 0:0ed2a7c7190c 448 int i;
GordonSin 0:0ed2a7c7190c 449 struct protent *protp;
GordonSin 0:0ed2a7c7190c 450 u_short prot;
GordonSin 0:0ed2a7c7190c 451
GordonSin 0:0ed2a7c7190c 452 if (len < (int)sizeof (u_short)) {
GordonSin 0:0ed2a7c7190c 453 LCPDEBUG(LOG_INFO, ("lcp_rprotrej: Rcvd short Protocol-Reject packet!\n"));
GordonSin 0:0ed2a7c7190c 454 return;
GordonSin 0:0ed2a7c7190c 455 }
GordonSin 0:0ed2a7c7190c 456
GordonSin 0:0ed2a7c7190c 457 GETSHORT(prot, inp);
GordonSin 0:0ed2a7c7190c 458
GordonSin 0:0ed2a7c7190c 459 LCPDEBUG(LOG_INFO, ("lcp_rprotrej: Rcvd Protocol-Reject packet for %x!\n", prot));
GordonSin 0:0ed2a7c7190c 460
GordonSin 0:0ed2a7c7190c 461 /*
GordonSin 0:0ed2a7c7190c 462 * Protocol-Reject packets received in any state other than the LCP
GordonSin 0:0ed2a7c7190c 463 * LS_OPENED state SHOULD be silently discarded.
GordonSin 0:0ed2a7c7190c 464 */
GordonSin 0:0ed2a7c7190c 465 if( f->state != LS_OPENED ) {
GordonSin 0:0ed2a7c7190c 466 LCPDEBUG(LOG_INFO, ("Protocol-Reject discarded: LCP in state %d\n", f->state));
GordonSin 0:0ed2a7c7190c 467 return;
GordonSin 0:0ed2a7c7190c 468 }
GordonSin 0:0ed2a7c7190c 469
GordonSin 0:0ed2a7c7190c 470 /*
GordonSin 0:0ed2a7c7190c 471 * Upcall the proper Protocol-Reject routine.
GordonSin 0:0ed2a7c7190c 472 */
GordonSin 0:0ed2a7c7190c 473 for (i = 0; (protp = ppp_protocols[i]) != NULL; ++i) {
GordonSin 0:0ed2a7c7190c 474 if (protp->protocol == prot && protp->enabled_flag) {
GordonSin 0:0ed2a7c7190c 475 (*protp->protrej)(f->unit);
GordonSin 0:0ed2a7c7190c 476 return;
GordonSin 0:0ed2a7c7190c 477 }
GordonSin 0:0ed2a7c7190c 478 }
GordonSin 0:0ed2a7c7190c 479
GordonSin 0:0ed2a7c7190c 480 LCPDEBUG(LOG_WARNING, ("Protocol-Reject for unsupported protocol 0x%x\n", prot));
GordonSin 0:0ed2a7c7190c 481 }
GordonSin 0:0ed2a7c7190c 482
GordonSin 0:0ed2a7c7190c 483
GordonSin 0:0ed2a7c7190c 484 /*
GordonSin 0:0ed2a7c7190c 485 * lcp_protrej - A Protocol-Reject was received.
GordonSin 0:0ed2a7c7190c 486 */
GordonSin 0:0ed2a7c7190c 487 static void
GordonSin 0:0ed2a7c7190c 488 lcp_protrej(int unit)
GordonSin 0:0ed2a7c7190c 489 {
GordonSin 0:0ed2a7c7190c 490 LWIP_UNUSED_ARG(unit);
GordonSin 0:0ed2a7c7190c 491 /*
GordonSin 0:0ed2a7c7190c 492 * Can't reject LCP!
GordonSin 0:0ed2a7c7190c 493 */
GordonSin 0:0ed2a7c7190c 494 LCPDEBUG(LOG_WARNING, ("lcp_protrej: Received Protocol-Reject for LCP!\n"));
GordonSin 0:0ed2a7c7190c 495 fsm_protreject(&lcp_fsm[unit]);
GordonSin 0:0ed2a7c7190c 496 }
GordonSin 0:0ed2a7c7190c 497
GordonSin 0:0ed2a7c7190c 498
GordonSin 0:0ed2a7c7190c 499 /*
GordonSin 0:0ed2a7c7190c 500 * lcp_sprotrej - Send a Protocol-Reject for some protocol.
GordonSin 0:0ed2a7c7190c 501 */
GordonSin 0:0ed2a7c7190c 502 void
GordonSin 0:0ed2a7c7190c 503 lcp_sprotrej(int unit, u_char *p, int len)
GordonSin 0:0ed2a7c7190c 504 {
GordonSin 0:0ed2a7c7190c 505 /*
GordonSin 0:0ed2a7c7190c 506 * Send back the protocol and the information field of the
GordonSin 0:0ed2a7c7190c 507 * rejected packet. We only get here if LCP is in the LS_OPENED state.
GordonSin 0:0ed2a7c7190c 508 */
GordonSin 0:0ed2a7c7190c 509
GordonSin 0:0ed2a7c7190c 510 fsm_sdata(&lcp_fsm[unit], PROTREJ, ++lcp_fsm[unit].id, p, len);
GordonSin 0:0ed2a7c7190c 511 }
GordonSin 0:0ed2a7c7190c 512
GordonSin 0:0ed2a7c7190c 513
GordonSin 0:0ed2a7c7190c 514 /*
GordonSin 0:0ed2a7c7190c 515 * lcp_resetci - Reset our CI.
GordonSin 0:0ed2a7c7190c 516 */
GordonSin 0:0ed2a7c7190c 517 static void
GordonSin 0:0ed2a7c7190c 518 lcp_resetci(fsm *f)
GordonSin 0:0ed2a7c7190c 519 {
GordonSin 0:0ed2a7c7190c 520 lcp_wantoptions[f->unit].magicnumber = magic();
GordonSin 0:0ed2a7c7190c 521 lcp_wantoptions[f->unit].numloops = 0;
GordonSin 0:0ed2a7c7190c 522 lcp_gotoptions[f->unit] = lcp_wantoptions[f->unit];
GordonSin 0:0ed2a7c7190c 523 peer_mru[f->unit] = PPP_MRU;
GordonSin 0:0ed2a7c7190c 524 auth_reset(f->unit);
GordonSin 0:0ed2a7c7190c 525 }
GordonSin 0:0ed2a7c7190c 526
GordonSin 0:0ed2a7c7190c 527
GordonSin 0:0ed2a7c7190c 528 /*
GordonSin 0:0ed2a7c7190c 529 * lcp_cilen - Return length of our CI.
GordonSin 0:0ed2a7c7190c 530 */
GordonSin 0:0ed2a7c7190c 531 static int
GordonSin 0:0ed2a7c7190c 532 lcp_cilen(fsm *f)
GordonSin 0:0ed2a7c7190c 533 {
GordonSin 0:0ed2a7c7190c 534 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 535
GordonSin 0:0ed2a7c7190c 536 #define LENCIVOID(neg) ((neg) ? CILEN_VOID : 0)
GordonSin 0:0ed2a7c7190c 537 #define LENCICHAP(neg) ((neg) ? CILEN_CHAP : 0)
GordonSin 0:0ed2a7c7190c 538 #define LENCISHORT(neg) ((neg) ? CILEN_SHORT : 0)
GordonSin 0:0ed2a7c7190c 539 #define LENCILONG(neg) ((neg) ? CILEN_LONG : 0)
GordonSin 0:0ed2a7c7190c 540 #define LENCILQR(neg) ((neg) ? CILEN_LQR: 0)
GordonSin 0:0ed2a7c7190c 541 #define LENCICBCP(neg) ((neg) ? CILEN_CBCP: 0)
GordonSin 0:0ed2a7c7190c 542 /*
GordonSin 0:0ed2a7c7190c 543 * NB: we only ask for one of CHAP and UPAP, even if we will
GordonSin 0:0ed2a7c7190c 544 * accept either.
GordonSin 0:0ed2a7c7190c 545 */
GordonSin 0:0ed2a7c7190c 546 return (LENCISHORT(go->neg_mru && go->mru != PPP_DEFMRU) +
GordonSin 0:0ed2a7c7190c 547 LENCILONG(go->neg_asyncmap && go->asyncmap != 0xFFFFFFFFl) +
GordonSin 0:0ed2a7c7190c 548 LENCICHAP(go->neg_chap) +
GordonSin 0:0ed2a7c7190c 549 LENCISHORT(!go->neg_chap && go->neg_upap) +
GordonSin 0:0ed2a7c7190c 550 LENCILQR(go->neg_lqr) +
GordonSin 0:0ed2a7c7190c 551 LENCICBCP(go->neg_cbcp) +
GordonSin 0:0ed2a7c7190c 552 LENCILONG(go->neg_magicnumber) +
GordonSin 0:0ed2a7c7190c 553 LENCIVOID(go->neg_pcompression) +
GordonSin 0:0ed2a7c7190c 554 LENCIVOID(go->neg_accompression));
GordonSin 0:0ed2a7c7190c 555 }
GordonSin 0:0ed2a7c7190c 556
GordonSin 0:0ed2a7c7190c 557
GordonSin 0:0ed2a7c7190c 558 /*
GordonSin 0:0ed2a7c7190c 559 * lcp_addci - Add our desired CIs to a packet.
GordonSin 0:0ed2a7c7190c 560 */
GordonSin 0:0ed2a7c7190c 561 static void
GordonSin 0:0ed2a7c7190c 562 lcp_addci(fsm *f, u_char *ucp, int *lenp)
GordonSin 0:0ed2a7c7190c 563 {
GordonSin 0:0ed2a7c7190c 564 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 565 u_char *start_ucp = ucp;
GordonSin 0:0ed2a7c7190c 566
GordonSin 0:0ed2a7c7190c 567 #define ADDCIVOID(opt, neg) \
GordonSin 0:0ed2a7c7190c 568 if (neg) { \
GordonSin 0:0ed2a7c7190c 569 LCPDEBUG(LOG_INFO, ("lcp_addci: opt=%d\n", opt)); \
GordonSin 0:0ed2a7c7190c 570 PUTCHAR(opt, ucp); \
GordonSin 0:0ed2a7c7190c 571 PUTCHAR(CILEN_VOID, ucp); \
GordonSin 0:0ed2a7c7190c 572 }
GordonSin 0:0ed2a7c7190c 573 #define ADDCISHORT(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 574 if (neg) { \
GordonSin 0:0ed2a7c7190c 575 LCPDEBUG(LOG_INFO, ("lcp_addci: INT opt=%d %X\n", opt, val)); \
GordonSin 0:0ed2a7c7190c 576 PUTCHAR(opt, ucp); \
GordonSin 0:0ed2a7c7190c 577 PUTCHAR(CILEN_SHORT, ucp); \
GordonSin 0:0ed2a7c7190c 578 PUTSHORT(val, ucp); \
GordonSin 0:0ed2a7c7190c 579 }
GordonSin 0:0ed2a7c7190c 580 #define ADDCICHAP(opt, neg, val, digest) \
GordonSin 0:0ed2a7c7190c 581 if (neg) { \
GordonSin 0:0ed2a7c7190c 582 LCPDEBUG(LOG_INFO, ("lcp_addci: CHAP opt=%d %X\n", opt, val)); \
GordonSin 0:0ed2a7c7190c 583 PUTCHAR(opt, ucp); \
GordonSin 0:0ed2a7c7190c 584 PUTCHAR(CILEN_CHAP, ucp); \
GordonSin 0:0ed2a7c7190c 585 PUTSHORT(val, ucp); \
GordonSin 0:0ed2a7c7190c 586 PUTCHAR(digest, ucp); \
GordonSin 0:0ed2a7c7190c 587 }
GordonSin 0:0ed2a7c7190c 588 #define ADDCILONG(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 589 if (neg) { \
GordonSin 0:0ed2a7c7190c 590 LCPDEBUG(LOG_INFO, ("lcp_addci: L opt=%d %lX\n", opt, val)); \
GordonSin 0:0ed2a7c7190c 591 PUTCHAR(opt, ucp); \
GordonSin 0:0ed2a7c7190c 592 PUTCHAR(CILEN_LONG, ucp); \
GordonSin 0:0ed2a7c7190c 593 PUTLONG(val, ucp); \
GordonSin 0:0ed2a7c7190c 594 }
GordonSin 0:0ed2a7c7190c 595 #define ADDCILQR(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 596 if (neg) { \
GordonSin 0:0ed2a7c7190c 597 LCPDEBUG(LOG_INFO, ("lcp_addci: LQR opt=%d %lX\n", opt, val)); \
GordonSin 0:0ed2a7c7190c 598 PUTCHAR(opt, ucp); \
GordonSin 0:0ed2a7c7190c 599 PUTCHAR(CILEN_LQR, ucp); \
GordonSin 0:0ed2a7c7190c 600 PUTSHORT(PPP_LQR, ucp); \
GordonSin 0:0ed2a7c7190c 601 PUTLONG(val, ucp); \
GordonSin 0:0ed2a7c7190c 602 }
GordonSin 0:0ed2a7c7190c 603 #define ADDCICHAR(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 604 if (neg) { \
GordonSin 0:0ed2a7c7190c 605 LCPDEBUG(LOG_INFO, ("lcp_addci: CHAR opt=%d %X '%z'\n", opt, val, val)); \
GordonSin 0:0ed2a7c7190c 606 PUTCHAR(opt, ucp); \
GordonSin 0:0ed2a7c7190c 607 PUTCHAR(CILEN_CHAR, ucp); \
GordonSin 0:0ed2a7c7190c 608 PUTCHAR(val, ucp); \
GordonSin 0:0ed2a7c7190c 609 }
GordonSin 0:0ed2a7c7190c 610
GordonSin 0:0ed2a7c7190c 611 ADDCISHORT(CI_MRU, go->neg_mru && go->mru != PPP_DEFMRU, go->mru);
GordonSin 0:0ed2a7c7190c 612 ADDCILONG(CI_ASYNCMAP, go->neg_asyncmap && go->asyncmap != 0xFFFFFFFFl, go->asyncmap);
GordonSin 0:0ed2a7c7190c 613 ADDCICHAP(CI_AUTHTYPE, go->neg_chap, PPP_CHAP, go->chap_mdtype);
GordonSin 0:0ed2a7c7190c 614 ADDCISHORT(CI_AUTHTYPE, !go->neg_chap && go->neg_upap, PPP_PAP);
GordonSin 0:0ed2a7c7190c 615 ADDCILQR(CI_QUALITY, go->neg_lqr, go->lqr_period);
GordonSin 0:0ed2a7c7190c 616 ADDCICHAR(CI_CALLBACK, go->neg_cbcp, CBCP_OPT);
GordonSin 0:0ed2a7c7190c 617 ADDCILONG(CI_MAGICNUMBER, go->neg_magicnumber, go->magicnumber);
GordonSin 0:0ed2a7c7190c 618 ADDCIVOID(CI_PCOMPRESSION, go->neg_pcompression);
GordonSin 0:0ed2a7c7190c 619 ADDCIVOID(CI_ACCOMPRESSION, go->neg_accompression);
GordonSin 0:0ed2a7c7190c 620
GordonSin 0:0ed2a7c7190c 621 if (ucp - start_ucp != *lenp) {
GordonSin 0:0ed2a7c7190c 622 /* this should never happen, because peer_mtu should be 1500 */
GordonSin 0:0ed2a7c7190c 623 LCPDEBUG(LOG_ERR, ("Bug in lcp_addci: wrong length\n"));
GordonSin 0:0ed2a7c7190c 624 }
GordonSin 0:0ed2a7c7190c 625 }
GordonSin 0:0ed2a7c7190c 626
GordonSin 0:0ed2a7c7190c 627
GordonSin 0:0ed2a7c7190c 628 /*
GordonSin 0:0ed2a7c7190c 629 * lcp_ackci - Ack our CIs.
GordonSin 0:0ed2a7c7190c 630 * This should not modify any state if the Ack is bad.
GordonSin 0:0ed2a7c7190c 631 *
GordonSin 0:0ed2a7c7190c 632 * Returns:
GordonSin 0:0ed2a7c7190c 633 * 0 - Ack was bad.
GordonSin 0:0ed2a7c7190c 634 * 1 - Ack was good.
GordonSin 0:0ed2a7c7190c 635 */
GordonSin 0:0ed2a7c7190c 636 static int
GordonSin 0:0ed2a7c7190c 637 lcp_ackci(fsm *f, u_char *p, int len)
GordonSin 0:0ed2a7c7190c 638 {
GordonSin 0:0ed2a7c7190c 639 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 640 u_char cilen, citype, cichar;
GordonSin 0:0ed2a7c7190c 641 u_short cishort;
GordonSin 0:0ed2a7c7190c 642 u32_t cilong;
GordonSin 0:0ed2a7c7190c 643
GordonSin 0:0ed2a7c7190c 644 /*
GordonSin 0:0ed2a7c7190c 645 * CIs must be in exactly the same order that we sent.
GordonSin 0:0ed2a7c7190c 646 * Check packet length and CI length at each step.
GordonSin 0:0ed2a7c7190c 647 * If we find any deviations, then this packet is bad.
GordonSin 0:0ed2a7c7190c 648 */
GordonSin 0:0ed2a7c7190c 649 #define ACKCIVOID(opt, neg) \
GordonSin 0:0ed2a7c7190c 650 if (neg) { \
GordonSin 0:0ed2a7c7190c 651 if ((len -= CILEN_VOID) < 0) \
GordonSin 0:0ed2a7c7190c 652 goto bad; \
GordonSin 0:0ed2a7c7190c 653 GETCHAR(citype, p); \
GordonSin 0:0ed2a7c7190c 654 GETCHAR(cilen, p); \
GordonSin 0:0ed2a7c7190c 655 if (cilen != CILEN_VOID || citype != opt) \
GordonSin 0:0ed2a7c7190c 656 goto bad; \
GordonSin 0:0ed2a7c7190c 657 }
GordonSin 0:0ed2a7c7190c 658 #define ACKCISHORT(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 659 if (neg) { \
GordonSin 0:0ed2a7c7190c 660 if ((len -= CILEN_SHORT) < 0) \
GordonSin 0:0ed2a7c7190c 661 goto bad; \
GordonSin 0:0ed2a7c7190c 662 GETCHAR(citype, p); \
GordonSin 0:0ed2a7c7190c 663 GETCHAR(cilen, p); \
GordonSin 0:0ed2a7c7190c 664 if (cilen != CILEN_SHORT || citype != opt) \
GordonSin 0:0ed2a7c7190c 665 goto bad; \
GordonSin 0:0ed2a7c7190c 666 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 667 if (cishort != val) \
GordonSin 0:0ed2a7c7190c 668 goto bad; \
GordonSin 0:0ed2a7c7190c 669 }
GordonSin 0:0ed2a7c7190c 670 #define ACKCICHAR(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 671 if (neg) { \
GordonSin 0:0ed2a7c7190c 672 if ((len -= CILEN_CHAR) < 0) \
GordonSin 0:0ed2a7c7190c 673 goto bad; \
GordonSin 0:0ed2a7c7190c 674 GETCHAR(citype, p); \
GordonSin 0:0ed2a7c7190c 675 GETCHAR(cilen, p); \
GordonSin 0:0ed2a7c7190c 676 if (cilen != CILEN_CHAR || citype != opt) \
GordonSin 0:0ed2a7c7190c 677 goto bad; \
GordonSin 0:0ed2a7c7190c 678 GETCHAR(cichar, p); \
GordonSin 0:0ed2a7c7190c 679 if (cichar != val) \
GordonSin 0:0ed2a7c7190c 680 goto bad; \
GordonSin 0:0ed2a7c7190c 681 }
GordonSin 0:0ed2a7c7190c 682 #define ACKCICHAP(opt, neg, val, digest) \
GordonSin 0:0ed2a7c7190c 683 if (neg) { \
GordonSin 0:0ed2a7c7190c 684 if ((len -= CILEN_CHAP) < 0) \
GordonSin 0:0ed2a7c7190c 685 goto bad; \
GordonSin 0:0ed2a7c7190c 686 GETCHAR(citype, p); \
GordonSin 0:0ed2a7c7190c 687 GETCHAR(cilen, p); \
GordonSin 0:0ed2a7c7190c 688 if (cilen != CILEN_CHAP || citype != opt) \
GordonSin 0:0ed2a7c7190c 689 goto bad; \
GordonSin 0:0ed2a7c7190c 690 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 691 if (cishort != val) \
GordonSin 0:0ed2a7c7190c 692 goto bad; \
GordonSin 0:0ed2a7c7190c 693 GETCHAR(cichar, p); \
GordonSin 0:0ed2a7c7190c 694 if (cichar != digest) \
GordonSin 0:0ed2a7c7190c 695 goto bad; \
GordonSin 0:0ed2a7c7190c 696 }
GordonSin 0:0ed2a7c7190c 697 #define ACKCILONG(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 698 if (neg) { \
GordonSin 0:0ed2a7c7190c 699 if ((len -= CILEN_LONG) < 0) \
GordonSin 0:0ed2a7c7190c 700 goto bad; \
GordonSin 0:0ed2a7c7190c 701 GETCHAR(citype, p); \
GordonSin 0:0ed2a7c7190c 702 GETCHAR(cilen, p); \
GordonSin 0:0ed2a7c7190c 703 if (cilen != CILEN_LONG || citype != opt) \
GordonSin 0:0ed2a7c7190c 704 goto bad; \
GordonSin 0:0ed2a7c7190c 705 GETLONG(cilong, p); \
GordonSin 0:0ed2a7c7190c 706 if (cilong != val) \
GordonSin 0:0ed2a7c7190c 707 goto bad; \
GordonSin 0:0ed2a7c7190c 708 }
GordonSin 0:0ed2a7c7190c 709 #define ACKCILQR(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 710 if (neg) { \
GordonSin 0:0ed2a7c7190c 711 if ((len -= CILEN_LQR) < 0) \
GordonSin 0:0ed2a7c7190c 712 goto bad; \
GordonSin 0:0ed2a7c7190c 713 GETCHAR(citype, p); \
GordonSin 0:0ed2a7c7190c 714 GETCHAR(cilen, p); \
GordonSin 0:0ed2a7c7190c 715 if (cilen != CILEN_LQR || citype != opt) \
GordonSin 0:0ed2a7c7190c 716 goto bad; \
GordonSin 0:0ed2a7c7190c 717 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 718 if (cishort != PPP_LQR) \
GordonSin 0:0ed2a7c7190c 719 goto bad; \
GordonSin 0:0ed2a7c7190c 720 GETLONG(cilong, p); \
GordonSin 0:0ed2a7c7190c 721 if (cilong != val) \
GordonSin 0:0ed2a7c7190c 722 goto bad; \
GordonSin 0:0ed2a7c7190c 723 }
GordonSin 0:0ed2a7c7190c 724
GordonSin 0:0ed2a7c7190c 725 ACKCISHORT(CI_MRU, go->neg_mru && go->mru != PPP_DEFMRU, go->mru);
GordonSin 0:0ed2a7c7190c 726 ACKCILONG(CI_ASYNCMAP, go->neg_asyncmap && go->asyncmap != 0xFFFFFFFFl, go->asyncmap);
GordonSin 0:0ed2a7c7190c 727 ACKCICHAP(CI_AUTHTYPE, go->neg_chap, PPP_CHAP, go->chap_mdtype);
GordonSin 0:0ed2a7c7190c 728 ACKCISHORT(CI_AUTHTYPE, !go->neg_chap && go->neg_upap, PPP_PAP);
GordonSin 0:0ed2a7c7190c 729 ACKCILQR(CI_QUALITY, go->neg_lqr, go->lqr_period);
GordonSin 0:0ed2a7c7190c 730 ACKCICHAR(CI_CALLBACK, go->neg_cbcp, CBCP_OPT);
GordonSin 0:0ed2a7c7190c 731 ACKCILONG(CI_MAGICNUMBER, go->neg_magicnumber, go->magicnumber);
GordonSin 0:0ed2a7c7190c 732 ACKCIVOID(CI_PCOMPRESSION, go->neg_pcompression);
GordonSin 0:0ed2a7c7190c 733 ACKCIVOID(CI_ACCOMPRESSION, go->neg_accompression);
GordonSin 0:0ed2a7c7190c 734
GordonSin 0:0ed2a7c7190c 735 /*
GordonSin 0:0ed2a7c7190c 736 * If there are any remaining CIs, then this packet is bad.
GordonSin 0:0ed2a7c7190c 737 */
GordonSin 0:0ed2a7c7190c 738 if (len != 0) {
GordonSin 0:0ed2a7c7190c 739 goto bad;
GordonSin 0:0ed2a7c7190c 740 }
GordonSin 0:0ed2a7c7190c 741 LCPDEBUG(LOG_INFO, ("lcp_acki: Ack\n"));
GordonSin 0:0ed2a7c7190c 742 return (1);
GordonSin 0:0ed2a7c7190c 743 bad:
GordonSin 0:0ed2a7c7190c 744 LCPDEBUG(LOG_WARNING, ("lcp_acki: received bad Ack!\n"));
GordonSin 0:0ed2a7c7190c 745 return (0);
GordonSin 0:0ed2a7c7190c 746 }
GordonSin 0:0ed2a7c7190c 747
GordonSin 0:0ed2a7c7190c 748
GordonSin 0:0ed2a7c7190c 749 /*
GordonSin 0:0ed2a7c7190c 750 * lcp_nakci - Peer has sent a NAK for some of our CIs.
GordonSin 0:0ed2a7c7190c 751 * This should not modify any state if the Nak is bad
GordonSin 0:0ed2a7c7190c 752 * or if LCP is in the LS_OPENED state.
GordonSin 0:0ed2a7c7190c 753 *
GordonSin 0:0ed2a7c7190c 754 * Returns:
GordonSin 0:0ed2a7c7190c 755 * 0 - Nak was bad.
GordonSin 0:0ed2a7c7190c 756 * 1 - Nak was good.
GordonSin 0:0ed2a7c7190c 757 */
GordonSin 0:0ed2a7c7190c 758 static int
GordonSin 0:0ed2a7c7190c 759 lcp_nakci(fsm *f, u_char *p, int len)
GordonSin 0:0ed2a7c7190c 760 {
GordonSin 0:0ed2a7c7190c 761 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 762 lcp_options *wo = &lcp_wantoptions[f->unit];
GordonSin 0:0ed2a7c7190c 763 u_char citype, cichar, *next;
GordonSin 0:0ed2a7c7190c 764 u_short cishort;
GordonSin 0:0ed2a7c7190c 765 u32_t cilong;
GordonSin 0:0ed2a7c7190c 766 lcp_options no; /* options we've seen Naks for */
GordonSin 0:0ed2a7c7190c 767 lcp_options try; /* options to request next time */
GordonSin 0:0ed2a7c7190c 768 int looped_back = 0;
GordonSin 0:0ed2a7c7190c 769 int cilen;
GordonSin 0:0ed2a7c7190c 770
GordonSin 0:0ed2a7c7190c 771 BZERO(&no, sizeof(no));
GordonSin 0:0ed2a7c7190c 772 try = *go;
GordonSin 0:0ed2a7c7190c 773
GordonSin 0:0ed2a7c7190c 774 /*
GordonSin 0:0ed2a7c7190c 775 * Any Nak'd CIs must be in exactly the same order that we sent.
GordonSin 0:0ed2a7c7190c 776 * Check packet length and CI length at each step.
GordonSin 0:0ed2a7c7190c 777 * If we find any deviations, then this packet is bad.
GordonSin 0:0ed2a7c7190c 778 */
GordonSin 0:0ed2a7c7190c 779 #define NAKCIVOID(opt, neg, code) \
GordonSin 0:0ed2a7c7190c 780 if (go->neg && \
GordonSin 0:0ed2a7c7190c 781 len >= CILEN_VOID && \
GordonSin 0:0ed2a7c7190c 782 p[1] == CILEN_VOID && \
GordonSin 0:0ed2a7c7190c 783 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 784 len -= CILEN_VOID; \
GordonSin 0:0ed2a7c7190c 785 INCPTR(CILEN_VOID, p); \
GordonSin 0:0ed2a7c7190c 786 no.neg = 1; \
GordonSin 0:0ed2a7c7190c 787 code \
GordonSin 0:0ed2a7c7190c 788 }
GordonSin 0:0ed2a7c7190c 789 #define NAKCICHAP(opt, neg, code) \
GordonSin 0:0ed2a7c7190c 790 if (go->neg && \
GordonSin 0:0ed2a7c7190c 791 len >= CILEN_CHAP && \
GordonSin 0:0ed2a7c7190c 792 p[1] == CILEN_CHAP && \
GordonSin 0:0ed2a7c7190c 793 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 794 len -= CILEN_CHAP; \
GordonSin 0:0ed2a7c7190c 795 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 796 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 797 GETCHAR(cichar, p); \
GordonSin 0:0ed2a7c7190c 798 no.neg = 1; \
GordonSin 0:0ed2a7c7190c 799 code \
GordonSin 0:0ed2a7c7190c 800 }
GordonSin 0:0ed2a7c7190c 801 #define NAKCICHAR(opt, neg, code) \
GordonSin 0:0ed2a7c7190c 802 if (go->neg && \
GordonSin 0:0ed2a7c7190c 803 len >= CILEN_CHAR && \
GordonSin 0:0ed2a7c7190c 804 p[1] == CILEN_CHAR && \
GordonSin 0:0ed2a7c7190c 805 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 806 len -= CILEN_CHAR; \
GordonSin 0:0ed2a7c7190c 807 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 808 GETCHAR(cichar, p); \
GordonSin 0:0ed2a7c7190c 809 no.neg = 1; \
GordonSin 0:0ed2a7c7190c 810 code \
GordonSin 0:0ed2a7c7190c 811 }
GordonSin 0:0ed2a7c7190c 812 #define NAKCISHORT(opt, neg, code) \
GordonSin 0:0ed2a7c7190c 813 if (go->neg && \
GordonSin 0:0ed2a7c7190c 814 len >= CILEN_SHORT && \
GordonSin 0:0ed2a7c7190c 815 p[1] == CILEN_SHORT && \
GordonSin 0:0ed2a7c7190c 816 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 817 len -= CILEN_SHORT; \
GordonSin 0:0ed2a7c7190c 818 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 819 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 820 no.neg = 1; \
GordonSin 0:0ed2a7c7190c 821 code \
GordonSin 0:0ed2a7c7190c 822 }
GordonSin 0:0ed2a7c7190c 823 #define NAKCILONG(opt, neg, code) \
GordonSin 0:0ed2a7c7190c 824 if (go->neg && \
GordonSin 0:0ed2a7c7190c 825 len >= CILEN_LONG && \
GordonSin 0:0ed2a7c7190c 826 p[1] == CILEN_LONG && \
GordonSin 0:0ed2a7c7190c 827 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 828 len -= CILEN_LONG; \
GordonSin 0:0ed2a7c7190c 829 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 830 GETLONG(cilong, p); \
GordonSin 0:0ed2a7c7190c 831 no.neg = 1; \
GordonSin 0:0ed2a7c7190c 832 code \
GordonSin 0:0ed2a7c7190c 833 }
GordonSin 0:0ed2a7c7190c 834 #define NAKCILQR(opt, neg, code) \
GordonSin 0:0ed2a7c7190c 835 if (go->neg && \
GordonSin 0:0ed2a7c7190c 836 len >= CILEN_LQR && \
GordonSin 0:0ed2a7c7190c 837 p[1] == CILEN_LQR && \
GordonSin 0:0ed2a7c7190c 838 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 839 len -= CILEN_LQR; \
GordonSin 0:0ed2a7c7190c 840 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 841 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 842 GETLONG(cilong, p); \
GordonSin 0:0ed2a7c7190c 843 no.neg = 1; \
GordonSin 0:0ed2a7c7190c 844 code \
GordonSin 0:0ed2a7c7190c 845 }
GordonSin 0:0ed2a7c7190c 846
GordonSin 0:0ed2a7c7190c 847 /*
GordonSin 0:0ed2a7c7190c 848 * We don't care if they want to send us smaller packets than
GordonSin 0:0ed2a7c7190c 849 * we want. Therefore, accept any MRU less than what we asked for,
GordonSin 0:0ed2a7c7190c 850 * but then ignore the new value when setting the MRU in the kernel.
GordonSin 0:0ed2a7c7190c 851 * If they send us a bigger MRU than what we asked, accept it, up to
GordonSin 0:0ed2a7c7190c 852 * the limit of the default MRU we'd get if we didn't negotiate.
GordonSin 0:0ed2a7c7190c 853 */
GordonSin 0:0ed2a7c7190c 854 if (go->neg_mru && go->mru != PPP_DEFMRU) {
GordonSin 0:0ed2a7c7190c 855 NAKCISHORT(CI_MRU, neg_mru,
GordonSin 0:0ed2a7c7190c 856 if (cishort <= wo->mru || cishort < PPP_DEFMRU) {
GordonSin 0:0ed2a7c7190c 857 try.mru = cishort;
GordonSin 0:0ed2a7c7190c 858 }
GordonSin 0:0ed2a7c7190c 859 );
GordonSin 0:0ed2a7c7190c 860 }
GordonSin 0:0ed2a7c7190c 861
GordonSin 0:0ed2a7c7190c 862 /*
GordonSin 0:0ed2a7c7190c 863 * Add any characters they want to our (receive-side) asyncmap.
GordonSin 0:0ed2a7c7190c 864 */
GordonSin 0:0ed2a7c7190c 865 if (go->neg_asyncmap && go->asyncmap != 0xFFFFFFFFl) {
GordonSin 0:0ed2a7c7190c 866 NAKCILONG(CI_ASYNCMAP, neg_asyncmap,
GordonSin 0:0ed2a7c7190c 867 try.asyncmap = go->asyncmap | cilong;
GordonSin 0:0ed2a7c7190c 868 );
GordonSin 0:0ed2a7c7190c 869 }
GordonSin 0:0ed2a7c7190c 870
GordonSin 0:0ed2a7c7190c 871 /*
GordonSin 0:0ed2a7c7190c 872 * If they've nak'd our authentication-protocol, check whether
GordonSin 0:0ed2a7c7190c 873 * they are proposing a different protocol, or a different
GordonSin 0:0ed2a7c7190c 874 * hash algorithm for CHAP.
GordonSin 0:0ed2a7c7190c 875 */
GordonSin 0:0ed2a7c7190c 876 if ((go->neg_chap || go->neg_upap)
GordonSin 0:0ed2a7c7190c 877 && len >= CILEN_SHORT
GordonSin 0:0ed2a7c7190c 878 && p[0] == CI_AUTHTYPE && p[1] >= CILEN_SHORT && p[1] <= len) {
GordonSin 0:0ed2a7c7190c 879 cilen = p[1];
GordonSin 0:0ed2a7c7190c 880 len -= cilen;
GordonSin 0:0ed2a7c7190c 881 no.neg_chap = go->neg_chap;
GordonSin 0:0ed2a7c7190c 882 no.neg_upap = go->neg_upap;
GordonSin 0:0ed2a7c7190c 883 INCPTR(2, p);
GordonSin 0:0ed2a7c7190c 884 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 885 if (cishort == PPP_PAP && cilen == CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 886 /*
GordonSin 0:0ed2a7c7190c 887 * If we were asking for CHAP, they obviously don't want to do it.
GordonSin 0:0ed2a7c7190c 888 * If we weren't asking for CHAP, then we were asking for PAP,
GordonSin 0:0ed2a7c7190c 889 * in which case this Nak is bad.
GordonSin 0:0ed2a7c7190c 890 */
GordonSin 0:0ed2a7c7190c 891 if (!go->neg_chap) {
GordonSin 0:0ed2a7c7190c 892 goto bad;
GordonSin 0:0ed2a7c7190c 893 }
GordonSin 0:0ed2a7c7190c 894 try.neg_chap = 0;
GordonSin 0:0ed2a7c7190c 895
GordonSin 0:0ed2a7c7190c 896 } else if (cishort == PPP_CHAP && cilen == CILEN_CHAP) {
GordonSin 0:0ed2a7c7190c 897 GETCHAR(cichar, p);
GordonSin 0:0ed2a7c7190c 898 if (go->neg_chap) {
GordonSin 0:0ed2a7c7190c 899 /*
GordonSin 0:0ed2a7c7190c 900 * We were asking for CHAP/MD5; they must want a different
GordonSin 0:0ed2a7c7190c 901 * algorithm. If they can't do MD5, we'll have to stop
GordonSin 0:0ed2a7c7190c 902 * asking for CHAP.
GordonSin 0:0ed2a7c7190c 903 */
GordonSin 0:0ed2a7c7190c 904 if (cichar != go->chap_mdtype) {
GordonSin 0:0ed2a7c7190c 905 try.neg_chap = 0;
GordonSin 0:0ed2a7c7190c 906 }
GordonSin 0:0ed2a7c7190c 907 } else {
GordonSin 0:0ed2a7c7190c 908 /*
GordonSin 0:0ed2a7c7190c 909 * Stop asking for PAP if we were asking for it.
GordonSin 0:0ed2a7c7190c 910 */
GordonSin 0:0ed2a7c7190c 911 try.neg_upap = 0;
GordonSin 0:0ed2a7c7190c 912 }
GordonSin 0:0ed2a7c7190c 913
GordonSin 0:0ed2a7c7190c 914 } else {
GordonSin 0:0ed2a7c7190c 915 /*
GordonSin 0:0ed2a7c7190c 916 * We don't recognize what they're suggesting.
GordonSin 0:0ed2a7c7190c 917 * Stop asking for what we were asking for.
GordonSin 0:0ed2a7c7190c 918 */
GordonSin 0:0ed2a7c7190c 919 if (go->neg_chap) {
GordonSin 0:0ed2a7c7190c 920 try.neg_chap = 0;
GordonSin 0:0ed2a7c7190c 921 } else {
GordonSin 0:0ed2a7c7190c 922 try.neg_upap = 0;
GordonSin 0:0ed2a7c7190c 923 }
GordonSin 0:0ed2a7c7190c 924 p += cilen - CILEN_SHORT;
GordonSin 0:0ed2a7c7190c 925 }
GordonSin 0:0ed2a7c7190c 926 }
GordonSin 0:0ed2a7c7190c 927
GordonSin 0:0ed2a7c7190c 928 /*
GordonSin 0:0ed2a7c7190c 929 * If they can't cope with our link quality protocol, we'll have
GordonSin 0:0ed2a7c7190c 930 * to stop asking for LQR. We haven't got any other protocol.
GordonSin 0:0ed2a7c7190c 931 * If they Nak the reporting period, take their value XXX ?
GordonSin 0:0ed2a7c7190c 932 */
GordonSin 0:0ed2a7c7190c 933 NAKCILQR(CI_QUALITY, neg_lqr,
GordonSin 0:0ed2a7c7190c 934 if (cishort != PPP_LQR) {
GordonSin 0:0ed2a7c7190c 935 try.neg_lqr = 0;
GordonSin 0:0ed2a7c7190c 936 } else {
GordonSin 0:0ed2a7c7190c 937 try.lqr_period = cilong;
GordonSin 0:0ed2a7c7190c 938 }
GordonSin 0:0ed2a7c7190c 939 );
GordonSin 0:0ed2a7c7190c 940
GordonSin 0:0ed2a7c7190c 941 /*
GordonSin 0:0ed2a7c7190c 942 * Only implementing CBCP...not the rest of the callback options
GordonSin 0:0ed2a7c7190c 943 */
GordonSin 0:0ed2a7c7190c 944 NAKCICHAR(CI_CALLBACK, neg_cbcp,
GordonSin 0:0ed2a7c7190c 945 try.neg_cbcp = 0;
GordonSin 0:0ed2a7c7190c 946 );
GordonSin 0:0ed2a7c7190c 947
GordonSin 0:0ed2a7c7190c 948 /*
GordonSin 0:0ed2a7c7190c 949 * Check for a looped-back line.
GordonSin 0:0ed2a7c7190c 950 */
GordonSin 0:0ed2a7c7190c 951 NAKCILONG(CI_MAGICNUMBER, neg_magicnumber,
GordonSin 0:0ed2a7c7190c 952 try.magicnumber = magic();
GordonSin 0:0ed2a7c7190c 953 looped_back = 1;
GordonSin 0:0ed2a7c7190c 954 );
GordonSin 0:0ed2a7c7190c 955
GordonSin 0:0ed2a7c7190c 956 /*
GordonSin 0:0ed2a7c7190c 957 * Peer shouldn't send Nak for protocol compression or
GordonSin 0:0ed2a7c7190c 958 * address/control compression requests; they should send
GordonSin 0:0ed2a7c7190c 959 * a Reject instead. If they send a Nak, treat it as a Reject.
GordonSin 0:0ed2a7c7190c 960 */
GordonSin 0:0ed2a7c7190c 961 NAKCIVOID(CI_PCOMPRESSION, neg_pcompression,
GordonSin 0:0ed2a7c7190c 962 try.neg_pcompression = 0;
GordonSin 0:0ed2a7c7190c 963 );
GordonSin 0:0ed2a7c7190c 964 NAKCIVOID(CI_ACCOMPRESSION, neg_accompression,
GordonSin 0:0ed2a7c7190c 965 try.neg_accompression = 0;
GordonSin 0:0ed2a7c7190c 966 );
GordonSin 0:0ed2a7c7190c 967
GordonSin 0:0ed2a7c7190c 968 /*
GordonSin 0:0ed2a7c7190c 969 * There may be remaining CIs, if the peer is requesting negotiation
GordonSin 0:0ed2a7c7190c 970 * on an option that we didn't include in our request packet.
GordonSin 0:0ed2a7c7190c 971 * If we see an option that we requested, or one we've already seen
GordonSin 0:0ed2a7c7190c 972 * in this packet, then this packet is bad.
GordonSin 0:0ed2a7c7190c 973 * If we wanted to respond by starting to negotiate on the requested
GordonSin 0:0ed2a7c7190c 974 * option(s), we could, but we don't, because except for the
GordonSin 0:0ed2a7c7190c 975 * authentication type and quality protocol, if we are not negotiating
GordonSin 0:0ed2a7c7190c 976 * an option, it is because we were told not to.
GordonSin 0:0ed2a7c7190c 977 * For the authentication type, the Nak from the peer means
GordonSin 0:0ed2a7c7190c 978 * `let me authenticate myself with you' which is a bit pointless.
GordonSin 0:0ed2a7c7190c 979 * For the quality protocol, the Nak means `ask me to send you quality
GordonSin 0:0ed2a7c7190c 980 * reports', but if we didn't ask for them, we don't want them.
GordonSin 0:0ed2a7c7190c 981 * An option we don't recognize represents the peer asking to
GordonSin 0:0ed2a7c7190c 982 * negotiate some option we don't support, so ignore it.
GordonSin 0:0ed2a7c7190c 983 */
GordonSin 0:0ed2a7c7190c 984 while (len > CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 985 GETCHAR(citype, p);
GordonSin 0:0ed2a7c7190c 986 GETCHAR(cilen, p);
GordonSin 0:0ed2a7c7190c 987 if (cilen < CILEN_VOID || (len -= cilen) < 0) {
GordonSin 0:0ed2a7c7190c 988 goto bad;
GordonSin 0:0ed2a7c7190c 989 }
GordonSin 0:0ed2a7c7190c 990 next = p + cilen - 2;
GordonSin 0:0ed2a7c7190c 991
GordonSin 0:0ed2a7c7190c 992 switch (citype) {
GordonSin 0:0ed2a7c7190c 993 case CI_MRU:
GordonSin 0:0ed2a7c7190c 994 if ((go->neg_mru && go->mru != PPP_DEFMRU)
GordonSin 0:0ed2a7c7190c 995 || no.neg_mru || cilen != CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 996 goto bad;
GordonSin 0:0ed2a7c7190c 997 }
GordonSin 0:0ed2a7c7190c 998 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 999 if (cishort < PPP_DEFMRU) {
GordonSin 0:0ed2a7c7190c 1000 try.mru = cishort;
GordonSin 0:0ed2a7c7190c 1001 }
GordonSin 0:0ed2a7c7190c 1002 break;
GordonSin 0:0ed2a7c7190c 1003 case CI_ASYNCMAP:
GordonSin 0:0ed2a7c7190c 1004 if ((go->neg_asyncmap && go->asyncmap != 0xFFFFFFFFl)
GordonSin 0:0ed2a7c7190c 1005 || no.neg_asyncmap || cilen != CILEN_LONG) {
GordonSin 0:0ed2a7c7190c 1006 goto bad;
GordonSin 0:0ed2a7c7190c 1007 }
GordonSin 0:0ed2a7c7190c 1008 break;
GordonSin 0:0ed2a7c7190c 1009 case CI_AUTHTYPE:
GordonSin 0:0ed2a7c7190c 1010 if (go->neg_chap || no.neg_chap || go->neg_upap || no.neg_upap) {
GordonSin 0:0ed2a7c7190c 1011 goto bad;
GordonSin 0:0ed2a7c7190c 1012 }
GordonSin 0:0ed2a7c7190c 1013 break;
GordonSin 0:0ed2a7c7190c 1014 case CI_MAGICNUMBER:
GordonSin 0:0ed2a7c7190c 1015 if (go->neg_magicnumber || no.neg_magicnumber ||
GordonSin 0:0ed2a7c7190c 1016 cilen != CILEN_LONG) {
GordonSin 0:0ed2a7c7190c 1017 goto bad;
GordonSin 0:0ed2a7c7190c 1018 }
GordonSin 0:0ed2a7c7190c 1019 break;
GordonSin 0:0ed2a7c7190c 1020 case CI_PCOMPRESSION:
GordonSin 0:0ed2a7c7190c 1021 if (go->neg_pcompression || no.neg_pcompression
GordonSin 0:0ed2a7c7190c 1022 || cilen != CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 1023 goto bad;
GordonSin 0:0ed2a7c7190c 1024 }
GordonSin 0:0ed2a7c7190c 1025 break;
GordonSin 0:0ed2a7c7190c 1026 case CI_ACCOMPRESSION:
GordonSin 0:0ed2a7c7190c 1027 if (go->neg_accompression || no.neg_accompression
GordonSin 0:0ed2a7c7190c 1028 || cilen != CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 1029 goto bad;
GordonSin 0:0ed2a7c7190c 1030 }
GordonSin 0:0ed2a7c7190c 1031 break;
GordonSin 0:0ed2a7c7190c 1032 case CI_QUALITY:
GordonSin 0:0ed2a7c7190c 1033 if (go->neg_lqr || no.neg_lqr || cilen != CILEN_LQR) {
GordonSin 0:0ed2a7c7190c 1034 goto bad;
GordonSin 0:0ed2a7c7190c 1035 }
GordonSin 0:0ed2a7c7190c 1036 break;
GordonSin 0:0ed2a7c7190c 1037 }
GordonSin 0:0ed2a7c7190c 1038 p = next;
GordonSin 0:0ed2a7c7190c 1039 }
GordonSin 0:0ed2a7c7190c 1040
GordonSin 0:0ed2a7c7190c 1041 /* If there is still anything left, this packet is bad. */
GordonSin 0:0ed2a7c7190c 1042 if (len != 0) {
GordonSin 0:0ed2a7c7190c 1043 goto bad;
GordonSin 0:0ed2a7c7190c 1044 }
GordonSin 0:0ed2a7c7190c 1045
GordonSin 0:0ed2a7c7190c 1046 /*
GordonSin 0:0ed2a7c7190c 1047 * OK, the Nak is good. Now we can update state.
GordonSin 0:0ed2a7c7190c 1048 */
GordonSin 0:0ed2a7c7190c 1049 if (f->state != LS_OPENED) {
GordonSin 0:0ed2a7c7190c 1050 if (looped_back) {
GordonSin 0:0ed2a7c7190c 1051 if (++try.numloops >= lcp_loopbackfail) {
GordonSin 0:0ed2a7c7190c 1052 LCPDEBUG(LOG_NOTICE, ("Serial line is looped back.\n"));
GordonSin 0:0ed2a7c7190c 1053 lcp_close(f->unit, "Loopback detected");
GordonSin 0:0ed2a7c7190c 1054 }
GordonSin 0:0ed2a7c7190c 1055 } else {
GordonSin 0:0ed2a7c7190c 1056 try.numloops = 0;
GordonSin 0:0ed2a7c7190c 1057 }
GordonSin 0:0ed2a7c7190c 1058 *go = try;
GordonSin 0:0ed2a7c7190c 1059 }
GordonSin 0:0ed2a7c7190c 1060
GordonSin 0:0ed2a7c7190c 1061 return 1;
GordonSin 0:0ed2a7c7190c 1062
GordonSin 0:0ed2a7c7190c 1063 bad:
GordonSin 0:0ed2a7c7190c 1064 LCPDEBUG(LOG_WARNING, ("lcp_nakci: received bad Nak!\n"));
GordonSin 0:0ed2a7c7190c 1065 return 0;
GordonSin 0:0ed2a7c7190c 1066 }
GordonSin 0:0ed2a7c7190c 1067
GordonSin 0:0ed2a7c7190c 1068
GordonSin 0:0ed2a7c7190c 1069 /*
GordonSin 0:0ed2a7c7190c 1070 * lcp_rejci - Peer has Rejected some of our CIs.
GordonSin 0:0ed2a7c7190c 1071 * This should not modify any state if the Reject is bad
GordonSin 0:0ed2a7c7190c 1072 * or if LCP is in the LS_OPENED state.
GordonSin 0:0ed2a7c7190c 1073 *
GordonSin 0:0ed2a7c7190c 1074 * Returns:
GordonSin 0:0ed2a7c7190c 1075 * 0 - Reject was bad.
GordonSin 0:0ed2a7c7190c 1076 * 1 - Reject was good.
GordonSin 0:0ed2a7c7190c 1077 */
GordonSin 0:0ed2a7c7190c 1078 static int
GordonSin 0:0ed2a7c7190c 1079 lcp_rejci(fsm *f, u_char *p, int len)
GordonSin 0:0ed2a7c7190c 1080 {
GordonSin 0:0ed2a7c7190c 1081 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1082 u_char cichar;
GordonSin 0:0ed2a7c7190c 1083 u_short cishort;
GordonSin 0:0ed2a7c7190c 1084 u32_t cilong;
GordonSin 0:0ed2a7c7190c 1085 lcp_options try; /* options to request next time */
GordonSin 0:0ed2a7c7190c 1086
GordonSin 0:0ed2a7c7190c 1087 try = *go;
GordonSin 0:0ed2a7c7190c 1088
GordonSin 0:0ed2a7c7190c 1089 /*
GordonSin 0:0ed2a7c7190c 1090 * Any Rejected CIs must be in exactly the same order that we sent.
GordonSin 0:0ed2a7c7190c 1091 * Check packet length and CI length at each step.
GordonSin 0:0ed2a7c7190c 1092 * If we find any deviations, then this packet is bad.
GordonSin 0:0ed2a7c7190c 1093 */
GordonSin 0:0ed2a7c7190c 1094 #define REJCIVOID(opt, neg) \
GordonSin 0:0ed2a7c7190c 1095 if (go->neg && \
GordonSin 0:0ed2a7c7190c 1096 len >= CILEN_VOID && \
GordonSin 0:0ed2a7c7190c 1097 p[1] == CILEN_VOID && \
GordonSin 0:0ed2a7c7190c 1098 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 1099 len -= CILEN_VOID; \
GordonSin 0:0ed2a7c7190c 1100 INCPTR(CILEN_VOID, p); \
GordonSin 0:0ed2a7c7190c 1101 try.neg = 0; \
GordonSin 0:0ed2a7c7190c 1102 LCPDEBUG(LOG_INFO, ("lcp_rejci: void opt %d rejected\n", opt)); \
GordonSin 0:0ed2a7c7190c 1103 }
GordonSin 0:0ed2a7c7190c 1104 #define REJCISHORT(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 1105 if (go->neg && \
GordonSin 0:0ed2a7c7190c 1106 len >= CILEN_SHORT && \
GordonSin 0:0ed2a7c7190c 1107 p[1] == CILEN_SHORT && \
GordonSin 0:0ed2a7c7190c 1108 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 1109 len -= CILEN_SHORT; \
GordonSin 0:0ed2a7c7190c 1110 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 1111 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 1112 /* Check rejected value. */ \
GordonSin 0:0ed2a7c7190c 1113 if (cishort != val) { \
GordonSin 0:0ed2a7c7190c 1114 goto bad; \
GordonSin 0:0ed2a7c7190c 1115 } \
GordonSin 0:0ed2a7c7190c 1116 try.neg = 0; \
GordonSin 0:0ed2a7c7190c 1117 LCPDEBUG(LOG_INFO, ("lcp_rejci: short opt %d rejected\n", opt)); \
GordonSin 0:0ed2a7c7190c 1118 }
GordonSin 0:0ed2a7c7190c 1119 #define REJCICHAP(opt, neg, val, digest) \
GordonSin 0:0ed2a7c7190c 1120 if (go->neg && \
GordonSin 0:0ed2a7c7190c 1121 len >= CILEN_CHAP && \
GordonSin 0:0ed2a7c7190c 1122 p[1] == CILEN_CHAP && \
GordonSin 0:0ed2a7c7190c 1123 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 1124 len -= CILEN_CHAP; \
GordonSin 0:0ed2a7c7190c 1125 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 1126 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 1127 GETCHAR(cichar, p); \
GordonSin 0:0ed2a7c7190c 1128 /* Check rejected value. */ \
GordonSin 0:0ed2a7c7190c 1129 if (cishort != val || cichar != digest) { \
GordonSin 0:0ed2a7c7190c 1130 goto bad; \
GordonSin 0:0ed2a7c7190c 1131 } \
GordonSin 0:0ed2a7c7190c 1132 try.neg = 0; \
GordonSin 0:0ed2a7c7190c 1133 try.neg_upap = 0; \
GordonSin 0:0ed2a7c7190c 1134 LCPDEBUG(LOG_INFO, ("lcp_rejci: chap opt %d rejected\n", opt)); \
GordonSin 0:0ed2a7c7190c 1135 }
GordonSin 0:0ed2a7c7190c 1136 #define REJCILONG(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 1137 if (go->neg && \
GordonSin 0:0ed2a7c7190c 1138 len >= CILEN_LONG && \
GordonSin 0:0ed2a7c7190c 1139 p[1] == CILEN_LONG && \
GordonSin 0:0ed2a7c7190c 1140 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 1141 len -= CILEN_LONG; \
GordonSin 0:0ed2a7c7190c 1142 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 1143 GETLONG(cilong, p); \
GordonSin 0:0ed2a7c7190c 1144 /* Check rejected value. */ \
GordonSin 0:0ed2a7c7190c 1145 if (cilong != val) { \
GordonSin 0:0ed2a7c7190c 1146 goto bad; \
GordonSin 0:0ed2a7c7190c 1147 } \
GordonSin 0:0ed2a7c7190c 1148 try.neg = 0; \
GordonSin 0:0ed2a7c7190c 1149 LCPDEBUG(LOG_INFO, ("lcp_rejci: long opt %d rejected\n", opt)); \
GordonSin 0:0ed2a7c7190c 1150 }
GordonSin 0:0ed2a7c7190c 1151 #define REJCILQR(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 1152 if (go->neg && \
GordonSin 0:0ed2a7c7190c 1153 len >= CILEN_LQR && \
GordonSin 0:0ed2a7c7190c 1154 p[1] == CILEN_LQR && \
GordonSin 0:0ed2a7c7190c 1155 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 1156 len -= CILEN_LQR; \
GordonSin 0:0ed2a7c7190c 1157 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 1158 GETSHORT(cishort, p); \
GordonSin 0:0ed2a7c7190c 1159 GETLONG(cilong, p); \
GordonSin 0:0ed2a7c7190c 1160 /* Check rejected value. */ \
GordonSin 0:0ed2a7c7190c 1161 if (cishort != PPP_LQR || cilong != val) { \
GordonSin 0:0ed2a7c7190c 1162 goto bad; \
GordonSin 0:0ed2a7c7190c 1163 } \
GordonSin 0:0ed2a7c7190c 1164 try.neg = 0; \
GordonSin 0:0ed2a7c7190c 1165 LCPDEBUG(LOG_INFO, ("lcp_rejci: LQR opt %d rejected\n", opt)); \
GordonSin 0:0ed2a7c7190c 1166 }
GordonSin 0:0ed2a7c7190c 1167 #define REJCICBCP(opt, neg, val) \
GordonSin 0:0ed2a7c7190c 1168 if (go->neg && \
GordonSin 0:0ed2a7c7190c 1169 len >= CILEN_CBCP && \
GordonSin 0:0ed2a7c7190c 1170 p[1] == CILEN_CBCP && \
GordonSin 0:0ed2a7c7190c 1171 p[0] == opt) { \
GordonSin 0:0ed2a7c7190c 1172 len -= CILEN_CBCP; \
GordonSin 0:0ed2a7c7190c 1173 INCPTR(2, p); \
GordonSin 0:0ed2a7c7190c 1174 GETCHAR(cichar, p); \
GordonSin 0:0ed2a7c7190c 1175 /* Check rejected value. */ \
GordonSin 0:0ed2a7c7190c 1176 if (cichar != val) { \
GordonSin 0:0ed2a7c7190c 1177 goto bad; \
GordonSin 0:0ed2a7c7190c 1178 } \
GordonSin 0:0ed2a7c7190c 1179 try.neg = 0; \
GordonSin 0:0ed2a7c7190c 1180 LCPDEBUG(LOG_INFO, ("lcp_rejci: Callback opt %d rejected\n", opt)); \
GordonSin 0:0ed2a7c7190c 1181 }
GordonSin 0:0ed2a7c7190c 1182
GordonSin 0:0ed2a7c7190c 1183 REJCISHORT(CI_MRU, neg_mru, go->mru);
GordonSin 0:0ed2a7c7190c 1184 REJCILONG(CI_ASYNCMAP, neg_asyncmap, go->asyncmap);
GordonSin 0:0ed2a7c7190c 1185 REJCICHAP(CI_AUTHTYPE, neg_chap, PPP_CHAP, go->chap_mdtype);
GordonSin 0:0ed2a7c7190c 1186 if (!go->neg_chap) {
GordonSin 0:0ed2a7c7190c 1187 REJCISHORT(CI_AUTHTYPE, neg_upap, PPP_PAP);
GordonSin 0:0ed2a7c7190c 1188 }
GordonSin 0:0ed2a7c7190c 1189 REJCILQR(CI_QUALITY, neg_lqr, go->lqr_period);
GordonSin 0:0ed2a7c7190c 1190 REJCICBCP(CI_CALLBACK, neg_cbcp, CBCP_OPT);
GordonSin 0:0ed2a7c7190c 1191 REJCILONG(CI_MAGICNUMBER, neg_magicnumber, go->magicnumber);
GordonSin 0:0ed2a7c7190c 1192 REJCIVOID(CI_PCOMPRESSION, neg_pcompression);
GordonSin 0:0ed2a7c7190c 1193 REJCIVOID(CI_ACCOMPRESSION, neg_accompression);
GordonSin 0:0ed2a7c7190c 1194
GordonSin 0:0ed2a7c7190c 1195 /*
GordonSin 0:0ed2a7c7190c 1196 * If there are any remaining CIs, then this packet is bad.
GordonSin 0:0ed2a7c7190c 1197 */
GordonSin 0:0ed2a7c7190c 1198 if (len != 0) {
GordonSin 0:0ed2a7c7190c 1199 goto bad;
GordonSin 0:0ed2a7c7190c 1200 }
GordonSin 0:0ed2a7c7190c 1201 /*
GordonSin 0:0ed2a7c7190c 1202 * Now we can update state.
GordonSin 0:0ed2a7c7190c 1203 */
GordonSin 0:0ed2a7c7190c 1204 if (f->state != LS_OPENED) {
GordonSin 0:0ed2a7c7190c 1205 *go = try;
GordonSin 0:0ed2a7c7190c 1206 }
GordonSin 0:0ed2a7c7190c 1207 return 1;
GordonSin 0:0ed2a7c7190c 1208
GordonSin 0:0ed2a7c7190c 1209 bad:
GordonSin 0:0ed2a7c7190c 1210 LCPDEBUG(LOG_WARNING, ("lcp_rejci: received bad Reject!\n"));
GordonSin 0:0ed2a7c7190c 1211 return 0;
GordonSin 0:0ed2a7c7190c 1212 }
GordonSin 0:0ed2a7c7190c 1213
GordonSin 0:0ed2a7c7190c 1214
GordonSin 0:0ed2a7c7190c 1215 /*
GordonSin 0:0ed2a7c7190c 1216 * lcp_reqci - Check the peer's requested CIs and send appropriate response.
GordonSin 0:0ed2a7c7190c 1217 *
GordonSin 0:0ed2a7c7190c 1218 * Returns: CONFACK, CONFNAK or CONFREJ and input packet modified
GordonSin 0:0ed2a7c7190c 1219 * appropriately. If reject_if_disagree is non-zero, doesn't return
GordonSin 0:0ed2a7c7190c 1220 * CONFNAK; returns CONFREJ if it can't return CONFACK.
GordonSin 0:0ed2a7c7190c 1221 */
GordonSin 0:0ed2a7c7190c 1222 static int
GordonSin 0:0ed2a7c7190c 1223 lcp_reqci(fsm *f,
GordonSin 0:0ed2a7c7190c 1224 u_char *inp, /* Requested CIs */
GordonSin 0:0ed2a7c7190c 1225 int *lenp, /* Length of requested CIs */
GordonSin 0:0ed2a7c7190c 1226 int reject_if_disagree)
GordonSin 0:0ed2a7c7190c 1227 {
GordonSin 0:0ed2a7c7190c 1228 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1229 lcp_options *ho = &lcp_hisoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1230 lcp_options *ao = &lcp_allowoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1231 u_char *cip, *next; /* Pointer to current and next CIs */
GordonSin 0:0ed2a7c7190c 1232 int cilen, citype; /* Parsed len, type */
GordonSin 0:0ed2a7c7190c 1233 u_char cichar; /* Parsed char value */
GordonSin 0:0ed2a7c7190c 1234 u_short cishort; /* Parsed short value */
GordonSin 0:0ed2a7c7190c 1235 u32_t cilong; /* Parse long value */
GordonSin 0:0ed2a7c7190c 1236 int rc = CONFACK; /* Final packet return code */
GordonSin 0:0ed2a7c7190c 1237 int orc; /* Individual option return code */
GordonSin 0:0ed2a7c7190c 1238 u_char *p; /* Pointer to next char to parse */
GordonSin 0:0ed2a7c7190c 1239 u_char *rejp; /* Pointer to next char in reject frame */
GordonSin 0:0ed2a7c7190c 1240 u_char *nakp; /* Pointer to next char in Nak frame */
GordonSin 0:0ed2a7c7190c 1241 int l = *lenp; /* Length left */
GordonSin 0:0ed2a7c7190c 1242 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1243 char traceBuf[80];
GordonSin 0:0ed2a7c7190c 1244 size_t traceNdx = 0;
GordonSin 0:0ed2a7c7190c 1245 #endif
GordonSin 0:0ed2a7c7190c 1246
GordonSin 0:0ed2a7c7190c 1247 /*
GordonSin 0:0ed2a7c7190c 1248 * Reset all his options.
GordonSin 0:0ed2a7c7190c 1249 */
GordonSin 0:0ed2a7c7190c 1250 BZERO(ho, sizeof(*ho));
GordonSin 0:0ed2a7c7190c 1251
GordonSin 0:0ed2a7c7190c 1252 /*
GordonSin 0:0ed2a7c7190c 1253 * Process all his options.
GordonSin 0:0ed2a7c7190c 1254 */
GordonSin 0:0ed2a7c7190c 1255 next = inp;
GordonSin 0:0ed2a7c7190c 1256 nakp = nak_buffer;
GordonSin 0:0ed2a7c7190c 1257 rejp = inp;
GordonSin 0:0ed2a7c7190c 1258 while (l) {
GordonSin 0:0ed2a7c7190c 1259 orc = CONFACK; /* Assume success */
GordonSin 0:0ed2a7c7190c 1260 cip = p = next; /* Remember begining of CI */
GordonSin 0:0ed2a7c7190c 1261 if (l < 2 || /* Not enough data for CI header or */
GordonSin 0:0ed2a7c7190c 1262 p[1] < 2 || /* CI length too small or */
GordonSin 0:0ed2a7c7190c 1263 p[1] > l) { /* CI length too big? */
GordonSin 0:0ed2a7c7190c 1264 LCPDEBUG(LOG_WARNING, ("lcp_reqci: bad CI length!\n"));
GordonSin 0:0ed2a7c7190c 1265 orc = CONFREJ; /* Reject bad CI */
GordonSin 0:0ed2a7c7190c 1266 cilen = l; /* Reject till end of packet */
GordonSin 0:0ed2a7c7190c 1267 l = 0; /* Don't loop again */
GordonSin 0:0ed2a7c7190c 1268 citype = 0;
GordonSin 0:0ed2a7c7190c 1269 goto endswitch;
GordonSin 0:0ed2a7c7190c 1270 }
GordonSin 0:0ed2a7c7190c 1271 GETCHAR(citype, p); /* Parse CI type */
GordonSin 0:0ed2a7c7190c 1272 GETCHAR(cilen, p); /* Parse CI length */
GordonSin 0:0ed2a7c7190c 1273 l -= cilen; /* Adjust remaining length */
GordonSin 0:0ed2a7c7190c 1274 next += cilen; /* Step to next CI */
GordonSin 0:0ed2a7c7190c 1275
GordonSin 0:0ed2a7c7190c 1276 switch (citype) { /* Check CI type */
GordonSin 0:0ed2a7c7190c 1277 case CI_MRU:
GordonSin 0:0ed2a7c7190c 1278 if (!ao->neg_mru) { /* Allow option? */
GordonSin 0:0ed2a7c7190c 1279 LCPDEBUG(LOG_INFO, ("lcp_reqci: Reject MRU - not allowed\n"));
GordonSin 0:0ed2a7c7190c 1280 orc = CONFREJ; /* Reject CI */
GordonSin 0:0ed2a7c7190c 1281 break;
GordonSin 0:0ed2a7c7190c 1282 } else if (cilen != CILEN_SHORT) { /* Check CI length */
GordonSin 0:0ed2a7c7190c 1283 LCPDEBUG(LOG_INFO, ("lcp_reqci: Reject MRU - bad length\n"));
GordonSin 0:0ed2a7c7190c 1284 orc = CONFREJ; /* Reject CI */
GordonSin 0:0ed2a7c7190c 1285 break;
GordonSin 0:0ed2a7c7190c 1286 }
GordonSin 0:0ed2a7c7190c 1287 GETSHORT(cishort, p); /* Parse MRU */
GordonSin 0:0ed2a7c7190c 1288
GordonSin 0:0ed2a7c7190c 1289 /*
GordonSin 0:0ed2a7c7190c 1290 * He must be able to receive at least our minimum.
GordonSin 0:0ed2a7c7190c 1291 * No need to check a maximum. If he sends a large number,
GordonSin 0:0ed2a7c7190c 1292 * we'll just ignore it.
GordonSin 0:0ed2a7c7190c 1293 */
GordonSin 0:0ed2a7c7190c 1294 if (cishort < PPP_MINMRU) {
GordonSin 0:0ed2a7c7190c 1295 LCPDEBUG(LOG_INFO, ("lcp_reqci: Nak - MRU too small\n"));
GordonSin 0:0ed2a7c7190c 1296 orc = CONFNAK; /* Nak CI */
GordonSin 0:0ed2a7c7190c 1297 PUTCHAR(CI_MRU, nakp);
GordonSin 0:0ed2a7c7190c 1298 PUTCHAR(CILEN_SHORT, nakp);
GordonSin 0:0ed2a7c7190c 1299 PUTSHORT(PPP_MINMRU, nakp); /* Give him a hint */
GordonSin 0:0ed2a7c7190c 1300 break;
GordonSin 0:0ed2a7c7190c 1301 }
GordonSin 0:0ed2a7c7190c 1302 ho->neg_mru = 1; /* Remember he sent MRU */
GordonSin 0:0ed2a7c7190c 1303 ho->mru = cishort; /* And remember value */
GordonSin 0:0ed2a7c7190c 1304 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1305 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " MRU %d", cishort);
GordonSin 0:0ed2a7c7190c 1306 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1307 #endif
GordonSin 0:0ed2a7c7190c 1308 break;
GordonSin 0:0ed2a7c7190c 1309
GordonSin 0:0ed2a7c7190c 1310 case CI_ASYNCMAP:
GordonSin 0:0ed2a7c7190c 1311 if (!ao->neg_asyncmap) {
GordonSin 0:0ed2a7c7190c 1312 LCPDEBUG(LOG_INFO, ("lcp_reqci: Reject ASYNCMAP not allowed\n"));
GordonSin 0:0ed2a7c7190c 1313 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1314 break;
GordonSin 0:0ed2a7c7190c 1315 } else if (cilen != CILEN_LONG) {
GordonSin 0:0ed2a7c7190c 1316 LCPDEBUG(LOG_INFO, ("lcp_reqci: Reject ASYNCMAP bad length\n"));
GordonSin 0:0ed2a7c7190c 1317 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1318 break;
GordonSin 0:0ed2a7c7190c 1319 }
GordonSin 0:0ed2a7c7190c 1320 GETLONG(cilong, p);
GordonSin 0:0ed2a7c7190c 1321
GordonSin 0:0ed2a7c7190c 1322 /*
GordonSin 0:0ed2a7c7190c 1323 * Asyncmap must have set at least the bits
GordonSin 0:0ed2a7c7190c 1324 * which are set in lcp_allowoptions[unit].asyncmap.
GordonSin 0:0ed2a7c7190c 1325 */
GordonSin 0:0ed2a7c7190c 1326 if ((ao->asyncmap & ~cilong) != 0) {
GordonSin 0:0ed2a7c7190c 1327 LCPDEBUG(LOG_INFO, ("lcp_reqci: Nak ASYNCMAP %lX missing %lX\n",
GordonSin 0:0ed2a7c7190c 1328 cilong, ao->asyncmap));
GordonSin 0:0ed2a7c7190c 1329 orc = CONFNAK;
GordonSin 0:0ed2a7c7190c 1330 PUTCHAR(CI_ASYNCMAP, nakp);
GordonSin 0:0ed2a7c7190c 1331 PUTCHAR(CILEN_LONG, nakp);
GordonSin 0:0ed2a7c7190c 1332 PUTLONG(ao->asyncmap | cilong, nakp);
GordonSin 0:0ed2a7c7190c 1333 break;
GordonSin 0:0ed2a7c7190c 1334 }
GordonSin 0:0ed2a7c7190c 1335 ho->neg_asyncmap = 1;
GordonSin 0:0ed2a7c7190c 1336 ho->asyncmap = cilong;
GordonSin 0:0ed2a7c7190c 1337 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1338 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " ASYNCMAP=%lX", cilong);
GordonSin 0:0ed2a7c7190c 1339 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1340 #endif
GordonSin 0:0ed2a7c7190c 1341 break;
GordonSin 0:0ed2a7c7190c 1342
GordonSin 0:0ed2a7c7190c 1343 case CI_AUTHTYPE:
GordonSin 0:0ed2a7c7190c 1344 if (cilen < CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 1345 LCPDEBUG(LOG_INFO, ("lcp_reqci: Reject AUTHTYPE missing arg\n"));
GordonSin 0:0ed2a7c7190c 1346 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1347 break;
GordonSin 0:0ed2a7c7190c 1348 } else if (!(ao->neg_upap || ao->neg_chap)) {
GordonSin 0:0ed2a7c7190c 1349 /*
GordonSin 0:0ed2a7c7190c 1350 * Reject the option if we're not willing to authenticate.
GordonSin 0:0ed2a7c7190c 1351 */
GordonSin 0:0ed2a7c7190c 1352 LCPDEBUG(LOG_INFO, ("lcp_reqci: Reject AUTHTYPE not allowed\n"));
GordonSin 0:0ed2a7c7190c 1353 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1354 break;
GordonSin 0:0ed2a7c7190c 1355 }
GordonSin 0:0ed2a7c7190c 1356 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 1357
GordonSin 0:0ed2a7c7190c 1358 /*
GordonSin 0:0ed2a7c7190c 1359 * Authtype must be UPAP or CHAP.
GordonSin 0:0ed2a7c7190c 1360 *
GordonSin 0:0ed2a7c7190c 1361 * Note: if both ao->neg_upap and ao->neg_chap are set,
GordonSin 0:0ed2a7c7190c 1362 * and the peer sends a Configure-Request with two
GordonSin 0:0ed2a7c7190c 1363 * authenticate-protocol requests, one for CHAP and one
GordonSin 0:0ed2a7c7190c 1364 * for UPAP, then we will reject the second request.
GordonSin 0:0ed2a7c7190c 1365 * Whether we end up doing CHAP or UPAP depends then on
GordonSin 0:0ed2a7c7190c 1366 * the ordering of the CIs in the peer's Configure-Request.
GordonSin 0:0ed2a7c7190c 1367 */
GordonSin 0:0ed2a7c7190c 1368
GordonSin 0:0ed2a7c7190c 1369 if (cishort == PPP_PAP) {
GordonSin 0:0ed2a7c7190c 1370 if (ho->neg_chap) { /* we've already accepted CHAP */
GordonSin 0:0ed2a7c7190c 1371 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Reject AUTHTYPE PAP already accepted\n"));
GordonSin 0:0ed2a7c7190c 1372 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1373 break;
GordonSin 0:0ed2a7c7190c 1374 } else if (cilen != CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 1375 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Reject AUTHTYPE PAP bad len\n"));
GordonSin 0:0ed2a7c7190c 1376 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1377 break;
GordonSin 0:0ed2a7c7190c 1378 }
GordonSin 0:0ed2a7c7190c 1379 if (!ao->neg_upap) { /* we don't want to do PAP */
GordonSin 0:0ed2a7c7190c 1380 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Nak AUTHTYPE PAP not allowed\n"));
GordonSin 0:0ed2a7c7190c 1381 orc = CONFNAK; /* NAK it and suggest CHAP */
GordonSin 0:0ed2a7c7190c 1382 PUTCHAR(CI_AUTHTYPE, nakp);
GordonSin 0:0ed2a7c7190c 1383 PUTCHAR(CILEN_CHAP, nakp);
GordonSin 0:0ed2a7c7190c 1384 PUTSHORT(PPP_CHAP, nakp);
GordonSin 0:0ed2a7c7190c 1385 PUTCHAR(ao->chap_mdtype, nakp);
GordonSin 0:0ed2a7c7190c 1386 break;
GordonSin 0:0ed2a7c7190c 1387 }
GordonSin 0:0ed2a7c7190c 1388 ho->neg_upap = 1;
GordonSin 0:0ed2a7c7190c 1389 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1390 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " PAP (%X)", cishort);
GordonSin 0:0ed2a7c7190c 1391 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1392 #endif
GordonSin 0:0ed2a7c7190c 1393 break;
GordonSin 0:0ed2a7c7190c 1394 }
GordonSin 0:0ed2a7c7190c 1395 if (cishort == PPP_CHAP) {
GordonSin 0:0ed2a7c7190c 1396 if (ho->neg_upap) { /* we've already accepted PAP */
GordonSin 0:0ed2a7c7190c 1397 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Reject AUTHTYPE CHAP accepted PAP\n"));
GordonSin 0:0ed2a7c7190c 1398 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1399 break;
GordonSin 0:0ed2a7c7190c 1400 } else if (cilen != CILEN_CHAP) {
GordonSin 0:0ed2a7c7190c 1401 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Reject AUTHTYPE CHAP bad len\n"));
GordonSin 0:0ed2a7c7190c 1402 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1403 break;
GordonSin 0:0ed2a7c7190c 1404 }
GordonSin 0:0ed2a7c7190c 1405 if (!ao->neg_chap) { /* we don't want to do CHAP */
GordonSin 0:0ed2a7c7190c 1406 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Nak AUTHTYPE CHAP not allowed\n"));
GordonSin 0:0ed2a7c7190c 1407 orc = CONFNAK; /* NAK it and suggest PAP */
GordonSin 0:0ed2a7c7190c 1408 PUTCHAR(CI_AUTHTYPE, nakp);
GordonSin 0:0ed2a7c7190c 1409 PUTCHAR(CILEN_SHORT, nakp);
GordonSin 0:0ed2a7c7190c 1410 PUTSHORT(PPP_PAP, nakp);
GordonSin 0:0ed2a7c7190c 1411 break;
GordonSin 0:0ed2a7c7190c 1412 }
GordonSin 0:0ed2a7c7190c 1413 GETCHAR(cichar, p); /* get digest type*/
GordonSin 0:0ed2a7c7190c 1414 if (cichar != CHAP_DIGEST_MD5
GordonSin 0:0ed2a7c7190c 1415 #if MSCHAP_SUPPORT
GordonSin 0:0ed2a7c7190c 1416 && cichar != CHAP_MICROSOFT
GordonSin 0:0ed2a7c7190c 1417 #endif
GordonSin 0:0ed2a7c7190c 1418 ) {
GordonSin 0:0ed2a7c7190c 1419 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Nak AUTHTYPE CHAP digest=%d\n", (int)cichar));
GordonSin 0:0ed2a7c7190c 1420 orc = CONFNAK;
GordonSin 0:0ed2a7c7190c 1421 PUTCHAR(CI_AUTHTYPE, nakp);
GordonSin 0:0ed2a7c7190c 1422 PUTCHAR(CILEN_CHAP, nakp);
GordonSin 0:0ed2a7c7190c 1423 PUTSHORT(PPP_CHAP, nakp);
GordonSin 0:0ed2a7c7190c 1424 PUTCHAR(ao->chap_mdtype, nakp);
GordonSin 0:0ed2a7c7190c 1425 break;
GordonSin 0:0ed2a7c7190c 1426 }
GordonSin 0:0ed2a7c7190c 1427 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1428 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " CHAP %X,%d", cishort, (int)cichar);
GordonSin 0:0ed2a7c7190c 1429 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1430 #endif
GordonSin 0:0ed2a7c7190c 1431 ho->chap_mdtype = cichar; /* save md type */
GordonSin 0:0ed2a7c7190c 1432 ho->neg_chap = 1;
GordonSin 0:0ed2a7c7190c 1433 break;
GordonSin 0:0ed2a7c7190c 1434 }
GordonSin 0:0ed2a7c7190c 1435
GordonSin 0:0ed2a7c7190c 1436 /*
GordonSin 0:0ed2a7c7190c 1437 * We don't recognize the protocol they're asking for.
GordonSin 0:0ed2a7c7190c 1438 * Nak it with something we're willing to do.
GordonSin 0:0ed2a7c7190c 1439 * (At this point we know ao->neg_upap || ao->neg_chap.)
GordonSin 0:0ed2a7c7190c 1440 */
GordonSin 0:0ed2a7c7190c 1441 orc = CONFNAK;
GordonSin 0:0ed2a7c7190c 1442 PUTCHAR(CI_AUTHTYPE, nakp);
GordonSin 0:0ed2a7c7190c 1443 if (ao->neg_chap) {
GordonSin 0:0ed2a7c7190c 1444 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Nak AUTHTYPE %d req CHAP\n", cishort));
GordonSin 0:0ed2a7c7190c 1445 PUTCHAR(CILEN_CHAP, nakp);
GordonSin 0:0ed2a7c7190c 1446 PUTSHORT(PPP_CHAP, nakp);
GordonSin 0:0ed2a7c7190c 1447 PUTCHAR(ao->chap_mdtype, nakp);
GordonSin 0:0ed2a7c7190c 1448 } else {
GordonSin 0:0ed2a7c7190c 1449 LCPDEBUG(LOG_WARNING, ("lcp_reqci: Nak AUTHTYPE %d req PAP\n", cishort));
GordonSin 0:0ed2a7c7190c 1450 PUTCHAR(CILEN_SHORT, nakp);
GordonSin 0:0ed2a7c7190c 1451 PUTSHORT(PPP_PAP, nakp);
GordonSin 0:0ed2a7c7190c 1452 }
GordonSin 0:0ed2a7c7190c 1453 break;
GordonSin 0:0ed2a7c7190c 1454
GordonSin 0:0ed2a7c7190c 1455 case CI_QUALITY:
GordonSin 0:0ed2a7c7190c 1456 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 1457 GETLONG(cilong, p);
GordonSin 0:0ed2a7c7190c 1458 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1459 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " QUALITY (%x %x)", cishort, (unsigned int) cilong);
GordonSin 0:0ed2a7c7190c 1460 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1461 #endif
GordonSin 0:0ed2a7c7190c 1462
GordonSin 0:0ed2a7c7190c 1463 if (!ao->neg_lqr ||
GordonSin 0:0ed2a7c7190c 1464 cilen != CILEN_LQR) {
GordonSin 0:0ed2a7c7190c 1465 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1466 break;
GordonSin 0:0ed2a7c7190c 1467 }
GordonSin 0:0ed2a7c7190c 1468
GordonSin 0:0ed2a7c7190c 1469 /*
GordonSin 0:0ed2a7c7190c 1470 * Check the protocol and the reporting period.
GordonSin 0:0ed2a7c7190c 1471 * XXX When should we Nak this, and what with?
GordonSin 0:0ed2a7c7190c 1472 */
GordonSin 0:0ed2a7c7190c 1473 if (cishort != PPP_LQR) {
GordonSin 0:0ed2a7c7190c 1474 orc = CONFNAK;
GordonSin 0:0ed2a7c7190c 1475 PUTCHAR(CI_QUALITY, nakp);
GordonSin 0:0ed2a7c7190c 1476 PUTCHAR(CILEN_LQR, nakp);
GordonSin 0:0ed2a7c7190c 1477 PUTSHORT(PPP_LQR, nakp);
GordonSin 0:0ed2a7c7190c 1478 PUTLONG(ao->lqr_period, nakp);
GordonSin 0:0ed2a7c7190c 1479 break;
GordonSin 0:0ed2a7c7190c 1480 }
GordonSin 0:0ed2a7c7190c 1481 break;
GordonSin 0:0ed2a7c7190c 1482
GordonSin 0:0ed2a7c7190c 1483 case CI_MAGICNUMBER:
GordonSin 0:0ed2a7c7190c 1484 if (!(ao->neg_magicnumber || go->neg_magicnumber) ||
GordonSin 0:0ed2a7c7190c 1485 cilen != CILEN_LONG) {
GordonSin 0:0ed2a7c7190c 1486 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1487 break;
GordonSin 0:0ed2a7c7190c 1488 }
GordonSin 0:0ed2a7c7190c 1489 GETLONG(cilong, p);
GordonSin 0:0ed2a7c7190c 1490 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1491 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " MAGICNUMBER (%lX)", cilong);
GordonSin 0:0ed2a7c7190c 1492 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1493 #endif
GordonSin 0:0ed2a7c7190c 1494
GordonSin 0:0ed2a7c7190c 1495 /*
GordonSin 0:0ed2a7c7190c 1496 * He must have a different magic number.
GordonSin 0:0ed2a7c7190c 1497 */
GordonSin 0:0ed2a7c7190c 1498 if (go->neg_magicnumber &&
GordonSin 0:0ed2a7c7190c 1499 cilong == go->magicnumber) {
GordonSin 0:0ed2a7c7190c 1500 cilong = magic(); /* Don't put magic() inside macro! */
GordonSin 0:0ed2a7c7190c 1501 orc = CONFNAK;
GordonSin 0:0ed2a7c7190c 1502 PUTCHAR(CI_MAGICNUMBER, nakp);
GordonSin 0:0ed2a7c7190c 1503 PUTCHAR(CILEN_LONG, nakp);
GordonSin 0:0ed2a7c7190c 1504 PUTLONG(cilong, nakp);
GordonSin 0:0ed2a7c7190c 1505 break;
GordonSin 0:0ed2a7c7190c 1506 }
GordonSin 0:0ed2a7c7190c 1507 ho->neg_magicnumber = 1;
GordonSin 0:0ed2a7c7190c 1508 ho->magicnumber = cilong;
GordonSin 0:0ed2a7c7190c 1509 break;
GordonSin 0:0ed2a7c7190c 1510
GordonSin 0:0ed2a7c7190c 1511
GordonSin 0:0ed2a7c7190c 1512 case CI_PCOMPRESSION:
GordonSin 0:0ed2a7c7190c 1513 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1514 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " PCOMPRESSION");
GordonSin 0:0ed2a7c7190c 1515 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1516 #endif
GordonSin 0:0ed2a7c7190c 1517 if (!ao->neg_pcompression ||
GordonSin 0:0ed2a7c7190c 1518 cilen != CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 1519 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1520 break;
GordonSin 0:0ed2a7c7190c 1521 }
GordonSin 0:0ed2a7c7190c 1522 ho->neg_pcompression = 1;
GordonSin 0:0ed2a7c7190c 1523 break;
GordonSin 0:0ed2a7c7190c 1524
GordonSin 0:0ed2a7c7190c 1525 case CI_ACCOMPRESSION:
GordonSin 0:0ed2a7c7190c 1526 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1527 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " ACCOMPRESSION");
GordonSin 0:0ed2a7c7190c 1528 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1529 #endif
GordonSin 0:0ed2a7c7190c 1530 if (!ao->neg_accompression ||
GordonSin 0:0ed2a7c7190c 1531 cilen != CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 1532 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1533 break;
GordonSin 0:0ed2a7c7190c 1534 }
GordonSin 0:0ed2a7c7190c 1535 ho->neg_accompression = 1;
GordonSin 0:0ed2a7c7190c 1536 break;
GordonSin 0:0ed2a7c7190c 1537
GordonSin 0:0ed2a7c7190c 1538 case CI_MRRU:
GordonSin 0:0ed2a7c7190c 1539 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1540 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " CI_MRRU");
GordonSin 0:0ed2a7c7190c 1541 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1542 #endif
GordonSin 0:0ed2a7c7190c 1543 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1544 break;
GordonSin 0:0ed2a7c7190c 1545
GordonSin 0:0ed2a7c7190c 1546 case CI_SSNHF:
GordonSin 0:0ed2a7c7190c 1547 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1548 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " CI_SSNHF");
GordonSin 0:0ed2a7c7190c 1549 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1550 #endif
GordonSin 0:0ed2a7c7190c 1551 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1552 break;
GordonSin 0:0ed2a7c7190c 1553
GordonSin 0:0ed2a7c7190c 1554 case CI_EPDISC:
GordonSin 0:0ed2a7c7190c 1555 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1556 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " CI_EPDISC");
GordonSin 0:0ed2a7c7190c 1557 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1558 #endif
GordonSin 0:0ed2a7c7190c 1559 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1560 break;
GordonSin 0:0ed2a7c7190c 1561
GordonSin 0:0ed2a7c7190c 1562 default:
GordonSin 0:0ed2a7c7190c 1563 #if TRACELCP
GordonSin 0:0ed2a7c7190c 1564 snprintf(&traceBuf[traceNdx], sizeof(traceBuf), " unknown %d", citype);
GordonSin 0:0ed2a7c7190c 1565 traceNdx = strlen(traceBuf);
GordonSin 0:0ed2a7c7190c 1566 #endif
GordonSin 0:0ed2a7c7190c 1567 orc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1568 break;
GordonSin 0:0ed2a7c7190c 1569 }
GordonSin 0:0ed2a7c7190c 1570
GordonSin 0:0ed2a7c7190c 1571 endswitch:
GordonSin 0:0ed2a7c7190c 1572 #if TRACELCP
GordonSin 0:0ed2a7c7190c 1573 if (traceNdx >= 80 - 32) {
GordonSin 0:0ed2a7c7190c 1574 LCPDEBUG(LOG_INFO, ("lcp_reqci: rcvd%s\n", traceBuf));
GordonSin 0:0ed2a7c7190c 1575 traceNdx = 0;
GordonSin 0:0ed2a7c7190c 1576 }
GordonSin 0:0ed2a7c7190c 1577 #endif
GordonSin 0:0ed2a7c7190c 1578 if (orc == CONFACK && /* Good CI */
GordonSin 0:0ed2a7c7190c 1579 rc != CONFACK) { /* but prior CI wasnt? */
GordonSin 0:0ed2a7c7190c 1580 continue; /* Don't send this one */
GordonSin 0:0ed2a7c7190c 1581 }
GordonSin 0:0ed2a7c7190c 1582
GordonSin 0:0ed2a7c7190c 1583 if (orc == CONFNAK) { /* Nak this CI? */
GordonSin 0:0ed2a7c7190c 1584 if (reject_if_disagree /* Getting fed up with sending NAKs? */
GordonSin 0:0ed2a7c7190c 1585 && citype != CI_MAGICNUMBER) {
GordonSin 0:0ed2a7c7190c 1586 orc = CONFREJ; /* Get tough if so */
GordonSin 0:0ed2a7c7190c 1587 } else {
GordonSin 0:0ed2a7c7190c 1588 if (rc == CONFREJ) { /* Rejecting prior CI? */
GordonSin 0:0ed2a7c7190c 1589 continue; /* Don't send this one */
GordonSin 0:0ed2a7c7190c 1590 }
GordonSin 0:0ed2a7c7190c 1591 rc = CONFNAK;
GordonSin 0:0ed2a7c7190c 1592 }
GordonSin 0:0ed2a7c7190c 1593 }
GordonSin 0:0ed2a7c7190c 1594 if (orc == CONFREJ) { /* Reject this CI */
GordonSin 0:0ed2a7c7190c 1595 rc = CONFREJ;
GordonSin 0:0ed2a7c7190c 1596 if (cip != rejp) { /* Need to move rejected CI? */
GordonSin 0:0ed2a7c7190c 1597 BCOPY(cip, rejp, cilen); /* Move it */
GordonSin 0:0ed2a7c7190c 1598 }
GordonSin 0:0ed2a7c7190c 1599 INCPTR(cilen, rejp); /* Update output pointer */
GordonSin 0:0ed2a7c7190c 1600 }
GordonSin 0:0ed2a7c7190c 1601 }
GordonSin 0:0ed2a7c7190c 1602
GordonSin 0:0ed2a7c7190c 1603 /*
GordonSin 0:0ed2a7c7190c 1604 * If we wanted to send additional NAKs (for unsent CIs), the
GordonSin 0:0ed2a7c7190c 1605 * code would go here. The extra NAKs would go at *nakp.
GordonSin 0:0ed2a7c7190c 1606 * At present there are no cases where we want to ask the
GordonSin 0:0ed2a7c7190c 1607 * peer to negotiate an option.
GordonSin 0:0ed2a7c7190c 1608 */
GordonSin 0:0ed2a7c7190c 1609
GordonSin 0:0ed2a7c7190c 1610 switch (rc) {
GordonSin 0:0ed2a7c7190c 1611 case CONFACK:
GordonSin 0:0ed2a7c7190c 1612 *lenp = (int)(next - inp);
GordonSin 0:0ed2a7c7190c 1613 break;
GordonSin 0:0ed2a7c7190c 1614 case CONFNAK:
GordonSin 0:0ed2a7c7190c 1615 /*
GordonSin 0:0ed2a7c7190c 1616 * Copy the Nak'd options from the nak_buffer to the caller's buffer.
GordonSin 0:0ed2a7c7190c 1617 */
GordonSin 0:0ed2a7c7190c 1618 *lenp = (int)(nakp - nak_buffer);
GordonSin 0:0ed2a7c7190c 1619 BCOPY(nak_buffer, inp, *lenp);
GordonSin 0:0ed2a7c7190c 1620 break;
GordonSin 0:0ed2a7c7190c 1621 case CONFREJ:
GordonSin 0:0ed2a7c7190c 1622 *lenp = (int)(rejp - inp);
GordonSin 0:0ed2a7c7190c 1623 break;
GordonSin 0:0ed2a7c7190c 1624 }
GordonSin 0:0ed2a7c7190c 1625
GordonSin 0:0ed2a7c7190c 1626 #if TRACELCP > 0
GordonSin 0:0ed2a7c7190c 1627 if (traceNdx > 0) {
GordonSin 0:0ed2a7c7190c 1628 LCPDEBUG(LOG_INFO, ("lcp_reqci: %s\n", traceBuf));
GordonSin 0:0ed2a7c7190c 1629 }
GordonSin 0:0ed2a7c7190c 1630 #endif
GordonSin 0:0ed2a7c7190c 1631 LCPDEBUG(LOG_INFO, ("lcp_reqci: returning CONF%s.\n", CODENAME(rc)));
GordonSin 0:0ed2a7c7190c 1632 return (rc); /* Return final code */
GordonSin 0:0ed2a7c7190c 1633 }
GordonSin 0:0ed2a7c7190c 1634
GordonSin 0:0ed2a7c7190c 1635
GordonSin 0:0ed2a7c7190c 1636 /*
GordonSin 0:0ed2a7c7190c 1637 * lcp_up - LCP has come UP.
GordonSin 0:0ed2a7c7190c 1638 */
GordonSin 0:0ed2a7c7190c 1639 static void
GordonSin 0:0ed2a7c7190c 1640 lcp_up(fsm *f)
GordonSin 0:0ed2a7c7190c 1641 {
GordonSin 0:0ed2a7c7190c 1642 lcp_options *wo = &lcp_wantoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1643 lcp_options *ho = &lcp_hisoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1644 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1645 lcp_options *ao = &lcp_allowoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1646
GordonSin 0:0ed2a7c7190c 1647 if (!go->neg_magicnumber) {
GordonSin 0:0ed2a7c7190c 1648 go->magicnumber = 0;
GordonSin 0:0ed2a7c7190c 1649 }
GordonSin 0:0ed2a7c7190c 1650 if (!ho->neg_magicnumber) {
GordonSin 0:0ed2a7c7190c 1651 ho->magicnumber = 0;
GordonSin 0:0ed2a7c7190c 1652 }
GordonSin 0:0ed2a7c7190c 1653
GordonSin 0:0ed2a7c7190c 1654 /*
GordonSin 0:0ed2a7c7190c 1655 * Set our MTU to the smaller of the MTU we wanted and
GordonSin 0:0ed2a7c7190c 1656 * the MRU our peer wanted. If we negotiated an MRU,
GordonSin 0:0ed2a7c7190c 1657 * set our MRU to the larger of value we wanted and
GordonSin 0:0ed2a7c7190c 1658 * the value we got in the negotiation.
GordonSin 0:0ed2a7c7190c 1659 */
GordonSin 0:0ed2a7c7190c 1660 ppp_send_config(f->unit, LWIP_MIN(ao->mru, (ho->neg_mru? ho->mru: PPP_MRU)),
GordonSin 0:0ed2a7c7190c 1661 (ho->neg_asyncmap? ho->asyncmap: 0xffffffffl),
GordonSin 0:0ed2a7c7190c 1662 ho->neg_pcompression, ho->neg_accompression);
GordonSin 0:0ed2a7c7190c 1663 /*
GordonSin 0:0ed2a7c7190c 1664 * If the asyncmap hasn't been negotiated, we really should
GordonSin 0:0ed2a7c7190c 1665 * set the receive asyncmap to ffffffff, but we set it to 0
GordonSin 0:0ed2a7c7190c 1666 * for backwards contemptibility.
GordonSin 0:0ed2a7c7190c 1667 */
GordonSin 0:0ed2a7c7190c 1668 ppp_recv_config(f->unit, (go->neg_mru? LWIP_MAX(wo->mru, go->mru): PPP_MRU),
GordonSin 0:0ed2a7c7190c 1669 (go->neg_asyncmap? go->asyncmap: 0x00000000),
GordonSin 0:0ed2a7c7190c 1670 go->neg_pcompression, go->neg_accompression);
GordonSin 0:0ed2a7c7190c 1671
GordonSin 0:0ed2a7c7190c 1672 if (ho->neg_mru) {
GordonSin 0:0ed2a7c7190c 1673 peer_mru[f->unit] = ho->mru;
GordonSin 0:0ed2a7c7190c 1674 }
GordonSin 0:0ed2a7c7190c 1675
GordonSin 0:0ed2a7c7190c 1676 lcp_echo_lowerup(f->unit); /* Enable echo messages */
GordonSin 0:0ed2a7c7190c 1677
GordonSin 0:0ed2a7c7190c 1678 link_established(f->unit); /* The link is up; authenticate now */
GordonSin 0:0ed2a7c7190c 1679 }
GordonSin 0:0ed2a7c7190c 1680
GordonSin 0:0ed2a7c7190c 1681
GordonSin 0:0ed2a7c7190c 1682 /*
GordonSin 0:0ed2a7c7190c 1683 * lcp_down - LCP has gone DOWN.
GordonSin 0:0ed2a7c7190c 1684 *
GordonSin 0:0ed2a7c7190c 1685 * Alert other protocols.
GordonSin 0:0ed2a7c7190c 1686 */
GordonSin 0:0ed2a7c7190c 1687 static void
GordonSin 0:0ed2a7c7190c 1688 lcp_down(fsm *f)
GordonSin 0:0ed2a7c7190c 1689 {
GordonSin 0:0ed2a7c7190c 1690 lcp_options *go = &lcp_gotoptions[f->unit];
GordonSin 0:0ed2a7c7190c 1691
GordonSin 0:0ed2a7c7190c 1692 lcp_echo_lowerdown(f->unit);
GordonSin 0:0ed2a7c7190c 1693
GordonSin 0:0ed2a7c7190c 1694 link_down(f->unit);
GordonSin 0:0ed2a7c7190c 1695
GordonSin 0:0ed2a7c7190c 1696 ppp_send_config(f->unit, PPP_MRU, 0xffffffffl, 0, 0);
GordonSin 0:0ed2a7c7190c 1697 ppp_recv_config(f->unit, PPP_MRU,
GordonSin 0:0ed2a7c7190c 1698 (go->neg_asyncmap? go->asyncmap: 0x00000000),
GordonSin 0:0ed2a7c7190c 1699 go->neg_pcompression, go->neg_accompression);
GordonSin 0:0ed2a7c7190c 1700 peer_mru[f->unit] = PPP_MRU;
GordonSin 0:0ed2a7c7190c 1701 }
GordonSin 0:0ed2a7c7190c 1702
GordonSin 0:0ed2a7c7190c 1703
GordonSin 0:0ed2a7c7190c 1704 /*
GordonSin 0:0ed2a7c7190c 1705 * lcp_starting - LCP needs the lower layer up.
GordonSin 0:0ed2a7c7190c 1706 */
GordonSin 0:0ed2a7c7190c 1707 static void
GordonSin 0:0ed2a7c7190c 1708 lcp_starting(fsm *f)
GordonSin 0:0ed2a7c7190c 1709 {
GordonSin 0:0ed2a7c7190c 1710 link_required(f->unit); /* lwip: currently does nothing */
GordonSin 0:0ed2a7c7190c 1711 }
GordonSin 0:0ed2a7c7190c 1712
GordonSin 0:0ed2a7c7190c 1713
GordonSin 0:0ed2a7c7190c 1714 /*
GordonSin 0:0ed2a7c7190c 1715 * lcp_finished - LCP has finished with the lower layer.
GordonSin 0:0ed2a7c7190c 1716 */
GordonSin 0:0ed2a7c7190c 1717 static void
GordonSin 0:0ed2a7c7190c 1718 lcp_finished(fsm *f)
GordonSin 0:0ed2a7c7190c 1719 {
GordonSin 0:0ed2a7c7190c 1720 link_terminated(f->unit); /* we are finished with the link */
GordonSin 0:0ed2a7c7190c 1721 }
GordonSin 0:0ed2a7c7190c 1722
GordonSin 0:0ed2a7c7190c 1723
GordonSin 0:0ed2a7c7190c 1724 #if PPP_ADDITIONAL_CALLBACKS
GordonSin 0:0ed2a7c7190c 1725 /*
GordonSin 0:0ed2a7c7190c 1726 * print_string - print a readable representation of a string using
GordonSin 0:0ed2a7c7190c 1727 * printer.
GordonSin 0:0ed2a7c7190c 1728 */
GordonSin 0:0ed2a7c7190c 1729 static void
GordonSin 0:0ed2a7c7190c 1730 print_string( char *p, int len, void (*printer) (void *, char *, ...), void *arg)
GordonSin 0:0ed2a7c7190c 1731 {
GordonSin 0:0ed2a7c7190c 1732 int c;
GordonSin 0:0ed2a7c7190c 1733
GordonSin 0:0ed2a7c7190c 1734 printer(arg, "\"");
GordonSin 0:0ed2a7c7190c 1735 for (; len > 0; --len) {
GordonSin 0:0ed2a7c7190c 1736 c = *p++;
GordonSin 0:0ed2a7c7190c 1737 if (' ' <= c && c <= '~') {
GordonSin 0:0ed2a7c7190c 1738 if (c == '\\' || c == '"') {
GordonSin 0:0ed2a7c7190c 1739 printer(arg, "\\");
GordonSin 0:0ed2a7c7190c 1740 }
GordonSin 0:0ed2a7c7190c 1741 printer(arg, "%c", c);
GordonSin 0:0ed2a7c7190c 1742 } else {
GordonSin 0:0ed2a7c7190c 1743 switch (c) {
GordonSin 0:0ed2a7c7190c 1744 case '\n':
GordonSin 0:0ed2a7c7190c 1745 printer(arg, "\\n");
GordonSin 0:0ed2a7c7190c 1746 break;
GordonSin 0:0ed2a7c7190c 1747 case '\r':
GordonSin 0:0ed2a7c7190c 1748 printer(arg, "\\r");
GordonSin 0:0ed2a7c7190c 1749 break;
GordonSin 0:0ed2a7c7190c 1750 case '\t':
GordonSin 0:0ed2a7c7190c 1751 printer(arg, "\\t");
GordonSin 0:0ed2a7c7190c 1752 break;
GordonSin 0:0ed2a7c7190c 1753 default:
GordonSin 0:0ed2a7c7190c 1754 printer(arg, "\\%.3o", c);
GordonSin 0:0ed2a7c7190c 1755 }
GordonSin 0:0ed2a7c7190c 1756 }
GordonSin 0:0ed2a7c7190c 1757 }
GordonSin 0:0ed2a7c7190c 1758 printer(arg, "\"");
GordonSin 0:0ed2a7c7190c 1759 }
GordonSin 0:0ed2a7c7190c 1760
GordonSin 0:0ed2a7c7190c 1761
GordonSin 0:0ed2a7c7190c 1762 /*
GordonSin 0:0ed2a7c7190c 1763 * lcp_printpkt - print the contents of an LCP packet.
GordonSin 0:0ed2a7c7190c 1764 */
GordonSin 0:0ed2a7c7190c 1765 static char *lcp_codenames[] = {
GordonSin 0:0ed2a7c7190c 1766 "ConfReq", "ConfAck", "ConfNak", "ConfRej",
GordonSin 0:0ed2a7c7190c 1767 "TermReq", "TermAck", "CodeRej", "ProtRej",
GordonSin 0:0ed2a7c7190c 1768 "EchoReq", "EchoRep", "DiscReq"
GordonSin 0:0ed2a7c7190c 1769 };
GordonSin 0:0ed2a7c7190c 1770
GordonSin 0:0ed2a7c7190c 1771 static int
GordonSin 0:0ed2a7c7190c 1772 lcp_printpkt( u_char *p, int plen, void (*printer) (void *, char *, ...), void *arg)
GordonSin 0:0ed2a7c7190c 1773 {
GordonSin 0:0ed2a7c7190c 1774 int code, id, len, olen;
GordonSin 0:0ed2a7c7190c 1775 u_char *pstart, *optend;
GordonSin 0:0ed2a7c7190c 1776 u_short cishort;
GordonSin 0:0ed2a7c7190c 1777 u32_t cilong;
GordonSin 0:0ed2a7c7190c 1778
GordonSin 0:0ed2a7c7190c 1779 if (plen < HEADERLEN) {
GordonSin 0:0ed2a7c7190c 1780 return 0;
GordonSin 0:0ed2a7c7190c 1781 }
GordonSin 0:0ed2a7c7190c 1782 pstart = p;
GordonSin 0:0ed2a7c7190c 1783 GETCHAR(code, p);
GordonSin 0:0ed2a7c7190c 1784 GETCHAR(id, p);
GordonSin 0:0ed2a7c7190c 1785 GETSHORT(len, p);
GordonSin 0:0ed2a7c7190c 1786 if (len < HEADERLEN || len > plen) {
GordonSin 0:0ed2a7c7190c 1787 return 0;
GordonSin 0:0ed2a7c7190c 1788 }
GordonSin 0:0ed2a7c7190c 1789
GordonSin 0:0ed2a7c7190c 1790 if (code >= 1 && code <= sizeof(lcp_codenames) / sizeof(char *)) {
GordonSin 0:0ed2a7c7190c 1791 printer(arg, " %s", lcp_codenames[code-1]);
GordonSin 0:0ed2a7c7190c 1792 } else {
GordonSin 0:0ed2a7c7190c 1793 printer(arg, " code=0x%x", code);
GordonSin 0:0ed2a7c7190c 1794 }
GordonSin 0:0ed2a7c7190c 1795 printer(arg, " id=0x%x", id);
GordonSin 0:0ed2a7c7190c 1796 len -= HEADERLEN;
GordonSin 0:0ed2a7c7190c 1797 switch (code) {
GordonSin 0:0ed2a7c7190c 1798 case CONFREQ:
GordonSin 0:0ed2a7c7190c 1799 case CONFACK:
GordonSin 0:0ed2a7c7190c 1800 case CONFNAK:
GordonSin 0:0ed2a7c7190c 1801 case CONFREJ:
GordonSin 0:0ed2a7c7190c 1802 /* print option list */
GordonSin 0:0ed2a7c7190c 1803 while (len >= 2) {
GordonSin 0:0ed2a7c7190c 1804 GETCHAR(code, p);
GordonSin 0:0ed2a7c7190c 1805 GETCHAR(olen, p);
GordonSin 0:0ed2a7c7190c 1806 p -= 2;
GordonSin 0:0ed2a7c7190c 1807 if (olen < 2 || olen > len) {
GordonSin 0:0ed2a7c7190c 1808 break;
GordonSin 0:0ed2a7c7190c 1809 }
GordonSin 0:0ed2a7c7190c 1810 printer(arg, " <");
GordonSin 0:0ed2a7c7190c 1811 len -= olen;
GordonSin 0:0ed2a7c7190c 1812 optend = p + olen;
GordonSin 0:0ed2a7c7190c 1813 switch (code) {
GordonSin 0:0ed2a7c7190c 1814 case CI_MRU:
GordonSin 0:0ed2a7c7190c 1815 if (olen == CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 1816 p += 2;
GordonSin 0:0ed2a7c7190c 1817 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 1818 printer(arg, "mru %d", cishort);
GordonSin 0:0ed2a7c7190c 1819 }
GordonSin 0:0ed2a7c7190c 1820 break;
GordonSin 0:0ed2a7c7190c 1821 case CI_ASYNCMAP:
GordonSin 0:0ed2a7c7190c 1822 if (olen == CILEN_LONG) {
GordonSin 0:0ed2a7c7190c 1823 p += 2;
GordonSin 0:0ed2a7c7190c 1824 GETLONG(cilong, p);
GordonSin 0:0ed2a7c7190c 1825 printer(arg, "asyncmap 0x%lx", cilong);
GordonSin 0:0ed2a7c7190c 1826 }
GordonSin 0:0ed2a7c7190c 1827 break;
GordonSin 0:0ed2a7c7190c 1828 case CI_AUTHTYPE:
GordonSin 0:0ed2a7c7190c 1829 if (olen >= CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 1830 p += 2;
GordonSin 0:0ed2a7c7190c 1831 printer(arg, "auth ");
GordonSin 0:0ed2a7c7190c 1832 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 1833 switch (cishort) {
GordonSin 0:0ed2a7c7190c 1834 case PPP_PAP:
GordonSin 0:0ed2a7c7190c 1835 printer(arg, "pap");
GordonSin 0:0ed2a7c7190c 1836 break;
GordonSin 0:0ed2a7c7190c 1837 case PPP_CHAP:
GordonSin 0:0ed2a7c7190c 1838 printer(arg, "chap");
GordonSin 0:0ed2a7c7190c 1839 break;
GordonSin 0:0ed2a7c7190c 1840 default:
GordonSin 0:0ed2a7c7190c 1841 printer(arg, "0x%x", cishort);
GordonSin 0:0ed2a7c7190c 1842 }
GordonSin 0:0ed2a7c7190c 1843 }
GordonSin 0:0ed2a7c7190c 1844 break;
GordonSin 0:0ed2a7c7190c 1845 case CI_QUALITY:
GordonSin 0:0ed2a7c7190c 1846 if (olen >= CILEN_SHORT) {
GordonSin 0:0ed2a7c7190c 1847 p += 2;
GordonSin 0:0ed2a7c7190c 1848 printer(arg, "quality ");
GordonSin 0:0ed2a7c7190c 1849 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 1850 switch (cishort) {
GordonSin 0:0ed2a7c7190c 1851 case PPP_LQR:
GordonSin 0:0ed2a7c7190c 1852 printer(arg, "lqr");
GordonSin 0:0ed2a7c7190c 1853 break;
GordonSin 0:0ed2a7c7190c 1854 default:
GordonSin 0:0ed2a7c7190c 1855 printer(arg, "0x%x", cishort);
GordonSin 0:0ed2a7c7190c 1856 }
GordonSin 0:0ed2a7c7190c 1857 }
GordonSin 0:0ed2a7c7190c 1858 break;
GordonSin 0:0ed2a7c7190c 1859 case CI_CALLBACK:
GordonSin 0:0ed2a7c7190c 1860 if (olen >= CILEN_CHAR) {
GordonSin 0:0ed2a7c7190c 1861 p += 2;
GordonSin 0:0ed2a7c7190c 1862 printer(arg, "callback ");
GordonSin 0:0ed2a7c7190c 1863 GETSHORT(cishort, p);
GordonSin 0:0ed2a7c7190c 1864 switch (cishort) {
GordonSin 0:0ed2a7c7190c 1865 case CBCP_OPT:
GordonSin 0:0ed2a7c7190c 1866 printer(arg, "CBCP");
GordonSin 0:0ed2a7c7190c 1867 break;
GordonSin 0:0ed2a7c7190c 1868 default:
GordonSin 0:0ed2a7c7190c 1869 printer(arg, "0x%x", cishort);
GordonSin 0:0ed2a7c7190c 1870 }
GordonSin 0:0ed2a7c7190c 1871 }
GordonSin 0:0ed2a7c7190c 1872 break;
GordonSin 0:0ed2a7c7190c 1873 case CI_MAGICNUMBER:
GordonSin 0:0ed2a7c7190c 1874 if (olen == CILEN_LONG) {
GordonSin 0:0ed2a7c7190c 1875 p += 2;
GordonSin 0:0ed2a7c7190c 1876 GETLONG(cilong, p);
GordonSin 0:0ed2a7c7190c 1877 printer(arg, "magic 0x%x", cilong);
GordonSin 0:0ed2a7c7190c 1878 }
GordonSin 0:0ed2a7c7190c 1879 break;
GordonSin 0:0ed2a7c7190c 1880 case CI_PCOMPRESSION:
GordonSin 0:0ed2a7c7190c 1881 if (olen == CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 1882 p += 2;
GordonSin 0:0ed2a7c7190c 1883 printer(arg, "pcomp");
GordonSin 0:0ed2a7c7190c 1884 }
GordonSin 0:0ed2a7c7190c 1885 break;
GordonSin 0:0ed2a7c7190c 1886 case CI_ACCOMPRESSION:
GordonSin 0:0ed2a7c7190c 1887 if (olen == CILEN_VOID) {
GordonSin 0:0ed2a7c7190c 1888 p += 2;
GordonSin 0:0ed2a7c7190c 1889 printer(arg, "accomp");
GordonSin 0:0ed2a7c7190c 1890 }
GordonSin 0:0ed2a7c7190c 1891 break;
GordonSin 0:0ed2a7c7190c 1892 }
GordonSin 0:0ed2a7c7190c 1893 while (p < optend) {
GordonSin 0:0ed2a7c7190c 1894 GETCHAR(code, p);
GordonSin 0:0ed2a7c7190c 1895 printer(arg, " %.2x", code);
GordonSin 0:0ed2a7c7190c 1896 }
GordonSin 0:0ed2a7c7190c 1897 printer(arg, ">");
GordonSin 0:0ed2a7c7190c 1898 }
GordonSin 0:0ed2a7c7190c 1899 break;
GordonSin 0:0ed2a7c7190c 1900
GordonSin 0:0ed2a7c7190c 1901 case TERMACK:
GordonSin 0:0ed2a7c7190c 1902 case TERMREQ:
GordonSin 0:0ed2a7c7190c 1903 if (len > 0 && *p >= ' ' && *p < 0x7f) {
GordonSin 0:0ed2a7c7190c 1904 printer(arg, " ");
GordonSin 0:0ed2a7c7190c 1905 print_string((char*)p, len, printer, arg);
GordonSin 0:0ed2a7c7190c 1906 p += len;
GordonSin 0:0ed2a7c7190c 1907 len = 0;
GordonSin 0:0ed2a7c7190c 1908 }
GordonSin 0:0ed2a7c7190c 1909 break;
GordonSin 0:0ed2a7c7190c 1910
GordonSin 0:0ed2a7c7190c 1911 case ECHOREQ:
GordonSin 0:0ed2a7c7190c 1912 case ECHOREP:
GordonSin 0:0ed2a7c7190c 1913 case DISCREQ:
GordonSin 0:0ed2a7c7190c 1914 if (len >= 4) {
GordonSin 0:0ed2a7c7190c 1915 GETLONG(cilong, p);
GordonSin 0:0ed2a7c7190c 1916 printer(arg, " magic=0x%x", cilong);
GordonSin 0:0ed2a7c7190c 1917 p += 4;
GordonSin 0:0ed2a7c7190c 1918 len -= 4;
GordonSin 0:0ed2a7c7190c 1919 }
GordonSin 0:0ed2a7c7190c 1920 break;
GordonSin 0:0ed2a7c7190c 1921 }
GordonSin 0:0ed2a7c7190c 1922
GordonSin 0:0ed2a7c7190c 1923 /* print the rest of the bytes in the packet */
GordonSin 0:0ed2a7c7190c 1924 for (; len > 0; --len) {
GordonSin 0:0ed2a7c7190c 1925 GETCHAR(code, p);
GordonSin 0:0ed2a7c7190c 1926 printer(arg, " %.2x", code);
GordonSin 0:0ed2a7c7190c 1927 }
GordonSin 0:0ed2a7c7190c 1928
GordonSin 0:0ed2a7c7190c 1929 return (int)(p - pstart);
GordonSin 0:0ed2a7c7190c 1930 }
GordonSin 0:0ed2a7c7190c 1931 #endif /* PPP_ADDITIONAL_CALLBACKS */
GordonSin 0:0ed2a7c7190c 1932
GordonSin 0:0ed2a7c7190c 1933 /*
GordonSin 0:0ed2a7c7190c 1934 * Time to shut down the link because there is nothing out there.
GordonSin 0:0ed2a7c7190c 1935 */
GordonSin 0:0ed2a7c7190c 1936 static void
GordonSin 0:0ed2a7c7190c 1937 LcpLinkFailure (fsm *f)
GordonSin 0:0ed2a7c7190c 1938 {
GordonSin 0:0ed2a7c7190c 1939 if (f->state == LS_OPENED) {
GordonSin 0:0ed2a7c7190c 1940 LCPDEBUG(LOG_INFO, ("No response to %d echo-requests\n", lcp_echos_pending));
GordonSin 0:0ed2a7c7190c 1941 LCPDEBUG(LOG_NOTICE, ("Serial link appears to be disconnected.\n"));
GordonSin 0:0ed2a7c7190c 1942 lcp_close(f->unit, "Peer not responding");
GordonSin 0:0ed2a7c7190c 1943 }
GordonSin 0:0ed2a7c7190c 1944 }
GordonSin 0:0ed2a7c7190c 1945
GordonSin 0:0ed2a7c7190c 1946 /*
GordonSin 0:0ed2a7c7190c 1947 * Timer expired for the LCP echo requests from this process.
GordonSin 0:0ed2a7c7190c 1948 */
GordonSin 0:0ed2a7c7190c 1949 static void
GordonSin 0:0ed2a7c7190c 1950 LcpEchoCheck (fsm *f)
GordonSin 0:0ed2a7c7190c 1951 {
GordonSin 0:0ed2a7c7190c 1952 LcpSendEchoRequest (f);
GordonSin 0:0ed2a7c7190c 1953
GordonSin 0:0ed2a7c7190c 1954 /*
GordonSin 0:0ed2a7c7190c 1955 * Start the timer for the next interval.
GordonSin 0:0ed2a7c7190c 1956 */
GordonSin 0:0ed2a7c7190c 1957 LWIP_ASSERT("lcp_echo_timer_running == 0", lcp_echo_timer_running == 0);
GordonSin 0:0ed2a7c7190c 1958
GordonSin 0:0ed2a7c7190c 1959 TIMEOUT (LcpEchoTimeout, f, lcp_echo_interval);
GordonSin 0:0ed2a7c7190c 1960 lcp_echo_timer_running = 1;
GordonSin 0:0ed2a7c7190c 1961 }
GordonSin 0:0ed2a7c7190c 1962
GordonSin 0:0ed2a7c7190c 1963 /*
GordonSin 0:0ed2a7c7190c 1964 * LcpEchoTimeout - Timer expired on the LCP echo
GordonSin 0:0ed2a7c7190c 1965 */
GordonSin 0:0ed2a7c7190c 1966 static void
GordonSin 0:0ed2a7c7190c 1967 LcpEchoTimeout (void *arg)
GordonSin 0:0ed2a7c7190c 1968 {
GordonSin 0:0ed2a7c7190c 1969 if (lcp_echo_timer_running != 0) {
GordonSin 0:0ed2a7c7190c 1970 lcp_echo_timer_running = 0;
GordonSin 0:0ed2a7c7190c 1971 LcpEchoCheck ((fsm *) arg);
GordonSin 0:0ed2a7c7190c 1972 }
GordonSin 0:0ed2a7c7190c 1973 }
GordonSin 0:0ed2a7c7190c 1974
GordonSin 0:0ed2a7c7190c 1975 /*
GordonSin 0:0ed2a7c7190c 1976 * LcpEchoReply - LCP has received a reply to the echo
GordonSin 0:0ed2a7c7190c 1977 */
GordonSin 0:0ed2a7c7190c 1978 static void
GordonSin 0:0ed2a7c7190c 1979 lcp_received_echo_reply (fsm *f, int id, u_char *inp, int len)
GordonSin 0:0ed2a7c7190c 1980 {
GordonSin 0:0ed2a7c7190c 1981 u32_t magic;
GordonSin 0:0ed2a7c7190c 1982
GordonSin 0:0ed2a7c7190c 1983 LWIP_UNUSED_ARG(id);
GordonSin 0:0ed2a7c7190c 1984
GordonSin 0:0ed2a7c7190c 1985 /* Check the magic number - don't count replies from ourselves. */
GordonSin 0:0ed2a7c7190c 1986 if (len < 4) {
GordonSin 0:0ed2a7c7190c 1987 LCPDEBUG(LOG_WARNING, ("lcp: received short Echo-Reply, length %d\n", len));
GordonSin 0:0ed2a7c7190c 1988 return;
GordonSin 0:0ed2a7c7190c 1989 }
GordonSin 0:0ed2a7c7190c 1990 GETLONG(magic, inp);
GordonSin 0:0ed2a7c7190c 1991 if (lcp_gotoptions[f->unit].neg_magicnumber && magic == lcp_gotoptions[f->unit].magicnumber) {
GordonSin 0:0ed2a7c7190c 1992 LCPDEBUG(LOG_WARNING, ("appear to have received our own echo-reply!\n"));
GordonSin 0:0ed2a7c7190c 1993 return;
GordonSin 0:0ed2a7c7190c 1994 }
GordonSin 0:0ed2a7c7190c 1995
GordonSin 0:0ed2a7c7190c 1996 /* Reset the number of outstanding echo frames */
GordonSin 0:0ed2a7c7190c 1997 lcp_echos_pending = 0;
GordonSin 0:0ed2a7c7190c 1998 }
GordonSin 0:0ed2a7c7190c 1999
GordonSin 0:0ed2a7c7190c 2000 /*
GordonSin 0:0ed2a7c7190c 2001 * LcpSendEchoRequest - Send an echo request frame to the peer
GordonSin 0:0ed2a7c7190c 2002 */
GordonSin 0:0ed2a7c7190c 2003 static void
GordonSin 0:0ed2a7c7190c 2004 LcpSendEchoRequest (fsm *f)
GordonSin 0:0ed2a7c7190c 2005 {
GordonSin 0:0ed2a7c7190c 2006 u32_t lcp_magic;
GordonSin 0:0ed2a7c7190c 2007 u_char pkt[4], *pktp;
GordonSin 0:0ed2a7c7190c 2008
GordonSin 0:0ed2a7c7190c 2009 /*
GordonSin 0:0ed2a7c7190c 2010 * Detect the failure of the peer at this point.
GordonSin 0:0ed2a7c7190c 2011 */
GordonSin 0:0ed2a7c7190c 2012 if (lcp_echo_fails != 0) {
GordonSin 0:0ed2a7c7190c 2013 if (lcp_echos_pending >= lcp_echo_fails) {
GordonSin 0:0ed2a7c7190c 2014 LcpLinkFailure(f);
GordonSin 0:0ed2a7c7190c 2015 lcp_echos_pending = 0;
GordonSin 0:0ed2a7c7190c 2016 }
GordonSin 0:0ed2a7c7190c 2017 }
GordonSin 0:0ed2a7c7190c 2018
GordonSin 0:0ed2a7c7190c 2019 /*
GordonSin 0:0ed2a7c7190c 2020 * Make and send the echo request frame.
GordonSin 0:0ed2a7c7190c 2021 */
GordonSin 0:0ed2a7c7190c 2022 if (f->state == LS_OPENED) {
GordonSin 0:0ed2a7c7190c 2023 lcp_magic = lcp_gotoptions[f->unit].magicnumber;
GordonSin 0:0ed2a7c7190c 2024 pktp = pkt;
GordonSin 0:0ed2a7c7190c 2025 PUTLONG(lcp_magic, pktp);
GordonSin 0:0ed2a7c7190c 2026 fsm_sdata(f, ECHOREQ, (u_char)(lcp_echo_number++ & 0xFF), pkt, (int)(pktp - pkt));
GordonSin 0:0ed2a7c7190c 2027 ++lcp_echos_pending;
GordonSin 0:0ed2a7c7190c 2028 }
GordonSin 0:0ed2a7c7190c 2029 }
GordonSin 0:0ed2a7c7190c 2030
GordonSin 0:0ed2a7c7190c 2031 /*
GordonSin 0:0ed2a7c7190c 2032 * lcp_echo_lowerup - Start the timer for the LCP frame
GordonSin 0:0ed2a7c7190c 2033 */
GordonSin 0:0ed2a7c7190c 2034
GordonSin 0:0ed2a7c7190c 2035 static void
GordonSin 0:0ed2a7c7190c 2036 lcp_echo_lowerup (int unit)
GordonSin 0:0ed2a7c7190c 2037 {
GordonSin 0:0ed2a7c7190c 2038 fsm *f = &lcp_fsm[unit];
GordonSin 0:0ed2a7c7190c 2039
GordonSin 0:0ed2a7c7190c 2040 /* Clear the parameters for generating echo frames */
GordonSin 0:0ed2a7c7190c 2041 lcp_echos_pending = 0;
GordonSin 0:0ed2a7c7190c 2042 lcp_echo_number = 0;
GordonSin 0:0ed2a7c7190c 2043 lcp_echo_timer_running = 0;
GordonSin 0:0ed2a7c7190c 2044
GordonSin 0:0ed2a7c7190c 2045 /* If a timeout interval is specified then start the timer */
GordonSin 0:0ed2a7c7190c 2046 if (lcp_echo_interval != 0) {
GordonSin 0:0ed2a7c7190c 2047 LcpEchoCheck (f);
GordonSin 0:0ed2a7c7190c 2048 }
GordonSin 0:0ed2a7c7190c 2049 }
GordonSin 0:0ed2a7c7190c 2050
GordonSin 0:0ed2a7c7190c 2051 /*
GordonSin 0:0ed2a7c7190c 2052 * lcp_echo_lowerdown - Stop the timer for the LCP frame
GordonSin 0:0ed2a7c7190c 2053 */
GordonSin 0:0ed2a7c7190c 2054
GordonSin 0:0ed2a7c7190c 2055 static void
GordonSin 0:0ed2a7c7190c 2056 lcp_echo_lowerdown (int unit)
GordonSin 0:0ed2a7c7190c 2057 {
GordonSin 0:0ed2a7c7190c 2058 fsm *f = &lcp_fsm[unit];
GordonSin 0:0ed2a7c7190c 2059
GordonSin 0:0ed2a7c7190c 2060 if (lcp_echo_timer_running != 0) {
GordonSin 0:0ed2a7c7190c 2061 UNTIMEOUT (LcpEchoTimeout, f);
GordonSin 0:0ed2a7c7190c 2062 lcp_echo_timer_running = 0;
GordonSin 0:0ed2a7c7190c 2063 }
GordonSin 0:0ed2a7c7190c 2064 }
GordonSin 0:0ed2a7c7190c 2065
GordonSin 0:0ed2a7c7190c 2066 #endif /* PPP_SUPPORT */