mirror of
https://gitlab.freedesktop.org/mesa/mesa.git
synced 2026-01-07 21:40:20 +01:00
153b8b3525
Previously, the set API required the user to do all of the hashing of keys
as it passed them in. Since the hashing function is intrinsically tied to
the comparison function, it makes sense for the hash set to know about
it. Also, it makes for a somewhat clumsy API as the user is constantly
calling hashing functions many of which have long names. This is
especially bad when the standard call looks something like
_mesa_set_add(ht, _mesa_pointer_hash(key), key);
In the above case, there is no reason why the hash set shouldn't do the
hashing for you. We leave the option for you to do your own hashing if
it's more efficient, but it's no longer needed. Also, if you do do your
own hashing, the hash set will assert that your hash matches what it
expects out of the hashing function. This should make it harder to mess up
your hashing.
This is analygous to 94303a0750 where we did this for hash_table
Signed-off-by: Jason Ekstrand <jason.ekstrand@intel.com>
Reviewed-by: Matt Turner <mattst88@gmail.com>
Reviewed-by: Eric Anholt <eric@anholt.net>
100 lines
3.1 KiB
C
100 lines
3.1 KiB
C
/*
|
|
* Copyright © 2009-2012 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 _SET_H
|
|
#define _SET_H
|
|
|
|
#include <inttypes.h>
|
|
#include <stdbool.h>
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
struct set_entry {
|
|
uint32_t hash;
|
|
const void *key;
|
|
};
|
|
|
|
struct set {
|
|
void *mem_ctx;
|
|
struct set_entry *table;
|
|
uint32_t (*key_hash_function)(const void *key);
|
|
bool (*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;
|
|
};
|
|
|
|
struct set *
|
|
_mesa_set_create(void *mem_ctx,
|
|
uint32_t (*key_hash_function)(const void *key),
|
|
bool (*key_equals_function)(const void *a,
|
|
const void *b));
|
|
void
|
|
_mesa_set_destroy(struct set *set,
|
|
void (*delete_function)(struct set_entry *entry));
|
|
|
|
struct set_entry *
|
|
_mesa_set_add(struct set *set, const void *key);
|
|
struct set_entry *
|
|
_mesa_set_add_pre_hashed(struct set *set, uint32_t hash, const void *key);
|
|
|
|
struct set_entry *
|
|
_mesa_set_search(const struct set *set, const void *key);
|
|
struct set_entry *
|
|
_mesa_set_search_pre_hashed(const struct set *set, uint32_t hash,
|
|
const void *key);
|
|
|
|
void
|
|
_mesa_set_remove(struct set *set, struct set_entry *entry);
|
|
|
|
struct set_entry *
|
|
_mesa_set_next_entry(const struct set *set, struct set_entry *entry);
|
|
|
|
struct set_entry *
|
|
_mesa_set_random_entry(struct set *set,
|
|
int (*predicate)(struct set_entry *entry));
|
|
|
|
/**
|
|
* This foreach function is safe against deletion, but not against
|
|
* insertion (which may rehash the set, making entry a dangling
|
|
* pointer).
|
|
*/
|
|
#define set_foreach(set, entry) \
|
|
for (entry = _mesa_set_next_entry(set, NULL); \
|
|
entry != NULL; \
|
|
entry = _mesa_set_next_entry(set, entry))
|
|
|
|
#ifdef __cplusplus
|
|
} /* extern C */
|
|
#endif
|
|
|
|
#endif /* _SET_H */
|