Justtechjobs.com Find a programming school near you






Online Campus Both


php-developer-list | 2002112

Re: [PHP-DEV] Zend fast cache From: George Schlossnagle (george <email protected>)
Date: 11/30/02

How does searching the freelist work in this? How is this faster than
say a 3-level page table implementation?

That said, I do think that if we can get very fast code to pre-allocate
zval's it would be a good idea (hopefully we could get more than 5%
increase).
> I already have an idea for how I would want such an API to look like
> and I was planning to write it. It would also be useful for Zend
> objects which are preallocated today but if a realloc() were to be
> reached it would take quite some time (although one or two realloc()'s
> wouldn't be terrible).
> My idea is a two dimensional array. We'd allocate 2^n of memory blocks
> and assign it to array[0]. Once these are full we'd allocate another
> 2^n memory blocks and realloc() array to size of 2 and make array[1]
> point to it. The index to a block would be X and to find the right
> position it'd be array[X/2^n][X%2^n] of course as the length of each
> array is a power of two we wouldn't actually need to use division and
> modulo so it'd be fast.
> As we don't have templates in C we might be able to put all of this
> inline in a header file and with macros create such a fast allocating
> pool for some of the most used types specifically I think it'd be
> useful for zval's, objects and possible hash tables. I wouldn't overdo
> the amount of types I'd add to this pool because unless they are
> allocated and freed extremely often we wouldn't notice a speed
> difference.
>
> But remember what I said about 5% :)
> Andi
>
>
> --
> PHP Development Mailing List <http://www.php.net/>
> To unsubscribe, visit: http://www.php.net/unsub.php
> 

-- 
PHP Development Mailing List <http://www.php.net/>
To unsubscribe, visit: http://www.php.net/unsub.php