2
* Copyright © 2009-2012 Intel Corporation
4
* Permission is hereby granted, free of charge, to any person obtaining a
5
* copy of this software and associated documentation files (the "Software"),
6
* to deal in the Software without restriction, including without limitation
7
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
8
* and/or sell copies of the Software, and to permit persons to whom the
9
* Software is furnished to do so, subject to the following conditions:
11
* The above copyright notice and this permission notice (including the next
12
* paragraph) shall be included in all copies or substantial portions of the
15
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24
* Eric Anholt <eric@anholt.net>
45
struct set_entry *table;
46
uint32_t (*key_hash_function)(const void *key);
47
bool (*key_equals_function)(const void *a, const void *b);
51
uint64_t rehash_magic;
55
uint32_t deleted_entries;
59
_mesa_set_init(struct set *ht, void *mem_ctx,
60
uint32_t (*key_hash_function)(const void *key),
61
bool (*key_equals_function)(const void *a,
65
_mesa_set_create(void *mem_ctx,
66
uint32_t (*key_hash_function)(const void *key),
67
bool (*key_equals_function)(const void *a,
70
_mesa_set_create_u32_keys(void *mem_ctx);
73
_mesa_set_clone(struct set *set, void *dst_mem_ctx);
76
_mesa_set_destroy(struct set *set,
77
void (*delete_function)(struct set_entry *entry));
79
_mesa_set_resize(struct set *set, uint32_t entries);
81
_mesa_set_clear(struct set *set,
82
void (*delete_function)(struct set_entry *entry));
85
_mesa_set_add(struct set *set, const void *key);
87
_mesa_set_add_pre_hashed(struct set *set, uint32_t hash, const void *key);
90
_mesa_set_search_or_add(struct set *set, const void *key, bool *found);
92
_mesa_set_search_or_add_pre_hashed(struct set *set, uint32_t hash,
93
const void *key, bool *found);
96
_mesa_set_search(const struct set *set, const void *key);
98
_mesa_set_search_pre_hashed(const struct set *set, uint32_t hash,
102
_mesa_set_search_and_add(struct set *set, const void *key, bool *replaced);
104
_mesa_set_search_and_add_pre_hashed(struct set *set, uint32_t hash,
105
const void *key, bool *replaced);
108
_mesa_set_remove(struct set *set, struct set_entry *entry);
110
_mesa_set_remove_key(struct set *set, const void *key);
113
_mesa_set_next_entry(const struct set *set, struct set_entry *entry);
115
_mesa_set_next_entry_unsafe(const struct set *set, struct set_entry *entry);
118
_mesa_set_random_entry(struct set *set,
119
int (*predicate)(struct set_entry *entry));
122
_mesa_pointer_set_create(void *mem_ctx);
125
_mesa_set_intersects(struct set *a, struct set *b);
128
* This foreach function is safe against deletion, but not against
129
* insertion (which may rehash the set, making entry a dangling
132
#define set_foreach(set, entry) \
133
for (struct set_entry *entry = _mesa_set_next_entry(set, NULL); \
135
entry = _mesa_set_next_entry(set, entry))
138
* This foreach function destroys the table as it iterates.
139
* It is not safe to use when inserting or removing entries.
141
#define set_foreach_remove(set, entry) \
142
for (struct set_entry *entry = _mesa_set_next_entry_unsafe(set, NULL); \
144
entry->hash = 0, entry->key = (void*)NULL, (set)->entries--, entry = _mesa_set_next_entry_unsafe(set, entry))