X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana2%2Fqset.c;h=c21e355f3cffe6b1c238ce7177b38b6747980535;hb=c53a503e81f6e7c0995fbbcc451c2178ad9083bd;hp=4e56b428810aee32b4594c1a3e0580f114e87b96;hpb=5e58ad7b33d737c06a833a66b8c4c4d209d248db;p=libfirm

diff --git a/ir/ana2/qset.c b/ir/ana2/qset.c
index 4e56b4288..c21e355f3 100644
--- a/ir/ana2/qset.c
+++ b/ir/ana2/qset.c
@@ -1,7 +1,7 @@
 /* -*- c -*- */
 
 /*
- * Time-stamp: <05.12.2004 21:39:34h liekweg>
+ * Time-stamp: <17.12.2004 20:26:51h liekweg>
  * Project:     libFIRM
  * File name:   ir/ana2/qset.c
  * Purpose:     yet another set implementation
@@ -12,14 +12,16 @@
  * Copyright:   (c) 1999-2004 Universität Karlsruhe
  * Licence:     This file is protected by GPL -  GNU GENERAL PUBLIC LICENSE.
  */
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
 
 # include <stdio.h>
 # include <stdlib.h>
 # include <assert.h>
 # include <string.h>
-# include <sys/time.h>
-# include <obstack.h>
 
+# include "obst.h"
 # include "timing.h"
 # include "qset.h"
 
@@ -41,7 +43,7 @@ static int q_test (sortable_t*, const sortable_t, const int);
 static void q_sort (sortable_t*, const int);
 
 /* Compare funktion, meant to be qsort(3)-compatible */
-static __inline__ int sortable_compare (const void *pa, const void *pb)
+static INLINE int sortable_compare (const void *pa, const void *pb)
 {
   const int a = * (unsigned int*) pa;
   const int b = * (unsigned int*) pb;
@@ -512,7 +514,7 @@ void qset_delete (qset_t *qset)
 }
 
 /*
-  Test wether the given qset contains the given value.
+  Test whether the given qset contains the given value.
 */
 int qset_contains (qset_t *qset, sortable_t val)
 {
@@ -569,6 +571,9 @@ int qset_insert (qset_t *qset, sortable_t val)
 
   qset_resize (qset, qset->n_elems+1);
 
+  /* qset_print (qset, stdout); */
+  /* fprintf (stdout, "%s: must insert 0x%08x\n", __FUNCTION__, (void*) val); */
+
   qset->values [qset->n_elems++] = val;
   qset->is_sorted = FALSE;
 
@@ -673,9 +678,11 @@ int qset_is_empty (qset_t *qset)
 */
 sortable_t *qset_start (qset_t *qset)
 {
+  sortable_t *start;
+
   qset->cursor = 0;
 
-  sortable_t *start = qset_next (qset);
+  start = qset_next (qset);
 
   return (start);    /* works for empty sets, too */
 }
@@ -723,6 +730,17 @@ int qset_test_main (int argc, char **argv)
 
 /*
   $Log$
+  Revision 1.11  2005/06/22 09:34:11  beck
+  typo fixed
+
+  Revision 1.10  2004/12/21 15:37:31  beck
+  added config.h include
+  removed unused sys/times.h
+  removed C99 constructs
+
+  Revision 1.9  2004/12/20 17:34:35  liekweg
+  fix recursion handling
+
   Revision 1.8  2004/12/06 12:49:26  liekweg
   virtually no change