shaba/lvm2
1
0
Fork 0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-22 17:35:59 +03:00
Code Releases Activity
66278a80b1
lvm2/lib/datastruct/hash.h

50 lines
1.7 KiB
C
Raw Normal View History

o generic hash table to store void *'s, not efficient, but adequate for LVM.
2001-09-28 17:08:44 +04:00
/*
Update copyright notices.
2004-03-30 23:35:44 +04:00
* Copyright (C) 2001-2004 Sistina Software, Inc. All rights reserved.
* Copyright (C) 2004 Red Hat, Inc. All rights reserved.
o generic hash table to store void *'s, not efficient, but adequate for LVM.
2001-09-28 17:08:44 +04:00
*
Update copyright notices.
2004-03-30 23:35:44 +04:00
* This file is part of LVM2.
*
* This copyrighted material is made available to anyone wishing to use,
* modify, copy, or redistribute it subject to the terms and conditions
* of the GNU General Public License v.2.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
o generic hash table to store void *'s, not efficient, but adequate for LVM.
2001-09-28 17:08:44 +04:00
*/
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;
Default stripesize 64k & config file setting for it; Clear many compiler warnings (i386) & associated bugs - hopefully without introducing too many new bugs:-) (Same exercise required for other archs.) Default compilation has optimisation - or else use ./configure --enable-debug
2002-12-20 02:25:55 +03:00
typedef void (*iterate_fn) (void *data);
o generic hash table to store void *'s, not efficient, but adequate for LVM.
2001-09-28 17:08:44 +04:00
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);
Extend hash functions to handle non-null-terminated data.
2004-06-18 19:08:22 +04:00
void *hash_lookup_binary(struct hash_table *t, const char *key, uint32_t len);
int hash_insert_binary(struct hash_table *t, const char *key, uint32_t len,
void *data);
void hash_remove_binary(struct hash_table *t, const char *key, uint32_t len);
o generic hash table to store void *'s, not efficient, but adequate for LVM.
2001-09-28 17:08:44 +04:00
unsigned hash_get_num_entries(struct hash_table *t);
o Added a macro called hash_iterate, that is similar to list_iterate o Renamed hash_iterate function, hash_iter.
2002-02-25 14:52:58 +03:00
void hash_iter(struct hash_table *t, iterate_fn f);
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
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 Added a macro called hash_iterate, that is similar to list_iterate o Renamed hash_iterate function, hash_iter.
2002-02-25 14:52:58 +03:00
#define hash_iterate(v, h) \
for (v = hash_get_first(h); v; \
v = hash_get_next(h, v))
o generic hash table to store void *'s, not efficient, but adequate for LVM.
2001-09-28 17:08:44 +04:00
#endif
Copy Permalink