Commit e8ff8c5a by Jan Hubicka Committed by Jan Hubicka

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
parent ccaed3ba
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.
......
......@@ -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;
}
......
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
......
......@@ -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++)
......
......@@ -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" } } */
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment