3 #include "structdefs.h"
5 #include "checkpoint.h"
7 #include "SimpleHash.h"
8 #include "GenericHashtable.h"
9 #include <sys/select.h>
10 #include <sys/types.h>
15 extern int injectfailures;
16 extern float failurechance;
21 #include "instrument.h"
24 struct genhashtable * activetasks;
25 struct parameterwrapper * objectqueues[NUMCLASSES];
26 struct genhashtable * failedtasks;
27 struct taskparamdescriptor * currtpd;
28 struct RuntimeHash * forward;
29 struct RuntimeHash * reverse;
31 int main(int argc, char **argv) {
33 GC_init(); // Initialize the garbage collector
39 initializeexithandler();
40 /* Create table for failed tasks */
41 failedtasks=genallocatehashtable((unsigned int (*)(void *)) &hashCodetpd,
42 (int (*)(void *,void *)) &comparetpd);
43 /* Create queue of active tasks */
44 activetasks=genallocatehashtable((unsigned int (*)(void *)) &hashCodetpd,
45 (int (*)(void *,void *)) &comparetpd);
47 /* Process task information */
50 /* Create startup object */
51 createstartupobject(argc, argv);
53 /* Start executing the tasks */
57 void createstartupobject(int argc, char ** argv) {
60 /* Allocate startup object */
62 struct ___StartupObject___ *startupobject=(struct ___StartupObject___*) allocate_new(NULL, STARTUPTYPE);
63 struct ArrayObject * stringarray=allocate_newarray(NULL, STRINGARRAYTYPE, argc-1);
65 struct ___StartupObject___ *startupobject=(struct ___StartupObject___*) allocate_new(STARTUPTYPE);
66 struct ArrayObject * stringarray=allocate_newarray(STRINGARRAYTYPE, argc-1);
68 /* Build array of strings */
69 startupobject->___parameters___=stringarray;
71 int length=strlen(argv[i]);
73 struct ___String___ *newstring=NewString(NULL, argv[i],length);
75 struct ___String___ *newstring=NewString(argv[i],length);
77 ((void **)(((char *)& stringarray->___length___)+sizeof(int)))[i-1]=newstring;
80 /* Set initialized flag for startup object */
81 flagorand(startupobject,1,0xFFFFFFFF);
84 int hashCodetpd(struct taskparamdescriptor *ftd) {
85 int hash=(int)ftd->task;
87 for(i=0;i<ftd->numParameters;i++){
88 hash^=(int)ftd->parameterArray[i];
93 int comparetpd(struct taskparamdescriptor *ftd1, struct taskparamdescriptor *ftd2) {
95 if (ftd1->task!=ftd2->task)
97 for(i=0;i<ftd1->numParameters;i++)
98 if(ftd1->parameterArray[i]!=ftd2->parameterArray[i])
101 for(i=0;i<ftd1->numParameters;i++) {
102 if(ftd1->failed[i]!=ftd2->failed[i])
109 /* This function sets a tag. */
111 void tagset(void *ptr, struct ___Object___ * obj, struct ___TagDescriptor___ * tagd) {
113 void tagset(struct ___Object___ * obj, struct ___TagDescriptor___ * tagd) {
115 struct ___Object___ * tagptr=obj->___tags___;
117 obj->___tags___=(struct ___Object___ *)tagd;
119 /* Have to check if it is already set */
120 if (tagptr->type==TAGTYPE) {
121 struct ___TagDescriptor___ * td=(struct ___TagDescriptor___ *) tagptr;
125 int ptrarray[]={2, (int) ptr, (int) obj, (int)tagd};
126 struct ArrayObject * ao=allocate_newarray(&ptrarray,TAGARRAYTYPE,TAGARRAYINTERVAL);
127 obj=(struct ___Object___ *)ptrarray[2];
128 tagd=(struct ___TagDescriptor___ *)ptrarray[3];
129 td=(struct ___TagDescriptor___ *) obj->___tags___;
131 struct ArrayObject * ao=allocate_newarray(TAGARRAYTYPE,TAGARRAYINTERVAL);
133 ARRAYSET(ao, struct ___TagDescriptor___ *, 0, td);
134 ARRAYSET(ao, struct ___TagDescriptor___ *, 1, tagd);
135 obj->___tags___=(struct ___Object___ *) ao;
136 ao->___cachedCode___=2;
140 struct ArrayObject *ao=(struct ArrayObject *) tagptr;
141 for(i=0;i<ao->___cachedCode___;i++) {
142 struct ___TagDescriptor___ * td=ARRAYGET(ao, struct ___TagDescriptor___*, i);
146 if (ao->___cachedCode___<ao->___length___) {
147 ARRAYSET(ao, struct ___TagDescriptor___ *, ao->___cachedCode___, tagd);
148 ao->___cachedCode___++;
151 int ptrarray[]={2,(int) ptr, (int) obj, (int) tagd};
152 struct ArrayObject * aonew=allocate_newarray(&ptrarray,TAGARRAYTYPE,TAGARRAYINTERVAL+ao->___length___);
153 obj=(struct ___Object___ *)ptrarray[2];
154 tagd=(struct ___TagDescriptor___ *) ptrarray[3];
155 ao=(struct ArrayObject *)obj->___tags___;
157 struct ArrayObject * aonew=allocate_newarray(TAGARRAYTYPE,TAGARRAYINTERVAL+ao->___length___);
159 aonew->___cachedCode___=ao->___length___+1;
160 for(i=0;i<ao->___length___;i++) {
161 ARRAYSET(aonew, struct ___TagDescriptor___*, i, ARRAYGET(ao, struct ___TagDescriptor___*, i));
163 ARRAYSET(aonew, struct ___TagDescriptor___ *, ao->___length___, tagd);
169 struct ___Object___ * tagset=tagd->flagptr;
172 } else if (tagset->type!=OBJECTARRAYTYPE) {
174 int ptrarray[]={2, (int) ptr, (int) obj, (int)tagd};
175 struct ArrayObject * ao=allocate_newarray(&ptrarray,OBJECTARRAYTYPE,OBJECTARRAYINTERVAL);
176 obj=(struct ___Object___ *)ptrarray[2];
177 tagd=(struct ___TagDescriptor___ *)ptrarray[3];
179 struct ArrayObject * ao=allocate_newarray(OBJECTARRAYTYPE,OBJECTARRAYINTERVAL);
181 ARRAYSET(ao, struct ___Object___ *, 0, tagd->flagptr);
182 ARRAYSET(ao, struct ___Object___ *, 1, obj);
183 ao->___cachedCode___=2;
184 tagd->flagptr=(struct ___Object___ *)ao;
186 struct ArrayObject *ao=(struct ArrayObject *) tagset;
187 if (ao->___cachedCode___<ao->___length___) {
188 ARRAYSET(ao, struct ___Object___*, ao->___cachedCode___++, obj);
192 int ptrarray[]={2, (int) ptr, (int) obj, (int)tagd};
193 struct ArrayObject * aonew=allocate_newarray(&ptrarray,OBJECTARRAYTYPE,OBJECTARRAYINTERVAL+ao->___length___);
194 obj=(struct ___Object___ *)ptrarray[2];
195 tagd=(struct ___TagDescriptor___ *)ptrarray[3];
196 ao=(struct ArrayObject *)tagd->flagptr;
198 struct ArrayObject * aonew=allocate_newarray(OBJECTARRAYTYPE,OBJECTARRAYINTERVAL);
200 aonew->___cachedCode___=ao->___cachedCode___+1;
201 for(i=0;i<ao->___length___;i++) {
202 ARRAYSET(aonew, struct ___Object___*, i, ARRAYGET(ao, struct ___Object___*, i));
204 ARRAYSET(aonew, struct ___Object___ *, ao->___cachedCode___, obj);
205 tagd->flagptr=(struct ___Object___ *) aonew;
211 /* This function clears a tag. */
213 void tagclear(void *ptr, struct ___Object___ * obj, struct ___TagDescriptor___ * tagd) {
215 void tagclear(struct ___Object___ * obj, struct ___TagDescriptor___ * tagd) {
217 /* We'll assume that tag is alway there.
218 Need to statically check for this of course. */
219 struct ___Object___ * tagptr=obj->___tags___;
221 if (tagptr->type==TAGTYPE) {
222 if ((struct ___TagDescriptor___ *)tagptr==tagd)
223 obj->___tags___=NULL;
225 printf("ERROR 1 in tagclear\n");
227 struct ArrayObject *ao=(struct ArrayObject *) tagptr;
229 for(i=0;i<ao->___cachedCode___;i++) {
230 struct ___TagDescriptor___ * td=ARRAYGET(ao, struct ___TagDescriptor___ *, i);
232 ao->___cachedCode___--;
233 if (i<ao->___cachedCode___)
234 ARRAYSET(ao, struct ___TagDescriptor___ *, i, ARRAYGET(ao, struct ___TagDescriptor___ *, ao->___cachedCode___));
235 ARRAYSET(ao, struct ___TagDescriptor___ *, ao->___cachedCode___, NULL);
236 if (ao->___cachedCode___==0)
237 obj->___tags___=NULL;
241 printf("ERROR 2 in tagclear\n");
245 struct ___Object___ *tagset=tagd->flagptr;
246 if (tagset->type!=OBJECTARRAYTYPE) {
250 printf("ERROR 3 in tagclear\n");
252 struct ArrayObject *ao=(struct ArrayObject *) tagset;
254 for(i=0;i<ao->___cachedCode___;i++) {
255 struct ___Object___ * tobj=ARRAYGET(ao, struct ___Object___ *, i);
257 ao->___cachedCode___--;
258 if (i<ao->___cachedCode___)
259 ARRAYSET(ao, struct ___Object___ *, i, ARRAYGET(ao, struct ___Object___ *, ao->___cachedCode___));
260 ARRAYSET(ao, struct ___Object___ *, ao->___cachedCode___, NULL);
261 if (ao->___cachedCode___==0)
266 printf("ERROR 4 in tagclear\n");
273 /* This function allocates a new tag. */
275 struct ___TagDescriptor___ * allocate_tag(void *ptr, int index) {
276 struct ___TagDescriptor___ * v=(struct ___TagDescriptor___ *) mygcmalloc((struct garbagelist *) ptr, classsize[TAGTYPE]);
278 struct ___TagDescriptor___ * allocate_tag(int index) {
279 struct ___TagDescriptor___ * v=FREEMALLOC(classsize[TAGTYPE]);
288 /* This function updates the flag for object ptr. It or's the flag
289 with the or mask and and's it with the andmask. */
291 void flagbody(struct ___Object___ *ptr, int flag);
293 void enqueueoptional(struct ___Object___ * currobj, int numfailedfses, int * failedfses, struct taskdescriptor * task, int index);
296 int flagcomp(const int *val1, const int *val2) {
297 return (*val1)-(*val2);
300 void flagorand(void * ptr, int ormask, int andmask) {
302 struct ___Object___ * obj = (struct ___Object___ *)ptr;
303 if(obj->numfses){/*store the information about fses*/
304 int flag, i, j,counter, offset=0;
305 for(i=0;i<obj->numfses;i++) {
307 counter=obj->fses[offset++];
309 for(j=0;j<counter;j++) {
310 flag=obj->fses[offset];
311 obj->fses[offset++]=(flag|ormask)&andmask;
313 qsort(&obj->fses[oldoffset], sizeof(int), counter, (int (*)(const void *, const void *)) &flagcomp);
315 enqueueoptional(obj, 0, NULL, NULL, 0);
320 int oldflag=((int *)ptr)[1];
321 int flag=ormask|oldflag;
327 void intflagorand(void * ptr, int ormask, int andmask) {
329 struct ___Object___ * obj = (struct ___Object___ *)ptr;
330 if(obj->numfses) {/*store the information about fses*/
331 int flag, i, j,counter, offset=0;
332 for(i=0;i<obj->numfses;i++) {
334 counter=obj->fses[offset++];
336 for(j=0;j<counter;j++) {
337 flag=obj->fses[offset];
338 obj->fses[offset++]=(flag|ormask)&andmask;
340 qsort(&obj->fses[oldoffset], sizeof(int), counter, (int (*)(const void *, const void *)) &flagcomp);
342 enqueueoptional(obj, 0, NULL, NULL, 0);
347 int oldflag=((int *)ptr)[1];
348 int flag=ormask|oldflag;
350 if (flag==oldflag) /* Don't do anything */
352 else flagbody(ptr, flag);
356 void flagorandinit(void * ptr, int ormask, int andmask) {
357 int oldflag=((int *)ptr)[1];
358 int flag=ormask|oldflag;
363 void flagbody(struct ___Object___ *ptr, int flag) {
364 struct parameterwrapper *flagptr=(struct parameterwrapper *)ptr->flagptr;
367 /*Remove object from all queues */
368 while(flagptr!=NULL) {
369 struct parameterwrapper *next;
370 int UNUSED, UNUSED2, UNUSED3;
371 ObjectHashget(flagptr->objectset, (int) ptr, (int *) &next, &UNUSED, &UNUSED2, &UNUSED3);
372 ObjectHashremove(flagptr->objectset, (int)ptr);
377 struct QueueItem *tmpptr;
378 struct parameterwrapper * parameter=objectqueues[ptr->type];
380 struct parameterwrapper * prevptr=NULL;
381 struct ___Object___ *tagptr=ptr->___tags___;
383 /* Outer loop iterates through all parameter queues an object of
384 this type could be in. */
386 while(parameter!=NULL) {
388 if (parameter->numbertags>0) {
390 goto nextloop;//that means the object has no tag but that param needs tag
391 else if(tagptr->type==TAGTYPE) {//one tag
392 struct ___TagDescriptor___ * tag=(struct ___TagDescriptor___*) tagptr;
393 for(i=0;i<parameter->numbertags;i++) {
394 //slotid is parameter->tagarray[2*i];
395 int tagid=parameter->tagarray[2*i+1];
396 if (tagid!=tagptr->flag)
397 goto nextloop; /*We don't have this tag */
399 } else {//multiple tags
400 struct ArrayObject * ao=(struct ArrayObject *) tagptr;
401 for(i=0;i<parameter->numbertags;i++) {
402 //slotid is parameter->tagarray[2*i];
403 int tagid=parameter->tagarray[2*i+1];
405 for(j=0;j<ao->___cachedCode___;j++) {
406 if (tagid==ARRAYGET(ao, struct ___TagDescriptor___*, i)->flag)
417 for(i=0;i<parameter->numberofterms;i++) {
418 int andmask=parameter->intarray[i*2];
419 int checkmask=parameter->intarray[i*2+1];
420 if ((flag&andmask)==checkmask) {
421 enqueuetasks(parameter, prevptr, ptr, NULL, 0);
427 parameter=parameter->next;
429 ptr->flagptr=prevptr;
435 int checktags(struct ___Object___ * currobj, struct fsanalysiswrapper * fswrapper) {
437 struct ___Object___ * tagptr = currobj->___tags___;
438 if(fswrapper->numtags>0){
440 return 0; //that means the object has no tag but that param
442 else if(tagptr->type==TAGTYPE) {//one tag
443 if(fswrapper->numtags!=1)
444 return 0; //we don't have the right number of tags
445 struct ___TagDescriptor___ * tag=(struct ___TagDescriptor___*) tagptr;
446 if (fswrapper->tags[0]!=tagptr->flag)
448 } else { //multiple tags
449 struct ArrayObject * ao=(struct ArrayObject *) tagptr;
453 if(ao->___length___!=fswrapper->numtags)
454 return 0;//we don't have the right number of tags
455 for(tag_counter=0;tag_counter<fswrapper->numtags;tag_counter++) {
456 int tagid=fswrapper->tags[tag_counter];
458 for(j=0;j<ao->___cachedCode___;j++) {
459 if (tagid==ARRAYGET(ao, struct ___TagDescriptor___*, tag_counter)->flag)
469 int getlength(int *flist, int len) {
473 int size=flist[count];
479 int * domergeor(int *flist1, int len1, int *flist2, int len2) {
480 int size1=getlength(flist1, len1);
481 int size2=getlength(flist2, len2);
482 int *merge=RUNMALLOC((size1+size2)*sizeof(int));
483 memcpy(merge, flist1, size1*sizeof(int));
484 memcpy(&merge[size1], flist2, size2*sizeof(int));
488 int domerge(int * flist1, int len1, int *flist2, int len2, int *merge) {
492 while(i<len1||j<len2) {
493 if (i<len1&&(j==len2||flist1[i]<flist2[j])) {
495 merge[count]=flist1[i];
499 } else if (j<len2&&(i==len1||flist2[j]<flist1[i])) {
501 merge[count]=flist2[j];
505 } else if (i<len1&&j<len2&&flist1[i]==flist2[j]) {
507 merge[count]=flist1[i];
517 /* Merge flags from ftlmerge into ftl. */
518 void mergeitems(struct failedtasklist *ftl, struct failedtasklist *ftlmerge) {
523 for(i=0;i<ftl->numflags;i++) {
524 int len=ftl->flags[offset++];
526 for(j=0;j<ftlmerge->numflags;j++) {
527 int lenmerge=ftlmerge->flags[offsetmerge++];
528 length+=1+domerge(&ftl->flags[offset],len,&ftlmerge->flags[offsetmerge],lenmerge, NULL);
529 offsetmerge+=lenmerge;
533 mergedlist=RUNMALLOC(sizeof(int)*length);
537 for(i=0;i<ftl->numflags;i++) {
538 int len=ftl->flags[offset++];
540 for(j=0;j<ftlmerge->numflags;j++) {
541 int lenmerge=ftlmerge->flags[offsetmerge++];
542 int size=domerge(&ftl->flags[offset],len,&ftlmerge->flags[offsetmerge],lenmerge,&mergedlist[length+1]);
543 mergedlist[length]=size;
548 ftl->flags=mergedlist;
549 ftl->numflags*=ftlmerge->numflags;
552 void mergefailedlists(struct failedtasklist **andlist, struct failedtasklist *list) {
553 struct failedtasklist *tmpptr;
554 while((*andlist)!=NULL) {
555 struct failedtasklist *searchftl=list;
556 while(searchftl!=NULL) {
557 if ((*andlist)->task==searchftl->task&&
558 (*andlist)->index==searchftl->index) {
559 mergeitems(*andlist, searchftl);
562 searchftl=searchftl->next;
564 if (searchftl==NULL) {
565 //didn't find andlist
567 *andlist=(*andlist)->next;//splice item out of list
568 RUNFREE(tmpptr->flags); //free the item
571 andlist=&((*andlist)->next); //iterate to next item
574 //free the list we're searching
577 RUNFREE(list->flags);
583 struct failedtasklist * processfailstate(struct classanalysiswrapper * classwrapper, struct taskdescriptor *task, int index, struct ___Object___ * currobj, int flagstate) {
584 struct failedtasklist *list=NULL;
586 struct fsanalysiswrapper *fswrapper=NULL;
587 for(h=0;h<classwrapper->numfsanalysiswrappers;h++) {
588 struct fsanalysiswrapper * tmp=classwrapper->fsanalysiswrapperarray[h];
589 if (tmp->flags==flagstate&&checktags(currobj, tmp)) {
590 //we only match exactly here
597 for(i=0;i<fswrapper->numtaskfailures;i++) {
599 struct taskfailure * taskfail=fswrapper->taskfailurearray[i];
600 if (taskfail->task==task&&taskfail->index==index) {
602 while(start<taskfail->numoptionaltaskdescriptors) {
603 struct taskdescriptor *currtask=NULL;
604 struct failedtasklist *tmpftl;
608 int numenterflags, offset;
609 struct parameterwrapper *pw;
610 for(j=start;j<taskfail->numoptionaltaskdescriptors;j++) {
611 struct optionaltaskdescriptor *otd=taskfail->optionaltaskdescriptorarray[j];
614 currindex=otd->index;
615 } else if (currtask!=otd->task||currindex!=otd->index)
617 totallength+=otd->numenterflags;
619 pw=currtask->descriptorarray[currindex]->queue;
620 enterflags=RUNMALLOC(totallength*sizeof(int));
621 numenterflags=j-start;
623 for(start;start<j;start++) {
624 struct optionaltaskdescriptor *otd=taskfail->optionaltaskdescriptorarray[start];
625 enterflags[offset++]=otd->numenterflags;
626 memcpy(&enterflags[offset], otd->enterflags, otd->numenterflags*sizeof(int));
627 offset+=otd->numenterflags;
629 tmpftl=RUNMALLOC(sizeof(struct failedtasklist));
631 tmpftl->task=currtask;
632 tmpftl->numflags=numenterflags;
633 tmpftl->flags=enterflags;
641 struct failedtasklist * processnormfailstate(struct classanalysiswrapper * classwrapper, struct ___Object___ * currobj, int flagstate) {
642 struct failedtasklist *list=NULL;
645 struct fsanalysiswrapper *fswrapper=NULL;
646 for(h=0;h<classwrapper->numfsanalysiswrappers;h++) {
647 struct fsanalysiswrapper * tmp=classwrapper->fsanalysiswrapperarray[h];
648 if (tmp->flags==flagstate&&checktags(currobj, tmp)) {
649 //we only match exactly here
657 while(start<fswrapper->numoptionaltaskdescriptors) {
658 struct taskdescriptor *currtask=NULL;
659 struct failedtasklist *tmpftl;
664 int numenterflags, offset;
665 struct parameterwrapper *pw;
666 for(j=start;j<fswrapper->numoptionaltaskdescriptors;j++) {
667 struct optionaltaskdescriptor *otd=fswrapper->optionaltaskdescriptorarray[j];
670 currindex=otd->index;
671 } else if (currtask!=otd->task||currindex!=otd->index)
673 totallength+=otd->numenterflags;
675 pw=currtask->descriptorarray[currindex]->queue;
676 enterflags=RUNMALLOC(totallength*sizeof(int));
677 numenterflags=j-start;
679 for(start;start<j;start++) {
680 struct optionaltaskdescriptor *otd=fswrapper->optionaltaskdescriptorarray[start];
681 enterflags[offset++]=otd->numenterflags;
682 memcpy(&enterflags[offset], otd->enterflags, otd->numenterflags*sizeof(int));
683 offset+=otd->numenterflags;
685 tmpftl=RUNMALLOC(sizeof(struct failedtasklist));
687 tmpftl->task=currtask;
688 tmpftl->numflags=numenterflags;
689 tmpftl->flags=enterflags;
697 void enqueuelist(struct ___Object___ * currobj, struct failedtasklist * andlist) {
698 while(andlist!=NULL) {
699 struct failedtasklist *tmp=andlist;
700 struct parameterwrapper *pw=andlist->task->descriptorarray[andlist->index]->queue;
701 struct parmaeterwrapper *next;
706 if (enqueuetasks(pw, currobj->flagptr, currobj, tmp->flags, tmp->numflags))
709 andlist=andlist->next;
714 void enqueueoptional(struct ___Object___ * currobj, int numfailedfses, int * failedfses, struct taskdescriptor * task, int index) {
715 struct classanalysiswrapper * classwrapper=NULL;
717 /*test what optionaltaskdescriptors are available, find the class
719 if (classanalysiswrapperarray[currobj->type]!=NULL) {
720 classwrapper = classanalysiswrapperarray[currobj->type];
725 /* We have a failure */
726 if (failedfses==NULL) {
727 /* Failed in normal state */
728 /*first time the method is invoked*/
730 struct fsanalysiswrapper *fswrapper=NULL;
732 for(h=0;h<classwrapper->numfsanalysiswrappers;h++) {
733 struct fsanalysiswrapper * tmp=classwrapper->fsanalysiswrapperarray[h];
734 if (tmp->flags==currobj->flag&&checktags(currobj, tmp)) {
735 //we only match exactly here
740 if(fswrapper==NULL) //nothing to do in this state
742 for(i=0;i<fswrapper->numtaskfailures;i++) {
744 struct taskfailure * taskfail=fswrapper->taskfailurearray[i];
745 if (taskfail->task==task&&taskfail->index==index) {
747 while(start<taskfail->numoptionaltaskdescriptors) {
748 struct taskdescriptor *currtask=NULL;
752 int numenterflags, offset;
753 struct parameterwrapper *pw;
754 for(j=start;j<taskfail->numoptionaltaskdescriptors;j++) {
755 struct optionaltaskdescriptor *otd=taskfail->optionaltaskdescriptorarray[j];
758 currindex=otd->index;
759 } else if (currtask!=otd->task||currindex!=otd->index)
761 totallength+=otd->numenterflags;
763 pw=currtask->descriptorarray[currindex]->queue;
764 enterflags=RUNMALLOC(totallength*sizeof(int));
765 numenterflags=j-start;
768 for(start;start<j;start++) {
769 struct optionaltaskdescriptor *otd=taskfail->optionaltaskdescriptorarray[start];
770 enterflags[offset++]=otd->numenterflags;
771 memcpy(&enterflags[offset], otd->enterflags, otd->numenterflags*sizeof(int));
772 offset+=otd->numenterflags;
775 if (enqueuetasks(pw, currobj->flagptr, currobj, enterflags, numenterflags))
781 /* Failed in failed state */
784 for(i=0;i<numfailedfses;i++) {
785 int numfses=failedfses[offset++];
787 struct failedtasklist *andlist=NULL;
788 for(j=0;j<numfses;j++) {
789 int flagstate=failedfses[offset++];
790 struct failedtasklist *currlist=processfailstate(classwrapper, task, index, currobj, flagstate);
794 mergefailedlists(&andlist, currlist);
796 enqueuelist(currobj, andlist);
800 /* No failure, but we are in a failed state */
801 struct parameterwrapper *flagptr=(struct parameterwrapper *)currobj->flagptr;
803 /*Remove object from all queues */
804 while(flagptr!=NULL) {
805 struct parameterwrapper *next;
806 int UNUSED, UNUSED2, UNUSED3;
807 ObjectHashget(flagptr->objectset, (int) currobj, (int *) &next, &UNUSED, &UNUSED2, &UNUSED3);
808 ObjectHashremove(flagptr->objectset, (int)currobj);
812 /* Failed in failed state */
815 for(i=0;i<currobj->numfses;i++) {
816 int numfses=currobj->fses[offset++];
818 struct failedtasklist *andlist=NULL;
819 for(j=0;j<numfses;j++) {
820 int flagstate=currobj->fses[offset++];
821 struct failedtasklist *currlist=processnormfailstate(classwrapper, currobj, flagstate);
825 mergefailedlists(&andlist, currlist);
827 enqueuelist(currobj, andlist);
835 int enqueuetasks(struct parameterwrapper *parameter, struct parameterwrapper *prevptr, struct ___Object___ *ptr, int * enterflags, int numenterflags) {
836 void * taskpointerarray[MAXTASKPARAMS];
838 int failed[MAXTASKPARAMS];
841 int numparams=parameter->task->numParameters;
842 int numiterators=parameter->task->numTotal-1;
847 struct taskdescriptor * task=parameter->task;
850 if (ObjectHashcontainskey(parameter->objectset, (int) ptr)) {
851 /* The object is already here...or it with the existing item */
857 ObjectHashget(parameter->objectset, (int) ptr, & oldptr, (int *) &oldflags, &oldnumflags, &oldstatus);
858 mergedflags=domergeor(oldflags, oldnumflags, enterflags, numenterflags);
859 ObjectHashupdate(parameter->objectset, (int) ptr, oldptr, mergedflags, oldnumflags+numenterflags, oldstatus||(enterflags==NULL));
864 //only add if truly needed
873 ObjectHashadd(parameter->objectset, (int) ptr, (int) prevptr, (int) enterflags, numenterflags, enterflags==NULL);//this add the object to parameterwrapper
878 /* Add enqueued object to parameter vector */
879 taskpointerarray[parameter->slot]=ptr;
881 failed[parameter->slot]=(enterflags!=NULL);
884 /* Reset iterators */
885 for(j=0;j<numiterators;j++) {
886 toiReset(¶meter->iterators[j]);
889 /* Find initial state */
890 for(j=0;j<numiterators;j++) {
892 if(toiHasNext(¶meter->iterators[j], taskpointerarray OPTARG(failed)))
893 toiNext(¶meter->iterators[j], taskpointerarray OPTARG(failed));
895 /* Need to backtrack */
896 toiReset(¶meter->iterators[j]);
900 /* Nothing to enqueue */
907 /* Enqueue current state */
909 struct taskparamdescriptor *tpd=RUNMALLOC(sizeof(struct taskparamdescriptor));
911 tpd->numParameters=numiterators+1;
912 tpd->parameterArray=RUNMALLOC(sizeof(void *)*(numiterators+1));
914 tpd->failed=RUNMALLOC(sizeof(int)*(numiterators+1));
916 for(j=0;j<=numiterators;j++){
917 tpd->parameterArray[j]=taskpointerarray[j];//store the actual parameters
919 tpd->failed[j]=failed[j];
923 if ((!gencontains(failedtasks, tpd)&&!gencontains(activetasks,tpd))) {
924 genputtable(activetasks, tpd, tpd);
926 RUNFREE(tpd->parameterArray);
930 /* This loop iterates to the next parameter combination */
934 for(j=numiterators-1; j<numiterators;j++) {
936 if(toiHasNext(¶meter->iterators[j], taskpointerarray OPTARG(failed)))
937 toiNext(¶meter->iterators[j], taskpointerarray OPTARG(failed));
939 /* Need to backtrack */
940 toiReset(¶meter->iterators[j]);
944 /* Nothing more to enqueue */
952 /* Handler for signals. The signals catch null pointer errors and
953 arithmatic errors. */
955 void myhandler(int sig, siginfo_t *info, void *uap) {
958 printf("sig=%d\n",sig);
961 sigemptyset(&toclear);
962 sigaddset(&toclear, sig);
963 sigprocmask(SIG_UNBLOCK, &toclear,NULL);
964 longjmp(error_handler,1);
969 struct RuntimeHash *fdtoobject;
971 void addreadfd(int fd) {
974 FD_SET(fd, &readfds);
977 void removereadfd(int fd) {
978 FD_CLR(fd, &readfds);
979 if (maxreadfd==(fd+1)) {
981 while(maxreadfd>0&&!FD_ISSET(maxreadfd-1, &readfds))
993 int * fsescopy(int *src, int len) {
997 dst=RUNMALLOC(len*sizeof(int));
998 memcpy(dst, src, len*sizeof(int));
1003 void executetasks() {
1004 void * taskpointerarray[MAXTASKPARAMS+OFFSET];
1006 int * fsesarray[MAXTASKPARAMS];
1007 int * oldfsesarray[MAXTASKPARAMS];
1008 int numfsesarray[MAXTASKPARAMS];
1011 /* Set up signal handlers */
1012 struct sigaction sig;
1013 sig.sa_sigaction=&myhandler;
1014 sig.sa_flags=SA_SIGINFO;
1015 sigemptyset(&sig.sa_mask);
1017 /* Catch bus errors, segmentation faults, and floating point exceptions*/
1018 sigaction(SIGBUS,&sig,0);
1019 sigaction(SIGSEGV,&sig,0);
1020 sigaction(SIGFPE,&sig,0);
1021 sigaction(SIGPIPE,&sig,0);
1026 fdtoobject=allocateRuntimeHash(100);
1028 /* Map first block of memory to protected, anonymous page */
1029 mmap(0, 0x1000, 0, MAP_SHARED|MAP_FIXED|MAP_ANON, -1, 0);
1032 while((hashsize(activetasks)>0)||(maxreadfd>0)) {
1034 /* Check if any filedescriptors have IO pending */
1037 struct timeval timeout={0,0};
1041 numselect=select(maxreadfd, &tmpreadfds, NULL, NULL, &timeout);
1043 /* Process ready fd's */
1045 for(fd=0;fd<maxreadfd;fd++) {
1046 if (FD_ISSET(fd, &tmpreadfds)) {
1047 /* Set ready flag on object */
1049 // printf("Setting fd %d\n",fd);
1050 if (RuntimeHashget(fdtoobject, fd,(int *) &objptr)) {
1051 intflagorand(objptr,1,0xFFFFFFFF); /* Set the first flag to 1 */
1058 /* See if there are any active tasks */
1059 if (hashsize(activetasks)>0) {
1061 currtpd=(struct taskparamdescriptor *) getfirstkey(activetasks);
1062 genfreekey(activetasks, currtpd);
1064 /* Check if this task has failed, allow a task that contains optional objects to fire */
1065 if (gencontains(failedtasks, currtpd)) {
1066 // Free up task parameter descriptor
1067 RUNFREE(currtpd->parameterArray);
1071 int numparams=currtpd->task->numParameters;
1072 int numtotal=currtpd->task->numTotal;
1074 /* Make sure that the parameters are still in the queues */
1075 for(i=0;i<numparams;i++) {
1076 void * parameter=currtpd->parameterArray[i];
1077 struct parameterdescriptor * pd=currtpd->task->descriptorarray[i];
1078 struct parameterwrapper *pw=(struct parameterwrapper *) pd->queue;
1080 /* Check that object is still in queue */
1083 int UNUSED, UNUSED2;
1085 int numflags, isnonfailed;
1086 int failed=currtpd->failed[i];
1087 if (!ObjectHashget(pw->objectset, (int) parameter, &UNUSED, (int *) &flags, &numflags, &isnonfailed)) {
1088 RUNFREE(currtpd->parameterArray);
1089 RUNFREE(currtpd->failed);
1093 if (failed&&(flags!=NULL)) {
1096 numfsesarray[i]=numflags;
1097 } else if (!failed && isnonfailed) {
1098 //Non-failed parameter
1102 RUNFREE(currtpd->parameterArray);
1103 RUNFREE(currtpd->failed);
1111 if (!ObjectHashcontainskey(pw->objectset, (int) parameter)) {
1112 RUNFREE(currtpd->parameterArray);
1120 /* Check that object still has necessary tags */
1121 for(j=0;j<pd->numbertags;j++) {
1122 int slotid=pd->tagarray[2*j]+numparams;
1123 struct ___TagDescriptor___ *tagd=currtpd->parameterArray[slotid];
1124 if (!containstag(parameter, tagd)) {
1125 RUNFREE(currtpd->parameterArray);
1131 taskpointerarray[i+OFFSET]=parameter;
1134 for(;i<numtotal;i++) {
1135 taskpointerarray[i+OFFSET]=currtpd->parameterArray[i];
1139 /* Checkpoint the state */
1140 forward=allocateRuntimeHash(100);
1141 reverse=allocateRuntimeHash(100);
1142 void ** checkpoint=makecheckpoint(currtpd->task->numParameters, currtpd->parameterArray, forward, reverse);
1144 if (x=setjmp(error_handler)) {
1148 printf("Fatal Error=%d, Recovering!\n",x);
1150 genputtable(failedtasks,currtpd,currtpd);
1151 restorecheckpoint(currtpd->task->numParameters, currtpd->parameterArray, checkpoint, forward, reverse);
1154 for(counter=0; counter<currtpd->task->numParameters; counter++){
1156 enqueueoptional(currtpd->parameterArray[counter], numfsesarray[counter], fsesarray[counter], currtpd->task, counter);
1159 if (fsesarray[counter]!=NULL)
1160 RUNFREE(fsesarray[counter]);
1163 freeRuntimeHash(forward);
1164 freeRuntimeHash(reverse);
1169 if (injectfailures) {
1170 if ((((double)random())/RAND_MAX)<failurechance) {
1171 printf("\nINJECTING TASK FAILURE to %s\n", currtpd->task->name);
1172 longjmp(error_handler,10);
1175 /* Actually call task */
1177 ((int *)taskpointerarray)[0]=currtpd->task->numParameters;
1178 taskpointerarray[1]=NULL;
1181 //get the task flags set
1182 for(i=0;i<numparams;i++) {
1183 oldfsesarray[i]=((struct ___Object___ *)taskpointerarray[i+OFFSET])->fses;
1184 fsesarray[i]=fsescopy(fsesarray[i], numfsesarray[i]);
1185 ((struct ___Object___ *)taskpointerarray[i+OFFSET])->fses=fsesarray[i];
1189 printf("ENTER %s count=%d\n",currtpd->task->name, (instaccum-instructioncount));
1190 ((void (*) (void **)) currtpd->task->taskptr)(taskpointerarray);
1191 printf("EXIT %s count=%d\n",currtpd->task->name, (instaccum-instructioncount));
1193 ((void (*) (void **)) currtpd->task->taskptr)(taskpointerarray);
1196 for(i=0;i<numparams;i++) {
1198 if(oldfsesarray[i]!=NULL)
1199 RUNFREE(oldfsesarray[i]);
1203 freeRuntimeHash(forward);
1204 freeRuntimeHash(reverse);
1206 // Free up task parameter descriptor
1207 RUNFREE(currtpd->parameterArray);
1217 /* This function processes an objects tags */
1218 void processtags(struct parameterdescriptor *pd, int index, struct parameterwrapper *parameter, int * iteratorcount, int *statusarray, int numparams) {
1221 for(i=0;i<pd->numbertags;i++) {
1222 int slotid=pd->tagarray[2*i];
1223 int tagid=pd->tagarray[2*i+1];
1225 if (statusarray[slotid+numparams]==0) {
1226 parameter->iterators[*iteratorcount].istag=1;
1227 parameter->iterators[*iteratorcount].tagid=tagid;
1228 parameter->iterators[*iteratorcount].slot=slotid+numparams;
1229 parameter->iterators[*iteratorcount].tagobjectslot=index;
1230 statusarray[slotid+numparams]=1;
1237 void processobject(struct parameterwrapper *parameter, int index, struct parameterdescriptor *pd, int *iteratorcount, int * statusarray, int numparams) {
1240 struct ObjectHash * objectset=((struct parameterwrapper *)pd->queue)->objectset;
1242 parameter->iterators[*iteratorcount].istag=0;
1243 parameter->iterators[*iteratorcount].slot=index;
1244 parameter->iterators[*iteratorcount].objectset=objectset;
1245 statusarray[index]=1;
1247 for(i=0;i<pd->numbertags;i++) {
1248 int slotid=pd->tagarray[2*i];
1249 int tagid=pd->tagarray[2*i+1];
1250 if (statusarray[slotid+numparams]!=0) {
1251 /* This tag has already been enqueued, use it to narrow search */
1252 parameter->iterators[*iteratorcount].tagbindings[tagcount]=slotid+numparams;
1256 parameter->iterators[*iteratorcount].numtags=tagcount;
1261 /* This function builds the iterators for a task & parameter */
1263 void builditerators(struct taskdescriptor * task, int index, struct parameterwrapper * parameter) {
1264 int statusarray[MAXTASKPARAMS];
1266 int numparams=task->numParameters;
1267 int iteratorcount=0;
1268 for(i=0;i<MAXTASKPARAMS;i++) statusarray[i]=0;
1270 statusarray[index]=1; /* Initial parameter */
1271 /* Process tags for initial iterator */
1273 processtags(task->descriptorarray[index], index, parameter, & iteratorcount, statusarray, numparams);
1277 /* Check for objects with existing tags */
1278 for(i=0;i<numparams;i++) {
1279 if (statusarray[i]==0) {
1280 struct parameterdescriptor *pd=task->descriptorarray[i];
1282 for(j=0;j<pd->numbertags;j++) {
1283 int slotid=pd->tagarray[2*j];
1284 if(statusarray[slotid+numparams]!=0) {
1285 processobject(parameter, i, pd, &iteratorcount, statusarray, numparams);
1286 processtags(pd, i, parameter, &iteratorcount, statusarray, numparams);
1293 /* Next do objects w/ unbound tags*/
1295 for(i=0;i<numparams;i++) {
1296 if (statusarray[i]==0) {
1297 struct parameterdescriptor *pd=task->descriptorarray[i];
1298 if (pd->numbertags>0) {
1299 processobject(parameter, i, pd, &iteratorcount, statusarray, numparams);
1300 processtags(pd, i, parameter, &iteratorcount, statusarray, numparams);
1306 /* Nothing with a tag enqueued */
1308 for(i=0;i<numparams;i++) {
1309 if (statusarray[i]==0) {
1310 struct parameterdescriptor *pd=task->descriptorarray[i];
1311 processobject(parameter, i, pd, &iteratorcount, statusarray, numparams);
1312 processtags(pd, i, parameter, &iteratorcount, statusarray, numparams);
1325 /* This function processes the task information to create queues for
1326 each parameter type. */
1328 void processtasks() {
1330 for(i=0;i<numtasks;i++) {
1331 struct taskdescriptor * task=taskarray[i];
1334 for(j=0;j<task->numParameters;j++) {
1335 struct parameterdescriptor *param=task->descriptorarray[j];
1336 struct parameterwrapper * parameter=RUNMALLOC(sizeof(struct parameterwrapper));
1337 struct parameterwrapper ** ptr=&objectqueues[param->type];
1339 param->queue=parameter;
1340 parameter->objectset=allocateObjectHash(10);
1341 parameter->numberofterms=param->numberterms;
1342 parameter->intarray=param->intarray;
1343 parameter->numbertags=param->numbertags;
1344 parameter->tagarray=param->tagarray;
1345 parameter->task=task;
1346 /* Link new queue in */
1348 ptr=&((*ptr)->next);
1352 /* Build iterators for parameters */
1353 for(j=0;j<task->numParameters;j++) {
1354 struct parameterdescriptor *param=task->descriptorarray[j];
1355 struct parameterwrapper *parameter=param->queue;
1357 builditerators(task, j, parameter);
1362 void toiReset(struct tagobjectiterator * it) {
1365 } else if (it->numtags>0) {
1371 ObjectHashiterator(it->objectset, &it->it);
1378 int toiHasNext(struct tagobjectiterator *it, void ** objectarray OPTARG(int * failed)) {
1381 /* Get object with tags */
1382 struct ___Object___ *obj=objectarray[it->tagobjectslot];
1383 struct ___Object___ *tagptr=obj->___tags___;
1384 if (tagptr->type==TAGTYPE) {
1385 if ((it->tagobjindex==0)&& /* First object */
1386 (it->tagid==((struct ___TagDescriptor___ *)tagptr)->flag)) /* Right tag type */
1391 struct ArrayObject *ao=(struct ArrayObject *) tagptr;
1392 int tagindex=it->tagobjindex;
1393 for(;tagindex<ao->___cachedCode___;tagindex++) {
1394 struct ___TagDescriptor___ *td=ARRAYGET(ao, struct ___TagDescriptor___ *, tagindex);
1395 if (td->flag==it->tagid) {
1396 it->tagobjindex=tagindex; /* Found right type of tag */
1402 } else if (it->numtags>0) {
1403 /* Use tags to locate appropriate objects */
1404 struct ___TagDescriptor___ *tag=objectarray[it->tagbindings[0]];
1405 struct ___Object___ *objptr=tag->flagptr;
1407 if (objptr->type!=OBJECTARRAYTYPE) {
1408 if (it->tagobjindex>0)
1410 if (!ObjectHashcontainskey(it->objectset, (int) objptr))
1412 for(i=1;i<it->numtags;i++) {
1413 struct ___TagDescriptor___ *tag2=objectarray[it->tagbindings[i]];
1414 if (!containstag(objptr,tag2))
1418 if (it->failedstate==1) {
1419 int UNUSED, UNUSED2;
1422 ObjectHashget(it->objectset, (int) objptr, &UNUSED, (int *) &flags, &UNUSED2, &isnonfailed);
1431 int UNUSED, UNUSED2;
1434 ObjectHashget(it->objectset, (int) objptr, &UNUSED, (int *) &flags, &UNUSED2, &isnonfailed);
1443 struct ArrayObject *ao=(struct ArrayObject *) objptr;
1447 if (it->failedstate==1) {
1448 int UNUSED, UNUSED2;
1451 struct ___Object___ *objptr=ARRAYGET(ao, struct ___Object___*, it->tagobjindex);
1452 ObjectHashget(it->objectset, (int) objptr, &UNUSED, (int *) &flags, &UNUSED2, &isnonfailed);
1461 for(tagindex=it->tagobjindex;tagindex<ao->___cachedCode___;tagindex++) {
1462 struct ___Object___ *objptr=ARRAYGET(ao, struct ___Object___*, tagindex);
1463 if (!ObjectHashcontainskey(it->objectset, (int) objptr))
1465 for(i=1;i<it->numtags;i++) {
1466 struct ___TagDescriptor___ *tag2=objectarray[it->tagbindings[i]];
1467 if (!containstag(objptr,tag2))
1472 int UNUSED, UNUSED2;
1473 int flags, isnonfailed;
1474 struct ___Object___ *objptr=ARRAYGET(ao, struct ___Object___*, tagindex);
1475 ObjectHashget(it->objectset, (int) objptr, &UNUSED, &flags, &UNUSED2, &isnonfailed);
1481 it->tagobjindex=tagindex;
1486 it->tagobjindex=tagindex;
1491 if (it->failedstate==1) {
1492 if (Objdata2(&it->it))
1499 if (ObjhasNext(&it->it)) {
1500 if (!Objdata4(&it->it)) {
1508 return ObjhasNext(&it->it);
1513 int containstag(struct ___Object___ *ptr, struct ___TagDescriptor___ *tag) {
1515 struct ___Object___ * objptr=tag->flagptr;
1516 if (objptr->type==OBJECTARRAYTYPE) {
1517 struct ArrayObject *ao=(struct ArrayObject *)objptr;
1518 for(j=0;j<ao->___cachedCode___;j++) {
1519 if (ptr==ARRAYGET(ao, struct ___Object___*, j))
1527 void toiNext(struct tagobjectiterator *it , void ** objectarray OPTARG(int * failed)) {
1528 /* hasNext has all of the intelligence */
1531 /* Get object with tags */
1532 struct ___Object___ *obj=objectarray[it->tagobjectslot];
1533 struct ___Object___ *tagptr=obj->___tags___;
1534 if (tagptr->type==TAGTYPE) {
1536 objectarray[it->slot]=tagptr;
1538 struct ArrayObject *ao=(struct ArrayObject *) tagptr;
1539 objectarray[it->slot]=ARRAYGET(ao, struct ___TagDescriptor___ *, it->tagobjindex++);
1541 } else if (it->numtags>0) {
1542 /* Use tags to locate appropriate objects */
1543 struct ___TagDescriptor___ *tag=objectarray[it->tagbindings[0]];
1544 struct ___Object___ *objptr=tag->flagptr;
1545 if (objptr->type!=OBJECTARRAYTYPE) {
1547 failed[it->slot]=it->failedstate;
1548 objectarray[it->slot]=objptr;
1549 if (it->failedstate==0) {
1557 objectarray[it->slot]=objptr;
1560 struct ArrayObject *ao=(struct ArrayObject *) objptr;
1562 failed[it->slot]=it->failedstate;
1563 objectarray[it->slot]=ARRAYGET(ao, struct ___Object___ *, it->tagobjindex);
1564 if (it->failedstate==0) {
1571 objectarray[it->slot]=ARRAYGET(ao, struct ___Object___ *, it->tagobjindex++);
1575 /* Iterate object */
1576 objectarray[it->slot]=(void *)Objkey(&it->it);
1578 failed[it->slot]=it->failedstate;
1579 if (it->failedstate==0) {