Measure system

Dependencies:   EthernetNetIf mbed RF12B

Committer:
benecsj
Date:
Thu Mar 10 19:56:45 2011 +0000
Revision:
1:b26ab2467b1a

        

Who changed what in which revision?

UserRevisionLine numberNew contents of line
benecsj 1:b26ab2467b1a 1 /*****************************************************************************
benecsj 1:b26ab2467b1a 2 * fsm.h - Network Control Protocol Finite State Machine header file.
benecsj 1:b26ab2467b1a 3 *
benecsj 1:b26ab2467b1a 4 * Copyright (c) 2003 by Marc Boucher, Services Informatiques (MBSI) inc.
benecsj 1:b26ab2467b1a 5 * Copyright (c) 1997 Global Election Systems Inc.
benecsj 1:b26ab2467b1a 6 *
benecsj 1:b26ab2467b1a 7 * The authors hereby grant permission to use, copy, modify, distribute,
benecsj 1:b26ab2467b1a 8 * and license this software and its documentation for any purpose, provided
benecsj 1:b26ab2467b1a 9 * that existing copyright notices are retained in all copies and that this
benecsj 1:b26ab2467b1a 10 * notice and the following disclaimer are included verbatim in any
benecsj 1:b26ab2467b1a 11 * distributions. No written agreement, license, or royalty fee is required
benecsj 1:b26ab2467b1a 12 * for any of the authorized uses.
benecsj 1:b26ab2467b1a 13 *
benecsj 1:b26ab2467b1a 14 * THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS *AS IS* AND ANY EXPRESS OR
benecsj 1:b26ab2467b1a 15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
benecsj 1:b26ab2467b1a 16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
benecsj 1:b26ab2467b1a 17 * IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
benecsj 1:b26ab2467b1a 18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
benecsj 1:b26ab2467b1a 19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
benecsj 1:b26ab2467b1a 20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
benecsj 1:b26ab2467b1a 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
benecsj 1:b26ab2467b1a 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
benecsj 1:b26ab2467b1a 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
benecsj 1:b26ab2467b1a 24 *
benecsj 1:b26ab2467b1a 25 ******************************************************************************
benecsj 1:b26ab2467b1a 26 * REVISION HISTORY
benecsj 1:b26ab2467b1a 27 *
benecsj 1:b26ab2467b1a 28 * 03-01-01 Marc Boucher <marc@mbsi.ca>
benecsj 1:b26ab2467b1a 29 * Ported to lwIP.
benecsj 1:b26ab2467b1a 30 * 97-11-05 Guy Lancaster <glanca@gesn.com>, Global Election Systems Inc.
benecsj 1:b26ab2467b1a 31 * Original based on BSD code.
benecsj 1:b26ab2467b1a 32 *****************************************************************************/
benecsj 1:b26ab2467b1a 33 /*
benecsj 1:b26ab2467b1a 34 * fsm.h - {Link, IP} Control Protocol Finite State Machine definitions.
benecsj 1:b26ab2467b1a 35 *
benecsj 1:b26ab2467b1a 36 * Copyright (c) 1989 Carnegie Mellon University.
benecsj 1:b26ab2467b1a 37 * All rights reserved.
benecsj 1:b26ab2467b1a 38 *
benecsj 1:b26ab2467b1a 39 * Redistribution and use in source and binary forms are permitted
benecsj 1:b26ab2467b1a 40 * provided that the above copyright notice and this paragraph are
benecsj 1:b26ab2467b1a 41 * duplicated in all such forms and that any documentation,
benecsj 1:b26ab2467b1a 42 * advertising materials, and other materials related to such
benecsj 1:b26ab2467b1a 43 * distribution and use acknowledge that the software was developed
benecsj 1:b26ab2467b1a 44 * by Carnegie Mellon University. The name of the
benecsj 1:b26ab2467b1a 45 * University may not be used to endorse or promote products derived
benecsj 1:b26ab2467b1a 46 * from this software without specific prior written permission.
benecsj 1:b26ab2467b1a 47 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
benecsj 1:b26ab2467b1a 48 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
benecsj 1:b26ab2467b1a 49 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
benecsj 1:b26ab2467b1a 50 *
benecsj 1:b26ab2467b1a 51 * $Id: fsm.h,v 1.5 2009/12/31 17:08:08 goldsimon Exp $
benecsj 1:b26ab2467b1a 52 */
benecsj 1:b26ab2467b1a 53
benecsj 1:b26ab2467b1a 54 #ifndef FSM_H
benecsj 1:b26ab2467b1a 55 #define FSM_H
benecsj 1:b26ab2467b1a 56
benecsj 1:b26ab2467b1a 57 /*
benecsj 1:b26ab2467b1a 58 * LCP Packet header = Code, id, length.
benecsj 1:b26ab2467b1a 59 */
benecsj 1:b26ab2467b1a 60 #define HEADERLEN (sizeof (u_char) + sizeof (u_char) + sizeof (u_short))
benecsj 1:b26ab2467b1a 61
benecsj 1:b26ab2467b1a 62
benecsj 1:b26ab2467b1a 63 /*
benecsj 1:b26ab2467b1a 64 * CP (LCP, IPCP, etc.) codes.
benecsj 1:b26ab2467b1a 65 */
benecsj 1:b26ab2467b1a 66 #define CONFREQ 1 /* Configuration Request */
benecsj 1:b26ab2467b1a 67 #define CONFACK 2 /* Configuration Ack */
benecsj 1:b26ab2467b1a 68 #define CONFNAK 3 /* Configuration Nak */
benecsj 1:b26ab2467b1a 69 #define CONFREJ 4 /* Configuration Reject */
benecsj 1:b26ab2467b1a 70 #define TERMREQ 5 /* Termination Request */
benecsj 1:b26ab2467b1a 71 #define TERMACK 6 /* Termination Ack */
benecsj 1:b26ab2467b1a 72 #define CODEREJ 7 /* Code Reject */
benecsj 1:b26ab2467b1a 73
benecsj 1:b26ab2467b1a 74
benecsj 1:b26ab2467b1a 75 /*
benecsj 1:b26ab2467b1a 76 * Each FSM is described by an fsm structure and fsm callbacks.
benecsj 1:b26ab2467b1a 77 */
benecsj 1:b26ab2467b1a 78 typedef struct fsm {
benecsj 1:b26ab2467b1a 79 int unit; /* Interface unit number */
benecsj 1:b26ab2467b1a 80 u_short protocol; /* Data Link Layer Protocol field value */
benecsj 1:b26ab2467b1a 81 int state; /* State */
benecsj 1:b26ab2467b1a 82 int flags; /* Contains option bits */
benecsj 1:b26ab2467b1a 83 u_char id; /* Current id */
benecsj 1:b26ab2467b1a 84 u_char reqid; /* Current request id */
benecsj 1:b26ab2467b1a 85 u_char seen_ack; /* Have received valid Ack/Nak/Rej to Req */
benecsj 1:b26ab2467b1a 86 int timeouttime; /* Timeout time in milliseconds */
benecsj 1:b26ab2467b1a 87 int maxconfreqtransmits; /* Maximum Configure-Request transmissions */
benecsj 1:b26ab2467b1a 88 int retransmits; /* Number of retransmissions left */
benecsj 1:b26ab2467b1a 89 int maxtermtransmits; /* Maximum Terminate-Request transmissions */
benecsj 1:b26ab2467b1a 90 int nakloops; /* Number of nak loops since last ack */
benecsj 1:b26ab2467b1a 91 int maxnakloops; /* Maximum number of nak loops tolerated */
benecsj 1:b26ab2467b1a 92 struct fsm_callbacks* callbacks; /* Callback routines */
benecsj 1:b26ab2467b1a 93 char* term_reason; /* Reason for closing protocol */
benecsj 1:b26ab2467b1a 94 int term_reason_len; /* Length of term_reason */
benecsj 1:b26ab2467b1a 95 } fsm;
benecsj 1:b26ab2467b1a 96
benecsj 1:b26ab2467b1a 97
benecsj 1:b26ab2467b1a 98 typedef struct fsm_callbacks {
benecsj 1:b26ab2467b1a 99 void (*resetci)(fsm*); /* Reset our Configuration Information */
benecsj 1:b26ab2467b1a 100 int (*cilen)(fsm*); /* Length of our Configuration Information */
benecsj 1:b26ab2467b1a 101 void (*addci)(fsm*, u_char*, int*); /* Add our Configuration Information */
benecsj 1:b26ab2467b1a 102 int (*ackci)(fsm*, u_char*, int); /* ACK our Configuration Information */
benecsj 1:b26ab2467b1a 103 int (*nakci)(fsm*, u_char*, int); /* NAK our Configuration Information */
benecsj 1:b26ab2467b1a 104 int (*rejci)(fsm*, u_char*, int); /* Reject our Configuration Information */
benecsj 1:b26ab2467b1a 105 int (*reqci)(fsm*, u_char*, int*, int); /* Request peer's Configuration Information */
benecsj 1:b26ab2467b1a 106 void (*up)(fsm*); /* Called when fsm reaches LS_OPENED state */
benecsj 1:b26ab2467b1a 107 void (*down)(fsm*); /* Called when fsm leaves LS_OPENED state */
benecsj 1:b26ab2467b1a 108 void (*starting)(fsm*); /* Called when we want the lower layer */
benecsj 1:b26ab2467b1a 109 void (*finished)(fsm*); /* Called when we don't want the lower layer */
benecsj 1:b26ab2467b1a 110 void (*protreject)(int); /* Called when Protocol-Reject received */
benecsj 1:b26ab2467b1a 111 void (*retransmit)(fsm*); /* Retransmission is necessary */
benecsj 1:b26ab2467b1a 112 int (*extcode)(fsm*, int, u_char, u_char*, int); /* Called when unknown code received */
benecsj 1:b26ab2467b1a 113 char *proto_name; /* String name for protocol (for messages) */
benecsj 1:b26ab2467b1a 114 } fsm_callbacks;
benecsj 1:b26ab2467b1a 115
benecsj 1:b26ab2467b1a 116
benecsj 1:b26ab2467b1a 117 /*
benecsj 1:b26ab2467b1a 118 * Link states.
benecsj 1:b26ab2467b1a 119 */
benecsj 1:b26ab2467b1a 120 #define LS_INITIAL 0 /* Down, hasn't been opened */
benecsj 1:b26ab2467b1a 121 #define LS_STARTING 1 /* Down, been opened */
benecsj 1:b26ab2467b1a 122 #define LS_CLOSED 2 /* Up, hasn't been opened */
benecsj 1:b26ab2467b1a 123 #define LS_STOPPED 3 /* Open, waiting for down event */
benecsj 1:b26ab2467b1a 124 #define LS_CLOSING 4 /* Terminating the connection, not open */
benecsj 1:b26ab2467b1a 125 #define LS_STOPPING 5 /* Terminating, but open */
benecsj 1:b26ab2467b1a 126 #define LS_REQSENT 6 /* We've sent a Config Request */
benecsj 1:b26ab2467b1a 127 #define LS_ACKRCVD 7 /* We've received a Config Ack */
benecsj 1:b26ab2467b1a 128 #define LS_ACKSENT 8 /* We've sent a Config Ack */
benecsj 1:b26ab2467b1a 129 #define LS_OPENED 9 /* Connection available */
benecsj 1:b26ab2467b1a 130
benecsj 1:b26ab2467b1a 131 /*
benecsj 1:b26ab2467b1a 132 * Flags - indicate options controlling FSM operation
benecsj 1:b26ab2467b1a 133 */
benecsj 1:b26ab2467b1a 134 #define OPT_PASSIVE 1 /* Don't die if we don't get a response */
benecsj 1:b26ab2467b1a 135 #define OPT_RESTART 2 /* Treat 2nd OPEN as DOWN, UP */
benecsj 1:b26ab2467b1a 136 #define OPT_SILENT 4 /* Wait for peer to speak first */
benecsj 1:b26ab2467b1a 137
benecsj 1:b26ab2467b1a 138
benecsj 1:b26ab2467b1a 139 /*
benecsj 1:b26ab2467b1a 140 * Prototypes
benecsj 1:b26ab2467b1a 141 */
benecsj 1:b26ab2467b1a 142 void fsm_init (fsm*);
benecsj 1:b26ab2467b1a 143 void fsm_lowerup (fsm*);
benecsj 1:b26ab2467b1a 144 void fsm_lowerdown (fsm*);
benecsj 1:b26ab2467b1a 145 void fsm_open (fsm*);
benecsj 1:b26ab2467b1a 146 void fsm_close (fsm*, char*);
benecsj 1:b26ab2467b1a 147 void fsm_input (fsm*, u_char*, int);
benecsj 1:b26ab2467b1a 148 void fsm_protreject (fsm*);
benecsj 1:b26ab2467b1a 149 void fsm_sdata (fsm*, u_char, u_char, u_char*, int);
benecsj 1:b26ab2467b1a 150
benecsj 1:b26ab2467b1a 151
benecsj 1:b26ab2467b1a 152 /*
benecsj 1:b26ab2467b1a 153 * Variables
benecsj 1:b26ab2467b1a 154 */
benecsj 1:b26ab2467b1a 155 extern int peer_mru[]; /* currently negotiated peer MRU (per unit) */
benecsj 1:b26ab2467b1a 156
benecsj 1:b26ab2467b1a 157 #endif /* FSM_H */