lk/linux-kernel-test
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

ipv4: Clean whitespaces in net/ipv4/Kconfig.

Browse Source 
While going through net/ipv4/Kconfig cleanup whitespaces.

Signed-off-by: Jesper Dangaard Brouer <hawk@comx.dk>
Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
Jesper Dangaard Brouer
2009-02-22 00:07:13 -08:00
committed by David S. Miller
parent b2cc46a8ee
commit a6e8f27f3c
1 changed files with 22 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
net/ipv4/Kconfig
View File

@@ -61,26 +61,28 @@ choice
config ASK_IP_FIB_HASH config ASK_IP_FIB_HASH
bool "FIB_HASH" bool "FIB_HASH"
---help--- ---help---
Current FIB is very proven and good enough for most users. Current FIB is very proven and good enough for most users.
config IP_FIB_TRIE config IP_FIB_TRIE
bool "FIB_TRIE" bool "FIB_TRIE"
---help--- ---help---
Use new experimental LC-trie as FIB lookup algorithm. Use new experimental LC-trie as FIB lookup algorithm.
This improves lookup performance if you have a large This improves lookup performance if you have a large
number of routes. number of routes.
LC-trie is a longest matching prefix lookup algorithm which LC-trie is a longest matching prefix lookup algorithm which
performs better than FIB_HASH for large routing tables. performs better than FIB_HASH for large routing tables.
But, it consumes more memory and is more complex. But, it consumes more memory and is more complex.
LC-trie is described in: LC-trie is described in:
IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson
IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999 IEEE Journal on Selected Areas in Communications, 17(6):1083-1092,
An experimental study of compression methods for dynamic tries June 1999
Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/ An experimental study of compression methods for dynamic tries
Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/
endchoice endchoice