-/* Copyright (c) 2002 by Universität Karlsruhe (TH). All Rights Reserved */
/*
-* Time-stamp: <Thursday, 31.10.2002, 16:03:00 goetz@i44pc2.info.uni-karlsruhe.de>
-*/
+ * Project: libFIRM
+ * File name: ir/st/st.c
+ * Purpose: Provide some auxilliary structures for firm graphs.
+ * Author: Florian Liekweg
+ * Modified by:
+ * Created: 26.2.2002
+ * CVS-ID: $Id$
+ * Copyright: (c) 2002-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
/**
NAME
provide some auxilliary structures for firm graphs.
S
not quite complete
- HISTORY
- liekweg - Feb 26, 2002: Created.
- CVS:
- $Id$
***/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
-# include "st.h"
+# include <stdio.h>
+# include <stdlib.h>
+# include "st.h"
# include "irgwalk.h"
-
-# include <stdio.h>
-# ifdef DEBUG_libfirm
-# endif /* def DEBUG_libfirm */
-# include <stdlib.h>
-# include "misc.h"
+# include "xmalloc.h"
/* init globals: */
-static dtree_t *trees = 0;
+/*static*/ dtree_t *trees = 0;
/*
static dtree_t *last = 0;
*/
# endif /* def DEBUG_libfirm */
fprintf (stdout, "%s: Block(%p) has # (%i)\n",
- __FILE__ ":count_block", block, *n);
+ __FILE__ ":count_block", (void *)block, *n);
(*n) ++;
}
irg_block_walk (end_block, count_block, NULL, &n);
fprintf (stdout, "%s: Graph(%p) has (%i) blocks\n",
- __FILE__ ":get_n_blocks", graph, n);
+ __FILE__ ":get_n_blocks", (void *)graph, n);
return (n);
}
/* check preds: */
for (i = 0; i < n_ins; i ++)
{
- ir_node *in = get_nodes_Block (get_irn_n (block, i));
+ ir_node *in = get_nodes_block (get_irn_n (block, i));
bs_t in_mask = get_mask (dt, in);
new_mask &= in_mask;
{
ir_node *ndom = 0;
- pred = get_nodes_Block (get_irn_n (block, i));
+ pred = get_nodes_block (get_irn_n (block, i));
ndom = _get_idom (dt, pred);
if (ndom != idom)