collision.c revision af69d88d 
1/*
2 * Copyright © 2012 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
33int
34main(int argc, char **argv)
35{
36   struct hash_table *ht;
37   const char *str1 = "test1";
38   const char *str2 = "test2";
39   struct hash_entry *entry1, *entry2;
40   uint32_t bad_hash = 5;
41   int i;
42
43   ht = _mesa_hash_table_create(NULL, _mesa_key_string_equal);
44
45   _mesa_hash_table_insert(ht, bad_hash, str1, NULL);
46   _mesa_hash_table_insert(ht, bad_hash, str2, NULL);
47
48   entry1 = _mesa_hash_table_search(ht, bad_hash, str1);
49   assert(entry1->key == str1);
50
51   entry2 = _mesa_hash_table_search(ht, bad_hash, str2);
52   assert(entry2->key == str2);
53
54   /* Check that we can still find #1 after inserting #2 */
55   entry1 = _mesa_hash_table_search(ht, bad_hash, str1);
56   assert(entry1->key == str1);
57
58   /* Remove the collided entry and look again. */
59   _mesa_hash_table_remove(ht, entry1);
60   entry2 = _mesa_hash_table_search(ht, bad_hash, str2);
61   assert(entry2->key == str2);
62
63   /* Put str1 back, then spam junk into the table to force a
64    * resize and make sure we can still find them both.
65    */
66   _mesa_hash_table_insert(ht, bad_hash, str1, NULL);
67   for (i = 0; i < 100; i++) {
68      char *key = malloc(10);
69      sprintf(key, "spam%d", i);
70      _mesa_hash_table_insert(ht, _mesa_hash_string(key), key, NULL);
71   }
72   entry1 = _mesa_hash_table_search(ht, bad_hash, str1);
73   assert(entry1->key == str1);
74   entry2 = _mesa_hash_table_search(ht, bad_hash, str2);
75   assert(entry2->key == str2);
76
77   _mesa_hash_table_destroy(ht, NULL);
78
79   return 0;
80}
81