X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fset.c;h=55aafc417086b04d540bae8ba51ca49a28d75085;hb=d3c57d623bba4b2ab842b8a60c386fc0e0b25a73;hp=fffe229f96e300472fb5bb58b6271e0bf942a080;hpb=23e73ea5baaf7f25c45f97683fa2c14982fc4472;p=libfirm diff --git a/ir/adt/set.c b/ir/adt/set.c index fffe229f9..55aafc417 100644 --- a/ir/adt/set.c +++ b/ir/adt/set.c @@ -33,7 +33,7 @@ /* $Id$ */ #ifdef HAVE_CONFIG_H -# include +# include "config.h" #endif /* bcopy is not ISO C * @@ -79,30 +79,30 @@ typedef struct element { - struct element *chain; /* for chaining Elements */ + struct element *chain; /**< for chaining Elements */ MANGLEP (entry) entry; } Element, *Segment; struct SET { - unsigned p; /* Next bucket to be split */ - unsigned maxp; /* upper bound on p during expansion */ - unsigned nkey; /* current # keys */ - unsigned nseg; /* current # segments */ + unsigned p; /**< Next bucket to be split */ + unsigned maxp; /**< upper bound on p during expansion */ + unsigned nkey; /**< current # keys */ + unsigned nseg; /**< current # segments */ Segment *dir[DIRECTORY_SIZE]; - MANGLEP(cmp_fun) cmp; /* function comparing entries */ + MANGLEP(cmp_fun) cmp; /**< function comparing entries */ unsigned iter_i, iter_j; - Element *iter_tail; /* non-NULL while iterating over elts */ + Element *iter_tail; /**< non-NULL while iterating over elts */ #ifdef PSET - Element *free_list; /* list of free Elements */ + Element *free_list; /**< list of free Elements */ #endif - struct obstack obst; /* obstack for allocation all data */ + struct obstack obst; /**< obstack for allocation all data */ #ifdef STATS int naccess, ncollision, ndups; int max_chain_len; #endif #ifdef DEBUG - const char *tag; + const char *tag; /**< an optionally tag for distinguishing sets */ #endif }; @@ -167,6 +167,9 @@ MANGLEP(describe) (SET *table) } } } +#ifdef STATS + MANGLEP(stats)(table); +#endif } #endif /* !DEBUG */ @@ -301,7 +304,6 @@ static INLINE unsigned Hash (SET *table, unsigned h) { unsigned address; - address = h & (table->maxp - 1); /* h % table->maxp */ if (address < (unsigned)table->p) address = h & ((table->maxp << 1) - 1); /* h % (2*table->maxp) */ @@ -405,7 +407,6 @@ MANGLE(_,_search) (SET *table, int chain_len = 0; assert (table); - assert (!table->iter_tail); assert (key); #ifdef DEBUG MANGLEP(tag) = table->tag; @@ -428,6 +429,8 @@ MANGLE(_,_search) (SET *table, stat_chain_len (table, chain_len); if (!q && (action != MANGLE(_,_find))) { /* not found, insert */ + assert (!table->iter_tail && "insert an element into a set that is iterated"); + if (CurrentSegment[SegmentIndex]) stat_dup (table); #ifdef PSET @@ -468,6 +471,11 @@ MANGLE(_,_search) (SET *table, #ifdef PSET +int pset_default_ptr_cmp(const void *x, const void *y) +{ + return x != y; +} + void * pset_remove (SET *table, const void *key, unsigned hash) {