blob: 6a33b942ad558e88f1e28fe8b8df7388dae9c137 (
plain)
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" } } */
|