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