Home
last modified time | relevance | path

Searched refs:table (Results 1 – 4 of 4) sorted by relevance

/elf/
A Dstringtable.c29 table->count = 0; in stringtable_init()
35 table->allocated = 128; in stringtable_init()
37 table->entries = xcalloc (table->allocated, sizeof (table->entries[0])); in stringtable_init()
76 free (table->entries); in stringtable_rehash()
85 if (table->allocated == 0) in stringtable_add()
86 stringtable_init (table); in stringtable_add()
95 = table->entries[hash & (table->allocated - 1)]; in stringtable_add()
104 if (table->count * 3 > table->allocated * 2) in stringtable_add()
108 ++table->count; in stringtable_add()
113 table->entries[index] = e; in stringtable_add()
[all …]
A Dstringtable_free.c22 stringtable_free (struct stringtable *table) in stringtable_free() argument
24 for (uint32_t i = 0; i < table->allocated; ++i) in stringtable_free()
25 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_free()
31 free (table->entries); in stringtable_free()
32 *table = (struct stringtable) { 0, }; in stringtable_free()
A Dstringtable.h43 struct stringtable_entry *stringtable_add (struct stringtable *table,
56 void stringtable_finalize (struct stringtable *table,
62 void stringtable_free (struct stringtable *table);
A Ddl-lookup.c166 enter_unique_sym (struct unique_sym *table, size_t size, in enter_unique_sym() argument
172 while (table[idx].name != NULL) in enter_unique_sym()
179 table[idx].hashval = hash; in enter_unique_sym()
180 table[idx].name = name; in enter_unique_sym()
181 table[idx].sym = sym; in enter_unique_sym()
182 table[idx].map = map; in enter_unique_sym()

Completed in 8 milliseconds