aboutsummaryrefslogtreecommitdiffstats
path: root/net/batman-adv/hash.h
diff options
context:
space:
mode:
authorSven Eckelmann <sven@narfation.org>2011-01-27 07:10:23 -0500
committerSven Eckelmann <sven@narfation.org>2011-01-31 08:57:10 -0500
commit633979b43f23d776f6fb757f0f3d6d8089ab57b1 (patch)
tree82cbc057fab78af2a0fc79c8ad0b05d169780161 /net/batman-adv/hash.h
parent74ef115359f5beb565baddfb250f264d9177c108 (diff)
batman-adv: Remove dangling declaration of hash_remove_element
Signed-off-by: Sven Eckelmann <sven@narfation.org>
Diffstat (limited to 'net/batman-adv/hash.h')
-rw-r--r--net/batman-adv/hash.h5
1 files changed, 0 insertions, 5 deletions
diff --git a/net/batman-adv/hash.h b/net/batman-adv/hash.h
index 09216ade16f1..2f508e646cb4 100644
--- a/net/batman-adv/hash.h
+++ b/net/batman-adv/hash.h
@@ -49,11 +49,6 @@ struct hashtable_t {
49/* allocates and clears the hash */ 49/* allocates and clears the hash */
50struct hashtable_t *hash_new(int size); 50struct hashtable_t *hash_new(int size);
51 51
52/* remove element if you already found the element you want to delete and don't
53 * need the overhead to find it again with hash_remove(). But usually, you
54 * don't want to use this function, as it fiddles with hash-internals. */
55void *hash_remove_element(struct hashtable_t *hash, struct element_t *elem);
56
57/* free only the hashtable and the hash itself. */ 52/* free only the hashtable and the hash itself. */
58void hash_destroy(struct hashtable_t *hash); 53void hash_destroy(struct hashtable_t *hash);
59 54