2 * Copyright © 2009 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>
31 #include "hash_table.h"
33 /* Return collisions, so we can test the deletion behavior for chained
37 badhash(const void *key
)
43 main(int argc
, char **argv
)
45 struct hash_table
*ht
;
46 const char *str1
= "test1";
47 const char *str2
= "test2";
48 struct hash_entry
*entry
;
50 ht
= _mesa_hash_table_create(NULL
, badhash
, _mesa_key_string_equal
);
52 _mesa_hash_table_insert(ht
, str1
, NULL
);
53 _mesa_hash_table_insert(ht
, str2
, NULL
);
55 entry
= _mesa_hash_table_search(ht
, str2
);
56 assert(strcmp(entry
->key
, str2
) == 0);
58 entry
= _mesa_hash_table_search(ht
, str1
);
59 assert(strcmp(entry
->key
, str1
) == 0);
61 _mesa_hash_table_remove(ht
, entry
);
63 entry
= _mesa_hash_table_search(ht
, str1
);
64 assert(entry
== NULL
);
66 entry
= _mesa_hash_table_search(ht
, str2
);
67 assert(strcmp(entry
->key
, str2
) == 0);
69 _mesa_hash_table_destroy(ht
, NULL
);