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 /* Return collisions, so we can test the deletion behavior for chained
36 * objects.
37 */
38 static uint32_t
badhash(const void * key)39 badhash(const void *key)
40 {
41 (void) key;
42 return 1;
43 }
44
45 int
main(int argc,char ** argv)46 main(int argc, char **argv)
47 {
48 struct hash_table *ht;
49 const char *str1 = "test1";
50 const char *str2 = "test2";
51 struct hash_entry *entry;
52
53 (void) argc;
54 (void) argv;
55
56 ht = _mesa_hash_table_create(NULL, badhash, _mesa_key_string_equal);
57
58 _mesa_hash_table_insert(ht, str1, NULL);
59 _mesa_hash_table_insert(ht, str2, NULL);
60
61 entry = _mesa_hash_table_search(ht, str2);
62 assert(strcmp(entry->key, str2) == 0);
63
64 entry = _mesa_hash_table_search(ht, str1);
65 assert(strcmp(entry->key, str1) == 0);
66
67 _mesa_hash_table_remove(ht, entry);
68
69 entry = _mesa_hash_table_search(ht, str1);
70 assert(entry == NULL);
71
72 entry = _mesa_hash_table_search(ht, str2);
73 assert(strcmp(entry->key, str2) == 0);
74
75 _mesa_hash_table_destroy(ht, NULL);
76
77 return 0;
78 }
79