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-7.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 int in[N*8]  __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {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 
unsigned short in2[N*16]  __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {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,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};
11 
 
12 
int
13 
main1 ()
14 
{
15 
  int i;
16 
  unsigned int out[N*8], ia[N*2];
17 
  unsigned short sa[N], out2[N*16];
18 
 
19 
  for (i = 0; i < N; i++)
20 
    {
21 
      out[i*8] = in[i*8] + 5;
22 
      out[i*8 + 1] = in[i*8 + 1] + 6;
23 
      out[i*8 + 2] = in[i*8 + 2] + 7;
24 
      out[i*8 + 3] = in[i*8 + 3] + 8;
25 
      out[i*8 + 4] = in[i*8 + 4] + 9;
26 
      out[i*8 + 5] = in[i*8 + 5] + 10;
27 
      out[i*8 + 6] = in[i*8 + 6] + 11;
28 
      out[i*8 + 7] = in[i*8 + 7] + 12;
29 
 
30 
      ia[i] = in[i];
31 
    }
32 
 
33 
  /* check results:  */
34 
  for (i = 0; i < N; i++)
35 
    {
36 
      if (out[i*8] !=  in[i*8] + 5
37 
         || out[i*8 + 1] != in[i*8 + 1] + 6
38 
         || out[i*8 + 2] != in[i*8 + 2] + 7
39 
         || out[i*8 + 3] != in[i*8 + 3] + 8
40 
         || out[i*8 + 4] != in[i*8 + 4] + 9
41 
         || out[i*8 + 5] != in[i*8 + 5] + 10
42 
         || out[i*8 + 6] != in[i*8 + 6] + 11
43 
         || out[i*8 + 7] != in[i*8 + 7] + 12
44 
         || ia[i] != in[i])
45 
        abort ();
46 
    }
47 
 
48 
  for (i = 0; i < N*2; i++)
49 
    {
50 
      out[i*4] = in[i*4] + 1;
51 
      out[i*4 + 1] = in[i*4 + 1] + 2;
52 
      out[i*4 + 2] = in[i*4 + 2] + 3;
53 
      out[i*4 + 3] = in[i*4 + 3] + 4;
54 
 
55 
      ia[i] = in[i];
56 
    }
57 
 
58 
  /* check results:  */
59 
  for (i = 0; i < N*2; i++)
60 
    {
61 
      if (out[i*4] !=  in[i*4] + 1
62 
         || out[i*4 + 1] != in[i*4 + 1] + 2
63 
         || out[i*4 + 2] != in[i*4 + 2] + 3
64 
         || out[i*4 + 3] != in[i*4 + 3] + 4
65 
         || ia[i] != in[i])
66 
        abort ();
67 
    }
68 
 
69 
  for (i = 0; i < N; i++)
70 
    {
71 
      out2[i*16] = in2[i*16] * 2;
72 
      out2[i*16 + 1] = in2[i*16 + 1] * 3;
73 
      out2[i*16 + 2] = in2[i*16 + 2] * 4;
74 
      out2[i*16 + 3] = in2[i*16 + 3] * 3;
75 
      out2[i*16 + 4] = in2[i*16 + 4] * 2;
76 
      out2[i*16 + 5] = in2[i*16 + 5] * 3;
77 
      out2[i*16 + 6] = in2[i*16 + 6] * 2;
78 
      out2[i*16 + 7] = in2[i*16 + 7] * 4;
79 
      out2[i*16 + 8] = in2[i*16 + 8] * 2;
80 
      out2[i*16 + 9] = in2[i*16 + 9] * 5;
81 
      out2[i*16 + 10] = in2[i*16 + 10] * 2;
82 
      out2[i*16 + 11] = in2[i*16 + 11] * 3;
83 
      out2[i*16 + 12] = in2[i*16 + 12] * 4;
84 
      out2[i*16 + 13] = in2[i*16 + 13] * 4;
85 
      out2[i*16 + 14] = in2[i*16 + 14] * 3;
86 
      out2[i*16 + 15] = in2[i*16 + 15] * 2;
87 
    }
88 
 
89 
  /* check results:  */
90 
  for (i = 0; i < N; i++)
91 
    {
92 
      if (out2[i*16] !=  in2[i*16] * 2
93 
         || out2[i*16 + 1] != in2[i*16 + 1] * 3
94 
         || out2[i*16 + 2] != in2[i*16 + 2] * 4
95 
         || out2[i*16 + 3] != in2[i*16 + 3] * 3
96 
         || out2[i*16 + 4] != in2[i*16 + 4] * 2
97 
         || out2[i*16 + 5] != in2[i*16 + 5] * 3
98 
         || out2[i*16 + 6] != in2[i*16 + 6] * 2
99 
         || out2[i*16 + 7] != in2[i*16 + 7] * 4
100 
         || out2[i*16 + 8] != in2[i*16 + 8] * 2
101 
         || out2[i*16 + 9] != in2[i*16 + 9] * 5
102 
         || out2[i*16 + 10] != in2[i*16 + 10] * 2
103 
         || out2[i*16 + 11] != in2[i*16 + 11] * 3
104 
         || out2[i*16 + 12] != in2[i*16 + 12] * 4
105 
         || out2[i*16 + 13] != in2[i*16 + 13] * 4
106 
         || out2[i*16 + 14] != in2[i*16 + 14] * 3
107 
         || out2[i*16 + 15] != in2[i*16 + 15] * 2)
108 
        abort ();
109 
    }
110 
 
111 
 
112 
  return 0;
113 
}
114 
 
115 
int main (void)
116 
{
117 
  check_vect ();
118 
 
119 
  main1 ();
120 
 
121 
  return 0;
122 
}
123 
 
124 
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect"  { target vect_short_mult } } }*/
125 
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect"  { target { ! { vect_short_mult } } } } }*/
126 
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect"  { target vect_short_mult } } } */
127 
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect"  { target { ! { vect_short_mult } } } } } */
128 
/* { dg-final { cleanup-tree-dump "vect" } } */
129 
 

powered by: WebSVN 2.1.0

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