URL
https://opencores.org/ocsvn/openrisc/openrisc/trunk
Only display areas with differences |
Details |
Blame |
View Log
Rev 298 |
Rev 338 |
/* { dg-require-effective-target vect_int_mult } */
|
/* { dg-require-effective-target vect_int_mult } */
|
|
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include <stdio.h>
|
#include <stdio.h>
|
#include "tree-vect.h"
|
#include "tree-vect.h"
|
|
|
#define K 4
|
#define K 4
|
|
|
int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
int in[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
int out[K];
|
int out[K];
|
int check_result[K] = {0,16,256,4096};
|
int check_result[K] = {0,16,256,4096};
|
|
|
__attribute__ ((noinline)) void
|
__attribute__ ((noinline)) void
|
foo ()
|
foo ()
|
{
|
{
|
int sum;
|
int sum;
|
int i, j, k;
|
int i, j, k;
|
|
|
for (k = 0; k < K; k++)
|
for (k = 0; k < K; k++)
|
{
|
{
|
sum = 1;
|
sum = 1;
|
for (j = 0; j < K; j++)
|
for (j = 0; j < K; j++)
|
for (i = 0; i < K; i++)
|
for (i = 0; i < K; i++)
|
sum *= in[i+k][j];
|
sum *= in[i+k][j];
|
out[k] = sum;
|
out[k] = sum;
|
}
|
}
|
}
|
}
|
|
|
int main ()
|
int main ()
|
{
|
{
|
int i, j, k;
|
int i, j, k;
|
|
|
check_vect ();
|
check_vect ();
|
|
|
for (i = 0; i < 2*K; i++)
|
for (i = 0; i < 2*K; i++)
|
for (j = 0; j < K; j++)
|
for (j = 0; j < K; j++)
|
in[i][j] = (i+2)/3;
|
in[i][j] = (i+2)/3;
|
|
|
foo();
|
foo();
|
|
|
for (k = 0; k < K; k++)
|
for (k = 0; k < K; k++)
|
if (out[k] != check_result[k])
|
if (out[k] != check_result[k])
|
abort ();
|
abort ();
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
|
|
|
|
© copyright 1999-2024
OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.