PR target/36510
* gcc.dg/vect/costmodel/ppc/costmodel-vect-31d.c: Change the loop
bound.
* gcc.dg/vect/costmodel/ppc/costmodel-vect-76c.c,
gcc.dg/vect/costmodel/ppc/costmodel-vect-68d.c: Likewise.
From-SVN: r137140
+2008-06-26 Ira Rosen <irar@il.ibm.com>
+
+ PR target/36510
+ * gcc.dg/vect/costmodel/ppc/costmodel-vect-31d.c: Change the loop
+ bound.
+ * gcc.dg/vect/costmodel/ppc/costmodel-vect-76c.c,
+ gcc.dg/vect/costmodel/ppc/costmodel-vect-68d.c: Likewise.
+
2008-06-25 Paul Thomas <pault@gcc.gnu.org>
PR fortran/36526
#include <stdarg.h>
#include "../../tree-vect.h"
-#define N 32
+#define N 5
struct t{
int k[N];
struct t d; /* aligned (offset 2NB) */
struct t e; /* unaligned (offset 2N+4N+4 B) */
};
-
+
int main1 ()
{
int i;
struct s tmp;
/* unaligned */
- for (i = 0; i < N/2; i++)
+ for (i = 0; i < N; i++)
{
tmp.e.k[i] = 8;
}
/* check results: */
- for (i = 0; i <N/2; i++)
+ for (i = 0; i < N; i++)
{
if (tmp.e.k[i] != 8)
abort ();
#include <stdarg.h>
#include "../../tree-vect.h"
-#define N 20
+#define N 11
struct s{
int m;
#include <stdarg.h>
#include "../../tree-vect.h"
-#define N 8
+#define N 32
#define OFF 4
/* Check handling of accesses for which the "initial condition" -