Searched refs:buckets (Results 1 - 6 of 6) sorted by relevance

/haiku-fatelf/src/bin/gdb/gdb/
H A Ddictionary.c138 struct symbol **buckets; member in struct:dictionary_hashed
143 /* How many buckets we currently have. */
145 struct symbol **buckets; member in struct:dictionary_hashed_expandable
147 when to add more buckets. */
188 #define DICT_HASHED_BUCKETS(d) (d)->data.hashed.buckets
206 /* This calculates the number of buckets we'll use in a hashtable,
357 struct symbol **buckets; local
372 buckets = obstack_alloc (obstack, nbuckets * sizeof (struct symbol *));
373 memset (buckets, 0, nbuckets * sizeof (struct symbol *));
374 DICT_HASHED_BUCKETS (retval) = buckets;
675 struct symbol **buckets = DICT_HASHED_BUCKETS (dict); local
[all...]
H A Dinfttrace.c2359 memory_page_t buckets[MEMORY_PAGE_DICTIONARY_BUCKET_COUNT];
2378 memory_page_dictionary.buckets[i].page_start = (CORE_ADDR) 0;
2379 memory_page_dictionary.buckets[i].reference_count = 0;
2380 memory_page_dictionary.buckets[i].next = NULL;
2381 memory_page_dictionary.buckets[i].previous = NULL;
2470 page = memory_page_dictionary.buckets[bucket].next;
2495 page = memory_page_dictionary.buckets[bucket].next;
5181 page = &memory_page_dictionary.buckets[bucket];
2347 memory_page_t buckets[MEMORY_PAGE_DICTIONARY_BUCKET_COUNT]; member in struct:__anon3743
/haiku-fatelf/src/bin/bash/
H A Dhashlib.c43 /* Make a new hash table with BUCKETS number of buckets. Initialize
46 hash_create (buckets)
47 int buckets;
53 if (buckets == 0)
54 buckets = DEFAULT_HASH_BUCKETS;
57 (BUCKET_CONTENTS **)xmalloc (buckets * sizeof (BUCKET_CONTENTS *));
58 new_table->nbuckets = buckets;
61 for (i = 0; i < buckets; i++)
355 fprintf (stderr, "%s: %d buckets; %d items\n", name, table->nbuckets, table->nentries);
/haiku-fatelf/src/bin/diffutils/src/
H A Dio.c52 /* Hash-table: array of buckets, each being a chain of equivalence classes.
53 buckets[-1] is reserved for incomplete lines. */ variable
54 static lin *buckets;
56 /* Number of buckets in the hash table array, not counting buckets[-1]. */
390 bucket = &buckets[h % nbuckets];
398 put the line into buckets[-1]. */
400 bucket = &buckets[-1];
842 /* Allocate (one plus) a prime number of hash buckets. Use a prime
848 if (PTRDIFF_MAX / sizeof *buckets <
[all...]
/haiku-fatelf/src/bin/gdb/bfd/
H A Delf32-xtensa.c4340 value_map **buckets;
4424 values->buckets = (value_map **)
4426 if (values->buckets == NULL)
4440 free (table->buckets);
4490 bucket = map->buckets[idx];
4525 bucket_p = &map->buckets[idx];
4325 value_map **buckets; member in struct:value_map_hash_table_struct
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxmlschemas.c201 * Macros for schema buckets.
284 ( (WXS_CONSTRUCTOR((ctx))->buckets != NULL) && \
285 (WXS_CONSTRUCTOR((ctx))->buckets->nbItems > 0) )
566 xmlSchemaItemListPtr buckets; /* List of schema buckets. */ member in struct:_xmlSchemaConstructionCtxt
3556 * For each following import buckets an xmlSchema will be created.
3642 * Add to list of all buckets; this is used for lookup
3645 if (xmlSchemaItemListAdd(WXS_CONSTRUCTOR(pctxt)->buckets, ret) == -1)
4092 * the schema buckets.
4122 /* Never free the doc here, since this will be done by the buckets
[all...]

Completed in 285 milliseconds