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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
#include <stdlib.h>
#include "analyzer-decls.h"
/* Verify that ordering of writes doesn't matter when merging states. */
/* Test with locals. */
void test_1 (int flag)
{
int a, b;
if (flag)
{
a = 3;
b = 4;
}
else
{
b = 4;
a = 3;
}
__analyzer_dump_exploded_nodes (0); /* { dg-warning "1 processed enode" } */
__analyzer_eval (a == 3); /* { dg-warning "TRUE" } */
__analyzer_eval (b == 4); /* { dg-warning "TRUE" } */
}
/* Test with globals. */
int f, g, h;
void test_2 (int flag)
{
if (flag)
{
f = 3;
g = 4;
}
else
{
g = 4;
f = 3;
}
__analyzer_dump_exploded_nodes (0); /* { dg-warning "1 processed enode" } */
__analyzer_eval (f == 3); /* { dg-warning "TRUE" } */
__analyzer_eval (g == 4); /* { dg-warning "TRUE" } */
}
/* All 6 orderings of writes to 3 globals. */
void test_3 (int i)
{
switch (i)
{
default:
case 0:
f = 3;
g = 4;
h = 5;
break;
case 1:
f = 3;
h = 5;
g = 4;
break;
case 2:
g = 4;
f = 3;
h = 5;
break;
case 3:
g = 4;
h = 5;
f = 3;
break;
case 4:
h = 5;
f = 3;
g = 4;
break;
case 5:
h = 5;
g = 4;
f = 3;
break;
}
__analyzer_dump_exploded_nodes (0); /* { dg-warning "1 processed enode" } */
__analyzer_eval (f == 3); /* { dg-warning "TRUE" } */
__analyzer_eval (g == 4); /* { dg-warning "TRUE" } */
__analyzer_eval (h == 5); /* { dg-warning "TRUE" } */
}
void test_4 (int flag)
{
void *p, *q;
if (flag)
{
p = malloc (256);
q = malloc (256);
}
else
{
q = malloc (256);
p = malloc (256);
}
__analyzer_dump_exploded_nodes (0); /* { dg-warning "2 processed enode" } */
free (p);
free (q);
}
|
