Adam Green / EthernetInterface
Committer:
AdamGreen
Date:
Sat Oct 26 08:51:36 2013 +0000
Revision:
1:eadc868c2acf
Parent:
0:3b00827bb0b7
Fix TCP checksum bug and stranded large TCP segments.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
AdamGreen 0:3b00827bb0b7 1 /*****************************************************************************
AdamGreen 0:3b00827bb0b7 2 * chap.h - Network Challenge Handshake Authentication Protocol header file.
AdamGreen 0:3b00827bb0b7 3 *
AdamGreen 0:3b00827bb0b7 4 * Copyright (c) 2003 by Marc Boucher, Services Informatiques (MBSI) inc.
AdamGreen 0:3b00827bb0b7 5 * portions Copyright (c) 1998 Global Election Systems Inc.
AdamGreen 0:3b00827bb0b7 6 *
AdamGreen 0:3b00827bb0b7 7 * The authors hereby grant permission to use, copy, modify, distribute,
AdamGreen 0:3b00827bb0b7 8 * and license this software and its documentation for any purpose, provided
AdamGreen 0:3b00827bb0b7 9 * that existing copyright notices are retained in all copies and that this
AdamGreen 0:3b00827bb0b7 10 * notice and the following disclaimer are included verbatim in any
AdamGreen 0:3b00827bb0b7 11 * distributions. No written agreement, license, or royalty fee is required
AdamGreen 0:3b00827bb0b7 12 * for any of the authorized uses.
AdamGreen 0:3b00827bb0b7 13 *
AdamGreen 0:3b00827bb0b7 14 * THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS *AS IS* AND ANY EXPRESS OR
AdamGreen 0:3b00827bb0b7 15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
AdamGreen 0:3b00827bb0b7 16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
AdamGreen 0:3b00827bb0b7 17 * IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
AdamGreen 0:3b00827bb0b7 18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
AdamGreen 0:3b00827bb0b7 19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
AdamGreen 0:3b00827bb0b7 20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
AdamGreen 0:3b00827bb0b7 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
AdamGreen 0:3b00827bb0b7 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
AdamGreen 0:3b00827bb0b7 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
AdamGreen 0:3b00827bb0b7 24 *
AdamGreen 0:3b00827bb0b7 25 ******************************************************************************
AdamGreen 0:3b00827bb0b7 26 * REVISION HISTORY
AdamGreen 0:3b00827bb0b7 27 *
AdamGreen 0:3b00827bb0b7 28 * 03-01-01 Marc Boucher <marc@mbsi.ca>
AdamGreen 0:3b00827bb0b7 29 * Ported to lwIP.
AdamGreen 0:3b00827bb0b7 30 * 97-12-03 Guy Lancaster <lancasterg@acm.org>, Global Election Systems Inc.
AdamGreen 0:3b00827bb0b7 31 * Original built from BSD network code.
AdamGreen 0:3b00827bb0b7 32 ******************************************************************************/
AdamGreen 0:3b00827bb0b7 33 /*
AdamGreen 0:3b00827bb0b7 34 * chap.h - Challenge Handshake Authentication Protocol definitions.
AdamGreen 0:3b00827bb0b7 35 *
AdamGreen 0:3b00827bb0b7 36 * Copyright (c) 1993 The Australian National University.
AdamGreen 0:3b00827bb0b7 37 * All rights reserved.
AdamGreen 0:3b00827bb0b7 38 *
AdamGreen 0:3b00827bb0b7 39 * Redistribution and use in source and binary forms are permitted
AdamGreen 0:3b00827bb0b7 40 * provided that the above copyright notice and this paragraph are
AdamGreen 0:3b00827bb0b7 41 * duplicated in all such forms and that any documentation,
AdamGreen 0:3b00827bb0b7 42 * advertising materials, and other materials related to such
AdamGreen 0:3b00827bb0b7 43 * distribution and use acknowledge that the software was developed
AdamGreen 0:3b00827bb0b7 44 * by the Australian National University. The name of the University
AdamGreen 0:3b00827bb0b7 45 * may not be used to endorse or promote products derived from this
AdamGreen 0:3b00827bb0b7 46 * software without specific prior written permission.
AdamGreen 0:3b00827bb0b7 47 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
AdamGreen 0:3b00827bb0b7 48 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
AdamGreen 0:3b00827bb0b7 49 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
AdamGreen 0:3b00827bb0b7 50 *
AdamGreen 0:3b00827bb0b7 51 * Copyright (c) 1991 Gregory M. Christy
AdamGreen 0:3b00827bb0b7 52 * All rights reserved.
AdamGreen 0:3b00827bb0b7 53 *
AdamGreen 0:3b00827bb0b7 54 * Redistribution and use in source and binary forms are permitted
AdamGreen 0:3b00827bb0b7 55 * provided that the above copyright notice and this paragraph are
AdamGreen 0:3b00827bb0b7 56 * duplicated in all such forms and that any documentation,
AdamGreen 0:3b00827bb0b7 57 * advertising materials, and other materials related to such
AdamGreen 0:3b00827bb0b7 58 * distribution and use acknowledge that the software was developed
AdamGreen 0:3b00827bb0b7 59 * by the author.
AdamGreen 0:3b00827bb0b7 60 *
AdamGreen 0:3b00827bb0b7 61 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
AdamGreen 0:3b00827bb0b7 62 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
AdamGreen 0:3b00827bb0b7 63 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
AdamGreen 0:3b00827bb0b7 64 *
AdamGreen 0:3b00827bb0b7 65 * $Id: chap.h,v 1.6 2010/01/24 13:19:34 goldsimon Exp $
AdamGreen 0:3b00827bb0b7 66 */
AdamGreen 0:3b00827bb0b7 67
AdamGreen 0:3b00827bb0b7 68 #ifndef CHAP_H
AdamGreen 0:3b00827bb0b7 69 #define CHAP_H
AdamGreen 0:3b00827bb0b7 70
AdamGreen 0:3b00827bb0b7 71 /* Code + ID + length */
AdamGreen 0:3b00827bb0b7 72 #define CHAP_HEADERLEN 4
AdamGreen 0:3b00827bb0b7 73
AdamGreen 0:3b00827bb0b7 74 /*
AdamGreen 0:3b00827bb0b7 75 * CHAP codes.
AdamGreen 0:3b00827bb0b7 76 */
AdamGreen 0:3b00827bb0b7 77
AdamGreen 0:3b00827bb0b7 78 #define CHAP_DIGEST_MD5 5 /* use MD5 algorithm */
AdamGreen 0:3b00827bb0b7 79 #define MD5_SIGNATURE_SIZE 16 /* 16 bytes in a MD5 message digest */
AdamGreen 0:3b00827bb0b7 80 #define CHAP_MICROSOFT 0x80 /* use Microsoft-compatible alg. */
AdamGreen 0:3b00827bb0b7 81 #define MS_CHAP_RESPONSE_LEN 49 /* Response length for MS-CHAP */
AdamGreen 0:3b00827bb0b7 82
AdamGreen 0:3b00827bb0b7 83 #define CHAP_CHALLENGE 1
AdamGreen 0:3b00827bb0b7 84 #define CHAP_RESPONSE 2
AdamGreen 0:3b00827bb0b7 85 #define CHAP_SUCCESS 3
AdamGreen 0:3b00827bb0b7 86 #define CHAP_FAILURE 4
AdamGreen 0:3b00827bb0b7 87
AdamGreen 0:3b00827bb0b7 88 /*
AdamGreen 0:3b00827bb0b7 89 * Challenge lengths (for challenges we send) and other limits.
AdamGreen 0:3b00827bb0b7 90 */
AdamGreen 0:3b00827bb0b7 91 #define MIN_CHALLENGE_LENGTH 32
AdamGreen 0:3b00827bb0b7 92 #define MAX_CHALLENGE_LENGTH 64
AdamGreen 0:3b00827bb0b7 93 #define MAX_RESPONSE_LENGTH 64 /* sufficient for MD5 or MS-CHAP */
AdamGreen 0:3b00827bb0b7 94
AdamGreen 0:3b00827bb0b7 95 /*
AdamGreen 0:3b00827bb0b7 96 * Each interface is described by a chap structure.
AdamGreen 0:3b00827bb0b7 97 */
AdamGreen 0:3b00827bb0b7 98
AdamGreen 0:3b00827bb0b7 99 typedef struct chap_state {
AdamGreen 0:3b00827bb0b7 100 int unit; /* Interface unit number */
AdamGreen 0:3b00827bb0b7 101 int clientstate; /* Client state */
AdamGreen 0:3b00827bb0b7 102 int serverstate; /* Server state */
AdamGreen 0:3b00827bb0b7 103 u_char challenge[MAX_CHALLENGE_LENGTH]; /* last challenge string sent */
AdamGreen 0:3b00827bb0b7 104 u_char chal_len; /* challenge length */
AdamGreen 0:3b00827bb0b7 105 u_char chal_id; /* ID of last challenge */
AdamGreen 0:3b00827bb0b7 106 u_char chal_type; /* hash algorithm for challenges */
AdamGreen 0:3b00827bb0b7 107 u_char id; /* Current id */
AdamGreen 0:3b00827bb0b7 108 char *chal_name; /* Our name to use with challenge */
AdamGreen 0:3b00827bb0b7 109 int chal_interval; /* Time until we challenge peer again */
AdamGreen 0:3b00827bb0b7 110 int timeouttime; /* Timeout time in seconds */
AdamGreen 0:3b00827bb0b7 111 int max_transmits; /* Maximum # of challenge transmissions */
AdamGreen 0:3b00827bb0b7 112 int chal_transmits; /* Number of transmissions of challenge */
AdamGreen 0:3b00827bb0b7 113 int resp_transmits; /* Number of transmissions of response */
AdamGreen 0:3b00827bb0b7 114 u_char response[MAX_RESPONSE_LENGTH]; /* Response to send */
AdamGreen 0:3b00827bb0b7 115 u_char resp_length; /* length of response */
AdamGreen 0:3b00827bb0b7 116 u_char resp_id; /* ID for response messages */
AdamGreen 0:3b00827bb0b7 117 u_char resp_type; /* hash algorithm for responses */
AdamGreen 0:3b00827bb0b7 118 char *resp_name; /* Our name to send with response */
AdamGreen 0:3b00827bb0b7 119 } chap_state;
AdamGreen 0:3b00827bb0b7 120
AdamGreen 0:3b00827bb0b7 121
AdamGreen 0:3b00827bb0b7 122 /*
AdamGreen 0:3b00827bb0b7 123 * Client (peer) states.
AdamGreen 0:3b00827bb0b7 124 */
AdamGreen 0:3b00827bb0b7 125 #define CHAPCS_INITIAL 0 /* Lower layer down, not opened */
AdamGreen 0:3b00827bb0b7 126 #define CHAPCS_CLOSED 1 /* Lower layer up, not opened */
AdamGreen 0:3b00827bb0b7 127 #define CHAPCS_PENDING 2 /* Auth us to peer when lower up */
AdamGreen 0:3b00827bb0b7 128 #define CHAPCS_LISTEN 3 /* Listening for a challenge */
AdamGreen 0:3b00827bb0b7 129 #define CHAPCS_RESPONSE 4 /* Sent response, waiting for status */
AdamGreen 0:3b00827bb0b7 130 #define CHAPCS_OPEN 5 /* We've received Success */
AdamGreen 0:3b00827bb0b7 131
AdamGreen 0:3b00827bb0b7 132 /*
AdamGreen 0:3b00827bb0b7 133 * Server (authenticator) states.
AdamGreen 0:3b00827bb0b7 134 */
AdamGreen 0:3b00827bb0b7 135 #define CHAPSS_INITIAL 0 /* Lower layer down, not opened */
AdamGreen 0:3b00827bb0b7 136 #define CHAPSS_CLOSED 1 /* Lower layer up, not opened */
AdamGreen 0:3b00827bb0b7 137 #define CHAPSS_PENDING 2 /* Auth peer when lower up */
AdamGreen 0:3b00827bb0b7 138 #define CHAPSS_INITIAL_CHAL 3 /* We've sent the first challenge */
AdamGreen 0:3b00827bb0b7 139 #define CHAPSS_OPEN 4 /* We've sent a Success msg */
AdamGreen 0:3b00827bb0b7 140 #define CHAPSS_RECHALLENGE 5 /* We've sent another challenge */
AdamGreen 0:3b00827bb0b7 141 #define CHAPSS_BADAUTH 6 /* We've sent a Failure msg */
AdamGreen 0:3b00827bb0b7 142
AdamGreen 0:3b00827bb0b7 143 extern chap_state chap[];
AdamGreen 0:3b00827bb0b7 144
AdamGreen 0:3b00827bb0b7 145 void ChapAuthWithPeer (int, char *, u_char);
AdamGreen 0:3b00827bb0b7 146 void ChapAuthPeer (int, char *, u_char);
AdamGreen 0:3b00827bb0b7 147
AdamGreen 0:3b00827bb0b7 148 extern struct protent chap_protent;
AdamGreen 0:3b00827bb0b7 149
AdamGreen 0:3b00827bb0b7 150 #endif /* CHAP_H */