httpd-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ben Laurie <>
Subject Re: bucket brigades and IOL
Date Wed, 17 Nov 1999 00:09:57 GMT
"Roy T. Fielding" wrote:
> >I've got to say that this is the most coherent suggestion along these
> >lines that I've seen yet. I rather like it. One thing I'd add is that if
> >you are going to have a movable "start of block" pointer, and changeable
> >length, it can be nice to allocate extra around the edges under some
> >circumstances, so that lower layers can expand the block without having
> >to add extra chunks.
> Or, alternatively, allocate equal size blocks and just pass around
> a reference pair within the buckets that, when the bucket is freed,
> access a more complicated reference-counting pool.  I think that is
> closer to what IO-Lite does.
> >Also, the usual objections still apply - i.e. it is awkward to do things
> >like searching for particular strings, since they may cross boundaries.
> >I'm beginning to think that the right answer to this is to provide nice
> >matching functions that know about the chunked structures, and last
> >resort functions that'll glue it all back into one chunk...
> Yep, that's what I ended up doing for Ada95, though in that case there
> were no easier alternatives.

Ummm ... are you saying there are easier alternatives for C? (I probably
shouldn't say it, but there certainly are [for the programmer] in C++).




"My grandfather once told me that there are two kinds of people: those
who work and those who take the credit. He told me to try to be in the
first group; there was less competition there."
     - Indira Gandhi

View raw message