2001-05-21 08:39:23 +02:00
|
|
|
#include <stdio.h>
|
|
|
|
#define GC_DEBUG
|
|
|
|
#include "gc.h"
|
|
|
|
|
|
|
|
struct treenode {
|
|
|
|
struct treenode *x;
|
|
|
|
struct treenode *y;
|
|
|
|
} * root[10];
|
|
|
|
|
|
|
|
struct treenode * mktree(int i) {
|
|
|
|
struct treenode * r = GC_MALLOC(sizeof(struct treenode));
|
|
|
|
if (0 == i) return 0;
|
2004-08-14 01:05:36 +02:00
|
|
|
if (1 == i) r = GC_MALLOC_ATOMIC(sizeof(struct treenode));
|
2001-05-21 08:39:23 +02:00
|
|
|
r -> x = mktree(i-1);
|
|
|
|
r -> y = mktree(i-1);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2010-05-13 00:45:35 +02:00
|
|
|
int main()
|
2001-05-21 08:39:23 +02:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
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();
|
2010-05-13 00:45:35 +02:00
|
|
|
return 0;
|
2001-05-21 08:39:23 +02:00
|
|
|
}
|