path: root/ir/be/becopyopt_t.h
diff options
authorMatthias Braun <>2006-08-31 16:39:41 +0200
committerMatthias Braun <>2006-08-31 16:39:41 +0200
commit839487dfb4a714fa7e66063495ade6a3726040ef (patch)
treed3f135b2febfb67d591d83635d086085b7f0b14f /ir/be/becopyopt_t.h
parentafc0d21fdc38c1a039cdecab1867bb351f42d8c2 (diff)
- Refactored finish/after_ra phases a bit, stacknode fixup and stack bias
walking occurs before finish phase now - changed ia32 to do some things transforms from finish phase in after_ra phase already but do peephole optimization in finish phase. - Added a peephole optimisation that transform IncSP,Store cascades to Pushs - Replaced several HASH_PTR with nodeset_hash to make compiler more deterministic.
Diffstat (limited to 'ir/be/becopyopt_t.h')
1 files changed, 2 insertions, 1 deletions
diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h
index be1a598..045ce33 100644
--- a/ir/be/becopyopt_t.h
+++ b/ir/be/becopyopt_t.h
@@ -15,6 +15,7 @@
#include "bearch.h"
#include "bechordal_t.h"
#include "becopyopt.h"
+#include "benodesets.h"
* Data representing the problem of copy minimization.
@@ -120,7 +121,7 @@ static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, ir_node *
find.irn = irn;
- return set_find(co->nodes, &find, sizeof(find), HASH_PTR(irn));
+ return set_find(co->nodes, &find, sizeof(find), nodeset_hash(irn));
#define co_gs_nodes_begin(co) set_first((co)->nodes)