| tcp_seq.h (1817) | tcp_seq.h (2169) |
|---|---|
| 1/* 2 * Copyright (c) 1982, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 17 unchanged lines hidden (view full) --- 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)tcp_seq.h 8.1 (Berkeley) 6/10/93 | 1/* 2 * Copyright (c) 1982, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 17 unchanged lines hidden (view full) --- 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)tcp_seq.h 8.1 (Berkeley) 6/10/93 |
| 34 * $Id$ | 34 * $Id: tcp_seq.h,v 1.2 1994/08/02 07:49:06 davidg Exp $ |
| 35 */ 36 | 35 */ 36 |
| 37#ifndef _NETINET_TCP_SEQ_H_ 38#define _NETINET_TCP_SEQ_H_ |
|
| 37/* 38 * TCP sequence numbers are 32 bit integers operated 39 * on with modular arithmetic. These macros can be 40 * used to compare such integers. 41 */ 42#define SEQ_LT(a,b) ((int)((a)-(b)) < 0) 43#define SEQ_LEQ(a,b) ((int)((a)-(b)) <= 0) 44#define SEQ_GT(a,b) ((int)((a)-(b)) > 0) --- 11 unchanged lines hidden (view full) --- 56 (tp)->snd_una = (tp)->snd_nxt = (tp)->snd_max = (tp)->snd_up = \ 57 (tp)->iss 58 59#define TCP_ISSINCR (125*1024) /* increment for tcp_iss each second */ 60 61#ifdef KERNEL 62tcp_seq tcp_iss; /* tcp initial send seq # */ 63#endif | 39/* 40 * TCP sequence numbers are 32 bit integers operated 41 * on with modular arithmetic. These macros can be 42 * used to compare such integers. 43 */ 44#define SEQ_LT(a,b) ((int)((a)-(b)) < 0) 45#define SEQ_LEQ(a,b) ((int)((a)-(b)) <= 0) 46#define SEQ_GT(a,b) ((int)((a)-(b)) > 0) --- 11 unchanged lines hidden (view full) --- 58 (tp)->snd_una = (tp)->snd_nxt = (tp)->snd_max = (tp)->snd_up = \ 59 (tp)->iss 60 61#define TCP_ISSINCR (125*1024) /* increment for tcp_iss each second */ 62 63#ifdef KERNEL 64tcp_seq tcp_iss; /* tcp initial send seq # */ 65#endif |
| 66#endif |
|