moving files to /server to make merge possible

server/include/hashtable.h

@@ -0,0 +1,100 @@
+#ifndef _HASTABLE_H
+#define _HASTABLE_H
+/*
+ * This file is distributed as part of the SkySQL Gateway.  It is free
+ * software: you can redistribute it and/or modify it under the terms of the
+ * GNU General Public License as published by the Free Software Foundation,
+ * version 2.
+ *
+ * This program is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+ * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
+ * details.
+ *
+ * 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., 51
+ * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Copyright SkySQL Ab 2013
+ */
+
+/**
+ * @file hashtable.h A general purpose hashtable mechanism for use within the
+ * gateway
+ *
+ * @verbatim
+ * Revision History
+ *
+ * Date		Who		Description
+ * 23/06/13	Mark Riddoch	Initial implementation
+ * 23/07/13	Mark Riddoch	Addition of iterator mechanism
+ *
+ * @endverbatim
+ */
+#include <spinlock.h>
+#include <atomic.h>
+#include <dcb.h>
+
+/**
+ * The entries within a hashtable.
+ *
+ * A NULL value for key indicates an empty entry.
+ * The next pointer is the overflow chain for this hashentry.
+ */
+typedef struct hashentry {
+	void			*key;	/**< The value of the key or NULL if empty entry */
+	void			*value;	/**< The value associated with key */
+	struct	hashentry	*next;	/**< The overflow chain */
+} HASHENTRIES;
+
+/**
+ * HASHTABLE iterator - used to walk the hashtable in a thread safe
+ * way
+ */
+typedef struct hashiterator {
+	struct hashtable
+			*table;		/**< The hashtable the iterator refers to */
+	int		chain;		/**< The current chain we are walking */
+	int		depth;		/**< The current depth down the chain */
+} HASHITERATOR;
+
+/**
+ * The type definition for the memory allocation functions
+ */
+typedef void *(*HASHMEMORYFN)(void *);
+
+/**
+ * The general purpose hashtable struct.
+ */
+typedef struct hashtable {
+	int		hashsize;			/**< The number of HASHENTRIES */
+	HASHENTRIES	**entries;			/**< The entries themselves */
+	int		(*hashfn)(void *);		/**< The hash function */
+	int		(*cmpfn)(void *, void *);	/**< The key comparison function */
+	HASHMEMORYFN	copyfn;				/**< Optional copy function */
+	HASHMEMORYFN	freefn;				/**< Optional free function */
+	SPINLOCK	spin;				/**< Internal spinlock for the hashtable */
+	int		n_readers;			/**< Number of clients reading the table */
+	int		writelock;			/**< The table is locked by a writer */
+} HASHTABLE;
+
+extern HASHTABLE	*hashtable_alloc(int, int (*hashfn)(), int (*cmpfn)());
+				/**< Allocate a hashtable */
+extern void		hashtable_memory_fns(HASHTABLE *, HASHMEMORYFN, HASHMEMORYFN);
+				/**< Provide an interface to control key/value memory
+				 * manipulation
+				 */
+extern void		hashtable_free(HASHTABLE *);			/**< Free a hashtable */
+extern int		hashtable_add(HASHTABLE *, void *, void *);	/**< Add an entry */
+extern int		hashtable_delete(HASHTABLE *, void *);
+				/**< Delete an entry table */
+extern void		*hashtable_fetch(HASHTABLE *, void *);
+				/**< Fetch the data for a given key */
+extern void		hashtable_stats(HASHTABLE *);			/**< Print statisitics */
+extern void		dcb_hashtable_stats(DCB *, HASHTABLE *);	/**< Print statisitics */
+extern HASHITERATOR	*hashtable_iterator(HASHTABLE *);
+				/**< Allocate an iterator on the hashtable */
+extern void		*hashtable_next(HASHITERATOR *);
+				/**< Return the key of the hash table iterator */
+extern void		hashtable_iterator_free(HASHITERATOR *);
+#endif