RE: [BUG] list implementation too slow.

> Lately we've been doing some very high capacity testing on 
> Kannel , and
> found out some interesting stuff. mainly as queues (managed by lists)
> are filling up to over a few hundreds of messages, the boxes start
> thrashing. 
> I think this is directly related to the List implementation - 
> it's just
> too sssslllloooowwww. when we have more then a few hundreds 
> of messages
> in the List, extracting one item can sometimes take anywhere 
> from 2 to 4
> seconds (!!!).
> 
> Does any one have any information or experience regarding that ?

Do you have any insight into which particular list_() functions are
causing this ? Some of the comments in list.c suggest possible
inefficiencies, notably where the list has to grow to accomodate
insert/append operations. Also, all of the list search functions
are linear.

How are you measuring time spend in functions ? Quantify ?