File: loop-interchange-15.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A8-2019-q3-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 571,828 kB
  • sloc: ansic: 2,937,651; cpp: 881,644; ada: 597,189; makefile: 65,528; asm: 56,499; xml: 46,621; exp: 24,747; sh: 19,684; python: 7,256; pascal: 4,370; awk: 3,497; perl: 2,695; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (55 lines) | stat: -rw-r--r-- 1,029 bytes parent folder | download | duplicates (4) 
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
 
/* PR tree-optimization/83337 */
/* { dg-do run { target int32plus } } */
/* { dg-options "-O2 -floop-interchange" } */
/* { dg-require-effective-target alloca }  */
/* { dg-skip-if "too big stack" { visium-*-* } } */

/* Copied from graphite/interchange-5.c */

#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif

#define N 100
#define M 1111

extern void abort ();

static void __attribute__((noipa))
foo (int n)
{
  int i, j;
  struct S { char d[n]; int a : 3; int b : 17; int c : 12; };
  struct S A[N][M];

  for (i = 0; i < N; i++)
    {
      asm volatile ("" : : "g" (&A[0][0]) : "memory");
      for (j = 0; j < M; j++)
	A[i][j].b = 2;
    }
  asm volatile ("" : : "g" (&A[0][0]) : "memory");

  for (i = 0; i < M; i++)
    for (j = 0; j < N; j++)
      A[j][i].b = 5 * A[j][i].b;

  asm volatile ("" : : "g" (&A[0][0]) : "memory");
  int res = A[0][0].b + A[N-1][M-1].b;

#if DEBUG
  fprintf (stderr, "res = %d \n", res);
#endif

  if (res != 20)
    abort ();
}

int
main (void)
{
  foo (1);
  foo (8);
  return 0;
}