#include "iredges_t.h"
#include "irgwalk.h"
-#include "irprintf_t.h"
+#include "irprintf.h"
#include "irdump_t.h"
#include "irnodeset.h"
#include "absgraph.h"
-#include "statev.h"
-
+#include "statev_t.h"
+#include "be_t.h"
+#include "bearch.h"
#include "beutil.h"
#include "belive_t.h"
-#include "beirg.h"
#include "besched.h"
#include "bemodule.h"
-#include "bedump.h"
DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
#define LV_STD_SIZE 64
-/**
- * Filter out some nodes for which we never need liveness.
- *
- * @param irn the node t check
- * @return 0 if no liveness info is needed, 1 else
- */
-static inline int is_liveness_node(const ir_node *irn)
-{
- switch (get_irn_opcode(irn)) {
- case iro_Block:
- case iro_Bad:
- case iro_End:
- case iro_Anchor:
- case iro_NoMem:
- return 0;
- default:
- return 1;
- }
-}
-
int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
{
return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
return _be_is_live_xxx(lv, block, irn, be_lv_state_end);
}
-static inline unsigned _be_liveness_bsearch(be_lv_info_t *arr, unsigned idx)
+static inline unsigned _be_liveness_bsearch(be_lv_info_t *arr, const ir_node *node)
{
be_lv_info_t *payload = arr + 1;
return 0;
do {
- int md = lo + ((hi - lo) >> 1);
- unsigned md_idx = payload[md].node.idx;
+ int md = lo + ((hi - lo) >> 1);
+ ir_node *md_node = payload[md].node.node;
- if (idx > md_idx)
+ if (node > md_node)
lo = md + 1;
- else if (idx < md_idx)
+ else if (node < md_node)
hi = md;
else {
res = md;
- assert(payload[res].node.idx == idx);
break;
}
be_lv_info_node_t *res = NULL;
stat_ev_tim_push();
- irn_live = (be_lv_info_t*)ir_nodehashmap_get(&li->map, bl);
+ irn_live = ir_nodehashmap_get(be_lv_info_t, &li->map, bl);
if (irn_live != NULL) {
- unsigned idx = get_irn_idx(irn);
-
/* Get the position of the index in the array. */
- int pos = _be_liveness_bsearch(irn_live, idx);
+ int pos = _be_liveness_bsearch(irn_live, irn);
/* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
be_lv_info_node_t *rec = &irn_live[pos + 1].node;
/* Check, if the irn is in deed in the array. */
- if (rec->idx == idx)
+ if (rec->node == irn)
res = rec;
}
stat_ev_tim_pop("be_lv_get");
static be_lv_info_node_t *be_lv_get_or_set(be_lv_t *li, ir_node *bl,
ir_node *irn)
{
- be_lv_info_t *irn_live = (be_lv_info_t*)ir_nodehashmap_get(&li->map, bl);
+ be_lv_info_t *irn_live = ir_nodehashmap_get(be_lv_info_t, &li->map, bl);
if (irn_live == NULL) {
irn_live = OALLOCNZ(&li->obst, be_lv_info_t, LV_STD_SIZE);
irn_live[0].head.n_size = LV_STD_SIZE-1;
ir_nodehashmap_insert(&li->map, bl, irn_live);
}
- unsigned idx = get_irn_idx(irn);
-
/* Get the position of the index in the array. */
- unsigned pos = _be_liveness_bsearch(irn_live, idx);
+ unsigned pos = _be_liveness_bsearch(irn_live, irn);
/* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
be_lv_info_node_t *res = &irn_live[pos + 1].node;
/* Check, if the irn is in deed in the array. */
- if (res->idx != idx) {
+ if (res->node != irn) {
be_lv_info_t *payload;
unsigned n_members = irn_live[0].head.n_members;
unsigned n_size = irn_live[0].head.n_size;
++irn_live[0].head.n_members;
- res = &payload[pos].node;
- res->idx = idx;
- res->flags = 0;
+ res = &payload[pos].node;
+ res->node = irn;
+ res->flags = 0;
}
return res;
static int be_lv_remove(be_lv_t *li, const ir_node *bl,
const ir_node *irn)
{
- be_lv_info_t *irn_live = (be_lv_info_t*)ir_nodehashmap_get(&li->map, bl);
+ be_lv_info_t *irn_live = ir_nodehashmap_get(be_lv_info_t, &li->map, bl);
if (irn_live != NULL) {
unsigned n = irn_live[0].head.n_members;
- unsigned idx = get_irn_idx(irn);
- unsigned pos = _be_liveness_bsearch(irn_live, idx);
+ unsigned pos = _be_liveness_bsearch(irn_live, irn);
be_lv_info_t *payload = irn_live + 1;
be_lv_info_node_t *res = &payload[pos].node;
/* The node is in deed in the block's array. Let's remove it. */
- if (res->idx == idx) {
+ if (res->node == irn) {
unsigned i;
for (i = pos + 1; i < n; ++i)
payload[i - 1] = payload[i];
- payload[n - 1].node.idx = 0;
+ payload[n - 1].node.node = NULL;
payload[n - 1].node.flags = 0;
--irn_live[0].head.n_members;
return 0;
}
-static void register_node(be_lv_t *lv, const ir_node *irn)
-{
- unsigned idx = get_irn_idx(irn);
- if (idx >= bitset_size(lv->nodes)) {
- bitset_t *nw = bitset_malloc(2 * idx);
- bitset_copy_into(nw, lv->nodes);
- bitset_free(lv->nodes);
- lv->nodes = nw;
- }
-
- bitset_set(lv->nodes, idx);
-}
-
/**
* Mark a node as live-in in a block.
*/
be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
n->flags |= be_lv_state_in;
- register_node(lv, irn);
}
/**
be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
n->flags |= be_lv_state_out | be_lv_state_end;
- register_node(lv, irn);
}
/**
be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
n->flags |= be_lv_state_end;
- register_node(lv, irn);
}
static struct {
*/
static void liveness_for_node(ir_node *irn)
{
- const ir_edge_t *edge;
ir_node *def_block;
bitset_clear_all(re.visited);
ir_node **nodes;
int i;
int n;
- unsigned last_idx;
if (lv->sets_valid)
return;
be_timer_push(T_LIVE);
- last_idx = get_irg_last_idx(lv->irg);
- if (last_idx >= bitset_size(lv->nodes)) {
- bitset_free(lv->nodes);
- lv->nodes = bitset_malloc(last_idx * 2);
- } else {
- bitset_clear_all(lv->nodes);
- }
ir_nodehashmap_init(&lv->map);
obstack_init(&lv->obst);
DEL_ARR_F(nodes);
free(re.visited);
- register_hook(hook_node_info, &lv->hook_info);
be_timer_pop(T_LIVE);
{
if (!lv->sets_valid)
return;
- unregister_hook(hook_node_info, &lv->hook_info);
obstack_free(&lv->obst, NULL);
ir_nodehashmap_destroy(&lv->map);
lv->sets_valid = false;
be_lv_t *lv = XMALLOCZ(be_lv_t);
lv->irg = irg;
- lv->hook_info.context = lv;
- lv->hook_info.hook._hook_node_info = be_dump_liveness_block;
- lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
return lv;
}
be_liveness_invalidate_sets(lv);
be_liveness_invalidate_chk(lv);
- bitset_free(lv->nodes);
xfree(lv);
}
void be_liveness_remove(be_lv_t *lv, const ir_node *irn)
{
if (lv->sets_valid) {
- unsigned idx = get_irn_idx(irn);
lv_remove_walker_t w;
/*
w.lv = lv;
w.irn = irn;
dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
- if (idx < bitset_size(lv->nodes))
- bitset_clear(lv->nodes, idx);
}
}
void be_liveness_transfer(const arch_register_class_t *cls,
ir_node *node, ir_nodeset_t *nodeset)
{
- int i, arity;
-
/* You should better break out of your loop when hitting the first phi
* function. */
assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
- if (get_irn_mode(node) == mode_T) {
- const ir_edge_t *edge;
-
- foreach_out_edge(node, edge) {
- ir_node *proj = get_edge_src_irn(edge);
+ be_foreach_definition(node, cls, value, req,
+ ir_nodeset_remove(nodeset, value);
+ );
- if (arch_irn_consider_in_reg_alloc(cls, proj)) {
- ir_nodeset_remove(nodeset, proj);
- }
- }
- } else if (arch_irn_consider_in_reg_alloc(cls, node)) {
- ir_nodeset_remove(nodeset, node);
- }
-
- arity = get_irn_arity(node);
- for (i = 0; i < arity; ++i) {
- ir_node *op = get_irn_n(node, i);
-
- if (arch_irn_consider_in_reg_alloc(cls, op))
- ir_nodeset_insert(nodeset, op);
- }
+ be_foreach_use(node, cls, in_req, op, op_req,
+ ir_nodeset_insert(nodeset, op);
+ );
}
const arch_register_class_t *cls,
const ir_node *block, ir_nodeset_t *live)
{
- int i;
-
- assert(lv->nodes && "live sets must be computed");
- be_lv_foreach(lv, block, be_lv_state_end, i) {
- ir_node *node = be_lv_get_irn(lv, block, i);
- if (!arch_irn_consider_in_reg_alloc(cls, node))
- continue;
-
+ assert(lv->sets_valid && "live sets must be computed");
+ be_lv_foreach_cls(lv, block, be_lv_state_end, cls, node) {
ir_nodeset_insert(live, node);
}
}
-void be_liveness_nodes_live_at(const be_lv_t *lv,
- const arch_register_class_t *cls,
- const ir_node *pos, ir_nodeset_t *live)
+void be_liveness_nodes_live_before(be_lv_t const *const lv, arch_register_class_t const *const cls, ir_node const *const pos, ir_nodeset_t *const live)
{
- const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
- ir_node *irn;
-
+ ir_node const *const bl = get_nodes_block(pos);
be_liveness_end_of_block(lv, cls, bl, live);
sched_foreach_reverse(bl, irn) {
- /*
- * If we encounter the node we want to insert the Perm after,
- * exit immediately, so that this node is still live
- */
+ be_liveness_transfer(cls, irn, live);
if (irn == pos)
return;
-
- be_liveness_transfer(cls, irn, live);
}
}