19 #define izque(type,member,item) do { \  argument
21 	((type *)QUEUE)->member.prev = (type *)QUEUE; \
22 	((type *)QUEUE)->member.next = (type *)QUEUE; \
25 #define deque(type,member,item) do { \  argument
27 	((type *)ITEM)->member.prev->member.next = ((type *)ITEM)->member.next; \
28 	((type *)ITEM)->member.next->member.prev = ((type *)ITEM)->member.prev; \
31 #define deque_f(type,member,item) \  argument
34 	((type *)ITEM)->member.prev->member.next=((type *)ITEM)->member.next, \
35 	((type *)ITEM)->member.next->member.prev=((type *)ITEM)->member.prev, \
39 #define qempty(type,member,item) \  argument
42 	(type *)QUEUE==((type *)QUEUE)->member.next \
45 #define enquef(type,member,queue,item) do { \  argument
48 	((type *)ITEM)->member.next = ((type *)QUEUE)->member.next; \
49 	((type *)ITEM)->member.prev = (type *)QUEUE; \
50 	((type *)QUEUE)->member.next->member.prev = (type *)ITEM; \
51 	((type *)QUEUE)->member.next = (type *)ITEM; \
54 #define enqueb(type,member,queue,item) do { \  argument
57 	((type *)ITEM)->member.next = (type *)QUEUE; \
58 	((type *)ITEM)->member.prev = ((type *)QUEUE)->member.prev; \
59 	((type *)QUEUE)->member.prev->member.next = (type *)ITEM; \
60 	((type *)QUEUE)->member.prev = (type *)ITEM; \
63 #define enqueb_f(type,member,queue,item) \  argument
67 	((type *)ITEM)->member.next=(type *)QUEUE, \
68 	((type *)ITEM)->member.prev=((type *)QUEUE)->member.prev, \
69 	((type *)QUEUE)->member.prev->member.next=(type *)ITEM, \
70 	((type *)QUEUE)->member.prev=(type *)ITEM, \
74 #define promote(type,member,queue,item) \  argument
75 	enquef(type,member,(queue),deque_f(type,member,(item)))
77 #define demote(type,member,queue,item) \  argument
78 	enqueb(type,member,(queue),deque_f(type,member,(item)))
80 #define splicef(type,member,queue,chain) do { \  argument
82 	LAST = (void *)((type *)ITEM)->member.prev; \
84 	((type *)LAST)->member.next = ((type *)QUEUE)->member.next; \
85 	((type *)ITEM)->member.prev = (type *)QUEUE; \
86 	((type *)QUEUE)->member.next->member.prev = (type *)LAST; \
87 	((type *)QUEUE)->member.next = (type *)ITEM; \
90 #define spliceb(type,member,queue,chain) do { \  argument
92 	LAST = (void *)((type *)ITEM)->member.prev; \
94 	((type *)LAST)->member.next = (type *)QUEUE; \
95 	((type *)ITEM)->member.prev = ((type *)QUEUE)->member.prev; \
96 	((type *)QUEUE)->member.prev->member.next = (type *)ITEM; \
97 	((type *)QUEUE)->member.prev = (type *)LAST; \
100 #define spliceb_f(type,member,queue,chain) \  argument
103 	LAST=(void *)((type *)ITEM)->member.prev, \
105 	((type *)LAST)->member.next=(type *)QUEUE, \
106 	((type *)ITEM)->member.prev=((type *)QUEUE)->member.prev, \
107 	((type *)QUEUE)->member.prev->member.next=(type *)ITEM, \
108 	((type *)QUEUE)->member.prev=(type *)LAST, \
112 #define snip(type,member,first,last) \  argument
116 	((type *)LAST)->member.next->member.prev=((type *)ITEM)->member.prev, \
117 	((type *)ITEM)->member.prev->member.next=((type *)LAST)->member.next, \
118 	((type *)ITEM)->member.prev=(type *)LAST, \
119 	((type *)LAST)->member.next=(type *)ITEM, \