diff options
author | David S. Miller <davem@davemloft.net> | 2005-06-24 20:50:53 -0400 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2005-06-24 20:50:53 -0400 |
commit | bb298ca3ce92574d57c4e49b329421425ea7d279 (patch) | |
tree | ed45f9ece02a50e7c1adf78ca3fb2a53b0f0314a /net | |
parent | f7704347a74fceaf79c89f8b8dbdd0111013e4d6 (diff) |
[IPV4]: Move FIB lookup algorithm choice under IP_ADVANCED_ROUTING
Most users need not be concerned with a complex choice of what
FIB lookup algorithm to use. So give them the safe default of
IP_FIB_HASH if IP_ADVANCED_ROUTING is disabled.
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net')
-rw-r--r-- | net/ipv4/Kconfig | 64 |
1 files changed, 38 insertions, 26 deletions
diff --git a/net/ipv4/Kconfig b/net/ipv4/Kconfig index 690e88ba2484..7bcfb84126d1 100644 --- a/net/ipv4/Kconfig +++ b/net/ipv4/Kconfig | |||
@@ -1,32 +1,6 @@ | |||
1 | # | 1 | # |
2 | # IP configuration | 2 | # IP configuration |
3 | # | 3 | # |
4 | choice | ||
5 | prompt "Choose IP: FIB lookup" | ||
6 | depends on INET | ||
7 | default IP_FIB_HASH | ||
8 | |||
9 | config IP_FIB_HASH | ||
10 | bool "FIB_HASH" | ||
11 | ---help--- | ||
12 | Current FIB is very proven and good enough for most users. | ||
13 | |||
14 | config IP_FIB_TRIE | ||
15 | bool "FIB_TRIE" | ||
16 | ---help--- | ||
17 | Use new experimental LC-trie as FIB lookup algoritm. | ||
18 | This improves lookup performance | ||
19 | |||
20 | LC-trie is described in: | ||
21 | |||
22 | IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson | ||
23 | IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999 | ||
24 | An experimental study of compression methods for dynamic tries | ||
25 | Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002. | ||
26 | http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/ | ||
27 | |||
28 | endchoice | ||
29 | |||
30 | config IP_MULTICAST | 4 | config IP_MULTICAST |
31 | bool "IP: multicasting" | 5 | bool "IP: multicasting" |
32 | depends on INET | 6 | depends on INET |
@@ -79,6 +53,44 @@ config IP_ADVANCED_ROUTER | |||
79 | 53 | ||
80 | If unsure, say N here. | 54 | If unsure, say N here. |
81 | 55 | ||
56 | choice | ||
57 | prompt "Choose IP: FIB lookup algorithm (choose FIB_HASH if unsure)" | ||
58 | depends on IP_ADVANCED_ROUTER | ||
59 | default IP_FIB_HASH | ||
60 | |||
61 | config IP_FIB_HASH | ||
62 | bool "FIB_HASH" | ||
63 | ---help--- | ||
64 | Current FIB is very proven and good enough for most users. | ||
65 | |||
66 | config IP_FIB_TRIE | ||
67 | bool "FIB_TRIE" | ||
68 | ---help--- | ||
69 | Use new experimental LC-trie as FIB lookup algoritm. | ||
70 | This improves lookup performance if you have a large | ||
71 | number of routes. | ||
72 | |||
73 | LC-trie is a longest matching prefix lookup algorithm which | ||
74 | performs better than FIB_HASH for large routing tables. | ||
75 | But, it consumes more memory and is more complex. | ||
76 | |||
77 | LC-trie is described in: | ||
78 | |||
79 | IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson | ||
80 | IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999 | ||
81 | An experimental study of compression methods for dynamic tries | ||
82 | Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002. | ||
83 | http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/ | ||
84 | |||
85 | endchoice | ||
86 | |||
87 | # If the user does not enable advanced routing, he gets the safe | ||
88 | # default of the fib-hash algorithm. | ||
89 | config IP_FIB_HASH | ||
90 | bool | ||
91 | depends on !IP_ADVANCED_ROUTER | ||
92 | default y | ||
93 | |||
82 | config IP_MULTIPLE_TABLES | 94 | config IP_MULTIPLE_TABLES |
83 | bool "IP: policy routing" | 95 | bool "IP: policy routing" |
84 | depends on IP_ADVANCED_ROUTER | 96 | depends on IP_ADVANCED_ROUTER |