diff options
Diffstat (limited to 'src/ipcpd/unicast/pol/hashtable.h')
| -rw-r--r-- | src/ipcpd/unicast/pol/hashtable.h | 55 |
1 files changed, 55 insertions, 0 deletions
diff --git a/src/ipcpd/unicast/pol/hashtable.h b/src/ipcpd/unicast/pol/hashtable.h new file mode 100644 index 00000000..b6a36180 --- /dev/null +++ b/src/ipcpd/unicast/pol/hashtable.h @@ -0,0 +1,55 @@ +/* + * Ouroboros - Copyright (C) 2016 - 2020 + * +* Hash table with integer keys with separate chaining on collisions + * + * Dimitri Staessens <dimitri.staessens@ugent.be> + * Sander Vrijders <sander.vrijders@ugent.be> + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 as + * published by the Free Software Foundation. + * + * 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., http://www.fsf.org/about/contact/. + */ + +#ifndef OUROBOROS_HASHTABLE_H +#define OUROBOROS_HASHTABLE_H + +#include <stdint.h> +#include <stdbool.h> +#include <stdlib.h> + +struct htable; + +/* Buckets is rounded up to the nearest power of 2 */ +struct htable * htable_create(uint64_t buckets, + bool hash_key); + +void htable_destroy(struct htable * table); + +void htable_flush(struct htable * table); + +/* Passes ownership of the block of memory */ +int htable_insert(struct htable * table, + uint64_t key, + void * val, + size_t len); + +/* The block of memory returned is no copy */ +int htable_lookup(struct htable * table, + uint64_t key, + void ** val, + size_t * len); + +int htable_delete(struct htable * table, + uint64_t key); + +#endif /* OUROBOROS_HASHTABLE_H */ |