Hello,

I have folowing question, hope it isn't too stupid:

> > The code is quite big, uses some amount of memory on runtime and
> > the performance isn't really different to the previous pid allocator.
> 
> The memory used at runtine is FAR less than the old code.
> The performance change it mainly to pfind() and pgfind() which are
> called quite often, and are now table lookups, not searches.

As I understand it, the table is initially small and grows on demand. Is
there any way do shrink it back, if the number of processes is
substantially lowered? 

Bye	Pavel