1 /* Copyright (C) 1995,1996,1997,1998,2000,2001 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
45 #include "libguile/validate.h"
46 #include "libguile/coop-threads.h"
47 #include "libguile/root.h"
49 /* A counter of the current number of threads */
50 size_t scm_thread_count
= 0;
52 /* This is included rather than compiled separately in order
53 to simplify the configuration mechanism. */
54 #include "libguile/coop.c"
56 /* A count-down counter used to determine when to switch
58 size_t scm_switch_counter
= SCM_THREAD_SWITCH_COUNT
;
60 coop_m scm_critical_section_mutex
;
63 scm_threads_init (SCM_STACKITEM
*i
)
69 #ifndef GUILE_PTHREAD_COMPAT
70 coop_global_main
.sto
= i
;
72 coop_global_main
.base
= i
;
73 coop_global_curr
= &coop_global_main
;
74 coop_all_qput (&coop_global_allq
, coop_global_curr
);
76 coop_mutex_init (&scm_critical_section_mutex
);
78 coop_global_main
.data
= 0; /* Initialized in init.c */
82 scm_threads_mark_stacks (void)
86 for (thread
= coop_global_allq
.t
.all_next
;
87 thread
!= NULL
; thread
= thread
->all_next
)
89 if (thread
== coop_global_curr
)
92 /* stack_len is long rather than sizet in order to guarantee
93 that &stack_len is long aligned */
95 long stack_len
= ((SCM_STACKITEM
*) (&thread
) -
96 (SCM_STACKITEM
*) thread
->base
);
98 /* Protect from the C stack. This must be the first marking
99 * done because it provides information about what objects
100 * are "in-use" by the C code. "in-use" objects are those
101 * for which the information about length and base address must
102 * remain usable. This requirement is stricter than a liveness
103 * requirement -- in particular, it constrains the implementation
106 SCM_FLUSH_REGISTER_WINDOWS
;
107 /* This assumes that all registers are saved into the jmp_buf */
108 setjmp (scm_save_regs_gc_mark
);
109 scm_mark_locations ((SCM_STACKITEM
*) scm_save_regs_gc_mark
,
110 ((size_t) sizeof scm_save_regs_gc_mark
111 / sizeof (SCM_STACKITEM
)));
113 scm_mark_locations (((size_t) thread
->base
,
116 long stack_len
= ((SCM_STACKITEM
*) thread
->base
-
117 (SCM_STACKITEM
*) (&thread
));
119 /* Protect from the C stack. This must be the first marking
120 * done because it provides information about what objects
121 * are "in-use" by the C code. "in-use" objects are those
122 * for which the information about length and base address must
123 * remain usable. This requirement is stricter than a liveness
124 * requirement -- in particular, it constrains the implementation
127 SCM_FLUSH_REGISTER_WINDOWS
;
128 /* This assumes that all registers are saved into the jmp_buf */
129 setjmp (scm_save_regs_gc_mark
);
130 scm_mark_locations ((SCM_STACKITEM
*) scm_save_regs_gc_mark
,
131 ((size_t) sizeof scm_save_regs_gc_mark
132 / sizeof (SCM_STACKITEM
)));
134 scm_mark_locations ((SCM_STACKITEM
*) &thread
,
140 /* Suspended thread */
141 #ifdef STACK_GROWS_UP
142 long stack_len
= ((SCM_STACKITEM
*) (thread
->sp
) -
143 (SCM_STACKITEM
*) thread
->base
);
145 scm_mark_locations ((size_t)thread
->base
,
148 long stack_len
= ((SCM_STACKITEM
*) thread
->base
-
149 (SCM_STACKITEM
*) (thread
->sp
));
151 /* Registers are already on the stack. No need to mark. */
153 scm_mark_locations ((SCM_STACKITEM
*) (size_t)thread
->sp
,
158 /* Mark this thread's root */
159 scm_gc_mark (((scm_root_state
*) thread
->data
) -> handle
);
163 /* NOTE: There are TWO mechanisms for starting a thread: The first one
164 is used when spawning a thread from Scheme, while the second one is
167 It might be argued that the first should be implemented in terms of
168 the second. The reason it isn't is that that would require an
169 extra unnecessary malloc (the thread_args structure). By providing
170 one pair of extra functions (c_launch_thread, scm_spawn_thread) the
171 Scheme threads are started more efficiently. */
173 /* This is the first thread spawning mechanism: threads from Scheme */
175 typedef struct scheme_launch_data
{
179 } scheme_launch_data
;
182 scheme_body_bootstrip (scheme_launch_data
* data
)
184 /* First save the new root continuation */
185 data
->rootcont
= scm_root
->rootcont
;
186 return scm_call_0 (data
->body
);
190 scheme_handler_bootstrip (scheme_launch_data
* data
, SCM tag
, SCM throw_args
)
192 scm_root
->rootcont
= data
->rootcont
;
193 return scm_apply_1 (data
->handler
, tag
, throw_args
);
197 scheme_launch_thread (void *p
)
199 /* The thread object will be GC protected by being a member of the
200 list given as argument to launch_thread. It will be marked
201 during the conservative sweep of the stack. */
202 register SCM argl
= (SCM
) p
;
203 SCM thread
= SCM_CAR (argl
);
204 scheme_launch_data data
;
205 data
.rootcont
= SCM_BOOL_F
;
206 data
.body
= SCM_CADR (argl
);
207 data
.handler
= SCM_CADDR (argl
);
208 scm_internal_cwdr ((scm_t_catch_body
) scheme_body_bootstrip
,
210 (scm_t_catch_handler
) scheme_handler_bootstrip
,
212 (SCM_STACKITEM
*) &thread
);
213 SCM_SET_CELL_WORD_1 (thread
, 0);
220 scm_call_with_new_thread (SCM argl
)
221 #define FUNC_NAME s_call_with_new_thread
225 /* Check arguments. */
227 register SCM args
= argl
;
229 if (!SCM_CONSP (args
))
230 SCM_WRONG_NUM_ARGS ();
231 thunk
= SCM_CAR (args
);
232 SCM_ASSERT (SCM_NFALSEP (scm_thunk_p (thunk
)),
235 s_call_with_new_thread
);
236 args
= SCM_CDR (args
);
237 if (!SCM_CONSP (args
))
238 SCM_WRONG_NUM_ARGS ();
239 handler
= SCM_CAR (args
);
240 SCM_ASSERT (SCM_NFALSEP (scm_procedure_p (handler
)),
243 s_call_with_new_thread
);
244 if (!SCM_NULLP (SCM_CDR (args
)))
245 SCM_WRONG_NUM_ARGS ();
248 /* Make new thread. */
253 /* Unwind wind chain. */
254 old_winds
= scm_dynwinds
;
255 scm_dowinds (SCM_EOL
, scm_ilength (scm_root
->dynwinds
));
257 /* Allocate thread locals. */
258 root
= scm_make_root (scm_root
->handle
);
260 thread
= scm_alloc_cell (scm_tc16_thread
, 0);
262 argl
= scm_cons (thread
, argl
);
263 /* Note that we couldn't pass a pointer to argl as data since the
264 argl variable may not exist in memory when the thread starts. */
265 t
= coop_create (scheme_launch_thread
, (void *) argl
);
266 t
->data
= SCM_ROOT_STATE (root
);
267 SCM_SET_CELL_WORD_1 (thread
, (scm_t_bits
) t
);
269 /* Note that the following statement also could cause coop_yield.*/
272 /* We're now ready for the thread to begin. */
275 /* Return to old dynamic context. */
276 scm_dowinds (old_winds
, - scm_ilength (old_winds
));
284 /* This is the second thread spawning mechanism: threads from C */
286 typedef struct c_launch_data
{
291 scm_t_catch_body body
;
293 scm_t_catch_handler handler
;
298 c_body_bootstrip (c_launch_data
* data
)
300 /* First save the new root continuation */
301 data
->u
.rootcont
= scm_root
->rootcont
;
302 return (data
->body
) (data
->body_data
);
306 c_handler_bootstrip (c_launch_data
* data
, SCM tag
, SCM throw_args
)
308 scm_root
->rootcont
= data
->u
.rootcont
;
309 return (data
->handler
) (data
->handler_data
, tag
, throw_args
);
313 c_launch_thread (void *p
)
315 register c_launch_data
*data
= (c_launch_data
*) p
;
316 /* The thread object will be GC protected by being on this stack */
317 SCM thread
= data
->u
.thread
;
318 /* We must use the address of `thread', otherwise the compiler will
319 optimize it away. This is OK since the longest SCM_STACKITEM
321 scm_internal_cwdr ((scm_t_catch_body
) c_body_bootstrip
,
323 (scm_t_catch_handler
) c_handler_bootstrip
,
325 (SCM_STACKITEM
*) &thread
);
327 free ((char *) data
);
331 scm_spawn_thread (scm_t_catch_body body
, void *body_data
,
332 scm_t_catch_handler handler
, void *handler_data
)
337 c_launch_data
*data
= (c_launch_data
*) scm_malloc (sizeof (*data
));
339 /* Unwind wind chain. */
340 old_winds
= scm_dynwinds
;
341 scm_dowinds (SCM_EOL
, scm_ilength (scm_root
->dynwinds
));
343 /* Allocate thread locals. */
344 root
= scm_make_root (scm_root
->handle
);
346 thread
= scm_alloc_cell (scm_tc16_thread
, 0);
349 data
->u
.thread
= thread
;
351 data
->body_data
= body_data
;
352 data
->handler
= handler
;
353 data
->handler_data
= handler_data
;
355 t
= coop_create (c_launch_thread
, (void *) data
);
357 t
->data
= SCM_ROOT_STATE (root
);
358 SCM_SET_CELL_WORD_1 (thread
, (scm_t_bits
) t
);
360 /* Note that the following statement also could cause coop_yield.*/
363 /* We're now ready for the thread to begin. */
366 /* Return to old dynamic context. */
367 scm_dowinds (old_winds
, - scm_ilength (old_winds
));
373 scm_join_thread (SCM thread
)
374 #define FUNC_NAME s_join_thread
377 SCM_VALIDATE_THREAD (1, thread
);
378 /* Dirk:FIXME:: SCM_THREAD_DATA is a handle for a thread. It may be that a
379 * certain thread implementation uses a value of 0 as a valid thread handle.
380 * With the following code, this thread would always be considered finished.
382 /* Dirk:FIXME:: With preemptive threading, a thread may finish immediately
383 * after SCM_THREAD_DATA is read. Thus, it must be guaranteed that the
384 * handle remains valid until the thread-object is garbage collected, or
385 * a mutex has to be used for reading and modifying SCM_THREAD_DATA.
387 thread_data
= SCM_THREAD_DATA (thread
);
389 /* The thread is still alive */
390 coop_join (thread_data
);
399 scm_switch_counter
= SCM_THREAD_SWITCH_COUNT
;
406 scm_single_thread_p (void)
408 return (coop_global_runq
.tail
== &coop_global_runq
.t
414 scm_make_mutex (void)
416 SCM m
= scm_make_smob (scm_tc16_mutex
);
417 coop_mutex_init (SCM_MUTEX_DATA (m
));
422 scm_lock_mutex (SCM m
)
424 SCM_ASSERT (SCM_MUTEXP (m
), m
, SCM_ARG1
, s_lock_mutex
);
425 coop_mutex_lock (SCM_MUTEX_DATA (m
));
430 scm_unlock_mutex (SCM m
)
432 SCM_ASSERT (SCM_MUTEXP (m
), m
, SCM_ARG1
, s_unlock_mutex
);
433 coop_mutex_unlock(SCM_MUTEX_DATA (m
));
436 scm_switch_counter
= SCM_THREAD_SWITCH_COUNT
;
443 scm_make_condition_variable (void)
445 SCM c
= scm_make_smob (scm_tc16_condvar
);
446 coop_condition_variable_init (SCM_CONDVAR_DATA (c
));
451 scm_wait_condition_variable (SCM c
, SCM m
)
453 SCM_ASSERT (SCM_CONDVARP (c
),
456 s_wait_condition_variable
);
457 SCM_ASSERT (SCM_MUTEXP (m
),
460 s_wait_condition_variable
);
461 coop_condition_variable_wait_mutex (SCM_CONDVAR_DATA (c
),
467 scm_signal_condition_variable (SCM c
)
469 SCM_ASSERT (SCM_CONDVARP (c
),
472 s_signal_condition_variable
);
473 coop_condition_variable_signal (SCM_CONDVAR_DATA (c
));