Markus Amsler a écrit :
I cant try it at the moment, but I tried also the same approach. It
went down from 100s to around 27s compared to 18s with Heap functions.
The other problem here is, not all allocated memory is used, the gaps
in not first nodes never gets filled.
Also IMO memory allocation logic should only coded once.
I will try it with the HeapCreate/HeapDestroy for every
pool_init/pool_destroy as mentioned by Frank. Let's see what the
overhead of HeapCreate is.
you have to check the overhead both in terms of speed, but also in terms
of overall memory consumption
A+
--
Eric Pouech
"The problem with designing something completely foolproof is to underestimate the
ingenuity of a complete idiot." (Douglas Adams)
