X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnodeset.c;h=2f9911ce399e5337a54e85cabf8480efb65acecf;hb=bbcec654890da41c2299bf3b07d4cb51e9ed48e1;hp=f8c93b9ce6207bf00b7878a0c697779f7f14fc82;hpb=625937c8a524542866894d0b40c6cf89b481718c;p=libfirm diff --git a/ir/ir/irnodeset.c b/ir/ir/irnodeset.c index f8c93b9ce..2f9911ce3 100644 --- a/ir/ir/irnodeset.c +++ b/ir/ir/irnodeset.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -21,7 +21,7 @@ * @file * @author Matthias Braun * @date 30.03.2007 - * @brief A nodeset. This should be prefered over a simple pset, because it + * @brief A nodeset. This should be preferred over a simple pset, because it tries to guarantee deterministic behavior. * @version $Id$ */ @@ -39,14 +39,14 @@ #define NullValue NULL #define DeletedValue ((ir_node*)-1) #ifdef DEBUG_libfirm -#define Hash(this,value) (value)->node_nr +#define Hash(this,key) ((unsigned)((key)->node_nr)) #else -#define Hash(this,value) HASH_PTR(value) +#define Hash(this,key) HASH_PTR(key) #endif #define KeysEqual(this,key1,key2) (key1) == (key2) #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0])) -#define hashset_init ir_nodeset_init +#define hashset_init _ir_nodeset_init #define hashset_init_size ir_nodeset_init_size #define hashset_destroy ir_nodeset_destroy #define hashset_insert ir_nodeset_insert @@ -59,7 +59,12 @@ #include "hashset.c" -int ir_nodeset_contains(const ir_nodeset_t *this, const ir_node *node) +void ir_nodeset_init(ir_nodeset_t *nodeset) { - return _ir_nodeset_find(this, node) != NULL; + ir_nodeset_init_size(nodeset, 16); +} + +int ir_nodeset_contains(const ir_nodeset_t *nodeset, const ir_node *node) +{ + return _ir_nodeset_find(nodeset, node); }