Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Details | Last modification | View Log | RSS feed

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