[BACK]Return to test.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / gc

Annotation of OpenXM_contrib2/asir2000/gc/test.c, Revision 1.1.1.1

1.1       noro        1: /*
                      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.
                      5:  *
                      6:  * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
                      7:  * OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.
                      8:  *
                      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.
                     14:  */
                     15: /* An incomplete test for the garbage collector.               */
                     16: /* Some more obscure entry points are not tested at all.       */
                     17:
                     18: # if defined(mips) && defined(SYSTYPE_BSD43)
                     19:     /* MIPS RISCOS 4 */
                     20: # else
                     21: #   include <stdlib.h>
                     22: # endif
                     23: # include <stdio.h>
                     24: # include <assert.h>   /* Not normally used, but handy for debugging. */
                     25: # include "gc.h"
                     26: # include "gc_typed.h"
                     27: # include "gc_priv.h"  /* For output, locking,  and some statistics    */
                     28: # include "gcconfig.h"
                     29:
                     30: # ifdef MSWIN32
                     31: #   include <windows.h>
                     32: # endif
                     33:
                     34: # ifdef PCR
                     35: #   include "th/PCR_ThCrSec.h"
                     36: #   include "th/PCR_Th.h"
                     37: #   undef GC_printf0
                     38: #   define GC_printf0 printf
                     39: #   undef GC_printf1
                     40: #   define GC_printf1 printf
                     41: # endif
                     42:
                     43: # ifdef SOLARIS_THREADS
                     44: #   include <thread.h>
                     45: #   include <synch.h>
                     46: # endif
                     47:
                     48: # if defined(IRIX_THREADS) || defined(LINUX_THREADS)
                     49: #   include <pthread.h>
                     50: # endif
                     51:
                     52: # ifdef WIN32_THREADS
                     53: #   include <process.h>
                     54:     static CRITICAL_SECTION incr_cs;
                     55: # endif
                     56: # if defined(PCR) || defined(SOLARIS_THREADS) || defined(WIN32_THREADS)
                     57: #   define THREADS
                     58: # endif
                     59:
                     60: # ifdef AMIGA
                     61:    long __stack = 200000;
                     62: # endif
                     63:
                     64: # define FAIL (void)abort()
                     65:
                     66: /* AT_END may be defined to excercise the interior pointer test        */
                     67: /* if the collector is configured with ALL_INTERIOR_POINTERS.   */
                     68: /* As it stands, this test should succeed with either          */
                     69: /* configuration.  In the FIND_LEAK configuration, it should   */
                     70: /* find lots of leaks, since we free almost nothing.           */
                     71:
                     72: struct SEXPR {
                     73:     struct SEXPR * sexpr_car;
                     74:     struct SEXPR * sexpr_cdr;
                     75: };
                     76:
                     77:
                     78: typedef struct SEXPR * sexpr;
                     79:
                     80: # define INT_TO_SEXPR(x) ((sexpr)(unsigned long)(x))
                     81:
                     82: # undef nil
                     83: # define nil (INT_TO_SEXPR(0))
                     84: # define car(x) ((x) -> sexpr_car)
                     85: # define cdr(x) ((x) -> sexpr_cdr)
                     86: # define is_nil(x) ((x) == nil)
                     87:
                     88:
                     89: int extra_count = 0;        /* Amount of space wasted in cons node */
                     90:
                     91: /* Silly implementation of Lisp cons. Intentionally wastes lots of space */
                     92: /* to test collector.                                                    */
                     93: sexpr cons (x, y)
                     94: sexpr x;
                     95: sexpr y;
                     96: {
                     97:     register sexpr r;
                     98:     register int *p;
                     99:     register int my_extra = extra_count;
                    100:
                    101:     r = (sexpr) GC_MALLOC_STUBBORN(sizeof(struct SEXPR) + my_extra);
                    102:     if (r == 0) {
                    103:         (void)GC_printf0("Out of memory\n");
                    104:         exit(1);
                    105:     }
                    106:     for (p = (int *)r;
                    107:          ((char *)p) < ((char *)r) + my_extra + sizeof(struct SEXPR); p++) {
                    108:        if (*p) {
                    109:            (void)GC_printf1("Found nonzero at 0x%lx - allocator is broken\n",
                    110:                             (unsigned long)p);
                    111:            FAIL;
                    112:         }
                    113:         *p = 13;
                    114:     }
                    115: #   ifdef AT_END
                    116:        r = (sexpr)((char *)r + (my_extra & ~7));
                    117: #   endif
                    118:     r -> sexpr_car = x;
                    119:     r -> sexpr_cdr = y;
                    120:     my_extra++;
                    121:     if ( my_extra >= 5000 ) {
                    122:         extra_count = 0;
                    123:     } else {
                    124:         extra_count = my_extra;
                    125:     }
                    126:     GC_END_STUBBORN_CHANGE((char *)r);
                    127:     return(r);
                    128: }
                    129:
                    130: sexpr small_cons (x, y)
                    131: sexpr x;
                    132: sexpr y;
                    133: {
                    134:     register sexpr r;
                    135:
                    136:     r = (sexpr) GC_MALLOC(sizeof(struct SEXPR));
                    137:     if (r == 0) {
                    138:         (void)GC_printf0("Out of memory\n");
                    139:         exit(1);
                    140:     }
                    141:     r -> sexpr_car = x;
                    142:     r -> sexpr_cdr = y;
                    143:     return(r);
                    144: }
                    145:
                    146: sexpr small_cons_uncollectable (x, y)
                    147: sexpr x;
                    148: sexpr y;
                    149: {
                    150:     register sexpr r;
                    151:
                    152:     r = (sexpr) GC_MALLOC_UNCOLLECTABLE(sizeof(struct SEXPR));
                    153: assert(GC_is_marked(r));
                    154:     if (r == 0) {
                    155:         (void)GC_printf0("Out of memory\n");
                    156:         exit(1);
                    157:     }
                    158:     r -> sexpr_car = x;
                    159:     r -> sexpr_cdr = (sexpr)(~(unsigned long)y);
                    160:     return(r);
                    161: }
                    162:
                    163: /* Return reverse(x) concatenated with y */
                    164: sexpr reverse1(x, y)
                    165: sexpr x, y;
                    166: {
                    167:     if (is_nil(x)) {
                    168:         return(y);
                    169:     } else {
                    170:         return( reverse1(cdr(x), cons(car(x), y)) );
                    171:     }
                    172: }
                    173:
                    174: sexpr reverse(x)
                    175: sexpr x;
                    176: {
                    177:     return( reverse1(x, nil) );
                    178: }
                    179:
                    180: sexpr ints(low, up)
                    181: int low, up;
                    182: {
                    183:     if (low > up) {
                    184:        return(nil);
                    185:     } else {
                    186:         return(small_cons(small_cons(INT_TO_SEXPR(low), nil), ints(low+1, up)));
                    187:     }
                    188: }
                    189:
                    190: /* To check uncollectable allocation we build lists with disguised cdr */
                    191: /* pointers, and make sure they don't go away.                         */
                    192: sexpr uncollectable_ints(low, up)
                    193: int low, up;
                    194: {
                    195:     if (low > up) {
                    196:        return(nil);
                    197:     } else {
                    198:         return(small_cons_uncollectable(small_cons(INT_TO_SEXPR(low), nil),
                    199:                uncollectable_ints(low+1, up)));
                    200:     }
                    201: }
                    202:
                    203: void check_ints(list, low, up)
                    204: sexpr list;
                    205: int low, up;
                    206: {
                    207:     if ((int)(GC_word)(car(car(list))) != low) {
                    208:         (void)GC_printf0(
                    209:            "List reversal produced incorrect list - collector is broken\n");
                    210:         FAIL;
                    211:     }
                    212:     if (low == up) {
                    213:         if (cdr(list) != nil) {
                    214:            (void)GC_printf0("List too long - collector is broken\n");
                    215:            FAIL;
                    216:         }
                    217:     } else {
                    218:         check_ints(cdr(list), low+1, up);
                    219:     }
                    220: }
                    221:
                    222: # define UNCOLLECTABLE_CDR(x) (sexpr)(~(unsigned long)(cdr(x)))
                    223:
                    224: void check_uncollectable_ints(list, low, up)
                    225: sexpr list;
                    226: int low, up;
                    227: {
                    228: assert(GC_is_marked(list));
                    229:     if ((int)(GC_word)(car(car(list))) != low) {
                    230:         (void)GC_printf0(
                    231:            "Uncollectable list corrupted - collector is broken\n");
                    232:         FAIL;
                    233:     }
                    234:     if (low == up) {
                    235:         if (UNCOLLECTABLE_CDR(list) != nil) {
                    236:            (void)GC_printf0("Uncollectable list too long - collector is broken\n");
                    237:            FAIL;
                    238:         }
                    239:     } else {
                    240:         check_uncollectable_ints(UNCOLLECTABLE_CDR(list), low+1, up);
                    241:     }
                    242: }
                    243:
                    244: /* Not used, but useful for debugging: */
                    245: void print_int_list(x)
                    246: sexpr x;
                    247: {
                    248:     if (is_nil(x)) {
                    249:         (void)GC_printf0("NIL\n");
                    250:     } else {
                    251:         (void)GC_printf1("(%ld)", (long)(car(car(x))));
                    252:         if (!is_nil(cdr(x))) {
                    253:             (void)GC_printf0(", ");
                    254:             (void)print_int_list(cdr(x));
                    255:         } else {
                    256:             (void)GC_printf0("\n");
                    257:         }
                    258:     }
                    259: }
                    260:
                    261: /* Try to force a to be strangely aligned */
                    262: struct {
                    263:   char dummy;
                    264:   sexpr aa;
                    265: } A;
                    266: #define a A.aa
                    267:
                    268: /*
                    269:  * A tiny list reversal test to check thread creation.
                    270:  */
                    271: #ifdef THREADS
                    272:
                    273: # ifdef WIN32_THREADS
                    274:     unsigned __stdcall tiny_reverse_test(void * arg)
                    275: # else
                    276:     void * tiny_reverse_test(void * arg)
                    277: # endif
                    278: {
                    279:     check_ints(reverse(reverse(ints(1,10))), 1, 10);
                    280:     return 0;
                    281: }
                    282:
                    283: # if defined(IRIX_THREADS) || defined(LINUX_THREADS) \
                    284:      || defined(SOLARIS_PTHREADS)
                    285:     void fork_a_thread()
                    286:     {
                    287:       pthread_t t;
                    288:       int code;
                    289:       if ((code = pthread_create(&t, 0, tiny_reverse_test, 0)) != 0) {
                    290:        (void)GC_printf1("Small thread creation failed %lu\n",
                    291:                         (unsigned long)code);
                    292:        FAIL;
                    293:       }
                    294:       if ((code = pthread_join(t, 0)) != 0) {
                    295:         (void)GC_printf1("Small thread join failed %lu\n",
                    296:        (unsigned long)code);
                    297:         FAIL;
                    298:       }
                    299:     }
                    300:
                    301: # elif defined(WIN32_THREADS)
                    302:     void fork_a_thread()
                    303:     {
                    304:        unsigned thread_id;
                    305:        HANDLE h;
                    306:        h = (HANDLE)_beginthreadex(NULL, 0, tiny_reverse_test,
                    307:                                   0, 0, &thread_id);
                    308:         if (h == (HANDLE)-1) {
                    309:             (void)GC_printf1("Small thread creation failed %lu\n",
                    310:                             (unsigned long)GetLastError());
                    311:            FAIL;
                    312:         }
                    313:        if (WaitForSingleObject(h, INFINITE) != WAIT_OBJECT_0) {
                    314:            (void)GC_printf1("Small thread wait failed %lu\n",
                    315:                             (unsigned long)GetLastError());
                    316:            FAIL;
                    317:        }
                    318:     }
                    319:
                    320: /* # elif defined(SOLARIS_THREADS) */
                    321:
                    322: # else
                    323:
                    324: #   define fork_a_thread()
                    325:
                    326: # endif
                    327:
                    328: #else
                    329:
                    330: # define fork_a_thread()
                    331:
                    332: #endif
                    333:
                    334: /*
                    335:  * Repeatedly reverse lists built out of very different sized cons cells.
                    336:  * Check that we didn't lose anything.
                    337:  */
                    338: void reverse_test()
                    339: {
                    340:     int i;
                    341:     sexpr b;
                    342:     sexpr c;
                    343:     sexpr d;
                    344:     sexpr e;
                    345:     sexpr *f, *g, *h;
                    346: #   if defined(MSWIN32) || defined(MACOS)
                    347:       /* Win32S only allows 128K stacks */
                    348: #     define BIG 1000
                    349: #   else
                    350: #     if defined PCR
                    351:        /* PCR default stack is 100K.  Stack frames are up to 120 bytes. */
                    352: #      define BIG 700
                    353: #     else
                    354: #       define BIG 4500
                    355: #     endif
                    356: #   endif
                    357:
                    358:     A.dummy = 17;
                    359:     a = ints(1, 49);
                    360:     b = ints(1, 50);
                    361:     c = ints(1, BIG);
                    362:     d = uncollectable_ints(1, 100);
                    363:     e = uncollectable_ints(1, 1);
                    364:     /* Check that realloc updates object descriptors correctly */
                    365:     f = (sexpr *)GC_malloc(4 * sizeof(sexpr));
                    366:     f = (sexpr *)GC_realloc((GC_PTR)f, 6 * sizeof(sexpr));
                    367:     f[5] = ints(1,17);
                    368:     g = (sexpr *)GC_malloc(513 * sizeof(sexpr));
                    369:     g = (sexpr *)GC_realloc((GC_PTR)g, 800 * sizeof(sexpr));
                    370:     g[799] = ints(1,18);
                    371:     h = (sexpr *)GC_malloc(1025 * sizeof(sexpr));
                    372:     h = (sexpr *)GC_realloc((GC_PTR)h, 2000 * sizeof(sexpr));
                    373:     h[1999] = ints(1,19);
                    374:     /* Try to force some collections and reuse of small list elements */
                    375:       for (i = 0; i < 10; i++) {
                    376:         (void)ints(1, BIG);
                    377:       }
                    378:     /* Superficially test interior pointer recognition on stack */
                    379:     c = (sexpr)((char *)c + sizeof(char *));
                    380:     d = (sexpr)((char *)d + sizeof(char *));
                    381:
                    382: #   ifdef __STDC__
                    383:         GC_FREE((void *)e);
                    384: #   else
                    385:         GC_FREE((char *)e);
                    386: #   endif
                    387:     check_ints(b,1,50);
                    388:     check_ints(a,1,49);
                    389:     for (i = 0; i < 50; i++) {
                    390:         check_ints(b,1,50);
                    391:         b = reverse(reverse(b));
                    392:     }
                    393:     check_ints(b,1,50);
                    394:     check_ints(a,1,49);
                    395:     for (i = 0; i < 60; i++) {
                    396:        if (i % 10 == 0) fork_a_thread();
                    397:        /* This maintains the invariant that a always points to a list of */
                    398:        /* 49 integers.  Thus this is thread safe without locks,          */
                    399:        /* assuming atomic pointer assignments.                           */
                    400:         a = reverse(reverse(a));
                    401: #      if !defined(AT_END) && !defined(THREADS)
                    402:          /* This is not thread safe, since realloc explicitly deallocates */
                    403:           if (i & 1) {
                    404:             a = (sexpr)GC_REALLOC((GC_PTR)a, 500);
                    405:           } else {
                    406:             a = (sexpr)GC_REALLOC((GC_PTR)a, 8200);
                    407:           }
                    408: #      endif
                    409:     }
                    410:     check_ints(a,1,49);
                    411:     check_ints(b,1,50);
                    412:     c = (sexpr)((char *)c - sizeof(char *));
                    413:     d = (sexpr)((char *)d - sizeof(char *));
                    414:     check_ints(c,1,BIG);
                    415:     check_uncollectable_ints(d, 1, 100);
                    416:     check_ints(f[5], 1,17);
                    417:     check_ints(g[799], 1,18);
                    418:     check_ints(h[1999], 1,19);
                    419: #   ifndef THREADS
                    420:        a = 0;
                    421: #   endif
                    422:     b = c = 0;
                    423: }
                    424:
                    425: /*
                    426:  * The rest of this builds balanced binary trees, checks that they don't
                    427:  * disappear, and tests finalization.
                    428:  */
                    429: typedef struct treenode {
                    430:     int level;
                    431:     struct treenode * lchild;
                    432:     struct treenode * rchild;
                    433: } tn;
                    434:
                    435: int finalizable_count = 0;
                    436: int finalized_count = 0;
                    437: VOLATILE int dropped_something = 0;
                    438:
                    439: # ifdef __STDC__
                    440:   void finalizer(void * obj, void * client_data)
                    441: # else
                    442:   void finalizer(obj, client_data)
                    443:   char * obj;
                    444:   char * client_data;
                    445: # endif
                    446: {
                    447:   tn * t = (tn *)obj;
                    448:
                    449: # ifdef PCR
                    450:      PCR_ThCrSec_EnterSys();
                    451: # endif
                    452: # ifdef SOLARIS_THREADS
                    453:     static mutex_t incr_lock;
                    454:     mutex_lock(&incr_lock);
                    455: # endif
                    456: # if  defined(IRIX_THREADS) || defined(LINUX_THREADS)
                    457:     static pthread_mutex_t incr_lock = PTHREAD_MUTEX_INITIALIZER;
                    458:     pthread_mutex_lock(&incr_lock);
                    459: # endif
                    460: # ifdef WIN32_THREADS
                    461:     EnterCriticalSection(&incr_cs);
                    462: # endif
                    463:   if ((int)(GC_word)client_data != t -> level) {
                    464:      (void)GC_printf0("Wrong finalization data - collector is broken\n");
                    465:      FAIL;
                    466:   }
                    467:   finalized_count++;
                    468: # ifdef PCR
                    469:     PCR_ThCrSec_ExitSys();
                    470: # endif
                    471: # ifdef SOLARIS_THREADS
                    472:     mutex_unlock(&incr_lock);
                    473: # endif
                    474: # if defined(IRIX_THREADS) || defined(LINUX_THREADS)
                    475:     pthread_mutex_unlock(&incr_lock);
                    476: # endif
                    477: # ifdef WIN32_THREADS
                    478:     LeaveCriticalSection(&incr_cs);
                    479: # endif
                    480: }
                    481:
                    482: size_t counter = 0;
                    483:
                    484: # define MAX_FINALIZED 8000
                    485:
                    486: # if !defined(MACOS)
                    487:   GC_FAR GC_word live_indicators[MAX_FINALIZED] = {0};
                    488: #else
                    489:   /* Too big for THINK_C. have to allocate it dynamically. */
                    490:   GC_word *live_indicators = 0;
                    491: #endif
                    492:
                    493: int live_indicators_count = 0;
                    494:
                    495: tn * mktree(n)
                    496: int n;
                    497: {
                    498:     tn * result = (tn *)GC_MALLOC(sizeof(tn));
                    499:
                    500: #if defined(MACOS)
                    501:        /* get around static data limitations. */
                    502:        if (!live_indicators)
                    503:                live_indicators =
                    504:                    (GC_word*)NewPtrClear(MAX_FINALIZED * sizeof(GC_word));
                    505:        if (!live_indicators) {
                    506:         (void)GC_printf0("Out of memory\n");
                    507:         exit(1);
                    508:     }
                    509: #endif
                    510:     if (n == 0) return(0);
                    511:     if (result == 0) {
                    512:         (void)GC_printf0("Out of memory\n");
                    513:         exit(1);
                    514:     }
                    515:     result -> level = n;
                    516:     result -> lchild = mktree(n-1);
                    517:     result -> rchild = mktree(n-1);
                    518:     if (counter++ % 17 == 0 && n >= 2) {
                    519:         tn * tmp = result -> lchild -> rchild;
                    520:
                    521:         result -> lchild -> rchild = result -> rchild -> lchild;
                    522:         result -> rchild -> lchild = tmp;
                    523:     }
                    524:     if (counter++ % 119 == 0) {
                    525:         int my_index;
                    526:
                    527:         {
                    528: #        ifdef PCR
                    529:            PCR_ThCrSec_EnterSys();
                    530: #        endif
                    531: #        ifdef SOLARIS_THREADS
                    532:            static mutex_t incr_lock;
                    533:            mutex_lock(&incr_lock);
                    534: #        endif
                    535: #         if defined(IRIX_THREADS) || defined(LINUX_THREADS)
                    536:             static pthread_mutex_t incr_lock = PTHREAD_MUTEX_INITIALIZER;
                    537:             pthread_mutex_lock(&incr_lock);
                    538: #         endif
                    539: #         ifdef WIN32_THREADS
                    540:             EnterCriticalSection(&incr_cs);
                    541: #         endif
                    542:                /* Losing a count here causes erroneous report of failure. */
                    543:           finalizable_count++;
                    544:           my_index = live_indicators_count++;
                    545: #        ifdef PCR
                    546:            PCR_ThCrSec_ExitSys();
                    547: #        endif
                    548: #        ifdef SOLARIS_THREADS
                    549:            mutex_unlock(&incr_lock);
                    550: #        endif
                    551: #        if defined(IRIX_THREADS) || defined(LINUX_THREADS)
                    552:            pthread_mutex_unlock(&incr_lock);
                    553: #        endif
                    554: #         ifdef WIN32_THREADS
                    555:             LeaveCriticalSection(&incr_cs);
                    556: #         endif
                    557:        }
                    558:
                    559:         GC_REGISTER_FINALIZER((GC_PTR)result, finalizer, (GC_PTR)(GC_word)n,
                    560:                              (GC_finalization_proc *)0, (GC_PTR *)0);
                    561:         if (my_index >= MAX_FINALIZED) {
                    562:                GC_printf0("live_indicators overflowed\n");
                    563:                FAIL;
                    564:        }
                    565:         live_indicators[my_index] = 13;
                    566:         if (GC_GENERAL_REGISTER_DISAPPEARING_LINK(
                    567:                (GC_PTR *)(&(live_indicators[my_index])),
                    568:                (GC_PTR)result) != 0) {
                    569:                GC_printf0("GC_general_register_disappearing_link failed\n");
                    570:                FAIL;
                    571:         }
                    572:         if (GC_unregister_disappearing_link(
                    573:                (GC_PTR *)
                    574:                   (&(live_indicators[my_index]))) == 0) {
                    575:                GC_printf0("GC_unregister_disappearing_link failed\n");
                    576:                FAIL;
                    577:         }
                    578:         if (GC_GENERAL_REGISTER_DISAPPEARING_LINK(
                    579:                (GC_PTR *)(&(live_indicators[my_index])),
                    580:                (GC_PTR)result) != 0) {
                    581:                GC_printf0("GC_general_register_disappearing_link failed 2\n");
                    582:                FAIL;
                    583:         }
                    584:     }
                    585:     return(result);
                    586: }
                    587:
                    588: void chktree(t,n)
                    589: tn *t;
                    590: int n;
                    591: {
                    592:     if (n == 0 && t != 0) {
                    593:         (void)GC_printf0("Clobbered a leaf - collector is broken\n");
                    594:         FAIL;
                    595:     }
                    596:     if (n == 0) return;
                    597:     if (t -> level != n) {
                    598:         (void)GC_printf1("Lost a node at level %lu - collector is broken\n",
                    599:                         (unsigned long)n);
                    600:         FAIL;
                    601:     }
                    602:     if (counter++ % 373 == 0) (void) GC_MALLOC(counter%5001);
                    603:     chktree(t -> lchild, n-1);
                    604:     if (counter++ % 73 == 0) (void) GC_MALLOC(counter%373);
                    605:     chktree(t -> rchild, n-1);
                    606: }
                    607:
                    608: # if defined(SOLARIS_THREADS) && !defined(_SOLARIS_PTHREADS)
                    609: thread_key_t fl_key;
                    610:
                    611: void * alloc8bytes()
                    612: {
                    613: # ifdef SMALL_CONFIG
                    614:     return(GC_malloc(8));
                    615: # else
                    616:     void ** my_free_list_ptr;
                    617:     void * my_free_list;
                    618:
                    619:     if (thr_getspecific(fl_key, (void **)(&my_free_list_ptr)) != 0) {
                    620:        (void)GC_printf0("thr_getspecific failed\n");
                    621:        FAIL;
                    622:     }
                    623:     if (my_free_list_ptr == 0) {
                    624:         my_free_list_ptr = GC_NEW_UNCOLLECTABLE(void *);
                    625:         if (thr_setspecific(fl_key, my_free_list_ptr) != 0) {
                    626:            (void)GC_printf0("thr_setspecific failed\n");
                    627:            FAIL;
                    628:         }
                    629:     }
                    630:     my_free_list = *my_free_list_ptr;
                    631:     if (my_free_list == 0) {
                    632:         my_free_list = GC_malloc_many(8);
                    633:         if (my_free_list == 0) {
                    634:             (void)GC_printf0("alloc8bytes out of memory\n");
                    635:            FAIL;
                    636:         }
                    637:     }
                    638:     *my_free_list_ptr = GC_NEXT(my_free_list);
                    639:     GC_NEXT(my_free_list) = 0;
                    640:     return(my_free_list);
                    641: # endif
                    642: }
                    643:
                    644: #else
                    645:
                    646: # if defined(_SOLARIS_PTHREADS) || defined(IRIX_THREADS) \
                    647:      || defined(LINUX_THREADS)
                    648: pthread_key_t fl_key;
                    649:
                    650: void * alloc8bytes()
                    651: {
                    652: # ifdef SMALL_CONFIG
                    653:     return(GC_malloc(8));
                    654: # else
                    655:     void ** my_free_list_ptr;
                    656:     void * my_free_list;
                    657:
                    658:     my_free_list_ptr = (void **)pthread_getspecific(fl_key);
                    659:     if (my_free_list_ptr == 0) {
                    660:         my_free_list_ptr = GC_NEW_UNCOLLECTABLE(void *);
                    661:         if (pthread_setspecific(fl_key, my_free_list_ptr) != 0) {
                    662:            (void)GC_printf0("pthread_setspecific failed\n");
                    663:            FAIL;
                    664:         }
                    665:     }
                    666:     my_free_list = *my_free_list_ptr;
                    667:     if (my_free_list == 0) {
                    668:         my_free_list = GC_malloc_many(8);
                    669:         if (my_free_list == 0) {
                    670:             (void)GC_printf0("alloc8bytes out of memory\n");
                    671:            FAIL;
                    672:         }
                    673:     }
                    674:     *my_free_list_ptr = GC_NEXT(my_free_list);
                    675:     GC_NEXT(my_free_list) = 0;
                    676:     return(my_free_list);
                    677: # endif
                    678: }
                    679:
                    680: # else
                    681: #   define alloc8bytes() GC_MALLOC_ATOMIC(8)
                    682: # endif
                    683: #endif
                    684:
                    685: void alloc_small(n)
                    686: int n;
                    687: {
                    688:     register int i;
                    689:
                    690:     for (i = 0; i < n; i += 8) {
                    691:         if (alloc8bytes() == 0) {
                    692:             (void)GC_printf0("Out of memory\n");
                    693:             FAIL;
                    694:         }
                    695:     }
                    696: }
                    697:
                    698: # if defined(THREADS) && defined(GC_DEBUG)
                    699: #   define TREE_HEIGHT 15
                    700: # else
                    701: #   define TREE_HEIGHT 16
                    702: # endif
                    703: void tree_test()
                    704: {
                    705:     tn * root;
                    706:     register int i;
                    707:
                    708:     root = mktree(TREE_HEIGHT);
                    709:     alloc_small(5000000);
                    710:     chktree(root, TREE_HEIGHT);
                    711:     if (finalized_count && ! dropped_something) {
                    712:         (void)GC_printf0("Premature finalization - collector is broken\n");
                    713:         FAIL;
                    714:     }
                    715:     dropped_something = 1;
                    716:     GC_noop(root);     /* Root needs to remain live until      */
                    717:                        /* dropped_something is set.            */
                    718:     root = mktree(TREE_HEIGHT);
                    719:     chktree(root, TREE_HEIGHT);
                    720:     for (i = TREE_HEIGHT; i >= 0; i--) {
                    721:         root = mktree(i);
                    722:         chktree(root, i);
                    723:     }
                    724:     alloc_small(5000000);
                    725: }
                    726:
                    727: unsigned n_tests = 0;
                    728:
                    729: GC_word bm_huge[10] = {
                    730:     0xffffffff,
                    731:     0xffffffff,
                    732:     0xffffffff,
                    733:     0xffffffff,
                    734:     0xffffffff,
                    735:     0xffffffff,
                    736:     0xffffffff,
                    737:     0xffffffff,
                    738:     0xffffffff,
                    739:     0x00ffffff,
                    740: };
                    741:
                    742:
                    743: /* A very simple test of explicitly typed allocation   */
                    744: void typed_test()
                    745: {
                    746:     GC_word * old, * new;
                    747:     GC_word bm3 = 0x3;
                    748:     GC_word bm2 = 0x2;
                    749:     GC_word bm_large = 0xf7ff7fff;
                    750:     GC_descr d1 = GC_make_descriptor(&bm3, 2);
                    751:     GC_descr d2 = GC_make_descriptor(&bm2, 2);
                    752: #   ifndef LINT
                    753:       GC_descr dummy = GC_make_descriptor(&bm_large, 32);
                    754: #   endif
                    755:     GC_descr d3 = GC_make_descriptor(&bm_large, 32);
                    756:     GC_descr d4 = GC_make_descriptor(bm_huge, 320);
                    757:     GC_word * x = (GC_word *)GC_malloc_explicitly_typed(2000, d4);
                    758:     register int i;
                    759:
                    760:     old = 0;
                    761:     for (i = 0; i < 4000; i++) {
                    762:         new = (GC_word *) GC_malloc_explicitly_typed(4 * sizeof(GC_word), d1);
                    763:         new[0] = 17;
                    764:         new[1] = (GC_word)old;
                    765:         old = new;
                    766:         new = (GC_word *) GC_malloc_explicitly_typed(4 * sizeof(GC_word), d2);
                    767:         new[0] = 17;
                    768:         new[1] = (GC_word)old;
                    769:         old = new;
                    770:         new = (GC_word *) GC_malloc_explicitly_typed(33 * sizeof(GC_word), d3);
                    771:         new[0] = 17;
                    772:         new[1] = (GC_word)old;
                    773:         old = new;
                    774:         new = (GC_word *) GC_calloc_explicitly_typed(4, 2 * sizeof(GC_word),
                    775:                                                     d1);
                    776:         new[0] = 17;
                    777:         new[1] = (GC_word)old;
                    778:         old = new;
                    779:         if (i & 0xff) {
                    780:           new = (GC_word *) GC_calloc_explicitly_typed(7, 3 * sizeof(GC_word),
                    781:                                                     d2);
                    782:         } else {
                    783:           new = (GC_word *) GC_calloc_explicitly_typed(1001,
                    784:                                                       3 * sizeof(GC_word),
                    785:                                                       d2);
                    786:         }
                    787:         new[0] = 17;
                    788:         new[1] = (GC_word)old;
                    789:         old = new;
                    790:     }
                    791:     for (i = 0; i < 20000; i++) {
                    792:         if (new[0] != 17) {
                    793:             (void)GC_printf1("typed alloc failed at %lu\n",
                    794:                             (unsigned long)i);
                    795:             FAIL;
                    796:         }
                    797:         new[0] = 0;
                    798:         old = new;
                    799:         new = (GC_word *)(old[1]);
                    800:     }
                    801:     GC_gcollect();
                    802:     GC_noop(x);
                    803: }
                    804:
                    805: int fail_count = 0;
                    806:
                    807: #ifndef __STDC__
                    808: /*ARGSUSED*/
                    809: void fail_proc1(x)
                    810: GC_PTR x;
                    811: {
                    812:     fail_count++;
                    813: }
                    814:
                    815: #else
                    816:
                    817: /*ARGSUSED*/
                    818: void fail_proc1(GC_PTR x)
                    819: {
                    820:     fail_count++;
                    821: }
                    822:
                    823: #endif /* __STDC__ */
                    824:
                    825: #ifdef THREADS
                    826: #   define TEST_FAIL_COUNT(n) 1
                    827: #else
                    828: #   define TEST_FAIL_COUNT(n) (fail_count >= (n))
                    829: #endif
                    830:
                    831: void run_one_test()
                    832: {
                    833:     char *x;
                    834: #   ifdef LINT
                    835:        char *y = 0;
                    836: #   else
                    837:        char *y = (char *)(size_t)fail_proc1;
                    838: #   endif
                    839:     DCL_LOCK_STATE;
                    840:
                    841: #   ifdef FIND_LEAK
                    842:        (void)GC_printf0(
                    843:                "This test program is not designed for leak detection mode\n");
                    844:        (void)GC_printf0("Expect lots of problems.\n");
                    845: #   endif
                    846:     if (GC_size(GC_malloc(7)) != 8
                    847:        || GC_size(GC_malloc(15)) != 16) {
                    848:            (void)GC_printf0("GC_size produced unexpected results\n");
                    849:            FAIL;
                    850:     }
                    851:     if (GC_size(GC_malloc(0)) != 4 && GC_size(GC_malloc(0)) != 8) {
                    852:        (void)GC_printf0("GC_malloc(0) failed\n");
                    853:            FAIL;
                    854:     }
                    855:     if (GC_size(GC_malloc_uncollectable(0)) != 4
                    856:         && GC_size(GC_malloc_uncollectable(0)) != 8) {
                    857:        (void)GC_printf0("GC_malloc_uncollectable(0) failed\n");
                    858:            FAIL;
                    859:     }
                    860:     GC_is_valid_displacement_print_proc = fail_proc1;
                    861:     GC_is_visible_print_proc = fail_proc1;
                    862:     x = GC_malloc(16);
                    863:     if (GC_base(x + 13) != x) {
                    864:        (void)GC_printf0("GC_base(heap ptr) produced incorrect result\n");
                    865:        FAIL;
                    866:     }
                    867: #   ifndef PCR
                    868:       if (GC_base(y) != 0) {
                    869:        (void)GC_printf0("GC_base(fn_ptr) produced incorrect result\n");
                    870:        FAIL;
                    871:       }
                    872: #   endif
                    873:     if (GC_same_obj(x+5, x) != x + 5) {
                    874:        (void)GC_printf0("GC_same_obj produced incorrect result\n");
                    875:        FAIL;
                    876:     }
                    877:     if (GC_is_visible(y) != y || GC_is_visible(x) != x) {
                    878:        (void)GC_printf0("GC_is_visible produced incorrect result\n");
                    879:        FAIL;
                    880:     }
                    881:     if (!TEST_FAIL_COUNT(1)) {
                    882: #      if!(defined(RS6000) || defined(POWERPC))
                    883:          /* ON RS6000s function pointers point to a descriptor in the  */
                    884:          /* data segment, so there should have been no failures.       */
                    885:          (void)GC_printf0("GC_is_visible produced wrong failure indication\n");
                    886:          FAIL;
                    887: #      endif
                    888:     }
                    889:     if (GC_is_valid_displacement(y) != y
                    890:         || GC_is_valid_displacement(x) != x
                    891:         || GC_is_valid_displacement(x + 3) != x + 3) {
                    892:        (void)GC_printf0(
                    893:                "GC_is_valid_displacement produced incorrect result\n");
                    894:        FAIL;
                    895:     }
                    896: #   ifndef ALL_INTERIOR_POINTERS
                    897: #    if defined(RS6000) || defined(POWERPC)
                    898:       if (!TEST_FAIL_COUNT(1)) {
                    899: #    else
                    900:       if (!TEST_FAIL_COUNT(2)) {
                    901: #    endif
                    902:        (void)GC_printf0("GC_is_valid_displacement produced wrong failure indication\n");
                    903:        FAIL;
                    904:       }
                    905: #   endif
                    906:     /* Test floating point alignment */
                    907:        *(double *)GC_MALLOC(sizeof(double)) = 1.0;
                    908:        *(double *)GC_MALLOC(sizeof(double)) = 1.0;
                    909:     /* Repeated list reversal test. */
                    910:        reverse_test();
                    911: #   ifdef PRINTSTATS
                    912:        GC_printf0("-------------Finished reverse_test\n");
                    913: #   endif
                    914:     typed_test();
                    915: #   ifdef PRINTSTATS
                    916:        GC_printf0("-------------Finished typed_test\n");
                    917: #   endif
                    918:     tree_test();
                    919:     LOCK();
                    920:     n_tests++;
                    921:     UNLOCK();
                    922:     /* GC_printf1("Finished %x\n", pthread_self()); */
                    923: }
                    924:
                    925: void check_heap_stats()
                    926: {
                    927:     unsigned long max_heap_sz;
                    928:     register int i;
                    929:     int still_live;
                    930:     int late_finalize_count = 0;
                    931:
                    932:     if (sizeof(char *) > 4) {
                    933:         max_heap_sz = 15000000;
                    934:     } else {
                    935:        max_heap_sz = 11000000;
                    936:     }
                    937: #   ifdef GC_DEBUG
                    938:        max_heap_sz *= 2;
                    939: #       ifdef SPARC
                    940:            max_heap_sz *= 2;
                    941: #       endif
                    942: #   endif
                    943:     /* Garbage collect repeatedly so that all inaccessible objects     */
                    944:     /* can be finalized.                                               */
                    945:       while (GC_collect_a_little()) { }
                    946:       for (i = 0; i < 16; i++) {
                    947:         GC_gcollect();
                    948:         late_finalize_count += GC_invoke_finalizers();
                    949:       }
                    950:     (void)GC_printf1("Completed %lu tests\n", (unsigned long)n_tests);
                    951:     (void)GC_printf2("Finalized %lu/%lu objects - ",
                    952:                     (unsigned long)finalized_count,
                    953:                     (unsigned long)finalizable_count);
                    954: #   ifdef FINALIZE_ON_DEMAND
                    955:        if (finalized_count != late_finalize_count) {
                    956:             (void)GC_printf0("Demand finalization error\n");
                    957:            FAIL;
                    958:        }
                    959: #   endif
                    960:     if (finalized_count > finalizable_count
                    961:         || finalized_count < finalizable_count/2) {
                    962:         (void)GC_printf0("finalization is probably broken\n");
                    963:         FAIL;
                    964:     } else {
                    965:         (void)GC_printf0("finalization is probably ok\n");
                    966:     }
                    967:     still_live = 0;
                    968:     for (i = 0; i < MAX_FINALIZED; i++) {
                    969:        if (live_indicators[i] != 0) {
                    970:            still_live++;
                    971:        }
                    972:     }
                    973:     i = finalizable_count - finalized_count - still_live;
                    974:     if (0 != i) {
                    975:         (void)GC_printf2
                    976:             ("%lu disappearing links remain and %lu more objects were not finalized\n",
                    977:              (unsigned long) still_live, (unsigned long)i);
                    978:         if (i > 10) {
                    979:            GC_printf0("\tVery suspicious!\n");
                    980:        } else {
                    981:            GC_printf0("\tSlightly suspicious, but probably OK.\n");
                    982:        }
                    983:     }
                    984:     (void)GC_printf1("Total number of bytes allocated is %lu\n",
                    985:                (unsigned long)
                    986:                   WORDS_TO_BYTES(GC_words_allocd + GC_words_allocd_before_gc));
                    987:     (void)GC_printf1("Final heap size is %lu bytes\n",
                    988:                     (unsigned long)GC_get_heap_size());
                    989:     if (WORDS_TO_BYTES(GC_words_allocd + GC_words_allocd_before_gc)
                    990:         < 33500000*n_tests) {
                    991:         (void)GC_printf0("Incorrect execution - missed some allocations\n");
                    992:         FAIL;
                    993:     }
                    994:     if (GC_get_heap_size() > max_heap_sz*n_tests) {
                    995:         (void)GC_printf0("Unexpected heap growth - collector may be broken\n");
                    996:         FAIL;
                    997:     }
                    998:     (void)GC_printf0("Collector appears to work\n");
                    999: }
                   1000:
                   1001: #if defined(MACOS)
                   1002: void SetMinimumStack(long minSize)
                   1003: {
                   1004:        long newApplLimit;
                   1005:
                   1006:        if (minSize > LMGetDefltStack())
                   1007:        {
                   1008:                newApplLimit = (long) GetApplLimit()
                   1009:                                - (minSize - LMGetDefltStack());
                   1010:                SetApplLimit((Ptr) newApplLimit);
                   1011:                MaxApplZone();
                   1012:        }
                   1013: }
                   1014:
                   1015: #define cMinStackSpace (512L * 1024L)
                   1016:
                   1017: #endif
                   1018:
                   1019: #ifdef __STDC__
                   1020:     void warn_proc(char *msg, GC_word p)
                   1021: #else
                   1022:     void warn_proc(msg, p)
                   1023:     char *msg;
                   1024:     GC_word p;
                   1025: #endif
                   1026: {
                   1027:     GC_printf1(msg, (unsigned long)p);
                   1028:     FAIL;
                   1029: }
                   1030:
                   1031:
                   1032: #if !defined(PCR) && !defined(SOLARIS_THREADS) && !defined(WIN32_THREADS) \
                   1033:   && !defined(IRIX_THREADS) && !defined(LINUX_THREADS) || defined(LINT)
                   1034: #ifdef MSWIN32
                   1035:   int APIENTRY WinMain(HINSTANCE instance, HINSTANCE prev, LPSTR cmd, int n)
                   1036: #else
                   1037:   int main()
                   1038: #endif
                   1039: {
                   1040: #   if defined(DJGPP)
                   1041:        int dummy;
                   1042: #   endif
                   1043:     n_tests = 0;
                   1044:
                   1045: #   if defined(DJGPP)
                   1046:        /* No good way to determine stack base from library; do it */
                   1047:        /* manually on this platform.                              */
                   1048:        GC_stackbottom = (GC_PTR)(&dummy);
                   1049: #   endif
                   1050: #   if defined(MACOS)
                   1051:        /* Make sure we have lots and lots of stack space.      */
                   1052:        SetMinimumStack(cMinStackSpace);
                   1053:        /* Cheat and let stdio initialize toolbox for us.       */
                   1054:        printf("Testing GC Macintosh port.\n");
                   1055: #   endif
                   1056:     GC_INIT(); /* Only needed if gc is dynamic library.        */
                   1057:     (void) GC_set_warn_proc(warn_proc);
                   1058: #   if defined(MPROTECT_VDB) || defined(PROC_VDB)
                   1059:       GC_enable_incremental();
                   1060:       (void) GC_printf0("Switched to incremental mode\n");
                   1061: #     if defined(MPROTECT_VDB)
                   1062:        (void)GC_printf0("Emulating dirty bits with mprotect/signals\n");
                   1063: #     else
                   1064:        (void)GC_printf0("Reading dirty bits from /proc\n");
                   1065: #      endif
                   1066: #   endif
                   1067:     run_one_test();
                   1068:     check_heap_stats();
                   1069:     (void)fflush(stdout);
                   1070: #   ifdef LINT
                   1071:        /* Entry points we should be testing, but aren't.                  */
                   1072:        /* Some can be tested by defining GC_DEBUG at the top of this file */
                   1073:        /* This is a bit SunOS4 specific.                                  */
                   1074:        GC_noop(GC_expand_hp, GC_add_roots, GC_clear_roots,
                   1075:                GC_register_disappearing_link,
                   1076:                GC_register_finalizer_ignore_self,
                   1077:                GC_debug_register_displacement,
                   1078:                GC_print_obj, GC_debug_change_stubborn,
                   1079:                GC_debug_end_stubborn_change, GC_debug_malloc_uncollectable,
                   1080:                GC_debug_free, GC_debug_realloc, GC_generic_malloc_words_small,
                   1081:                GC_init, GC_make_closure, GC_debug_invoke_finalizer,
                   1082:                GC_page_was_ever_dirty, GC_is_fresh,
                   1083:                GC_malloc_ignore_off_page, GC_malloc_atomic_ignore_off_page,
                   1084:                GC_set_max_heap_size, GC_get_bytes_since_gc,
                   1085:                GC_pre_incr, GC_post_incr);
                   1086: #   endif
                   1087: #   ifdef MSWIN32
                   1088:       GC_win32_free_heap();
                   1089: #   endif
                   1090:     return(0);
                   1091: }
                   1092: # endif
                   1093:
                   1094: #ifdef WIN32_THREADS
                   1095:
                   1096: unsigned __stdcall thr_run_one_test(void *arg)
                   1097: {
                   1098:   run_one_test();
                   1099:   return 0;
                   1100: }
                   1101:
                   1102: #define NTEST 2
                   1103:
                   1104: int APIENTRY WinMain(HINSTANCE instance, HINSTANCE prev, LPSTR cmd, int n)
                   1105: {
                   1106: # if NTEST > 0
                   1107:    HANDLE h[NTEST];
                   1108: # endif
                   1109:   int i;
                   1110:   unsigned thread_id;
                   1111: # if 0
                   1112:     GC_enable_incremental();
                   1113: # endif
                   1114:   InitializeCriticalSection(&incr_cs);
                   1115:   (void) GC_set_warn_proc(warn_proc);
                   1116:   for (i = 0; i < NTEST; i++) {
                   1117:     h[i] = (HANDLE)_beginthreadex(NULL, 0, thr_run_one_test, 0, 0, &thread_id);
                   1118:     if (h[i] == (HANDLE)-1) {
                   1119:       (void)GC_printf1("Thread creation failed %lu\n", (unsigned long)GetLastError());
                   1120:       FAIL;
                   1121:     }
                   1122:   }
                   1123:   run_one_test();
                   1124:   for (i = 0; i < NTEST; i++)
                   1125:     if (WaitForSingleObject(h[i], INFINITE) != WAIT_OBJECT_0) {
                   1126:       (void)GC_printf1("Thread wait failed %lu\n", (unsigned long)GetLastError());
                   1127:       FAIL;
                   1128:     }
                   1129:   check_heap_stats();
                   1130:   (void)fflush(stdout);
                   1131:   return(0);
                   1132: }
                   1133:
                   1134: #endif /* WIN32_THREADS */
                   1135:
                   1136:
                   1137: #ifdef PCR
                   1138: test()
                   1139: {
                   1140:     PCR_Th_T * th1;
                   1141:     PCR_Th_T * th2;
                   1142:     int code;
                   1143:
                   1144:     n_tests = 0;
                   1145:     /* GC_enable_incremental(); */
                   1146:     (void) GC_set_warn_proc(warn_proc);
                   1147:     th1 = PCR_Th_Fork(run_one_test, 0);
                   1148:     th2 = PCR_Th_Fork(run_one_test, 0);
                   1149:     run_one_test();
                   1150:     if (PCR_Th_T_Join(th1, &code, NIL, PCR_allSigsBlocked, PCR_waitForever)
                   1151:         != PCR_ERes_okay || code != 0) {
                   1152:         (void)GC_printf0("Thread 1 failed\n");
                   1153:     }
                   1154:     if (PCR_Th_T_Join(th2, &code, NIL, PCR_allSigsBlocked, PCR_waitForever)
                   1155:         != PCR_ERes_okay || code != 0) {
                   1156:         (void)GC_printf0("Thread 2 failed\n");
                   1157:     }
                   1158:     check_heap_stats();
                   1159:     (void)fflush(stdout);
                   1160:     return(0);
                   1161: }
                   1162: #endif
                   1163:
                   1164: #if defined(SOLARIS_THREADS) || defined(IRIX_THREADS) || defined(LINUX_THREADS)
                   1165: void * thr_run_one_test(void * arg)
                   1166: {
                   1167:     run_one_test();
                   1168:     return(0);
                   1169: }
                   1170:
                   1171: #ifdef GC_DEBUG
                   1172: #  define GC_free GC_debug_free
                   1173: #endif
                   1174:
                   1175: #ifdef SOLARIS_THREADS
                   1176: main()
                   1177: {
                   1178:     thread_t th1;
                   1179:     thread_t th2;
                   1180:     int code;
                   1181:
                   1182:     n_tests = 0;
                   1183:     GC_INIT(); /* Only needed if gc is dynamic library.        */
                   1184:     GC_enable_incremental();
                   1185:     (void) GC_set_warn_proc(warn_proc);
                   1186:     if (thr_keycreate(&fl_key, GC_free) != 0) {
                   1187:         (void)GC_printf1("Key creation failed %lu\n", (unsigned long)code);
                   1188:        FAIL;
                   1189:     }
                   1190:     if ((code = thr_create(0, 1024*1024, thr_run_one_test, 0, 0, &th1)) != 0) {
                   1191:        (void)GC_printf1("Thread 1 creation failed %lu\n", (unsigned long)code);
                   1192:        FAIL;
                   1193:     }
                   1194:     if ((code = thr_create(0, 1024*1024, thr_run_one_test, 0, THR_NEW_LWP, &th2)) != 0) {
                   1195:        (void)GC_printf1("Thread 2 creation failed %lu\n", (unsigned long)code);
                   1196:        FAIL;
                   1197:     }
                   1198:     run_one_test();
                   1199:     if ((code = thr_join(th1, 0, 0)) != 0) {
                   1200:         (void)GC_printf1("Thread 1 failed %lu\n", (unsigned long)code);
                   1201:         FAIL;
                   1202:     }
                   1203:     if (thr_join(th2, 0, 0) != 0) {
                   1204:         (void)GC_printf1("Thread 2 failed %lu\n", (unsigned long)code);
                   1205:         FAIL;
                   1206:     }
                   1207:     check_heap_stats();
                   1208:     (void)fflush(stdout);
                   1209:     return(0);
                   1210: }
                   1211: #else /* pthreads */
                   1212: main()
                   1213: {
                   1214:     pthread_t th1;
                   1215:     pthread_t th2;
                   1216:     pthread_attr_t attr;
                   1217:     int code;
                   1218:
                   1219: #   ifdef IRIX_THREADS
                   1220:        /* Force a larger stack to be preallocated      */
                   1221:        /* Since the initial cant always grow later.    */
                   1222:        *((volatile char *)&code - 1024*1024) = 0;      /* Require 1 Mb */
                   1223: #   endif /* IRIX_THREADS */
                   1224:     pthread_attr_init(&attr);
                   1225: #   ifdef IRIX_THREADS
                   1226:        pthread_attr_setstacksize(&attr, 1000000);
                   1227: #   endif
                   1228:     n_tests = 0;
                   1229: #   ifdef MPROTECT_VDB
                   1230:        GC_enable_incremental();
                   1231:         (void) GC_printf0("Switched to incremental mode\n");
                   1232:        (void) GC_printf0("Emulating dirty bits with mprotect/signals\n");
                   1233: #   endif
                   1234:     (void) GC_set_warn_proc(warn_proc);
                   1235:     if (pthread_key_create(&fl_key, 0) != 0) {
                   1236:         (void)GC_printf1("Key creation failed %lu\n", (unsigned long)code);
                   1237:        FAIL;
                   1238:     }
                   1239:     if ((code = pthread_create(&th1, &attr, thr_run_one_test, 0)) != 0) {
                   1240:        (void)GC_printf1("Thread 1 creation failed %lu\n", (unsigned long)code);
                   1241:        FAIL;
                   1242:     }
                   1243:     if ((code = pthread_create(&th2, &attr, thr_run_one_test, 0)) != 0) {
                   1244:        (void)GC_printf1("Thread 2 creation failed %lu\n", (unsigned long)code);
                   1245:        FAIL;
                   1246:     }
                   1247:     run_one_test();
                   1248:     if ((code = pthread_join(th1, 0)) != 0) {
                   1249:         (void)GC_printf1("Thread 1 failed %lu\n", (unsigned long)code);
                   1250:         FAIL;
                   1251:     }
                   1252:     if (pthread_join(th2, 0) != 0) {
                   1253:         (void)GC_printf1("Thread 2 failed %lu\n", (unsigned long)code);
                   1254:         FAIL;
                   1255:     }
                   1256:     check_heap_stats();
                   1257:     (void)fflush(stdout);
                   1258:     pthread_attr_destroy(&attr);
                   1259:     GC_printf1("Completed %d collections\n", GC_gc_no);
                   1260:     return(0);
                   1261: }
                   1262: #endif /* pthreads */
                   1263: #endif /* SOLARIS_THREADS || IRIX_THREADS || LINUX_THREADS */

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>