Experimental HTTPClient with proxy support

Committer:
igorsk
Date:
Wed Jun 29 16:01:58 2011 +0000
Revision:
0:b56b6a05cad4

        

Who changed what in which revision?

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