On Fri, 20 Sep 2002 20:09:51 -0700, ted olausson wrote: >>> Very relieved to read the busted CACHE.IDX has been fixed ! >> THAT one was a real BITCH to figure-out.
> Well, unless it hasnt been a second problem since spring then i was the > one who solved the length problem. > AFAIK, it was quite logical. Arachne saves a bunch of data and adds 2 > bytes to save the length, also the distance to the next field in the > linked list. > Therefore it was needed to add the length of these two bytes to make the > comparision true. > if(sizeof(struct HTTPrecord)+2==len) > Which you later has changed to a subtraction on the len. which gives the > same result but isnt that logical to read. > if(sizeof(struct HTTPrecord)==len-2) Thank you for reminding us. (I had forgotten about that part) Ok, That's half of the question. What about the other half ? Why must we reverse the order of the last 2 cacheitems ? from, dynamic lastseen to, lastseen dynamic It has me stumped as to why this is needed. And why it works. As I said: Logic says it can't work..... but it does work. -- Glenn http://arachne.cz/ http://www.delorie.com/listserv/mime/ http://www.angelfire.com/id/glenndoom/download.htm http://www.thispagecannotbedisplayed.com/
