D-Bus  1.6.12
dbus-hash.c
1 /* -*- mode: C; c-file-style: "gnu"; indent-tabs-mode: nil; -*- */
2 /* dbus-hash.c Generic hash table utility (internal to D-Bus implementation)
3  *
4  * Copyright (C) 2002 Red Hat, Inc.
5  * Copyright (c) 1991-1993 The Regents of the University of California.
6  * Copyright (c) 1994 Sun Microsystems, Inc.
7  *
8  * Hash table implementation based on generic/tclHash.c from the Tcl
9  * source code. The original Tcl license applies to portions of the
10  * code from tclHash.c; the Tcl license follows this standad D-Bus
11  * license information.
12  *
13  * Licensed under the Academic Free License version 2.1
14  *
15  * This program is free software; you can redistribute it and/or modify
16  * it under the terms of the GNU General Public License as published by
17  * the Free Software Foundation; either version 2 of the License, or
18  * (at your option) any later version.
19  *
20  * This program is distributed in the hope that it will be useful,
21  * but WITHOUT ANY WARRANTY; without even the implied warranty of
22  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23  * GNU General Public License for more details.
24  *
25  * You should have received a copy of the GNU General Public License
26  * along with this program; if not, write to the Free Software
27  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
28  *
29  */
30 /*
31  * The following copyright applies to code from the Tcl distribution.
32  *
33  * Copyright (c) 1991-1993 The Regents of the University of California.
34  * Copyright (c) 1994 Sun Microsystems, Inc.
35  *
36  * This software is copyrighted by the Regents of the University of
37  * California, Sun Microsystems, Inc., Scriptics Corporation, and
38  * other parties. The following terms apply to all files associated
39  * with the software unless explicitly disclaimed in individual files.
40  *
41  * The authors hereby grant permission to use, copy, modify,
42  * distribute, and license this software and its documentation for any
43  * purpose, provided that existing copyright notices are retained in
44  * all copies and that this notice is included verbatim in any
45  * distributions. No written agreement, license, or royalty fee is
46  * required for any of the authorized uses. Modifications to this
47  * software may be copyrighted by their authors and need not follow
48  * the licensing terms described here, provided that the new terms are
49  * clearly indicated on the first page of each file where they apply.
50  *
51  * IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY
52  * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL
53  * DAMAGES ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION,
54  * OR ANY DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED
55  * OF THE POSSIBILITY OF SUCH DAMAGE.
56  *
57  * THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
58  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
59  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
60  * NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS,
61  * AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE
62  * MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
63  *
64  * GOVERNMENT USE: If you are acquiring this software on behalf of the
65  * U.S. government, the Government shall have only "Restricted Rights"
66  * in the software and related documentation as defined in the Federal
67  * Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you
68  * are acquiring the software on behalf of the Department of Defense,
69  * the software shall be classified as "Commercial Computer Software"
70  * and the Government shall have only "Restricted Rights" as defined
71  * in Clause 252.227-7013 (c) (1) of DFARs. Notwithstanding the
72  * foregoing, the authors grant the U.S. Government and others acting
73  * in its behalf permission to use and distribute the software in
74  * accordance with the terms specified in this license.
75  */
76 
77 #include <config.h>
78 #include "dbus-hash.h"
79 #include "dbus-internals.h"
80 #include "dbus-mempool.h"
81 
104 #define REBUILD_MULTIPLIER 3
105 
122 #define RANDOM_INDEX(table, i) \
123  (((((intptr_t) (i))*1103515245) >> (table)->down_shift) & (table)->mask)
124 
130 #define DBUS_SMALL_HASH_TABLE 4
131 
136 
144 {
149  void *key;
150  void *value;
151 };
152 
156 typedef DBusHashEntry* (* DBusFindEntryFunction) (DBusHashTable *table,
157  void *key,
158  dbus_bool_t create_if_not_found,
159  DBusHashEntry ***bucket,
160  DBusPreallocatedHash *preallocated);
161 
169  int refcount;
179  int n_buckets;
182  int n_entries;
195  int mask;
207 };
208 
212 typedef struct
213 {
224 
225 _DBUS_STATIC_ASSERT (sizeof (DBusRealHashIter) == sizeof (DBusHashIter));
226 
227 static DBusHashEntry* find_direct_function (DBusHashTable *table,
228  void *key,
229  dbus_bool_t create_if_not_found,
230  DBusHashEntry ***bucket,
231  DBusPreallocatedHash *preallocated);
232 static DBusHashEntry* find_string_function (DBusHashTable *table,
233  void *key,
234  dbus_bool_t create_if_not_found,
235  DBusHashEntry ***bucket,
236  DBusPreallocatedHash *preallocated);
237 static unsigned int string_hash (const char *str);
238 static void rebuild_table (DBusHashTable *table);
239 static DBusHashEntry* alloc_entry (DBusHashTable *table);
240 static void remove_entry (DBusHashTable *table,
241  DBusHashEntry **bucket,
242  DBusHashEntry *entry);
243 static void free_entry (DBusHashTable *table,
244  DBusHashEntry *entry);
245 static void free_entry_data (DBusHashTable *table,
246  DBusHashEntry *entry);
247 
248 
286  DBusFreeFunction key_free_function,
287  DBusFreeFunction value_free_function)
288 {
289  DBusHashTable *table;
290  DBusMemPool *entry_pool;
291 
292  table = dbus_new0 (DBusHashTable, 1);
293  if (table == NULL)
294  return NULL;
295 
296  entry_pool = _dbus_mem_pool_new (sizeof (DBusHashEntry), TRUE);
297  if (entry_pool == NULL)
298  {
299  dbus_free (table);
300  return NULL;
301  }
302 
303  table->refcount = 1;
304  table->entry_pool = entry_pool;
305 
307 
308  table->buckets = table->static_buckets;
310  table->n_entries = 0;
312  table->lo_rebuild_size = 0;
313  table->down_shift = 28;
314  table->mask = 3;
315  table->key_type = type;
316 
317  _dbus_assert (table->mask < table->n_buckets);
318 
319  switch (table->key_type)
320  {
321  case DBUS_HASH_INT:
322  case DBUS_HASH_UINTPTR:
323  table->find_function = find_direct_function;
324  break;
325  case DBUS_HASH_STRING:
326  table->find_function = find_string_function;
327  break;
328  default:
329  _dbus_assert_not_reached ("Unknown hash table type");
330  break;
331  }
332 
333  table->free_key_function = key_free_function;
334  table->free_value_function = value_free_function;
335 
336  return table;
337 }
338 
339 
348 {
349  table->refcount += 1;
350 
351  return table;
352 }
353 
360 void
362 {
363  table->refcount -= 1;
364 
365  if (table->refcount == 0)
366  {
367 #if 0
368  DBusHashEntry *entry;
369  DBusHashEntry *next;
370  int i;
371 
372  /* Free the entries in the table. */
373  for (i = 0; i < table->n_buckets; i++)
374  {
375  entry = table->buckets[i];
376  while (entry != NULL)
377  {
378  next = entry->next;
379 
380  free_entry (table, entry);
381 
382  entry = next;
383  }
384  }
385 #else
386  DBusHashEntry *entry;
387  int i;
388 
389  /* Free the entries in the table. */
390  for (i = 0; i < table->n_buckets; i++)
391  {
392  entry = table->buckets[i];
393  while (entry != NULL)
394  {
395  free_entry_data (table, entry);
396 
397  entry = entry->next;
398  }
399  }
400  /* We can do this very quickly with memory pools ;-) */
402 #endif
403 
404  /* Free the bucket array, if it was dynamically allocated. */
405  if (table->buckets != table->static_buckets)
406  dbus_free (table->buckets);
407 
408  dbus_free (table);
409  }
410 }
411 
417 void
419 {
420  DBusHashIter iter;
421  _dbus_hash_iter_init (table, &iter);
422  while (_dbus_hash_iter_next (&iter))
423  {
425  }
426 }
427 
428 static DBusHashEntry*
429 alloc_entry (DBusHashTable *table)
430 {
431  DBusHashEntry *entry;
432 
433  entry = _dbus_mem_pool_alloc (table->entry_pool);
434 
435  return entry;
436 }
437 
438 static void
439 free_entry_data (DBusHashTable *table,
440  DBusHashEntry *entry)
441 {
442  if (table->free_key_function)
443  (* table->free_key_function) (entry->key);
444  if (table->free_value_function)
445  (* table->free_value_function) (entry->value);
446 }
447 
448 static void
449 free_entry (DBusHashTable *table,
450  DBusHashEntry *entry)
451 {
452  free_entry_data (table, entry);
453  _dbus_mem_pool_dealloc (table->entry_pool, entry);
454 }
455 
456 static void
457 remove_entry (DBusHashTable *table,
458  DBusHashEntry **bucket,
459  DBusHashEntry *entry)
460 {
461  _dbus_assert (table != NULL);
462  _dbus_assert (bucket != NULL);
463  _dbus_assert (*bucket != NULL);
464  _dbus_assert (entry != NULL);
465 
466  if (*bucket == entry)
467  *bucket = entry->next;
468  else
469  {
470  DBusHashEntry *prev;
471  prev = *bucket;
472 
473  while (prev->next != entry)
474  prev = prev->next;
475 
476  _dbus_assert (prev != NULL);
477 
478  prev->next = entry->next;
479  }
480 
481  table->n_entries -= 1;
482  free_entry (table, entry);
483 }
484 
516 void
518  DBusHashIter *iter)
519 {
520  DBusRealHashIter *real;
521 
522  _dbus_assert (sizeof (DBusHashIter) == sizeof (DBusRealHashIter));
523 
524  real = (DBusRealHashIter*) iter;
525 
526  real->table = table;
527  real->bucket = NULL;
528  real->entry = NULL;
529  real->next_entry = NULL;
530  real->next_bucket = 0;
531  real->n_entries_on_init = table->n_entries;
532 }
533 
544 {
545  DBusRealHashIter *real;
546 
547  _dbus_assert (sizeof (DBusHashIter) == sizeof (DBusRealHashIter));
548 
549  real = (DBusRealHashIter*) iter;
550 
551  /* if this assertion failed someone probably added hash entries
552  * during iteration, which is bad.
553  */
554  _dbus_assert (real->n_entries_on_init >= real->table->n_entries);
555 
556  /* Remember that real->entry may have been deleted */
557 
558  while (real->next_entry == NULL)
559  {
560  if (real->next_bucket >= real->table->n_buckets)
561  {
562  /* invalidate iter and return false */
563  real->entry = NULL;
564  real->table = NULL;
565  real->bucket = NULL;
566  return FALSE;
567  }
568 
569  real->bucket = &(real->table->buckets[real->next_bucket]);
570  real->next_entry = *(real->bucket);
571  real->next_bucket += 1;
572  }
573 
574  _dbus_assert (real->next_entry != NULL);
575  _dbus_assert (real->bucket != NULL);
576 
577  real->entry = real->next_entry;
578  real->next_entry = real->entry->next;
579 
580  return TRUE;
581 }
582 
591 void
593 {
594  DBusRealHashIter *real;
595 
596  real = (DBusRealHashIter*) iter;
597 
598  _dbus_assert (real->table != NULL);
599  _dbus_assert (real->entry != NULL);
600  _dbus_assert (real->bucket != NULL);
601 
602  remove_entry (real->table, real->bucket, real->entry);
603 
604  real->entry = NULL; /* make it crash if you try to use this entry */
605 }
606 
612 void*
614 {
615  DBusRealHashIter *real;
616 
617  real = (DBusRealHashIter*) iter;
618 
619  _dbus_assert (real->table != NULL);
620  _dbus_assert (real->entry != NULL);
621 
622  return real->entry->value;
623 }
624 
635 void
637  void *value)
638 {
639  DBusRealHashIter *real;
640 
641  real = (DBusRealHashIter*) iter;
642 
643  _dbus_assert (real->table != NULL);
644  _dbus_assert (real->entry != NULL);
645 
646  if (real->table->free_value_function && value != real->entry->value)
647  (* real->table->free_value_function) (real->entry->value);
648 
649  real->entry->value = value;
650 }
651 
658 int
660 {
661  DBusRealHashIter *real;
662 
663  real = (DBusRealHashIter*) iter;
664 
665  _dbus_assert (real->table != NULL);
666  _dbus_assert (real->entry != NULL);
667 
668  return _DBUS_POINTER_TO_INT (real->entry->key);
669 }
670 
677 uintptr_t
679 {
680  DBusRealHashIter *real;
681 
682  real = (DBusRealHashIter*) iter;
683 
684  _dbus_assert (real->table != NULL);
685  _dbus_assert (real->entry != NULL);
686 
687  return (uintptr_t) real->entry->key;
688 }
689 
695 const char*
697 {
698  DBusRealHashIter *real;
699 
700  real = (DBusRealHashIter*) iter;
701 
702  _dbus_assert (real->table != NULL);
703  _dbus_assert (real->entry != NULL);
704 
705  return real->entry->key;
706 }
707 
741  void *key,
742  dbus_bool_t create_if_not_found,
743  DBusHashIter *iter)
744 {
745  DBusRealHashIter *real;
746  DBusHashEntry *entry;
747  DBusHashEntry **bucket;
748 
749  _dbus_assert (sizeof (DBusHashIter) == sizeof (DBusRealHashIter));
750 
751  real = (DBusRealHashIter*) iter;
752 
753  entry = (* table->find_function) (table, key, create_if_not_found, &bucket, NULL);
754 
755  if (entry == NULL)
756  return FALSE;
757 
758  real->table = table;
759  real->bucket = bucket;
760  real->entry = entry;
761  real->next_entry = entry->next;
762  real->next_bucket = (bucket - table->buckets) + 1;
763  real->n_entries_on_init = table->n_entries;
764 
765  _dbus_assert (&(table->buckets[real->next_bucket-1]) == real->bucket);
766 
767  return TRUE;
768 }
769 
770 static void
771 add_allocated_entry (DBusHashTable *table,
772  DBusHashEntry *entry,
773  unsigned int idx,
774  void *key,
775  DBusHashEntry ***bucket)
776 {
777  DBusHashEntry **b;
778 
779  entry->key = key;
780 
781  b = &(table->buckets[idx]);
782  entry->next = *b;
783  *b = entry;
784 
785  if (bucket)
786  *bucket = b;
787 
788  table->n_entries += 1;
789 
790  /* note we ONLY rebuild when ADDING - because you can iterate over a
791  * table and remove entries safely.
792  */
793  if (table->n_entries >= table->hi_rebuild_size ||
794  table->n_entries < table->lo_rebuild_size)
795  rebuild_table (table);
796 }
797 
798 static DBusHashEntry*
799 add_entry (DBusHashTable *table,
800  unsigned int idx,
801  void *key,
802  DBusHashEntry ***bucket,
803  DBusPreallocatedHash *preallocated)
804 {
805  DBusHashEntry *entry;
806 
807  if (preallocated == NULL)
808  {
809  entry = alloc_entry (table);
810  if (entry == NULL)
811  {
812  if (bucket)
813  *bucket = NULL;
814  return NULL;
815  }
816  }
817  else
818  {
819  entry = (DBusHashEntry*) preallocated;
820  }
821 
822  add_allocated_entry (table, entry, idx, key, bucket);
823 
824  return entry;
825 }
826 
827 /* This is g_str_hash from GLib which was
828  * extensively discussed/tested/profiled
829  */
830 static unsigned int
831 string_hash (const char *str)
832 {
833  const char *p = str;
834  unsigned int h = *p;
835 
836  if (h)
837  for (p += 1; *p != '\0'; p++)
838  h = (h << 5) - h + *p;
839 
840  return h;
841 }
842 
844 typedef int (* KeyCompareFunc) (const void *key_a, const void *key_b);
845 
846 static DBusHashEntry*
847 find_generic_function (DBusHashTable *table,
848  void *key,
849  unsigned int idx,
850  KeyCompareFunc compare_func,
851  dbus_bool_t create_if_not_found,
852  DBusHashEntry ***bucket,
853  DBusPreallocatedHash *preallocated)
854 {
855  DBusHashEntry *entry;
856 
857  if (bucket)
858  *bucket = NULL;
859 
860  /* Search all of the entries in this bucket. */
861  entry = table->buckets[idx];
862  while (entry != NULL)
863  {
864  if ((compare_func == NULL && key == entry->key) ||
865  (compare_func != NULL && (* compare_func) (key, entry->key) == 0))
866  {
867  if (bucket)
868  *bucket = &(table->buckets[idx]);
869 
870  if (preallocated)
871  _dbus_hash_table_free_preallocated_entry (table, preallocated);
872 
873  return entry;
874  }
875 
876  entry = entry->next;
877  }
878 
879  if (create_if_not_found)
880  entry = add_entry (table, idx, key, bucket, preallocated);
881  else if (preallocated)
882  _dbus_hash_table_free_preallocated_entry (table, preallocated);
883 
884  return entry;
885 }
886 
887 static DBusHashEntry*
888 find_string_function (DBusHashTable *table,
889  void *key,
890  dbus_bool_t create_if_not_found,
891  DBusHashEntry ***bucket,
892  DBusPreallocatedHash *preallocated)
893 {
894  unsigned int idx;
895 
896  idx = string_hash (key) & table->mask;
897 
898  return find_generic_function (table, key, idx,
899  (KeyCompareFunc) strcmp, create_if_not_found, bucket,
900  preallocated);
901 }
902 
903 static DBusHashEntry*
904 find_direct_function (DBusHashTable *table,
905  void *key,
906  dbus_bool_t create_if_not_found,
907  DBusHashEntry ***bucket,
908  DBusPreallocatedHash *preallocated)
909 {
910  unsigned int idx;
911 
912  idx = RANDOM_INDEX (table, key) & table->mask;
913 
914 
915  return find_generic_function (table, key, idx,
916  NULL, create_if_not_found, bucket,
917  preallocated);
918 }
919 
920 static void
921 rebuild_table (DBusHashTable *table)
922 {
923  int old_size;
924  int new_buckets;
925  DBusHashEntry **old_buckets;
926  DBusHashEntry **old_chain;
927  DBusHashEntry *entry;
928  dbus_bool_t growing;
929 
930  /*
931  * Allocate and initialize the new bucket array, and set up
932  * hashing constants for new array size.
933  */
934 
935  growing = table->n_entries >= table->hi_rebuild_size;
936 
937  old_size = table->n_buckets;
938  old_buckets = table->buckets;
939 
940  if (growing)
941  {
942  /* overflow paranoia */
943  if (table->n_buckets < _DBUS_INT_MAX / 4 &&
944  table->down_shift >= 0)
945  new_buckets = table->n_buckets * 4;
946  else
947  return; /* can't grow anymore */
948  }
949  else
950  {
951  new_buckets = table->n_buckets / 4;
952  if (new_buckets < DBUS_SMALL_HASH_TABLE)
953  return; /* don't bother shrinking this far */
954  }
955 
956  table->buckets = dbus_new0 (DBusHashEntry*, new_buckets);
957  if (table->buckets == NULL)
958  {
959  /* out of memory, yay - just don't reallocate, the table will
960  * still work, albeit more slowly.
961  */
962  table->buckets = old_buckets;
963  return;
964  }
965 
966  table->n_buckets = new_buckets;
967 
968  if (growing)
969  {
970  table->lo_rebuild_size = table->hi_rebuild_size;
971  table->hi_rebuild_size *= 4;
972 
973  table->down_shift -= 2; /* keep 2 more high bits */
974  table->mask = (table->mask << 2) + 3; /* keep 2 more high bits */
975  }
976  else
977  {
978  table->hi_rebuild_size = table->lo_rebuild_size;
979  table->lo_rebuild_size /= 4;
980 
981  table->down_shift += 2; /* keep 2 fewer high bits */
982  table->mask = table->mask >> 2; /* keep 2 fewer high bits */
983  }
984 
985 #if 0
986  printf ("%s table to lo = %d hi = %d downshift = %d mask = 0x%x\n",
987  growing ? "GROW" : "SHRINK",
988  table->lo_rebuild_size,
989  table->hi_rebuild_size,
990  table->down_shift,
991  table->mask);
992 #endif
993 
994  _dbus_assert (table->lo_rebuild_size >= 0);
995  _dbus_assert (table->hi_rebuild_size > table->lo_rebuild_size);
996  _dbus_assert (table->mask != 0);
997  /* the mask is essentially the max index */
998  _dbus_assert (table->mask < table->n_buckets);
999 
1000  /*
1001  * Rehash all of the existing entries into the new bucket array.
1002  */
1003 
1004  for (old_chain = old_buckets; old_size > 0; old_size--, old_chain++)
1005  {
1006  for (entry = *old_chain; entry != NULL; entry = *old_chain)
1007  {
1008  unsigned int idx;
1009  DBusHashEntry **bucket;
1010 
1011  *old_chain = entry->next;
1012  switch (table->key_type)
1013  {
1014  case DBUS_HASH_STRING:
1015  idx = string_hash (entry->key) & table->mask;
1016  break;
1017  case DBUS_HASH_INT:
1018  case DBUS_HASH_UINTPTR:
1019  idx = RANDOM_INDEX (table, entry->key);
1020  break;
1021  default:
1022  idx = 0;
1023  _dbus_assert_not_reached ("Unknown hash table type");
1024  break;
1025  }
1026 
1027  bucket = &(table->buckets[idx]);
1028  entry->next = *bucket;
1029  *bucket = entry;
1030  }
1031  }
1032 
1033  /* Free the old bucket array, if it was dynamically allocated. */
1034 
1035  if (old_buckets != table->static_buckets)
1036  dbus_free (old_buckets);
1037 }
1038 
1048 void*
1050  const char *key)
1051 {
1052  DBusHashEntry *entry;
1053 
1055 
1056  entry = (* table->find_function) (table, (char*) key, FALSE, NULL, NULL);
1057 
1058  if (entry)
1059  return entry->value;
1060  else
1061  return NULL;
1062 }
1063 
1073 void*
1075  int key)
1076 {
1077  DBusHashEntry *entry;
1078 
1079  _dbus_assert (table->key_type == DBUS_HASH_INT);
1080 
1081  entry = (* table->find_function) (table, _DBUS_INT_TO_POINTER (key), FALSE, NULL, NULL);
1082 
1083  if (entry)
1084  return entry->value;
1085  else
1086  return NULL;
1087 }
1088 
1098 void*
1100  uintptr_t key)
1101 {
1102  DBusHashEntry *entry;
1103 
1105 
1106  entry = (* table->find_function) (table, (void*) key, FALSE, NULL, NULL);
1107 
1108  if (entry)
1109  return entry->value;
1110  else
1111  return NULL;
1112 }
1113 
1124  const char *key)
1125 {
1126  DBusHashEntry *entry;
1127  DBusHashEntry **bucket;
1128 
1130 
1131  entry = (* table->find_function) (table, (char*) key, FALSE, &bucket, NULL);
1132 
1133  if (entry)
1134  {
1135  remove_entry (table, bucket, entry);
1136  return TRUE;
1137  }
1138  else
1139  return FALSE;
1140 }
1141 
1152  int key)
1153 {
1154  DBusHashEntry *entry;
1155  DBusHashEntry **bucket;
1156 
1157  _dbus_assert (table->key_type == DBUS_HASH_INT);
1158 
1159  entry = (* table->find_function) (table, _DBUS_INT_TO_POINTER (key), FALSE, &bucket, NULL);
1160 
1161  if (entry)
1162  {
1163  remove_entry (table, bucket, entry);
1164  return TRUE;
1165  }
1166  else
1167  return FALSE;
1168 }
1169 
1180  uintptr_t key)
1181 {
1182  DBusHashEntry *entry;
1183  DBusHashEntry **bucket;
1184 
1186 
1187  entry = (* table->find_function) (table, (void*) key, FALSE, &bucket, NULL);
1188 
1189  if (entry)
1190  {
1191  remove_entry (table, bucket, entry);
1192  return TRUE;
1193  }
1194  else
1195  return FALSE;
1196 }
1197 
1215  char *key,
1216  void *value)
1217 {
1218  DBusPreallocatedHash *preallocated;
1219 
1221 
1222  preallocated = _dbus_hash_table_preallocate_entry (table);
1223  if (preallocated == NULL)
1224  return FALSE;
1225 
1226  _dbus_hash_table_insert_string_preallocated (table, preallocated,
1227  key, value);
1228 
1229  return TRUE;
1230 }
1231 
1249  int key,
1250  void *value)
1251 {
1252  DBusHashEntry *entry;
1253 
1254  _dbus_assert (table->key_type == DBUS_HASH_INT);
1255 
1256  entry = (* table->find_function) (table, _DBUS_INT_TO_POINTER (key), TRUE, NULL, NULL);
1257 
1258  if (entry == NULL)
1259  return FALSE; /* no memory */
1260 
1261  if (table->free_key_function && entry->key != _DBUS_INT_TO_POINTER (key))
1262  (* table->free_key_function) (entry->key);
1263 
1264  if (table->free_value_function && entry->value != value)
1265  (* table->free_value_function) (entry->value);
1266 
1267  entry->key = _DBUS_INT_TO_POINTER (key);
1268  entry->value = value;
1269 
1270  return TRUE;
1271 }
1272 
1290  uintptr_t key,
1291  void *value)
1292 {
1293  DBusHashEntry *entry;
1294 
1296 
1297  entry = (* table->find_function) (table, (void*) key, TRUE, NULL, NULL);
1298 
1299  if (entry == NULL)
1300  return FALSE; /* no memory */
1301 
1302  if (table->free_key_function && entry->key != (void*) key)
1303  (* table->free_key_function) (entry->key);
1304 
1305  if (table->free_value_function && entry->value != value)
1306  (* table->free_value_function) (entry->value);
1307 
1308  entry->key = (void*) key;
1309  entry->value = value;
1310 
1311  return TRUE;
1312 }
1313 
1323 {
1324  DBusHashEntry *entry;
1325 
1326  entry = alloc_entry (table);
1327 
1328  return (DBusPreallocatedHash*) entry;
1329 }
1330 
1338 void
1340  DBusPreallocatedHash *preallocated)
1341 {
1342  DBusHashEntry *entry;
1343 
1344  _dbus_assert (preallocated != NULL);
1345 
1346  entry = (DBusHashEntry*) preallocated;
1347 
1348  /* Don't use free_entry(), since this entry has no key/data */
1349  _dbus_mem_pool_dealloc (table->entry_pool, entry);
1350 }
1351 
1365 void
1367  DBusPreallocatedHash *preallocated,
1368  char *key,
1369  void *value)
1370 {
1371  DBusHashEntry *entry;
1372 
1374  _dbus_assert (preallocated != NULL);
1375 
1376  entry = (* table->find_function) (table, key, TRUE, NULL, preallocated);
1377 
1378  _dbus_assert (entry != NULL);
1379 
1380  if (table->free_key_function && entry->key != key)
1381  (* table->free_key_function) (entry->key);
1382 
1383  if (table->free_value_function && entry->value != value)
1384  (* table->free_value_function) (entry->value);
1385 
1386  entry->key = key;
1387  entry->value = value;
1388 }
1389 
1396 int
1398 {
1399  return table->n_entries;
1400 }
1401 
1404 #ifdef DBUS_BUILD_TESTS
1405 #include "dbus-test.h"
1406 #include <stdio.h>
1407 
1408 /* If you're wondering why the hash table test takes
1409  * forever to run, it's because we call this function
1410  * in inner loops thus making things quadratic.
1411  */
1412 static int
1413 count_entries (DBusHashTable *table)
1414 {
1415  DBusHashIter iter;
1416  int count;
1417 
1418  count = 0;
1419  _dbus_hash_iter_init (table, &iter);
1420  while (_dbus_hash_iter_next (&iter))
1421  ++count;
1422 
1423  _dbus_assert (count == _dbus_hash_table_get_n_entries (table));
1424 
1425  return count;
1426 }
1427 
1434 _dbus_hash_test (void)
1435 {
1436  int i;
1437  DBusHashTable *table1;
1438  DBusHashTable *table2;
1439  DBusHashTable *table3;
1440  DBusHashIter iter;
1441 #define N_HASH_KEYS 5000
1442  char **keys;
1443  dbus_bool_t ret = FALSE;
1444 
1445  keys = dbus_new (char *, N_HASH_KEYS);
1446  if (keys == NULL)
1447  _dbus_assert_not_reached ("no memory");
1448 
1449  for (i = 0; i < N_HASH_KEYS; i++)
1450  {
1451  keys[i] = dbus_malloc (128);
1452 
1453  if (keys[i] == NULL)
1454  _dbus_assert_not_reached ("no memory");
1455  }
1456 
1457  printf ("Computing test hash keys...\n");
1458  i = 0;
1459  while (i < N_HASH_KEYS)
1460  {
1461  int len;
1462 
1463  len = sprintf (keys[i], "Hash key %d", i);
1464  _dbus_assert (*(keys[i] + len) == '\0');
1465  ++i;
1466  }
1467  printf ("... done.\n");
1468 
1470  dbus_free, dbus_free);
1471  if (table1 == NULL)
1472  goto out;
1473 
1475  NULL, dbus_free);
1476  if (table2 == NULL)
1477  goto out;
1478 
1480  NULL, dbus_free);
1481  if (table3 == NULL)
1482  goto out;
1483 
1484  /* Insert and remove a bunch of stuff, counting the table in between
1485  * to be sure it's not broken and that iteration works
1486  */
1487  i = 0;
1488  while (i < 3000)
1489  {
1490  void *value;
1491  char *key;
1492 
1493  key = _dbus_strdup (keys[i]);
1494  if (key == NULL)
1495  goto out;
1496  value = _dbus_strdup ("Value!");
1497  if (value == NULL)
1498  goto out;
1499 
1500  if (!_dbus_hash_table_insert_string (table1,
1501  key, value))
1502  goto out;
1503 
1504  value = _dbus_strdup (keys[i]);
1505  if (value == NULL)
1506  goto out;
1507 
1508  if (!_dbus_hash_table_insert_int (table2,
1509  i, value))
1510  goto out;
1511 
1512  value = _dbus_strdup (keys[i]);
1513  if (value == NULL)
1514  goto out;
1515 
1516  if (!_dbus_hash_table_insert_uintptr (table3,
1517  i, value))
1518  goto out;
1519 
1520  _dbus_assert (count_entries (table1) == i + 1);
1521  _dbus_assert (count_entries (table2) == i + 1);
1522  _dbus_assert (count_entries (table3) == i + 1);
1523 
1524  value = _dbus_hash_table_lookup_string (table1, keys[i]);
1525  _dbus_assert (value != NULL);
1526  _dbus_assert (strcmp (value, "Value!") == 0);
1527 
1528  value = _dbus_hash_table_lookup_int (table2, i);
1529  _dbus_assert (value != NULL);
1530  _dbus_assert (strcmp (value, keys[i]) == 0);
1531 
1532  value = _dbus_hash_table_lookup_uintptr (table3, i);
1533  _dbus_assert (value != NULL);
1534  _dbus_assert (strcmp (value, keys[i]) == 0);
1535 
1536  ++i;
1537  }
1538 
1539  --i;
1540  while (i >= 0)
1541  {
1543  keys[i]);
1544 
1545  _dbus_hash_table_remove_int (table2, i);
1546 
1547  _dbus_hash_table_remove_uintptr (table3, i);
1548 
1549  _dbus_assert (count_entries (table1) == i);
1550  _dbus_assert (count_entries (table2) == i);
1551  _dbus_assert (count_entries (table3) == i);
1552 
1553  --i;
1554  }
1555 
1556  _dbus_hash_table_ref (table1);
1557  _dbus_hash_table_ref (table2);
1558  _dbus_hash_table_ref (table3);
1559  _dbus_hash_table_unref (table1);
1560  _dbus_hash_table_unref (table2);
1561  _dbus_hash_table_unref (table3);
1562  _dbus_hash_table_unref (table1);
1563  _dbus_hash_table_unref (table2);
1564  _dbus_hash_table_unref (table3);
1565  table3 = NULL;
1566 
1567  /* Insert a bunch of stuff then check
1568  * that iteration works correctly (finds the right
1569  * values, iter_set_value works, etc.)
1570  */
1572  dbus_free, dbus_free);
1573  if (table1 == NULL)
1574  goto out;
1575 
1577  NULL, dbus_free);
1578  if (table2 == NULL)
1579  goto out;
1580 
1581  i = 0;
1582  while (i < 5000)
1583  {
1584  char *key;
1585  void *value;
1586 
1587  key = _dbus_strdup (keys[i]);
1588  if (key == NULL)
1589  goto out;
1590  value = _dbus_strdup ("Value!");
1591  if (value == NULL)
1592  goto out;
1593 
1594  if (!_dbus_hash_table_insert_string (table1,
1595  key, value))
1596  goto out;
1597 
1598  value = _dbus_strdup (keys[i]);
1599  if (value == NULL)
1600  goto out;
1601 
1602  if (!_dbus_hash_table_insert_int (table2,
1603  i, value))
1604  goto out;
1605 
1606  _dbus_assert (count_entries (table1) == i + 1);
1607  _dbus_assert (count_entries (table2) == i + 1);
1608 
1609  ++i;
1610  }
1611 
1612  _dbus_hash_iter_init (table1, &iter);
1613  while (_dbus_hash_iter_next (&iter))
1614  {
1615  const char *key;
1616  void *value;
1617 
1618  key = _dbus_hash_iter_get_string_key (&iter);
1619  value = _dbus_hash_iter_get_value (&iter);
1620 
1621  _dbus_assert (_dbus_hash_table_lookup_string (table1, key) == value);
1622 
1623  value = _dbus_strdup ("Different value!");
1624  if (value == NULL)
1625  goto out;
1626 
1627  _dbus_hash_iter_set_value (&iter, value);
1628 
1629  _dbus_assert (_dbus_hash_table_lookup_string (table1, key) == value);
1630  }
1631 
1632  _dbus_hash_iter_init (table1, &iter);
1633  while (_dbus_hash_iter_next (&iter))
1634  {
1636  _dbus_assert (count_entries (table1) == i - 1);
1637  --i;
1638  }
1639 
1640  _dbus_hash_iter_init (table2, &iter);
1641  while (_dbus_hash_iter_next (&iter))
1642  {
1643  int key;
1644  void *value;
1645 
1646  key = _dbus_hash_iter_get_int_key (&iter);
1647  value = _dbus_hash_iter_get_value (&iter);
1648 
1649  _dbus_assert (_dbus_hash_table_lookup_int (table2, key) == value);
1650 
1651  value = _dbus_strdup ("Different value!");
1652  if (value == NULL)
1653  goto out;
1654 
1655  _dbus_hash_iter_set_value (&iter, value);
1656 
1657  _dbus_assert (_dbus_hash_table_lookup_int (table2, key) == value);
1658  }
1659 
1660  i = count_entries (table2);
1661  _dbus_hash_iter_init (table2, &iter);
1662  while (_dbus_hash_iter_next (&iter))
1663  {
1665  _dbus_assert (count_entries (table2) + 1 == i);
1666  --i;
1667  }
1668 
1669  /* add/remove interleaved, to check that we grow/shrink the table
1670  * appropriately
1671  */
1672  i = 0;
1673  while (i < 1000)
1674  {
1675  char *key;
1676  void *value;
1677 
1678  key = _dbus_strdup (keys[i]);
1679  if (key == NULL)
1680  goto out;
1681 
1682  value = _dbus_strdup ("Value!");
1683  if (value == NULL)
1684  goto out;
1685 
1686  if (!_dbus_hash_table_insert_string (table1,
1687  key, value))
1688  goto out;
1689 
1690  ++i;
1691  }
1692 
1693  --i;
1694  while (i >= 0)
1695  {
1696  char *key;
1697  void *value;
1698 
1699  key = _dbus_strdup (keys[i]);
1700  if (key == NULL)
1701  goto out;
1702  value = _dbus_strdup ("Value!");
1703  if (value == NULL)
1704  goto out;
1705 
1706  if (!_dbus_hash_table_remove_string (table1, keys[i]))
1707  goto out;
1708 
1709  if (!_dbus_hash_table_insert_string (table1,
1710  key, value))
1711  goto out;
1712 
1713  if (!_dbus_hash_table_remove_string (table1, keys[i]))
1714  goto out;
1715 
1717 
1718  --i;
1719  }
1720 
1721  /* nuke these tables */
1722  _dbus_hash_table_unref (table1);
1723  _dbus_hash_table_unref (table2);
1724 
1725 
1726  /* Now do a bunch of things again using _dbus_hash_iter_lookup() to
1727  * be sure that interface works.
1728  */
1730  dbus_free, dbus_free);
1731  if (table1 == NULL)
1732  goto out;
1733 
1735  NULL, dbus_free);
1736  if (table2 == NULL)
1737  goto out;
1738 
1739  i = 0;
1740  while (i < 3000)
1741  {
1742  void *value;
1743  char *key;
1744 
1745  key = _dbus_strdup (keys[i]);
1746  if (key == NULL)
1747  goto out;
1748  value = _dbus_strdup ("Value!");
1749  if (value == NULL)
1750  goto out;
1751 
1752  if (!_dbus_hash_iter_lookup (table1,
1753  key, TRUE, &iter))
1754  goto out;
1756  _dbus_hash_iter_set_value (&iter, value);
1757 
1758  value = _dbus_strdup (keys[i]);
1759  if (value == NULL)
1760  goto out;
1761 
1762  if (!_dbus_hash_iter_lookup (table2,
1763  _DBUS_INT_TO_POINTER (i), TRUE, &iter))
1764  goto out;
1766  _dbus_hash_iter_set_value (&iter, value);
1767 
1768  _dbus_assert (count_entries (table1) == i + 1);
1769  _dbus_assert (count_entries (table2) == i + 1);
1770 
1771  if (!_dbus_hash_iter_lookup (table1, keys[i], FALSE, &iter))
1772  goto out;
1773 
1774  value = _dbus_hash_iter_get_value (&iter);
1775  _dbus_assert (value != NULL);
1776  _dbus_assert (strcmp (value, "Value!") == 0);
1777 
1778  /* Iterate just to be sure it works, though
1779  * it's a stupid thing to do
1780  */
1781  while (_dbus_hash_iter_next (&iter))
1782  ;
1783 
1784  if (!_dbus_hash_iter_lookup (table2, _DBUS_INT_TO_POINTER (i), FALSE, &iter))
1785  goto out;
1786 
1787  value = _dbus_hash_iter_get_value (&iter);
1788  _dbus_assert (value != NULL);
1789  _dbus_assert (strcmp (value, keys[i]) == 0);
1790 
1791  /* Iterate just to be sure it works, though
1792  * it's a stupid thing to do
1793  */
1794  while (_dbus_hash_iter_next (&iter))
1795  ;
1796 
1797  ++i;
1798  }
1799 
1800  --i;
1801  while (i >= 0)
1802  {
1803  if (!_dbus_hash_iter_lookup (table1, keys[i], FALSE, &iter))
1804  _dbus_assert_not_reached ("hash entry should have existed");
1806 
1807  if (!_dbus_hash_iter_lookup (table2, _DBUS_INT_TO_POINTER (i), FALSE, &iter))
1808  _dbus_assert_not_reached ("hash entry should have existed");
1810 
1811  _dbus_assert (count_entries (table1) == i);
1812  _dbus_assert (count_entries (table2) == i);
1813 
1814  --i;
1815  }
1816 
1817  _dbus_hash_table_unref (table1);
1818  _dbus_hash_table_unref (table2);
1819 
1820  ret = TRUE;
1821 
1822  out:
1823  for (i = 0; i < N_HASH_KEYS; i++)
1824  dbus_free (keys[i]);
1825 
1826  dbus_free (keys);
1827 
1828  return ret;
1829 }
1830 
1831 #endif /* DBUS_BUILD_TESTS */
int _dbus_hash_table_get_n_entries(DBusHashTable *table)
Gets the number of hash entries in a hash table.
Definition: dbus-hash.c:1397
struct DBusPreallocatedHash DBusPreallocatedHash
A preallocated hash entry.
Definition: dbus-hash.h:120
#define NULL
A null pointer, defined appropriately for C or C++.
void * _dbus_mem_pool_alloc(DBusMemPool *pool)
Allocates an object from the memory pool.
Definition: dbus-mempool.c:214
void(* DBusFreeFunction)(void *memory)
The type of a function which frees a block of memory.
Definition: dbus-memory.h:64
DBusPreallocatedHash * _dbus_hash_table_preallocate_entry(DBusHashTable *table)
Preallocate an opaque data blob that allows us to insert into the hash table at a later time without ...
Definition: dbus-hash.c:1322
int down_shift
Shift count used in hashing function.
Definition: dbus-hash.c:191
void dbus_free(void *memory)
Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().
Definition: dbus-memory.c:700
#define dbus_new(type, count)
Safe macro for using dbus_malloc().
Definition: dbus-memory.h:58
#define _dbus_assert(condition)
Aborts with an error message if the condition is false.
#define _DBUS_INT_TO_POINTER(integer)
Safely stuffs an integer into a pointer, to be extracted later with _DBUS_POINTER_TO_INT.
DBusHashType key_type
Type of keys used in this table.
Definition: dbus-hash.c:198
void _dbus_hash_table_free_preallocated_entry(DBusHashTable *table, DBusPreallocatedHash *preallocated)
Frees an opaque DBusPreallocatedHash that was not used in order to insert into the hash table...
Definition: dbus-hash.c:1339
int n_buckets
Total number of buckets allocated at **buckets.
Definition: dbus-hash.c:179
DBusHashTable * _dbus_hash_table_ref(DBusHashTable *table)
Increments the reference count for a hash table.
Definition: dbus-hash.c:347
dbus_bool_t _dbus_hash_table_remove_int(DBusHashTable *table, int key)
Removes the hash entry for the given key.
Definition: dbus-hash.c:1151
Hash keys are strings.
Definition: dbus-hash.h:69
void _dbus_hash_table_unref(DBusHashTable *table)
Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...
Definition: dbus-hash.c:361
dbus_bool_t _dbus_mem_pool_dealloc(DBusMemPool *pool, void *element)
Deallocates an object previously created with _dbus_mem_pool_alloc().
Definition: dbus-mempool.c:347
Hash keys are integer capable to hold a pointer.
Definition: dbus-hash.h:71
Hash iterator object.
Definition: dbus-hash.h:49
void _dbus_hash_table_remove_all(DBusHashTable *table)
Removed all entries from a hash table.
Definition: dbus-hash.c:418
#define _DBUS_INT_MAX
Maximum value of type &quot;int&quot;.
void * _dbus_hash_table_lookup_int(DBusHashTable *table, int key)
Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.
Definition: dbus-hash.c:1074
int _dbus_hash_iter_get_int_key(DBusHashIter *iter)
Gets the key for the current entry.
Definition: dbus-hash.c:659
void * dbus_malloc(size_t bytes)
Allocates the given number of bytes, as with standard malloc().
Definition: dbus-memory.c:460
Hash keys are integers.
Definition: dbus-hash.h:70
#define dbus_new0(type, count)
Safe macro for using dbus_malloc0().
Definition: dbus-memory.h:59
DBusHashTable * _dbus_hash_table_new(DBusHashType type, DBusFreeFunction key_free_function, DBusFreeFunction value_free_function)
Constructs a new hash table.
Definition: dbus-hash.c:285
dbus_bool_t _dbus_hash_iter_lookup(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashIter *iter)
A low-level but efficient interface for manipulating the hash table.
Definition: dbus-hash.c:740
dbus_uint32_t dbus_bool_t
A boolean, valid values are TRUE and FALSE.
Definition: dbus-types.h:35
void * key
Hash key.
Definition: dbus-hash.c:149
int next_bucket
index of next bucket
Definition: dbus-hash.c:221
void * value
Hash value.
Definition: dbus-hash.c:150
void * _dbus_hash_table_lookup_uintptr(DBusHashTable *table, uintptr_t key)
Looks up the value for a given integer in a hash table of type DBUS_HASH_UINTPTR. ...
Definition: dbus-hash.c:1099
DBusHashEntry * entry
Current hash entry.
Definition: dbus-hash.c:219
uintptr_t _dbus_hash_iter_get_uintptr_key(DBusHashIter *iter)
Gets the key for the current entry.
Definition: dbus-hash.c:678
int(* KeyCompareFunc)(const void *key_a, const void *key_b)
Key comparison function.
Definition: dbus-hash.c:844
dbus_bool_t _dbus_hash_iter_next(DBusHashIter *iter)
Move the hash iterator forward one step, to the next hash entry.
Definition: dbus-hash.c:543
Internals of DBusHashIter.
Definition: dbus-hash.c:212
void _dbus_mem_pool_free(DBusMemPool *pool)
Frees a memory pool (and all elements allocated from it).
Definition: dbus-mempool.c:187
int lo_rebuild_size
Shrink table when n_entries gets below this.
Definition: dbus-hash.c:188
#define _DBUS_POINTER_TO_INT(pointer)
Safely casts a void* to an integer; should only be used on void* that actually contain integers...
Internal representation of a hash entry.
Definition: dbus-hash.c:143
dbus_bool_t _dbus_hash_table_insert_string(DBusHashTable *table, char *key, void *value)
Creates a hash entry with the given key and value.
Definition: dbus-hash.c:1214
Internals fields of DBusMemPool.
Definition: dbus-mempool.c:98
DBusHashEntry * next
Pointer to next entry in this hash bucket, or NULL for end of chain.
Definition: dbus-hash.c:145
int n_entries_on_init
used to detect table resize since initialization
Definition: dbus-hash.c:222
int refcount
Reference count.
Definition: dbus-hash.c:169
DBusHashEntry ** buckets
Pointer to bucket array.
Definition: dbus-hash.c:171
DBusHashTable * table
Pointer to table containing entry.
Definition: dbus-hash.c:214
#define _DBUS_N_ELEMENTS(array)
Computes the number of elements in a fixed-size array using sizeof().
dbus_bool_t _dbus_hash_table_insert_int(DBusHashTable *table, int key, void *value)
Creates a hash entry with the given key and value.
Definition: dbus-hash.c:1248
DBusHashEntry * static_buckets[DBUS_SMALL_HASH_TABLE]
Bucket array used for small tables (to avoid mallocs and frees).
Definition: dbus-hash.c:175
#define TRUE
Expands to &quot;1&quot;.
dbus_bool_t _dbus_hash_table_insert_uintptr(DBusHashTable *table, uintptr_t key, void *value)
Creates a hash entry with the given key and value.
Definition: dbus-hash.c:1289
#define _dbus_assert_not_reached(explanation)
Aborts with an error message if called.
dbus_bool_t _dbus_hash_table_remove_string(DBusHashTable *table, const char *key)
Removes the hash entry for the given key.
Definition: dbus-hash.c:1123
int hi_rebuild_size
Enlarge table when n_entries gets to be this large.
Definition: dbus-hash.c:185
DBusFreeFunction free_value_function
Function to free values.
Definition: dbus-hash.c:204
DBusHashEntry ** bucket
Pointer to bucket that points to first entry in this entry&#39;s chain: used for deleting the entry...
Definition: dbus-hash.c:215
void _dbus_hash_iter_remove_entry(DBusHashIter *iter)
Removes the current entry from the hash table.
Definition: dbus-hash.c:592
void _dbus_hash_iter_set_value(DBusHashIter *iter, void *value)
Sets the value of the current entry.
Definition: dbus-hash.c:636
DBusHashType
Indicates the type of a key in the hash table.
Definition: dbus-hash.h:67
DBusFreeFunction free_key_function
Function to free keys.
Definition: dbus-hash.c:203
void _dbus_hash_iter_init(DBusHashTable *table, DBusHashIter *iter)
Initializes a hash table iterator.
Definition: dbus-hash.c:517
void * _dbus_hash_iter_get_value(DBusHashIter *iter)
Gets the value of the current entry.
Definition: dbus-hash.c:613
#define FALSE
Expands to &quot;0&quot;.
#define DBUS_SMALL_HASH_TABLE
Initial number of buckets in hash table (hash table statically allocates its buckets for this size an...
Definition: dbus-hash.c:130
const char * _dbus_hash_iter_get_string_key(DBusHashIter *iter)
Gets the key for the current entry.
Definition: dbus-hash.c:696
dbus_bool_t _dbus_hash_table_remove_uintptr(DBusHashTable *table, uintptr_t key)
Removes the hash entry for the given key.
Definition: dbus-hash.c:1179
void _dbus_hash_table_insert_string_preallocated(DBusHashTable *table, DBusPreallocatedHash *preallocated, char *key, void *value)
Inserts a string-keyed entry into the hash table, using a preallocated data block from _dbus_hash_tab...
Definition: dbus-hash.c:1366
Internals of DBusHashTable.
Definition: dbus-hash.c:168
char * _dbus_strdup(const char *str)
Duplicates a string.
DBusHashEntry * next_entry
Next entry to be iterated onto in current bucket.
Definition: dbus-hash.c:220
void * _dbus_hash_table_lookup_string(DBusHashTable *table, const char *key)
Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.
Definition: dbus-hash.c:1049
#define REBUILD_MULTIPLIER
When there are this many entries per bucket, on average, rebuild the hash table to make it larger...
Definition: dbus-hash.c:104
int mask
Mask value used in hashing function.
Definition: dbus-hash.c:195
DBusFindEntryFunction find_function
Function for finding entries.
Definition: dbus-hash.c:201
DBusHashEntry *(* DBusFindEntryFunction)(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated)
Function used to find and optionally create a hash entry.
Definition: dbus-hash.c:156
DBusMemPool * _dbus_mem_pool_new(int element_size, dbus_bool_t zero_elements)
Creates a new memory pool, or returns NULL on failure.
Definition: dbus-mempool.c:138
#define RANDOM_INDEX(table, i)
Takes a preliminary integer hash value and produces an index into a hash tables bucket list...
Definition: dbus-hash.c:122
int n_entries
Total number of entries present in table.
Definition: dbus-hash.c:182
DBusMemPool * entry_pool
Memory pool for hash entries.
Definition: dbus-hash.c:206