You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
110 lines
3.1 KiB
110 lines
3.1 KiB
/*
|
|
* Copyright © 2009 Intel Corporation
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice (including the next
|
|
* paragraph) shall be included in all copies or substantial portions of the
|
|
* Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
* IN THE SOFTWARE.
|
|
*
|
|
* Authors:
|
|
* Eric Anholt <eric@anholt.net>
|
|
*
|
|
*/
|
|
|
|
#ifndef ravicomp_HASH_TABLE_H
|
|
#define ravicomp_HASH_TABLE_H
|
|
|
|
//#ifdef __cplusplus
|
|
//extern "C" {
|
|
//#endif
|
|
|
|
#include <inttypes.h>
|
|
|
|
typedef struct HashEntry {
|
|
uint32_t hash;
|
|
const void *key;
|
|
void *data;
|
|
} HashEntry;
|
|
|
|
typedef struct HashTable {
|
|
HashEntry *table;
|
|
uint32_t (*hash_function)(const void *key);
|
|
int (*key_equals_function)(const void *a, const void *b);
|
|
uint32_t size;
|
|
uint32_t rehash;
|
|
uint32_t max_entries;
|
|
uint32_t size_index;
|
|
uint32_t entries;
|
|
uint32_t deleted_entries;
|
|
} HashTable;
|
|
|
|
HashTable *
|
|
raviX_hash_table_create(uint32_t (*hash_function)(const void *key),
|
|
int (*key_equals_function)(const void *a,
|
|
const void *b));
|
|
void
|
|
raviX_hash_table_destroy(HashTable *ht,
|
|
void (*delete_function)(HashEntry *entry));
|
|
|
|
HashEntry *
|
|
raviX_hash_table_insert(HashTable *ht, const void *key, void *data);
|
|
|
|
HashEntry *
|
|
raviX_hash_table_search(HashTable *ht, const void *key);
|
|
|
|
void
|
|
raviX_hash_table_remove(HashTable *ht, const void *key);
|
|
|
|
void
|
|
raviX_hash_table_remove_entry(HashTable *ht, HashEntry *entry);
|
|
|
|
HashEntry *
|
|
raviX_hash_table_next_entry(HashTable *ht,
|
|
HashEntry *entry);
|
|
|
|
//HashEntry *
|
|
//hash_table_random_entry(HashTable *ht,
|
|
// int (*predicate)(HashEntry *entry));
|
|
|
|
/**
|
|
* This foreach function is safe against deletion (which just replaces
|
|
* an entry's data with the deleted marker), but not against insertion
|
|
* (which may rehash the table, making entry a dangling pointer).
|
|
*/
|
|
#define hash_table_foreach(ht, entry) \
|
|
for (entry = raviX_hash_table_next_entry(ht, NULL); \
|
|
entry != NULL; \
|
|
entry = raviX_hash_table_next_entry(ht, entry))
|
|
|
|
/* Alternate interfaces to reduce repeated calls to hash function. */
|
|
HashEntry *
|
|
raviX_hash_table_search_pre_hashed(HashTable *ht,
|
|
uint32_t hash,
|
|
const void *key);
|
|
|
|
HashEntry *
|
|
raviX_hash_table_insert_pre_hashed(HashTable *ht,
|
|
uint32_t hash,
|
|
const void *key, void *data);
|
|
|
|
|
|
//#ifdef __cplusplus
|
|
//} /* extern C */
|
|
//#endif
|
|
|
|
#endif
|