+++ /dev/null
-#include "garbage.h"
-#include "runtime.h"
-#include "structdefs.h"
-#include "Queue.h"
-#include "SimpleHash.h"
-#include "GenericHashtable.h"
-#include <string.h>
-#if defined(THREADS) || defined(DSTM)
-#include "thread.h"
-#endif
-
-#ifdef DMALLOC
-#include "dmalloc.h"
-#endif
-
-
-#define NUMPTRS 100
-
-#define INITIALHEAPSIZE 10*1024
-#define GCPOINT(x) ((int)((x)*0.9))
-/* This define takes in how full the heap is initially and returns a new heap size to use */
-#define HEAPSIZE(x,y) (((int)((x)/0.6))+y)
-
-#ifdef TASK
-extern struct genhashtable * activetasks;
-extern struct parameterwrapper * objectqueues[NUMCLASSES];
-extern struct genhashtable * failedtasks;
-extern struct taskparamdescriptor *currtpd;
-extern struct RuntimeHash *forward;
-extern struct RuntimeHash *reverse;
-extern struct RuntimeHash *fdtoobject;
-#endif
-
-#if defined(THREADS) || defined(DSTM)
-int needtocollect=0;
-struct listitem * list=NULL;
-int listcount=0;
-#endif
-
-//Need to check if pointers are transaction pointers
-#ifdef DSTM
-#define ENQUEUE(orig, dst) \
-if ((!(((unsigned int)orig)&0x1))) {\
-if (orig>=curr_heapbase&&orig<curr_heaptop) {\
-void *copy;\
-if (gc_createcopy(orig,©))\
-enqueue(orig);\
-dst=copy;\
-}\
-}
-#else
-#define ENQUEUE(orig, dst) \
-void *copy; \
-if (gc_createcopy(orig,©))\
-enqueue(orig);\
-dst=copy
-#endif
-
-struct pointerblock {
- void * ptrs[NUMPTRS];
- struct pointerblock *next;
-};
-
-void * curr_heapbase=0;
-void * curr_heapptr=0;
-void * curr_heapgcpoint=0;
-void * curr_heaptop=0;
-
-void * to_heapbase=0;
-void * to_heapptr=0;
-void * to_heaptop=0;
-long lastgcsize=0;
-
-struct pointerblock *head=NULL;
-int headindex=0;
-struct pointerblock *tail=NULL;
-int tailindex=0;
-struct pointerblock *spare=NULL;
-
-void enqueue(void *ptr) {
- if (headindex==NUMPTRS) {
- struct pointerblock * tmp;
- if (spare!=NULL) {
- tmp=spare;
- spare=NULL;
- } else
- tmp=malloc(sizeof(struct pointerblock));
- head->next=tmp;
- head=tmp;
- headindex=0;
- }
- head->ptrs[headindex++]=ptr;
-}
-
-void * dequeue() {
- if (tailindex==NUMPTRS) {
- struct pointerblock *tmp=tail;
- tail=tail->next;
- tailindex=0;
- if (spare!=NULL)
- free(tmp);
- else
- spare=tmp;
- }
- return tail->ptrs[tailindex++];
-}
-
-int moreItems() {
- if ((head==tail)&&(tailindex==headindex))
- return 0;
- return 1;
-}
-
-#ifdef TASK
-struct pointerblock *taghead=NULL;
-int tagindex=0;
-
-void enqueuetag(struct ___TagDescriptor___ *ptr) {
- if (tagindex==NUMPTRS) {
- struct pointerblock * tmp=malloc(sizeof(struct pointerblock));
- tmp->next=taghead;
- taghead=tmp;
- tagindex=0;
- }
- taghead->ptrs[tagindex++]=ptr;
-}
-#endif
-
-
-void collect(struct garbagelist * stackptr) {
-#if defined(THREADS)||defined(DSTM)
- needtocollect=1;
- pthread_mutex_lock(&gclistlock);
- while(1) {
- if ((listcount+1)==threadcount) {
- break; /* Have all other threads stopped */
- }
- pthread_cond_wait(&gccond, &gclistlock);
- }
-#endif
-
- if (head==NULL) {
- headindex=0;
- tailindex=0;
- head=tail=malloc(sizeof(struct pointerblock));
- }
-
-#ifdef TASK
- if (taghead==NULL) {
- tagindex=0;
- taghead=malloc(sizeof(struct pointerblock));
- taghead->next=NULL;
- }
-#endif
-
- /* Check current stack */
-#if defined(THREADS)||defined(DSTM)
- {
- struct listitem *listptr=list;
- while(1) {
-#endif
-
- while(stackptr!=NULL) {
- int i;
- for(i=0;i<stackptr->size;i++) {
- void * orig=stackptr->array[i];
- ENQUEUE(orig, stackptr->array[i]);
- }
- stackptr=stackptr->next;
- }
-#if defined(THREADS)||defined(DSTM)
- /* Go to next thread */
- if (listptr!=NULL) {
- void * orig=listptr->locklist;
- ENQUEUE(orig, listptr->locklist);
- stackptr=listptr->stackptr;
- listptr=listptr->next;
- } else
- break;
- }
- }
-#endif
-
-#ifdef TASK
- {
- /* Update objectsets */
- int i;
- for(i=0;i<NUMCLASSES;i++) {
- struct parameterwrapper * p=objectqueues[i];
- while(p!=NULL) {
- struct ObjectHash * set=p->objectset;
- struct ObjectNode * ptr=set->listhead;
- while(ptr!=NULL) {
- void *orig=(void *)ptr->key;
- ENQUEUE(orig, *((void **)(&ptr->key)));
- ptr=ptr->lnext;
- }
- ObjectHashrehash(set); /* Rehash the table */
- p=p->next;
- }
- }
- }
-
- if (forward!=NULL) {
- struct RuntimeNode * ptr=forward->listhead;
- while(ptr!=NULL) {
- void * orig=(void *)ptr->key;
- ENQUEUE(orig, *((void **)(&ptr->key)));
- ptr=ptr->lnext;
- }
- RuntimeHashrehash(forward); /* Rehash the table */
- }
-
- if (reverse!=NULL) {
- struct RuntimeNode * ptr=reverse->listhead;
- while(ptr!=NULL) {
- void *orig=(void *)ptr->data;
- ENQUEUE(orig, *((void**)(&ptr->data)));
- ptr=ptr->lnext;
- }
- }
-
- {
- struct RuntimeNode * ptr=fdtoobject->listhead;
- while(ptr!=NULL) {
- void *orig=(void *)ptr->data;
- ENQUEUE(orig, *((void**)(&ptr->data)));
- ptr=ptr->lnext;
- }
- }
-
- {
- /* Update current task descriptor */
- int i;
- for(i=0;i<currtpd->numParameters;i++) {
- void *orig=currtpd->parameterArray[i];
- ENQUEUE(orig, currtpd->parameterArray[i]);
- }
-
- }
-
- /* Update active tasks */
- {
- struct genpointerlist * ptr=activetasks->list;
- while(ptr!=NULL) {
- struct taskparamdescriptor *tpd=ptr->src;
- int i;
- for(i=0;i<tpd->numParameters;i++) {
- void * orig=tpd->parameterArray[i];
- ENQUEUE(orig, tpd->parameterArray[i]);
- }
- ptr=ptr->inext;
- }
- genrehash(activetasks);
- }
-
- /* Update failed tasks */
- {
- struct genpointerlist * ptr=failedtasks->list;
- while(ptr!=NULL) {
- struct taskparamdescriptor *tpd=ptr->src;
- int i;
- for(i=0;i<tpd->numParameters;i++) {
- void * orig=tpd->parameterArray[i];
- ENQUEUE(orig, tpd->parameterArray[i]);
- }
- ptr=ptr->inext;
- }
- genrehash(failedtasks);
- }
-#endif
-
- while(moreItems()) {
- void * ptr=dequeue();
- void *cpy=((void **)ptr)[1];
- int type=((int *)cpy)[0];
- unsigned int * pointer;
-#ifdef TASK
- if(type==TAGTYPE) {
- /* Enqueue Tag */
- /* Nothing is inside */
- enqueuetag(ptr);
- continue;
- }
-#endif
- pointer=pointerarray[type];
- if (pointer==0) {
- /* Array of primitives */
- /* Do nothing */
- } else if (((int)pointer)==1) {
- /* Array of pointers */
- struct ArrayObject *ao=(struct ArrayObject *) ptr;
- struct ArrayObject *ao_cpy=(struct ArrayObject *) cpy;
- int length=ao->___length___;
- int i;
- for(i=0;i<length;i++) {
- void *objptr=((void **)(((char *)& ao->___length___)+sizeof(int)))[i];
- ENQUEUE(objptr, ((void **)(((char *)& ao_cpy->___length___)+sizeof(int)))[i]);
- }
- } else {
- int size=pointer[0];
- int i;
- for(i=1;i<=size;i++) {
- unsigned int offset=pointer[i];
- void * objptr=*((void **)(((int)ptr)+offset));
- ENQUEUE(objptr, *((void **) (((int)cpy)+offset)));
- }
- }
- }
-#ifdef TASK
- fixtags();
-#endif
-
-#if defined(THREADS)||defined(DSTM)
- needtocollect=0;
- pthread_mutex_unlock(&gclistlock);
-#endif
-}
-
-#ifdef TASK
-
-/* Fix up the references from tags. This can't be done earlier,
- because we don't want tags to keep objects alive */
-void fixtags() {
- while(taghead!=NULL) {
- int i;
- struct pointerblock *tmp=taghead->next;
- for(i=0;i<tagindex;i++) {
- struct ___TagDescriptor___ *tagd=taghead->ptrs[i];
- struct ___Object___ *obj=tagd->flagptr;
- struct ___TagDescriptor___ *copy=((struct ___TagDescriptor___**)tagd)[1];
- if (obj==NULL) {
- /* Zero object case */
- } else if (obj->type==-1) {
- /* Single object case */
- copy->flagptr=((struct ___Object___**)obj)[1];
- } else if (obj->type==OBJECTARRAYTYPE) {
- /* Array case */
- struct ArrayObject *ao=(struct ArrayObject *) obj;
- int livecount=0;
- int j;
- int k=0;
- struct ArrayObject *aonew;
-
- /* Count live objects */
- for(j=0;j<ao->___cachedCode___;j++) {
- struct ___Object___ * tobj=ARRAYGET(ao, struct ___Object___ *, j);
- if (tobj->type==-1)
- livecount++;
- }
-
- livecount=((livecount-1)/OBJECTARRAYINTERVAL+1)*OBJECTARRAYINTERVAL;
- aonew=(struct ArrayObject *) tomalloc(sizeof(struct ArrayObject)+sizeof(struct ___Object___*)*livecount);
- memcpy(aonew, ao, sizeof(struct ArrayObject));
- aonew->type=OBJECTARRAYTYPE;
- aonew->___length___=livecount;
- copy->flagptr=aonew;
- for(j=0;j<ao->___cachedCode___;j++) {
- struct ___Object___ * tobj=ARRAYGET(ao, struct ___Object___ *, j);
- if (tobj->type==-1) {
- struct ___Object___ * tobjcpy=((struct ___Object___**)tobj)[1];
- ARRAYSET(aonew, struct ___Object___*, k++,tobjcpy);
- }
- }
- aonew->___cachedCode___=k;
- for(;k<livecount;k++) {
- ARRAYSET(aonew, struct ___Object___*, k, NULL);
- }
- } else {
- /* No object live anymore */
- copy->flagptr=NULL;
- }
- }
- free(taghead);
- taghead=tmp;
- tagindex=NUMPTRS;
- }
-}
-#endif
-
-void * tomalloc(int size) {
- void * ptr=to_heapptr;
- if ((size%4)!=0)
- size+=(4-(size%4));
- to_heapptr+=size;
- return ptr;
-}
-
-#if defined(THREADS)||defined(DSTM)
-
-void checkcollect(void * ptr) {
- if (needtocollect) {
- struct listitem * tmp=stopforgc((struct garbagelist *)ptr);
- pthread_mutex_lock(&gclock); // Wait for GC
- restartaftergc(tmp);
- pthread_mutex_unlock(&gclock);
-
- }
-}
-
-struct listitem * stopforgc(struct garbagelist * ptr) {
- struct listitem * litem=malloc(sizeof(struct listitem));
- litem->stackptr=ptr;
- litem->locklist=pthread_getspecific(threadlocks);
- litem->prev=NULL;
- pthread_mutex_lock(&gclistlock);
- litem->next=list;
- if(list!=NULL)
- list->prev=litem;
- list=litem;
- listcount++;
- pthread_cond_signal(&gccond);
- pthread_mutex_unlock(&gclistlock);
- return litem;
-}
-
-void restartaftergc(struct listitem * litem) {
- pthread_mutex_lock(&gclistlock);
- pthread_setspecific(threadlocks, litem->locklist);
- if (litem->prev==NULL) {
- list=litem->next;
- } else {
- litem->prev->next=litem->next;
- }
- if (litem->next!=NULL) {
- litem->next->prev=litem->prev;
- }
- listcount--;
- pthread_mutex_unlock(&gclistlock);
- free(litem);
-}
-#endif
-
-void * mygcmalloc(struct garbagelist * stackptr, int size) {
- void *ptr;
-#if defined(THREADS)||defined(DSTM)
- if (pthread_mutex_trylock(&gclock)!=0) {
- struct listitem *tmp=stopforgc(stackptr);
- pthread_mutex_lock(&gclock);
- restartaftergc(tmp);
- }
-#endif
- ptr=curr_heapptr;
- if ((size%4)!=0)
- size+=(4-(size%4));
- curr_heapptr+=size;
- if (curr_heapptr>curr_heapgcpoint) {
- if (curr_heapbase==0) {
- /* Need to allocate base heap */
- curr_heapbase=malloc(INITIALHEAPSIZE);
- bzero(curr_heapbase, INITIALHEAPSIZE);
- curr_heaptop=curr_heapbase+INITIALHEAPSIZE;
- curr_heapgcpoint=((char *) curr_heapbase)+GCPOINT(INITIALHEAPSIZE);
- curr_heapptr=curr_heapbase+size;
-
- to_heapbase=malloc(INITIALHEAPSIZE);
- to_heaptop=to_heapbase+INITIALHEAPSIZE;
- to_heapptr=to_heapbase;
- ptr=curr_heapbase;
-#if defined(THREADS)||defined(DSTM)
- pthread_mutex_unlock(&gclock);
-#endif
- return ptr;
- }
-
- /* Grow the to heap if necessary */
- {
- int curr_heapsize=curr_heaptop-curr_heapbase;
- int to_heapsize=to_heaptop-to_heapbase;
- int last_heapsize=0;
- if (lastgcsize>0) {
- last_heapsize=HEAPSIZE(lastgcsize, size);
- if ((last_heapsize%4)!=0)
- last_heapsize+=(4-(last_heapsize%4));
- }
- if (curr_heapsize>last_heapsize)
- last_heapsize=curr_heapsize;
- if (last_heapsize>to_heapsize) {
- free(to_heapbase);
- to_heapbase=malloc(last_heapsize);
- to_heaptop=to_heapbase+last_heapsize;
- to_heapptr=to_heapbase;
- }
- }
-
- /* Do our collection */
- collect(stackptr);
-
- /* Update stat on previous gc size */
- lastgcsize=(to_heapptr-to_heapbase)+size;
-
- /* Flip to/curr heaps */
- {
- void * tmp=to_heapbase;
- to_heapbase=curr_heapbase;
- curr_heapbase=tmp;
-
- tmp=to_heaptop;
- to_heaptop=curr_heaptop;
- curr_heaptop=tmp;
-
- tmp=to_heapptr;
- curr_heapptr=to_heapptr+size;
- curr_heapgcpoint=((char *) curr_heapbase)+GCPOINT(curr_heaptop-curr_heapbase);
- to_heapptr=to_heapbase;
-
- /* Not enough room :(, redo gc */
- if (curr_heapptr>curr_heapgcpoint) {
-#if defined(THREADS)||defined(DSTM)
- pthread_mutex_unlock(&gclock);
-#endif
- return mygcmalloc(stackptr, size);
- }
-
- bzero(tmp, curr_heaptop-tmp);
-#if defined(THREADS)||defined(DSTM)
- pthread_mutex_unlock(&gclock);
-#endif
- return tmp;
- }
- } else {
-#if defined(THREADS)||defined(DSTM)
- pthread_mutex_unlock(&gclock);
-#endif
- return ptr;
- }
-}
-
-
-int gc_createcopy(void * orig, void ** copy_ptr) {
- if (orig==0) {
- *copy_ptr=NULL;
- return 0;
- } else {
- int type=((int *)orig)[0];
- if (type==-1) {
- *copy_ptr=((void **)orig)[1];
- return 0;
- } if (type<NUMCLASSES) {
- /* We have a normal object */
- int size=classsize[type];
- void *newobj=tomalloc(size);
- memcpy(newobj, orig, size);
- ((int *)orig)[0]=-1;
- ((void **)orig)[1]=newobj;
- *copy_ptr=newobj;
- return 1;
- } else {
- /* We have an array */
- struct ArrayObject *ao=(struct ArrayObject *)orig;
- int elementsize=classsize[type];
- int length=ao->___length___;
- int size=sizeof(struct ArrayObject)+length*elementsize;
- void *newobj=tomalloc(size);
- memcpy(newobj, orig, size);
- ((int *)orig)[0]=-1;
- ((void **)orig)[1]=newobj;
- *copy_ptr=newobj;
- return 1;
- }
- }
-}
projects / IRC.git / blobdiff