From 8d2d69eba471b77adc69e80f224b841c41f48cf6 Mon Sep 17 00:00:00 2001 From: Richard Biener Date: Mon, 27 Aug 2018 10:50:45 +0000 Subject: [PATCH] tree-ssa-pre.c (compute_antic): Re-use inverted postorder for partial antic compute. 2018-08-27 Richard Biener * tree-ssa-pre.c (compute_antic): Re-use inverted postorder for partial antic compute. From-SVN: r263874 --- gcc/ChangeLog | 5 +++++ gcc/tree-ssa-pre.c | 4 +--- 2 files changed, 6 insertions(+), 3 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 99e85045677..d02050f790a 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2018-08-27 Richard Biener + + * tree-ssa-pre.c (compute_antic): Re-use inverted postorder + for partial antic compute. + 2018-08-27 Jakub Jelinek PR rtl-optimization/87065 diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c index 144902d15dc..5e973eb9f94 100644 --- a/gcc/tree-ssa-pre.c +++ b/gcc/tree-ssa-pre.c @@ -2414,9 +2414,7 @@ compute_antic (void) { /* For partial antic we ignore backedges and thus we do not need to perform any iteration when we process blocks in postorder. */ - int postorder_num - = pre_and_rev_post_order_compute (NULL, postorder.address (), false); - for (i = postorder_num - 1 ; i >= 0; i--) + for (i = postorder.length () - 1; i >= 0; i--) { basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]); compute_partial_antic_aux (block, -- 2.30.2