Yep that works
with size of 1 it stores minimal data and not grows more than a cuple of bytes
Thx a lot

P.S. Anyway this is a tricky (hack) and suppose in the future will be cool to add function to disable hash at all. I understand that this is not ususal case but anyway it makes sence to be

ср, 2 янв. 2019 г. в 18:02, Richard Fuchs <rfuchs@sipwise.com>:
On 02/01/2019 09.32, Yuriy Gorlichenko wrote:
> Thx for the reply
> Yes
> Internal hash table diffenentelly stores info
> But even it case of putting timeout to 0 it still grows in synthetic
> tests. So looks like it will grows alsways because of deletes entries
> but creates new and so on and so on...
> So means it decrases "leak" but not fully
>
> Is there some hidden function maybe to drop hast table o some ticky to
> do this? (we are using oru ow algorinthm that garanties to use same
> node in case of transaction)


You should be able to set the timeout to zero and the size of the hash
table to one (variable `hash_table_size`). That should make the code
purge out all entries on every operation, keeping the number of entries
minimal.

Cheers


_______________________________________________
Kamailio (SER) - Users Mailing List
sr-users@lists.kamailio.org
https://lists.kamailio.org/cgi-bin/mailman/listinfo/sr-users