1 /* Copyright (C) 2008 Jeffrey Brian Arnold <jbarnold@mit.edu>
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License, version 2.
6 * This program is distributed in the hope that it will be useful,
7 * but WITHOUT ANY WARRANTY; without even the implied warranty of
8 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
9 * GNU General Public License for more details.
11 * You should have received a copy of the GNU General Public License
12 * along with this program; if not, write to the Free Software
13 * Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
17 #include "objcommon.h"
19 void vec_do_reserve(void **data
, size_t *mem_size
, size_t new_size
)
21 if (new_size
> *mem_size
|| new_size
* 2 < *mem_size
) {
22 if (new_size
< *mem_size
* 2)
23 new_size
= *mem_size
* 2;
24 *data
= realloc(*data
, new_size
);
25 assert(new_size
== 0 || *data
!= NULL
);
30 void get_syms(bfd
*abfd
, struct asymbolp_vec
*syms
)
32 long storage_needed
= bfd_get_symtab_upper_bound(abfd
);
33 if (storage_needed
== 0)
35 assert(storage_needed
>= 0);
38 vec_reserve(syms
, storage_needed
);
39 vec_resize(syms
, bfd_canonicalize_symtab(abfd
, syms
->data
));
40 assert(syms
->size
>= 0);
43 struct supersect
*fetch_supersect(bfd
*abfd
, asection
*sect
,
44 struct asymbolp_vec
*syms
)
46 if (sect
->userdata
!= NULL
)
47 return sect
->userdata
;
49 struct supersect
*new = malloc(sizeof(*new));
52 new->name
= malloc(strlen(sect
->name
) + 1);
53 strcpy(new->name
, sect
->name
);
55 vec_init(&new->contents
);
56 vec_resize(&new->contents
, bfd_get_section_size(sect
));
57 assert(bfd_get_section_contents
58 (abfd
, sect
, new->contents
.data
, 0, new->contents
.size
));
59 new->alignment
= bfd_get_section_alignment(abfd
, sect
);
61 vec_init(&new->relocs
);
62 vec_reserve(&new->relocs
, bfd_get_reloc_upper_bound(abfd
, sect
));
63 vec_resize(&new->relocs
,
64 bfd_canonicalize_reloc(abfd
, sect
, new->relocs
.data
,
66 assert(new->relocs
.size
>= 0);
71 struct supersect
*new_supersects
= NULL
;
73 struct supersect
*new_supersect(char *name
)
76 for (ss
= new_supersects
; ss
!= NULL
; ss
= ss
->next
) {
77 if (strcmp(name
, ss
->name
) == 0)
81 struct supersect
*new = malloc(sizeof(*new));
84 new->next
= new_supersects
;
87 vec_init(&new->contents
);
89 vec_init(&new->relocs
);
94 void *sect_do_grow(struct supersect
*ss
, size_t n
, size_t size
, int alignment
)
96 if (ss
->alignment
< ffs(alignment
) - 1)
97 ss
->alignment
= ffs(alignment
) - 1;
98 int pad
= ss
->contents
.size
- align(ss
->contents
.size
, alignment
);
99 memset(vec_grow(&ss
->contents
, pad
), 0, pad
);
100 return vec_grow(&ss
->contents
, n
* size
);
103 int label_offset(const char *sym_name
)
107 sym_name
[i
] != 0 && sym_name
[i
+ 1] != 0 && sym_name
[i
+ 2] != 0
108 && sym_name
[i
+ 3] != 0; i
++) {
109 if (sym_name
[i
] == '_' && sym_name
[i
+ 1] == '_'
110 && sym_name
[i
+ 2] == '_' && sym_name
[i
+ 3] == '_')
116 const char *only_label(const char *sym_name
)
118 int offset
= label_offset(sym_name
);
121 return &sym_name
[offset
];
124 const char *dup_wolabel(const char *sym_name
)
126 int offset
, entire_strlen
, label_strlen
, new_strlen
;
129 offset
= label_offset(sym_name
);
133 label_strlen
= strlen(&sym_name
[offset
]) + strlen("____");
135 entire_strlen
= strlen(sym_name
);
136 new_strlen
= entire_strlen
- label_strlen
;
137 newstr
= malloc(new_strlen
+ 1);
138 memcpy(newstr
, sym_name
, new_strlen
);
139 newstr
[new_strlen
] = 0;