beifg: Simplify the quite complicated way to divide a number by 2 in be_ifg_stat().

[libfirm] / ir / adt / pdeq.c

diff --git a/ir/adt/pdeq.c b/ir/adt/pdeq.c
index e00f1af..dcf1143 100644 (file)
--- a/ir/adt/pdeq.c
+++ b/ir/adt/pdeq.c
@@ -1,20 +1,6 @@
 /*
- * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
- *
  * This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -73,9 +59,8 @@ struct pdeq {
 
 /**
  * cache of unused, pdeq blocks to speed up new_pdeq and del_pdeq.
- * +1 for compilers that can't grok empty arrays
  */
-static pdeq *pdeq_block_cache[TUNE_NSAVED_PDEQS+1];
+static pdeq *pdeq_block_cache[TUNE_NSAVED_PDEQS];
 
 /**
  * Number of pdeqs in pdeq_store.
@@ -107,7 +92,7 @@ static inline void free_pdeq_block (pdeq *p)
 static inline pdeq *alloc_pdeq_block (void)
 {
        pdeq *p;
-       if (TUNE_NSAVED_PDEQS && pdeqs_cached) {
+       if (pdeqs_cached > 0) {
                p = pdeq_block_cache[--pdeqs_cached];
        } else {
                p = (pdeq*) xmalloc(PREF_MALLOC_SIZE);
@@ -115,34 +100,6 @@ static inline pdeq *alloc_pdeq_block (void)
        return p;
 }
 
-
-#ifndef NDEBUG
-/**
- * Verify a double ended list, assert if failure.
- *
- * @param dq   The list to verify.
- */
-void _pdeq_vrfy(pdeq *dq)
-{
-       pdeq *q;
-
-       assert (   dq
-                       && (dq->magic == PDEQ_MAGIC1)
-                       && (dq->l_end && dq->r_end));
-       q = dq->l_end;
-       while (q) {
-               assert (   ((q == dq) || (q->magic == PDEQ_MAGIC2))
-                               && ((q == dq->l_end) ^ (q->l != NULL))
-                               && ((q == dq->r_end) ^ (q->r != NULL))
-                               && (!q->l || (q == q->l->r))
-                               && (q->n <= NDATA)
-                               && ((q == dq->l_end) || (q == dq->r_end) || (q->n == NDATA))
-                               && (q->p < NDATA));
-               q = q->r;
-       }
-}
-#endif
-
 /* Creates a new double ended pointer list. */
 pdeq *new_pdeq(void)
 {
@@ -185,7 +142,6 @@ void del_pdeq(pdeq *dq)
                qq = q->r;
                free_pdeq_block(q);
        } while ((q = qq));
-
 }
 
 /* Checks if a list is empty. */