-/*
- *
- * Written by Kern Sibbald, MMIV
- *
- * Version $Id$
- */
/*
Bacula® - The Network Backup Solution
- Copyright (C) 2004-2006 Free Software Foundation Europe e.V.
+ Copyright (C) 2004-2008 Free Software Foundation Europe e.V.
The main author of Bacula is Kern Sibbald, with contributions from
many others, a complete list can be found in the file AUTHORS.
(FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
Switzerland, email:ftf@fsfeurope.org.
*/
+/*
+ *
+ * Written by Kern Sibbald, MMIV
+ *
+ * Version $Id$
+ */
/* ========================================================================
*
*
*/
+/*
+ * BIG_MALLOC is to provide a large malloc service to htable
+ */
+#define BIG_MALLOC
+
/*
* Loop var through each member of table
*/
+#ifdef HAVE_TYPEOF
+#define foreach_htable(var, tbl) \
+ for((var)=(typeof(var))((tbl)->first()); \
+ (var); \
+ (var)=(typeof(var))((tbl)->next()))
+#else
#define foreach_htable(var, tbl) \
for((*((void **)&(var))=(void *)((tbl)->first())); \
(var); \
(*((void **)&(var))=(void *)((tbl)->next())))
+#endif
+
+
struct hlink {
void *next; /* next hash item */
uint32_t hash; /* hash for this key */
};
+struct h_mem {
+ struct h_mem *next; /* next buffer */
+ int rem; /* remaining bytes */
+ char *mem; /* memory pointer */
+ char first[1]; /* first byte */
+};
+
class htable : public SMARTALLOC {
hlink **table; /* hash table */
int loffset; /* link offset in item */
uint32_t rshift; /* amount to shift down */
hlink *walkptr; /* table walk pointer */
uint32_t walk_index; /* table walk index */
+ uint32_t total_size; /* total bytes malloced */
+ uint32_t blocks; /* blocks malloced */
+#ifdef BIG_MALLOC
+ struct h_mem *mem; /* malloced memory blocks */
+ void malloc_buf(int size); /* Get a bit buffer */
+#endif
void hash_index(char *key); /* produce hash key,index */
void grow_table(); /* grow the table */
+
public:
htable(void *item, void *link, int tsize = 31);
~htable() { destroy(); }
void destroy();
void stats(); /* print stats about the table */
uint32_t size(); /* return size of table */
+ char *hash_malloc(int size); /* malloc bytes for a hash entry */
+#ifdef BIG_MALLOC
+ void hash_free(); /* free all hash allocated bytes */
+#endif
};