3 * File name: ir/adt/pdeq.c
4 * Purpose: Pdeq --- double ended queue of generic pointers.
5 * Author: Christian von Roques
7 * Created: 1999 by getting from fiasco
9 * Copyright: (c) 1995, 1996 Christian von Roques
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
32 /** Size of pdeq block cache */
33 #define TUNE_NSAVED_PDEQS 16
43 /* # of data items in block */
44 #define NDATA ((int)((PREF_MALLOC_SIZE - offsetof (pdeq, data)) / sizeof (void *)))
47 # define VRFY(dq) ((void)0)
50 (d_(df_vrfy_level,1) ? _pdeq_vrfy ((dq)) : assert ((dq) && ((dq)->cookie == PDEQ_COOKIE1)))
58 pdeq *l_end, *r_end; /* left and right ends of the deque */
59 pdeq *l, *r; /* left and right neighbour */
65 /* cache of unused, pdeq blocks to speed up new_pdeq and del_pdeq. */
66 /* +1 for compilers that can't grok empty arrays */
67 pdeq *pdeq_block_cache[TUNE_NSAVED_PDEQS+1];
68 unsigned pdeqs_cached; /* # pdeqs in pdeq_store */
72 free_pdeq_block (pdeq *p)
75 p->cookie = 0xbadf00d1;
77 if (pdeqs_cached < TUNE_NSAVED_PDEQS) {
78 if (d_ (df_pdeq, 2)) printf ("[%p ==> pdeq_block_cache] ", p);
79 pdeq_block_cache[pdeqs_cached++] = p;
81 if (d_ (df_pdeq, 2)) printf ("[%p ==> free] ", p);
88 alloc_pdeq_block (void)
91 if (TUNE_NSAVED_PDEQS && pdeqs_cached) {
92 p = pdeq_block_cache[--pdeqs_cached];
93 if (d_ (df_pdeq, 2)) printf ("[pdeq_block_cache ==> %p] ", p);
95 p = xmalloc (PREF_MALLOC_SIZE);
96 if (d_ (df_pdeq, 2)) printf ("[malloc ==> %p] ", p);
104 _pdeq_vrfy (pdeq *dq)
108 if (d_ (df_pdeq, 5)) printf ("[pdeq_vrfy %p] ", dq);
111 && (dq->cookie == PDEQ_COOKIE1)
112 && (dq->l_end && dq->r_end));
115 assert ( ((q == dq) || (q->cookie == PDEQ_COOKIE2))
116 && ((q == dq->l_end) ^ (q->l!=0))
117 && ((q == dq->r_end) ^ (q->r!=0))
118 && (!q->l || (q == q->l->r))
119 && ((q->n>=0) && (q->n<=NDATA))
120 && ((q == dq->l_end) || (q == dq->r_end) || (q->n == NDATA))
121 && ((q->p>=0) && (q->p<NDATA)));
133 dq = alloc_pdeq_block();
136 dq->cookie = PDEQ_COOKIE1;
138 dq->l_end = dq->r_end = dq;
139 dq->l = dq->r = NULL;
143 if (d_ (df_pdeq, 1)) printf ("(new_pdeq ==> %p)\n", dq);
149 new_pdeq1 (const void *x)
151 return pdeq_putr (new_pdeq(), x);
162 q = dq->l_end; /* left end of chain */
163 /* pdeq trunk empty, but !pdeq_empty() ==> trunk not in chain */
164 if (dq->n == 0 && dq->l_end != dq ) {
165 free_pdeq_block (dq);
168 /* Free all blocks in the pdeq chain */
174 if (d_ (df_pdeq, 1)) printf ("(del_pdeq %p)\n", dq);
179 pdeq_empty (pdeq *dq)
182 if (d_ (df_pdeq, 4)) printf ("(pdeq_empty %p ==> %d)\n", dq, dq->l_end->n == 0);
183 return dq->l_end->n == 0;
202 if (d_ (df_pdeq, 4)) printf ("(pdeq_len %p ==> %d)\n", dq, n);
208 pdeq_putr (pdeq *dq, const void *x)
217 if (rdq->n >= NDATA) { /* tailblock full */
220 ndq = dq; /* try to reuse trunk, but ... */
221 if (dq->n) { /* ... if trunk used */
222 /* allocate and init new block */
223 ndq = alloc_pdeq_block ();
224 pr = d_ (df_pdeq, 2);
226 ndq->cookie = PDEQ_COOKIE2;
228 ndq->l_end = ndq->r_end = NULL;
232 ndq->l = rdq; rdq->r = ndq;
233 ndq->n = 0; ndq->p = 0;
238 n = rdq->n++ + rdq->p;
239 if (n >= NDATA) n -= NDATA;
244 if (d_ (df_pdeq, 3) || pr) printf ("(pdeq_putr %p %p)\n", dq, x);
250 pdeq_putl (pdeq *dq, const void *x)
259 if (ldq->n >= NDATA) { /* headblock full */
262 ndq = dq; /* try to reuse trunk, but ... */
263 if (dq->n) { /* ... if trunk used */
264 /* allocate and init new block */
265 ndq = alloc_pdeq_block ();
266 pr = d_ (df_pdeq, 2);
268 ndq->cookie = PDEQ_COOKIE2;
270 ndq->l_end = ndq->r_end = NULL;
274 ndq->r = ldq; ldq->l = ndq;
275 ndq->n = 0; ndq->p = 0;
282 if (p < 0) p += NDATA;
288 if (d_ (df_pdeq, 3) || pr) printf ("(pdeq_putl %p %p)\n", dq, x);
302 assert (dq->l_end->n);
305 n = rdq->p + --rdq->n;
306 if (n>=NDATA) n -= NDATA;
315 dq->r_end = dq->l_end = dq;
318 free_pdeq_block (rdq);
319 pr = d_ (df_pdeq, 2);
324 if (d_ (df_pdeq, 3) || pr) printf ("(pdeq_getr %p ==> %p)\n", dq, x);
338 assert (dq->l_end->n);
343 if (++p >= NDATA) p = 0;
352 dq->l_end = dq->r_end = dq;
355 free_pdeq_block (ldq);
356 pr = d_ (df_pdeq, 2);
361 if (d_ (df_pdeq, 3) || pr) printf ("(pdeq_getl %p ==> %p)\n", dq, x);
367 pdeq_contains (pdeq *dq, const void *x)
377 p = q->p; ep = p + q->n;
380 do if (q->data[p] == x) goto found; while (++p < NDATA);
385 while (p < ep) if (q->data[p++] == x) goto found;
390 if (d_ (df_pdeq, 3)) printf ("(pdeq_contains %p %p ==> 0)\n", dq, x);
393 found: /* The two gotos can be optimized away, if !DEBUG */
394 if (d_ (df_pdeq, 3)) printf ("(pdeq_contains %p %p ==> 1)\n", dq, x);
400 pdeq_search (pdeq *dq, cmp_fun cmp, const void *key)
411 p = q->p; ep = p + q->n;
414 do if (!cmp (q->data[p], key)) goto found; while (++p < NDATA);
419 while (p < ep) if (!cmp (q->data[p++], key)) goto found;
424 if (d_ (df_pdeq, 3)) printf ("(pdeq_search %p %p %p ==> 0)\n", dq, cmp, key);
427 found: /* The two gotos can be optimized away, if !DEBUG */
428 if (d_ (df_pdeq, 3)) printf ("(pdeq_contains %p %p %p ==> %p)\n",
429 dq, cmp, key, q->data[p]);
430 return (void *)q->data[p-1];
435 pdeq_copyl (pdeq *dq, const void **dst)
438 const void **d = dst;
450 memcpy (d, &q->data[p], nn * sizeof (void *)); d += nn;
454 memcpy (d, &q->data[p], n * sizeof (void *)); d += n;
459 if (d_ (df_pdeq, 3)) printf ("(pdeq_copyl %p %p ==> %p)\n", dq, dst, d);
465 pdeq_copyr (pdeq *dq, const void **dst)
468 const void **d = dst;
476 p = q->p; i = q->n + p - 1;
479 do *d++ = q->data[i]; while (--i >= 0);
483 do *d++ = q->data[i]; while (--i >= p);
488 if (d_ (df_pdeq, 3)) printf ("(pdeq_copyr %p %p ==> %p)\n", dq, dst, d);