NXP fan (in Japan) / Mbed 2 deprecated TwitterExample

TwitterExample with newer library (2012Aug)

Dependencies:   EthernetNetIf HTTPClient mbed

EthernetNetIf/LPC1768/lwip/netif/ppp/chap.h@0:075157567b0c, 2012-08-29 (annotated)

Committer:
nxpfan
Date:
Wed Aug 29 03:50:19 2012 +0000
Revision:
0:075157567b0c
simple twitter example with newer library

Who changed what in which revision?

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