path: root/ir/be/beuses.h
diff options
authorMatthias Braun <>2006-12-10 23:16:38 +0100
committerMatthias Braun <>2006-12-10 23:16:38 +0100
commit0c92b911be3d9d02b4a49b2a142dab8d7ba978a6 (patch)
treea2fa37ac634707b2ac0ac4c672c25db03d26ae14 /ir/be/beuses.h
parent88e8acd0eb763040fa13894bc4d24f07c09fabb5 (diff)
- New belady variant (see my diploma thesis + presentation)
- refactored backend to store some analysis info about the irg in the be_irg structure, added assure_ and invalidate_ functions for this
Diffstat (limited to 'ir/be/beuses.h')
1 files changed, 8 insertions, 4 deletions
diff --git a/ir/be/beuses.h b/ir/be/beuses.h
index 7d12370..68f4b57 100644
--- a/ir/be/beuses.h
+++ b/ir/be/beuses.h
@@ -14,7 +14,12 @@
#include "bearch.h"
#include "belive.h"
-#define USES_INFINITY 1000000
+typedef struct _be_next_use_t {
+ unsigned time;
+ int outermost_loop;
+} be_next_use_t;
+#define USES_INFINITY 10000000
static INLINE int USES_IS_INFINITE(unsigned time)
@@ -23,12 +28,11 @@ static INLINE int USES_IS_INFINITE(unsigned time)
typedef struct _be_uses_t be_uses_t;
-unsigned be_get_next_use(be_uses_t *uses, const ir_node *from,
+be_next_use_t be_get_next_use(be_uses_t *uses, ir_node *from,
unsigned from_step, const ir_node *def,
int skip_from_uses);
-be_uses_t *be_begin_uses(ir_graph *irg, const ir_exec_freq *execfreqs,
- const be_lv_t *lv);
+be_uses_t *be_begin_uses(ir_graph *irg, const be_lv_t *lv);
void be_end_uses(be_uses_t *uses);