blob: 02b55726a99b578d52c9b72ae57605ebd873fdcd (
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
|
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-optimized" } */
void test2(void)
{
int *p = __builtin_malloc (sizeof (int) * 4);
if (p == (void *)0)
__builtin_abort ();
__builtin_free (p);
}
void test5(int b)
{
int *p = __builtin_malloc (sizeof (int) * 4);
if (p)
__builtin_free (p);
}
void test6(void)
{
int *p = __builtin_malloc (sizeof (int) * 4);
if (p == (void *)0)
__builtin_abort ();
if (p)
__builtin_free (p);
}
/* We should be able to remove all malloc/free pairs with CDDCE.
Assume p was non-NULL for test2.
For test5, it doesn't matter if p is NULL or non-NULL. */
/* { dg-final { scan-tree-dump-times "free" 0 "optimized" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "malloc" 0 "optimized" { xfail *-*-* } } } */
/* But make sure we don't partially optimize for now. */
/* { dg-final { scan-tree-dump-times "free" 3 "optimized" } } */
/* { dg-final { scan-tree-dump-times "malloc" 3 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
