2 #include "structdefs.h"
13 extern int classsize[];
14 jmp_buf error_handler;
17 #include "checkpoint.h"
19 #include "SimpleHash.h"
20 #include "GenericHashtable.h"
22 struct Queue * activetasks;
23 struct parameterwrapper * objectqueues[NUMCLASSES];
24 struct genhashtable * failedtasks;
26 int main(int argc, char **argv) {
28 /* Allocate startup object */
29 struct ___StartupObject___ *startupobject=(struct ___StartupObject___*) allocate_new(STARTUPTYPE);
30 struct ArrayObject * stringarray=allocate_newarray(STRINGARRAYTYPE, argc);
31 failedtasks=genallocatehashtable((unsigned int (*)(void *)) &hashCodetpd,
32 (int (*)(void *,void *)) &comparetpd);
34 activetasks=createQueue();
38 flagorand(startupobject,1,0xFFFFFFFF);
40 /* Build array of strings */
42 startupobject->___parameters___=stringarray;
45 int length=strlen(argv[i]);
46 struct ___String___ *newstring=NewString(argv[i],length);
47 ((void **)(((char *)& stringarray->___length___)+sizeof(int)))[i]=newstring;
52 int hashCodetpd(struct taskparamdescriptor *ftd) {
53 int hash=(int)ftd->task;
55 for(i=0;i<ftd->numParameters;i++) {
56 hash^=(int)ftd->parameterArray[i];
61 int comparetpd(struct taskparamdescriptor *ftd1, struct taskparamdescriptor *ftd2) {
63 if (ftd1->task!=ftd2->task)
65 for(i=0;i<ftd1->numParameters;i++)
66 if (ftd1->parameterArray[i]!=ftd2->parameterArray[i])
71 void flagorand(void * ptr, int ormask, int andmask) {
72 int flag=((int *)ptr)[1];
73 struct SimpleHash *flagptr=(struct SimpleHash *)(((int*)ptr)[2]);
77 /*Remove from all queues */
78 while(flagptr!=NULL) {
79 struct SimpleHash *next;
80 SimpleHashget(flagptr, (int) ptr, (int *) &next);
81 SimpleHashremove(flagptr, (int)ptr, (int) next);
86 struct QueueItem *tmpptr;
87 struct parameterwrapper * parameter=objectqueues[((int *)ptr)[0]];
89 struct SimpleHash * prevptr=NULL;
90 while(parameter!=NULL) {
91 for(i=0;i<parameter->numberofterms;i++) {
92 int andmask=parameter->intarray[i*2];
93 int checkmask=parameter->intarray[i*2+1];
94 if ((flag&andmask)==checkmask) {
95 SimpleHashadd(parameter->objectset, (int) ptr, (int) prevptr);
96 prevptr=parameter->objectset;
98 struct SimpleIterator iteratorarray[MAXTASKPARAMS];
99 void * taskpointerarray[MAXTASKPARAMS];
101 int numparams=parameter->task->numParameters;
103 struct taskdescriptor * task=parameter->task;
105 for(j=0;j<numparams;j++) {
106 struct parameterwrapper *pw=(struct parameterwrapper *)task->descriptorarray[j]->queue;
108 taskpointerarray[j]=ptr;
111 SimpleHashiterator(pw->objectset, &iteratorarray[j]);
112 if (hasNext(&iteratorarray[j]))
113 taskpointerarray[j]=(void *) next(&iteratorarray[j]);
115 break; /* No tasks to dispatch */
118 /* Queue task items... */
121 struct taskparamdescriptor *tpd=RUNMALLOC(sizeof(struct taskparamdescriptor));
123 tpd->numParameters=numparams;
124 tpd->parameterArray=RUNMALLOC(sizeof(void *)*numparams);
125 for(j=0;j<numparams;j++)
126 tpd->parameterArray[j]=taskpointerarray[j];
128 if (!gencontains(failedtasks, tpd))
129 addNewItem(activetasks, tpd);
131 /* This loop iterates to the next paramter combination */
132 for(j=0;j<numparams;j++) {
134 if ((j+1)==numparams)
138 if (hasNext(&iteratorarray[j])) {
139 taskpointerarray[j]=(void *) next(&iteratorarray[j]);
141 } else if ((j+1)!=numparams) {
142 SimpleHashiterator(task->descriptorarray[j]->queue, &iteratorarray[j]);
153 parameter=parameter->next;
155 ((struct SimpleHash **)ptr)[2]=prevptr;
159 /* Handler for signals */
160 void myhandler(int sig, struct __siginfo *info, void *uap) {
162 printf("sig=%d\n",sig);
165 longjmp(error_handler,1);
168 void executetasks() {
169 void * taskpointerarray[MAXTASKPARAMS];
171 /* Set up signal handlers */
172 struct sigaction sig;
173 sig.sa_sigaction=&myhandler;
174 sig.sa_flags=SA_SIGINFO;
177 /* Catch bus errors, segmentation faults, and floating point exceptions*/
178 sigaction(SIGBUS,&sig,0);
179 sigaction(SIGSEGV,&sig,0);
180 sigaction(SIGFPE,&sig,0);
182 /* Map first block of memory to protected, anonymous page */
183 mmap(0, 0x1000, 0, MAP_SHARED|MAP_FIXED|MAP_ANON, -1, 0);
186 while(!isEmpty(activetasks)) {
187 struct QueueItem * qi=(struct QueueItem *) getTail(activetasks);
188 struct taskparamdescriptor *tpd=(struct taskparamdescriptor *) qi->objectptr;
190 removeItem(activetasks, qi);
192 for(i=0;i<tpd->task->numParameters;i++) {
193 void * parameter=tpd->parameterArray[i];
194 struct parameterdescriptor * pd=tpd->task->descriptorarray[i];
195 struct parameterwrapper *pw=(struct parameterwrapper *) pd->queue;
196 if (!SimpleHashcontainskey(pw->objectset, (int) parameter))
198 taskpointerarray[i]=parameter;
201 struct SimpleHash * forward=allocateSimpleHash(100);
202 struct SimpleHash * reverse=allocateSimpleHash(100);
203 void ** checkpoint=makecheckpoint(tpd->task->numParameters, taskpointerarray, forward, reverse);
204 if (setjmp(error_handler)) {
208 printf("Recovering\n");
210 genputtable(failedtasks,tpd,tpd);
211 restorecheckpoint(tpd->task->numParameters, taskpointerarray, checkpoint, forward, reverse);
213 /* Actually call task */
214 ((void (*) (void **)) tpd->task->taskptr)(taskpointerarray);
220 void processtasks() {
222 for(i=0;i<numtasks;i++) {
223 struct taskdescriptor * task=taskarray[i];
226 for(j=0;j<task->numParameters;j++) {
227 struct parameterdescriptor *param=task->descriptorarray[j];
228 struct parameterwrapper * parameter=RUNMALLOC(sizeof(struct parameterwrapper));
229 struct parameterwrapper ** ptr=&objectqueues[param->type];
231 param->queue=parameter;
232 parameter->objectset=allocateSimpleHash(10);
233 parameter->numberofterms=param->numberterms;
234 parameter->intarray=param->intarray;
235 parameter->task=task;
236 /* Link new queue in */
245 int ___Object______hashcode____(struct ___Object___ * ___this___) {
246 return (int) ___this___;
249 void ___System______printString____L___String___(struct ___String___ * s) {
250 struct ArrayObject * chararray=s->___string___;
252 for(i=0;i<chararray->___length___;i++) {
253 short s= ((short *)(((char *)& chararray->___length___)+sizeof(int)))[i];
258 void * allocate_new(int type) {
259 void * v=FREEMALLOC(classsize[type]);
264 struct ArrayObject * allocate_newarray(int type, int length) {
265 struct ArrayObject * v=FREEMALLOC(sizeof(struct ArrayObject)+length*classsize[type]);
267 v->___length___=length;
271 struct ___String___ * NewString(char *str,int length) {
272 struct ArrayObject * chararray=allocate_newarray(CHARARRAYTYPE, length);
273 struct ___String___ * strobj=allocate_new(STRINGTYPE);
275 strobj->___string___=chararray;
276 for(i=0;i<length;i++) {
277 ((short *)(((char *)& chararray->___length___)+sizeof(int)))[i]=(short)str[i]; }
281 void failedboundschk() {
283 printf("Array out of bounds\n");
286 longjmp(error_handler,2);
290 void failednullptr() {
292 printf("Dereferenced a null pointer\n");
295 longjmp(error_handler,3);