1 /*
2 *
3 * Coda: an Experimental Distributed File System
4 * Release 3.1
5 *
6 * Copyright (c) 1987-1998 Carnegie Mellon University
7 * All Rights Reserved
8 *
9 * Permission to use, copy, modify and distribute this software and its
10 * documentation is hereby granted, provided that both the copyright
11 * notice and this permission notice appear in all copies of the
12 * software, derivative works or modified versions, and any portions
13 * thereof, and that both notices appear in supporting documentation, and
14 * that credit is given to Carnegie Mellon University in all documents
15 * and publicity pertaining to direct or indirect use of this code or its
16 * derivatives.
17 *
18 * CODA IS AN EXPERIMENTAL SOFTWARE SYSTEM AND IS KNOWN TO HAVE BUGS,
19 * SOME OF WHICH MAY HAVE SERIOUS CONSEQUENCES. CARNEGIE MELLON ALLOWS
20 * FREE USE OF THIS SOFTWARE IN ITS "AS IS" CONDITION. CARNEGIE MELLON
21 * DISCLAIMS ANY LIABILITY OF ANY KIND FOR ANY DAMAGES WHATSOEVER
22 * RESULTING DIRECTLY OR INDIRECTLY FROM THE USE OF THIS SOFTWARE OR OF
23 * ANY DERIVATIVE WORK.
24 *
25 * Carnegie Mellon encourages users of this software to return any
26 * improvements or extensions that they make, and to grant Carnegie
27 * Mellon the rights to redistribute these changes without encumbrance.
28 *
29 * @(#) src/sys/coda/coda_kernel.h,v 1.1.1.1 1998/08/29 21:14:52 rvb Exp $
30 * $FreeBSD: releng/5.1/sys/coda/coda_kernel.h 50477 1999-08-28 01:08:13Z peter $
31 *
32 */
33
34 /* Macros to manipulate the queue */
35 #ifndef INIT_QUEUE
36 struct queue {
37 struct queue *forw, *back;
38 };
39
40 #define INIT_QUEUE(head) \
41 do { \
42 (head).forw = (struct queue *)&(head); \
43 (head).back = (struct queue *)&(head); \
44 } while (0)
45
46 #define GETNEXT(head) (head).forw
47
48 #define EMPTY(head) ((head).forw == &(head))
49
50 #define EOQ(el, head) ((struct queue *)(el) == (struct queue *)&(head))
51
52 #define INSQUE(el, head) \
53 do { \
54 (el).forw = ((head).back)->forw; \
55 (el).back = (head).back; \
56 ((head).back)->forw = (struct queue *)&(el); \
57 (head).back = (struct queue *)&(el); \
58 } while (0)
59
60 #define REMQUE(el) \
61 do { \
62 ((el).forw)->back = (el).back; \
63 (el).back->forw = (el).forw; \
64 } while (0)
65
66 #endif
Cache object: d9ea79675dc18dc919ad850054940862
|