diff options
| author | Allan Stephens <allan.stephens@windriver.com> | 2011-02-25 18:42:52 -0500 |
|---|---|---|
| committer | Paul Gortmaker <paul.gortmaker@windriver.com> | 2011-03-13 16:35:17 -0400 |
| commit | 672d99e19a12b703c9e2d71ead8fb8b8a85a3886 (patch) | |
| tree | cca078684f8adee7450cadcb565176f0a8b111ff /net/tipc/net.h | |
| parent | f831c963b5c20bec230edce89e25f369996be5db (diff) | |
| download | linux-672d99e19a12b703c9e2d71ead8fb8b8a85a3886.tar.bz2 | |
tipc: Convert node object array to a hash table
Replaces the dynamically allocated array of pointers to the cluster's
node objects with a static hash table. Hash collisions are resolved
using chaining, with a typical hash chain having only a single node,
to avoid degrading performance during processing of incoming packets.
The conversion to a hash table reduces the memory requirements for
TIPC's node table to approximately the same size it had prior to
the previous commit.
In addition to the hash table itself, TIPC now also maintains a
linked list for the node objects, sorted by ascending network address.
This list allows TIPC to continue sending responses to user space
applications that request node and link information in sorted order.
The list also improves performance when name table update messages are
sent by making it easier to identify the nodes that must be notified.
Signed-off-by: Allan Stephens <allan.stephens@windriver.com>
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
Diffstat (limited to 'net/tipc/net.h')
| -rw-r--r-- | net/tipc/net.h | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/net/tipc/net.h b/net/tipc/net.h index b52b9748b5e2..0ba6093fb6ce 100644 --- a/net/tipc/net.h +++ b/net/tipc/net.h @@ -37,10 +37,6 @@ #ifndef _TIPC_NET_H #define _TIPC_NET_H -struct tipc_node; - -extern struct tipc_node **tipc_nodes; -extern u32 tipc_highest_node; extern atomic_t tipc_num_links; extern rwlock_t tipc_net_lock; |