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