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_seq.h 8.1 (Berkeley) 6/10/93 34eb6ad696SGarrett Wollman * $Id: tcp_seq.h,v 1.3 1994/08/21 05:27:37 paul Exp $ 35df8bae1dSRodney W. Grimes */ 36df8bae1dSRodney W. Grimes 37707f139eSPaul Richards #ifndef _NETINET_TCP_SEQ_H_ 38707f139eSPaul Richards #define _NETINET_TCP_SEQ_H_ 39df8bae1dSRodney W. Grimes /* 40df8bae1dSRodney W. Grimes * TCP sequence numbers are 32 bit integers operated 41df8bae1dSRodney W. Grimes * on with modular arithmetic. These macros can be 42df8bae1dSRodney W. Grimes * used to compare such integers. 43df8bae1dSRodney W. Grimes */ 44df8bae1dSRodney W. Grimes #define SEQ_LT(a,b) ((int)((a)-(b)) < 0) 45df8bae1dSRodney W. Grimes #define SEQ_LEQ(a,b) ((int)((a)-(b)) <= 0) 46df8bae1dSRodney W. Grimes #define SEQ_GT(a,b) ((int)((a)-(b)) > 0) 47df8bae1dSRodney W. Grimes #define SEQ_GEQ(a,b) ((int)((a)-(b)) >= 0) 48df8bae1dSRodney W. Grimes 49eb6ad696SGarrett Wollman /* for modulo comparisons of timestamps */ 50eb6ad696SGarrett Wollman #define TSTMP_LT(a,b) ((int)((a)-(b)) < 0) 51eb6ad696SGarrett Wollman #define TSTMP_GEQ(a,b) ((int)((a)-(b)) >= 0) 52eb6ad696SGarrett Wollman 53eb6ad696SGarrett Wollman #ifdef TTCP 54eb6ad696SGarrett Wollman /* 55eb6ad696SGarrett Wollman * TCP connection counts are 32 bit integers operated 56eb6ad696SGarrett Wollman * on with modular arithmetic. These macros can be 57eb6ad696SGarrett Wollman * used to compare such integers. 58eb6ad696SGarrett Wollman */ 59eb6ad696SGarrett Wollman #define CC_LT(a,b) ((int)((a)-(b)) < 0) 60eb6ad696SGarrett Wollman #define CC_LEQ(a,b) ((int)((a)-(b)) <= 0) 61eb6ad696SGarrett Wollman #define CC_GT(a,b) ((int)((a)-(b)) > 0) 62eb6ad696SGarrett Wollman #define CC_GEQ(a,b) ((int)((a)-(b)) >= 0) 63eb6ad696SGarrett Wollman 64eb6ad696SGarrett Wollman /* Macro to increment a CC: skip 0 which has a special meaning */ 65eb6ad696SGarrett Wollman #define CC_INC(c) (++(c) == 0 ? ++(c) : (c)) 66eb6ad696SGarrett Wollman #endif 67eb6ad696SGarrett Wollman 68df8bae1dSRodney W. Grimes /* 69df8bae1dSRodney W. Grimes * Macros to initialize tcp sequence numbers for 70df8bae1dSRodney W. Grimes * send and receive from initial send and receive 71df8bae1dSRodney W. Grimes * sequence numbers. 72df8bae1dSRodney W. Grimes */ 73df8bae1dSRodney W. Grimes #define tcp_rcvseqinit(tp) \ 74df8bae1dSRodney W. Grimes (tp)->rcv_adv = (tp)->rcv_nxt = (tp)->irs + 1 75df8bae1dSRodney W. Grimes 76df8bae1dSRodney W. Grimes #define tcp_sendseqinit(tp) \ 77df8bae1dSRodney W. Grimes (tp)->snd_una = (tp)->snd_nxt = (tp)->snd_max = (tp)->snd_up = \ 78df8bae1dSRodney W. Grimes (tp)->iss 79df8bae1dSRodney W. Grimes 80df8bae1dSRodney W. Grimes #define TCP_ISSINCR (125*1024) /* increment for tcp_iss each second */ 81df8bae1dSRodney W. Grimes 82eb6ad696SGarrett Wollman #define TCP_PAWS_IDLE (24 * 24 * 60 * 60 * PR_SLOWHZ) 83eb6ad696SGarrett Wollman /* timestamp wrap-around time */ 84eb6ad696SGarrett Wollman 85df8bae1dSRodney W. Grimes #ifdef KERNEL 86df8bae1dSRodney W. Grimes tcp_seq tcp_iss; /* tcp initial send seq # */ 87eb6ad696SGarrett Wollman #ifdef TTCP 88eb6ad696SGarrett Wollman tcp_cc tcp_ccgen; /* global connection count */ 89eb6ad696SGarrett Wollman #endif 90df8bae1dSRodney W. Grimes #endif 91707f139eSPaul Richards #endif 92