2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief double ended queue of generic pointers.
23 * @author Christian von Roques
26 #ifndef FIRM_ADT_PDEQ_H
27 #define FIRM_ADT_PDEQ_H
30 * The type of the pointer compare function.
32 * @param elem The list element.
33 * @param key The user supplied key.
35 * @return 0 if the element matches the key, non-zero else.
37 typedef int (*cmp_fun)(const void *elem, const void *key);
40 * The pointer double ended queue (list).
42 typedef struct pdeq pdeq;
45 * Creates a new double ended pointer list.
52 * Creates a new double ended pointer list and puts an initial pointer element in.
54 * @param x The pointer element to put in.
56 * @return The new list.
58 pdeq *new_pdeq1(const void *x);
61 * Delete a double ended pointer list.
63 * @param dq The list to be deleted.
65 void del_pdeq(pdeq *dq);
68 * Returns the lenght of a double ended pointer list.
72 int pdeq_len(pdeq *dq);
75 * Checks if a list is empty.
79 * @return non-zero if the list is empty.
81 int pdeq_empty(pdeq *dq);
84 * Returns non-zero if a double ended pointer list
85 * contains a pointer x.
88 * @param x The pointer to be searched for.
90 int pdeq_contains(pdeq *dq, const void *x);
93 * Search a key in a double ended pointer list, the search
94 * is controlled by a compare function.
95 * An element is found, if the compare function returns 0.
96 * The search is started from the left site of the list.
99 * @param cmp The compare function.
100 * @param key The search key.
102 * @return The address of the element entry if the key was found,
105 void *pdeq_search(pdeq *qp, cmp_fun cmp, const void *key);
108 * Convert the double ended pointer list into a linear array beginning from
109 * left, the first element in the linear array will be the left one.
111 * @param qp The list.
112 * @param dst A pointer to a pointer array with must be at least
113 * pdeq_len(dq) * sizeof(void *)
117 void **pdeq_copyl(pdeq *qp, const void **dst);
120 * Convert the double ended pointer list into a linear array beginning from
121 * right, the first element in the linear array will be the right one.
123 * @param qp The list.
124 * @param dst A pointer to a pointer array with must be at least
125 * pdeq_len(dq) * sizeof(void *)
129 void **pdeq_copyr(pdeq *qp, const void **dst);
132 * Add a pointer to the left side of a double ended pointer list.
134 * @param dq The list to add a pointer to.
135 * @param x The pointer element to be added
139 pdeq *pdeq_putl(pdeq *dq, const void *x);
142 * Add a pointer to the right side of a double ended pointer list.
144 * @param dq The list to add a pointer to.
145 * @param x The pointer element to be added
149 pdeq *pdeq_putr(pdeq *dq, const void *x);
152 * Retrieve a pointer from the left site of a double ended pointer list.
156 * @return The pointer element.
158 * @remark This function will fail if the list is empty.
160 void *pdeq_getl(pdeq *dq);
163 * Retrieve a pointer from the right site of a double ended pointer list.
167 * @return The pointer element.
169 * @remark This function will fail if the list is empty.
171 void *pdeq_getr(pdeq *dq);
174 #define PDEQ_VRFY(deq) ((void)0)
176 #define PDEQ_VRFY(deq) _pdeq_vrfy ((deq))
177 void _pdeq_vrfy(pdeq *dq);
181 * The pdeq is often used as a wait queue. A helper
182 * type to support this.
187 * Creates a new pointer wait queue (fifo).
189 * @return A new queue.
191 #define new_waitq() new_pdeq()
194 * Delete a wait queue (fifo)
196 * @param wq The wait queue.
198 #define del_waitq(wq) del_pdeq(wq)
201 * Retrieve a pointer from the wait queue (fifo).
203 * @param wq The wait queue.
205 * @return The pointer element.
207 * @remark This function will fail if the queue is empty.
209 #define waitq_get(wq) pdeq_getl(wq)
212 * Add a pointer to the wait queue (fifo).
214 * @param wq The wait queue
215 * @param x The pointer element to be added
217 * @return The wait queue.
219 #define waitq_put(wq, x) pdeq_putr((wq), (x))
222 * Checks if a wait queue is empty.
224 * @param wq The wait queue.
226 * @return non-zero if the queue is empty.
228 #define waitq_empty(wq) pdeq_empty(wq)
231 * The pdeq can be used as a stack. A helper
232 * type to support this.
237 * Creates a new pointer stack (lifo).
239 * @return A new stack.
241 #define new_stack() new_pdeq()
244 * Pop a pointer from the stack (lifo).
246 * @param st The stack.
248 * @return The pointer element.
250 * @remark This function will fail if the stack is empty.
252 #define stack_pop(st) pdeq_getr(st)
255 * Push a pointer to the stack (lifo).
257 * @param st The stack.
258 * @param x The pointer element to be added
262 #define stack_push(st, x) pdeq_putr((st), (x))
265 * Checks if a stack is empty.
267 * @param st The stack.
269 * @return non-zero if the stack is empty.
271 #define stack_empty(st) pdeq_empty(wq)