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. /* Return collisions, so we can test the deletion behavior for chained
  34.  * objects.
  35.  */
  36. static uint32_t
  37. badhash(const void *key)
  38. {
  39.         return 1;
  40. }
  41.  
  42. int
  43. main(int argc, char **argv)
  44. {
  45.         struct hash_table *ht;
  46.         const char *str1 = "test1";
  47.         const char *str2 = "test2";
  48.         uint32_t hash_str1 = badhash(str1);
  49.         uint32_t hash_str2 = badhash(str2);
  50.         struct hash_entry *entry;
  51.  
  52.         ht = _mesa_hash_table_create(NULL, _mesa_key_string_equal);
  53.  
  54.         _mesa_hash_table_insert(ht, hash_str1, str1, NULL);
  55.         _mesa_hash_table_insert(ht, hash_str2, str2, NULL);
  56.  
  57.         entry = _mesa_hash_table_search(ht, hash_str2, str2);
  58.         assert(strcmp(entry->key, str2) == 0);
  59.  
  60.         entry = _mesa_hash_table_search(ht, hash_str1, str1);
  61.         assert(strcmp(entry->key, str1) == 0);
  62.  
  63.         _mesa_hash_table_remove(ht, entry);
  64.  
  65.         entry = _mesa_hash_table_search(ht, hash_str1, str1);
  66.         assert(entry == NULL);
  67.  
  68.         entry = _mesa_hash_table_search(ht, hash_str2, str2);
  69.         assert(strcmp(entry->key, str2) == 0);
  70.  
  71.         _mesa_hash_table_destroy(ht, NULL);
  72.  
  73.         return 0;
  74. }
  75.