1 /*
2 * Copyright © 2009 Intel Corporation
3 *
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:
10 *
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
13 * Software.
14 *
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
21 * IN THE SOFTWARE.
22 *
23 * Authors:
24 * Eric Anholt <eric@anholt.net>
25 */
26
27 #undef NDEBUG
28
29 #include <stdlib.h>
30 #include <stdio.h>
31 #include <string.h>
32 #include <assert.h>
33 #include "hash_table.h"
34
35 #define SIZE 10000
36
37 static uint32_t
key_value(const void * key)38 key_value(const void *key)
39 {
40 return *(const uint32_t *)key;
41 }
42
43 static bool
uint32_t_key_equals(const void * a,const void * b)44 uint32_t_key_equals(const void *a, const void *b)
45 {
46 return key_value(a) == key_value(b);
47 }
48
49 int
main(int argc,char ** argv)50 main(int argc, char **argv)
51 {
52 struct hash_table *ht;
53 struct hash_entry *entry;
54 uint32_t keys[SIZE];
55 uint32_t i;
56
57 (void) argc;
58 (void) argv;
59
60 ht = _mesa_hash_table_create(NULL, key_value, uint32_t_key_equals);
61
62 for (i = 0; i < SIZE; i++) {
63 keys[i] = i;
64
65 _mesa_hash_table_insert(ht, keys + i, NULL);
66
67 if (i >= 100) {
68 uint32_t delete_value = i - 100;
69 entry = _mesa_hash_table_search(ht, &delete_value);
70 _mesa_hash_table_remove(ht, entry);
71 }
72 }
73
74 /* Make sure that all our entries were present at the end. */
75 for (i = SIZE - 100; i < SIZE; i++) {
76 entry = _mesa_hash_table_search(ht, keys + i);
77 assert(entry);
78 assert(key_value(entry->key) == i);
79 }
80
81 /* Make sure that no extra entries got in */
82 for (entry = _mesa_hash_table_next_entry(ht, NULL);
83 entry != NULL;
84 entry = _mesa_hash_table_next_entry(ht, entry)) {
85 assert(key_value(entry->key) >= SIZE - 100 &&
86 key_value(entry->key) < SIZE);
87 }
88 assert(ht->entries == 100);
89
90 _mesa_hash_table_destroy(ht, NULL);
91
92 return 0;
93 }
94