aboutsummaryrefslogtreecommitdiffstats
path: root/net/tipc/node.h
diff options
context:
space:
mode:
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 {
107 } bclink; 107 } bclink;
108}; 108};
109 109
110#define NODE_HTABLE_SIZE 512
111extern struct list_head tipc_node_list; 110extern struct list_head tipc_node_list;
112 111
113/*
114 * A trivial power-of-two bitmask technique is used for speed, since this
115 * operation is done for every incoming TIPC packet. The number of hash table
116 * entries has been chosen so that no hash chain exceeds 8 nodes and will
117 * usually be much smaller (typically only a single node).
118 */
119static inline unsigned int tipc_hashfn(u32 addr)
120{
121 return addr & (NODE_HTABLE_SIZE - 1);
122}
123
124struct tipc_node *tipc_node_find(u32 addr); 112struct tipc_node *tipc_node_find(u32 addr);
125struct tipc_node *tipc_node_create(u32 addr); 113struct tipc_node *tipc_node_create(u32 addr);
126void tipc_node_delete(struct tipc_node *n_ptr); 114void tipc_node_delete(struct tipc_node *n_ptr);