2018-04-17 Nick Clifton <nickc@redhat.com>
+ PR 23055
+ * aoutx.h (find_nearest_line): Check that the symbol name exists
+ and is long enough, before attempting to see if it is for a .o
+ file.
+ * hash.c (bfd_hash_hash): Add an assertion that the string is not
+ NULL.
+ * linker.c (bfd_link_hash_lookup): Fail if the table or string are
+ NULL.
+ (_bfd_generic_link_add_archive_symbols): Fail if an archive entry
+ has no name.
+
PR 23065
* dwarf2.c (concat_filename): Check for a NULL table pointer.
const char *symname;
symname = q->symbol.name;
- if (strcmp (symname + strlen (symname) - 2, ".o") == 0)
+
+ if (symname != NULL
+ && strlen (symname) > 2
+ && strcmp (symname + strlen (symname) - 2, ".o") == 0)
{
if (q->symbol.value > low_line_vma)
{
case N_FUN:
{
/* We'll keep this if it is nearer than the one we have already. */
- if (q->symbol.value >= low_func_vma &&
- q->symbol.value <= offset)
+ if (q->symbol.value >= low_func_vma
+ && q->symbol.value <= offset)
{
low_func_vma = q->symbol.value;
func = (asymbol *)q;
unsigned int len;
unsigned int c;
+ BFD_ASSERT (string != NULL);
hash = 0;
len = 0;
s = (const unsigned char *) string;
{
struct bfd_link_hash_entry *ret;
+ if (table == NULL || string == NULL)
+ return NULL;
+
ret = ((struct bfd_link_hash_entry *)
bfd_hash_lookup (&table->table, string, create, copy));
continue;
}
+ if (arsym->name == NULL)
+ goto error_return;
+
h = bfd_link_hash_lookup (info->hash, arsym->name,
FALSE, FALSE, TRUE);