lvm2/lib/datastruct/hash.h

/*
 * Copyright (C) 2001 Sistina Software
 *
 * This file is released under the GPL.
 */

#ifndef _LVM_HASH_H
#define _LVM_HASH_H

struct hash_table;
struct hash_node;

typedef void (*iterate_fn)(void *data);

struct hash_table *hash_create(unsigned size_hint);
void hash_destroy(struct hash_table *t);
void hash_wipe(struct hash_table *t);

void *hash_lookup(struct hash_table *t, const char *key);
int hash_insert(struct hash_table *t, const char *key, void *data);
void hash_remove(struct hash_table *t, const char *key);

unsigned hash_get_num_entries(struct hash_table *t);
void hash_iterate(struct hash_table *t, iterate_fn f);

char *hash_get_key(struct hash_table *t, struct hash_node *n);
void *hash_get_data(struct hash_table *t, struct hash_node *n);
struct hash_node *hash_get_first(struct hash_table *t);
struct hash_node *hash_get_next(struct hash_table *t, struct hash_node *n);

#endif
o generic hash table to store void *'s, not efficient, but adequate for LVM. 2001-09-28 17:08:44 +04:00			`/*`
			`* Copyright (C) 2001 Sistina Software`
			`*`
			`* This file is released under the GPL.`
			`*/`

Tidy include files 2001-10-01 19:14:39 +04:00			`#ifndef _LVM_HASH_H`
			`#define _LVM_HASH_H`
o generic hash table to store void *'s, not efficient, but adequate for LVM. 2001-09-28 17:08:44 +04:00
			`struct hash_table;`
o code sync for dev-cache.c o made copyright headers the same o added __attribute ((format ... to print_log so we'll get better compile errors o added iterator to the hash table 2001-10-03 15:06:31 +04:00			`struct hash_node;`

o generic hash table to store void *'s, not efficient, but adequate for LVM. 2001-09-28 17:08:44 +04:00			`typedef void (iterate_fn)(void data);`

o code sync for dev-cache.c o made copyright headers the same o added __attribute ((format ... to print_log so we'll get better compile errors o added iterator to the hash table 2001-10-03 15:06:31 +04:00			`struct hash_table *hash_create(unsigned size_hint);`
			`void hash_destroy(struct hash_table *t);`
persistent cache fully incorporated. Goodbye to scanning /dev/cdrom :-) 2001-10-24 21:53:50 +04:00			`void hash_wipe(struct hash_table *t);`
o generic hash table to store void *'s, not efficient, but adequate for LVM. 2001-09-28 17:08:44 +04:00
o Filter which caches valid devices in a file. Pass in init == 1 to the constructor if you want it to ignore the existing cache and check every device again (eg, vgscan, pvscan). 2001-10-22 18:14:00 +04:00			`void hash_lookup(struct hash_table t, const char *key);`
o got dbg_malloc_t working, Alasdair could you look at the Makefile.in it seems to be having trouble with the dependencies. o removed some files from the lib makefile that don't compile yet. 2001-10-04 14:13:07 +04:00			`int hash_insert(struct hash_table t, const char key, void *data);`
o generic hash table to store void *'s, not efficient, but adequate for LVM. 2001-09-28 17:08:44 +04:00			`void hash_remove(struct hash_table t, const char key);`

			`unsigned hash_get_num_entries(struct hash_table *t);`
			`void hash_iterate(struct hash_table *t, iterate_fn f);`

o Filter which caches valid devices in a file. Pass in init == 1 to the constructor if you want it to ignore the existing cache and check every device again (eg, vgscan, pvscan). 2001-10-22 18:14:00 +04:00			`char hash_get_key(struct hash_table t, struct hash_node *n);`
o code sync for dev-cache.c o made copyright headers the same o added __attribute ((format ... to print_log so we'll get better compile errors o added iterator to the hash table 2001-10-03 15:06:31 +04:00			`void hash_get_data(struct hash_table t, struct hash_node *n);`
			`struct hash_node hash_get_first(struct hash_table t);`
			`struct hash_node hash_get_next(struct hash_table t, struct hash_node *n);`

o generic hash table to store void *'s, not efficient, but adequate for LVM. 2001-09-28 17:08:44 +04:00			`#endif`