SNMP agent attached to SPI slave

Dependencies:   mbed

Committer:
lorcansmith
Date:
Mon Aug 13 15:07:40 2012 +0000
Revision:
0:2a53a4c3238c
v1.1 release includes ioAlarm traps

Who changed what in which revision?

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