1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
/*
*
* ===================================
* HARP | Host ATM Research Platform
* ===================================
*
*
* This Host ATM Research Platform ("HARP") file (the "Software") is
* made available by Network Computing Services, Inc. ("NetworkCS")
* "AS IS". NetworkCS does not provide maintenance, improvements or
* support of any kind.
*
* NETWORKCS MAKES NO WARRANTIES OR REPRESENTATIONS, EXPRESS OR IMPLIED,
* INCLUDING, BUT NOT LIMITED TO, IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE, AS TO ANY ELEMENT OF THE
* SOFTWARE OR ANY SUPPORT PROVIDED IN CONNECTION WITH THIS SOFTWARE.
* In no event shall NetworkCS be responsible for any damages, including
* but not limited to consequential damages, arising from or relating to
* any use of the Software or related support.
*
* Copyright 1994-1998 Network Computing Services, Inc.
*
* Copies of this Software may be made, however, the above copyright
* notice must be reproduced on all copies.
*
* @(#) $FreeBSD$
*
*/
/*
* Core ATM Services
* -----------------
*
* General queueing/linking definitions
*
*/
#ifndef _NETATM_QUEUE_H
#define _NETATM_QUEUE_H
/*
* Structure defining the queue controls for a doubly linked queue
*/
struct q_queue {
caddr_t q_head; /* Head of queue */
caddr_t q_tail; /* Tail of queue */
};
typedef struct q_queue Queue_t;
/*
* Structure defining the queue elements of a doubly linked queue
*/
struct q_elem {
caddr_t q_forw; /* Forward link */
caddr_t q_back; /* Backward link */
};
typedef struct q_elem Qelem_t;
/*
* Macro to add a control block onto the tail of a doubly linked queue
* e = control block to add
* t = control block structure type
* el = name of control block's q_elem field
* q = pointer to queue controls
*/
#define ENQUEUE(e,t,el,q) \
{ \
(e)->el.q_forw = NULL; \
(e)->el.q_back = (q).q_tail; \
if ((q).q_head == NULL) { \
(q).q_head = (caddr_t)(e); \
(q).q_tail = (caddr_t)(e); \
} else { \
((t *)(q).q_tail)->el.q_forw = (caddr_t)(e); \
(q).q_tail = (caddr_t)(e); \
} \
}
/*
* Macro to remove a control block from a doubly linked queue
* e = control block to remove
* t = control block structure type
* el = name of control block's q_elem field
* q = pointer to queue controls
*/
#define DEQUEUE(e,t,el,q) \
{ \
/* Ensure control block is on queue */ \
if ((e)->el.q_forw || (q).q_tail == (caddr_t)(e)) { \
if ((e)->el.q_forw) \
((t *)(e)->el.q_forw)->el.q_back = (e)->el.q_back;\
else \
(q).q_tail = (e)->el.q_back; \
if ((e)->el.q_back) \
((t *)(e)->el.q_back)->el.q_forw = (e)->el.q_forw;\
else \
(q).q_head = (e)->el.q_forw; \
} \
(e)->el.q_back = (e)->el.q_forw = NULL; \
}
/*
* Macro to return the head of a doubly linked queue
* q = pointer to queue controls
* t = control block structure type
*/
#define Q_HEAD(q,t) ((t *)(q).q_head)
/*
* Macro to return the next control block of a doubly linked queue
* e = current control block
* t = control block structure type
* el = name of control block's q_elem field
*/
#define Q_NEXT(e,t,el) ((t *)(e)->el.q_forw)
/*
* Macro to add a control block onto the head of a singly linked chain
* u = control block to add
* t = structure type
* h = head of chain
* l = name of link field
*/
#define LINK2HEAD(u,t,h,l) \
{ \
(u)->l = (h); \
(h) = (u); \
}
/*
* Macro to add a control block onto the tail of a singly linked chain
* u = control block to add
* t = structure type
* h = head of chain
* l = name of link field
*/
#define LINK2TAIL(u,t,h,l) \
{ \
(u)->l = (t *)NULL; \
/* Check for empty chain */ \
if ((h) == (t *)NULL) { \
(h) = (u); \
} else { \
t *tp; \
/* Loop until we find the end of chain */ \
for (tp = (h); tp->l != (t *)NULL; tp = tp->l) \
; \
tp->l = (u); \
} \
}
/*
* Macro to remove a control block from a singly linked chain
* u = control block to unlink
* t = structure type
* h = head of chain
* l = name of link field
*/
#define UNLINK(u,t,h,l) \
{ \
/* Check for control block at head of chain */ \
if ((u) == (h)) { \
(h) = (u)->l; \
} else { \
t *tp; \
/* Loop until we find the control block */ \
for (tp = (h); tp != (t *)NULL; tp = tp->l) { \
if (tp->l == (u)) \
break; \
} \
if (tp) { \
/* Remove it from chain */ \
tp->l = (u)->l; \
} \
} \
(u)->l = (t *)NULL; \
}
/*
* Macro to remove a control block from a singly linked chain and return
* an indication of whether the block was found
* u = control block to unlink
* t = structure type
* h = head of chain
* l = name of link field
* f = flag; 1 => control block found on chain; else 0
*/
#define UNLINKF(u,t,h,l,f) \
{ \
/* Check for control block at head of chain */ \
if ((u) == (h)) { \
(h) = (u)->l; \
(f) = 1; \
} else { \
t *tp; \
/* Loop until we find the control block */ \
for (tp = (h); tp != (t *)NULL; tp = tp->l) { \
if (tp->l == (u)) \
break; \
} \
if (tp) { \
/* Remove it from chain */ \
tp->l = (u)->l; \
(f) = 1; \
} else \
/* It wasn't on the chain */ \
(f) = 0; \
} \
(u)->l = (t *)NULL; \
}
#endif /* _NETATM_QUEUE_H */
|
