Adam Green / EthernetInterface

Important changes to repositories hosted on mbed.com

Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.

To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.

It is also possible to export all your personal repositories from the account settings page.

lwip/netif/ppp/lcp.c@0:3b00827bb0b7, 2013-09-07 (annotated)

Committer:
AdamGreen
Date:
Sat Sep 07 21:38:42 2013 +0000
Revision:
0:3b00827bb0b7
Sync to latest network stack source from github.

Who changed what in which revision?

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