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

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-dev/] [or1k-gcc/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [no-section-anchors-vect-31.c] - Blame information for rev 801

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


/* { dg-require-effective-target vect_int } */
 
#include <stdarg.h>
#include "tree-vect.h"
 
#define N 64
 
struct t{
  int k[N];
  int l;
};
 
struct s{
  char a;       /* aligned */
  char b[N-1];  /* unaligned (offset 1B) */
  char c[N];    /* aligned (offset NB) */
  struct t d;   /* aligned (offset 2NB) */
  struct t e;   /* unaligned (offset 2N+4N+4 B) */
};
 
struct s tmp;
__attribute__ ((noinline))
int main1 ()
{
  int i;
 
  /* unaligned */
  for (i = 0; i < N/2; i++)
    {
      tmp.b[i] = 5;
    }
 
  /* check results:  */
  for (i = 0; i <N/2; i++)
    {
      if (tmp.b[i] != 5)
        abort ();
    }
 
  /* aligned */
  for (i = 0; i < N/2; i++)
    {
      tmp.c[i] = 6;
    }
 
  /* check results:  */
  for (i = 0; i <N/2; i++)
    {
      if (tmp.c[i] != 6)
        abort ();
    }
 
  /* aligned */
  for (i = 0; i < N/2; i++)
    {
      tmp.d.k[i] = 7;
    }
 
  /* check results:  */
  for (i = 0; i <N/2; i++)
    {
      if (tmp.d.k[i] != 7)
        abort ();
    }
 
  /* unaligned */
  for (i = 0; i < N/2; i++)
    {
      tmp.e.k[i] = 8;
    }
 
  /* check results:  */
  for (i = 0; i <N/2; i++)
    {
      if (tmp.e.k[i] != 8)
        abort ();
    }
 
  return 0;
}
 
int main (void)
{
  check_vect ();
 
  return main1 ();
}
 
/* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */

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 64`
7
8			`struct t{`
9			`int k[N];`
10			`int l;`
11			`};`
12
13			`struct s{`
14			`char a; /* aligned */`
15			`char b[N-1]; /* unaligned (offset 1B) */`
16			`char c[N]; /* aligned (offset NB) */`
17			`struct t d; /* aligned (offset 2NB) */`
18			`struct t e; /* unaligned (offset 2N+4N+4 B) */`
19			`};`
20
21			`struct s tmp;`
22			`__attribute__ ((noinline))`
23			`int main1 ()`
24			`{`
25			`int i;`
26
27			`/* unaligned */`
28			`for (i = 0; i < N/2; i++)`
29			`{`
30			`tmp.b[i] = 5;`
31			`}`
32
33			`/* check results: */`
34			`for (i = 0; i <N/2; i++)`
35			`{`
36			`if (tmp.b[i] != 5)`
37			`abort ();`
38			`}`
39
40			`/* aligned */`
41			`for (i = 0; i < N/2; i++)`
42			`{`
43			`tmp.c[i] = 6;`
44			`}`
45
46			`/* check results: */`
47			`for (i = 0; i <N/2; i++)`
48			`{`
49			`if (tmp.c[i] != 6)`
50			`abort ();`
51			`}`
52
53			`/* aligned */`
54			`for (i = 0; i < N/2; i++)`
55			`{`
56			`tmp.d.k[i] = 7;`
57			`}`
58
59			`/* check results: */`
60			`for (i = 0; i <N/2; i++)`
61			`{`
62			`if (tmp.d.k[i] != 7)`
63			`abort ();`
64			`}`
65
66			`/* unaligned */`
67			`for (i = 0; i < N/2; i++)`
68			`{`
69			`tmp.e.k[i] = 8;`
70			`}`
71
72			`/* check results: */`
73			`for (i = 0; i <N/2; i++)`
74			`{`
75			`if (tmp.e.k[i] != 8)`
76			`abort ();`
77			`}`
78
79			`return 0;`
80			`}`
81
82			`int main (void)`
83			`{`
84			`check_vect ();`
85
86			`return main1 ();`
87			`}`
88
89			`/* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */`
90			`/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */`
91			`/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" } } */`
92			`/* { dg-final { cleanup-tree-dump "vect" } } */`

Browse

Tools

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-dev/] [or1k-gcc/] [gcc/] [testsuite/] [gcc.dg/] [vect/] [no-section-anchors-vect-31.c] - Blame information for rev 801