I'm looking at producing a netgraph node that is going to be
potentially very hard on kernel memory. The node may have to manage
as many as 10K netgraph hook connections (each one requires a small
amount of memory) and access to the hooks requires that they be in a
table (not a linked list).
* David Gilbert [EMAIL PROTECTED] [000201 17:41] wrote:
I'm looking at producing a netgraph node that is going to be
potentially very hard on kernel memory. The node may have to manage
as many as 10K netgraph hook connections (each one requires a small
amount of memory) and access to the
"Alfred" == Alfred Perlstein [EMAIL PROTECTED] writes:
Alfred Why not use a linked list, with a hash header to reduce search
Alfred times.
Well... I think a linked list is already created for me (we're talking
netgraph hooks here) and a hash isn't required since I can canive my
problem to fit
