* @version $Id$
* @summary
*
- * Currently completely broken because our stes so NOT preserve
+ * Currently completely broken because our sets do NOT preserve
* the topological sort!
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
+#include "iroptimize.h"
+
#include <assert.h>
#include "irgraph_t.h"
#include "ircons.h"
#include "irgmod.h"
#include "debug.h"
-#include "gvn_pre.h"
#include "xmalloc.h"
/** The debug module handle. */
{
const value_entry *e1 = elt;
const value_entry *e2 = key;
+ (void) size;
return identities_cmp(e1->value, e2->value);
}
node might depend on that. */
copy_node_attr(node, nn);
res = node_add(env->trans_set, nn);
- if (nn != res)
+ if (nn != res) {
obstack_free(env->obst, nn);
- else
+ } else {
DB((dbg, LEVEL_2, "--> Translate %+F in <%+F,%d> into %+F\n", node, block, pos, res));
+ }
+
return res;
}
return node;
value_set_foreach(entry, idom_info->new_set) {
updated |= value_add_or_replace(curr_info->avail_out, entry->node, entry->value);
}
- if (updated)
+ if (updated) {
dump_value_set(curr_info->avail_out, "Updated [Avail_out]", block);
+ }
if (arity <= 1)
return;