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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* Copyright (c) 2011 by Hewlett-Packard Company. All rights reserved.
*
* THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
* OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
*
* Permission is hereby granted to use or copy this program
* for any purpose, provided the above notices are retained on all copies.
* Permission to modify the code and to distribute modified code is granted,
* provided the above notices are retained, and a notice that the code was
* modified is included with the above copyright notice.
*
*/
#include <string.h>
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include "gc/gc_disclaim.h"
#define NOT_GCBUILD
#include "private/gc_priv.h"
#ifdef LINT2
# undef rand
static GC_RAND_STATE_T seed;
# define rand() GC_RAND_NEXT(&seed)
#endif
#define my_assert(e) \
if (!(e)) { \
fprintf(stderr, "Assertion failure, line %d: " #e "\n", __LINE__); \
exit(-1); \
}
static int free_count = 0;
struct testobj_s {
struct testobj_s *keep_link;
int i;
};
typedef struct testobj_s *testobj_t;
void GC_CALLBACK testobj_finalize(void *obj, void *carg)
{
++*(int *)carg;
my_assert(((testobj_t)obj)->i == 109);
((testobj_t)obj)->i = 110;
}
static const struct GC_finalizer_closure fclos = {
testobj_finalize,
&free_count
};
testobj_t testobj_new(int model)
{
testobj_t obj;
switch (model) {
# ifndef GC_NO_FINALIZATION
case 0:
obj = (struct testobj_s *)GC_malloc(sizeof(struct testobj_s));
if (obj != NULL)
GC_register_finalizer_no_order(obj, testobj_finalize,
&free_count, NULL, NULL);
break;
# endif
case 1:
obj = (testobj_t)GC_finalized_malloc(sizeof(struct testobj_s),
&fclos);
break;
case 2:
obj = (struct testobj_s *)GC_malloc(sizeof(struct testobj_s));
break;
default:
exit(-1);
}
if (obj == NULL) {
fprintf(stderr, "Out of memory!\n");
exit(3);
}
my_assert(obj->i == 0 && obj->keep_link == NULL);
obj->i = 109;
return obj;
}
#define ALLOC_CNT (2*1024*1024)
#define KEEP_CNT (32*1024)
static char const *model_str[3] = {
"regular finalization",
"finalize on reclaim",
"no finalization"
};
int main(int argc, char **argv)
{
int i;
int model, model_min, model_max;
testobj_t *keep_arr;
GC_INIT();
GC_init_finalized_malloc();
if (argc == 2 && strcmp(argv[1], "--help") == 0) {
fprintf(stderr,
"Usage: %s [FINALIZATION_MODEL]\n"
"\t0 -- original finalization\n"
"\t1 -- finalization on reclaim\n"
"\t2 -- no finalization\n", argv[0]);
return 1;
}
if (argc == 2) {
model_min = model_max = (int)COVERT_DATAFLOW(atoi(argv[1]));
if (model_min < 0 || model_max > 2)
exit(2);
} else {
# ifndef GC_NO_FINALIZATION
model_min = 0;
# else
model_min = 1;
# endif
model_max = 2;
}
if (GC_get_find_leak())
printf("This test program is not designed for leak detection mode\n");
keep_arr = (testobj_t *)GC_malloc(sizeof(void *) * KEEP_CNT);
if (NULL == keep_arr) {
fprintf(stderr, "Out of memory!\n");
exit(3);
}
printf("\t\t\tfin. ratio time/s time/fin.\n");
for (model = model_min; model <= model_max; ++model) {
double t = 0.0;
# ifndef NO_CLOCK
CLOCK_TYPE tI, tF;
GET_TIME(tI);
# endif
free_count = 0;
for (i = 0; i < ALLOC_CNT; ++i) {
int k = rand() % KEEP_CNT;
keep_arr[k] = testobj_new(model);
}
GC_gcollect();
# ifndef NO_CLOCK
GET_TIME(tF);
t = MS_TIME_DIFF(tF, tI)*1e-3;
# endif
if (model < 2 && free_count > 0)
printf("%20s: %12.4f %12g %12g\n", model_str[model],
free_count/(double)ALLOC_CNT, t, t/free_count);
else
printf("%20s: %12.4f %12g %12s\n",
model_str[model], 0.0, t, "N/A");
}
return 0;
}
|
