2
* PROGRAM: JRD Access Method
4
* DESCRIPTION: Que manipulation macros
6
* The contents of this file are subject to the Interbase Public
7
* License Version 1.0 (the "License"); you may not use this file
8
* except in compliance with the License. You may obtain a copy
9
* of the License at http://www.Inprise.com/IPL.html
11
* Software distributed under the License is distributed on an
12
* "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express
13
* or implied. See the License for the specific language governing
14
* rights and limitations under the License.
16
* The Original Code was created by Inprise Corporation
17
* and its predecessors. Portions created by Inprise Corporation are
18
* Copyright (C) Inprise Corporation.
20
* All Rights Reserved.
21
* Contributor(s): ______________________________________.
27
#define QUE_INIT(que) {\
28
(que).que_backward = &(que);\
29
(que).que_forward = &(que);}
32
#define QUE_DELETE(node) {\
33
(node).que_backward->que_forward = (node).que_forward;\
34
(node).que_forward->que_backward = (node).que_backward;}
36
/* QUE_INSERT adds node to queue head. */
38
#define QUE_INSERT(que, node) {\
39
(node).que_forward = (que).que_forward;\
40
(node).que_backward = &(que);\
41
(que).que_forward->que_backward = &(node);\
42
(que).que_forward = &(node);}
44
/* QUE_APPEND adds node to queue tail. */
46
#define QUE_APPEND(que, node) {\
47
(node).que_forward = &(que);\
48
(node).que_backward = (que).que_backward;\
49
(que).que_backward->que_forward = &(node);\
50
(que).que_backward = &(node);}
52
/* QUE_LOOP to visit every node. */
54
#define QUE_LOOP(que, node) {\
55
for (node = (que).que_forward; node != &(que); node = (node)->que_forward)
57
#define QUE_LOOPA(que, node) {\
58
for (node = (que)->que_forward; node != que; node = (node)->que_forward)
60
#define QUE_NOT_EMPTY(que) ((que).que_forward != &(que))
61
#define QUE_EMPTY(que) ((que).que_forward == &(que))
63
#define QUE_MOST_RECENTLY_USED(in_use_que) {\
64
QUE_DELETE (in_use_que);\
65
QUE_INSERT (bcb->bcb_in_use, in_use_que);}
67
#define QUE_LEAST_RECENTLY_USED(in_use_que) {\
68
QUE_DELETE (in_use_que);\
69
QUE_APPEND (bcb->bcb_in_use, in_use_que);}
72
// general purpose queue
77
struct que* que_forward;
78
struct que* que_backward;
84
// Self-relative queue BASE should be defined in the source which includes this
87
#define SRQ_REL_PTR(item) (SRQ_PTR) ((UCHAR*) item - SRQ_BASE)
88
#define SRQ_ABS_PTR(item) (SRQ_BASE + item)
90
#define SRQ_INIT(que) {que.srq_forward = que.srq_backward = SRQ_REL_PTR (&que);}
91
#define SRQ_EMPTY(que) (que.srq_forward == SRQ_REL_PTR (&que))
92
#define SRQ_NEXT(que) (srq*) SRQ_ABS_PTR (que.srq_forward)
93
#define SRQ_PREV(que) (srq*) SRQ_ABS_PTR (que.srq_backward)
95
#define SRQ_LOOP(header, que) for (que = SRQ_NEXT (header);\
96
que != &header; que = SRQ_NEXT ((*que)))
97
#define SRQ_LOOP_BACK(header, que) for (que = SRQ_PREV (header);\
98
que != &header; que = SRQ_PREV ((*que)))
100
/* Self-relative que block. Offsets are from the block itself. */
103
SRQ_PTR srq_forward; /* Forward offset */
104
SRQ_PTR srq_backward; /* Backward offset */
110
#endif /* JRD_QUE_H */