OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR middle-end/27733 (Large compile time regression)

Browse Source 
2006-06-08  Paolo Bonzini  <bonzini@gnu.org>

	PR middle-end/27733
	* expmed.c (struct alg_hash_entry): Fix type of field T
	to match synth_mult argument.
	(NUM_ALG_HASH_ENTRIES): Make it bigger for 64-bit HOST_WIDE_INT.

From-SVN: r114488
This commit is contained in:
Paolo Bonzini 2006-06-08 15:40:48 +00:00 committed by Paolo Bonzini
parent 313ab5ee9c
commit 33b881ca3a
2 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -1,3 +1,10 @@
2006-06-08 Paolo Bonzini <bonzini@gnu.org>
PR middle-end/27733
* expmed.c (struct alg_hash_entry): Fix type of field T
to match synth_mult argument.
(NUM_ALG_HASH_ENTRIES): Make it bigger for 64-bit HOST_WIDE_INT.
2006-06-08 Maxim Kuvyrkov <mkuvyrkov@ispras.ru> 2006-06-08 Maxim Kuvyrkov <mkuvyrkov@ispras.ru>
PR target/27863 PR target/27863

6
gcc/expmed.c
View File

@ -2395,7 +2395,7 @@ struct algorithm
/* The entry for our multiplication cache/hash table. */ /* The entry for our multiplication cache/hash table. */
struct alg_hash_entry { struct alg_hash_entry {
/* The number we are multiplying by. */ /* The number we are multiplying by. */
unsigned int t; unsigned HOST_WIDE_INT t;
/* The mode in which we are multiplying something by T. */ /* The mode in which we are multiplying something by T. */
enum machine_mode mode; enum machine_mode mode;
@ -2410,7 +2410,11 @@ struct alg_hash_entry {
}; };
/* The number of cache/hash entries. */ /* The number of cache/hash entries. */
#if HOST_BITS_PER_WIDE_INT == 64
#define NUM_ALG_HASH_ENTRIES 1031
#else
#define NUM_ALG_HASH_ENTRIES 307 #define NUM_ALG_HASH_ENTRIES 307
#endif
/* Each entry of ALG_HASH caches alg_code for some integer. This is /* Each entry of ALG_HASH caches alg_code for some integer. This is
actually a hash table. If we have a collision, that the older actually a hash table. If we have a collision, that the older