2012-12-04 09:03:57 +00:00
|
|
|
/*
|
|
|
|
* 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;
|
2015-01-15 17:31:18 +00:00
|
|
|
uint32_t (*key_hash_function)(const void *key);
|
2012-12-04 09:03:57 +00:00
|
|
|
bool (*key_equals_function)(const void *a, const void *b);
|
|
|
|
uint32_t size;
|
|
|
|
uint32_t rehash;
|
2019-05-20 14:14:04 +01:00
|
|
|
uint64_t size_magic;
|
|
|
|
uint64_t rehash_magic;
|
2012-12-04 09:03:57 +00:00
|
|
|
uint32_t max_entries;
|
|
|
|
uint32_t size_index;
|
|
|
|
uint32_t entries;
|
|
|
|
uint32_t deleted_entries;
|
|
|
|
};
|
|
|
|
|
2021-01-07 14:39:46 +00:00
|
|
|
bool
|
|
|
|
_mesa_set_init(struct set *ht, void *mem_ctx,
|
|
|
|
uint32_t (*key_hash_function)(const void *key),
|
|
|
|
bool (*key_equals_function)(const void *a,
|
|
|
|
const void *b));
|
|
|
|
|
2012-12-04 09:03:57 +00:00
|
|
|
struct set *
|
|
|
|
_mesa_set_create(void *mem_ctx,
|
2015-01-15 17:31:18 +00:00
|
|
|
uint32_t (*key_hash_function)(const void *key),
|
2012-12-04 09:03:57 +00:00
|
|
|
bool (*key_equals_function)(const void *a,
|
|
|
|
const void *b));
|
2020-09-29 22:29:09 +01:00
|
|
|
struct set *
|
|
|
|
_mesa_set_create_u32_keys(void *mem_ctx);
|
|
|
|
|
2018-06-25 17:51:20 +01:00
|
|
|
struct set *
|
|
|
|
_mesa_set_clone(struct set *set, void *dst_mem_ctx);
|
|
|
|
|
2012-12-04 09:03:57 +00:00
|
|
|
void
|
|
|
|
_mesa_set_destroy(struct set *set,
|
|
|
|
void (*delete_function)(struct set_entry *entry));
|
2018-05-02 17:01:02 +01:00
|
|
|
void
|
2019-05-10 19:50:56 +01:00
|
|
|
_mesa_set_resize(struct set *set, uint32_t entries);
|
|
|
|
void
|
2018-05-02 17:01:02 +01:00
|
|
|
_mesa_set_clear(struct set *set,
|
|
|
|
void (*delete_function)(struct set_entry *entry));
|
2012-12-04 09:03:57 +00:00
|
|
|
|
|
|
|
struct set_entry *
|
2015-01-15 17:31:18 +00:00
|
|
|
_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);
|
2012-12-04 09:03:57 +00:00
|
|
|
|
2019-03-27 11:00:54 +00:00
|
|
|
struct set_entry *
|
2021-01-07 14:38:52 +00:00
|
|
|
_mesa_set_search_or_add(struct set *set, const void *key, bool *found);
|
2019-03-27 11:00:54 +00:00
|
|
|
struct set_entry *
|
|
|
|
_mesa_set_search_or_add_pre_hashed(struct set *set, uint32_t hash,
|
2021-01-07 14:38:52 +00:00
|
|
|
const void *key, bool *found);
|
2019-03-27 11:00:54 +00:00
|
|
|
|
2012-12-04 09:03:57 +00:00
|
|
|
struct set_entry *
|
2015-01-15 17:31:18 +00:00
|
|
|
_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);
|
2012-12-04 09:03:57 +00:00
|
|
|
|
2019-05-10 19:37:42 +01:00
|
|
|
struct set_entry *
|
|
|
|
_mesa_set_search_and_add(struct set *set, const void *key, bool *replaced);
|
|
|
|
struct set_entry *
|
|
|
|
_mesa_set_search_and_add_pre_hashed(struct set *set, uint32_t hash,
|
|
|
|
const void *key, bool *replaced);
|
|
|
|
|
2012-12-04 09:03:57 +00:00
|
|
|
void
|
|
|
|
_mesa_set_remove(struct set *set, struct set_entry *entry);
|
2018-06-25 21:42:22 +01:00
|
|
|
void
|
|
|
|
_mesa_set_remove_key(struct set *set, const void *key);
|
2012-12-04 09:03:57 +00:00
|
|
|
|
|
|
|
struct set_entry *
|
|
|
|
_mesa_set_next_entry(const struct set *set, struct set_entry *entry);
|
2021-01-12 19:49:48 +00:00
|
|
|
struct set_entry *
|
|
|
|
_mesa_set_next_entry_unsafe(const struct set *set, struct set_entry *entry);
|
2012-12-04 09:03:57 +00:00
|
|
|
|
|
|
|
struct set_entry *
|
|
|
|
_mesa_set_random_entry(struct set *set,
|
|
|
|
int (*predicate)(struct set_entry *entry));
|
|
|
|
|
2018-09-12 00:37:33 +01:00
|
|
|
struct set *
|
|
|
|
_mesa_pointer_set_create(void *mem_ctx);
|
|
|
|
|
2020-05-15 10:11:13 +01:00
|
|
|
bool
|
|
|
|
_mesa_set_intersects(struct set *a, struct set *b);
|
|
|
|
|
2012-12-04 09:03:57 +00:00
|
|
|
/**
|
|
|
|
* This foreach function is safe against deletion, but not against
|
|
|
|
* insertion (which may rehash the set, making entry a dangling
|
|
|
|
* pointer).
|
|
|
|
*/
|
2018-10-20 18:00:09 +01:00
|
|
|
#define set_foreach(set, entry) \
|
|
|
|
for (struct set_entry *entry = _mesa_set_next_entry(set, NULL); \
|
|
|
|
entry != NULL; \
|
2012-12-04 09:03:57 +00:00
|
|
|
entry = _mesa_set_next_entry(set, entry))
|
|
|
|
|
2021-01-12 19:49:48 +00:00
|
|
|
/**
|
|
|
|
* This foreach function destroys the table as it iterates.
|
|
|
|
* It is not safe to use when inserting or removing entries.
|
|
|
|
*/
|
|
|
|
#define set_foreach_remove(set, entry) \
|
|
|
|
for (struct set_entry *entry = _mesa_set_next_entry_unsafe(set, NULL); \
|
|
|
|
(set)->entries; \
|
|
|
|
entry->hash = 0, entry->key = (void*)NULL, (set)->entries--, entry = _mesa_set_next_entry_unsafe(set, entry))
|
|
|
|
|
2012-12-04 09:03:57 +00:00
|
|
|
#ifdef __cplusplus
|
|
|
|
} /* extern C */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* _SET_H */
|