Lines Matching defs:string
582 /* The file offsets of the string table and symbol table. */
1359 /* Skip space for the string count in the buffer for convenience
1369 /* Ensure that a zero index yields an empty string. */
1705 of bytes in the string table but is to be interpreted as the
1706 null string. For the dynamic symbols, the number of bytes in
1707 the string table is stored in the __DYNAMIC structure and the
1708 zero index points at an actual string. */
1798 out a particular string once. This helps particularly when the
1806 /* Get the index of a string in a strtab, adding it if it is not
1818 /* An index of 0 always means the empty string. */
1823 doesn't understand a hashed string table. */
1832 space taken up by the string table size. */
1847 /* The string table starts with the size. */
2889 const char *string)
2904 table, string));
3009 const char *string;
3022 string = NULL;
3077 string = strings + GET_WORD (abfd, p->e_strx);
3109 string = name;
3140 (info, abfd, name, flags, section, value, string, copy, FALSE,
3503 #define aout_link_includes_lookup(table, string, create, copy) \
3505 bfd_hash_lookup (&(table)->root, (string), (create), (copy)))
3520 /* String table. */
3539 const char *string)
3554 bfd_hash_newfunc ((struct bfd_hash_entry *) ret, table, string));
3607 && bfd_hash_lookup (flaginfo->info->keep_hash, h->root.root.string,
3665 indx = add_to_stringtab (output_bfd, flaginfo->strtab, h->root.root.string,
4229 name = h->root.root.string;
4636 name = h->root.root.string;
4896 name = h->root.root.string;
5229 /* name points into a string table which we are going to
5230 free. If there is a hash table entry, use that string.
5233 name = h->root.root.string;
5459 /* We accumulate the string table as we write out the symbols. */
5628 /* Write out the string table, unless there are no symbols. */
