summaryrefslogtreecommitdiffhomepage
path: root/ir/be/belive.c
diff options
context:
space:
mode:
authorChristoph Mallon <christoph.mallon@gmx.de>2012-12-01 12:39:48 +0100
committerChristoph Mallon <christoph.mallon@gmx.de>2012-12-02 09:56:23 +0100
commit2cb67d89aafac7737bece78b5837d3d48fb528bc (patch)
tree48208470a53583064aaea2db8fcfc3c592ebb5cc /ir/be/belive.c
parent57c32f8c589cced69ad0d90a666f1c54e49bfc2f (diff)
array: Add and use NEW_ARR_FZ().
Diffstat (limited to 'ir/be/belive.c')
-rw-r--r--ir/be/belive.c4
1 files changed, 1 insertions, 3 deletions
diff --git a/ir/be/belive.c b/ir/be/belive.c
index a3d268f..acf32c2 100644
--- a/ir/be/belive.c
+++ b/ir/be/belive.c
@@ -363,7 +363,6 @@ static void collect_liveness_nodes(ir_node *irn, void *data)
void be_liveness_compute_sets(be_lv_t *lv)
{
- ir_node **nodes;
int i;
int n;
@@ -375,8 +374,7 @@ void be_liveness_compute_sets(be_lv_t *lv)
obstack_init(&lv->obst);
n = get_irg_last_idx(lv->irg);
- nodes = NEW_ARR_F(ir_node *, n);
- memset(nodes, 0, sizeof(nodes[0]) * n);
+ ir_node **const nodes = NEW_ARR_FZ(ir_node*, n);
/* inserting the variables sorted by their ID is probably
* more efficient since the binary sorted set insertion