1df8bae1dSRodney W. Grimes /* 2df8bae1dSRodney W. Grimes * Copyright (c) 1982, 1986, 1993 3df8bae1dSRodney W. Grimes * The Regents of the University of California. All rights reserved. 4df8bae1dSRodney W. Grimes * 5df8bae1dSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 6df8bae1dSRodney W. Grimes * modification, are permitted provided that the following conditions 7df8bae1dSRodney W. Grimes * are met: 8df8bae1dSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 9df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 10df8bae1dSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 11df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 12df8bae1dSRodney W. Grimes * documentation and/or other materials provided with the distribution. 13df8bae1dSRodney W. Grimes * 3. All advertising materials mentioning features or use of this software 14df8bae1dSRodney W. Grimes * must display the following acknowledgement: 15df8bae1dSRodney W. Grimes * This product includes software developed by the University of 16df8bae1dSRodney W. Grimes * California, Berkeley and its contributors. 17df8bae1dSRodney W. Grimes * 4. Neither the name of the University nor the names of its contributors 18df8bae1dSRodney W. Grimes * may be used to endorse or promote products derived from this software 19df8bae1dSRodney W. Grimes * without specific prior written permission. 20df8bae1dSRodney W. Grimes * 21df8bae1dSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22df8bae1dSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23df8bae1dSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24df8bae1dSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25df8bae1dSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26df8bae1dSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27df8bae1dSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28df8bae1dSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29df8bae1dSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30df8bae1dSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31df8bae1dSRodney W. Grimes * SUCH DAMAGE. 32df8bae1dSRodney W. Grimes * 33df8bae1dSRodney W. Grimes * @(#)tcp_fsm.h 8.1 (Berkeley) 6/10/93 34707f139eSPaul Richards * $Id: tcp_fsm.h,v 1.2 1994/08/02 07:48:58 davidg Exp $ 35df8bae1dSRodney W. Grimes */ 36df8bae1dSRodney W. Grimes 37707f139eSPaul Richards #ifndef _NETINET_TCP_FSM_H_ 38707f139eSPaul Richards #define _NETINET_TCP_FSM_H_ 39707f139eSPaul Richards 40df8bae1dSRodney W. Grimes /* 41df8bae1dSRodney W. Grimes * TCP FSM state definitions. 42df8bae1dSRodney W. Grimes * Per RFC793, September, 1981. 43df8bae1dSRodney W. Grimes */ 44df8bae1dSRodney W. Grimes 45df8bae1dSRodney W. Grimes #define TCP_NSTATES 11 46df8bae1dSRodney W. Grimes 47df8bae1dSRodney W. Grimes #define TCPS_CLOSED 0 /* closed */ 48df8bae1dSRodney W. Grimes #define TCPS_LISTEN 1 /* listening for connection */ 49df8bae1dSRodney W. Grimes #define TCPS_SYN_SENT 2 /* active, have sent syn */ 50df8bae1dSRodney W. Grimes #define TCPS_SYN_RECEIVED 3 /* have send and received syn */ 51df8bae1dSRodney W. Grimes /* states < TCPS_ESTABLISHED are those where connections not established */ 52df8bae1dSRodney W. Grimes #define TCPS_ESTABLISHED 4 /* established */ 53df8bae1dSRodney W. Grimes #define TCPS_CLOSE_WAIT 5 /* rcvd fin, waiting for close */ 54df8bae1dSRodney W. Grimes /* states > TCPS_CLOSE_WAIT are those where user has closed */ 55df8bae1dSRodney W. Grimes #define TCPS_FIN_WAIT_1 6 /* have closed, sent fin */ 56df8bae1dSRodney W. Grimes #define TCPS_CLOSING 7 /* closed xchd FIN; await FIN ACK */ 57df8bae1dSRodney W. Grimes #define TCPS_LAST_ACK 8 /* had fin and close; await FIN ACK */ 58df8bae1dSRodney W. Grimes /* states > TCPS_CLOSE_WAIT && < TCPS_FIN_WAIT_2 await ACK of FIN */ 59df8bae1dSRodney W. Grimes #define TCPS_FIN_WAIT_2 9 /* have closed, fin is acked */ 60df8bae1dSRodney W. Grimes #define TCPS_TIME_WAIT 10 /* in 2*msl quiet wait after close */ 61df8bae1dSRodney W. Grimes 62df8bae1dSRodney W. Grimes #define TCPS_HAVERCVDSYN(s) ((s) >= TCPS_SYN_RECEIVED) 63df8bae1dSRodney W. Grimes #define TCPS_HAVERCVDFIN(s) ((s) >= TCPS_TIME_WAIT) 64df8bae1dSRodney W. Grimes 65df8bae1dSRodney W. Grimes #ifdef TCPOUTFLAGS 66df8bae1dSRodney W. Grimes /* 67df8bae1dSRodney W. Grimes * Flags used when sending segments in tcp_output. 68df8bae1dSRodney W. Grimes * Basic flags (TH_RST,TH_ACK,TH_SYN,TH_FIN) are totally 69df8bae1dSRodney W. Grimes * determined by state, with the proviso that TH_FIN is sent only 70df8bae1dSRodney W. Grimes * if all data queued for output is included in the segment. 71df8bae1dSRodney W. Grimes */ 72df8bae1dSRodney W. Grimes u_char tcp_outflags[TCP_NSTATES] = { 73df8bae1dSRodney W. Grimes TH_RST|TH_ACK, 0, TH_SYN, TH_SYN|TH_ACK, 74df8bae1dSRodney W. Grimes TH_ACK, TH_ACK, 75df8bae1dSRodney W. Grimes TH_FIN|TH_ACK, TH_FIN|TH_ACK, TH_FIN|TH_ACK, TH_ACK, TH_ACK, 76df8bae1dSRodney W. Grimes }; 77df8bae1dSRodney W. Grimes #endif 78df8bae1dSRodney W. Grimes 79df8bae1dSRodney W. Grimes #ifdef KPROF 80df8bae1dSRodney W. Grimes int tcp_acounts[TCP_NSTATES][PRU_NREQ]; 81df8bae1dSRodney W. Grimes #endif 82df8bae1dSRodney W. Grimes 83df8bae1dSRodney W. Grimes #ifdef TCPSTATES 84df8bae1dSRodney W. Grimes char *tcpstates[] = { 85df8bae1dSRodney W. Grimes "CLOSED", "LISTEN", "SYN_SENT", "SYN_RCVD", 86df8bae1dSRodney W. Grimes "ESTABLISHED", "CLOSE_WAIT", "FIN_WAIT_1", "CLOSING", 87df8bae1dSRodney W. Grimes "LAST_ACK", "FIN_WAIT_2", "TIME_WAIT", 88df8bae1dSRodney W. Grimes }; 89df8bae1dSRodney W. Grimes #endif 90707f139eSPaul Richards 91707f139eSPaul Richards #endif 92