Commit | Line | Data |
---|---|---|
15637ed4 RG |
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 | * | |
43371f85 | 33 | * from: @(#)tp_seq.h 7.5 (Berkeley) 5/6/91 |
8ace4366 | 34 | * $Id: tp_seq.h,v 1.2 1993/10/16 21:05:58 rgrimes Exp $ |
15637ed4 RG |
35 | */ |
36 | ||
37 | /*********************************************************** | |
38 | Copyright IBM Corporation 1987 | |
39 | ||
40 | All Rights Reserved | |
41 | ||
42 | Permission to use, copy, modify, and distribute this software and its | |
43 | documentation for any purpose and without fee is hereby granted, | |
44 | provided that the above copyright notice appear in all copies and that | |
45 | both that copyright notice and this permission notice appear in | |
46 | supporting documentation, and that the name of IBM not be | |
47 | used in advertising or publicity pertaining to distribution of the | |
48 | software without specific, written prior permission. | |
49 | ||
50 | IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING | |
51 | ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL | |
52 | IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR | |
53 | ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, | |
54 | WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, | |
55 | ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS | |
56 | SOFTWARE. | |
57 | ||
58 | ******************************************************************/ | |
59 | ||
60 | /* | |
61 | * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison | |
62 | */ | |
43371f85 | 63 | |
15637ed4 RG |
64 | /* |
65 | * ARGO TP | |
66 | * | |
15637ed4 RG |
67 | * These macros perform sequence number arithmetic modulo (2**7 or 2**31). |
68 | * The relevant fields in the tpcb are: | |
69 | * tp_seqmask : the mask of bits that define the sequence space. | |
70 | * tp_seqbit : 1 + tp_seqmask | |
71 | * tp_seqhalf : tp_seqbit / 2 or half the sequence space (rounded up) | |
72 | * Not exactly fast, but at least it's maintainable. | |
73 | */ | |
74 | ||
75 | #ifndef __TP_SEQ__ | |
76 | #define __TP_SEQ__ | |
77 | ||
78 | #define SEQ(tpcb,x) \ | |
79 | ((x) & (tpcb)->tp_seqmask) | |
80 | ||
81 | #define SEQ_GT(tpcb, seq, operand ) \ | |
82 | ( ((int)((seq)-(operand)) > 0)\ | |
83 | ? ((int)((seq)-(operand)) < (int)(tpcb)->tp_seqhalf)\ | |
84 | : !(-((int)(seq)-(operand)) < (int)(tpcb)->tp_seqhalf)) | |
85 | ||
86 | #define SEQ_GEQ(tpcb, seq, operand ) \ | |
87 | ( ((int)((seq)-(operand)) >= 0)\ | |
88 | ? ((int)((seq)-(operand)) < (int)(tpcb)->tp_seqhalf)\ | |
89 | : !((-((int)(seq)-(operand))) < (int)(tpcb)->tp_seqhalf)) | |
90 | ||
91 | #define SEQ_LEQ(tpcb, seq, operand ) \ | |
92 | ( ((int)((seq)-(operand)) <= 0)\ | |
93 | ? ((-(int)((seq)-(operand))) < (int)(tpcb)->tp_seqhalf)\ | |
94 | : !(((int)(seq)-(operand)) < (int)(tpcb)->tp_seqhalf)) | |
95 | ||
96 | #define SEQ_LT(tpcb, seq, operand ) \ | |
97 | ( ((int)((seq)-(operand)) < 0)\ | |
98 | ? ((-(int)((seq)-(operand))) < (int)(tpcb)->tp_seqhalf)\ | |
99 | : !(((int)(seq)-(operand)) < (int)(tpcb)->tp_seqhalf)) | |
100 | ||
101 | #define SEQ_MIN(tpcb, a, b) ( SEQ_GT(tpcb, a, b) ? b : a) | |
102 | ||
103 | #define SEQ_MAX(tpcb, a, b) ( SEQ_GT(tpcb, a, b) ? a : b) | |
104 | ||
105 | #define SEQ_INC(tpcb, Seq) ((++Seq), ((Seq) &= (tpcb)->tp_seqmask)) | |
106 | ||
107 | #define SEQ_DEC(tpcb, Seq)\ | |
108 | ((Seq) = (((Seq)+(unsigned)((int)(tpcb)->tp_seqbit - 1))&(tpcb)->tp_seqmask)) | |
109 | ||
110 | /* (amt) had better be less than the seq bit ! */ | |
111 | ||
112 | #define SEQ_SUB(tpcb, Seq, amt)\ | |
113 | (((Seq) + (unsigned)((int)(tpcb)->tp_seqbit - amt)) & (tpcb)->tp_seqmask) | |
114 | #define SEQ_ADD(tpcb, Seq, amt) (((Seq) + (unsigned)amt) & (tpcb)->tp_seqmask) | |
115 | ||
116 | ||
117 | #define IN_RWINDOW(tpcb, seq, lwe, uwe)\ | |
118 | ( SEQ_GEQ(tpcb, seq, lwe) && SEQ_LT(tpcb, seq, uwe) ) | |
119 | ||
120 | #define IN_SWINDOW(tpcb, seq, lwe, uwe)\ | |
121 | ( SEQ_GT(tpcb, seq, lwe) && SEQ_LEQ(tpcb, seq, uwe) ) | |
122 | ||
8ace4366 | 123 | #endif /* __TP_SEQ__ */ |