shaba/lvm2
1
0
Fork 0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-21 13:34:40 +03:00
Code Releases Activity

o Merged common code between hash_destroy and hash_wipe.

Browse Source
This commit is contained in:
Joe Thornber 2001-10-25 08:31:43 +00:00
parent d2393d23ee
commit e1e529fae1
1 changed files with 8 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
lib/datastruct/hash.c
View File

@ -100,7 +100,7 @@ struct hash_table *hash_create(unsigned size_hint)
return 0; return 0;
} }
void hash_destroy(struct hash_table *t) static void _free_nodes(struct hash_table *t)
{ {
struct hash_node *c, *n; struct hash_node *c, *n;
int i; int i;
@ -110,7 +110,11 @@ void hash_destroy(struct hash_table *t)
n = c->next; n = c->next;
dbg_free(c); dbg_free(c);
} }
}
void hash_destroy(struct hash_table *t)
{
_free_nodes(t);
dbg_free(t->slots); dbg_free(t->slots);
dbg_free(t); dbg_free(t);
} }
@ -183,18 +187,9 @@ void hash_iterate(struct hash_table *t, iterate_fn f)
void hash_wipe(struct hash_table *t) void hash_wipe(struct hash_table *t)
{ {
struct hash_node **c, *old; _free_nodes(t);
int i; memset(t->slots, 0, sizeof(struct hash_node *) * t->num_slots);
t->num_nodes = 0;
for (i = 0; i < t->num_slots; i++) {
c = &t->slots[i];
while (*c) {
old = *c;
*c = (*c)->next;
dbg_free(old);
t->num_nodes--;
}
}
} }
char *hash_get_key(struct hash_table *t, struct hash_node *n) char *hash_get_key(struct hash_table *t, struct hash_node *n)