4 * @author Sebastian Hack
6 * Methods to compute when a value will be used again.
8 * Copyright (C) 2005 Universitaet Karlsruhe
9 * Released under the GPL
23 #include "irgraph_t.h"
24 #include "iredges_t.h"
31 #include "besched_t.h"
35 #include "benodesets.h"
37 #define DBG_LEVEL SET_LEVEL_0
39 typedef struct _be_use_t {
49 const arch_env_t *arch_env;
50 DEBUG_ONLY(firm_dbg_module_t *dbg;)
53 static int cmp_use(const void *a, const void *b, size_t n)
55 const be_use_t *p = a;
56 const be_use_t *q = b;
57 return !(p->bl == q->bl && p->irn == q->irn);
60 static INLINE be_use_t *get_or_set_use(be_uses_t *uses,
61 const ir_node *bl, const ir_node *def, unsigned next_use)
63 unsigned hash = HASH_COMBINE(nodeset_hash(bl), nodeset_hash(def));
69 templ.next_use = be_get_next_use(uses, sched_first(bl), 0, def, 0);
70 result = set_insert(uses->uses, &templ, sizeof(templ), hash);
75 unsigned be_get_next_use(be_uses_t *uses, const ir_node *from,
76 unsigned from_step, const ir_node *def, int skip_from_uses);
78 static unsigned get_next_use_bl(be_uses_t *uses, const ir_node *bl,
81 be_use_t *u = get_or_set_use(uses, bl, def, 0);
86 static unsigned get_next_use(be_uses_t *uses, const ir_node *from, unsigned from_step, const ir_node *def, int skip_from_uses, unsigned long visited_nr)
88 unsigned next_use = USES_INFINITY;
89 unsigned step = from_step;
91 ir_node *bl = get_nodes_block(from);
93 const ir_edge_t *succ_edge;
95 set_irn_visited(bl, visited_nr);
97 sched_foreach_from(from, irn) {
100 if (! skip_from_uses) {
101 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
102 ir_node *operand = get_irn_n(irn, i);
104 if (operand == def) {
105 DBG((uses->dbg, LEVEL_3, "found use of %+F at %+F\n", operand, irn));
115 /* FIXME: quick and dirty hack to prevent ignore nodes (like stack pointer) from being spilled */
116 return be_is_live_end(uses->lv, bl, def) ? step : USES_INFINITY;
118 next_use = USES_INFINITY;
119 foreach_block_succ(bl, succ_edge) {
120 const ir_node *succ_bl = succ_edge->src;
121 if(get_irn_visited(succ_bl) < visited_nr && (be_is_live_in(uses->lv, succ_bl, def) || (get_irn_arity(succ_bl) > 1 && be_is_live_end(uses->lv, bl, def)))) {
122 unsigned next = get_next_use_bl(uses, succ_bl, def);
124 DBG((uses->dbg, LEVEL_2, "\t\tnext use in succ %+F: %d\n", succ_bl, next));
125 next_use = MIN(next_use, next);
130 return next_use + step;
133 unsigned be_get_next_use(be_uses_t *uses, const ir_node *from, unsigned from_step, const ir_node *def, int skip_from_uses)
135 unsigned long visited_nr = get_irg_visited(uses->irg) + 1;
137 set_irg_visited(uses->irg, visited_nr);
138 return get_next_use(uses, from, from_step, def, skip_from_uses, visited_nr);
142 be_uses_t *be_begin_uses(ir_graph *irg, const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls)
144 be_uses_t *uses = xmalloc(sizeof(uses[0]));
148 uses->arch_env = arch_env;
149 uses->uses = new_set(cmp_use, 512);
152 FIRM_DBG_REGISTER(uses->dbg, "firm.be.uses");
157 void be_end_uses(be_uses_t *uses)
163 int loc_compare(const void *a, const void *b)
167 return p->time - q->time;