re PR target/43884 (Performance degradation for simple fibonacci numbers calculation)

	PR tree-optimization/43884
	PR lto/44334
	* predict.c (maybe_hot_frequency_p): Use entry block frequency as an base.
	* doc/invoke.texi (hot-bb-frequency-fraction): Update docs.
	* gcc.dg/autopar/outer-2.c: Increase array size.
	* gcc.dg/tree-ssa/ldist-pr45948.c: Update test.

From-SVN: r169136

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 8e152821f8f6deb73d21437a2b07fb54a60b8c92..92f6d044b25532e0c8715461ea96db69273accbd 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,10 @@
+2011-01-22  Jan Hubicka  <jh@suse.cz>
+
+       PR tree-optimization/43884
+       PR lto/44334
+       * predict.c (maybe_hot_frequency_p): Use entry block frequency as an base.
+       * doc/invoke.texi (hot-bb-frequency-fraction): Update docs.
+
 2011-01-22  Anatoly Sokolov  <aesok@post.ru>
 
        * config/s390/s390.h (REGISTER_MOVE_COST, MEMORY_MOVE_COST): Remove.

diff --git a/gcc/predict.c b/gcc/predict.c
index a86708a5935174fa982ffb120b807e60248db29e..dc1104f850e18a27a0e374b75cc1a7727912fdcc 100644 (file)
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -126,7 +126,7 @@ maybe_hot_frequency_p (int freq)
   if (node->frequency == NODE_FREQUENCY_EXECUTED_ONCE
       && freq <= (ENTRY_BLOCK_PTR->frequency * 2 / 3))
     return false;
-  if (freq < BB_FREQ_MAX / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION))
+  if (freq < ENTRY_BLOCK_PTR->frequency / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION))
     return false;
   return true;
 }

diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index ce423e12d6e1a05642a80f2c1e465fef72cda940..841a1dd1dff7acecb356456e02351f5402d9c1e4 100644 (file)
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,10 @@
+2011-01-22  Jan Hubicka  <jh@suse.cz>
+
+       PR tree-optimization/43884
+       PR lto/44334
+       * gcc.dg/autopar/outer-2.c: Increase array size.
+       * gcc.dg/tree-ssa/ldist-pr45948.c: Update test.
+
 2011-01-22  Thomas Koenig  <tkoenig@gcc.gnu.org>
 
        PR fortran/38536

diff --git a/gcc/testsuite/gcc.dg/autopar/outer-2.c b/gcc/testsuite/gcc.dg/autopar/outer-2.c
index 351b3499e8984516db3d780ededeb8d1d9ce8687..b2e5159820365a5b41ee959be585554dbe142bdd 100644 (file)
--- a/gcc/testsuite/gcc.dg/autopar/outer-2.c
+++ b/gcc/testsuite/gcc.dg/autopar/outer-2.c
@@ -6,7 +6,7 @@ void abort (void);
 void parloop (int N)
 {
   int i, j,ii;
-  int x[400][10][400];
+  int x[401][10][401];
 
 for (ii = 0; ii < N; ii++)
   for (i = 0; i < N; i++)

diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ldist-pr45948.c b/gcc/testsuite/gcc.dg/tree-ssa/ldist-pr45948.c
index 3e467bdb05d22f9fed18100c4e0c8fa1e8b720d4..f0d07cc1781bf206173f173248e549ad3f5c10d3 100644 (file)
--- a/gcc/testsuite/gcc.dg/tree-ssa/ldist-pr45948.c
+++ b/gcc/testsuite/gcc.dg/tree-ssa/ldist-pr45948.c
@@ -18,6 +18,6 @@ foo (int i, int n)
 
 /* We should apply loop distribution and generate 2 memset (0).  */
 
-/* { dg-final { scan-tree-dump "distributed: split to 3" "ldist" } } */
+/* { dg-final { scan-tree-dump "distributed: split to 2" "ldist" } } */
 /* { dg-final { scan-tree-dump-times "__builtin_memset" 4 "ldist" } } */
 /* { dg-final { cleanup-tree-dump "ldist" } } */