blob: 262c92f1fa06b5441549bf35e5d1a3d306ffa57b (
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* PR tree-optimization/34244 */
/* { dg-do run } */
/* { dg-options "-O2 " } */
int __attribute__((noinline)) GetParent(void)
{
static int count = 0;
count++;
switch (count)
{
case 1:
case 3:
case 4:
return 1;
default:
return 0;
}
}
int __attribute__((noinline)) FindCommonAncestor(int aNode1, int aNode2)
{
if (aNode1 && aNode2) {
int offset = 0;
int anc1 = aNode1;
for (;;) {
++offset;
int parent = GetParent();
if (!parent)
break;
anc1 = parent;
}
int anc2 = aNode2;
for (;;) {
--offset;
int parent = GetParent();
if (!parent)
break;
anc2 = parent;
}
if (anc1 == anc2) {
anc1 = aNode1;
anc2 = aNode2;
while (offset > 0) {
anc1 = GetParent();
--offset;
}
while (offset < 0) {
anc2 = GetParent();
++offset;
}
while (anc1 != anc2) {
anc1 = GetParent();
anc2 = GetParent();
}
return anc1;
}
}
return 0;
}
extern void abort (void);
int main()
{
if (FindCommonAncestor (1, 1) != 0)
abort ();
return 0;
}
|
