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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
|
/* Copyright (C) 2012, 2013, 2014 Free Software Foundation, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation; either version 3 of
* the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#include <fcntl.h>
#include <full-write.h>
#include "libguile/bdw-gc.h"
#include "libguile/_scm.h"
#include "libguile/finalizers.h"
#include "libguile/gc.h"
#include "libguile/threads.h"
static int automatic_finalization_p = 1;
static size_t finalization_count;
void
scm_i_set_finalizer (void *obj, scm_t_finalizer_proc proc, void *data)
{
GC_finalization_proc prev;
void *prev_data;
GC_REGISTER_FINALIZER_NO_ORDER (obj, proc, data, &prev, &prev_data);
}
struct scm_t_chained_finalizer
{
int resuscitating_p;
scm_t_finalizer_proc proc;
void *data;
scm_t_finalizer_proc prev;
void *prev_data;
};
static void
chained_finalizer (void *obj, void *data)
{
struct scm_t_chained_finalizer *chained_data = data;
if (chained_data->resuscitating_p)
{
if (chained_data->prev)
scm_i_set_finalizer (obj, chained_data->prev, chained_data->prev_data);
chained_data->proc (obj, chained_data->data);
}
else
{
chained_data->proc (obj, chained_data->data);
if (chained_data->prev)
chained_data->prev (obj, chained_data->prev_data);
}
}
void
scm_i_add_resuscitator (void *obj, scm_t_finalizer_proc proc, void *data)
{
struct scm_t_chained_finalizer *chained_data;
chained_data = scm_gc_malloc (sizeof (*chained_data), "chained finalizer");
chained_data->resuscitating_p = 1;
chained_data->proc = proc;
chained_data->data = data;
GC_REGISTER_FINALIZER_NO_ORDER (obj, chained_finalizer, chained_data,
&chained_data->prev,
&chained_data->prev_data);
}
static void
shuffle_resuscitators_to_front (struct scm_t_chained_finalizer *cd)
{
while (cd->prev == chained_finalizer)
{
struct scm_t_chained_finalizer *prev = cd->prev_data;
scm_t_finalizer_proc proc = cd->proc;
void *data = cd->data;
if (!prev->resuscitating_p)
break;
cd->resuscitating_p = 1;
cd->proc = prev->proc;
cd->data = prev->data;
prev->resuscitating_p = 0;
prev->proc = proc;
prev->data = data;
cd = prev;
}
}
void
scm_i_add_finalizer (void *obj, scm_t_finalizer_proc proc, void *data)
{
struct scm_t_chained_finalizer *chained_data;
chained_data = scm_gc_malloc (sizeof (*chained_data), "chained finalizer");
chained_data->resuscitating_p = 0;
chained_data->proc = proc;
chained_data->data = data;
GC_REGISTER_FINALIZER_NO_ORDER (obj, chained_finalizer, chained_data,
&chained_data->prev,
&chained_data->prev_data);
shuffle_resuscitators_to_front (chained_data);
}
static SCM finalizer_async_cell;
static SCM
run_finalizers_async_thunk (void)
{
scm_run_finalizers ();
return SCM_UNSPECIFIED;
}
/* The function queue_finalizer_async is run by the GC when there are
* objects to finalize. It will enqueue an asynchronous call to
* GC_invoke_finalizers() at the next SCM_TICK in this thread.
*/
static void
queue_finalizer_async (void)
{
scm_i_thread *t = SCM_I_CURRENT_THREAD;
static scm_i_pthread_mutex_t lock = SCM_I_PTHREAD_MUTEX_INITIALIZER;
scm_i_pthread_mutex_lock (&lock);
/* If t is NULL, that could be because we're allocating in
threads.c:guilify_self_1. In that case, rely on the
GC_invoke_finalizers call there after the thread spins up. */
if (t && scm_is_false (SCM_CDR (finalizer_async_cell)))
{
SCM_SETCDR (finalizer_async_cell, t->active_asyncs);
t->active_asyncs = finalizer_async_cell;
t->pending_asyncs = 1;
}
scm_i_pthread_mutex_unlock (&lock);
}
#if SCM_USE_PTHREAD_THREADS
static int finalization_pipe[2];
static scm_i_pthread_mutex_t finalization_thread_lock =
SCM_I_PTHREAD_MUTEX_INITIALIZER;
static pthread_t finalization_thread;
static int finalization_thread_is_running = 0;
static void
notify_finalizers_to_run (void)
{
char byte = 0;
full_write (finalization_pipe[1], &byte, 1);
}
static void
notify_about_to_fork (void)
{
char byte = 1;
full_write (finalization_pipe[1], &byte, 1);
}
struct finalization_pipe_data
{
char byte;
ssize_t n;
int err;
};
static void*
read_finalization_pipe_data (void *data)
{
struct finalization_pipe_data *fdata = data;
fdata->n = read (finalization_pipe[0], &fdata->byte, 1);
fdata->err = errno;
return NULL;
}
static void*
finalization_thread_proc (void *unused)
{
while (1)
{
struct finalization_pipe_data data;
scm_without_guile (read_finalization_pipe_data, &data);
if (data.n <= 0 && data.err != EINTR)
{
perror ("error in finalization thread");
return NULL;
}
switch (data.byte)
{
case 0:
scm_run_finalizers ();
break;
case 1:
return NULL;
default:
abort ();
}
}
}
static void*
run_finalization_thread (void *arg)
{
return scm_with_guile (finalization_thread_proc, arg);
}
static void
start_finalization_thread (void)
{
scm_i_pthread_mutex_lock (&finalization_thread_lock);
if (!finalization_thread_is_running)
{
/* Use the raw pthread API and scm_with_guile, because we don't want
to block on any lock that scm_spawn_thread might want to take,
and we don't want to inherit the dynamic state (fluids) of the
caller. */
if (pthread_create (&finalization_thread, NULL,
run_finalization_thread, NULL))
perror ("error creating finalization thread");
else
finalization_thread_is_running = 1;
}
scm_i_pthread_mutex_unlock (&finalization_thread_lock);
}
static void
stop_finalization_thread (void)
{
scm_i_pthread_mutex_lock (&finalization_thread_lock);
if (finalization_thread_is_running)
{
notify_about_to_fork ();
if (pthread_join (finalization_thread, NULL))
perror ("joining finalization thread");
finalization_thread_is_running = 0;
}
scm_i_pthread_mutex_unlock (&finalization_thread_lock);
}
static void
spawn_finalizer_thread (void)
{
GC_set_finalizer_notifier (notify_finalizers_to_run);
start_finalization_thread ();
}
#endif /* SCM_USE_PTHREAD_THREADS */
void
scm_i_finalizer_pre_fork (void)
{
#if SCM_USE_PTHREAD_THREADS
if (automatic_finalization_p)
{
stop_finalization_thread ();
GC_set_finalizer_notifier (spawn_finalizer_thread);
}
#endif
}
static void*
weak_pointer_ref (void *weak_pointer)
{
return *(void **) weak_pointer;
}
static void
weak_gc_finalizer (void *ptr, void *data)
{
void **weak = ptr;
void *val;
void (*callback) (SCM) = weak[1];
val = GC_call_with_alloc_lock (weak_pointer_ref, &weak[0]);
if (!val)
return;
callback (SCM_PACK_POINTER (val));
scm_i_set_finalizer (ptr, weak_gc_finalizer, data);
}
/* CALLBACK will be called on OBJ, as long as OBJ is accessible. It
will be called from a finalizer, which may be from an async or from
another thread.
As an implementation detail, the way this works is that we allocate
a fresh pointer-less object holding two words. We know that this
object should get collected the next time GC is run, so we attach a
finalizer to it so that we get a callback after GC happens.
The first word of the object holds a weak reference to OBJ, and the
second holds the callback pointer. When the callback is called, we
check if the weak reference on OBJ still holds. If it doesn't hold,
then OBJ is no longer accessible, and we're done. Otherwise we call
the callback and re-register a finalizer for our two-word GC object,
effectively resuscitating the object so that we will get a callback
on the next GC.
We could use the scm_after_gc_hook, but using a finalizer has the
advantage of potentially running in another thread, decreasing pause
time. */
void
scm_i_register_weak_gc_callback (SCM obj, void (*callback) (SCM))
{
void **weak = GC_MALLOC_ATOMIC (sizeof (void*) * 2);
weak[0] = SCM_UNPACK_POINTER (obj);
weak[1] = (void*)callback;
GC_GENERAL_REGISTER_DISAPPEARING_LINK (weak, SCM2PTR (obj));
scm_i_set_finalizer (weak, weak_gc_finalizer, NULL);
}
int
scm_set_automatic_finalization_enabled (int enabled_p)
{
int was_enabled_p = automatic_finalization_p;
if (enabled_p == was_enabled_p)
return was_enabled_p;
if (!scm_initialized_p)
{
automatic_finalization_p = enabled_p;
return was_enabled_p;
}
if (enabled_p)
{
#if SCM_USE_PTHREAD_THREADS
if (pipe2 (finalization_pipe, O_CLOEXEC) != 0)
scm_syserror (NULL);
GC_set_finalizer_notifier (spawn_finalizer_thread);
#else
GC_set_finalizer_notifier (queue_finalizer_async);
#endif
}
else
{
GC_set_finalizer_notifier (0);
#if SCM_USE_PTHREAD_THREADS
stop_finalization_thread ();
close (finalization_pipe[0]);
close (finalization_pipe[1]);
finalization_pipe[0] = -1;
finalization_pipe[1] = -1;
#endif
}
automatic_finalization_p = enabled_p;
return was_enabled_p;
}
int
scm_run_finalizers (void)
{
int finalized = GC_invoke_finalizers ();
finalization_count += finalized;
return finalized;
}
void
scm_init_finalizers (void)
{
/* When the async is to run, the cdr of the pair gets set to the
asyncs queue of the current thread. */
finalizer_async_cell =
scm_cons (scm_c_make_gsubr ("%run-finalizers", 0, 0, 0,
run_finalizers_async_thunk),
SCM_BOOL_F);
if (automatic_finalization_p)
GC_set_finalizer_notifier (queue_finalizer_async);
}
void
scm_init_finalizer_thread (void)
{
#if SCM_USE_PTHREAD_THREADS
if (automatic_finalization_p)
{
if (pipe2 (finalization_pipe, O_CLOEXEC) != 0)
scm_syserror (NULL);
GC_set_finalizer_notifier (spawn_finalizer_thread);
}
#endif
}
|