1c398230bSWarner Losh /*- 2*51369649SPedro F. Giffuni * SPDX-License-Identifier: BSD-3-Clause 3*51369649SPedro F. Giffuni * 4e79adb8eSGarrett Wollman * Copyright (c) 1982, 1986, 1993, 1995 5df8bae1dSRodney W. Grimes * The Regents of the University of California. All rights reserved. 6df8bae1dSRodney W. Grimes * 7df8bae1dSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 8df8bae1dSRodney W. Grimes * modification, are permitted provided that the following conditions 9df8bae1dSRodney W. Grimes * are met: 10df8bae1dSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 11df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 12df8bae1dSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 13df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 14df8bae1dSRodney W. Grimes * documentation and/or other materials provided with the distribution. 15fbbd9655SWarner Losh * 3. Neither the name of the University nor the names of its contributors 16df8bae1dSRodney W. Grimes * may be used to endorse or promote products derived from this software 17df8bae1dSRodney W. Grimes * without specific prior written permission. 18df8bae1dSRodney W. Grimes * 19df8bae1dSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20df8bae1dSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21df8bae1dSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22df8bae1dSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23df8bae1dSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24df8bae1dSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25df8bae1dSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26df8bae1dSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27df8bae1dSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28df8bae1dSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29df8bae1dSRodney W. Grimes * SUCH DAMAGE. 30df8bae1dSRodney W. Grimes * 31e79adb8eSGarrett Wollman * @(#)tcp_seq.h 8.3 (Berkeley) 6/21/95 32c3aac50fSPeter Wemm * $FreeBSD$ 33df8bae1dSRodney W. Grimes */ 34df8bae1dSRodney W. Grimes 35707f139eSPaul Richards #ifndef _NETINET_TCP_SEQ_H_ 36707f139eSPaul Richards #define _NETINET_TCP_SEQ_H_ 37df8bae1dSRodney W. Grimes /* 38df8bae1dSRodney W. Grimes * TCP sequence numbers are 32 bit integers operated 39df8bae1dSRodney W. Grimes * on with modular arithmetic. These macros can be 40df8bae1dSRodney W. Grimes * used to compare such integers. 41df8bae1dSRodney W. Grimes */ 42df8bae1dSRodney W. Grimes #define SEQ_LT(a,b) ((int)((a)-(b)) < 0) 43df8bae1dSRodney W. Grimes #define SEQ_LEQ(a,b) ((int)((a)-(b)) <= 0) 44df8bae1dSRodney W. Grimes #define SEQ_GT(a,b) ((int)((a)-(b)) > 0) 45df8bae1dSRodney W. Grimes #define SEQ_GEQ(a,b) ((int)((a)-(b)) >= 0) 46df8bae1dSRodney W. Grimes 476d90faf3SPaul Saab #define SEQ_MIN(a, b) ((SEQ_LT(a, b)) ? (a) : (b)) 486d90faf3SPaul Saab #define SEQ_MAX(a, b) ((SEQ_GT(a, b)) ? (a) : (b)) 496d90faf3SPaul Saab 50eb6ad696SGarrett Wollman /* for modulo comparisons of timestamps */ 51eb6ad696SGarrett Wollman #define TSTMP_LT(a,b) ((int)((a)-(b)) < 0) 52cf09195bSPaul Saab #define TSTMP_GT(a,b) ((int)((a)-(b)) > 0) 53eb6ad696SGarrett Wollman #define TSTMP_GEQ(a,b) ((int)((a)-(b)) >= 0) 54eb6ad696SGarrett Wollman 55eb6ad696SGarrett Wollman /* 56df8bae1dSRodney W. Grimes * Macros to initialize tcp sequence numbers for 57df8bae1dSRodney W. Grimes * send and receive from initial send and receive 58df8bae1dSRodney W. Grimes * sequence numbers. 59df8bae1dSRodney W. Grimes */ 60df8bae1dSRodney W. Grimes #define tcp_rcvseqinit(tp) \ 61df8bae1dSRodney W. Grimes (tp)->rcv_adv = (tp)->rcv_nxt = (tp)->irs + 1 62df8bae1dSRodney W. Grimes 63df8bae1dSRodney W. Grimes #define tcp_sendseqinit(tp) \ 64df8bae1dSRodney W. Grimes (tp)->snd_una = (tp)->snd_nxt = (tp)->snd_max = (tp)->snd_up = \ 659d11646dSJeffrey Hsu (tp)->snd_recover = (tp)->iss 66df8bae1dSRodney W. Grimes 67d8951c8aSBjoern A. Zeeb #ifdef _KERNEL 68d8951c8aSBjoern A. Zeeb /* 69d8951c8aSBjoern A. Zeeb * Clock macros for RFC 1323 timestamps. 70d8951c8aSBjoern A. Zeeb */ 71d8951c8aSBjoern A. Zeeb #define TCP_TS_TO_TICKS(_t) ((_t) * hz / 1000) 72d8951c8aSBjoern A. Zeeb 73d8951c8aSBjoern A. Zeeb /* Timestamp wrap-around time, 24 days. */ 74d8951c8aSBjoern A. Zeeb #define TCP_PAWS_IDLE (24 * 24 * 60 * 60 * 1000) 75d8951c8aSBjoern A. Zeeb 76d8951c8aSBjoern A. Zeeb /* 77d8951c8aSBjoern A. Zeeb * tcp_ts_getticks() in ms, should be 1ms < x < 1000ms according to RFC 1323. 78d8951c8aSBjoern A. Zeeb * We always use 1ms granularity independent of hz. 79d8951c8aSBjoern A. Zeeb */ 803ac12506SJonathan T. Looney static __inline uint32_t 81d8951c8aSBjoern A. Zeeb tcp_ts_getticks(void) 82d8951c8aSBjoern A. Zeeb { 83d8951c8aSBjoern A. Zeeb struct timeval tv; 84d8951c8aSBjoern A. Zeeb 85d8951c8aSBjoern A. Zeeb /* 86d8951c8aSBjoern A. Zeeb * getmicrouptime() should be good enough for any 1-1000ms granularity. 87d8951c8aSBjoern A. Zeeb * Do not use getmicrotime() here as it might break nfsroot/tcp. 88d8951c8aSBjoern A. Zeeb */ 89d8951c8aSBjoern A. Zeeb getmicrouptime(&tv); 903ac12506SJonathan T. Looney return (tv.tv_sec * 1000 + tv.tv_usec / 1000); 91d8951c8aSBjoern A. Zeeb } 92d8951c8aSBjoern A. Zeeb #endif /* _KERNEL */ 93eb6ad696SGarrett Wollman 94e79adb8eSGarrett Wollman #endif /* _NETINET_TCP_SEQ_H_ */ 95