1 /* 2 * Copyright (C) 2016 Advanced Micro Devices, Inc. 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 NON-INFRINGEMENT. IN NO EVENT SHALL 18 * THE AUTHOR(S) AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM, 19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR 20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE 21 * USE OR OTHER DEALINGS IN THE SOFTWARE. 22 */ 23 24 #include "hash_table.h" 25 26 static void *make_key(uint32_t i) 27 { 28 return (void *)(uintptr_t)(1 + i); 29 } 30 31 static uint32_t key_id(const void *key) 32 { 33 return (uintptr_t)key - 1; 34 } 35 36 static uint32_t key_hash(const void *key) 37 { 38 return (uintptr_t)key; 39 } 40 41 static bool key_equal(const void *a, const void *b) 42 { 43 return a == b; 44 } 45 46 static void delete_function(struct hash_entry *entry) 47 { 48 bool *deleted = (bool *)entry->data; 49 assert(!*deleted); 50 *deleted = true; 51 } 52 53 int main() 54 { 55 struct hash_table *ht; 56 struct hash_entry *entry; 57 const uint32_t size = 1000; 58 bool flags[size]; 59 uint32_t i; 60 61 ht = _mesa_hash_table_create(NULL, key_hash, key_equal); 62 63 for (i = 0; i < size; ++i) { 64 flags[i] = false; 65 _mesa_hash_table_insert(ht, make_key(i), &flags[i]); 66 } 67 68 _mesa_hash_table_clear(ht, delete_function); 69 assert(_mesa_hash_table_next_entry(ht, NULL) == NULL); 70 71 /* Check that delete_function was called and that repopulating the table 72 * works. */ 73 for (i = 0; i < size; ++i) { 74 assert(flags[i]); 75 flags[i] = false; 76 _mesa_hash_table_insert(ht, make_key(i), &flags[i]); 77 } 78 79 /* Check that exactly the right set of entries is in the table. */ 80 for (i = 0; i < size; ++i) { 81 assert(_mesa_hash_table_search(ht, make_key(i))); 82 } 83 84 hash_table_foreach(ht, entry) { 85 assert(key_id(entry->key) < size); 86 } 87 88 _mesa_hash_table_destroy(ht, NULL); 89 90 return 0; 91 } 92
