}
dfsList[0]=oid;
dfsList[1]=0;
-
-
+
+
//Start searching the dfsList
- for(top=0;top>=0;) {
+ for(top=0; top>=0;) {
oid=getNextOid(header, offsetarray, dfsList, top);
if (oid&1) {
top+=2;
if (top<0)
return head;
} while(dfsList[top+1] == GET_RANGE(offsetarray[top + 3]));
-
+
header=searchObj(dfsList[top]);
//header shouldn't be null unless the object moves away, but allow
//ourselves the option to just continue on if we lose the object
} else {
sendOidFound(header, oid, sd);
}
-
+
dfsList[0]=oid;
dfsList[1]=0;
-
+
//Start searching the dfsList
- for(top=0;top>=0;) {
+ for(top=0; top>=0;) {
oid=getNextOid(header, offsetarray, dfsList, top);
-
+
if (oid&1) {
top+=2;
dfsList[top]=oid;
if (top<0)
return head;
} while(dfsList[top+1] == GET_RANGE(offsetarray[top + 3]));
-
+
header=searchObj(dfsList[top]);
//header shouldn't be null unless the object moves away, but allow
//ourselves the option to just continue on if we lose the object
objheader_t *header;
if ((header = (objheader_t *)mhashSearch(oid)) != NULL) {
return header;
- } else
+ } else
return prehashSearch(oid);
}
perMcPrefetchList_t *ptr;
objOffsetPile_t *objnode;
objOffsetPile_t **tmp;
+
+ char ptr1[50];
+ midtoIP(mid, ptr1);
//Loop through the machines
for(; 1; head=&((*head)->next)) {
int tmid;
}
int elementsize = classsize[TYPE(header)];
- return *((unsigned int *)(((char *)ao) + sizeof(struct ArrayObject) + elementsize*currindex));
- } else {
+ return *((unsigned int *)(((char *)ao) + sizeof(struct ArrayObject) + elementsize*currindex));
+ } else {
//handle fields
- if(currcount!=0 & range != 0) {
+ if(currcount!=0 & range != 0) {
//go to the next offset
- header=searchObj(dfsList[top]);
+ header=searchObj(dfsList[top+2]);
if (header==NULL)
return 2;
}