summaryrefslogtreecommitdiff
path: root/net/tipc/node.h
diff options
context:
space:
mode:
authorAllan Stephens <allan.stephens@windriver.com>2011-11-04 19:54:43 +0400
committerPaul Gortmaker <paul.gortmaker@windriver.com>2012-02-25 02:05:15 +0400
commita635b46bd884efc1fc98819cb5a200da255d575c (patch)
tree11474076133688401f58c8c0801b2c49776aa441 /net/tipc/node.h
parent9efde4a0bd2f21dec0c7b40da2bf2c3e189e98e2 (diff)
downloadlinux-a635b46bd884efc1fc98819cb5a200da255d575c.tar.xz
tipc: Hide internal details of node table implementation
Relocates information about the size of TIPC's node table index and its associated hash function, since only node subsystem routines need to have access to this information. Note that these changes are essentially cosmetic in nature, and have no impact on the actual operation of TIPC. Signed-off-by: Allan Stephens <allan.stephens@windriver.com> Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
Diffstat (limited to 'net/tipc/node.h')
-rw-r--r--net/tipc/node.h12
1 files changed, 0 insertions, 12 deletions
diff --git a/net/tipc/node.h b/net/tipc/node.h
index 7bf526af1dfb..72561c971d67 100644
--- a/net/tipc/node.h
+++ b/net/tipc/node.h
@@ -107,20 +107,8 @@ struct tipc_node {
} bclink;
};
-#define NODE_HTABLE_SIZE 512
extern struct list_head tipc_node_list;
-/*
- * A trivial power-of-two bitmask technique is used for speed, since this
- * operation is done for every incoming TIPC packet. The number of hash table
- * entries has been chosen so that no hash chain exceeds 8 nodes and will
- * usually be much smaller (typically only a single node).
- */
-static inline unsigned int tipc_hashfn(u32 addr)
-{
- return addr & (NODE_HTABLE_SIZE - 1);
-}
-
struct tipc_node *tipc_node_find(u32 addr);
struct tipc_node *tipc_node_create(u32 addr);
void tipc_node_delete(struct tipc_node *n_ptr);