Subversion Repositories Kolibri OS

Rev

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

  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.  
  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. int
  46. main(int argc, char **argv)
  47. {
  48.    struct hash_table *ht;
  49.    struct hash_entry *entry;
  50.    int size = 10000;
  51.    uint32_t keys[size];
  52.    uint32_t i;
  53.  
  54.    ht = _mesa_hash_table_create(NULL, uint32_t_key_equals);
  55.  
  56.    for (i = 0; i < size; i++) {
  57.       keys[i] = i;
  58.  
  59.       _mesa_hash_table_insert(ht, i, keys + i, NULL);
  60.  
  61.       if (i >= 100) {
  62.          uint32_t delete_value = i - 100;
  63.          entry = _mesa_hash_table_search(ht, delete_value,
  64.                                               &delete_value);
  65.          _mesa_hash_table_remove(ht, entry);
  66.       }
  67.    }
  68.  
  69.    /* Make sure that all our entries were present at the end. */
  70.    for (i = size - 100; i < size; i++) {
  71.       entry = _mesa_hash_table_search(ht, i, keys + i);
  72.       assert(entry);
  73.       assert(key_value(entry->key) == i);
  74.    }
  75.  
  76.    /* Make sure that no extra entries got in */
  77.    for (entry = _mesa_hash_table_next_entry(ht, NULL);
  78.         entry != NULL;
  79.         entry = _mesa_hash_table_next_entry(ht, entry)) {
  80.       assert(key_value(entry->key) >= size - 100 &&
  81.              key_value(entry->key) < size);
  82.    }
  83.    assert(ht->entries == 100);
  84.  
  85.    _mesa_hash_table_destroy(ht, NULL);
  86.  
  87.    return 0;
  88. }
  89.