| 1 |
#include <stdio.h> |
| 2 |
#include <stdlib.h> |
| 3 |
|
| 4 |
#ifndef GC_DEBUG |
| 5 |
# define GC_DEBUG |
| 6 |
#endif |
| 7 |
|
| 8 |
#include "gc.h" |
| 9 |
#include "gc_backptr.h" |
| 10 |
|
| 11 |
#define CHECK_OUT_OF_MEMORY(p) \ |
| 12 |
do { \ |
| 13 |
if (NULL == (p)) { \ |
| 14 |
fprintf(stderr, "Out of memory\n"); \ |
| 15 |
exit(69); \ |
| 16 |
} \ |
| 17 |
} while (0) |
| 18 |
|
| 19 |
struct treenode { |
| 20 |
struct treenode *x; |
| 21 |
struct treenode *y; |
| 22 |
} *root[10]; |
| 23 |
|
| 24 |
struct treenode * mktree(int i) { |
| 25 |
struct treenode * r = GC_NEW(struct treenode); |
| 26 |
struct treenode *x, *y; |
| 27 |
|
| 28 |
CHECK_OUT_OF_MEMORY(r); |
| 29 |
if (0 == i) |
| 30 |
return NULL; |
| 31 |
if (1 == i) { |
| 32 |
r = (struct treenode *)GC_MALLOC_ATOMIC(sizeof(struct treenode)); |
| 33 |
CHECK_OUT_OF_MEMORY(r); |
| 34 |
} |
| 35 |
x = mktree(i - 1); |
| 36 |
y = mktree(i - 1); |
| 37 |
r -> x = x; |
| 38 |
r -> y = y; |
| 39 |
if (i != 1) { |
| 40 |
GC_END_STUBBORN_CHANGE(r); |
| 41 |
GC_reachable_here(x); |
| 42 |
GC_reachable_here(y); |
| 43 |
} |
| 44 |
return r; |
| 45 |
} |
| 46 |
|
| 47 |
int main(void) |
| 48 |
{ |
| 49 |
int i; |
| 50 |
|
| 51 |
GC_INIT(); |
| 52 |
if (GC_get_find_leak()) |
| 53 |
printf("This test program is not designed for leak detection mode\n"); |
| 54 |
for (i = 0; i < 10; ++i) { |
| 55 |
root[i] = mktree(12); |
| 56 |
} |
| 57 |
GC_generate_random_backtrace(); |
| 58 |
GC_generate_random_backtrace(); |
| 59 |
GC_generate_random_backtrace(); |
| 60 |
GC_generate_random_backtrace(); |
| 61 |
return 0; |
| 62 |
} |