set.c - OpenGrok cross reference for /third

Lines Matching defs:table
48  * free to avoid exponential performance degradation as the hash table fills
133    ht->table = rzalloc_array(mem_ctx, struct set_entry, ht->size);
137    return ht->table != NULL;
191    clone->table = ralloc_array(clone, struct set_entry, clone->size);
192    if (clone->table == NULL) {
197    memcpy(clone->table, set->table, clone->size * sizeof(struct set_entry));
219    ralloc_free(ht->table);
227    memset(ht->table, 0, sizeof(struct set_entry) * hash_sizes[ht->size_index].size);
246       for (entry = set->table; entry != set->table + set->size; entry++) {
274       struct set_entry *entry = ht->table + hash_address;
317       struct set_entry *entry = ht->table + hash_address;
334    struct set_entry *table;
345    table = rzalloc_array(ralloc_parent(ht->table), struct set_entry,
347    if (table == NULL)
352    ht->table = table;
368    ralloc_free(old_ht.table);
389  * Note that insertion may rearrange the table on a resize or rehash,
411       struct set_entry *entry = ht->table + hash_address;
453  * Inserts the key with the given hash into the table.
455  * Note that insertion may rearrange the table on a resize or rehash,
471     * Note that the hash table doesn't have a delete callback.  If freeing of
538  * This function deletes the given hash table entry.
540  * Note that deletion doesn't otherwise modify the table, so an iteration over
541  * the table deleting entries is safe.
575       entry = ht->table;
578    if (entry != ht->table + ht->size)
585  * This function is an iterator over the hash table.
588  * an iteration over the table is O(table_size) not O(entries).
594       entry = ht->table;
598    for (; entry != ht->table + ht->size; entry++) {
617    for (entry = ht->table + i; entry != ht->table + ht->size; entry++) {
624    for (entry = ht->table; entry != ht->table + i; entry++) {