Lines Matching defs:string
105 bfd_byte e_strx[2]; /* Index into string table of name. */
140 #include <string.h> /* For strchr and friends. */
230 /* String table. */
581 /* The file offsets of the string table and symbol table. */
1244 /* Skip space for the string count in the buffer for convenience
1252 /* Ensure that a zero index yields an empty string. */
1465 of bytes in the string table but is to be interpreted as the
1466 null string. For the dynamic symbols, the number of bytes in
1467 the string table is stored in the __DYNAMIC structure and the
1468 zero index points at an actual string. */
1556 out a particular string once. This helps particularly when the
1564 /* Get the index of a string in a strtab, adding it if it is not
1576 /* An index of 0 always means the empty string. */
1581 doesn't understand a hashed string table. */
1590 space taken up by the string table size. */
1604 /* The string table starts with the size. */
2427 const char *string)
2440 _bfd_link_hash_newfunc ((struct bfd_hash_entry *) ret, table, string);
2788 const char *string;
2797 string = NULL;
2844 (info, abfd, name, flags, section, value, string, copy, FALSE,
2875 #define aout_link_includes_lookup(table, string, create, copy) \
2877 bfd_hash_lookup (&(table)->root, (string), (create), (copy)))
2884 const char *string)
2899 bfd_hash_newfunc ((struct bfd_hash_entry *) ret, table, string));
2947 && bfd_hash_lookup (flaginfo->info->keep_hash, h->root.root.string,
3002 indx = add_to_stringtab (output_bfd, flaginfo->strtab, h->root.root.string,
3475 name = h->root.root.string;
3789 /* We accumulate the string table as we write out the symbols. */
3956 /* Write out the string table, unless there are no symbols. */
4106 name = h->root.root.string;
4437 /* name points into a string table which we are going to
4438 free. If there is a hash table entry, use that string.
4441 name = h->root.root.string;
