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
|
#include <stdio.h>
#include <stdlib.h>
#ifndef GC_DEBUG
# define GC_DEBUG
#endif
#include "gc.h"
#include "gc_backptr.h"
#define CHECK_OUT_OF_MEMORY(p) \
do { \
if (NULL == (p)) { \
fprintf(stderr, "Out of memory\n"); \
exit(69); \
} \
} while (0)
struct treenode {
struct treenode *x;
struct treenode *y;
} *root[10];
struct treenode * mktree(int i) {
struct treenode * r = GC_NEW(struct treenode);
struct treenode *x, *y;
CHECK_OUT_OF_MEMORY(r);
if (0 == i)
return NULL;
if (1 == i) {
r = (struct treenode *)GC_MALLOC_ATOMIC(sizeof(struct treenode));
CHECK_OUT_OF_MEMORY(r);
}
x = mktree(i - 1);
y = mktree(i - 1);
r -> x = x;
r -> y = y;
if (i != 1) {
GC_END_STUBBORN_CHANGE(r);
GC_reachable_here(x);
GC_reachable_here(y);
}
return r;
}
int main(void)
{
int i;
GC_INIT();
if (GC_get_find_leak())
printf("This test program is not designed for leak detection mode\n");
for (i = 0; i < 10; ++i) {
root[i] = mktree(12);
}
GC_generate_random_backtrace();
GC_generate_random_backtrace();
GC_generate_random_backtrace();
GC_generate_random_backtrace();
return 0;
}
|
