![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to tp_seq.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / netiso|
Return to tp_seq.h CVS log | Up to [Net/2] / Net2 / netiso |
1.1 root 1: /*-
2: * Copyright (c) 1991 The Regents of the University of California.
3: * 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
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
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: * @(#)tp_seq.h 7.5 (Berkeley) 5/6/91
34: */
35:
36: /***********************************************************
37: Copyright IBM Corporation 1987
38:
39: All Rights Reserved
40:
41: Permission to use, copy, modify, and distribute this software and its
42: documentation for any purpose and without fee is hereby granted,
43: provided that the above copyright notice appear in all copies and that
44: both that copyright notice and this permission notice appear in
45: supporting documentation, and that the name of IBM not be
46: used in advertising or publicity pertaining to distribution of the
47: software without specific, written prior permission.
48:
49: IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
50: ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
51: IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
52: ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
53: WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
54: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
55: SOFTWARE.
56:
57: ******************************************************************/
58:
59: /*
60: * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
61: */
62: /*
63: * ARGO TP
64: *
65: * $Header: tp_seq.h,v 5.1 88/10/12 12:20:59 root Exp $
66: * $Source: /usr/argo/sys/netiso/RCS/tp_seq.h,v $
67: *
68: * These macros perform sequence number arithmetic modulo (2**7 or 2**31).
69: * The relevant fields in the tpcb are:
70: * tp_seqmask : the mask of bits that define the sequence space.
71: * tp_seqbit : 1 + tp_seqmask
72: * tp_seqhalf : tp_seqbit / 2 or half the sequence space (rounded up)
73: * Not exactly fast, but at least it's maintainable.
74: */
75:
76: #ifndef __TP_SEQ__
77: #define __TP_SEQ__
78:
79: #define SEQ(tpcb,x) \
80: ((x) & (tpcb)->tp_seqmask)
81:
82: #define SEQ_GT(tpcb, seq, operand ) \
83: ( ((int)((seq)-(operand)) > 0)\
84: ? ((int)((seq)-(operand)) < (int)(tpcb)->tp_seqhalf)\
85: : !(-((int)(seq)-(operand)) < (int)(tpcb)->tp_seqhalf))
86:
87: #define SEQ_GEQ(tpcb, seq, operand ) \
88: ( ((int)((seq)-(operand)) >= 0)\
89: ? ((int)((seq)-(operand)) < (int)(tpcb)->tp_seqhalf)\
90: : !((-((int)(seq)-(operand))) < (int)(tpcb)->tp_seqhalf))
91:
92: #define SEQ_LEQ(tpcb, seq, operand ) \
93: ( ((int)((seq)-(operand)) <= 0)\
94: ? ((-(int)((seq)-(operand))) < (int)(tpcb)->tp_seqhalf)\
95: : !(((int)(seq)-(operand)) < (int)(tpcb)->tp_seqhalf))
96:
97: #define SEQ_LT(tpcb, seq, operand ) \
98: ( ((int)((seq)-(operand)) < 0)\
99: ? ((-(int)((seq)-(operand))) < (int)(tpcb)->tp_seqhalf)\
100: : !(((int)(seq)-(operand)) < (int)(tpcb)->tp_seqhalf))
101:
102: #define SEQ_MIN(tpcb, a, b) ( SEQ_GT(tpcb, a, b) ? b : a)
103:
104: #define SEQ_MAX(tpcb, a, b) ( SEQ_GT(tpcb, a, b) ? a : b)
105:
106: #define SEQ_INC(tpcb, Seq) ((++Seq), ((Seq) &= (tpcb)->tp_seqmask))
107:
108: #define SEQ_DEC(tpcb, Seq)\
109: ((Seq) = (((Seq)+(unsigned)((int)(tpcb)->tp_seqbit - 1))&(tpcb)->tp_seqmask))
110:
111: /* (amt) had better be less than the seq bit ! */
112:
113: #define SEQ_SUB(tpcb, Seq, amt)\
114: (((Seq) + (unsigned)((int)(tpcb)->tp_seqbit - amt)) & (tpcb)->tp_seqmask)
115: #define SEQ_ADD(tpcb, Seq, amt) (((Seq) + (unsigned)amt) & (tpcb)->tp_seqmask)
116:
117:
118: #define IN_RWINDOW(tpcb, seq, lwe, uwe)\
119: ( SEQ_GEQ(tpcb, seq, lwe) && SEQ_LT(tpcb, seq, uwe) )
120:
121: #define IN_SWINDOW(tpcb, seq, lwe, uwe)\
122: ( SEQ_GT(tpcb, seq, lwe) && SEQ_LEQ(tpcb, seq, uwe) )
123:
124: #endif __TP_SEQ__
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.