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

Subversion Repositories openrisc_2011-10-31

[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.5.1/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [slp-3.c] - Blame information for rev 298

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 298 jeremybenn 
/* { dg-require-effective-target vect_int } */
2 
 
3 
#include <stdarg.h>
4 
#include <stdio.h>
5 
#include "tree-vect.h"
6 
 
7 
#define N 8
8 
 
9 
unsigned short in[N*8] = {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,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
10 
 
11 
int
12 
main1 ()
13 
{
14 
  int i;
15 
  unsigned short out[N*8];
16 
 
17 
  for (i = 0; i < N; i++)
18 
    {
19 
      out[i*8] = in[i*8];
20 
      out[i*8 + 1] = in[i*8 + 1];
21 
      out[i*8 + 2] = in[i*8 + 2];
22 
      out[i*8 + 3] = in[i*8 + 3];
23 
      out[i*8 + 4] = in[i*8 + 4];
24 
      out[i*8 + 5] = in[i*8 + 5];
25 
      out[i*8 + 6] = in[i*8 + 6];
26 
      out[i*8 + 7] = in[i*8 + 7];
27 
    }
28 
 
29 
  /* check results:  */
30 
  for (i = 0; i < N; i++)
31 
    {
32 
      if (out[i*8] !=  in[i*8]
33 
         || out[i*8 + 1] != in[i*8 + 1]
34 
         || out[i*8 + 2] != in[i*8 + 2]
35 
         || out[i*8 + 3] != in[i*8 + 3]
36 
         || out[i*8 + 4] != in[i*8 + 4]
37 
         || out[i*8 + 5] != in[i*8 + 5]
38 
         || out[i*8 + 6] != in[i*8 + 6]
39 
         || out[i*8 + 7] != in[i*8 + 7])
40 
        abort ();
41 
    }
42 
 
43 
  for (i = 0; i < N*2; i++)
44 
    {
45 
      out[i*4] = in[i*4];
46 
      out[i*4 + 1] = in[i*4 + 1];
47 
      out[i*4 + 2] = in[i*4 + 2];
48 
      out[i*4 + 3] = in[i*4 + 3];
49 
    }
50 
 
51 
  /* check results:  */
52 
  for (i = 0; i < N*2; i++)
53 
    {
54 
      if (out[i*4] !=  in[i*4]
55 
         || out[i*4 + 1] != in[i*4 + 1]
56 
         || out[i*4 + 2] != in[i*4 + 2]
57 
         || out[i*4 + 3] != in[i*4 + 3])
58 
        abort ();
59 
    }
60 
 
61 
  for (i = 0; i < N/2; i++)
62 
    {
63 
      out[i*16] = in[i*16];
64 
      out[i*16 + 1] = in[i*16 + 1];
65 
      out[i*16 + 2] = in[i*16 + 2];
66 
      out[i*16 + 3] = in[i*16 + 3];
67 
      out[i*16 + 4] = in[i*16 + 4];
68 
      out[i*16 + 5] = in[i*16 + 5];
69 
      out[i*16 + 6] = in[i*16 + 6];
70 
      out[i*16 + 7] = in[i*16 + 7];
71 
      out[i*16 + 8] = in[i*16 + 8];
72 
      out[i*16 + 9] = in[i*16 + 9];
73 
      out[i*16 + 10] = in[i*16 + 10];
74 
      out[i*16 + 11] = in[i*16 + 11];
75 
      out[i*16 + 12] = in[i*16 + 12];
76 
      out[i*16 + 13] = in[i*16 + 13];
77 
      out[i*16 + 14] = in[i*16 + 14];
78 
      out[i*16 + 15] = in[i*16 + 15];
79 
    }
80 
 
81 
  /* check results:  */
82 
  for (i = 0; i < N/2; i++)
83 
    {
84 
      if (out[i*16] !=  in[i*16]
85 
         || out[i*16 + 1] != in[i*16 + 1]
86 
         || out[i*16 + 2] != in[i*16 + 2]
87 
         || out[i*16 + 3] != in[i*16 + 3]
88 
         || out[i*16 + 4] != in[i*16 + 4]
89 
         || out[i*16 + 5] != in[i*16 + 5]
90 
         || out[i*16 + 6] != in[i*16 + 6]
91 
         || out[i*16 + 7] != in[i*16 + 7]
92 
         || out[i*16 + 8] != in[i*16 + 8]
93 
         || out[i*16 + 9] != in[i*16 + 9]
94 
         || out[i*16 + 10] != in[i*16 + 10]
95 
         || out[i*16 + 11] != in[i*16 + 11]
96 
         || out[i*16 + 12] != in[i*16 + 12]
97 
         || out[i*16 + 13] != in[i*16 + 13]
98 
         || out[i*16 + 14] != in[i*16 + 14]
99 
         || out[i*16 + 15] != in[i*16 + 15])
100 
        abort ();
101 
    }
102 
 
103 
  /* SLP with unrolling by 8.  */
104 
  for (i = 0; i < N/2; i++)
105 
    {
106 
      out[i*9] = in[i*9];
107 
      out[i*9 + 1] = in[i*9 + 1];
108 
      out[i*9 + 2] = in[i*9 + 2];
109 
      out[i*9 + 3] = in[i*9 + 3];
110 
      out[i*9 + 4] = in[i*9 + 4];
111 
      out[i*9 + 5] = in[i*9 + 5];
112 
      out[i*9 + 6] = in[i*9 + 6];
113 
      out[i*9 + 7] = in[i*9 + 7];
114 
      out[i*9 + 8] = in[i*9 + 8];
115 
    }
116 
 
117 
  /* check results:  */
118 
  for (i = 0; i < N/2; i++)
119 
    {
120 
      if (out[i*9] !=  in[i*9]
121 
         || out[i*9 + 1] != in[i*9 + 1]
122 
         || out[i*9 + 2] != in[i*9 + 2]
123 
         || out[i*9 + 3] != in[i*9 + 3]
124 
         || out[i*9 + 4] != in[i*9 + 4]
125 
         || out[i*9 + 5] != in[i*9 + 5]
126 
         || out[i*9 + 6] != in[i*9 + 6]
127 
         || out[i*9 + 7] != in[i*9 + 7]
128 
         || out[i*9 + 8] != in[i*9 + 8])
129 
        abort ();
130 
    }
131 
 
132 
 
133 
  return 0;
134 
}
135 
 
136 
int main (void)
137 
{
138 
  check_vect ();
139 
 
140 
  main1 ();
141 
 
142 
  return 0;
143 
}
144 
 
145 
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail vect_no_align } } } */
146 
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" { xfail vect_no_align } } } */
147 
/* { dg-final { cleanup-tree-dump "vect" } } */
148 
 

powered by: WebSVN 2.1.0

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