OpenCores
URL https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk

Subversion Repositories openrisc_2011-10-31

[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc2/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [vect-cond-6.c] - Diff between revs 298 and 384

Only display areas with differences | Details | Blame | View Log

Rev 298 Rev 384
/* { dg-require-effective-target vect_condition } */
/* { dg-require-effective-target vect_condition } */
 
 
#include <stdarg.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdio.h>
#include "tree-vect.h"
#include "tree-vect.h"
 
 
#define K 32
#define K 32
 
 
int cond_array[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int cond_array[2*K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int a[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int a[K][K] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int out[K];
int out[K];
 
 
__attribute__ ((noinline)) void
__attribute__ ((noinline)) void
foo (int c)
foo (int c)
{
{
  int res, i, j, k, next;
  int res, i, j, k, next;
 
 
  for (k = 0; k < K; k++)
  for (k = 0; k < K; k++)
    {
    {
      for (j = 0; j < K; j++)
      for (j = 0; j < K; j++)
        {
        {
          res = 0;
          res = 0;
          for (i = 0; i < K; i++)
          for (i = 0; i < K; i++)
            {
            {
              next = a[i][j];
              next = a[i][j];
              res = c > cond_array[i+k][j] ? next : res;
              res = c > cond_array[i+k][j] ? next : res;
            }
            }
 
 
          out[j] = res;
          out[j] = res;
        }
        }
    }
    }
}
}
 
 
int main ()
int main ()
{
{
  int i, j, k;
  int i, j, k;
 
 
  check_vect ();
  check_vect ();
 
 
  for  (j = 0; j < K; j++)
  for  (j = 0; j < K; j++)
    {
    {
      for (i = 0; i < 2*K; i++)
      for (i = 0; i < 2*K; i++)
        cond_array[i][j] = i+j;
        cond_array[i][j] = i+j;
 
 
      for (i = 0; i < K; i++)
      for (i = 0; i < K; i++)
        a[i][j] = i+2;
        a[i][j] = i+2;
    }
    }
 
 
  foo(125);
  foo(125);
 
 
  for (k = 0; k < K; k++)
  for (k = 0; k < K; k++)
    if (out[k] != 33)
    if (out[k] != 33)
      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" } } */
 
 
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.