Re: [PATCH 3/3] nfnetlink_queue: use hash table to speed up entry finding.

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On Tue, Apr 13, 2010 at 8:44 PM, Eric Dumazet <eric.dumazet@xxxxxxxxx> wrote:
> Le mardi 13 avril 2010 à 19:06 +0800, Changli Gao a écrit :
>
> Thats theory. And for sparse arrays, that pro might be true.
> In your case, you prealloc all the array, using more ram than vmalloc...
>
> In practice, x86 cpu can access vmalloced() data much faster then
> flex_array_managed data (take a look at all the expensive divides in
> flex code... :'( )
>
> If vmalloc() happens to be slow, it can trivially be extended to use
> huge pages too. It will happen one day, when/if necessary.
>

The current flex_array isn't optimized well. If it is well optimized,
will it be faster than vmalloc()?

-- 
Regards,
Changli Gao(xiaosuo@xxxxxxxxx)
--
To unsubscribe from this list: send the line "unsubscribe netfilter-devel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html

[Index of Archives]     [Netfitler Users]     [LARTC]     [Bugtraq]     [Yosemite Forum]

  Powered by Linux