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

re PR tree-optimization/43771 (ICE on valid when compiling ParMetis with gcc 4.5.0 and -O3) 

PR tree-optimization/43771
	* tree-vect-analyze.c (vect_supported_load_permutation_p): Check
	that load permutation doesn't have gaps.

From-SVN: r158504
This commit is contained in:
Ira Rosen 2010-04-19 06:17:56 +00:00 committed by Ira Rosen
parent 16f876ee37
commit eacbe066c4
4 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2010-04-19 Ira Rosen <irar@il.ibm.com>
PR tree-optimization/43771
* tree-vect-analyze.c (vect_supported_load_permutation_p): Check
that load permutation doesn't have gaps.
2010-04-18 Eric Botcazou <ebotcazou@adacore.com>
PR tree-optimization/43769

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
2010-04-19 Ira Rosen <irar@il.ibm.com>
PR tree-optimization/43771
* g++.dg/vect/pr43771.cc: New test.
2010-04-18 Eric Botcazou <ebotcazou@adacore.com>
* gnat.dg/rep_clause5.ad[sb]: New test.

14
gcc/testsuite/g++.dg/vect/pr43771.cc Normal file
View File

@ -0,0 +1,14 @@
/* { dg-do compile } */
void KWayNodeRefine__(int nparts, int *gpwgts, int *badminpwgt, int
*badmaxpwgt)
{
int i;
for (i=0; i<nparts; i+=2) {
badminpwgt[i] = badminpwgt[i+1] = gpwgts[i]+gpwgts[i+1];
badmaxpwgt[i] = badmaxpwgt[i+1] = gpwgts[i]+gpwgts[i+1];
}
}
/* { dg-final { cleanup-tree-dump "vect" } } */

4
gcc/tree-vect-analyze.c
View File

@ -3260,6 +3260,10 @@ vect_supported_load_permutation_p (slp_instance slp_instn, int group_size,
SET_BIT (load_index, prev);
}
for (j = 0; j < group_size; j++)
if (!TEST_BIT (load_index, j))
return false;
sbitmap_free (load_index);
if (supported && i == group_size * group_size