+/*
+ * Copyright (C) 1995-2007 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.
+ */
+
/*
* Project: libFIRM
* File name: ir/opt/gvn_pre.c
* Created:
* CVS-ID: $Id$
* Copyright: (c) 1998-2006 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
-#ifdef HAVE_MALLOC_H
-# include <malloc.h>
-#endif
-#ifdef HAVE_ALLOCA_H
-# include <alloca.h>
-#endif
-
#include <assert.h>
#include "irgraph_t.h"
#include "irgmod.h"
#include "debug.h"
#include "gvn_pre.h"
+#include "xmalloc.h"
/** The debug module handle. */
-static firm_dbg_module_t *dbg;
+DEBUG_ONLY(static firm_dbg_module_t *dbg;)
/** A value set. */
return pset_count(set);
}
+#if 0
/** computes dst = dst \/ src for node sets */
static void node_union(node_set *dst, node_set *src)
{
ir_node *entry;
- node_set_foreach(entry, src)
+ node_set_foreach(entry, src) {
node_add(dst, entry);
+ }
}
+#endif
/**
* Lookup a node in a node set.
return node;
}
+#if 0
/**
* Implements phi_translate.
*/
return res;
} /* phi_translate */
+#endif
/**
* Implements phi_translate.
ir_node *nn, *res;
int i, arity;
struct obstack *old;
- ir_node *pred_block = get_Block_cfgpred_block(block, pos);
- block_info *pred_info = get_block_info(pred_block);
if (is_Phi(node)) {
if (get_irn_intra_n(node, -1) == block)
}
// clean_node_set(info->antic_in, block);
+ (void) clean_node_set;
dump_node_set(info->antic_in, "Antic_in", block);
if (size != node_set_count(info->antic_in)) {