File: ssa-pre-31.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; haskell: 122
file content (46 lines) | stat: -rw-r--r-- 796 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
 
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-pre -fno-ipa-sra" } */

typedef struct {
    unsigned int key;
} S;
typedef struct s1  {
    unsigned int key;
    unsigned int bits;
    struct s1 *left, *right;
}S1;
extern S a[1024];
static inline int bar( S* p, S1* n )
{
  S1 *curr;
  S1 *next;

  if ( n->left == n )
    return (int)(p->key == n->key);

  curr = n;
  next = n->left;

  while (curr->bits > next->bits ) {
      curr = next;
      if (p->key & (1 << curr->bits))
	next = curr->right;
      else
	next = curr->left;
  }

  return (int)(p->key == next->key);

}

int foo (S1 *root, int N)
{
  volatile int r;
  int i,j;
  for (i=0; i<N; i++)
    for (j=0;j<1024; j++)
      r = bar(&a[j], root);
  return 0;
} 

/* { dg-final { scan-tree-dump-times "key" 3 "pre" } } */