aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2018-08-27 10:50:45 +0000
committerRichard Biener <rguenth@gcc.gnu.org>2018-08-27 10:50:45 +0000
commit8d2d69eba471b77adc69e80f224b841c41f48cf6 (patch)
treef10d89c41e8a257d6428190b597c9f32cf7ae787 /gcc
parente7289cb45d094d9c538dc978c3fc0ae18e4752bd (diff)
downloadgcc-8d2d69eba471b77adc69e80f224b841c41f48cf6.zip
gcc-8d2d69eba471b77adc69e80f224b841c41f48cf6.tar.gz
gcc-8d2d69eba471b77adc69e80f224b841c41f48cf6.tar.bz2
tree-ssa-pre.c (compute_antic): Re-use inverted postorder for partial antic compute.
2018-08-27 Richard Biener <rguenther@suse.de> * tree-ssa-pre.c (compute_antic): Re-use inverted postorder for partial antic compute. From-SVN: r263874
Diffstat (limited to 'gcc')
-rw-r--r--gcc/ChangeLog5
-rw-r--r--gcc/tree-ssa-pre.c4
2 files changed, 6 insertions, 3 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 99e8504..d02050f 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2018-08-27 Richard Biener <rguenther@suse.de>
+
+ * tree-ssa-pre.c (compute_antic): Re-use inverted postorder
+ for partial antic compute.
+
2018-08-27 Jakub Jelinek <jakub@redhat.com>
PR rtl-optimization/87065
diff --git a/gcc/tree-ssa-pre.c b/gcc/tree-ssa-pre.c
index 144902d..5e973eb 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,