| sparclinux.c (94536) | sparclinux.c (104834) |
|---|---|
| 1/* BFD back-end for linux flavored sparc a.out binaries. 2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 2000, 2001, 2002 3 Free Software Foundation, Inc. 4 5This file is part of BFD, the Binary File Descriptor library. 6 7This program is free software; you can redistribute it and/or modify 8it under the terms of the GNU General Public License as published by --- 216 unchanged lines hidden (view full) --- 225 226static struct bfd_link_hash_table * 227linux_link_hash_table_create (abfd) 228 bfd *abfd; 229{ 230 struct linux_link_hash_table *ret; 231 bfd_size_type amt = sizeof (struct linux_link_hash_table); 232 | 1/* BFD back-end for linux flavored sparc a.out binaries. 2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 2000, 2001, 2002 3 Free Software Foundation, Inc. 4 5This file is part of BFD, the Binary File Descriptor library. 6 7This program is free software; you can redistribute it and/or modify 8it under the terms of the GNU General Public License as published by --- 216 unchanged lines hidden (view full) --- 225 226static struct bfd_link_hash_table * 227linux_link_hash_table_create (abfd) 228 bfd *abfd; 229{ 230 struct linux_link_hash_table *ret; 231 bfd_size_type amt = sizeof (struct linux_link_hash_table); 232 |
| 233 ret = (struct linux_link_hash_table *) bfd_alloc (abfd, amt); | 233 ret = (struct linux_link_hash_table *) bfd_malloc (amt); |
| 234 if (ret == (struct linux_link_hash_table *) NULL) 235 return (struct bfd_link_hash_table *) NULL; 236 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd, 237 linux_link_hash_newfunc)) 238 { 239 free (ret); 240 return (struct bfd_link_hash_table *) NULL; 241 } --- 352 unchanged lines hidden (view full) --- 594 595 /* Allocate memory for our fixup table. We will fill it in later. */ 596 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 597 ".linux-dynamic"); 598 if (s != NULL) 599 { 600 s->_raw_size = linux_hash_table (info)->fixup_count + 1; 601 s->_raw_size *= 8; | 234 if (ret == (struct linux_link_hash_table *) NULL) 235 return (struct bfd_link_hash_table *) NULL; 236 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd, 237 linux_link_hash_newfunc)) 238 { 239 free (ret); 240 return (struct bfd_link_hash_table *) NULL; 241 } --- 352 unchanged lines hidden (view full) --- 594 595 /* Allocate memory for our fixup table. We will fill it in later. */ 596 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 597 ".linux-dynamic"); 598 if (s != NULL) 599 { 600 s->_raw_size = linux_hash_table (info)->fixup_count + 1; 601 s->_raw_size *= 8; |
| 602 s->contents = (bfd_byte *) bfd_alloc (output_bfd, s->_raw_size); | 602 s->contents = (bfd_byte *) bfd_zalloc (output_bfd, s->_raw_size); |
| 603 if (s->contents == NULL) 604 return false; | 603 if (s->contents == NULL) 604 return false; |
| 605 memset (s->contents, 0, (size_t) s->_raw_size); | |
| 606 } 607 608 return true; 609} 610 611/* We come here once we are ready to actually write the fixup table to 612 the output file. Scan the fixup tables and so forth and generate 613 the stuff we need. */ --- 168 unchanged lines hidden --- | 605 } 606 607 return true; 608} 609 610/* We come here once we are ready to actually write the fixup table to 611 the output file. Scan the fixup tables and so forth and generate 612 the stuff we need. */ --- 168 unchanged lines hidden --- |