Lines Matching refs:root
61 struct bfd_hash_entry root;
72 struct bfd_hash_table root;
88 bfd_hash_lookup (&(table)->root, (string), (create), (copy)))
94 (&(table)->root, \
151 return &ret->root;
168 if (!bfd_hash_table_init (&cref_table.root, cref_hash_newfunc,
184 r = (struct cref_ref *) bfd_hash_allocate (&cref_table.root, sizeof *r);
220 for (i = 0; i < cref_table.root.size; i++)
226 for (p = cref_table.root.table[i]; p != NULL; p = p->next)
228 entsize += cref_table.root.entsize;
235 tabsize = cref_table.root.size * sizeof (struct bfd_hash_entry *);
238 alloc_mark = bfd_hash_allocate (&cref_table.root, 1);
242 memcpy (old_tab, cref_table.root.table, tabsize);
245 old_table = cref_table.root.table;
246 old_size = cref_table.root.size;
247 old_count = cref_table.root.count;
250 for (i = 0; i < cref_table.root.size; i++)
256 for (p = cref_table.root.table[i]; p != NULL; p = p->next)
258 memcpy (old_ent, p, cref_table.root.entsize);
259 old_ent = (char *) old_ent + cref_table.root.entsize;
279 bfd_hash_table_free (&cref_table.root);
286 cref_table.root.table = old_table;
287 cref_table.root.size = old_size;
288 cref_table.root.count = old_count;
289 memcpy (cref_table.root.table, old_tab, tabsize);
292 for (i = 0; i < cref_table.root.size; i++)
298 for (p = cref_table.root.table[i]; p != NULL; p = p->next)
300 memcpy (p, old_ent, cref_table.root.entsize);
301 old_ent = (char *) old_ent + cref_table.root.entsize;
311 objalloc_free_block ((struct objalloc *) cref_table.root.memory,
332 h->demangled = bfd_demangle (link_info.output_bfd, h->root.string,
335 h->demangled = h->root.string;
357 return strcmp ((*p1)->root.string, (*p2)->root.string);
410 hl = bfd_link_hash_lookup (link_info.hash, h->root.string, FALSE,
414 h->root.string);
442 fprintf (fp, "%s ", h->root.string);
443 len = strlen (h->root.string) + 1;
555 hl = bfd_link_hash_lookup (link_info.hash, h->root.string, FALSE,
560 h->root.string);
577 check_refs (hl->root.string, TRUE, hl->u.def.section,
