source: trunk/gc6.8/darwin_stop_world.c

Last change on this file was 132, checked in by cinc, 19 years ago

Boehm-Demers-Weiser garbage collector. Single-threaded for OS/2.
File size: 14.3 KB
Line 
1#include "private/pthread_support.h"
2
3/* This probably needs more porting work to ppc64. */
4
5# if defined(GC_DARWIN_THREADS)
6
7/* From "Inside Mac OS X - Mach-O Runtime Architecture" published by Apple
8 Page 49:
9 "The space beneath the stack pointer, where a new stack frame would normally
10 be allocated, is called the red zone. This area as shown in Figure 3-2 may
11 be used for any purpose as long as a new stack frame does not need to be
12 added to the stack."
13
14 Page 50: "If a leaf procedure's red zone usage would exceed 224 bytes, then
15 it must set up a stack frame just like routines that call other routines."
16*/
17#ifdef POWERPC
18# if CPP_WORDSZ == 32
19# define PPC_RED_ZONE_SIZE 224
20# elif CPP_WORDSZ == 64
21# define PPC_RED_ZONE_SIZE 320
22# endif
23#endif
24
25typedef struct StackFrame {
26 unsigned long savedSP;
27 unsigned long savedCR;
28 unsigned long savedLR;
29 unsigned long reserved[2];
30 unsigned long savedRTOC;
31} StackFrame;
32
33unsigned long FindTopOfStack(unsigned int stack_start) {
34 StackFrame *frame;
35
36 if (stack_start == 0) {
37# ifdef POWERPC
38# if CPP_WORDSZ == 32
39 __asm__ volatile("lwz %0,0(r1)" : "=r" (frame));
40# else
41 __asm__ volatile("ld %0,0(r1)" : "=r" (frame));
42# endif
43# endif
44 } else {
45 frame = (StackFrame *)stack_start;
46 }
47
48# ifdef DEBUG_THREADS
49 /* GC_printf1("FindTopOfStack start at sp = %p\n", frame); */
50# endif
51 do {
52 if (frame->savedSP == 0) break;
53 /* if there are no more stack frames, stop */
54
55 frame = (StackFrame*)frame->savedSP;
56
57 /* we do these next two checks after going to the next frame
58 because the LR for the first stack frame in the loop
59 is not set up on purpose, so we shouldn't check it. */
60 if ((frame->savedLR & ~3) == 0) break; /* if the next LR is bogus, stop */
61 if ((~(frame->savedLR) & ~3) == 0) break; /* ditto */
62 } while (1);
63
64# ifdef DEBUG_THREADS
65 /* GC_printf1("FindTopOfStack finish at sp = %p\n", frame); */
66# endif
67
68 return (unsigned long)frame;
69}
70
71#ifdef DARWIN_DONT_PARSE_STACK
72void GC_push_all_stacks() {
73 int i;
74 kern_return_t r;
75 GC_thread p;
76 pthread_t me;
77 ptr_t lo, hi;
78#if defined(POWERPC)
79 ppc_thread_state_t state;
80#elif defined(I386)
81 i386_thread_state_t state;
82#else
83# error FIXME for non-x86 || ppc architectures
84#endif
85 mach_msg_type_number_t thread_state_count = MACHINE_THREAD_STATE_COUNT;
86
87 me = pthread_self();
88 if (!GC_thr_initialized) GC_thr_init();
89
90 for(i=0;i<THREAD_TABLE_SZ;i++) {
91 for(p=GC_threads[i];p!=0;p=p->next) {
92 if(p -> flags & FINISHED) continue;
93 if(pthread_equal(p->id,me)) {
94 lo = GC_approx_sp();
95 } else {
96 /* Get the thread state (registers, etc) */
97 r = thread_get_state(
98 p->stop_info.mach_thread,
99 MACHINE_THREAD_STATE,
100 (natural_t*)&state,
101 &thread_state_count);
102 if(r != KERN_SUCCESS) ABORT("thread_get_state failed");
103
104#if defined(I386)
105 lo = state.esp;
106
107 GC_push_one(state.eax);
108 GC_push_one(state.ebx);
109 GC_push_one(state.ecx);
110 GC_push_one(state.edx);
111 GC_push_one(state.edi);
112 GC_push_one(state.esi);
113 GC_push_one(state.ebp);
114#elif defined(POWERPC)
115 lo = (void*)(state.r1 - PPC_RED_ZONE_SIZE);
116
117 GC_push_one(state.r0);
118 GC_push_one(state.r2);
119 GC_push_one(state.r3);
120 GC_push_one(state.r4);
121 GC_push_one(state.r5);
122 GC_push_one(state.r6);
123 GC_push_one(state.r7);
124 GC_push_one(state.r8);
125 GC_push_one(state.r9);
126 GC_push_one(state.r10);
127 GC_push_one(state.r11);
128 GC_push_one(state.r12);
129 GC_push_one(state.r13);
130 GC_push_one(state.r14);
131 GC_push_one(state.r15);
132 GC_push_one(state.r16);
133 GC_push_one(state.r17);
134 GC_push_one(state.r18);
135 GC_push_one(state.r19);
136 GC_push_one(state.r20);
137 GC_push_one(state.r21);
138 GC_push_one(state.r22);
139 GC_push_one(state.r23);
140 GC_push_one(state.r24);
141 GC_push_one(state.r25);
142 GC_push_one(state.r26);
143 GC_push_one(state.r27);
144 GC_push_one(state.r28);
145 GC_push_one(state.r29);
146 GC_push_one(state.r30);
147 GC_push_one(state.r31);
148#else
149# error FIXME for non-x86 || ppc architectures
150#endif
151 } /* p != me */
152 if(p->flags & MAIN_THREAD)
153 hi = GC_stackbottom;
154 else
155 hi = p->stack_end;
156#if DEBUG_THREADS
157 GC_printf3("Darwin: Stack for thread 0x%lx = [%lx,%lx)\n",
158 (unsigned long) p -> id,
159 (unsigned long) lo,
160 (unsigned long) hi
161 );
162#endif
163 GC_push_all_stack(lo,hi);
164 } /* for(p=GC_threads[i]...) */
165 } /* for(i=0;i<THREAD_TABLE_SZ...) */
166}
167
168#else /* !DARWIN_DONT_PARSE_STACK; Use FindTopOfStack() */
169
170void GC_push_all_stacks() {
171 int i;
172 task_t my_task;
173 kern_return_t r;
174 mach_port_t me;
175 ptr_t lo, hi;
176 thread_act_array_t act_list = 0;
177 mach_msg_type_number_t listcount = 0;
178
179 me = mach_thread_self();
180 if (!GC_thr_initialized) GC_thr_init();
181
182 my_task = current_task();
183 r = task_threads(my_task, &act_list, &listcount);
184 if(r != KERN_SUCCESS) ABORT("task_threads failed");
185 for(i = 0; i < listcount; i++) {
186 thread_act_t thread = act_list[i];
187 if (thread == me) {
188 lo = GC_approx_sp();
189 hi = (ptr_t)FindTopOfStack(0);
190 } else {
191# if defined(POWERPC)
192# if CPP_WORDSZ == 32
193 ppc_thread_state_t info;
194# else
195 ppc_thread_state64_t info;
196# endif
197 mach_msg_type_number_t outCount = THREAD_STATE_MAX;
198 r = thread_get_state(thread, MACHINE_THREAD_STATE,
199 (natural_t *)&info, &outCount);
200 if(r != KERN_SUCCESS) ABORT("task_get_state failed");
201
202 lo = (void*)(info.r1 - PPC_RED_ZONE_SIZE);
203 hi = (ptr_t)FindTopOfStack(info.r1);
204
205 GC_push_one(info.r0);
206 GC_push_one(info.r2);
207 GC_push_one(info.r3);
208 GC_push_one(info.r4);
209 GC_push_one(info.r5);
210 GC_push_one(info.r6);
211 GC_push_one(info.r7);
212 GC_push_one(info.r8);
213 GC_push_one(info.r9);
214 GC_push_one(info.r10);
215 GC_push_one(info.r11);
216 GC_push_one(info.r12);
217 GC_push_one(info.r13);
218 GC_push_one(info.r14);
219 GC_push_one(info.r15);
220 GC_push_one(info.r16);
221 GC_push_one(info.r17);
222 GC_push_one(info.r18);
223 GC_push_one(info.r19);
224 GC_push_one(info.r20);
225 GC_push_one(info.r21);
226 GC_push_one(info.r22);
227 GC_push_one(info.r23);
228 GC_push_one(info.r24);
229 GC_push_one(info.r25);
230 GC_push_one(info.r26);
231 GC_push_one(info.r27);
232 GC_push_one(info.r28);
233 GC_push_one(info.r29);
234 GC_push_one(info.r30);
235 GC_push_one(info.r31);
236# else
237 /* FIXME: Remove after testing: */
238 WARN("This is completely untested and likely will not work\n", 0);
239 i386_thread_state_t info;
240 mach_msg_type_number_t outCount = THREAD_STATE_MAX;
241 r = thread_get_state(thread, MACHINE_THREAD_STATE,
242 (natural_t *)&info, &outCount);
243 if(r != KERN_SUCCESS) ABORT("task_get_state failed");
244
245 lo = (void*)info.esp;
246 hi = (ptr_t)FindTopOfStack(info.esp);
247
248 GC_push_one(info.eax);
249 GC_push_one(info.ebx);
250 GC_push_one(info.ecx);
251 GC_push_one(info.edx);
252 GC_push_one(info.edi);
253 GC_push_one(info.esi);
254 /* GC_push_one(info.ebp); */
255 /* GC_push_one(info.esp); */
256 GC_push_one(info.ss);
257 GC_push_one(info.eip);
258 GC_push_one(info.cs);
259 GC_push_one(info.ds);
260 GC_push_one(info.es);
261 GC_push_one(info.fs);
262 GC_push_one(info.gs);
263# endif /* !POWERPC */
264 }
265# if DEBUG_THREADS
266 GC_printf3("Darwin: Stack for thread 0x%lx = [%lx,%lx)\n",
267 (unsigned long) thread,
268 (unsigned long) lo,
269 (unsigned long) hi
270 );
271# endif
272 GC_push_all_stack(lo, hi);
273 mach_port_deallocate(my_task, thread);
274 } /* for(p=GC_threads[i]...) */
275 vm_deallocate(my_task, (vm_address_t)act_list, sizeof(thread_t) * listcount);
276 mach_port_deallocate(my_task, me);
277}
278#endif /* !DARWIN_DONT_PARSE_STACK */
279
280static mach_port_t GC_mach_handler_thread;
281static int GC_use_mach_handler_thread = 0;
282
283static struct GC_mach_thread GC_mach_threads[THREAD_TABLE_SZ];
284static int GC_mach_threads_count;
285
286void GC_stop_init() {
287 int i;
288
289 for (i = 0; i < THREAD_TABLE_SZ; i++) {
290 GC_mach_threads[i].thread = 0;
291 GC_mach_threads[i].already_suspended = 0;
292 }
293 GC_mach_threads_count = 0;
294}
295
296/* returns true if there's a thread in act_list that wasn't in old_list */
297int GC_suspend_thread_list(thread_act_array_t act_list, int count,
298 thread_act_array_t old_list, int old_count) {
299 mach_port_t my_thread = mach_thread_self();
300 int i, j;
301
302 int changed = 0;
303
304 for(i = 0; i < count; i++) {
305 thread_act_t thread = act_list[i];
306# if DEBUG_THREADS
307 GC_printf1("Attempting to suspend thread %p\n", thread);
308# endif
309 /* find the current thread in the old list */
310 int found = 0;
311 for(j = 0; j < old_count; j++) {
312 thread_act_t old_thread = old_list[j];
313 if (old_thread == thread) {
314 found = 1;
315 break;
316 }
317 }
318 if (!found) {
319 /* add it to the GC_mach_threads list */
320 GC_mach_threads[GC_mach_threads_count].thread = thread;
321 /* default is not suspended */
322 GC_mach_threads[GC_mach_threads_count].already_suspended = 0;
323 changed = 1;
324 }
325
326 if (thread != my_thread &&
327 (!GC_use_mach_handler_thread
328 || (GC_use_mach_handler_thread
329 && GC_mach_handler_thread != thread))) {
330 struct thread_basic_info info;
331 mach_msg_type_number_t outCount = THREAD_INFO_MAX;
332 kern_return_t kern_result = thread_info(thread, THREAD_BASIC_INFO,
333 (thread_info_t)&info, &outCount);
334 if(kern_result != KERN_SUCCESS) {
335 /* the thread may have quit since the thread_threads () call
336 * we mark already_suspended so it's not dealt with anymore later
337 */
338 if (!found) {
339 GC_mach_threads[GC_mach_threads_count].already_suspended = TRUE;
340 GC_mach_threads_count++;
341 }
342 continue;
343 }
344# if DEBUG_THREADS
345 GC_printf2("Thread state for 0x%lx = %d\n", thread, info.run_state);
346# endif
347 if (!found) {
348 GC_mach_threads[GC_mach_threads_count].already_suspended = info.suspend_count;
349 }
350 if (info.suspend_count) continue;
351
352# if DEBUG_THREADS
353 GC_printf1("Suspending 0x%lx\n", thread);
354# endif
355 /* Suspend the thread */
356 kern_result = thread_suspend(thread);
357 if(kern_result != KERN_SUCCESS) {
358 /* the thread may have quit since the thread_threads () call
359 * we mark already_suspended so it's not dealt with anymore later
360 */
361 if (!found) {
362 GC_mach_threads[GC_mach_threads_count].already_suspended = TRUE;
363 GC_mach_threads_count++;
364 }
365 continue;
366 }
367 }
368 if (!found) GC_mach_threads_count++;
369 }
370 mach_port_deallocate(current_task(), my_thread);
371 return changed;
372}
373
374
375/* Caller holds allocation lock. */
376void GC_stop_world()
377{
378 int i, changes;
379 GC_thread p;
380 task_t my_task = current_task();
381 mach_port_t my_thread = mach_thread_self();
382 kern_return_t kern_result;
383 thread_act_array_t act_list, prev_list;
384 mach_msg_type_number_t listcount, prevcount;
385
386# if DEBUG_THREADS
387 GC_printf1("Stopping the world from 0x%lx\n", mach_thread_self());
388# endif
389
390 /* clear out the mach threads list table */
391 GC_stop_init();
392
393 /* Make sure all free list construction has stopped before we start. */
394 /* No new construction can start, since free list construction is */
395 /* required to acquire and release the GC lock before it starts, */
396 /* and we have the lock. */
397# ifdef PARALLEL_MARK
398 GC_acquire_mark_lock();
399 GC_ASSERT(GC_fl_builder_count == 0);
400 /* We should have previously waited for it to become zero. */
401# endif /* PARALLEL_MARK */
402
403 /* Loop stopping threads until you have gone over the whole list
404 twice without a new one appearing. thread_create() won't
405 return (and thus the thread stop) until the new thread
406 exists, so there is no window whereby you could stop a
407 thread, recognise it is stopped, but then have a new thread
408 it created before stopping show up later.
409 */
410
411 changes = 1;
412 prev_list = NULL;
413 prevcount = 0;
414 do {
415 int result;
416 kern_result = task_threads(my_task, &act_list, &listcount);
417 result = GC_suspend_thread_list(act_list, listcount,
418 prev_list, prevcount);
419 changes = result;
420 prev_list = act_list;
421 prevcount = listcount;
422
423 if(kern_result == KERN_SUCCESS) {
424 int i;
425
426 for(i = 0; i < listcount; i++)
427 mach_port_deallocate(my_task, act_list[i]);
428
429 vm_deallocate(my_task, (vm_address_t)act_list, sizeof(thread_t) * listcount);
430 }
431 } while (changes);
432
433
434# ifdef MPROTECT_VDB
435 if(GC_incremental) {
436 extern void GC_mprotect_stop();
437 GC_mprotect_stop();
438 }
439# endif
440
441# ifdef PARALLEL_MARK
442 GC_release_mark_lock();
443# endif
444 #if DEBUG_THREADS
445 GC_printf1("World stopped from 0x%lx\n", my_thread);
446 #endif
447
448 mach_port_deallocate(my_task, my_thread);
449}
450
451/* Caller holds allocation lock, and has held it continuously since */
452/* the world stopped. */
453void GC_start_world()
454{
455 task_t my_task = current_task();
456 mach_port_t my_thread = mach_thread_self();
457 int i, j;
458 GC_thread p;
459 kern_return_t kern_result;
460 thread_act_array_t act_list;
461 mach_msg_type_number_t listcount;
462 struct thread_basic_info info;
463 mach_msg_type_number_t outCount = THREAD_INFO_MAX;
464
465# if DEBUG_THREADS
466 GC_printf0("World starting\n");
467# endif
468
469# ifdef MPROTECT_VDB
470 if(GC_incremental) {
471 extern void GC_mprotect_resume();
472 GC_mprotect_resume();
473 }
474# endif
475
476 kern_result = task_threads(my_task, &act_list, &listcount);
477 for(i = 0; i < listcount; i++) {
478 thread_act_t thread = act_list[i];
479 if (thread != my_thread &&
480 (!GC_use_mach_handler_thread ||
481 (GC_use_mach_handler_thread && GC_mach_handler_thread != thread))) {
482 for(j = 0; j < GC_mach_threads_count; j++) {
483 if (thread == GC_mach_threads[j].thread) {
484 if (GC_mach_threads[j].already_suspended) {
485# if DEBUG_THREADS
486 GC_printf1("Not resuming already suspended thread %p\n", thread);
487# endif
488 continue;
489 }
490 kern_result = thread_info(thread, THREAD_BASIC_INFO,
491 (thread_info_t)&info, &outCount);
492 if(kern_result != KERN_SUCCESS) ABORT("thread_info failed");
493# if DEBUG_THREADS
494 GC_printf2("Thread state for 0x%lx = %d\n", thread,
495 info.run_state);
496 GC_printf1("Resuming 0x%lx\n", thread);
497# endif
498 /* Resume the thread */
499 kern_result = thread_resume(thread);
500 if(kern_result != KERN_SUCCESS) ABORT("thread_resume failed");
501 }
502 }
503 }
504
505 mach_port_deallocate(my_task, thread);
506 }
507 vm_deallocate(my_task, (vm_address_t)act_list, sizeof(thread_t) * listcount);
508
509 mach_port_deallocate(my_task, my_thread);
510# if DEBUG_THREADS
511 GC_printf0("World started\n");
512# endif
513}
514
515void GC_darwin_register_mach_handler_thread(mach_port_t thread) {
516 GC_mach_handler_thread = thread;
517 GC_use_mach_handler_thread = 1;
518}
519
520#endif
Note: See TracBrowser for help on using the repository browser.