OpenCores
URL https://opencores.org/ocsvn/openrisc/openrisc/trunk

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-dev/] [or1k-gcc/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [slp-28.c] - Blame information for rev 749

Go to most recent revision | Details | Compare with Previous | View Log

Line No. Rev Author Line
1 689 jeremybenn 
/* { dg-require-effective-target vect_int } */
2 
 
3 
#include <stdarg.h>
4 
#include "tree-vect.h"
5 
 
6 
#define N 32
7 
 
8 
unsigned short in[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
9 
unsigned short in2[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
10 
unsigned short in3[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
11 
unsigned short check[N] = {0,1,2,3,5,6,7,8,10,11,12,13,15,16,17,18,20,21,22,23,25,26,27,28,30,31,32,33,35,36,37,38};
12 
unsigned short check3[N] = {0,1,2,3,4,5,6,7,8,9,10,11,5,6,7,8,9,10,11,12,13,14,15,16,10,11,12,13,14,15,16,17};
13 
 
14 
int
15 
main1 ()
16 
{
17 
  int i;
18 
 
19 
  for (i = 0; i < N/4; i++)
20 
    {
21 
      in[i*4] = in[i*4] + 5;
22 
      in[i*4 + 1] = in[i*4 + 1] + 5;
23 
      in[i*4 + 2] = in[i*4 + 2] + 5;
24 
      in[i*4 + 3] = in[i*4 + 3] + 5;
25 
 
26 
    }
27 
 
28 
  /* check results:  */
29 
  for (i = 0; i < N; i++)
30 
    {
31 
      if (in[i] != i+5)
32 
        abort ();
33 
    }
34 
 
35 
  /* Not vectorizable because of data dependencies.  */
36 
  for (i = 1; i < N/4; i++)
37 
    {
38 
      in2[i*4] = in2[(i-1)*4] + 5;
39 
      in2[i*4 + 1] = in2[(i-1)*4 + 1] + 5;
40 
      in2[i*4 + 2] = in2[(i-1)*4 + 2] + 5;
41 
      in2[i*4 + 3] = in2[(i-1)*4 + 3] + 5;
42 
 
43 
    }
44 
 
45 
  /* check results:  */
46 
  for (i = 4; i < N; i++)
47 
    {
48 
      if (in2[i] != check[i])
49 
        abort ();
50 
    }
51 
 
52 
  /* Not vectorizable because of data dependencies: distance 3 is greater than
53 
     the actual VF with SLP (2), but the analysis fail to detect that for now.  */
54 
  for (i = 3; i < N/4; i++)
55 
    {
56 
      in3[i*4] = in3[(i-3)*4] + 5;
57 
      in3[i*4 + 1] = in3[(i-3)*4 + 1] + 5;
58 
      in3[i*4 + 2] = in3[(i-3)*4 + 2] + 5;
59 
      in3[i*4 + 3] = in3[(i-3)*4 + 3] + 5;
60 
 
61 
    }
62 
 
63 
  /* check results:  */
64 
  for (i = 12; i < N; i++)
65 
    {
66 
      if (in3[i] != check3[i])
67 
        abort ();
68 
    }
69 
 
70 
 
71 
  return 0;
72 
}
73 
 
74 
int main (void)
75 
{
76 
  check_vect ();
77 
 
78 
  main1 ();
79 
 
80 
  return 0;
81 
}
82 
 
83 
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"  } } */
84 
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect"  } } */
85 
/* { dg-final { cleanup-tree-dump "vect" } } */
86 
 

powered by: WebSVN 2.1.0

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