implement node walker in direction of out-edges

[libfirm] / ir / ir / irbitset.h

diff --git a/ir/ir/irbitset.h b/ir/ir/irbitset.h
index eb232ab..de2fb14 100644 (file)
--- a/ir/ir/irbitset.h
+++ b/ir/ir/irbitset.h
@@ -1,33 +1,54 @@
-/**
- * Some convenience macros for node bitmaps.
- * @author Sebastian Hack
- * @date   10.05.2006
+/*
+ * 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.
  */
 
-#ifndef __FIRM_IRBITSET_H
-#define __FIRM_IRBITSET_H
+/**
+ * @file
+ * @brief   Some convenience macros for node bitmaps.
+ * @author  Sebastian Hack
+ * @date    10.05.2006
+ * @version $Id$
+ */
+#ifndef FIRM_IR_IRBITSET_H
+#define FIRM_IR_IRBITSET_H
 
 #include "bitset.h"
 
 #define bitset_irg_malloc(irg)                bitset_malloc(get_irg_last_idx(irg))
-#define bitset_irg_obstack_alloc(obst, irg)   bitset_obstac_alloc(obst, get_irg_last_idx(irg))
+#define bitset_irg_alloca(irg)                bitset_alloca(get_irg_last_idx(irg))
+#define bitset_irg_obstack_alloc(obst, irg)   bitset_obstack_alloc(obst, get_irg_last_idx(irg))
 #define bitset_add_irn(bs, irn)               bitset_set((bs), get_irn_idx(irn))
 #define bitset_remv_irn(bs, irn)              bitset_clear((bs), get_irn_idx(irn))
 #define bitset_contains_irn(bs, irn)          bitset_is_set((bs), get_irn_idx(irn))
 
 
 /* Internal use. */
-#define _bsfe_get_irn(irg, elm) (elm == -1 ? NULL : get_idx_irn((irg), (unsigned) elm))
+#define _bsfe_get_irn(irg, elm) (elm == (unsigned) -1 ? NULL : get_idx_irn((irg), (unsigned) elm))
 
 /**
  * Iterate over a bitset containing node indexes.
  * @param irg The graph the nodes are in.
  * @param bs  The bitset containing the indexes.
- * @param elm A loop variable for the bitset (must be of type bitset_pos_t).
+ * @param elm A loop variable for the bitset
  * @param irn An ir_node * which is set to the current node.
  */
 #define bitset_foreach_irn(irg, bs, elm, irn) \
-       for(elm = bitset_next_set(bs, 0), irn = _bsfe_get_irn(irg, elm); elm != -1; elm = bitset_next_set(bs, elm + 1), irn = _bsfe_get_irn(irg, elm))
+       for(elm = bitset_next_set(bs, 0), irn = _bsfe_get_irn(irg, elm); elm != (unsigned) -1; elm = bitset_next_set(bs, elm + 1), irn = _bsfe_get_irn(irg, elm))
 
 
-#endif /* __FIRM_IRBITSET_H */
+#endif