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
33static uint32_t
34key_value(const void *key)
35{
36   return *(const uint32_t *)key;
37}
38
39static bool
40uint32_t_key_equals(const void *a, const void *b)
41{
42   return key_value(a) == key_value(b);
43}
44
45static bool
46uint32_t_key_is_even(struct hash_entry *entry)
47{
48   return (key_value(entry->key) & 1) == 0;
49}
50
51int
52main(int argc, char **argv)
53{
54   struct hash_table *ht;
55   struct hash_entry *entry;
56   unsigned size = 10000;
57   uint32_t keys[size];
58   uint32_t i, random_value;
59
60   (void) argc;
61   (void) argv;
62
63   ht = _mesa_hash_table_create(NULL, key_value, uint32_t_key_equals);
64
65   for (i = 0; i < size; i++) {
66      keys[i] = i;
67
68      _mesa_hash_table_insert(ht, keys + i, NULL);
69   }
70
71   /* Test the no-predicate case. */
72   entry = _mesa_hash_table_random_entry(ht, NULL);
73   assert(entry);
74
75   /* Check that we're getting different entries and that the predicate
76    * works.
77    */
78   for (i = 0; i < 100; i++) {
79      entry = _mesa_hash_table_random_entry(ht, uint32_t_key_is_even);
80      assert(entry);
81      assert((key_value(entry->key) & 1) == 0);
82      if (i == 0 || key_value(entry->key) != random_value)
83         break;
84      random_value = key_value(entry->key);
85   }
86   assert(i != 100);
87
88   _mesa_hash_table_destroy(ht, NULL);
89
90   return 0;
91}
92