table 276 daemons/fenced/fenced_remote.c init_stonith_remote_op_hash_table(GHashTable **table) table 278 daemons/fenced/fenced_remote.c if (*table == NULL) { table 279 daemons/fenced/fenced_remote.c *table = pcmk__strkey_table(NULL, free_remote_op); table 223 daemons/fenced/pacemaker-fenced.h void init_stonith_remote_op_hash_table(GHashTable **table); table 75 include/crm/common/alerts_internal.h void pcmk__add_alert_key(GHashTable *table, enum pcmk__alert_keys_e name, table 77 include/crm/common/alerts_internal.h void pcmk__add_alert_key_int(GHashTable *table, enum pcmk__alert_keys_e name, table 615 include/crm/common/output_internal.h const pcmk__supported_format_t *table); table 653 include/crm/common/output_internal.h const pcmk__message_entry_t *table); table 34 include/crm/common/strings_internal.h int pcmk__guint_from_hash(GHashTable *table, const char *key, guint default_val, table 55 include/crm/common/strings_internal.h void pcmk__insert_dup(GHashTable *table, const char *name, const char *value); table 149 lib/common/alerts.c pcmk__add_alert_key(GHashTable *table, enum pcmk__alert_keys_e name, table 155 lib/common/alerts.c pcmk__insert_dup(table, *key, value); table 157 lib/common/alerts.c g_hash_table_remove(table, *key); table 163 lib/common/alerts.c pcmk__add_alert_key_int(GHashTable *table, enum pcmk__alert_keys_e name, table 168 lib/common/alerts.c g_hash_table_insert(table, pcmk__str_copy(*key), pcmk__itoa(value)); table 1352 lib/common/options.c cluster_option_value(GHashTable *table, const pcmk__cluster_option_t *option) table 1358 lib/common/options.c if (table != NULL) { table 1359 lib/common/options.c value = g_hash_table_lookup(table, option->name); table 1362 lib/common/options.c value = g_hash_table_lookup(table, option->alt_name); table 1370 lib/common/options.c pcmk__insert_dup(table, option->name, value); table 1403 lib/common/options.c if (table != NULL) { table 1404 lib/common/options.c pcmk__insert_dup(table, option->name, value); table 204 lib/common/output.c pcmk__register_messages(pcmk__output_t *out, const pcmk__message_entry_t *table) table 206 lib/common/output.c for (const pcmk__message_entry_t *entry = table; entry->message_id != NULL; table 995 lib/common/rules.c GHashTable *table = NULL; table 1011 lib/common/rules.c table = rule_input->rsc_params; table 1015 lib/common/rules.c table = rule_input->rsc_meta; table 1022 lib/common/rules.c if (table == NULL) { table 1025 lib/common/rules.c return (const char *) g_hash_table_lookup(table, value); table 313 lib/common/strings.c pcmk__guint_from_hash(GHashTable *table, const char *key, guint default_val, table 320 lib/common/strings.c CRM_CHECK((table != NULL) && (key != NULL), return EINVAL); table 326 lib/common/strings.c value = g_hash_table_lookup(table, key); table 713 lib/common/strings.c pcmk__insert_dup(GHashTable *table, const char *name, const char *value) table 715 lib/common/strings.c pcmk__assert((table != NULL) && (name != NULL)); table 717 lib/common/strings.c g_hash_table_insert(table, pcmk__str_copy(name), pcmk__str_copy(value)); table 130 lib/pacemaker/pcmk_sched_instances.c GHashTable *table = pcmk__strkey_table(NULL, free); table 133 lib/pacemaker/pcmk_sched_instances.c g_hash_table_insert(table, (gpointer) node->details->id, node); table 134 lib/pacemaker/pcmk_sched_instances.c return table; table 123 lib/pengine/clone.c sorted_hash_table_values(GHashTable *table) table 129 lib/pengine/clone.c g_hash_table_iter_init(&iter, table); table 141 lib/pengine/clone.c nodes_with_status(GHashTable *table, const char *status) table 147 lib/pengine/clone.c g_hash_table_iter_init(&iter, table); table 123 lib/pengine/complex.c GHashTable *table = user_data; table 125 lib/pengine/complex.c CRM_CHECK((key != NULL) && (table != NULL), return); table 132 lib/pengine/complex.c } else if ((value != NULL) && (g_hash_table_lookup(table, key) == NULL)) { table 133 lib/pengine/complex.c pcmk__insert_dup(table, (const char *) key, (const char *) value); table 108 maint/gnulib/lib/exclude.c Hash_table *table; /* for type == exclude_hash */ table 266 maint/gnulib/lib/exclude.c sp->v.table = hash_initialize (0, NULL, table 296 maint/gnulib/lib/exclude.c hash_free (seg->v.table); table 427 maint/gnulib/lib/exclude.c Hash_table *table = seg->v.table; table 436 maint/gnulib/lib/exclude.c if (hash_lookup (table, buffer)) table 596 maint/gnulib/lib/exclude.c p = hash_insert (seg->v.table, str); table 51 maint/gnulib/lib/ffs.c static unsigned int table[] = { table 57 maint/gnulib/lib/ffs.c return table[(bit * 0x077cb531U) >> 27] - !i; table 356 maint/gnulib/lib/fnmatch_loop.c const int32_t *table; table 369 maint/gnulib/lib/fnmatch_loop.c table = (const int32_t *) table 378 maint/gnulib/lib/fnmatch_loop.c table = (const int32_t *) table 388 maint/gnulib/lib/fnmatch_loop.c idx = FINDIDX (table, indirect, extra, &cp, 1); table 398 maint/gnulib/lib/fnmatch_loop.c idx2 = FINDIDX (table, indirect, extra, table 5903 maint/gnulib/lib/gen-uni-tables.c char table[0x110000]; table 5910 maint/gnulib/lib/gen-uni-tables.c table[i] = (int) func (i); table 5917 maint/gnulib/lib/gen-uni-tables.c if (!table[i]) table 5927 maint/gnulib/lib/gen-uni-tables.c while (i < 0x110000 && table[i]); table 5961 maint/gnulib/lib/gen-uni-tables.c char table[0x110000]; table 5968 maint/gnulib/lib/gen-uni-tables.c table[i] = (func (i) != i); table 5974 maint/gnulib/lib/gen-uni-tables.c if (table[i]) table 753 maint/gnulib/lib/getloadavg.c table (TBL_LOADAVG, 0, &load_ave, 1, sizeof (load_ave)); table 775 maint/gnulib/lib/getloadavg.c table (TBL_LOADAVG, 0, &load_ave, 1, sizeof (load_ave)); table 59 maint/gnulib/lib/gl_anyavltree_list1.h struct gl_hash_entry **table; table 103 maint/gnulib/lib/gl_anyavltree_list2.h list->table = table 105 maint/gnulib/lib/gl_anyavltree_list2.h if (list->table == NULL) table 134 maint/gnulib/lib/gl_anyavltree_list2.h free (list->table); table 33 maint/gnulib/lib/gl_anyhash2.h gl_hash_entry_t *old_table = container->table; table 62 maint/gnulib/lib/gl_anyhash2.h container->table = new_table; table 39 maint/gnulib/lib/gl_anylinked_list1.h struct gl_hash_entry **table; table 59 maint/gnulib/lib/gl_anylinked_list2.h list->table = table 61 maint/gnulib/lib/gl_anylinked_list2.h if (list->table == NULL) table 105 maint/gnulib/lib/gl_anylinked_list2.h list->table = table 107 maint/gnulib/lib/gl_anylinked_list2.h if (list->table == NULL) table 159 maint/gnulib/lib/gl_anylinked_list2.h free (list->table); table 359 maint/gnulib/lib/gl_anylinked_list2.h for (node = (gl_list_node_t) list->table[bucket]; table 400 maint/gnulib/lib/gl_anylinked_list2.h for (node = (gl_list_node_t) list->table[bucket]; table 514 maint/gnulib/lib/gl_anylinked_list2.h for (node = (gl_list_node_t) list->table[bucket]; table 529 maint/gnulib/lib/gl_anylinked_list2.h for (node = (gl_list_node_t) list->table[bucket]; table 930 maint/gnulib/lib/gl_anylinked_list2.h free (list->table); table 64 maint/gnulib/lib/gl_anyrbtree_list1.h struct gl_hash_entry **table; table 108 maint/gnulib/lib/gl_anyrbtree_list2.h list->table = table 110 maint/gnulib/lib/gl_anyrbtree_list2.h if (list->table == NULL) table 149 maint/gnulib/lib/gl_anyrbtree_list2.h free (list->table); table 40 maint/gnulib/lib/gl_anytree_list2.h list->table = table 42 maint/gnulib/lib/gl_anytree_list2.h if (list->table == NULL) table 112 maint/gnulib/lib/gl_anytreehash_list1.h for (entryp = &list->table[bucket]; *entryp != NULL; entryp = &(*entryp)->hash_next) table 173 maint/gnulib/lib/gl_anytreehash_list1.h new_node->h.hash_next = list->table[bucket]; table 174 maint/gnulib/lib/gl_anytreehash_list1.h list->table[bucket] = &new_node->h; table 199 maint/gnulib/lib/gl_anytreehash_list1.h for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) table 245 maint/gnulib/lib/gl_anytreehash_list1.h for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next) table 39 maint/gnulib/lib/gl_anytreehash_list2.h for (entry = list->table[bucket]; entry != NULL; entry = entry->hash_next) table 104 maint/gnulib/lib/gl_anytreehash_list2.h for (entry = list->table[bucket]; entry != NULL; entry = entry->hash_next) table 153 maint/gnulib/lib/gl_anytreehash_list2.h gl_hash_entry_t entry = list->table[--i]; table 211 maint/gnulib/lib/gl_anytreehash_list2.h free (list->table); table 47 maint/gnulib/lib/gl_hash_map.c struct gl_hash_entry **table; table 78 maint/gnulib/lib/gl_hash_map.c map->table = table 80 maint/gnulib/lib/gl_hash_map.c if (map->table == NULL) table 110 maint/gnulib/lib/gl_hash_map.c for (node = (gl_list_node_t) map->table[bucket]; table 139 maint/gnulib/lib/gl_hash_map.c for (node = (gl_list_node_t) map->table[bucket]; table 165 maint/gnulib/lib/gl_hash_map.c node->h.hash_next = map->table[bucket]; table 166 maint/gnulib/lib/gl_hash_map.c map->table[bucket] = &node->h; table 189 maint/gnulib/lib/gl_hash_map.c for (nodep = (gl_list_node_t *) &map->table[bucket]; table 224 maint/gnulib/lib/gl_hash_map.c struct gl_hash_entry **table = map->table; table 229 maint/gnulib/lib/gl_hash_map.c gl_hash_entry_t node = table[--i]; table 247 maint/gnulib/lib/gl_hash_map.c free (map->table); table 295 maint/gnulib/lib/gl_hash_map.c gl_hash_entry_t *table = iterator->map->table; table 298 maint/gnulib/lib/gl_hash_map.c gl_list_node_t node = (gl_list_node_t) table[i++]; table 46 maint/gnulib/lib/gl_hash_set.c struct gl_hash_entry **table; table 75 maint/gnulib/lib/gl_hash_set.c set->table = table 77 maint/gnulib/lib/gl_hash_set.c if (set->table == NULL) table 107 maint/gnulib/lib/gl_hash_set.c for (node = (gl_list_node_t) set->table[bucket]; table 132 maint/gnulib/lib/gl_hash_set.c for (node = (gl_list_node_t) set->table[bucket]; table 153 maint/gnulib/lib/gl_hash_set.c node->h.hash_next = set->table[bucket]; table 154 maint/gnulib/lib/gl_hash_set.c set->table[bucket] = &node->h; table 177 maint/gnulib/lib/gl_hash_set.c for (nodep = (gl_list_node_t *) &set->table[bucket]; table 209 maint/gnulib/lib/gl_hash_set.c struct gl_hash_entry **table = set->table; table 214 maint/gnulib/lib/gl_hash_set.c gl_hash_entry_t node = table[--i]; table 230 maint/gnulib/lib/gl_hash_set.c free (set->table); table 276 maint/gnulib/lib/gl_hash_set.c gl_hash_entry_t *table = iterator->set->table; table 279 maint/gnulib/lib/gl_hash_set.c gl_list_node_t node = (gl_list_node_t) table[i++]; table 49 maint/gnulib/lib/gl_linkedhash_list.c node->h.hash_next = list->table[bucket]; table 50 maint/gnulib/lib/gl_linkedhash_list.c list->table[bucket] = &node->h; table 62 maint/gnulib/lib/gl_linkedhash_list.c for (p = &list->table[bucket]; ; p = &(*p)->hash_next) table 49 maint/gnulib/lib/gl_linkedhash_map.c struct gl_hash_entry **table; table 101 maint/gnulib/lib/gl_linkedhash_map.c map->table = table 103 maint/gnulib/lib/gl_linkedhash_map.c if (map->table == NULL) table 135 maint/gnulib/lib/gl_linkedhash_map.c for (node = (gl_list_node_t) map->table[bucket]; table 164 maint/gnulib/lib/gl_linkedhash_map.c for (node = (gl_list_node_t) map->table[bucket]; table 190 maint/gnulib/lib/gl_linkedhash_map.c node->h.hash_next = map->table[bucket]; table 191 maint/gnulib/lib/gl_linkedhash_map.c map->table[bucket] = &node->h; table 218 maint/gnulib/lib/gl_linkedhash_map.c for (nodep = (gl_list_node_t *) &map->table[bucket]; table 270 maint/gnulib/lib/gl_linkedhash_map.c free (map->table); table 48 maint/gnulib/lib/gl_linkedhash_set.c struct gl_hash_entry **table; table 98 maint/gnulib/lib/gl_linkedhash_set.c set->table = table 100 maint/gnulib/lib/gl_linkedhash_set.c if (set->table == NULL) table 132 maint/gnulib/lib/gl_linkedhash_set.c for (node = (gl_list_node_t) set->table[bucket]; table 157 maint/gnulib/lib/gl_linkedhash_set.c for (node = (gl_list_node_t) set->table[bucket]; table 178 maint/gnulib/lib/gl_linkedhash_set.c node->h.hash_next = set->table[bucket]; table 179 maint/gnulib/lib/gl_linkedhash_set.c set->table[bucket] = &node->h; table 206 maint/gnulib/lib/gl_linkedhash_set.c for (nodep = (gl_list_node_t *) &set->table[bucket]; table 253 maint/gnulib/lib/gl_linkedhash_set.c free (set->table); table 142 maint/gnulib/lib/hash.c hash_get_n_buckets (const Hash_table *table) table 144 maint/gnulib/lib/hash.c return table->n_buckets; table 148 maint/gnulib/lib/hash.c hash_get_n_buckets_used (const Hash_table *table) table 150 maint/gnulib/lib/hash.c return table->n_buckets_used; table 154 maint/gnulib/lib/hash.c hash_get_n_entries (const Hash_table *table) table 156 maint/gnulib/lib/hash.c return table->n_entries; table 160 maint/gnulib/lib/hash.c hash_get_max_bucket_length (const Hash_table *table) table 165 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 184 maint/gnulib/lib/hash.c hash_table_ok (const Hash_table *table) table 190 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 206 maint/gnulib/lib/hash.c if (n_buckets_used == table->n_buckets_used && n_entries == table->n_entries) table 213 maint/gnulib/lib/hash.c hash_print_statistics (const Hash_table *table, FILE *stream) table 215 maint/gnulib/lib/hash.c size_t n_entries = hash_get_n_entries (table); table 216 maint/gnulib/lib/hash.c size_t n_buckets = hash_get_n_buckets (table); table 217 maint/gnulib/lib/hash.c size_t n_buckets_used = hash_get_n_buckets_used (table); table 218 maint/gnulib/lib/hash.c size_t max_bucket_length = hash_get_max_bucket_length (table); table 232 maint/gnulib/lib/hash.c safe_hasher (const Hash_table *table, const void *key) table 234 maint/gnulib/lib/hash.c size_t n = table->hasher (key, table->n_buckets); table 235 maint/gnulib/lib/hash.c if (! (n < table->n_buckets)) table 237 maint/gnulib/lib/hash.c return table->bucket + n; table 241 maint/gnulib/lib/hash.c hash_lookup (const Hash_table *table, const void *entry) table 243 maint/gnulib/lib/hash.c struct hash_entry const *bucket = safe_hasher (table, entry); table 250 maint/gnulib/lib/hash.c if (entry == cursor->data || table->comparator (entry, cursor->data)) table 259 maint/gnulib/lib/hash.c hash_get_first (const Hash_table *table) table 263 maint/gnulib/lib/hash.c if (table->n_entries == 0) table 266 maint/gnulib/lib/hash.c for (bucket = table->bucket; ; bucket++) table 267 maint/gnulib/lib/hash.c if (! (bucket < table->bucket_limit)) table 274 maint/gnulib/lib/hash.c hash_get_next (const Hash_table *table, const void *entry) table 276 maint/gnulib/lib/hash.c struct hash_entry const *bucket = safe_hasher (table, entry); table 290 maint/gnulib/lib/hash.c while (++bucket < table->bucket_limit) table 299 maint/gnulib/lib/hash.c hash_get_entries (const Hash_table *table, void **buffer, table 306 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 323 maint/gnulib/lib/hash.c hash_do_for_each (const Hash_table *table, Hash_processor processor, table 330 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 464 maint/gnulib/lib/hash.c check_tuning (Hash_table *table) table 466 maint/gnulib/lib/hash.c const Hash_tuning *tuning = table->tuning; table 487 maint/gnulib/lib/hash.c table->tuning = &default_tuning; table 516 maint/gnulib/lib/hash.c Hash_table *table; table 523 maint/gnulib/lib/hash.c table = malloc (sizeof *table); table 524 maint/gnulib/lib/hash.c if (table == NULL) table 529 maint/gnulib/lib/hash.c table->tuning = tuning; table 530 maint/gnulib/lib/hash.c if (!check_tuning (table)) table 540 maint/gnulib/lib/hash.c table->n_buckets = compute_bucket_size (candidate, tuning); table 541 maint/gnulib/lib/hash.c if (!table->n_buckets) table 544 maint/gnulib/lib/hash.c table->bucket = calloc (table->n_buckets, sizeof *table->bucket); table 545 maint/gnulib/lib/hash.c if (table->bucket == NULL) table 547 maint/gnulib/lib/hash.c table->bucket_limit = table->bucket + table->n_buckets; table 548 maint/gnulib/lib/hash.c table->n_buckets_used = 0; table 549 maint/gnulib/lib/hash.c table->n_entries = 0; table 551 maint/gnulib/lib/hash.c table->hasher = hasher; table 552 maint/gnulib/lib/hash.c table->comparator = comparator; table 553 maint/gnulib/lib/hash.c table->data_freer = data_freer; table 555 maint/gnulib/lib/hash.c table->free_entry_list = NULL; table 557 maint/gnulib/lib/hash.c obstack_init (&table->entry_stack); table 559 maint/gnulib/lib/hash.c return table; table 562 maint/gnulib/lib/hash.c free (table); table 567 maint/gnulib/lib/hash.c hash_clear (Hash_table *table) table 571 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 581 maint/gnulib/lib/hash.c if (table->data_freer) table 582 maint/gnulib/lib/hash.c table->data_freer (cursor->data); table 588 maint/gnulib/lib/hash.c cursor->next = table->free_entry_list; table 589 maint/gnulib/lib/hash.c table->free_entry_list = cursor; table 593 maint/gnulib/lib/hash.c if (table->data_freer) table 594 maint/gnulib/lib/hash.c table->data_freer (bucket->data); table 600 maint/gnulib/lib/hash.c table->n_buckets_used = 0; table 601 maint/gnulib/lib/hash.c table->n_entries = 0; table 605 maint/gnulib/lib/hash.c hash_free (Hash_table *table) table 612 maint/gnulib/lib/hash.c if (table->data_freer && table->n_entries) table 614 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 619 maint/gnulib/lib/hash.c table->data_freer (cursor->data); table 626 maint/gnulib/lib/hash.c obstack_free (&table->entry_stack, NULL); table 631 maint/gnulib/lib/hash.c for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) table 641 maint/gnulib/lib/hash.c for (cursor = table->free_entry_list; cursor; cursor = next) table 650 maint/gnulib/lib/hash.c free (table->bucket); table 651 maint/gnulib/lib/hash.c free (table); table 660 maint/gnulib/lib/hash.c allocate_entry (Hash_table *table) table 664 maint/gnulib/lib/hash.c if (table->free_entry_list) table 666 maint/gnulib/lib/hash.c new = table->free_entry_list; table 667 maint/gnulib/lib/hash.c table->free_entry_list = new->next; table 672 maint/gnulib/lib/hash.c new = obstack_alloc (&table->entry_stack, sizeof *new); table 685 maint/gnulib/lib/hash.c free_entry (Hash_table *table, struct hash_entry *entry) table 688 maint/gnulib/lib/hash.c entry->next = table->free_entry_list; table 689 maint/gnulib/lib/hash.c table->free_entry_list = entry; table 699 maint/gnulib/lib/hash.c hash_find_entry (Hash_table *table, const void *entry, table 702 maint/gnulib/lib/hash.c struct hash_entry *bucket = safe_hasher (table, entry); table 712 maint/gnulib/lib/hash.c if (entry == bucket->data || table->comparator (entry, bucket->data)) table 725 maint/gnulib/lib/hash.c free_entry (table, next); table 740 maint/gnulib/lib/hash.c || table->comparator (entry, cursor->next->data)) table 751 maint/gnulib/lib/hash.c free_entry (table, next); table 844 maint/gnulib/lib/hash.c hash_rehash (Hash_table *table, size_t candidate) table 848 maint/gnulib/lib/hash.c size_t new_size = compute_bucket_size (candidate, table->tuning); table 852 maint/gnulib/lib/hash.c if (new_size == table->n_buckets) table 862 maint/gnulib/lib/hash.c new_table->tuning = table->tuning; table 863 maint/gnulib/lib/hash.c new_table->hasher = table->hasher; table 864 maint/gnulib/lib/hash.c new_table->comparator = table->comparator; table 865 maint/gnulib/lib/hash.c new_table->data_freer = table->data_freer; table 883 maint/gnulib/lib/hash.c new_table->entry_stack = table->entry_stack; table 885 maint/gnulib/lib/hash.c new_table->free_entry_list = table->free_entry_list; table 887 maint/gnulib/lib/hash.c if (transfer_entries (new_table, table, false)) table 890 maint/gnulib/lib/hash.c free (table->bucket); table 891 maint/gnulib/lib/hash.c table->bucket = new_table->bucket; table 892 maint/gnulib/lib/hash.c table->bucket_limit = new_table->bucket_limit; table 893 maint/gnulib/lib/hash.c table->n_buckets = new_table->n_buckets; table 894 maint/gnulib/lib/hash.c table->n_buckets_used = new_table->n_buckets_used; table 895 maint/gnulib/lib/hash.c table->free_entry_list = new_table->free_entry_list; table 913 maint/gnulib/lib/hash.c table->free_entry_list = new_table->free_entry_list; table 914 maint/gnulib/lib/hash.c if (! (transfer_entries (table, new_table, true) table 915 maint/gnulib/lib/hash.c && transfer_entries (table, new_table, false))) table 923 maint/gnulib/lib/hash.c hash_insert_if_absent (Hash_table *table, void const *entry, table 936 maint/gnulib/lib/hash.c if ((data = hash_find_entry (table, entry, &bucket, false)) != NULL) table 948 maint/gnulib/lib/hash.c if (table->n_buckets_used table 949 maint/gnulib/lib/hash.c > table->tuning->growth_threshold * table->n_buckets) table 953 maint/gnulib/lib/hash.c check_tuning (table); table 954 maint/gnulib/lib/hash.c if (table->n_buckets_used table 955 maint/gnulib/lib/hash.c > table->tuning->growth_threshold * table->n_buckets) table 957 maint/gnulib/lib/hash.c const Hash_tuning *tuning = table->tuning; table 960 maint/gnulib/lib/hash.c ? (table->n_buckets * tuning->growth_factor) table 961 maint/gnulib/lib/hash.c : (table->n_buckets * tuning->growth_factor table 968 maint/gnulib/lib/hash.c if (!hash_rehash (table, candidate)) table 972 maint/gnulib/lib/hash.c if (hash_find_entry (table, entry, &bucket, false) != NULL) table 981 maint/gnulib/lib/hash.c struct hash_entry *new_entry = allocate_entry (table); table 991 maint/gnulib/lib/hash.c table->n_entries++; table 998 maint/gnulib/lib/hash.c table->n_entries++; table 999 maint/gnulib/lib/hash.c table->n_buckets_used++; table 1005 maint/gnulib/lib/hash.c hash_insert (Hash_table *table, void const *entry) table 1008 maint/gnulib/lib/hash.c int err = hash_insert_if_absent (table, entry, &matched_ent); table 1015 maint/gnulib/lib/hash.c hash_remove (Hash_table *table, const void *entry) table 1020 maint/gnulib/lib/hash.c data = hash_find_entry (table, entry, &bucket, true); table 1024 maint/gnulib/lib/hash.c table->n_entries--; table 1027 maint/gnulib/lib/hash.c table->n_buckets_used--; table 1032 maint/gnulib/lib/hash.c if (table->n_buckets_used table 1033 maint/gnulib/lib/hash.c < table->tuning->shrink_threshold * table->n_buckets) table 1037 maint/gnulib/lib/hash.c check_tuning (table); table 1038 maint/gnulib/lib/hash.c if (table->n_buckets_used table 1039 maint/gnulib/lib/hash.c < table->tuning->shrink_threshold * table->n_buckets) table 1041 maint/gnulib/lib/hash.c const Hash_tuning *tuning = table->tuning; table 1044 maint/gnulib/lib/hash.c ? table->n_buckets * tuning->shrink_factor table 1045 maint/gnulib/lib/hash.c : (table->n_buckets * tuning->shrink_factor table 1048 maint/gnulib/lib/hash.c if (!hash_rehash (table, candidate)) table 1056 maint/gnulib/lib/hash.c struct hash_entry *cursor = table->free_entry_list; table 1064 maint/gnulib/lib/hash.c table->free_entry_list = NULL; table 1075 maint/gnulib/lib/hash.c hash_delete (Hash_table *table, const void *entry) table 1077 maint/gnulib/lib/hash.c return hash_remove (table, entry); table 1085 maint/gnulib/lib/hash.c hash_print (const Hash_table *table) table 1087 maint/gnulib/lib/hash.c struct hash_entry *bucket = (struct hash_entry *) table->bucket; table 1089 maint/gnulib/lib/hash.c for ( ; bucket < table->bucket_limit; bucket++) table 1094 maint/gnulib/lib/hash.c printf ("%lu:\n", (unsigned long int) (bucket - table->bucket)); table 63 maint/gnulib/lib/hash.h extern size_t hash_get_n_buckets (const Hash_table *table) table 67 maint/gnulib/lib/hash.h extern size_t hash_get_n_buckets_used (const Hash_table *table) table 71 maint/gnulib/lib/hash.h extern size_t hash_get_n_entries (const Hash_table *table) table 75 maint/gnulib/lib/hash.h extern size_t hash_get_max_bucket_length (const Hash_table *table) table 80 maint/gnulib/lib/hash.h extern bool hash_table_ok (const Hash_table *table) table 83 maint/gnulib/lib/hash.h extern void hash_print_statistics (const Hash_table *table, FILE *stream); table 87 maint/gnulib/lib/hash.h extern void *hash_lookup (const Hash_table *table, const void *entry); table 101 maint/gnulib/lib/hash.h extern void *hash_get_first (const Hash_table *table) table 107 maint/gnulib/lib/hash.h extern void *hash_get_next (const Hash_table *table, const void *entry); table 112 maint/gnulib/lib/hash.h extern size_t hash_get_entries (const Hash_table *table, void **buffer, table 124 maint/gnulib/lib/hash.h extern size_t hash_do_for_each (const Hash_table *table, table 146 maint/gnulib/lib/hash.h extern void hash_free (Hash_table *table); table 203 maint/gnulib/lib/hash.h extern void hash_clear (Hash_table *table); table 217 maint/gnulib/lib/hash.h extern bool hash_rehash (Hash_table *table, size_t candidate); table 225 maint/gnulib/lib/hash.h extern void *hash_insert (Hash_table *table, const void *entry); table 229 maint/gnulib/lib/hash.h extern void *hash_xinsert (Hash_table *table, const void *entry); table 247 maint/gnulib/lib/hash.h extern int hash_insert_if_absent (Hash_table *table, const void *entry, table 253 maint/gnulib/lib/hash.h extern void *hash_remove (Hash_table *table, const void *entry); table 258 maint/gnulib/lib/hash.h extern void *hash_delete (Hash_table *table, const void *entry); table 1030 maint/gnulib/lib/localcharset.c const struct table_entry * const table = alias_table; table 1042 maint/gnulib/lib/localcharset.c int cmp = strcmp (table[mid].alias, codeset); table 1051 maint/gnulib/lib/localcharset.c codeset = table[mid].canonical; table 1104 maint/gnulib/lib/localcharset.c const struct table_entry * const table = locale_table; table 1116 maint/gnulib/lib/localcharset.c int cmp = strcmp (table[mid].locale, locale); table 1125 maint/gnulib/lib/localcharset.c codeset = table[mid].canonical; table 49 maint/gnulib/lib/mbscasestr.c size_t *table; table 56 maint/gnulib/lib/mbscasestr.c table = (size_t *) (memory + m * sizeof (mbchar_t)); table 91 maint/gnulib/lib/mbscasestr.c table[1] = 1; table 110 maint/gnulib/lib/mbscasestr.c table[i] = i - ++j; table 119 maint/gnulib/lib/mbscasestr.c table[i] = i; table 133 maint/gnulib/lib/mbscasestr.c j = j - table[j]; table 171 maint/gnulib/lib/mbscasestr.c size_t count = table[j]; table 46 maint/gnulib/lib/mbsstr.c size_t *table; table 55 maint/gnulib/lib/mbsstr.c table = table_memory; table 86 maint/gnulib/lib/mbsstr.c table[1] = 1; table 105 maint/gnulib/lib/mbsstr.c table[i] = i - ++j; table 114 maint/gnulib/lib/mbsstr.c table[i] = i; table 128 maint/gnulib/lib/mbsstr.c j = j - table[j]; table 160 maint/gnulib/lib/mbsstr.c size_t count = table[j]; table 566 maint/gnulib/lib/mountlist.c char const *table = MOUNTED; table 568 maint/gnulib/lib/mountlist.c fp = setmntent (table, "r"); table 805 maint/gnulib/lib/mountlist.c char *table = "/etc/mnttab"; table 808 maint/gnulib/lib/mountlist.c fp = fopen (table, "re"); table 858 maint/gnulib/lib/mountlist.c const char *table = MNTTAB; table 866 maint/gnulib/lib/mountlist.c fp = fopen (table, "re"); table 903 maint/gnulib/lib/mountlist.c const char *table = MNTTAB; table 938 maint/gnulib/lib/mountlist.c fp = fopen (table, "re"); table 241 maint/gnulib/lib/parse-datetime.y table local_time_zone_table[3]; table 1008 maint/gnulib/lib/parse-datetime.y static table const meridian_table[] = table 1017 maint/gnulib/lib/parse-datetime.y static table const dst_table[] = table 1022 maint/gnulib/lib/parse-datetime.y static table const month_and_day_table[] = table 1051 maint/gnulib/lib/parse-datetime.y static table const time_units_table[] = table 1067 maint/gnulib/lib/parse-datetime.y static table const relative_time_table[] = table 1096 maint/gnulib/lib/parse-datetime.y static table const universal_time_zone_table[] = table 1109 maint/gnulib/lib/parse-datetime.y static table const time_zone_table[] = table 1168 maint/gnulib/lib/parse-datetime.y static table const military_table[] = table 1296 maint/gnulib/lib/parse-datetime.y static table const * _GL_ATTRIBUTE_PURE table 1299 maint/gnulib/lib/parse-datetime.y table const *tp; table 1345 maint/gnulib/lib/parse-datetime.y static table const * table 1351 maint/gnulib/lib/parse-datetime.y table const *tp; table 1505 maint/gnulib/lib/parse-datetime.y table const *tp; table 259 maint/gnulib/lib/physmem.c if (table (TBL_VMSTATS, 0, &vmstats, 1, sizeof (vmstats)) == 1) table 343 maint/gnulib/lib/regcomp.c const int32_t *table = (const int32_t *) table 346 maint/gnulib/lib/regcomp.c if (table[i] < 0) table 3380 maint/gnulib/lib/regcomp.c const int32_t *table, *indirect; table 3388 maint/gnulib/lib/regcomp.c table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB); table 3395 maint/gnulib/lib/regcomp.c idx1 = findidx (table, indirect, extra, &cp, -1); table 3406 maint/gnulib/lib/regcomp.c idx2 = findidx (table, indirect, extra, &cp, 1); table 806 maint/gnulib/lib/regex_internal.h const int32_t *table, *indirect; table 811 maint/gnulib/lib/regex_internal.h table = (const int32_t *) _NL_CURRENT (LC_COLLATE, _NL_COLLATE_TABLEMB); table 817 maint/gnulib/lib/regex_internal.h findidx (table, indirect, extra, &p, pstr->len - idx); table 3725 maint/gnulib/lib/regexec.c const int32_t *table, *indirect; table 3776 maint/gnulib/lib/regexec.c table = (const int32_t *) table 3784 maint/gnulib/lib/regexec.c int32_t idx = findidx (table, indirect, extra, &cp, elem_len); table 613 maint/gnulib/lib/setlocale.c search (const struct table_entry *table, size_t table_size, const char *string, table 625 maint/gnulib/lib/setlocale.c int cmp = strcmp (table[mid].code, string); table 641 maint/gnulib/lib/setlocale.c if (strcmp (table[i].code, string) < 0) table 653 maint/gnulib/lib/setlocale.c if (strcmp (table[i].code, string) > 0) table 1151 maint/gnulib/lib/setlocale.c size_t hi = sizeof (table) / sizeof (table[0]); table 1159 maint/gnulib/lib/setlocale.c int cmp = langcmp (table[mid], locale); table 1169 maint/gnulib/lib/setlocale.c if (mid > lo && langcmp (table[mid - 1], locale) >= 0) table 1171 maint/gnulib/lib/setlocale.c if (mid + 1 < hi && langcmp (table[mid + 1], locale) <= 0) table 1173 maint/gnulib/lib/setlocale.c return table[mid]; table 1380 maint/gnulib/lib/setlocale.c size_t hi = sizeof (table) / sizeof (table[0]); table 1388 maint/gnulib/lib/setlocale.c int cmp = terrcmp (table[mid], locale); table 1398 maint/gnulib/lib/setlocale.c if (mid > lo && terrcmp (table[mid - 1], locale) >= 0) table 1400 maint/gnulib/lib/setlocale.c if (mid + 1 < hi && terrcmp (table[mid + 1], locale) <= 0) table 1402 maint/gnulib/lib/setlocale.c return table[mid]; table 50 maint/gnulib/lib/str-kmp.h size_t *table = (size_t *) nmalloca (m, sizeof (size_t)); table 51 maint/gnulib/lib/str-kmp.h if (table == NULL) table 72 maint/gnulib/lib/str-kmp.h table[1] = 1; table 91 maint/gnulib/lib/str-kmp.h table[i] = i - ++j; table 100 maint/gnulib/lib/str-kmp.h table[i] = i; table 114 maint/gnulib/lib/str-kmp.h j = j - table[j]; table 146 maint/gnulib/lib/str-kmp.h rhaystack += table[j]; table 147 maint/gnulib/lib/str-kmp.h j -= table[j]; table 157 maint/gnulib/lib/str-kmp.h freea (table); table 51 maint/gnulib/lib/unictype.in.h const void *table; /* when generic is 0 */ table 18 maint/gnulib/lib/unictype/bitmap.h static inline int bitmap_lookup (const void *table, ucs4_t uc); table 28 maint/gnulib/lib/unictype/bitmap.h bitmap_lookup (const void *table, ucs4_t uc) table 31 maint/gnulib/lib/unictype/bitmap.h if (index1 < ((const int *) table)[0]) table 33 maint/gnulib/lib/unictype/bitmap.h int lookup1 = ((const int *) table)[1 + index1]; table 37 maint/gnulib/lib/unictype/bitmap.h int lookup2 = ((const short *) table)[lookup1 + index2]; table 41 maint/gnulib/lib/unictype/bitmap.h unsigned int lookup3 = ((const unsigned int *) table)[lookup2 + index3]; table 31 maint/gnulib/lib/unictype/categ_test.c return bitmap_lookup (category.lookup.table, uc); table 38 maint/gnulib/lib/xhash.c hash_xinsert (Hash_table *table, void const *entry) table 40 maint/gnulib/lib/xhash.c void *res = hash_insert (table, entry); table 34 maint/gnulib/tests/unictype/test-categ_byname.c : category1.lookup.table == category2.lookup.table));