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

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 99e85045677911dc5d0a504d2668dff3aa15bd9b..d02050f790acc3577fff0b65a46c473d0c7ea109 100644 (file)
--- 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 144902d15dc5e37548a1d7d796e95c3151c59086..5e973eb9f94f46f73b5c71bc9520729df1f05294 100644 (file)
--- 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,