Lines Matching defs:table
287 /* We keep a hash table which maps strings to numbers. We use it to
294 /* FDR index or string table offset. */
296 /* Next entry in string table. */
302 struct bfd_hash_table table;
305 /* Routine to create an entry in a string hash table. */
308 string_hash_newfunc (entry, table, string)
310 struct bfd_hash_table *table;
319 bfd_hash_allocate (table, sizeof (struct string_hash_entry)));
325 bfd_hash_newfunc ((struct bfd_hash_entry *) ret, table, string));
337 /* Look up an entry in an string hash table. */
341 bfd_hash_lookup (&(t)->table, (string), (create), (copy)))
374 /* The FDR hash table. */
376 /* The strings hash table. */
491 /* Initialize the FDR hash table. This returns a handle which is then
507 if (!bfd_hash_table_init_n (&ainfo->fdr_hash.table, string_hash_newfunc,
534 if (!bfd_hash_table_init (&ainfo->str_hash.table, string_hash_newfunc,
538 /* The first entry in the string table is the empty string. */
564 bfd_hash_table_free (&ainfo->fdr_hash.table);
567 bfd_hash_table_free (&ainfo->str_hash.table);
689 we look it up in a hash table to ensure that we only include it
690 once. We keep a table mapping FDR numbers to the final number
854 the local symbol table together. This reduces the amount
868 /* Hash the name into the string table. */
941 how much of the string table to read in. */
1047 /* Point this FDR at the table of RFD's we created. */
1655 /* The string table is written out from the hash table if this is a
1777 looking up an FDR by address, we build a table covering all FDRs
1779 table will be sorted by address so we can look it up via binary
1800 /* First, let's see how long the table needs to be. */
1808 /* Now, create and fill in the table. */
1862 /* Finally, the table is sorted in increasing memory-address order.
1863 The table is mostly sorted already, but there are cases (e.g.,
1913 /* eraxxon: There may be multiple FDRs in the table with the
1940 /* Build FDR table (sorted by object file's base-address) if we
1980 the FDR table in 'mk_fdrtab'. But, besides not knowing for certain
1983 symbol -- which is still in the symbol table -- the result can be
1985 procedures with vma's higher than the last FDR in the fdr table will be
1991 Probably, a better solution would be to have a sorted PDR table. Each
1993 obtained. A FDR table could still be constructed if necessary -- since
1995 the PDR table would be searched to locate debugging info.
2011 The symbol table for PDR4 does contain symbols for PDRa-f, but so does
2012 the symbol table for FDR3. However the former is different; perhaps this
2017 excluded from the FDR table in 'mk_fdrtab' because it contains no PDRs.
2089 On the first call to this function, we build a table of FDRs
2102 through the line-number table to lookup the line-number that
2523 /* Copy the string table into a memory buffer. */
2534 /* The string table is written out from the hash table if this is a