Home
last modified time | relevance | path

Searched refs:entries (Results 1 – 7 of 7) sorted by relevance

/elf/
A Dtst-stringtable.c103 struct stringtable_entry *entries[2 * count]; in do_test() local
108 entries[i] = stringtable_add (&s, strings[i]); in do_test()
109 TEST_COMPARE (entries[i]->length, strlen (strings[i])); in do_test()
110 TEST_COMPARE_STRING (entries[i]->string, strings[i]); in do_test()
112 entries[i + count] = stringtable_add (&s, strings[i + count]); in do_test()
122 TEST_COMPARE (entries[i]->length, strlen (strings[i])); in do_test()
123 TEST_COMPARE_STRING (entries[i]->string, strings[i]); in do_test()
148 struct stringtable_entry *entries[array_length (strings)]; in do_test() local
150 entries[i] = stringtable_add (&s, strings[i]); in do_test()
152 TEST_COMPARE_STRING (entries[i]->string, strings[i]); in do_test()
[all …]
A Dstringtable_free.c25 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_free()
31 free (table->entries); in stringtable_free()
A Dstringtable.c37 table->entries = xcalloc (table->allocated, sizeof (table->entries[0])); in stringtable_init()
62 = xcalloc (new_allocated, sizeof (table->entries[0])); in stringtable_rehash()
66 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_rehash()
76 free (table->entries); in stringtable_rehash()
77 table->entries = new_entries; in stringtable_rehash()
95 = table->entries[hash & (table->allocated - 1)]; in stringtable_add()
112 e->next = table->entries[index]; in stringtable_add()
113 table->entries[index] = e; in stringtable_add()
164 for (struct stringtable_entry *e = table->entries[i]; e != NULL; in stringtable_finalize()
205 for (struct stringtable_entry *e = table->entries[i]; e != NULL; in stringtable_finalize()
A Ddl-lookup.c226 struct unique_sym *entries = tab->entries; in do_lookup_unique() local
228 if (entries != NULL) in do_lookup_unique()
247 result->s = entries[idx].sym; in do_lookup_unique()
254 if (entries[idx].name == NULL) in do_lookup_unique()
280 if (entries[idx].name != NULL) in do_lookup_unique()
282 entries[idx].name, entries[idx].sym, in do_lookup_unique()
285 tab->free (entries); in do_lookup_unique()
288 entries = tab->entries = newentries; in do_lookup_unique()
315 if (entries == NULL) in do_lookup_unique()
318 tab->entries = entries; in do_lookup_unique()
[all …]
A Dstringtable.h37 struct stringtable_entry **entries; /* Array of hash table buckets. */ member
A Dcache.c159 static struct cache_entry *entries; variable
432 entries = NULL; in init_cache()
582 for (entry = entries; entry != NULL; entry = entry->next) in save_cache()
783 while (entries) in save_cache()
785 entry = entries; in save_cache()
786 entries = entries->next; in save_cache()
833 struct cache_entry *ptr = entries; in add_to_cache()
834 struct cache_entry *prev = entries; in add_to_cache()
843 if (ptr == entries) in add_to_cache()
845 new_entry->next = entries; in add_to_cache()
[all …]
A Ddl-close.c634 struct unique_sym *entries = tab->entries; in _dl_close_worker() local
635 if (entries != NULL) in _dl_close_worker()
642 if (entries[idx].name != NULL in _dl_close_worker()
643 && entries[idx].map == imap) in _dl_close_worker()
645 entries[idx].name = NULL; in _dl_close_worker()
646 entries[idx].hashval = 0; in _dl_close_worker()

Completed in 13 milliseconds