2 * Copyright © 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>
33 #include "hash_table.h"
36 main(int argc
, char **argv
)
38 struct hash_table
*ht
;
39 const char *str1
= "test1";
40 const char *str2
= "test2";
41 const char *str3
= "test3";
42 struct hash_entry
*entry1
, *entry2
;
43 uint32_t bad_hash
= 5;
49 ht
= _mesa_hash_table_create(NULL
, NULL
, _mesa_key_string_equal
);
51 /* Insert some items. Inserting 3 items forces a rehash and the new
52 * table size is big enough that we don't get rehashes later.
54 _mesa_hash_table_insert_pre_hashed(ht
, bad_hash
, str1
, NULL
);
55 _mesa_hash_table_insert_pre_hashed(ht
, bad_hash
, str2
, NULL
);
56 _mesa_hash_table_insert_pre_hashed(ht
, bad_hash
, str3
, NULL
);
58 entry1
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str1
);
59 assert(entry1
->key
== str1
);
61 entry2
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str2
);
62 assert(entry2
->key
== str2
);
64 /* Check that we can still find #1 after inserting #2 */
65 entry1
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str1
);
66 assert(entry1
->key
== str1
);
68 /* Remove the collided entry and look again. */
69 _mesa_hash_table_remove(ht
, entry1
);
70 entry2
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str2
);
71 assert(entry2
->key
== str2
);
73 /* Try inserting #2 again and make sure it gets overwritten */
74 _mesa_hash_table_insert_pre_hashed(ht
, bad_hash
, str2
, NULL
);
75 entry2
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str2
);
76 hash_table_foreach(ht
, search_entry
) {
77 assert(search_entry
== entry2
|| search_entry
->key
!= str2
);
80 /* Put str1 back, then spam junk into the table to force a
81 * resize and make sure we can still find them both.
83 _mesa_hash_table_insert_pre_hashed(ht
, bad_hash
, str1
, NULL
);
84 for (i
= 0; i
< 100; i
++) {
85 char *key
= malloc(10);
86 sprintf(key
, "spam%d", i
);
87 _mesa_hash_table_insert_pre_hashed(ht
, _mesa_hash_string(key
), key
, NULL
);
89 entry1
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str1
);
90 assert(entry1
->key
== str1
);
91 entry2
= _mesa_hash_table_search_pre_hashed(ht
, bad_hash
, str2
);
92 assert(entry2
->key
== str2
);
94 _mesa_hash_table_destroy(ht
, NULL
);