#include "runtime.h"
#include "structdefs.h"
-#include <string.h>
#include <signal.h>
#include "mem.h"
#include<fcntl.h>
-#include<sys/types.h>
-#include<sys/mman.h>
#include<errno.h>
-#include<signal.h>
#include<stdio.h>
#include "option.h"
+#ifdef DSTM
+#include "dstm.h"
+#include "prelookup.h"
+#endif
extern int classsize[];
jmp_buf error_handler;
float instfailurechance=0;
int numfailures;
int instaccum=0;
-
-
-
-#ifdef TASK
-#include "checkpoint.h"
-#include "Queue.h"
-#include "SimpleHash.h"
-#include "GenericHashtable.h"
-#include <sys/select.h>
-
-#ifdef CONSCHECK
-#include "instrument.h"
-#endif
-
-struct Queue * activetasks;
-struct parameterwrapper * objectqueues[NUMCLASSES];
-struct genhashtable * failedtasks;
-struct taskparamdescriptor * currtpd;
-struct RuntimeHash * forward;
-struct RuntimeHash * reverse;
-
-
-int main(int argc, char **argv) {
-#ifdef BOEHM_GC
- GC_init(); // Initialize the garbage collector
-#endif
-#ifdef CONSCHECK
- initializemmap();
-#endif
- processOptions();
-
- /* Create table for failed tasks */
- failedtasks=genallocatehashtable((unsigned int (*)(void *)) &hashCodetpd,
- (int (*)(void *,void *)) &comparetpd);
- /* Create queue of active tasks */
- activetasks=createQueue();
-
- /* Process task information */
- processtasks();
-
- /* Create startup object */
- createstartupobject(argc, argv);
-
- /* Start executing the tasks */
- executetasks();
-}
-
-void createstartupobject(int argc, char ** argv) {
- int i;
-
- /* Allocate startup object */
-#ifdef PRECISE_GC
- struct ___StartupObject___ *startupobject=(struct ___StartupObject___*) allocate_new(NULL, STARTUPTYPE);
- struct ArrayObject * stringarray=allocate_newarray(NULL, STRINGARRAYTYPE, argc-1);
-#else
- struct ___StartupObject___ *startupobject=(struct ___StartupObject___*) allocate_new(STARTUPTYPE);
- struct ArrayObject * stringarray=allocate_newarray(STRINGARRAYTYPE, argc-1);
-#endif
- /* Build array of strings */
- startupobject->___parameters___=stringarray;
- for(i=1;i<argc;i++) {
- int length=strlen(argv[i]);
-#ifdef PRECISE_GC
- struct ___String___ *newstring=NewString(NULL, argv[i],length);
-#else
- struct ___String___ *newstring=NewString(argv[i],length);
+#ifdef DMALLOC
+#include "dmalloc.h"
#endif
- ((void **)(((char *)& stringarray->___length___)+sizeof(int)))[i-1]=newstring;
- }
-
- /* Set initialized flag for startup object */
- flagorand(startupobject,1,0xFFFFFFFF);
-}
-int hashCodetpd(struct taskparamdescriptor *ftd) {
- int hash=(int)ftd->task;
- int i;
- for(i=0;i<ftd->numParameters;i++) {
- hash^=(int)ftd->parameterArray[i];
- }
- return hash;
-}
-
-int comparetpd(struct taskparamdescriptor *ftd1, struct taskparamdescriptor *ftd2) {
- int i;
- if (ftd1->task!=ftd2->task)
- return 0;
- for(i=0;i<ftd1->numParameters;i++)
- if (ftd1->parameterArray[i]!=ftd2->parameterArray[i])
- return 0;
- return 1;
+void exithandler(int sig, siginfo_t *info, void * uap) {
+ exit(0);
}
-/* This function updates the flag for object ptr. It or's the flag
- with the or mask and and's it with the andmask. */
-
-void flagorand(void * ptr, int ormask, int andmask) {
- int oldflag=((int *)ptr)[1];
- struct RuntimeHash *flagptr=(struct RuntimeHash *)(((int*)ptr)[2]);
- int flag=ormask|oldflag;
- flag&=andmask;
- if (flag==oldflag) /* Don't do anything */
- return;
- ((int*)ptr)[1]=flag;
-
- /*Remove object from all queues */
- while(flagptr!=NULL) {
- struct RuntimeHash *next;
- RuntimeHashget(flagptr, (int) ptr, (int *) &next);
- RuntimeHashremove(flagptr, (int)ptr, (int) next);
- flagptr=next;
- }
-
- {
- struct QueueItem *tmpptr;
- struct parameterwrapper * parameter=objectqueues[((int *)ptr)[0]];
- int i;
- struct RuntimeHash * prevptr=NULL;
- while(parameter!=NULL) {
- for(i=0;i<parameter->numberofterms;i++) {
- int andmask=parameter->intarray[i*2];
- int checkmask=parameter->intarray[i*2+1];
- if ((flag&andmask)==checkmask) {
- RuntimeHashadd(parameter->objectset, (int) ptr, (int) prevptr);
- prevptr=parameter->objectset;
- {
- struct RuntimeIterator iteratorarray[MAXTASKPARAMS];
- void * taskpointerarray[MAXTASKPARAMS];
- int j;
- int numparams=parameter->task->numParameters;
- int done=1;
- struct taskdescriptor * task=parameter->task;
- int newindex=-1;
- for(j=0;j<numparams;j++) {
- struct parameterwrapper *pw=(struct parameterwrapper *)task->descriptorarray[j]->queue;
- if (parameter==pw) {
- taskpointerarray[j]=ptr;
- newindex=j;
- } else {
- RuntimeHashiterator(pw->objectset, &iteratorarray[j]);
- if (RunhasNext(&iteratorarray[j])) {
- taskpointerarray[j]=(void *) Runkey(&iteratorarray[j]);
- Runnext(&iteratorarray[j]);
- } else {
- done=0;
- break; /* No tasks to dispatch */
- }
- }
- }
- /* Queue task items... */
-
- while(done) {
- struct taskparamdescriptor *tpd=RUNMALLOC(sizeof(struct taskparamdescriptor));
- tpd->task=task;
- tpd->numParameters=numparams;
- tpd->parameterArray=RUNMALLOC(sizeof(void *)*numparams);
- for(j=0;j<numparams;j++)
- tpd->parameterArray[j]=taskpointerarray[j];
- /* Queue task */
- if (!gencontains(failedtasks, tpd))
- addNewItem(activetasks, tpd);
- else {
- RUNFREE(tpd->parameterArray);
- RUNFREE(tpd);
- }
-
- /* This loop iterates to the next parameter combination */
- for(j=0;j<numparams;j++) {
- if (j==newindex) {
- if ((j+1)==numparams)
- done=0;
- continue;
- }
- if (RunhasNext(&iteratorarray[j])) {
- taskpointerarray[j]=(void *) Runkey(&iteratorarray[j]);
- Runnext(&iteratorarray[j]);
- break;
- } else if ((j+1)!=numparams) {
- RuntimeHashiterator(task->descriptorarray[j]->queue, &iteratorarray[j]);
- } else {
- done=0;
- break;
- }
- }
- }
- }
- break;
- }
- }
- parameter=parameter->next;
- }
- ((struct RuntimeHash **)ptr)[2]=prevptr;
- }
-}
-
-/* Handler for signals. The signals catch null pointer errors and
- arithmatic errors. */
-
-void myhandler(int sig, siginfo_t *info, void *uap) {
-#ifdef DEBUG
- printf("sig=%d\n",sig);
- printf("signal\n");
-#endif
- longjmp(error_handler,1);
-}
-
-fd_set readfds;
-int maxreadfd;
-struct RuntimeHash *fdtoobject;
-
-void addreadfd(int fd) {
- if (fd>=maxreadfd)
- maxreadfd=fd+1;
- FD_SET(fd, &readfds);
-}
-
-void removereadfd(int fd) {
- FD_CLR(fd, &readfds);
- if (maxreadfd==(fd+1)) {
- maxreadfd--;
- while(maxreadfd>0&&!FD_ISSET(maxreadfd-1, &readfds))
- maxreadfd--;
- }
-}
-
-#ifdef PRECISE_GC
-#define OFFSET 2
-#else
-#define OFFSET 0
-#endif
-
-void executetasks() {
- void * taskpointerarray[MAXTASKPARAMS+OFFSET];
-
- /* Set up signal handlers */
+void initializeexithandler() {
struct sigaction sig;
- sig.sa_sigaction=&myhandler;
+ sig.sa_sigaction=&exithandler;
sig.sa_flags=SA_SIGINFO;
sigemptyset(&sig.sa_mask);
-
- /* Catch bus errors, segmentation faults, and floating point exceptions*/
- sigaction(SIGBUS,&sig,0);
- sigaction(SIGSEGV,&sig,0);
- sigaction(SIGFPE,&sig,0);
- sigaction(SIGPIPE,&sig,0);
-
- /* Zero fd set */
- FD_ZERO(&readfds);
- maxreadfd=0;
- fdtoobject=allocateRuntimeHash(100);
-
- /* Map first block of memory to protected, anonymous page */
- mmap(0, 0x1000, 0, MAP_SHARED|MAP_FIXED|MAP_ANON, -1, 0);
-
- newtask:
- while(!isEmpty(activetasks)||(maxreadfd>0)) {
-
- /* Check if any filedescriptors have IO pending */
- if (maxreadfd>0) {
- int i;
- struct timeval timeout={0,0};
- fd_set tmpreadfds;
- int numselect;
- tmpreadfds=readfds;
- numselect=select(maxreadfd, &tmpreadfds, NULL, NULL, &timeout);
- if (numselect>0) {
- /* Process ready fd's */
- int fd;
- for(fd=0;fd<maxreadfd;fd++) {
- if (FD_ISSET(fd, &tmpreadfds)) {
- /* Set ready flag on object */
- void * objptr;
- if (RuntimeHashget(fdtoobject, fd,(int *) &objptr)) {
- flagorand(objptr,1,0xFFFFFFFF); /* Set the first flag to 1 */
- }
- }
- }
- }
- }
-
- /* See if there are any active tasks */
- if (!isEmpty(activetasks)) {
- int i;
- struct QueueItem * qi=(struct QueueItem *) getTail(activetasks);
- currtpd=(struct taskparamdescriptor *) qi->objectptr;
- removeItem(activetasks, qi);
-
- /* Check if this task has failed */
- if (gencontains(failedtasks, currtpd)) {
- // Free up task parameter descriptor
- RUNFREE(currtpd->parameterArray);
- RUNFREE(currtpd);
- goto newtask;
- }
-
- /* Make sure that the parameters are still in the queues */
- for(i=0;i<currtpd->task->numParameters;i++) {
- void * parameter=currtpd->parameterArray[i];
- struct parameterdescriptor * pd=currtpd->task->descriptorarray[i];
- struct parameterwrapper *pw=(struct parameterwrapper *) pd->queue;
- if (!RuntimeHashcontainskey(pw->objectset, (int) parameter)) {
- RUNFREE(currtpd->parameterArray);
- RUNFREE(currtpd);
- goto newtask;
- }
- taskpointerarray[i+OFFSET]=parameter;
- }
- {
- /* Checkpoint the state */
- forward=allocateRuntimeHash(100);
- reverse=allocateRuntimeHash(100);
- void ** checkpoint=makecheckpoint(currtpd->task->numParameters, currtpd->parameterArray, forward, reverse);
- int x;
- if (x=setjmp(error_handler)) {
- /* Recover */
- int h;
-#ifdef DEBUG
- printf("Fatal Error=%d, Recovering!\n",x);
-#endif
- genputtable(failedtasks,currtpd,currtpd);
- restorecheckpoint(currtpd->task->numParameters, currtpd->parameterArray, checkpoint, forward, reverse);
- freeRuntimeHash(forward);
- freeRuntimeHash(reverse);
- freemalloc();
- forward=NULL;
- reverse=NULL;
- } else {
- if (injectfailures) {
- if ((((double)random())/RAND_MAX)<failurechance) {
- printf("\nINJECTING TASK FAILURE to %s\n", currtpd->task->name);
- longjmp(error_handler,10);
- }
- }
- /* Actually call task */
-#ifdef PRECISE_GC
- ((int *)taskpointerarray)[0]=currtpd->task->numParameters;
- taskpointerarray[1]=NULL;
-#endif
-
- if (debugtask) {
- printf("ENTER %s count=%d\n",currtpd->task->name, (instaccum-instructioncount));
- ((void (*) (void **)) currtpd->task->taskptr)(taskpointerarray);
- printf("EXIT %s count=%d\n",currtpd->task->name, (instaccum-instructioncount));
- } else
- ((void (*) (void **)) currtpd->task->taskptr)(taskpointerarray);
- freeRuntimeHash(forward);
- freeRuntimeHash(reverse);
- freemalloc();
- // Free up task parameter descriptor
- RUNFREE(currtpd->parameterArray);
- RUNFREE(currtpd);
- forward=NULL;
- reverse=NULL;
- }
- }
- }
- }
+ sigaction(SIGUSR2, &sig, 0);
}
-/* This function processes the task information to create queues for
- each parameter type. */
-
-void processtasks() {
- int i;
- for(i=0;i<numtasks;i++) {
- struct taskdescriptor * task=taskarray[i];
- int j;
-
- for(j=0;j<task->numParameters;j++) {
- struct parameterdescriptor *param=task->descriptorarray[j];
- struct parameterwrapper * parameter=RUNMALLOC(sizeof(struct parameterwrapper));
- struct parameterwrapper ** ptr=&objectqueues[param->type];
-
- param->queue=parameter;
- parameter->objectset=allocateRuntimeHash(10);
- parameter->numberofterms=param->numberterms;
- parameter->intarray=param->intarray;
- parameter->task=task;
- /* Link new queue in */
- while((*ptr)!=NULL)
- ptr=&((*ptr)->next);
- (*ptr)=parameter;
- }
- }
-}
-
-#endif
/* This function inject failures */
#endif
}
+void CALL11(___System______exit____I,int ___status___, int ___status___) {
+ exit(___status___);
+}
+
+long CALL00(___System______currentTimeMillis____) {
+ struct timeval tv; long long retval;
+ gettimeofday(&tv, NULL);
+ retval = tv.tv_sec; /* seconds */
+ retval*=1000; /* milliseconds */
+ retval+= (tv.tv_usec/1000); /* adjust milliseconds & add them in */
+ return retval;
+}
+
void CALL01(___System______printString____L___String___,struct ___String___ * ___s___) {
struct ArrayObject * chararray=VAR(___s___)->___value___;
int i;
}
}
+#ifdef DSTM
+void CALL00(___System______clearPrefetchCache____) {
+ prehashClear();
+}
+#endif
+
/* Object allocation function */
+#ifdef DSTM
+void * allocate_newglobal(transrecord_t *trans, int type) {
+ struct ___Object___ * v=(struct ___Object___ *) transCreateObj(trans, classsize[type]);
+ v->type=type;
+#ifdef THREADS
+ v->tid=0;
+ v->lockentry=0;
+ v->lockcount=0;
+#endif
+ return v;
+}
+
+/* Array allocation function */
+
+struct ArrayObject * allocate_newarrayglobal(transrecord_t *trans, int type, int length) {
+ struct ArrayObject * v=(struct ArrayObject *)transCreateObj(trans, sizeof(struct ArrayObject)+length*classsize[type]);
+ if (length<0) {
+ printf("ERROR: negative array\n");
+ return NULL;
+ }
+ v->type=type;
+ v->___length___=length;
+#ifdef THREADS
+ v->tid=0;
+ v->lockentry=0;
+ v->lockcount=0;
+#endif
+ return v;
+}
+#endif
+
+
#ifdef PRECISE_GC
void * allocate_new(void * ptr, int type) {
struct ___Object___ * v=(struct ___Object___ *) mygcmalloc((struct garbagelist *) ptr, classsize[type]);
v->tid=0;
v->lockentry=0;
v->lockcount=0;
+#endif
+#ifdef OPTIONAL
+ v->fses=0;
#endif
return v;
}
struct ArrayObject * allocate_newarray(void * ptr, int type, int length) {
struct ArrayObject * v=mygcmalloc((struct garbagelist *) ptr, sizeof(struct ArrayObject)+length*classsize[type]);
v->type=type;
+ if (length<0) {
+ printf("ERROR: negative array\n");
+ return NULL;
+ }
v->___length___=length;
#ifdef THREADS
v->tid=0;
v->lockentry=0;
v->lockcount=0;
+#endif
+#ifdef OPTIONAL
+ v->fses=0;
#endif
return v;
}
#else
void * allocate_new(int type) {
- void * v=FREEMALLOC(classsize[type]);
- *((int *)v)=type;
+ struct ___Object___ * v=FREEMALLOC(classsize[type]);
+ v->type=type;
+#ifdef OPTIONAL
+ v->fses=0;
+#endif
return v;
}
struct ArrayObject * v=FREEMALLOC(sizeof(struct ArrayObject)+length*classsize[type]);
v->type=type;
v->___length___=length;
+#ifdef OPTIONAL
+ v->fses=0;
+#endif
return v;
}
#endif
#else
struct ___String___ * NewString(const char *str,int length) {
#endif
+ int i;
#ifdef PRECISE_GC
struct ArrayObject * chararray=allocate_newarray((struct garbagelist *)ptr, CHARARRAYTYPE, length);
- struct ___String___ * strobj=allocate_new((struct garbagelist *) ptr, STRINGTYPE);
+ int ptrarray[]={1, (int) ptr, (int) chararray};
+ struct ___String___ * strobj=allocate_new((struct garbagelist *) &ptrarray, STRINGTYPE);
+ chararray=(struct ArrayObject *) ptrarray[2];
#else
struct ArrayObject * chararray=allocate_newarray(CHARARRAYTYPE, length);
struct ___String___ * strobj=allocate_new(STRINGTYPE);
#endif
- int i;
strobj->___value___=chararray;
strobj->___count___=length;
strobj->___offset___=0;
projects / IRC.git / blobdiff