IBM Watson IoT / Mbed OS IBMIoTClientEthernetExample

Contains example code to connect the mbed LPC1768 or FRDM-K64F devices to the IBM Internet of Things Cloud service via ethernet.

Dependencies:   C12832 MQTT LM75B MMA7660

Dependents:   MFT_IoT_demo_USB400 IBM_RFID

EthernetInterface/lwip/netif/ppp/lcp.c@6:37b6d0d56190, 2014-08-20 (annotated)

Committer:
samdanbury
Date:
Wed Aug 20 12:45:14 2014 +0000
Revision:
6:37b6d0d56190
Code completely changed to improve the structure, flow and memory usage of the application

Who changed what in which revision?

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