2 * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers
3 * Copyright (c) 1991-1994 by Xerox Corporation. All rights reserved.
4 * Copyright (c) 1996 by Silicon Graphics. All rights reserved.
6 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
7 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
9 * Permission is hereby granted to use or copy this program
10 * for any purpose, provided the above notices are retained on all copies.
11 * Permission to modify the code and to distribute modified code is granted,
12 * provided the above notices are retained, and a notice that the code was
13 * modified is included with the above copyright notice.
15 /* An incomplete test for the garbage collector. */
16 /* Some more obscure entry points are not tested at all. */
17 /* This must be compiled with the same flags used to build the */
18 /* GC. It uses GC internals to allow more precise results */
19 /* checking for some of the tests. */
27 # if defined(mips) && defined(SYSTYPE_BSD43)
35 # define assert ASSERT
37 # include <assert.h> /* Not normally used, but handy for debugging. */
39 # include <assert.h> /* Not normally used, but handy for debugging. */
41 # include "gc_typed.h"
42 # ifdef THREAD_LOCAL_ALLOC
43 # include "gc_local_alloc.h"
45 # include "private/gc_priv.h" /* For output, locking, MIN_WORDS, */
46 /* and some statistics. */
47 # include "private/gcconfig.h"
49 # if defined(MSWIN32) || defined(MSWINCE)
54 # include "th/PCR_ThCrSec.h"
55 # include "th/PCR_Th.h"
57 # define GC_printf0 printf
59 # define GC_printf1 printf
62 # ifdef SOLARIS_THREADS
67 # if defined(IRIX_THREADS) || defined(LINUX_THREADS) || defined(HPUX_THREADS)
74 # define GC_CreateThread(a,b,c,d,e,f) ((HANDLE) _beginthreadex(a,b,c,d,e,f))
76 static CRITICAL_SECTION incr_cs;
80 /* Allocation Statistics */
81 int stubborn_count = 0;
82 int uncollectable_count = 0;
83 int collectable_count = 0;
85 int realloc_count = 0;
87 #if defined(GC_AMIGA_FASTALLOC) && defined(AMIGA)
89 extern void GC_amiga_free_all_mem(void);
90 void Amiga_Fail(void){GC_amiga_free_all_mem();abort();}
91 # define FAIL (void)Amiga_Fail()
92 void *GC_amiga_gctest_malloc_explicitly_typed(size_t lb, GC_descr d){
93 void *ret=GC_malloc_explicitly_typed(lb,d);
97 ret=GC_malloc_explicitly_typed(lb,d);
100 GC_printf0("Out of memory, (typed allocations are not directly "
101 "supported with the GC_AMIGA_FASTALLOC option.)\n");
107 void *GC_amiga_gctest_calloc_explicitly_typed(size_t a,size_t lb, GC_descr d){
108 void *ret=GC_calloc_explicitly_typed(a,lb,d);
112 ret=GC_calloc_explicitly_typed(a,lb,d);
115 GC_printf0("Out of memory, (typed allocations are not directly "
116 "supported with the GC_AMIGA_FASTALLOC option.)\n");
122 # define GC_malloc_explicitly_typed(a,b) GC_amiga_gctest_malloc_explicitly_typed(a,b)
123 # define GC_calloc_explicitly_typed(a,b,c) GC_amiga_gctest_calloc_explicitly_typed(a,b,c)
125 #else /* !AMIGA_FASTALLOC */
128 # define FAIL (void)abort()
131 # define FAIL DebugBreak()
133 # define FAIL GC_abort("Test failed");
137 #endif /* !AMIGA_FASTALLOC */
139 /* AT_END may be defined to exercise the interior pointer test */
140 /* if the collector is configured with ALL_INTERIOR_POINTERS. */
141 /* As it stands, this test should succeed with either */
142 /* configuration. In the FIND_LEAK configuration, it should */
143 /* find lots of leaks, since we free almost nothing. */
146 struct SEXPR * sexpr_car;
147 struct SEXPR * sexpr_cdr;
151 typedef struct SEXPR * sexpr;
153 # define INT_TO_SEXPR(x) ((sexpr)(unsigned long)(x))
156 # define nil (INT_TO_SEXPR(0))
157 # define car(x) ((x) -> sexpr_car)
158 # define cdr(x) ((x) -> sexpr_cdr)
159 # define is_nil(x) ((x) == nil)
162 int extra_count = 0; /* Amount of space wasted in cons node */
164 /* Silly implementation of Lisp cons. Intentionally wastes lots of space */
165 /* to test collector. */
166 # ifdef VERY_SMALL_CONFIG
167 # define cons small_cons
175 register int my_extra = extra_count;
178 r = (sexpr) GC_MALLOC_STUBBORN(sizeof(struct SEXPR) + my_extra);
180 (void)GC_printf0("Out of memory\n");
184 ((char *)p) < ((char *)r) + my_extra + sizeof(struct SEXPR); p++) {
186 (void)GC_printf1("Found nonzero at 0x%lx - allocator is broken\n",
193 r = (sexpr)((char *)r + (my_extra & ~7));
198 if ( my_extra >= 5000 ) {
201 extra_count = my_extra;
203 GC_END_STUBBORN_CHANGE((char *)r);
208 sexpr small_cons (x, y)
215 r = (sexpr) GC_MALLOC(sizeof(struct SEXPR));
217 (void)GC_printf0("Out of memory\n");
225 sexpr small_cons_uncollectable (x, y)
231 uncollectable_count++;
232 r = (sexpr) GC_MALLOC_UNCOLLECTABLE(sizeof(struct SEXPR));
234 (void)GC_printf0("Out of memory\n");
238 r -> sexpr_cdr = (sexpr)(~(unsigned long)y);
242 #ifdef GC_GCJ_SUPPORT
245 #include "private/dbg_mlc.h" /* For USR_PTR_FROM_BASE */
248 /* The following struct emulates the vtable in gcj. */
249 /* This assumes the default value of MARK_DESCR_OFFSET. */
251 void * dummy; /* class pointer in real gcj. */
255 struct fake_vtable gcj_class_struct1 = { 0, sizeof(struct SEXPR)
256 + sizeof(struct fake_vtable *) };
257 /* length based descriptor. */
258 struct fake_vtable gcj_class_struct2 =
259 { 0, (3l << (CPP_WORDSZ - 3)) | GC_DS_BITMAP};
260 /* Bitmap based descriptor. */
262 struct GC_ms_entry * fake_gcj_mark_proc(word * addr,
263 struct GC_ms_entry *mark_stack_ptr,
264 struct GC_ms_entry *mark_stack_limit,
269 /* Object allocated with debug allocator. */
270 addr = (word *)USR_PTR_FROM_BASE(addr);
272 x = (sexpr)(addr + 1); /* Skip the vtable pointer. */
273 mark_stack_ptr = GC_MARK_AND_PUSH(
274 (GC_PTR)(x -> sexpr_cdr), mark_stack_ptr,
275 mark_stack_limit, (GC_PTR *)&(x -> sexpr_cdr));
276 mark_stack_ptr = GC_MARK_AND_PUSH(
277 (GC_PTR)(x -> sexpr_car), mark_stack_ptr,
278 mark_stack_limit, (GC_PTR *)&(x -> sexpr_car));
279 return(mark_stack_ptr);
288 static int count = 0;
291 # ifdef USE_MARK_BYTES
292 r = (GC_word *) GC_GCJ_FAST_MALLOC(4, &gcj_class_struct1);
294 r = (GC_word *) GC_GCJ_FAST_MALLOC(3, &gcj_class_struct1);
297 r = (GC_word *) GC_GCJ_MALLOC(sizeof(struct SEXPR)
298 + sizeof(struct fake_vtable*),
302 (void)GC_printf0("Out of memory\n");
305 result = (sexpr)(r + 1);
306 result -> sexpr_car = x;
307 result -> sexpr_cdr = y;
312 /* Return reverse(x) concatenated with y */
319 return( reverse1(cdr(x), cons(car(x), y)) );
326 return( reverse1(x, nil) );
335 return(small_cons(small_cons(INT_TO_SEXPR(low), nil), ints(low+1, up)));
339 #ifdef GC_GCJ_SUPPORT
340 /* Return reverse(x) concatenated with y */
341 sexpr gcj_reverse1(x, y)
347 return( gcj_reverse1(cdr(x), gcj_cons(car(x), y)) );
354 return( gcj_reverse1(x, nil) );
357 sexpr gcj_ints(low, up)
363 return(gcj_cons(gcj_cons(INT_TO_SEXPR(low), nil), gcj_ints(low+1, up)));
366 #endif /* GC_GCJ_SUPPORT */
368 /* To check uncollectable allocation we build lists with disguised cdr */
369 /* pointers, and make sure they don't go away. */
370 sexpr uncollectable_ints(low, up)
376 return(small_cons_uncollectable(small_cons(INT_TO_SEXPR(low), nil),
377 uncollectable_ints(low+1, up)));
381 void check_ints(list, low, up)
385 if ((int)(GC_word)(car(car(list))) != low) {
387 "List reversal produced incorrect list - collector is broken\n");
391 if (cdr(list) != nil) {
392 (void)GC_printf0("List too long - collector is broken\n");
396 check_ints(cdr(list), low+1, up);
400 # define UNCOLLECTABLE_CDR(x) (sexpr)(~(unsigned long)(cdr(x)))
402 void check_uncollectable_ints(list, low, up)
406 if ((int)(GC_word)(car(car(list))) != low) {
408 "Uncollectable list corrupted - collector is broken\n");
412 if (UNCOLLECTABLE_CDR(list) != nil) {
413 (void)GC_printf0("Uncollectable list too long - collector is broken\n");
417 check_uncollectable_ints(UNCOLLECTABLE_CDR(list), low+1, up);
421 /* Not used, but useful for debugging: */
422 void print_int_list(x)
426 (void)GC_printf0("NIL\n");
428 (void)GC_printf1("(%ld)", (long)(car(car(x))));
429 if (!is_nil(cdr(x))) {
430 (void)GC_printf0(", ");
431 (void)print_int_list(cdr(x));
433 (void)GC_printf0("\n");
438 /* Try to force a to be strangely aligned */
446 * A tiny list reversal test to check thread creation.
450 # ifdef WIN32_THREADS
451 unsigned __stdcall tiny_reverse_test(void * arg)
453 void * tiny_reverse_test(void * arg)
456 check_ints(reverse(reverse(ints(1,10))), 1, 10);
460 # if defined(IRIX_THREADS) || defined(LINUX_THREADS) \
461 || defined(SOLARIS_PTHREADS) || defined(HPUX_THREADS)
466 if ((code = pthread_create(&t, 0, tiny_reverse_test, 0)) != 0) {
467 (void)GC_printf1("Small thread creation failed %lu\n",
468 (unsigned long)code);
471 if ((code = pthread_join(t, 0)) != 0) {
472 (void)GC_printf1("Small thread join failed %lu\n",
473 (unsigned long)code);
478 # elif defined(WIN32_THREADS)
483 h = GC_CreateThread(NULL, 0, tiny_reverse_test, 0, 0, &thread_id);
484 if (h == (HANDLE)NULL) {
485 (void)GC_printf1("Small thread creation failed %lu\n",
486 (unsigned long)GetLastError());
489 if (WaitForSingleObject(h, INFINITE) != WAIT_OBJECT_0) {
490 (void)GC_printf1("Small thread wait failed %lu\n",
491 (unsigned long)GetLastError());
496 /* # elif defined(SOLARIS_THREADS) */
500 # define fork_a_thread()
506 # define fork_a_thread()
511 * Repeatedly reverse lists built out of very different sized cons cells.
512 * Check that we didn't lose anything.
522 # if defined(MSWIN32) || defined(MACOS)
523 /* Win32S only allows 128K stacks */
527 /* PCR default stack is 100K. Stack frames are up to 120 bytes. */
531 /* WinCE only allows 64K stacks */
535 /* OSF has limited stack space by default, and large frames. */
548 d = uncollectable_ints(1, 100);
549 e = uncollectable_ints(1, 1);
550 /* Check that realloc updates object descriptors correctly */
552 f = (sexpr *)GC_MALLOC(4 * sizeof(sexpr));
554 f = (sexpr *)GC_REALLOC((GC_PTR)f, 6 * sizeof(sexpr));
557 g = (sexpr *)GC_MALLOC(513 * sizeof(sexpr));
559 g = (sexpr *)GC_REALLOC((GC_PTR)g, 800 * sizeof(sexpr));
562 h = (sexpr *)GC_MALLOC(1025 * sizeof(sexpr));
564 h = (sexpr *)GC_REALLOC((GC_PTR)h, 2000 * sizeof(sexpr));
565 # ifdef GC_GCJ_SUPPORT
566 h[1999] = gcj_ints(1,200);
567 h[1999] = gcj_reverse(h[1999]);
569 h[1999] = ints(1,200);
571 /* Try to force some collections and reuse of small list elements */
572 for (i = 0; i < 10; i++) {
575 /* Superficially test interior pointer recognition on stack */
576 c = (sexpr)((char *)c + sizeof(char *));
577 d = (sexpr)((char *)d + sizeof(char *));
586 for (i = 0; i < 50; i++) {
588 b = reverse(reverse(b));
592 for (i = 0; i < 60; i++) {
593 if (i % 10 == 0) fork_a_thread();
594 /* This maintains the invariant that a always points to a list of */
595 /* 49 integers. Thus this is thread safe without locks, */
596 /* assuming atomic pointer assignments. */
597 a = reverse(reverse(a));
598 # if !defined(AT_END) && !defined(THREADS)
599 /* This is not thread safe, since realloc explicitly deallocates */
601 a = (sexpr)GC_REALLOC((GC_PTR)a, 500);
603 a = (sexpr)GC_REALLOC((GC_PTR)a, 8200);
609 c = (sexpr)((char *)c - sizeof(char *));
610 d = (sexpr)((char *)d - sizeof(char *));
612 check_uncollectable_ints(d, 1, 100);
613 check_ints(f[5], 1,17);
614 check_ints(g[799], 1,18);
615 # ifdef GC_GCJ_SUPPORT
616 h[1999] = gcj_reverse(h[1999]);
618 check_ints(h[1999], 1,200);
626 * The rest of this builds balanced binary trees, checks that they don't
627 * disappear, and tests finalization.
629 typedef struct treenode {
631 struct treenode * lchild;
632 struct treenode * rchild;
635 int finalizable_count = 0;
636 int finalized_count = 0;
637 VOLATILE int dropped_something = 0;
640 void finalizer(void * obj, void * client_data)
642 void finalizer(obj, client_data)
650 PCR_ThCrSec_EnterSys();
652 # ifdef SOLARIS_THREADS
653 static mutex_t incr_lock;
654 mutex_lock(&incr_lock);
656 # if defined(IRIX_THREADS) || defined(LINUX_THREADS) || defined(HPUX_THREADS)
657 static pthread_mutex_t incr_lock = PTHREAD_MUTEX_INITIALIZER;
658 pthread_mutex_lock(&incr_lock);
660 # ifdef WIN32_THREADS
661 EnterCriticalSection(&incr_cs);
663 if ((int)(GC_word)client_data != t -> level) {
664 (void)GC_printf0("Wrong finalization data - collector is broken\n");
669 PCR_ThCrSec_ExitSys();
671 # ifdef SOLARIS_THREADS
672 mutex_unlock(&incr_lock);
674 # if defined(IRIX_THREADS) || defined(LINUX_THREADS) || defined(HPUX_THREADS)
675 pthread_mutex_unlock(&incr_lock);
677 # ifdef WIN32_THREADS
678 LeaveCriticalSection(&incr_cs);
684 # define MAX_FINALIZED 8000
687 GC_FAR GC_word live_indicators[MAX_FINALIZED] = {0};
689 /* Too big for THINK_C. have to allocate it dynamically. */
690 GC_word *live_indicators = 0;
693 int live_indicators_count = 0;
698 # ifdef THREAD_LOCAL_ALLOC
699 tn * result = (tn *)GC_LOCAL_MALLOC(sizeof(tn));
701 tn * result = (tn *)GC_MALLOC(sizeof(tn));
705 # ifdef THREAD_LOCAL_ALLOC
706 /* Minimally exercise thread local allocation */
708 char * result = (char *)GC_LOCAL_MALLOC_ATOMIC(17);
709 memset(result, 'a', 17);
711 # endif /* THREAD_LOCAL_ALLOC */
713 /* get around static data limitations. */
714 if (!live_indicators)
716 (GC_word*)NewPtrClear(MAX_FINALIZED * sizeof(GC_word));
717 if (!live_indicators) {
718 (void)GC_printf0("Out of memory\n");
722 if (n == 0) return(0);
724 (void)GC_printf0("Out of memory\n");
728 result -> lchild = mktree(n-1);
729 result -> rchild = mktree(n-1);
730 if (counter++ % 17 == 0 && n >= 2) {
731 tn * tmp = result -> lchild -> rchild;
733 result -> lchild -> rchild = result -> rchild -> lchild;
734 result -> rchild -> lchild = tmp;
736 if (counter++ % 119 == 0) {
741 PCR_ThCrSec_EnterSys();
743 # ifdef SOLARIS_THREADS
744 static mutex_t incr_lock;
745 mutex_lock(&incr_lock);
747 # if defined(IRIX_THREADS) || defined(LINUX_THREADS) \
748 || defined(HPUX_THREADS)
749 static pthread_mutex_t incr_lock = PTHREAD_MUTEX_INITIALIZER;
750 pthread_mutex_lock(&incr_lock);
752 # ifdef WIN32_THREADS
753 EnterCriticalSection(&incr_cs);
755 /* Losing a count here causes erroneous report of failure. */
757 my_index = live_indicators_count++;
759 PCR_ThCrSec_ExitSys();
761 # ifdef SOLARIS_THREADS
762 mutex_unlock(&incr_lock);
764 # if defined(IRIX_THREADS) || defined(LINUX_THREADS) \
765 || defined(HPUX_THREADS)
766 pthread_mutex_unlock(&incr_lock);
768 # ifdef WIN32_THREADS
769 LeaveCriticalSection(&incr_cs);
773 GC_REGISTER_FINALIZER((GC_PTR)result, finalizer, (GC_PTR)(GC_word)n,
774 (GC_finalization_proc *)0, (GC_PTR *)0);
775 if (my_index >= MAX_FINALIZED) {
776 GC_printf0("live_indicators overflowed\n");
779 live_indicators[my_index] = 13;
780 if (GC_GENERAL_REGISTER_DISAPPEARING_LINK(
781 (GC_PTR *)(&(live_indicators[my_index])),
782 (GC_PTR)result) != 0) {
783 GC_printf0("GC_general_register_disappearing_link failed\n");
786 if (GC_unregister_disappearing_link(
788 (&(live_indicators[my_index]))) == 0) {
789 GC_printf0("GC_unregister_disappearing_link failed\n");
792 if (GC_GENERAL_REGISTER_DISAPPEARING_LINK(
793 (GC_PTR *)(&(live_indicators[my_index])),
794 (GC_PTR)result) != 0) {
795 GC_printf0("GC_general_register_disappearing_link failed 2\n");
806 if (n == 0 && t != 0) {
807 (void)GC_printf0("Clobbered a leaf - collector is broken\n");
811 if (t -> level != n) {
812 (void)GC_printf1("Lost a node at level %lu - collector is broken\n",
816 if (counter++ % 373 == 0) {
818 (void) GC_MALLOC(counter%5001);
820 chktree(t -> lchild, n-1);
821 if (counter++ % 73 == 0) {
823 (void) GC_MALLOC(counter%373);
825 chktree(t -> rchild, n-1);
828 # if defined(SOLARIS_THREADS) && !defined(_SOLARIS_PTHREADS)
833 # if defined(SMALL_CONFIG) || defined(GC_DEBUG)
835 return(GC_MALLOC(8));
837 void ** my_free_list_ptr;
840 if (thr_getspecific(fl_key, (void **)(&my_free_list_ptr)) != 0) {
841 (void)GC_printf0("thr_getspecific failed\n");
844 if (my_free_list_ptr == 0) {
845 uncollectable_count++;
846 my_free_list_ptr = GC_NEW_UNCOLLECTABLE(void *);
847 if (thr_setspecific(fl_key, my_free_list_ptr) != 0) {
848 (void)GC_printf0("thr_setspecific failed\n");
852 my_free_list = *my_free_list_ptr;
853 if (my_free_list == 0) {
855 my_free_list = GC_malloc_many(8);
856 if (my_free_list == 0) {
857 (void)GC_printf0("alloc8bytes out of memory\n");
861 *my_free_list_ptr = GC_NEXT(my_free_list);
862 GC_NEXT(my_free_list) = 0;
863 return(my_free_list);
869 # if defined(GC_SOLARIS_PTHREADS) || defined(GC_IRIX_THREADS) \
870 || defined(GC_LINUX_THREADS) || defined(GC_HPUX_THREADS) \
871 || defined(GC_SOLARIS_THREADS)
872 pthread_key_t fl_key;
876 # if defined(SMALL_CONFIG) || defined(GC_DEBUG)
878 return(GC_MALLOC(8));
880 void ** my_free_list_ptr;
883 my_free_list_ptr = (void **)pthread_getspecific(fl_key);
884 if (my_free_list_ptr == 0) {
885 uncollectable_count++;
886 my_free_list_ptr = GC_NEW_UNCOLLECTABLE(void *);
887 if (pthread_setspecific(fl_key, my_free_list_ptr) != 0) {
888 (void)GC_printf0("pthread_setspecific failed\n");
892 my_free_list = *my_free_list_ptr;
893 if (my_free_list == 0) {
894 my_free_list = GC_malloc_many(8);
895 if (my_free_list == 0) {
896 (void)GC_printf0("alloc8bytes out of memory\n");
900 *my_free_list_ptr = GC_NEXT(my_free_list);
901 GC_NEXT(my_free_list) = 0;
903 return(my_free_list);
908 # define alloc8bytes() GC_MALLOC_ATOMIC(8)
917 for (i = 0; i < n; i += 8) {
919 if (alloc8bytes() == 0) {
920 (void)GC_printf0("Out of memory\n");
926 # if defined(THREADS) && defined(GC_DEBUG)
927 # ifdef VERY_SMALL_CONFIG
928 # define TREE_HEIGHT 12
930 # define TREE_HEIGHT 15
933 # ifdef VERY_SMALL_CONFIG
934 # define TREE_HEIGHT 13
936 # define TREE_HEIGHT 16
944 root = mktree(TREE_HEIGHT);
945 # ifndef VERY_SMALL_CONFIG
946 alloc_small(5000000);
948 chktree(root, TREE_HEIGHT);
949 if (finalized_count && ! dropped_something) {
950 (void)GC_printf0("Premature finalization - collector is broken\n");
953 dropped_something = 1;
954 GC_noop(root); /* Root needs to remain live until */
955 /* dropped_something is set. */
956 root = mktree(TREE_HEIGHT);
957 chktree(root, TREE_HEIGHT);
958 for (i = TREE_HEIGHT; i >= 0; i--) {
962 # ifndef VERY_SMALL_CONFIG
963 alloc_small(5000000);
967 unsigned n_tests = 0;
969 GC_word bm_huge[10] = {
982 /* A very simple test of explicitly typed allocation */
985 GC_word * old, * new;
988 GC_word bm_large = 0xf7ff7fff;
989 GC_descr d1 = GC_make_descriptor(&bm3, 2);
990 GC_descr d2 = GC_make_descriptor(&bm2, 2);
992 GC_descr dummy = GC_make_descriptor(&bm_large, 32);
994 GC_descr d3 = GC_make_descriptor(&bm_large, 32);
995 GC_descr d4 = GC_make_descriptor(bm_huge, 320);
996 GC_word * x = (GC_word *)GC_malloc_explicitly_typed(2000, d4);
1001 for (i = 0; i < 4000; i++) {
1002 collectable_count++;
1003 new = (GC_word *) GC_malloc_explicitly_typed(4 * sizeof(GC_word), d1);
1004 if (0 != new[0] || 0 != new[1]) {
1005 GC_printf0("Bad initialization by GC_malloc_explicitly_typed\n");
1009 new[1] = (GC_word)old;
1011 collectable_count++;
1012 new = (GC_word *) GC_malloc_explicitly_typed(4 * sizeof(GC_word), d2);
1014 new[1] = (GC_word)old;
1016 collectable_count++;
1017 new = (GC_word *) GC_malloc_explicitly_typed(33 * sizeof(GC_word), d3);
1019 new[1] = (GC_word)old;
1021 collectable_count++;
1022 new = (GC_word *) GC_calloc_explicitly_typed(4, 2 * sizeof(GC_word),
1025 new[1] = (GC_word)old;
1027 collectable_count++;
1029 new = (GC_word *) GC_calloc_explicitly_typed(7, 3 * sizeof(GC_word),
1032 new = (GC_word *) GC_calloc_explicitly_typed(1001,
1033 3 * sizeof(GC_word),
1035 if (0 != new[0] || 0 != new[1]) {
1036 GC_printf0("Bad initialization by GC_malloc_explicitly_typed\n");
1041 new[1] = (GC_word)old;
1044 for (i = 0; i < 20000; i++) {
1046 (void)GC_printf1("typed alloc failed at %lu\n",
1052 new = (GC_word *)(old[1]);
1071 void fail_proc1(GC_PTR x)
1076 #endif /* __STDC__ */
1079 # define TEST_FAIL_COUNT(n) 1
1081 # define TEST_FAIL_COUNT(n) (fail_count >= (n))
1090 char *y = (char *)(size_t)fail_proc1;
1096 "This test program is not designed for leak detection mode\n");
1097 (void)GC_printf0("Expect lots of problems.\n");
1100 # ifndef DBG_HDRS_ALL
1101 collectable_count += 3;
1102 if (GC_size(GC_malloc(7)) != 8 &&
1103 GC_size(GC_malloc(7)) != MIN_WORDS * sizeof(GC_word)
1104 || GC_size(GC_malloc(15)) != 16) {
1105 (void)GC_printf0("GC_size produced unexpected results\n");
1108 collectable_count += 1;
1109 if (GC_size(GC_malloc(0)) != MIN_WORDS * sizeof(GC_word)) {
1110 (void)GC_printf1("GC_malloc(0) failed: GC_size returns %ld\n",
1111 GC_size(GC_malloc(0)));
1114 collectable_count += 1;
1115 if (GC_size(GC_malloc_uncollectable(0)) != MIN_WORDS * sizeof(GC_word)) {
1116 (void)GC_printf0("GC_malloc_uncollectable(0) failed\n");
1119 GC_is_valid_displacement_print_proc = fail_proc1;
1120 GC_is_visible_print_proc = fail_proc1;
1121 collectable_count += 1;
1123 if (GC_base(x + 13) != x) {
1124 (void)GC_printf0("GC_base(heap ptr) produced incorrect result\n");
1128 if (GC_base(y) != 0) {
1129 (void)GC_printf0("GC_base(fn_ptr) produced incorrect result\n");
1133 if (GC_same_obj(x+5, x) != x + 5) {
1134 (void)GC_printf0("GC_same_obj produced incorrect result\n");
1137 if (GC_is_visible(y) != y || GC_is_visible(x) != x) {
1138 (void)GC_printf0("GC_is_visible produced incorrect result\n");
1141 if (!TEST_FAIL_COUNT(1)) {
1142 # if!(defined(RS6000) || defined(POWERPC) || defined(IA64))
1143 /* ON RS6000s function pointers point to a descriptor in the */
1144 /* data segment, so there should have been no failures. */
1145 (void)GC_printf0("GC_is_visible produced wrong failure indication\n");
1149 if (GC_is_valid_displacement(y) != y
1150 || GC_is_valid_displacement(x) != x
1151 || GC_is_valid_displacement(x + 3) != x + 3) {
1153 "GC_is_valid_displacement produced incorrect result\n");
1156 # ifndef ALL_INTERIOR_POINTERS
1157 # if defined(RS6000) || defined(POWERPC)
1158 if (!TEST_FAIL_COUNT(1)) {
1160 if (GC_all_interior_pointers && !TEST_FAIL_COUNT(1)
1161 || !GC_all_interior_pointers && !TEST_FAIL_COUNT(2)) {
1163 (void)GC_printf0("GC_is_valid_displacement produced wrong failure indication\n");
1167 # endif /* DBG_HDRS_ALL */
1168 /* Test floating point alignment */
1169 collectable_count += 2;
1170 *(double *)GC_MALLOC(sizeof(double)) = 1.0;
1171 *(double *)GC_MALLOC(sizeof(double)) = 1.0;
1172 # ifdef GC_GCJ_SUPPORT
1173 GC_REGISTER_DISPLACEMENT(sizeof(struct fake_vtable *));
1174 GC_init_gcj_malloc(0, (void *)fake_gcj_mark_proc);
1176 /* Repeated list reversal test. */
1179 GC_printf0("-------------Finished reverse_test\n");
1181 # ifndef DBG_HDRS_ALL
1184 GC_printf0("-------------Finished typed_test\n");
1186 # endif /* DBG_HDRS_ALL */
1191 /* GC_printf1("Finished %x\n", pthread_self()); */
1194 void check_heap_stats()
1196 unsigned long max_heap_sz;
1199 int late_finalize_count = 0;
1201 # ifdef VERY_SMALL_CONFIG
1202 /* these are something of a guess */
1203 if (sizeof(char *) > 4) {
1204 max_heap_sz = 4500000;
1206 max_heap_sz = 2800000;
1209 if (sizeof(char *) > 4) {
1210 max_heap_sz = 15000000;
1212 max_heap_sz = 11000000;
1217 # ifdef SAVE_CALL_CHAIN
1219 # ifdef SAVE_CALL_COUNT
1220 max_heap_sz *= SAVE_CALL_COUNT/4;
1224 /* Garbage collect repeatedly so that all inaccessible objects */
1225 /* can be finalized. */
1226 while (GC_collect_a_little()) { }
1227 for (i = 0; i < 16; i++) {
1229 late_finalize_count += GC_invoke_finalizers();
1231 (void)GC_printf1("Completed %lu tests\n", (unsigned long)n_tests);
1232 (void)GC_printf1("Allocated %lu collectable objects\n", (unsigned long)collectable_count);
1233 (void)GC_printf1("Allocated %lu uncollectable objects\n", (unsigned long)uncollectable_count);
1234 (void)GC_printf1("Allocated %lu atomic objects\n", (unsigned long)atomic_count);
1235 (void)GC_printf1("Allocated %lu stubborn objects\n", (unsigned long)stubborn_count);
1236 (void)GC_printf2("Finalized %lu/%lu objects - ",
1237 (unsigned long)finalized_count,
1238 (unsigned long)finalizable_count);
1239 # ifdef FINALIZE_ON_DEMAND
1240 if (finalized_count != late_finalize_count) {
1241 (void)GC_printf0("Demand finalization error\n");
1245 if (finalized_count > finalizable_count
1246 || finalized_count < finalizable_count/2) {
1247 (void)GC_printf0("finalization is probably broken\n");
1250 (void)GC_printf0("finalization is probably ok\n");
1253 for (i = 0; i < MAX_FINALIZED; i++) {
1254 if (live_indicators[i] != 0) {
1258 i = finalizable_count - finalized_count - still_live;
1261 ("%lu disappearing links remain and %ld more objects were not finalized\n",
1262 (unsigned long) still_live, (long)i);
1264 GC_printf0("\tVery suspicious!\n");
1266 GC_printf0("\tSlightly suspicious, but probably OK.\n");
1269 (void)GC_printf1("Total number of bytes allocated is %lu\n",
1271 WORDS_TO_BYTES(GC_words_allocd + GC_words_allocd_before_gc));
1272 (void)GC_printf1("Final heap size is %lu bytes\n",
1273 (unsigned long)GC_get_heap_size());
1274 if (WORDS_TO_BYTES(GC_words_allocd + GC_words_allocd_before_gc)
1275 # ifdef VERY_SMALL_CONFIG
1276 < 2700000*n_tests) {
1278 < 33500000*n_tests) {
1280 (void)GC_printf0("Incorrect execution - missed some allocations\n");
1283 if (GC_get_heap_size() > max_heap_sz*n_tests) {
1284 (void)GC_printf0("Unexpected heap growth - collector may be broken\n");
1287 (void)GC_printf0("Collector appears to work\n");
1291 void SetMinimumStack(long minSize)
1295 if (minSize > LMGetDefltStack())
1297 newApplLimit = (long) GetApplLimit()
1298 - (minSize - LMGetDefltStack());
1299 SetApplLimit((Ptr) newApplLimit);
1304 #define cMinStackSpace (512L * 1024L)
1309 void warn_proc(char *msg, GC_word p)
1311 void warn_proc(msg, p)
1316 GC_printf1(msg, (unsigned long)p);
1321 #if !defined(PCR) && !defined(GC_SOLARIS_THREADS) \
1322 && !defined(GC_WIN32_THREADS) \
1323 && !defined(GC_IRIX_THREADS) && !defined(GC_LINUX_THREADS) \
1324 && !defined(GC_HPUX_THREADS) || defined(LINT)
1325 #if defined(MSWIN32) && !defined(__MINGW32__)
1326 int APIENTRY WinMain(HINSTANCE instance, HINSTANCE prev, LPTSTR cmd, int n)
1337 /* No good way to determine stack base from library; do it */
1338 /* manually on this platform. */
1339 GC_stackbottom = (GC_PTR)(&dummy);
1342 /* Make sure we have lots and lots of stack space. */
1343 SetMinimumStack(cMinStackSpace);
1344 /* Cheat and let stdio initialize toolbox for us. */
1345 printf("Testing GC Macintosh port.\n");
1347 GC_INIT(); /* Only needed if gc is dynamic library. */
1348 (void) GC_set_warn_proc(warn_proc);
1349 # if defined(MPROTECT_VDB) || defined(PROC_VDB)
1350 GC_enable_incremental();
1351 (void) GC_printf0("Switched to incremental mode\n");
1352 # if defined(MPROTECT_VDB)
1353 (void)GC_printf0("Emulating dirty bits with mprotect/signals\n");
1355 (void)GC_printf0("Reading dirty bits from /proc\n");
1361 (void)fflush(stdout);
1364 /* Entry points we should be testing, but aren't. */
1365 /* Some can be tested by defining GC_DEBUG at the top of this file */
1366 /* This is a bit SunOS4 specific. */
1367 GC_noop(GC_expand_hp, GC_add_roots, GC_clear_roots,
1368 GC_register_disappearing_link,
1369 GC_register_finalizer_ignore_self,
1370 GC_debug_register_displacement,
1371 GC_print_obj, GC_debug_change_stubborn,
1372 GC_debug_end_stubborn_change, GC_debug_malloc_uncollectable,
1373 GC_debug_free, GC_debug_realloc, GC_generic_malloc_words_small,
1374 GC_init, GC_make_closure, GC_debug_invoke_finalizer,
1375 GC_page_was_ever_dirty, GC_is_fresh,
1376 GC_malloc_ignore_off_page, GC_malloc_atomic_ignore_off_page,
1377 GC_set_max_heap_size, GC_get_bytes_since_gc,
1378 GC_get_total_bytes, GC_pre_incr, GC_post_incr);
1381 GC_win32_free_heap();
1387 #ifdef GC_WIN32_THREADS
1389 unsigned __stdcall thr_run_one_test(void *arg)
1396 HANDLE win_created_h;
1399 LRESULT CALLBACK window_proc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam)
1404 GC_printf0("Received WM_HIBERNATE, calling GC_gcollect\n");
1408 GC_printf0("Received WM_CLOSE, closing window\n");
1409 DestroyWindow(hwnd);
1415 ret = DefWindowProc(hwnd, uMsg, wParam, lParam);
1421 unsigned __stdcall thr_window(void *arg)
1423 WNDCLASS win_class = {
1428 GetModuleHandle(NULL),
1431 (HBRUSH)(COLOR_APPWORKSPACE+1),
1437 if (!RegisterClass(&win_class))
1440 win_handle = CreateWindowEx(
1445 CW_USEDEFAULT, CW_USEDEFAULT, CW_USEDEFAULT, CW_USEDEFAULT,
1448 GetModuleHandle(NULL),
1451 if (win_handle == NULL)
1454 SetEvent(win_created_h);
1456 ShowWindow(win_handle, SW_SHOW);
1457 UpdateWindow(win_handle);
1459 while (GetMessage(&msg, NULL, 0, 0)) {
1460 TranslateMessage(&msg);
1461 DispatchMessage(&msg);
1471 int APIENTRY GC_WinMain(HINSTANCE instance, HINSTANCE prev, LPWSTR cmd, int n)
1473 int APIENTRY WinMain(HINSTANCE instance, HINSTANCE prev, LPSTR cmd, int n)
1485 GC_enable_incremental();
1487 InitializeCriticalSection(&incr_cs);
1488 (void) GC_set_warn_proc(warn_proc);
1490 win_created_h = CreateEvent(NULL, FALSE, FALSE, NULL);
1491 if (win_created_h == (HANDLE)NULL) {
1492 (void)GC_printf1("Event creation failed %lu\n", (unsigned long)GetLastError());
1495 win_thr_h = GC_CreateThread(NULL, 0, thr_window, 0, 0, &thread_id);
1496 if (win_thr_h == (HANDLE)NULL) {
1497 (void)GC_printf1("Thread creation failed %lu\n", (unsigned long)GetLastError());
1500 if (WaitForSingleObject(win_created_h, INFINITE) != WAIT_OBJECT_0)
1502 CloseHandle(win_created_h);
1505 for (i = 0; i < NTEST; i++) {
1506 h[i] = GC_CreateThread(NULL, 0, thr_run_one_test, 0, 0, &thread_id);
1507 if (h[i] == (HANDLE)NULL) {
1508 (void)GC_printf1("Thread creation failed %lu\n", (unsigned long)GetLastError());
1512 # endif /* NTEST > 0 */
1515 for (i = 0; i < NTEST; i++) {
1516 if (WaitForSingleObject(h[i], INFINITE) != WAIT_OBJECT_0) {
1517 (void)GC_printf1("Thread wait failed %lu\n", (unsigned long)GetLastError());
1521 # endif /* NTEST > 0 */
1523 PostMessage(win_handle, WM_CLOSE, 0, 0);
1524 if (WaitForSingleObject(win_thr_h, INFINITE) != WAIT_OBJECT_0)
1531 #endif /* GC_WIN32_THREADS */
1542 /* GC_enable_incremental(); */
1543 (void) GC_set_warn_proc(warn_proc);
1544 th1 = PCR_Th_Fork(run_one_test, 0);
1545 th2 = PCR_Th_Fork(run_one_test, 0);
1547 if (PCR_Th_T_Join(th1, &code, NIL, PCR_allSigsBlocked, PCR_waitForever)
1548 != PCR_ERes_okay || code != 0) {
1549 (void)GC_printf0("Thread 1 failed\n");
1551 if (PCR_Th_T_Join(th2, &code, NIL, PCR_allSigsBlocked, PCR_waitForever)
1552 != PCR_ERes_okay || code != 0) {
1553 (void)GC_printf0("Thread 2 failed\n");
1560 #if defined(GC_SOLARIS_THREADS) || defined(GC_IRIX_THREADS) \
1561 || defined(GC_HPUX_THREADS) || defined(GC_LINUX_THREADS)
1562 void * thr_run_one_test(void * arg)
1569 # define GC_free GC_debug_free
1572 #ifdef GC_SOLARIS_THREADS
1580 GC_INIT(); /* Only needed if gc is dynamic library. */
1581 GC_enable_incremental();
1582 (void) GC_set_warn_proc(warn_proc);
1583 if (thr_keycreate(&fl_key, GC_free) != 0) {
1584 (void)GC_printf1("Key creation failed %lu\n", (unsigned long)code);
1587 if ((code = thr_create(0, 1024*1024, thr_run_one_test, 0, 0, &th1)) != 0) {
1588 (void)GC_printf1("Thread 1 creation failed %lu\n", (unsigned long)code);
1591 if ((code = thr_create(0, 1024*1024, thr_run_one_test, 0, THR_NEW_LWP, &th2)) != 0) {
1592 (void)GC_printf1("Thread 2 creation failed %lu\n", (unsigned long)code);
1596 if ((code = thr_join(th1, 0, 0)) != 0) {
1597 (void)GC_printf1("Thread 1 failed %lu\n", (unsigned long)code);
1600 if (thr_join(th2, 0, 0) != 0) {
1601 (void)GC_printf1("Thread 2 failed %lu\n", (unsigned long)code);
1605 (void)fflush(stdout);
1608 #else /* pthreads */
1613 pthread_attr_t attr;
1616 # ifdef GC_IRIX_THREADS
1617 /* Force a larger stack to be preallocated */
1618 /* Since the initial cant always grow later. */
1619 *((volatile char *)&code - 1024*1024) = 0; /* Require 1 Mb */
1620 # endif /* GC_IRIX_THREADS */
1621 pthread_attr_init(&attr);
1622 # if defined(GC_IRIX_THREADS) || defined(GC_HPUX_THREADS)
1623 pthread_attr_setstacksize(&attr, 1000000);
1626 # if defined(MPROTECT_VDB) && !defined(PARALLEL_MARK) &&!defined(REDIRECT_MALLOC)
1627 GC_enable_incremental();
1628 (void) GC_printf0("Switched to incremental mode\n");
1629 (void) GC_printf0("Emulating dirty bits with mprotect/signals\n");
1631 (void) GC_set_warn_proc(warn_proc);
1632 if ((code = pthread_key_create(&fl_key, 0)) != 0) {
1633 (void)GC_printf1("Key creation failed %lu\n", (unsigned long)code);
1636 if ((code = pthread_create(&th1, &attr, thr_run_one_test, 0)) != 0) {
1637 (void)GC_printf1("Thread 1 creation failed %lu\n", (unsigned long)code);
1640 if ((code = pthread_create(&th2, &attr, thr_run_one_test, 0)) != 0) {
1641 (void)GC_printf1("Thread 2 creation failed %lu\n", (unsigned long)code);
1645 if ((code = pthread_join(th1, 0)) != 0) {
1646 (void)GC_printf1("Thread 1 failed %lu\n", (unsigned long)code);
1649 if (pthread_join(th2, 0) != 0) {
1650 (void)GC_printf1("Thread 2 failed %lu\n", (unsigned long)code);
1654 (void)fflush(stdout);
1655 pthread_attr_destroy(&attr);
1656 GC_printf1("Completed %d collections\n", GC_gc_no);
1659 #endif /* pthreads */
1660 #endif /* SOLARIS_THREADS || IRIX_THREADS || LINUX_THREADS || HPUX_THREADS */