cominterop: Free IMarshal interface with the CCW.
[mono-project.git] / libgc / pthread_support.c
blobccafb3b1169e96fa6847a794ea4b01d1421ba8b1
1 /*
2 * Copyright (c) 1994 by Xerox Corporation. All rights reserved.
3 * Copyright (c) 1996 by Silicon Graphics. All rights reserved.
4 * Copyright (c) 1998 by Fergus Henderson. All rights reserved.
5 * Copyright (c) 2000-2004 by Hewlett-Packard Company. All rights reserved.
7 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
8 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
10 * Permission is hereby granted to use or copy this program
11 * for any purpose, provided the above notices are retained on all copies.
12 * Permission to modify the code and to distribute modified code is granted,
13 * provided the above notices are retained, and a notice that the code was
14 * modified is included with the above copyright notice.
17 * Support code for LinuxThreads, the clone()-based kernel
18 * thread package for Linux which is included in libc6.
20 * This code relies on implementation details of LinuxThreads,
21 * (i.e. properties not guaranteed by the Pthread standard),
22 * though this version now does less of that than the other Pthreads
23 * support code.
25 * Note that there is a lot of code duplication between linux_threads.c
26 * and thread support for some of the other Posix platforms; any changes
27 * made here may need to be reflected there too.
29 /* DG/UX ix86 support <takis@xfree86.org> */
31 * Linux_threads.c now also includes some code to support HPUX and
32 * OSF1 (Compaq Tru64 Unix, really). The OSF1 support is based on Eric Benson's
33 * patch.
35 * Eric also suggested an alternate basis for a lock implementation in
36 * his code:
37 * + #elif defined(OSF1)
38 * + unsigned long GC_allocate_lock = 0;
39 * + msemaphore GC_allocate_semaphore;
40 * + # define GC_TRY_LOCK() \
41 * + ((msem_lock(&GC_allocate_semaphore, MSEM_IF_NOWAIT) == 0) \
42 * + ? (GC_allocate_lock = 1) \
43 * + : 0)
44 * + # define GC_LOCK_TAKEN GC_allocate_lock
47 /*#define DEBUG_THREADS 1*/
48 /*#define GC_ASSERTIONS*/
50 # include "private/pthread_support.h"
52 # if defined(GC_PTHREADS) && !defined(GC_SOLARIS_THREADS) \
53 && !defined(GC_WIN32_THREADS)
55 # if defined(GC_HPUX_THREADS) && !defined(USE_PTHREAD_SPECIFIC) \
56 && !defined(USE_COMPILER_TLS)
57 # ifdef __GNUC__
58 # define USE_PTHREAD_SPECIFIC
59 /* Empirically, as of gcc 3.3, USE_COMPILER_TLS doesn't work. */
60 # else
61 # define USE_COMPILER_TLS
62 # endif
63 # endif
65 # if defined USE_HPUX_TLS
66 --> Macro replaced by USE_COMPILER_TLS
67 # endif
69 #ifndef USE_COMPILER_TLS
70 # if (defined(GC_DGUX386_THREADS) || defined(GC_OSF1_THREADS) || \
71 defined(GC_DARWIN_THREADS) || defined(GC_AIX_THREADS)) || \
72 defined(GC_NETBSD_THREADS) && !defined(USE_PTHREAD_SPECIFIC) || \
73 defined(GC_FREEBSD_THREADS) && !defined(USE_PTHREAD_SPECIFIC) || \
74 defined(GC_OPENBSD_THREADS)
75 # define USE_PTHREAD_SPECIFIC
76 # endif
77 #endif
79 # if defined(GC_DGUX386_THREADS) && !defined(_POSIX4A_DRAFT10_SOURCE)
80 # define _POSIX4A_DRAFT10_SOURCE 1
81 # endif
83 # if defined(GC_DGUX386_THREADS) && !defined(_USING_POSIX4A_DRAFT10)
84 # define _USING_POSIX4A_DRAFT10 1
85 # endif
87 # ifdef THREAD_LOCAL_ALLOC
88 # if !defined(USE_PTHREAD_SPECIFIC) && !defined(USE_COMPILER_TLS)
89 # include "private/specific.h"
90 # endif
92 /* Note that these macros should be used only to get/set the GC_thread pointer.
93 * We need to use both tls and pthread because we use the pthread_create function hook to
94 * free the data for foreign threads. When that doesn't happen, libgc could have old
95 * pthread_t that get reused...
97 # if defined(USE_PTHREAD_SPECIFIC)
98 # define GC_getspecific pthread_getspecific
99 # define GC_setspecific pthread_setspecific
100 # define GC_key_create pthread_key_create
101 typedef pthread_key_t GC_key_t;
102 # endif
103 # if defined(USE_COMPILER_TLS)
104 /* Note sles9 gcc on powerpc gets confused by the define to set GC_thread_tls and pthread_setspecific
105 * so we actually use a static inline function decalred below that is equivalent to:
106 * define GC_setspecific(key, v) (GC_thread_tls = (v), pthread_setspecific ((key), (v)))
108 # define GC_getspecific(x) (GC_thread_tls)
109 # define GC_key_create pthread_key_create
110 typedef pthread_key_t GC_key_t;
111 # endif
112 # endif
113 # include <stdlib.h>
114 # include <pthread.h>
115 # include <sched.h>
116 # include <time.h>
117 # include <errno.h>
118 # include <unistd.h>
119 # include <sys/mman.h>
120 # include <sys/time.h>
121 # include <sys/types.h>
122 # include <sys/stat.h>
123 # include <fcntl.h>
124 # include <signal.h>
126 #if defined(GC_DARWIN_THREADS)
127 # include "private/darwin_semaphore.h"
128 #else
129 # include <semaphore.h>
130 #endif /* !GC_DARWIN_THREADS */
132 #if defined(GC_DARWIN_THREADS) || defined(GC_FREEBSD_THREADS)
133 # include <sys/sysctl.h>
134 #endif /* GC_DARWIN_THREADS */
136 #if defined(GC_NETBSD_THREADS) || defined(GC_OPENBSD_THREADS)
137 # include <sys/param.h>
138 # include <sys/sysctl.h>
139 #endif
143 #if defined(GC_DGUX386_THREADS)
144 # include <sys/dg_sys_info.h>
145 # include <sys/_int_psem.h>
146 /* sem_t is an uint in DG/UX */
147 typedef unsigned int sem_t;
148 #endif /* GC_DGUX386_THREADS */
150 #ifndef __GNUC__
151 # define __inline__
152 #endif
154 #ifdef GC_USE_LD_WRAP
155 # define WRAP_FUNC(f) __wrap_##f
156 # define REAL_FUNC(f) __real_##f
157 #else
158 # define WRAP_FUNC(f) GC_##f
159 # if !defined(GC_DGUX386_THREADS)
160 # define REAL_FUNC(f) f
161 # else /* GC_DGUX386_THREADS */
162 # define REAL_FUNC(f) __d10_##f
163 # endif /* GC_DGUX386_THREADS */
164 # undef pthread_create
165 # if !defined(GC_DARWIN_THREADS)
166 # undef pthread_sigmask
167 # endif
168 # undef pthread_join
169 # undef pthread_detach
170 # if defined(NACL)
171 # undef pthread_exit
172 # endif
173 # if defined(GC_OSF1_THREADS) && defined(_PTHREAD_USE_MANGLED_NAMES_) \
174 && !defined(_PTHREAD_USE_PTDNAM_)
175 /* Restore the original mangled names on Tru64 UNIX. */
176 # define pthread_create __pthread_create
177 # define pthread_join __pthread_join
178 # define pthread_detach __pthread_detach
179 # endif
180 #endif
182 void GC_thr_init();
184 static GC_bool parallel_initialized = FALSE;
186 void GC_init_parallel();
188 static pthread_t main_pthread_self;
189 static void *main_stack, *main_altstack;
190 static int main_stack_size, main_altstack_size;
192 # if defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
194 /* We don't really support thread-local allocation with DBG_HDRS_ALL */
196 /* work around a dlopen issue (bug #75390), undefs to avoid warnings with redefinitions */
197 #undef PACKAGE_BUGREPORT
198 #undef PACKAGE_NAME
199 #undef PACKAGE_STRING
200 #undef PACKAGE_TARNAME
201 #undef PACKAGE_VERSION
202 #include "mono/utils/mono-compiler.h"
204 static
205 GC_key_t GC_thread_key;
207 #ifdef USE_COMPILER_TLS
208 __thread MONO_TLS_FAST void* GC_thread_tls;
211 * gcc errors out with /tmp/ccdPMFuq.s:2994: Error: symbol `.LTLS4' is already defined
212 * if the inline is added on powerpc
214 #if !defined(__ppc__) && !defined(__powerpc__)
215 inline
216 #endif
217 static int GC_setspecific (GC_key_t key, void *value) {
218 GC_thread_tls = value;
219 return pthread_setspecific (key, value);
221 #endif
223 static GC_bool keys_initialized;
225 #ifdef MONO_DEBUGGER_SUPPORTED
226 #include "include/libgc-mono-debugger.h"
227 #endif
229 /* Recover the contents of the freelist array fl into the global one gfl.*/
230 /* Note that the indexing scheme differs, in that gfl has finer size */
231 /* resolution, even if not all entries are used. */
232 /* We hold the allocator lock. */
233 static void return_freelists(ptr_t *fl, ptr_t *gfl)
235 int i;
236 ptr_t q, *qptr;
237 size_t nwords;
239 for (i = 1; i < NFREELISTS; ++i) {
240 nwords = i * (GRANULARITY/sizeof(word));
241 qptr = fl + i;
242 q = *qptr;
243 if ((word)q >= HBLKSIZE) {
244 if (gfl[nwords] == 0) {
245 gfl[nwords] = q;
246 } else {
247 /* Concatenate: */
248 for (; (word)q >= HBLKSIZE; qptr = &(obj_link(q)), q = *qptr);
249 GC_ASSERT(0 == q);
250 *qptr = gfl[nwords];
251 gfl[nwords] = fl[i];
254 /* Clear fl[i], since the thread structure may hang around. */
255 /* Do it in a way that is likely to trap if we access it. */
256 fl[i] = (ptr_t)HBLKSIZE;
260 /* We statically allocate a single "size 0" object. It is linked to */
261 /* itself, and is thus repeatedly reused for all size 0 allocation */
262 /* requests. (Size 0 gcj allocation requests are incorrect, and */
263 /* we arrange for those to fault asap.) */
264 static ptr_t size_zero_object = (ptr_t)(&size_zero_object);
266 void GC_delete_gc_thread(pthread_t id, GC_thread gct);
267 void GC_destroy_thread_local(GC_thread p);
269 void GC_thread_deregister_foreign (void *data)
271 GC_thread me = (GC_thread)data;
272 /* GC_fprintf1( "\n\n\n\n --- Deregister %x ---\n\n\n\n\n", me->flags ); */
273 if (me -> flags & FOREIGN_THREAD) {
274 LOCK();
275 /* GC_fprintf0( "\n\n\n\n --- FOO ---\n\n\n\n\n" ); */
276 #if defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
277 GC_destroy_thread_local (me);
278 #endif
279 GC_delete_gc_thread(me->id, me);
280 UNLOCK();
284 /* Each thread structure must be initialized. */
285 /* This call must be made from the new thread. */
286 /* Caller holds allocation lock. */
287 void GC_init_thread_local(GC_thread p)
289 int i;
291 if (!keys_initialized) {
292 if (0 != GC_key_create(&GC_thread_key, GC_thread_deregister_foreign)) {
293 ABORT("Failed to create key for local allocator");
295 keys_initialized = TRUE;
297 if (0 != GC_setspecific(GC_thread_key, p)) {
298 ABORT("Failed to set thread specific allocation pointers");
300 for (i = 1; i < NFREELISTS; ++i) {
301 p -> ptrfree_freelists[i] = (ptr_t)1;
302 p -> normal_freelists[i] = (ptr_t)1;
303 # ifdef GC_GCJ_SUPPORT
304 p -> gcj_freelists[i] = (ptr_t)1;
305 # endif
307 /* Set up the size 0 free lists. */
308 p -> ptrfree_freelists[0] = (ptr_t)(&size_zero_object);
309 p -> normal_freelists[0] = (ptr_t)(&size_zero_object);
310 # ifdef GC_GCJ_SUPPORT
311 p -> gcj_freelists[0] = (ptr_t)(-1);
312 # endif
315 #ifdef GC_GCJ_SUPPORT
316 extern ptr_t * GC_gcjobjfreelist;
317 #endif
319 /* We hold the allocator lock. */
320 void GC_destroy_thread_local(GC_thread p)
322 /* We currently only do this from the thread itself or from */
323 /* the fork handler for a child process. */
324 # ifndef HANDLE_FORK
325 GC_ASSERT(GC_getspecific(GC_thread_key) == (void *)p);
326 # endif
327 return_freelists(p -> ptrfree_freelists, GC_aobjfreelist);
328 return_freelists(p -> normal_freelists, GC_objfreelist);
329 # ifdef GC_GCJ_SUPPORT
330 return_freelists(p -> gcj_freelists, GC_gcjobjfreelist);
331 # endif
334 extern GC_PTR GC_generic_malloc_many();
336 GC_PTR GC_local_malloc(size_t bytes)
338 if (EXPECT(!SMALL_ENOUGH(bytes),0)) {
339 return(GC_malloc(bytes));
340 } else {
341 int index = INDEX_FROM_BYTES(bytes);
342 ptr_t * my_fl;
343 ptr_t my_entry;
344 # if defined(REDIRECT_MALLOC) && !defined(USE_PTHREAD_SPECIFIC)
345 GC_key_t k = GC_thread_key;
346 # endif
347 void * tsd;
349 # if defined(REDIRECT_MALLOC) && !defined(USE_PTHREAD_SPECIFIC)
350 if (EXPECT(0 == k, 0)) {
351 /* This can happen if we get called when the world is */
352 /* being initialized. Whether we can actually complete */
353 /* the initialization then is unclear. */
354 GC_init_parallel();
355 k = GC_thread_key;
357 # endif
358 tsd = GC_getspecific(GC_thread_key);
359 # ifdef GC_ASSERTIONS
360 LOCK();
361 GC_ASSERT(tsd == (void *)GC_lookup_thread(pthread_self()));
362 UNLOCK();
363 # endif
364 my_fl = ((GC_thread)tsd) -> normal_freelists + index;
365 my_entry = *my_fl;
366 if (EXPECT((word)my_entry >= HBLKSIZE, 1)) {
367 ptr_t next = obj_link(my_entry);
368 GC_PTR result = (GC_PTR)my_entry;
369 *my_fl = next;
370 obj_link(my_entry) = 0;
371 PREFETCH_FOR_WRITE(next);
372 return result;
373 } else if ((word)my_entry - 1 < DIRECT_GRANULES) {
374 *my_fl = my_entry + index + 1;
375 return GC_malloc(bytes);
376 } else {
377 GC_generic_malloc_many(BYTES_FROM_INDEX(index), NORMAL, my_fl);
378 if (*my_fl == 0) return GC_oom_fn(bytes);
379 return GC_local_malloc(bytes);
384 GC_PTR GC_local_malloc_atomic(size_t bytes)
386 if (EXPECT(!SMALL_ENOUGH(bytes), 0)) {
387 return(GC_malloc_atomic(bytes));
388 } else {
389 int index = INDEX_FROM_BYTES(bytes);
390 ptr_t * my_fl = ((GC_thread)GC_getspecific(GC_thread_key))
391 -> ptrfree_freelists + index;
392 ptr_t my_entry = *my_fl;
394 if (EXPECT((word)my_entry >= HBLKSIZE, 1)) {
395 GC_PTR result = (GC_PTR)my_entry;
396 *my_fl = obj_link(my_entry);
397 return result;
398 } else if ((word)my_entry - 1 < DIRECT_GRANULES) {
399 *my_fl = my_entry + index + 1;
400 return GC_malloc_atomic(bytes);
401 } else {
402 GC_generic_malloc_many(BYTES_FROM_INDEX(index), PTRFREE, my_fl);
403 /* *my_fl is updated while the collector is excluded; */
404 /* the free list is always visible to the collector as */
405 /* such. */
406 if (*my_fl == 0) return GC_oom_fn(bytes);
407 return GC_local_malloc_atomic(bytes);
412 #ifdef GC_GCJ_SUPPORT
414 #include "include/gc_gcj.h"
416 #ifdef GC_ASSERTIONS
417 extern GC_bool GC_gcj_malloc_initialized;
418 #endif
420 extern int GC_gcj_kind;
422 GC_PTR GC_local_gcj_malloc(size_t bytes,
423 void * ptr_to_struct_containing_descr)
425 GC_ASSERT(GC_gcj_malloc_initialized);
426 if (EXPECT(!SMALL_ENOUGH(bytes), 0)) {
427 return GC_gcj_malloc(bytes, ptr_to_struct_containing_descr);
428 } else {
429 int index = INDEX_FROM_BYTES(bytes);
430 ptr_t * my_fl = ((GC_thread)GC_getspecific(GC_thread_key))
431 -> gcj_freelists + index;
432 ptr_t my_entry = *my_fl;
433 if (EXPECT((word)my_entry >= HBLKSIZE, 1)) {
434 GC_PTR result = (GC_PTR)my_entry;
435 GC_ASSERT(!GC_incremental);
436 /* We assert that any concurrent marker will stop us. */
437 /* Thus it is impossible for a mark procedure to see the */
438 /* allocation of the next object, but to see this object */
439 /* still containing a free list pointer. Otherwise the */
440 /* marker might find a random "mark descriptor". */
441 *(volatile ptr_t *)my_fl = obj_link(my_entry);
442 /* We must update the freelist before we store the pointer. */
443 /* Otherwise a GC at this point would see a corrupted */
444 /* free list. */
445 /* A memory barrier is probably never needed, since the */
446 /* action of stopping this thread will cause prior writes */
447 /* to complete. */
448 GC_ASSERT(((void * volatile *)result)[1] == 0);
449 *(void * volatile *)result = ptr_to_struct_containing_descr;
450 return result;
451 } else if ((word)my_entry - 1 < DIRECT_GRANULES) {
452 if (!GC_incremental) *my_fl = my_entry + index + 1;
453 /* In the incremental case, we always have to take this */
454 /* path. Thus we leave the counter alone. */
455 return GC_gcj_malloc(bytes, ptr_to_struct_containing_descr);
456 } else {
457 GC_generic_malloc_many(BYTES_FROM_INDEX(index), GC_gcj_kind, my_fl);
458 if (*my_fl == 0) return GC_oom_fn(bytes);
459 return GC_local_gcj_malloc(bytes, ptr_to_struct_containing_descr);
464 /* Similar to GC_local_gcj_malloc, but the size is in words, and we don't */
465 /* adjust it. The size is assumed to be such that it can be */
466 /* allocated as a small object. */
467 void * GC_local_gcj_fast_malloc(size_t lw, void * ptr_to_struct_containing_descr)
469 ptr_t * my_fl = ((GC_thread)GC_getspecific(GC_thread_key))
470 -> gcj_freelists + lw;
471 ptr_t my_entry = *my_fl;
473 GC_ASSERT(GC_gcj_malloc_initialized);
475 if (EXPECT((word)my_entry >= HBLKSIZE, 1)) {
476 GC_PTR result = (GC_PTR)my_entry;
477 GC_ASSERT(!GC_incremental);
478 /* We assert that any concurrent marker will stop us. */
479 /* Thus it is impossible for a mark procedure to see the */
480 /* allocation of the next object, but to see this object */
481 /* still containing a free list pointer. Otherwise the */
482 /* marker might find a random "mark descriptor". */
483 *(volatile ptr_t *)my_fl = obj_link(my_entry);
484 /* We must update the freelist before we store the pointer. */
485 /* Otherwise a GC at this point would see a corrupted */
486 /* free list. */
487 /* A memory barrier is probably never needed, since the */
488 /* action of stopping this thread will cause prior writes */
489 /* to complete. */
490 GC_ASSERT(((void * volatile *)result)[1] == 0);
491 *(void * volatile *)result = ptr_to_struct_containing_descr;
492 return result;
493 } else if ((word)my_entry - 1 < DIRECT_GRANULES) {
494 if (!GC_incremental) *my_fl = my_entry + lw + 1;
495 /* In the incremental case, we always have to take this */
496 /* path. Thus we leave the counter alone. */
497 return GC_gcj_fast_malloc(lw, ptr_to_struct_containing_descr);
498 } else {
499 GC_generic_malloc_many(BYTES_FROM_INDEX(lw), GC_gcj_kind, my_fl);
500 if (*my_fl == 0) return GC_oom_fn(BYTES_FROM_INDEX(lw));
501 return GC_local_gcj_fast_malloc(lw, ptr_to_struct_containing_descr);
505 #endif /* GC_GCJ_SUPPORT */
507 # else /* !THREAD_LOCAL_ALLOC && !DBG_HDRS_ALL */
509 # define GC_destroy_thread_local(t)
511 # endif /* !THREAD_LOCAL_ALLOC */
513 #if 0
515 To make sure that we're using LinuxThreads and not some other thread
516 package, we generate a dummy reference to `pthread_kill_other_threads_np'
517 (was `__pthread_initial_thread_bos' but that disappeared),
518 which is a symbol defined in LinuxThreads, but (hopefully) not in other
519 thread packages.
521 We no longer do this, since this code is now portable enough that it might
522 actually work for something else.
524 void (*dummy_var_to_force_linux_threads)() = pthread_kill_other_threads_np;
525 #endif /* 0 */
527 long GC_nprocs = 1; /* Number of processors. We may not have */
528 /* access to all of them, but this is as good */
529 /* a guess as any ... */
531 #ifdef PARALLEL_MARK
533 # ifndef MAX_MARKERS
534 # define MAX_MARKERS 16
535 # endif
537 static ptr_t marker_sp[MAX_MARKERS] = {0};
539 void * GC_mark_thread(void * id)
541 word my_mark_no = 0;
543 marker_sp[(word)id] = GC_approx_sp();
544 for (;; ++my_mark_no) {
545 /* GC_mark_no is passed only to allow GC_help_marker to terminate */
546 /* promptly. This is important if it were called from the signal */
547 /* handler or from the GC lock acquisition code. Under Linux, it's */
548 /* not safe to call it from a signal handler, since it uses mutexes */
549 /* and condition variables. Since it is called only here, the */
550 /* argument is unnecessary. */
551 if (my_mark_no < GC_mark_no || my_mark_no > GC_mark_no + 2) {
552 /* resynchronize if we get far off, e.g. because GC_mark_no */
553 /* wrapped. */
554 my_mark_no = GC_mark_no;
556 # ifdef DEBUG_THREADS
557 GC_printf1("Starting mark helper for mark number %ld\n", my_mark_no);
558 # endif
559 GC_help_marker(my_mark_no);
563 extern long GC_markers; /* Number of mark threads we would */
564 /* like to have. Includes the */
565 /* initiating thread. */
567 pthread_t GC_mark_threads[MAX_MARKERS];
569 #define PTHREAD_CREATE REAL_FUNC(pthread_create)
571 static void start_mark_threads()
573 unsigned i;
574 pthread_attr_t attr;
576 if (GC_markers > MAX_MARKERS) {
577 WARN("Limiting number of mark threads\n", 0);
578 GC_markers = MAX_MARKERS;
580 if (0 != pthread_attr_init(&attr)) ABORT("pthread_attr_init failed");
582 if (0 != pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED))
583 ABORT("pthread_attr_setdetachstate failed");
585 # if defined(HPUX) || defined(GC_DGUX386_THREADS)
586 /* Default stack size is usually too small: fix it. */
587 /* Otherwise marker threads or GC may run out of */
588 /* space. */
589 # define MIN_STACK_SIZE (8*HBLKSIZE*sizeof(word))
591 size_t old_size;
592 int code;
594 if (pthread_attr_getstacksize(&attr, &old_size) != 0)
595 ABORT("pthread_attr_getstacksize failed\n");
596 if (old_size < MIN_STACK_SIZE) {
597 if (pthread_attr_setstacksize(&attr, MIN_STACK_SIZE) != 0)
598 ABORT("pthread_attr_setstacksize failed\n");
601 # endif /* HPUX || GC_DGUX386_THREADS */
602 # ifdef CONDPRINT
603 if (GC_print_stats) {
604 GC_printf1("Starting %ld marker threads\n", GC_markers - 1);
606 # endif
607 for (i = 0; i < GC_markers - 1; ++i) {
608 if (0 != PTHREAD_CREATE(GC_mark_threads + i, &attr,
609 GC_mark_thread, (void *)(word)i)) {
610 WARN("Marker thread creation failed, errno = %ld.\n", errno);
615 #else /* !PARALLEL_MARK */
617 static __inline__ void start_mark_threads()
621 #endif /* !PARALLEL_MARK */
623 GC_bool GC_thr_initialized = FALSE;
625 volatile GC_thread GC_threads[THREAD_TABLE_SZ];
628 * gcc-3.3.6 miscompiles the &GC_thread_key+sizeof(&GC_thread_key) expression so
629 * put it into a separate function.
631 # if defined(__GNUC__) && defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
632 static __attribute__((noinline)) unsigned char* get_gc_thread_key_addr GC_PROTO((void))
634 return (unsigned char*)&GC_thread_key;
637 void GC_push_thread_structures GC_PROTO((void))
639 GC_push_all((ptr_t)(GC_threads), (ptr_t)(GC_threads)+sizeof(GC_threads));
640 # if defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
641 GC_push_all((ptr_t)get_gc_thread_key_addr(),
642 (ptr_t)(get_gc_thread_key_addr())+sizeof(&GC_thread_key));
643 # endif
646 #else
648 void GC_push_thread_structures GC_PROTO((void))
650 GC_push_all((ptr_t)(GC_threads), (ptr_t)(GC_threads)+sizeof(GC_threads));
651 # if defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
652 GC_push_all((ptr_t)(&GC_thread_key),
653 (ptr_t)(&GC_thread_key)+sizeof(&GC_thread_key));
654 # endif
657 #endif
659 #ifdef THREAD_LOCAL_ALLOC
660 /* We must explicitly mark ptrfree and gcj free lists, since the free */
661 /* list links wouldn't otherwise be found. We also set them in the */
662 /* normal free lists, since that involves touching less memory than if */
663 /* we scanned them normally. */
664 void GC_mark_thread_local_free_lists(void)
666 int i, j;
667 GC_thread p;
668 ptr_t q;
670 for (i = 0; i < THREAD_TABLE_SZ; ++i) {
671 for (p = GC_threads[i]; 0 != p; p = p -> next) {
672 for (j = 1; j < NFREELISTS; ++j) {
673 q = p -> ptrfree_freelists[j];
674 if ((word)q > HBLKSIZE) GC_set_fl_marks(q);
675 q = p -> normal_freelists[j];
676 if ((word)q > HBLKSIZE) GC_set_fl_marks(q);
677 # ifdef GC_GCJ_SUPPORT
678 q = p -> gcj_freelists[j];
679 if ((word)q > HBLKSIZE) GC_set_fl_marks(q);
680 # endif /* GC_GCJ_SUPPORT */
685 #endif /* THREAD_LOCAL_ALLOC */
687 static struct GC_Thread_Rep first_thread;
689 #ifdef NACL
690 extern int nacl_thread_parked[MAX_NACL_GC_THREADS];
691 extern int nacl_thread_used[MAX_NACL_GC_THREADS];
692 extern int nacl_thread_parking_inited;
693 extern int nacl_num_gc_threads;
694 extern pthread_mutex_t nacl_thread_alloc_lock;
695 extern __thread int nacl_thread_idx;
696 extern __thread GC_thread nacl_gc_thread_self;
698 extern void nacl_pre_syscall_hook();
699 extern void nacl_post_syscall_hook();
700 extern void nacl_register_gc_hooks(void (*pre)(), void (*post)());
702 void nacl_initialize_gc_thread()
704 int i;
705 nacl_register_gc_hooks(nacl_pre_syscall_hook, nacl_post_syscall_hook);
706 pthread_mutex_lock(&nacl_thread_alloc_lock);
707 if (!nacl_thread_parking_inited)
709 for (i = 0; i < MAX_NACL_GC_THREADS; i++) {
710 nacl_thread_used[i] = 0;
711 nacl_thread_parked[i] = 0;
713 nacl_thread_parking_inited = 1;
715 GC_ASSERT(nacl_num_gc_threads <= MAX_NACL_GC_THREADS);
716 for (i = 0; i < MAX_NACL_GC_THREADS; i++) {
717 if (nacl_thread_used[i] == 0) {
718 nacl_thread_used[i] = 1;
719 nacl_thread_idx = i;
720 nacl_num_gc_threads++;
721 break;
724 pthread_mutex_unlock(&nacl_thread_alloc_lock);
727 void nacl_shutdown_gc_thread()
729 pthread_mutex_lock(&nacl_thread_alloc_lock);
730 GC_ASSERT(nacl_thread_idx >= 0 && nacl_thread_idx < MAX_NACL_GC_THREADS);
731 GC_ASSERT(nacl_thread_used[nacl_thread_idx] != 0);
732 nacl_thread_used[nacl_thread_idx] = 0;
733 nacl_thread_idx = -1;
734 nacl_num_gc_threads--;
735 pthread_mutex_unlock(&nacl_thread_alloc_lock);
738 #endif /* NACL */
740 /* Add a thread to GC_threads. We assume it wasn't already there. */
741 /* Caller holds allocation lock. */
742 GC_thread GC_new_thread(pthread_t id)
744 int hv = ((unsigned long)id) % THREAD_TABLE_SZ;
745 GC_thread result;
746 static GC_bool first_thread_used = FALSE;
748 if (!first_thread_used) {
749 result = &first_thread;
750 first_thread_used = TRUE;
751 } else {
752 result = (struct GC_Thread_Rep *)
753 GC_INTERNAL_MALLOC(sizeof(struct GC_Thread_Rep), NORMAL);
755 if (result == 0) return(0);
756 result -> id = id;
757 #ifdef PLATFORM_ANDROID
758 result -> kernel_id = gettid();
759 #endif
760 result -> next = GC_threads[hv];
761 GC_threads[hv] = result;
762 #ifdef NACL
763 nacl_gc_thread_self = result;
764 nacl_initialize_gc_thread();
765 #endif
766 GC_ASSERT(result -> flags == 0 && result -> thread_blocked == 0);
767 return(result);
770 /* Delete a thread from GC_threads. We assume it is there. */
771 /* (The code intentionally traps if it wasn't.) */
772 /* Caller holds allocation lock. */
773 void GC_delete_thread(pthread_t id)
775 int hv = ((unsigned long)id) % THREAD_TABLE_SZ;
776 register GC_thread p = GC_threads[hv];
777 register GC_thread prev = 0;
779 #ifdef NACL
780 nacl_shutdown_gc_thread();
781 nacl_gc_thread_self = NULL;
782 #endif
784 while (!pthread_equal(p -> id, id)) {
785 prev = p;
786 p = p -> next;
788 if (prev == 0) {
789 GC_threads[hv] = p -> next;
790 } else {
791 prev -> next = p -> next;
793 #ifdef MONO_DEBUGGER_SUPPORTED
794 if (gc_thread_vtable && gc_thread_vtable->thread_exited)
795 gc_thread_vtable->thread_exited (id, &p->stop_info.stack_ptr);
796 #endif
798 #ifdef GC_DARWIN_THREADS
799 mach_port_deallocate(mach_task_self(), p->stop_info.mach_thread);
800 #endif
802 GC_INTERNAL_FREE(p);
805 /* If a thread has been joined, but we have not yet */
806 /* been notified, then there may be more than one thread */
807 /* in the table with the same pthread id. */
808 /* This is OK, but we need a way to delete a specific one. */
809 void GC_delete_gc_thread(pthread_t id, GC_thread gc_id)
811 int hv = ((unsigned long)id) % THREAD_TABLE_SZ;
812 register GC_thread p = GC_threads[hv];
813 register GC_thread prev = 0;
815 while (p != gc_id) {
816 prev = p;
817 p = p -> next;
819 if (prev == 0) {
820 GC_threads[hv] = p -> next;
821 } else {
822 prev -> next = p -> next;
825 #ifdef GC_DARWIN_THREADS
826 mach_port_deallocate(mach_task_self(), p->stop_info.mach_thread);
827 #endif
829 GC_INTERNAL_FREE(p);
832 /* Return a GC_thread corresponding to a given pthread_t. */
833 /* Returns 0 if it's not there. */
834 /* Caller holds allocation lock or otherwise inhibits */
835 /* updates. */
836 /* If there is more than one thread with the given id we */
837 /* return the most recent one. */
838 GC_thread GC_lookup_thread(pthread_t id)
840 int hv = ((unsigned long)id) % THREAD_TABLE_SZ;
841 register GC_thread p = GC_threads[hv];
843 while (p != 0 && !pthread_equal(p -> id, id)) p = p -> next;
844 return(p);
847 int GC_thread_is_registered (void)
849 void *ptr;
851 LOCK();
852 ptr = (void *)GC_lookup_thread(pthread_self());
853 UNLOCK();
855 return ptr ? 1 : 0;
858 void GC_register_altstack (void *stack, int stack_size, void *altstack, int altstack_size)
860 GC_thread thread;
862 LOCK();
863 thread = (void *)GC_lookup_thread(pthread_self());
864 if (thread) {
865 thread->stack = stack;
866 thread->stack_size = stack_size;
867 thread->altstack = altstack;
868 thread->altstack_size = altstack_size;
869 } else {
871 * This happens if we are called before GC_thr_init ().
873 main_pthread_self = pthread_self ();
874 main_stack = stack;
875 main_stack_size = stack_size;
876 main_altstack = altstack;
877 main_altstack_size = altstack_size;
879 UNLOCK();
882 #ifdef HANDLE_FORK
883 /* Remove all entries from the GC_threads table, except the */
884 /* one for the current thread. We need to do this in the child */
885 /* process after a fork(), since only the current thread */
886 /* survives in the child. */
887 void GC_remove_all_threads_but_me(void)
889 pthread_t self = pthread_self();
890 int hv;
891 GC_thread p, next, me;
893 for (hv = 0; hv < THREAD_TABLE_SZ; ++hv) {
894 me = 0;
895 for (p = GC_threads[hv]; 0 != p; p = next) {
896 next = p -> next;
897 if (p -> id == self) {
898 me = p;
899 p -> next = 0;
900 } else {
901 # ifdef THREAD_LOCAL_ALLOC
902 if (!(p -> flags & FINISHED)) {
903 GC_destroy_thread_local(p);
905 # endif /* THREAD_LOCAL_ALLOC */
906 if (p != &first_thread) GC_INTERNAL_FREE(p);
909 GC_threads[hv] = me;
911 GC_INTERNAL_FREE(p);
913 #endif /* HANDLE_FORK */
915 #ifdef USE_PROC_FOR_LIBRARIES
916 int GC_segment_is_thread_stack(ptr_t lo, ptr_t hi)
918 int i;
919 GC_thread p;
921 # ifdef PARALLEL_MARK
922 for (i = 0; i < GC_markers; ++i) {
923 if (marker_sp[i] > lo & marker_sp[i] < hi) return 1;
925 # endif
926 for (i = 0; i < THREAD_TABLE_SZ; i++) {
927 for (p = GC_threads[i]; p != 0; p = p -> next) {
928 if (0 != p -> stack_end) {
929 # ifdef STACK_GROWS_UP
930 if (p -> stack_end >= lo && p -> stack_end < hi) return 1;
931 # else /* STACK_GROWS_DOWN */
932 if (p -> stack_end > lo && p -> stack_end <= hi) return 1;
933 # endif
937 return 0;
939 #endif /* USE_PROC_FOR_LIBRARIES */
941 #ifdef GC_LINUX_THREADS
942 /* Return the number of processors, or i<= 0 if it can't be determined. */
943 int GC_get_nprocs()
945 /* Should be "return sysconf(_SC_NPROCESSORS_ONLN);" but that */
946 /* appears to be buggy in many cases. */
947 /* We look for lines "cpu<n>" in /proc/stat. */
948 # define STAT_BUF_SIZE 4096
949 # define STAT_READ read
950 /* If read is wrapped, this may need to be redefined to call */
951 /* the real one. */
952 char stat_buf[STAT_BUF_SIZE];
953 int f;
954 word result = 1;
955 /* Some old kernels only have a single "cpu nnnn ..." */
956 /* entry in /proc/stat. We identify those as */
957 /* uniprocessors. */
958 size_t i, len = 0;
960 f = open("/proc/stat", O_RDONLY);
961 if (f < 0 || (len = STAT_READ(f, stat_buf, STAT_BUF_SIZE)) < 100) {
962 WARN("Couldn't read /proc/stat\n", 0);
963 return -1;
965 for (i = 0; i < len - 100; ++i) {
966 if (stat_buf[i] == '\n' && stat_buf[i+1] == 'c'
967 && stat_buf[i+2] == 'p' && stat_buf[i+3] == 'u') {
968 int cpu_no = atoi(stat_buf + i + 4);
969 if (cpu_no >= result) result = cpu_no + 1;
972 close(f);
973 return result;
975 #endif /* GC_LINUX_THREADS */
977 /* We hold the GC lock. Wait until an in-progress GC has finished. */
978 /* Repeatedly RELEASES GC LOCK in order to wait. */
979 /* If wait_for_all is true, then we exit with the GC lock held and no */
980 /* collection in progress; otherwise we just wait for the current GC */
981 /* to finish. */
982 extern GC_bool GC_collection_in_progress();
983 void GC_wait_for_gc_completion(GC_bool wait_for_all)
985 if (GC_incremental && GC_collection_in_progress()) {
986 int old_gc_no = GC_gc_no;
988 /* Make sure that no part of our stack is still on the mark stack, */
989 /* since it's about to be unmapped. */
990 while (GC_incremental && GC_collection_in_progress()
991 && (wait_for_all || old_gc_no == GC_gc_no)) {
992 ENTER_GC();
993 GC_in_thread_creation = TRUE;
994 GC_collect_a_little_inner(1);
995 GC_in_thread_creation = FALSE;
996 EXIT_GC();
997 UNLOCK();
998 sched_yield();
999 LOCK();
1004 #ifdef HANDLE_FORK
1005 /* Procedures called before and after a fork. The goal here is to make */
1006 /* it safe to call GC_malloc() in a forked child. It's unclear that is */
1007 /* attainable, since the single UNIX spec seems to imply that one */
1008 /* should only call async-signal-safe functions, and we probably can't */
1009 /* quite guarantee that. But we give it our best shot. (That same */
1010 /* spec also implies that it's not safe to call the system malloc */
1011 /* between fork() and exec(). Thus we're doing no worse than it. */
1013 /* Called before a fork() */
1014 void GC_fork_prepare_proc(void)
1016 /* Acquire all relevant locks, so that after releasing the locks */
1017 /* the child will see a consistent state in which monitor */
1018 /* invariants hold. Unfortunately, we can't acquire libc locks */
1019 /* we might need, and there seems to be no guarantee that libc */
1020 /* must install a suitable fork handler. */
1021 /* Wait for an ongoing GC to finish, since we can't finish it in */
1022 /* the (one remaining thread in) the child. */
1023 LOCK();
1024 # if defined(PARALLEL_MARK) || defined(THREAD_LOCAL_ALLOC)
1025 GC_wait_for_reclaim();
1026 # endif
1027 GC_wait_for_gc_completion(TRUE);
1028 # if defined(PARALLEL_MARK) || defined(THREAD_LOCAL_ALLOC)
1029 GC_acquire_mark_lock();
1030 # endif
1033 /* Called in parent after a fork() */
1034 void GC_fork_parent_proc(void)
1036 # if defined(PARALLEL_MARK) || defined(THREAD_LOCAL_ALLOC)
1037 GC_release_mark_lock();
1038 # endif
1039 UNLOCK();
1042 /* Called in child after a fork() */
1043 void GC_fork_child_proc(void)
1045 /* Clean up the thread table, so that just our thread is left. */
1046 # if defined(PARALLEL_MARK) || defined(THREAD_LOCAL_ALLOC)
1047 GC_release_mark_lock();
1048 # endif
1049 GC_remove_all_threads_but_me();
1050 # ifdef PARALLEL_MARK
1051 /* Turn off parallel marking in the child, since we are probably */
1052 /* just going to exec, and we would have to restart mark threads. */
1053 GC_markers = 1;
1054 GC_parallel = FALSE;
1055 # endif /* PARALLEL_MARK */
1056 UNLOCK();
1058 #endif /* HANDLE_FORK */
1060 #if defined(GC_DGUX386_THREADS)
1061 /* Return the number of processors, or i<= 0 if it can't be determined. */
1062 int GC_get_nprocs()
1064 /* <takis@XFree86.Org> */
1065 int numCpus;
1066 struct dg_sys_info_pm_info pm_sysinfo;
1067 int status =0;
1069 status = dg_sys_info((long int *) &pm_sysinfo,
1070 DG_SYS_INFO_PM_INFO_TYPE, DG_SYS_INFO_PM_CURRENT_VERSION);
1071 if (status < 0)
1072 /* set -1 for error */
1073 numCpus = -1;
1074 else
1075 /* Active CPUs */
1076 numCpus = pm_sysinfo.idle_vp_count;
1078 # ifdef DEBUG_THREADS
1079 GC_printf1("Number of active CPUs in this system: %d\n", numCpus);
1080 # endif
1081 return(numCpus);
1083 #endif /* GC_DGUX386_THREADS */
1085 /* We hold the allocation lock. */
1086 void GC_thr_init()
1088 # ifndef GC_DARWIN_THREADS
1089 int dummy;
1090 # endif
1091 GC_thread t;
1093 if (GC_thr_initialized) return;
1094 GC_thr_initialized = TRUE;
1096 # ifdef HANDLE_FORK
1097 /* Prepare for a possible fork. */
1098 pthread_atfork(GC_fork_prepare_proc, GC_fork_parent_proc,
1099 GC_fork_child_proc);
1100 # endif /* HANDLE_FORK */
1101 /* Add the initial thread, so we can stop it. */
1102 t = GC_new_thread(pthread_self());
1103 # ifdef GC_DARWIN_THREADS
1104 t -> stop_info.mach_thread = mach_thread_self();
1105 # else
1106 t -> stop_info.stack_ptr = (ptr_t)(&dummy);
1107 # endif
1108 t -> flags = DETACHED | MAIN_THREAD;
1109 #ifdef MONO_DEBUGGER_SUPPORTED
1110 if (gc_thread_vtable && gc_thread_vtable->thread_created)
1111 # ifdef GC_DARWIN_THREADS
1112 gc_thread_vtable->thread_created (mach_thread_self (), &t->stop_info.stack_ptr);
1113 # else
1114 gc_thread_vtable->thread_created (pthread_self (), &t->stop_info.stack_ptr);
1115 # endif
1116 #endif
1117 if (pthread_self () == main_pthread_self) {
1118 t->stack = main_stack;
1119 t->stack_size = main_stack_size;
1120 t->altstack = main_altstack;
1121 t->altstack_size = main_altstack_size;
1124 GC_stop_init();
1126 /* Set GC_nprocs. */
1128 char * nprocs_string = GETENV("GC_NPROCS");
1129 GC_nprocs = -1;
1130 if (nprocs_string != NULL) GC_nprocs = atoi(nprocs_string);
1132 if (GC_nprocs <= 0) {
1133 # if defined(GC_HPUX_THREADS)
1134 GC_nprocs = pthread_num_processors_np();
1135 # endif
1136 # if defined(GC_OSF1_THREADS) || defined(GC_AIX_THREADS)
1137 GC_nprocs = sysconf(_SC_NPROCESSORS_ONLN);
1138 if (GC_nprocs <= 0) GC_nprocs = 1;
1139 # endif
1140 # if defined(GC_IRIX_THREADS)
1141 GC_nprocs = sysconf(_SC_NPROC_ONLN);
1142 if (GC_nprocs <= 0) GC_nprocs = 1;
1143 # endif
1144 # if defined(GC_DARWIN_THREADS) || defined(GC_FREEBSD_THREADS) || defined(GC_NETBSD_THREADS) || defined(GC_OPENBSD_THREADS)
1145 int ncpus = 1;
1146 size_t len = sizeof(ncpus);
1147 sysctl((int[2]) {CTL_HW, HW_NCPU}, 2, &ncpus, &len, NULL, 0);
1148 GC_nprocs = ncpus;
1149 # endif
1150 # if defined(GC_LINUX_THREADS) || defined(GC_DGUX386_THREADS)
1151 GC_nprocs = GC_get_nprocs();
1152 # endif
1154 if (GC_nprocs <= 0) {
1155 WARN("GC_get_nprocs() returned %ld\n", GC_nprocs);
1156 GC_nprocs = 2;
1157 # ifdef PARALLEL_MARK
1158 GC_markers = 1;
1159 # endif
1160 } else {
1161 # ifdef PARALLEL_MARK
1163 char * markers_string = GETENV("GC_MARKERS");
1164 if (markers_string != NULL) {
1165 GC_markers = atoi(markers_string);
1166 } else {
1167 GC_markers = GC_nprocs;
1168 if (GC_markers > MAX_MARKERS)
1169 GC_markers = MAX_MARKERS;
1172 # endif
1174 # ifdef PARALLEL_MARK
1175 # ifdef CONDPRINT
1176 if (GC_print_stats) {
1177 GC_printf2("Number of processors = %ld, "
1178 "number of marker threads = %ld\n", GC_nprocs, GC_markers);
1180 # endif
1181 if (GC_markers == 1) {
1182 GC_parallel = FALSE;
1183 # ifdef CONDPRINT
1184 if (GC_print_stats) {
1185 GC_printf0("Single marker thread, turning off parallel marking\n");
1187 # endif
1188 } else {
1189 GC_parallel = TRUE;
1190 /* Disable true incremental collection, but generational is OK. */
1191 GC_time_limit = GC_TIME_UNLIMITED;
1193 /* If we are using a parallel marker, actually start helper threads. */
1194 if (GC_parallel) start_mark_threads();
1195 # endif
1199 /* Perform all initializations, including those that */
1200 /* may require allocation. */
1201 /* Called without allocation lock. */
1202 /* Must be called before a second thread is created. */
1203 /* Called without allocation lock. */
1204 void GC_init_parallel()
1206 if (parallel_initialized) return;
1207 parallel_initialized = TRUE;
1209 /* GC_init() calls us back, so set flag first. */
1210 if (!GC_is_initialized) GC_init();
1211 /* Initialize thread local free lists if used. */
1212 # if defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
1213 LOCK();
1214 GC_init_thread_local(GC_lookup_thread(pthread_self()));
1215 UNLOCK();
1216 # endif
1220 #if !defined(GC_DARWIN_THREADS) && !defined(GC_OPENBSD_THREADS)
1221 #ifndef NACL
1222 int WRAP_FUNC(pthread_sigmask)(int how, const sigset_t *set, sigset_t *oset)
1224 sigset_t fudged_set;
1226 if (set != NULL && (how == SIG_BLOCK || how == SIG_SETMASK)) {
1227 fudged_set = *set;
1228 sigdelset(&fudged_set, SIG_SUSPEND);
1229 set = &fudged_set;
1231 return(REAL_FUNC(pthread_sigmask)(how, set, oset));
1233 #endif
1234 #endif /* !GC_DARWIN_THREADS */
1236 /* Wrappers for functions that are likely to block for an appreciable */
1237 /* length of time. Must be called in pairs, if at all. */
1238 /* Nothing much beyond the system call itself should be executed */
1239 /* between these. */
1241 void GC_start_blocking(void) {
1242 # define SP_SLOP 128
1243 GC_thread me;
1244 LOCK();
1245 me = GC_lookup_thread(pthread_self());
1246 GC_ASSERT(!(me -> thread_blocked));
1247 # ifdef SPARC
1248 me -> stop_info.stack_ptr = (ptr_t)GC_save_regs_in_stack();
1249 # else
1250 # ifndef GC_DARWIN_THREADS
1251 me -> stop_info.stack_ptr = (ptr_t)GC_approx_sp();
1252 # endif
1253 # endif
1254 # ifdef IA64
1255 me -> backing_store_ptr = (ptr_t)GC_save_regs_in_stack() + SP_SLOP;
1256 # endif
1257 /* Add some slop to the stack pointer, since the wrapped call may */
1258 /* end up pushing more callee-save registers. */
1259 # ifndef GC_DARWIN_THREADS
1260 # ifdef STACK_GROWS_UP
1261 me -> stop_info.stack_ptr += SP_SLOP;
1262 # else
1263 me -> stop_info.stack_ptr -= SP_SLOP;
1264 # endif
1265 # endif
1266 me -> thread_blocked = TRUE;
1267 UNLOCK();
1270 void GC_end_blocking(void) {
1271 GC_thread me;
1272 LOCK(); /* This will block if the world is stopped. */
1273 me = GC_lookup_thread(pthread_self());
1274 GC_ASSERT(me -> thread_blocked);
1275 me -> thread_blocked = FALSE;
1276 UNLOCK();
1279 #if defined(GC_DGUX386_THREADS)
1280 #define __d10_sleep sleep
1281 #endif /* GC_DGUX386_THREADS */
1283 /* A wrapper for the standard C sleep function */
1284 int WRAP_FUNC(sleep) (unsigned int seconds)
1286 int result;
1288 GC_start_blocking();
1289 result = REAL_FUNC(sleep)(seconds);
1290 GC_end_blocking();
1291 return result;
1294 struct start_info {
1295 void *(*start_routine)(void *);
1296 void *arg;
1297 word flags;
1298 sem_t registered; /* 1 ==> in our thread table, but */
1299 /* parent hasn't yet noticed. */
1302 /* Called at thread exit. */
1303 /* Never called for main thread. That's OK, since it */
1304 /* results in at most a tiny one-time leak. And */
1305 /* linuxthreads doesn't reclaim the main threads */
1306 /* resources or id anyway. */
1307 void GC_thread_exit_proc(void *arg)
1309 GC_thread me;
1311 LOCK();
1312 me = GC_lookup_thread(pthread_self());
1313 GC_destroy_thread_local(me);
1314 if (me -> flags & DETACHED) {
1315 # ifdef THREAD_LOCAL_ALLOC
1316 /* NULL out the tls key to prevent the dtor function from being called */
1317 if (0 != GC_setspecific(GC_thread_key, NULL))
1318 ABORT("Failed to set thread specific allocation pointers");
1319 #endif
1320 GC_delete_thread(pthread_self());
1321 } else {
1322 me -> flags |= FINISHED;
1324 # if defined(THREAD_LOCAL_ALLOC) && !defined(USE_PTHREAD_SPECIFIC) \
1325 && !defined(USE_COMPILER_TLS) && !defined(DBG_HDRS_ALL)
1326 GC_remove_specific(GC_thread_key);
1327 # endif
1328 /* The following may run the GC from "nonexistent" thread. */
1329 GC_wait_for_gc_completion(FALSE);
1330 UNLOCK();
1333 int WRAP_FUNC(pthread_join)(pthread_t thread, void **retval)
1335 int result;
1336 GC_thread thread_gc_id;
1338 LOCK();
1339 thread_gc_id = GC_lookup_thread(thread);
1340 /* This is guaranteed to be the intended one, since the thread id */
1341 /* cant have been recycled by pthreads. */
1342 UNLOCK();
1343 result = REAL_FUNC(pthread_join)(thread, retval);
1344 # if defined (GC_FREEBSD_THREADS)
1345 /* On FreeBSD, the wrapped pthread_join() sometimes returns (what
1346 appears to be) a spurious EINTR which caused the test and real code
1347 to gratuitously fail. Having looked at system pthread library source
1348 code, I see how this return code may be generated. In one path of
1349 code, pthread_join() just returns the errno setting of the thread
1350 being joined. This does not match the POSIX specification or the
1351 local man pages thus I have taken the liberty to catch this one
1352 spurious return value properly conditionalized on GC_FREEBSD_THREADS. */
1353 if (result == EINTR) result = 0;
1354 # endif
1355 if (result == 0) {
1356 LOCK();
1357 /* Here the pthread thread id may have been recycled. */
1358 GC_delete_gc_thread(thread, thread_gc_id);
1359 UNLOCK();
1361 return result;
1364 #ifdef NACL
1365 /* Native Client doesn't support pthread cleanup functions, */
1366 /* so wrap pthread_exit and manually cleanup the thread. */
1367 void
1368 WRAP_FUNC(pthread_exit)(void *status)
1370 GC_thread_exit_proc(0);
1371 REAL_FUNC(pthread_exit)(status);
1373 #endif
1376 WRAP_FUNC(pthread_detach)(pthread_t thread)
1378 int result;
1379 GC_thread thread_gc_id;
1381 LOCK();
1382 thread_gc_id = GC_lookup_thread(thread);
1383 UNLOCK();
1384 result = REAL_FUNC(pthread_detach)(thread);
1385 if (result == 0) {
1386 LOCK();
1387 thread_gc_id -> flags |= DETACHED;
1388 /* Here the pthread thread id may have been recycled. */
1389 if (thread_gc_id -> flags & FINISHED) {
1390 GC_delete_gc_thread(thread, thread_gc_id);
1392 UNLOCK();
1394 return result;
1397 GC_bool GC_in_thread_creation = FALSE;
1399 typedef void *(*ThreadStartFn)(void *);
1400 void * GC_start_routine_head(void * arg, void *base_addr,
1401 ThreadStartFn *start, void **start_arg )
1403 struct start_info * si = arg;
1404 void * result;
1405 GC_thread me;
1406 pthread_t my_pthread;
1408 my_pthread = pthread_self();
1409 # ifdef DEBUG_THREADS
1410 GC_printf1("Starting thread 0x%lx\n", my_pthread);
1411 GC_printf1("pid = %ld\n", (long) getpid());
1412 GC_printf1("sp = 0x%lx\n", (long) &arg);
1413 # endif
1414 LOCK();
1415 GC_in_thread_creation = TRUE;
1416 me = GC_new_thread(my_pthread);
1417 GC_in_thread_creation = FALSE;
1418 #ifdef GC_DARWIN_THREADS
1419 me -> stop_info.mach_thread = mach_thread_self();
1420 #else
1421 me -> stop_info.stack_ptr = 0;
1422 #endif
1423 me -> flags = si -> flags;
1424 /* me -> stack_end = GC_linux_stack_base(); -- currently (11/99) */
1425 /* doesn't work because the stack base in /proc/self/stat is the */
1426 /* one for the main thread. There is a strong argument that that's */
1427 /* a kernel bug, but a pervasive one. */
1428 # ifdef STACK_GROWS_DOWN
1429 me -> stack_end = (ptr_t)(((word)(base_addr) + (GC_page_size - 1))
1430 & ~(GC_page_size - 1));
1431 # ifndef GC_DARWIN_THREADS
1432 me -> stop_info.stack_ptr = me -> stack_end - 0x10;
1433 # endif
1434 /* Needs to be plausible, since an asynchronous stack mark */
1435 /* should not crash. */
1436 # else
1437 me -> stack_end = (ptr_t)((word)(base_addr) & ~(GC_page_size - 1));
1438 me -> stop_info.stack_ptr = me -> stack_end + 0x10;
1439 # endif
1440 /* This is dubious, since we may be more than a page into the stack, */
1441 /* and hence skip some of it, though it's not clear that matters. */
1442 # ifdef IA64
1443 me -> backing_store_end = (ptr_t)
1444 (GC_save_regs_in_stack() & ~(GC_page_size - 1));
1445 /* This is also < 100% convincing. We should also read this */
1446 /* from /proc, but the hook to do so isn't there yet. */
1447 # endif /* IA64 */
1448 #ifdef MONO_DEBUGGER_SUPPORTED
1449 if (gc_thread_vtable && gc_thread_vtable->thread_created)
1450 # ifdef GC_DARWIN_THREADS
1451 gc_thread_vtable->thread_created (mach_thread_self(), &me->stop_info.stack_ptr);
1452 # else
1453 gc_thread_vtable->thread_created (my_pthread, &me->stop_info.stack_ptr);
1454 # endif
1455 #endif
1456 UNLOCK();
1458 if (start) *start = si -> start_routine;
1459 if (start_arg) *start_arg = si -> arg;
1461 if (!(si->flags & FOREIGN_THREAD))
1462 sem_post(&(si -> registered)); /* Last action on si. */
1463 /* OK to deallocate. */
1464 # if defined(THREAD_LOCAL_ALLOC) && !defined(DBG_HDRS_ALL)
1465 LOCK();
1466 GC_init_thread_local(me);
1467 UNLOCK();
1468 # endif
1470 return me;
1473 int GC_thread_register_foreign (void *base_addr)
1475 struct start_info si = { 0, }; /* stacked for legibility & locking */
1476 GC_thread me;
1478 # ifdef DEBUG_THREADS
1479 GC_printf1( "GC_thread_register_foreign %p\n", &si );
1480 # endif
1482 si.flags = FOREIGN_THREAD;
1484 if (!parallel_initialized) GC_init_parallel();
1485 LOCK();
1486 if (!GC_thr_initialized) GC_thr_init();
1488 UNLOCK();
1490 me = GC_start_routine_head(&si, base_addr, NULL, NULL);
1492 return me != NULL;
1495 void * GC_start_routine(void * arg)
1497 int dummy;
1498 struct start_info * si = arg;
1499 void * result;
1500 GC_thread me;
1501 ThreadStartFn start;
1502 void *start_arg;
1504 me = GC_start_routine_head (arg, &dummy, &start, &start_arg);
1506 pthread_cleanup_push(GC_thread_exit_proc, 0);
1507 # ifdef DEBUG_THREADS
1508 GC_printf1("start_routine = 0x%lx\n", start);
1509 # endif
1510 result = (*start)(start_arg);
1511 #if DEBUG_THREADS
1512 GC_printf1("Finishing thread 0x%x\n", pthread_self());
1513 #endif
1514 me -> status = result;
1515 pthread_cleanup_pop(1);
1516 /* Cleanup acquires lock, ensuring that we can't exit */
1517 /* while a collection that thinks we're alive is trying to stop */
1518 /* us. */
1519 return(result);
1523 WRAP_FUNC(pthread_create)(pthread_t *new_thread,
1524 const pthread_attr_t *attr,
1525 void *(*start_routine)(void *), void *arg)
1527 int result;
1528 int detachstate;
1529 word my_flags = 0;
1530 struct start_info * si;
1531 /* This is otherwise saved only in an area mmapped by the thread */
1532 /* library, which isn't visible to the collector. */
1534 /* We resist the temptation to muck with the stack size here, */
1535 /* even if the default is unreasonably small. That's the client's */
1536 /* responsibility. */
1538 LOCK();
1539 si = (struct start_info *)GC_INTERNAL_MALLOC(sizeof(struct start_info),
1540 NORMAL);
1541 UNLOCK();
1542 if (!parallel_initialized) GC_init_parallel();
1543 if (0 == si) return(ENOMEM);
1544 sem_init(&(si -> registered), 0, 0);
1545 si -> start_routine = start_routine;
1546 si -> arg = arg;
1547 LOCK();
1548 if (!GC_thr_initialized) GC_thr_init();
1549 # ifdef GC_ASSERTIONS
1551 size_t stack_size;
1552 if (NULL == attr) {
1553 pthread_attr_t my_attr;
1554 pthread_attr_init(&my_attr);
1555 pthread_attr_getstacksize(&my_attr, &stack_size);
1556 } else {
1557 pthread_attr_getstacksize(attr, &stack_size);
1559 # ifdef PARALLEL_MARK
1560 GC_ASSERT(stack_size >= (8*HBLKSIZE*sizeof(word)));
1561 # else
1562 /* FreeBSD-5.3/Alpha: default pthread stack is 64K, */
1563 /* HBLKSIZE=8192, sizeof(word)=8 */
1564 GC_ASSERT(stack_size >= 65536);
1565 # endif
1566 /* Our threads may need to do some work for the GC. */
1567 /* Ridiculously small threads won't work, and they */
1568 /* probably wouldn't work anyway. */
1570 # endif
1571 if (NULL == attr) {
1572 detachstate = PTHREAD_CREATE_JOINABLE;
1573 } else {
1574 pthread_attr_getdetachstate(attr, &detachstate);
1576 if (PTHREAD_CREATE_DETACHED == detachstate) my_flags |= DETACHED;
1577 si -> flags = my_flags;
1578 UNLOCK();
1579 # ifdef DEBUG_THREADS
1580 GC_printf1("About to start new thread from thread 0x%X\n",
1581 pthread_self());
1582 # endif
1584 result = REAL_FUNC(pthread_create)(new_thread, attr, GC_start_routine, si);
1586 # ifdef DEBUG_THREADS
1587 GC_printf1("Started thread 0x%X\n", *new_thread);
1588 # endif
1589 /* Wait until child has been added to the thread table. */
1590 /* This also ensures that we hold onto si until the child is done */
1591 /* with it. Thus it doesn't matter whether it is otherwise */
1592 /* visible to the collector. */
1593 if (0 == result) {
1594 while (0 != sem_wait(&(si -> registered))) {
1595 if (EINTR != errno) ABORT("sem_wait failed");
1598 sem_destroy(&(si -> registered));
1599 LOCK();
1600 GC_INTERNAL_FREE(si);
1601 UNLOCK();
1603 return(result);
1606 #ifdef GENERIC_COMPARE_AND_SWAP
1607 pthread_mutex_t GC_compare_and_swap_lock = PTHREAD_MUTEX_INITIALIZER;
1609 GC_bool GC_compare_and_exchange(volatile GC_word *addr,
1610 GC_word old, GC_word new_val)
1612 GC_bool result;
1613 pthread_mutex_lock(&GC_compare_and_swap_lock);
1614 if (*addr == old) {
1615 *addr = new_val;
1616 result = TRUE;
1617 } else {
1618 result = FALSE;
1620 pthread_mutex_unlock(&GC_compare_and_swap_lock);
1621 return result;
1624 GC_word GC_atomic_add(volatile GC_word *addr, GC_word how_much)
1626 GC_word old;
1627 pthread_mutex_lock(&GC_compare_and_swap_lock);
1628 old = *addr;
1629 *addr = old + how_much;
1630 pthread_mutex_unlock(&GC_compare_and_swap_lock);
1631 return old;
1634 #endif /* GENERIC_COMPARE_AND_SWAP */
1635 /* Spend a few cycles in a way that can't introduce contention with */
1636 /* othre threads. */
1637 void GC_pause()
1639 int i;
1640 # if !defined(__GNUC__) || defined(__INTEL_COMPILER)
1641 volatile word dummy = 0;
1642 # endif
1644 for (i = 0; i < 10; ++i) {
1645 # if defined(__GNUC__) && !defined(__INTEL_COMPILER)
1646 __asm__ __volatile__ (" " : : : "memory");
1647 # else
1648 /* Something that's unlikely to be optimized away. */
1649 GC_noop(++dummy);
1650 # endif
1654 #define SPIN_MAX 128 /* Maximum number of calls to GC_pause before */
1655 /* give up. */
1657 VOLATILE GC_bool GC_collecting = 0;
1658 /* A hint that we're in the collector and */
1659 /* holding the allocation lock for an */
1660 /* extended period. */
1662 #if !defined(USE_SPIN_LOCK) || defined(PARALLEL_MARK)
1663 /* If we don't want to use the below spinlock implementation, either */
1664 /* because we don't have a GC_test_and_set implementation, or because */
1665 /* we don't want to risk sleeping, we can still try spinning on */
1666 /* pthread_mutex_trylock for a while. This appears to be very */
1667 /* beneficial in many cases. */
1668 /* I suspect that under high contention this is nearly always better */
1669 /* than the spin lock. But it's a bit slower on a uniprocessor. */
1670 /* Hence we still default to the spin lock. */
1671 /* This is also used to acquire the mark lock for the parallel */
1672 /* marker. */
1674 /* Here we use a strict exponential backoff scheme. I don't know */
1675 /* whether that's better or worse than the above. We eventually */
1676 /* yield by calling pthread_mutex_lock(); it never makes sense to */
1677 /* explicitly sleep. */
1679 #define LOCK_STATS
1680 #ifdef LOCK_STATS
1681 unsigned long GC_spin_count = 0;
1682 unsigned long GC_block_count = 0;
1683 unsigned long GC_unlocked_count = 0;
1684 #endif
1686 void GC_generic_lock(pthread_mutex_t * lock)
1688 #ifndef NO_PTHREAD_TRYLOCK
1689 unsigned pause_length = 1;
1690 unsigned i;
1692 if (0 == pthread_mutex_trylock(lock)) {
1693 # ifdef LOCK_STATS
1694 ++GC_unlocked_count;
1695 # endif
1696 return;
1698 for (; pause_length <= SPIN_MAX; pause_length <<= 1) {
1699 for (i = 0; i < pause_length; ++i) {
1700 GC_pause();
1702 switch(pthread_mutex_trylock(lock)) {
1703 case 0:
1704 # ifdef LOCK_STATS
1705 ++GC_spin_count;
1706 # endif
1707 return;
1708 case EBUSY:
1709 break;
1710 default:
1711 ABORT("Unexpected error from pthread_mutex_trylock");
1714 #endif /* !NO_PTHREAD_TRYLOCK */
1715 # ifdef LOCK_STATS
1716 ++GC_block_count;
1717 # endif
1718 pthread_mutex_lock(lock);
1721 #endif /* !USE_SPIN_LOCK || PARALLEL_MARK */
1723 #if defined(USE_SPIN_LOCK)
1725 /* Reasonably fast spin locks. Basically the same implementation */
1726 /* as STL alloc.h. This isn't really the right way to do this. */
1727 /* but until the POSIX scheduling mess gets straightened out ... */
1729 volatile unsigned int GC_allocate_lock = 0;
1732 void GC_lock()
1734 # define low_spin_max 30 /* spin cycles if we suspect uniprocessor */
1735 # define high_spin_max SPIN_MAX /* spin cycles for multiprocessor */
1736 static unsigned spin_max = low_spin_max;
1737 unsigned my_spin_max;
1738 static unsigned last_spins = 0;
1739 unsigned my_last_spins;
1740 int i;
1742 if (!GC_test_and_set(&GC_allocate_lock)) {
1743 return;
1745 my_spin_max = spin_max;
1746 my_last_spins = last_spins;
1747 for (i = 0; i < my_spin_max; i++) {
1748 if (GC_collecting || GC_nprocs == 1) goto yield;
1749 if (i < my_last_spins/2 || GC_allocate_lock) {
1750 GC_pause();
1751 continue;
1753 if (!GC_test_and_set(&GC_allocate_lock)) {
1755 * got it!
1756 * Spinning worked. Thus we're probably not being scheduled
1757 * against the other process with which we were contending.
1758 * Thus it makes sense to spin longer the next time.
1760 last_spins = i;
1761 spin_max = high_spin_max;
1762 return;
1765 /* We are probably being scheduled against the other process. Sleep. */
1766 spin_max = low_spin_max;
1767 yield:
1768 for (i = 0;; ++i) {
1769 if (!GC_test_and_set(&GC_allocate_lock)) {
1770 return;
1772 # define SLEEP_THRESHOLD 12
1773 /* Under Linux very short sleeps tend to wait until */
1774 /* the current time quantum expires. On old Linux */
1775 /* kernels nanosleep(<= 2ms) just spins under Linux. */
1776 /* (Under 2.4, this happens only for real-time */
1777 /* processes.) We want to minimize both behaviors */
1778 /* here. */
1779 if (i < SLEEP_THRESHOLD) {
1780 sched_yield();
1781 } else {
1782 struct timespec ts;
1784 if (i > 24) i = 24;
1785 /* Don't wait for more than about 15msecs, even */
1786 /* under extreme contention. */
1787 ts.tv_sec = 0;
1788 ts.tv_nsec = 1 << i;
1789 nanosleep(&ts, 0);
1794 #else /* !USE_SPINLOCK */
1795 void GC_lock()
1797 #ifndef NO_PTHREAD_TRYLOCK
1798 if (1 == GC_nprocs || GC_collecting) {
1799 pthread_mutex_lock(&GC_allocate_ml);
1800 } else {
1801 GC_generic_lock(&GC_allocate_ml);
1803 #else /* !NO_PTHREAD_TRYLOCK */
1804 pthread_mutex_lock(&GC_allocate_ml);
1805 #endif /* !NO_PTHREAD_TRYLOCK */
1808 #endif /* !USE_SPINLOCK */
1810 #if defined(PARALLEL_MARK) || defined(THREAD_LOCAL_ALLOC)
1812 #ifdef GC_ASSERTIONS
1813 pthread_t GC_mark_lock_holder = NO_THREAD;
1814 #endif
1816 #if 0
1817 /* Ugly workaround for a linux threads bug in the final versions */
1818 /* of glibc2.1. Pthread_mutex_trylock sets the mutex owner */
1819 /* field even when it fails to acquire the mutex. This causes */
1820 /* pthread_cond_wait to die. Remove for glibc2.2. */
1821 /* According to the man page, we should use */
1822 /* PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP, but that isn't actually */
1823 /* defined. */
1824 static pthread_mutex_t mark_mutex =
1825 {0, 0, 0, PTHREAD_MUTEX_ERRORCHECK_NP, {0, 0}};
1826 #else
1827 static pthread_mutex_t mark_mutex = PTHREAD_MUTEX_INITIALIZER;
1828 #endif
1830 static pthread_cond_t builder_cv = PTHREAD_COND_INITIALIZER;
1832 void GC_acquire_mark_lock()
1835 if (pthread_mutex_lock(&mark_mutex) != 0) {
1836 ABORT("pthread_mutex_lock failed");
1839 GC_generic_lock(&mark_mutex);
1840 # ifdef GC_ASSERTIONS
1841 GC_mark_lock_holder = pthread_self();
1842 # endif
1845 void GC_release_mark_lock()
1847 GC_ASSERT(GC_mark_lock_holder == pthread_self());
1848 # ifdef GC_ASSERTIONS
1849 GC_mark_lock_holder = NO_THREAD;
1850 # endif
1851 if (pthread_mutex_unlock(&mark_mutex) != 0) {
1852 ABORT("pthread_mutex_unlock failed");
1856 /* Collector must wait for a freelist builders for 2 reasons: */
1857 /* 1) Mark bits may still be getting examined without lock. */
1858 /* 2) Partial free lists referenced only by locals may not be scanned */
1859 /* correctly, e.g. if they contain "pointer-free" objects, since the */
1860 /* free-list link may be ignored. */
1861 void GC_wait_builder()
1863 GC_ASSERT(GC_mark_lock_holder == pthread_self());
1864 # ifdef GC_ASSERTIONS
1865 GC_mark_lock_holder = NO_THREAD;
1866 # endif
1867 if (pthread_cond_wait(&builder_cv, &mark_mutex) != 0) {
1868 ABORT("pthread_cond_wait failed");
1870 GC_ASSERT(GC_mark_lock_holder == NO_THREAD);
1871 # ifdef GC_ASSERTIONS
1872 GC_mark_lock_holder = pthread_self();
1873 # endif
1876 void GC_wait_for_reclaim()
1878 GC_acquire_mark_lock();
1879 while (GC_fl_builder_count > 0) {
1880 GC_wait_builder();
1882 GC_release_mark_lock();
1885 void GC_notify_all_builder()
1887 GC_ASSERT(GC_mark_lock_holder == pthread_self());
1888 if (pthread_cond_broadcast(&builder_cv) != 0) {
1889 ABORT("pthread_cond_broadcast failed");
1893 #endif /* PARALLEL_MARK || THREAD_LOCAL_ALLOC */
1895 #ifdef PARALLEL_MARK
1897 static pthread_cond_t mark_cv = PTHREAD_COND_INITIALIZER;
1899 void GC_wait_marker()
1901 GC_ASSERT(GC_mark_lock_holder == pthread_self());
1902 # ifdef GC_ASSERTIONS
1903 GC_mark_lock_holder = NO_THREAD;
1904 # endif
1905 if (pthread_cond_wait(&mark_cv, &mark_mutex) != 0) {
1906 ABORT("pthread_cond_wait failed");
1908 GC_ASSERT(GC_mark_lock_holder == NO_THREAD);
1909 # ifdef GC_ASSERTIONS
1910 GC_mark_lock_holder = pthread_self();
1911 # endif
1914 void GC_notify_all_marker()
1916 if (pthread_cond_broadcast(&mark_cv) != 0) {
1917 ABORT("pthread_cond_broadcast failed");
1921 #endif /* PARALLEL_MARK */
1923 # endif /* GC_LINUX_THREADS and friends */