blob: 0196389d3a59a7d5b4f46fe8f14894648115a05e (
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
|
#include <stdlib.h>
#include "analyzer-decls.h"
extern int foo (int);
static int __attribute__((noinline))
do_stuff_2 (int *p, int n)
{
return 0;
}
/* As malloc-vs-local-2.c, but with a memory leak for the "on the heap case"
by not attempting to free at the end. */
int test_1 (int n)
{
int buf[10];
int *ptr;
int result;
if (n > 10)
ptr = (int *)malloc (sizeof (int) * n);
else
ptr = buf;
__analyzer_dump_exploded_nodes (0); /* { dg-warning "2 processed enodes" } */
{
int *p = ptr;
int sum = 0;
int i;
for (i = 0; i < n; i++)
p[i] = i; /* { dg-warning "dereference of possibly-NULL" } */
for (i = 0; i < n; i++)
sum += foo (p[i]); /* { dg-bogus "uninitialized" } */
result = sum;
}
__analyzer_dump_exploded_nodes (0); /* { dg-warning "2 processed enodes" } */
return result; /* { dg-message "leak of 'p'|leak of 'ptr'" } */
}
/* A simpler version of the above. */
int test_2 (int n)
{
int buf[10];
int *ptr;
int result;
if (n > 10)
ptr = (int *)malloc (sizeof (int) * n);
else
ptr = buf;
__analyzer_dump_exploded_nodes (0); /* { dg-warning "2 processed enodes" } */
result = do_stuff_2 (ptr, n);
__analyzer_dump_exploded_nodes (0); /* { dg-warning "2 processed enodes" } */
return result; /* { dg-message "leak of 'ptr'" } */
}
|
