1 /* ELF strtab with GC and suffix merging support.
2 Copyright 2001, 2002, 2003 Free Software Foundation, Inc.
3 Written by Jakub Jelinek <jakub@redhat.com>.
5 This file is part of BFD, the Binary File Descriptor library.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
26 #include "libiberty.h"
28 /* An entry in the strtab hash table. */
30 struct elf_strtab_hash_entry
32 struct bfd_hash_entry root
;
33 /* Length of this entry. This includes the zero terminator. */
35 unsigned int refcount
;
37 /* Index within the merged section. */
39 /* Entry this is a suffix of (if len < 0). */
40 struct elf_strtab_hash_entry
*suffix
;
44 /* The strtab hash table. */
46 struct elf_strtab_hash
48 struct bfd_hash_table table
;
49 /* Next available index. */
51 /* Number of array entries alloced. */
52 bfd_size_type alloced
;
53 /* Final strtab size. */
54 bfd_size_type sec_size
;
55 /* Array of pointers to strtab entries. */
56 struct elf_strtab_hash_entry
**array
;
59 /* Routine to create an entry in a section merge hashtab. */
61 static struct bfd_hash_entry
*
62 elf_strtab_hash_newfunc (struct bfd_hash_entry
*entry
,
63 struct bfd_hash_table
*table
,
66 /* Allocate the structure if it has not already been allocated by a
69 entry
= bfd_hash_allocate (table
, sizeof (struct elf_strtab_hash_entry
));
73 /* Call the allocation method of the superclass. */
74 entry
= bfd_hash_newfunc (entry
, table
, string
);
78 /* Initialize the local fields. */
79 struct elf_strtab_hash_entry
*ret
;
81 ret
= (struct elf_strtab_hash_entry
*) entry
;
90 /* Create a new hash table. */
92 struct elf_strtab_hash
*
93 _bfd_elf_strtab_init (void)
95 struct elf_strtab_hash
*table
;
96 bfd_size_type amt
= sizeof (struct elf_strtab_hash
);
98 table
= bfd_malloc (amt
);
102 if (! bfd_hash_table_init (&table
->table
, elf_strtab_hash_newfunc
))
111 amt
= sizeof (struct elf_strtab_hasn_entry
*);
112 table
->array
= bfd_malloc (table
->alloced
* amt
);
113 if (table
->array
== NULL
)
119 table
->array
[0] = NULL
;
127 _bfd_elf_strtab_free (struct elf_strtab_hash
*tab
)
129 bfd_hash_table_free (&tab
->table
);
134 /* Get the index of an entity in a hash table, adding it if it is not
138 _bfd_elf_strtab_add (struct elf_strtab_hash
*tab
,
142 register struct elf_strtab_hash_entry
*entry
;
144 /* We handle this specially, since we don't want to do refcounting
149 BFD_ASSERT (tab
->sec_size
== 0);
150 entry
= (struct elf_strtab_hash_entry
*)
151 bfd_hash_lookup (&tab
->table
, str
, TRUE
, copy
);
154 return (bfd_size_type
) -1;
159 entry
->len
= strlen (str
) + 1;
160 /* 2G strings lose. */
161 BFD_ASSERT (entry
->len
> 0);
162 if (tab
->size
== tab
->alloced
)
164 bfd_size_type amt
= sizeof (struct elf_strtab_hash_entry
*);
166 tab
->array
= bfd_realloc (tab
->array
, tab
->alloced
* amt
);
167 if (tab
->array
== NULL
)
168 return (bfd_size_type
) -1;
171 entry
->u
.index
= tab
->size
++;
172 tab
->array
[entry
->u
.index
] = entry
;
174 return entry
->u
.index
;
178 _bfd_elf_strtab_addref (struct elf_strtab_hash
*tab
, bfd_size_type idx
)
180 if (idx
== 0 || idx
== (bfd_size_type
) -1)
182 BFD_ASSERT (tab
->sec_size
== 0);
183 BFD_ASSERT (idx
< tab
->size
);
184 ++tab
->array
[idx
]->refcount
;
188 _bfd_elf_strtab_delref (struct elf_strtab_hash
*tab
, bfd_size_type idx
)
190 if (idx
== 0 || idx
== (bfd_size_type
) -1)
192 BFD_ASSERT (tab
->sec_size
== 0);
193 BFD_ASSERT (idx
< tab
->size
);
194 BFD_ASSERT (tab
->array
[idx
]->refcount
> 0);
195 --tab
->array
[idx
]->refcount
;
199 _bfd_elf_strtab_clear_all_refs (struct elf_strtab_hash
*tab
)
203 for (idx
= 1; idx
< tab
->size
; ++idx
)
204 tab
->array
[idx
]->refcount
= 0;
208 _bfd_elf_strtab_size (struct elf_strtab_hash
*tab
)
210 return tab
->sec_size
? tab
->sec_size
: tab
->size
;
214 _bfd_elf_strtab_offset (struct elf_strtab_hash
*tab
, bfd_size_type idx
)
216 struct elf_strtab_hash_entry
*entry
;
220 BFD_ASSERT (idx
< tab
->size
);
221 BFD_ASSERT (tab
->sec_size
);
222 entry
= tab
->array
[idx
];
223 BFD_ASSERT (entry
->refcount
> 0);
225 return tab
->array
[idx
]->u
.index
;
229 _bfd_elf_strtab_emit (register bfd
*abfd
, struct elf_strtab_hash
*tab
)
231 bfd_size_type off
= 1, i
;
233 if (bfd_bwrite ("", 1, abfd
) != 1)
236 for (i
= 1; i
< tab
->size
; ++i
)
238 register const char *str
;
239 register unsigned int len
;
241 BFD_ASSERT (tab
->array
[i
]->refcount
== 0);
242 len
= tab
->array
[i
]->len
;
246 str
= tab
->array
[i
]->root
.string
;
247 if (bfd_bwrite (str
, len
, abfd
) != len
)
253 BFD_ASSERT (off
== tab
->sec_size
);
257 /* Compare two elf_strtab_hash_entry structures. Called via qsort. */
260 strrevcmp (const void *a
, const void *b
)
262 struct elf_strtab_hash_entry
*A
= *(struct elf_strtab_hash_entry
**) a
;
263 struct elf_strtab_hash_entry
*B
= *(struct elf_strtab_hash_entry
**) b
;
264 unsigned int lenA
= A
->len
;
265 unsigned int lenB
= B
->len
;
266 const unsigned char *s
= A
->root
.string
+ lenA
- 1;
267 const unsigned char *t
= B
->root
.string
+ lenB
- 1;
268 int l
= lenA
< lenB
? lenA
: lenB
;
273 return (int) *s
- (int) *t
;
282 is_suffix (const struct elf_strtab_hash_entry
*A
,
283 const struct elf_strtab_hash_entry
*B
)
285 if (A
->len
<= B
->len
)
286 /* B cannot be a suffix of A unless A is equal to B, which is guaranteed
287 not to be equal by the hash table. */
290 return memcmp (A
->root
.string
+ (A
->len
- B
->len
),
291 B
->root
.string
, B
->len
- 1) == 0;
294 /* This function assigns final string table offsets for used strings,
295 merging strings matching suffixes of longer strings if possible. */
298 _bfd_elf_strtab_finalize (struct elf_strtab_hash
*tab
)
300 struct elf_strtab_hash_entry
**array
, **a
, *e
;
301 bfd_size_type size
, amt
;
303 /* GCC 2.91.66 (egcs-1.1.2) on i386 miscompiles this function when i is
304 a 64-bit bfd_size_type: a 64-bit target or --enable-64-bit-bfd.
305 Besides, indexing with a long long wouldn't give anything but extra
309 /* Sort the strings by suffix and length. */
310 amt
= tab
->size
* sizeof (struct elf_strtab_hash_entry
*);
311 array
= bfd_malloc (amt
);
315 for (i
= 1, a
= array
; i
< tab
->size
; ++i
)
321 /* Adjust the length to not include the zero terminator. */
331 qsort (array
, size
, sizeof (struct elf_strtab_hash_entry
*), strrevcmp
);
333 /* Loop over the sorted array and merge suffixes. Start from the
334 end because we want eg.
346 ie. we don't want s1 pointing into the old s2. */
351 struct elf_strtab_hash_entry
*cmp
= *a
;
354 if (is_suffix (e
, cmp
))
357 cmp
->len
= -cmp
->len
;
368 /* Assign positions to the strings we want to keep. */
370 for (i
= 1; i
< tab
->size
; ++i
)
373 if (e
->refcount
&& e
->len
> 0)
380 tab
->sec_size
= size
;
382 /* Adjust the rest. */
383 for (i
= 1; i
< tab
->size
; ++i
)
386 if (e
->refcount
&& e
->len
< 0)
387 e
->u
.index
= e
->u
.suffix
->u
.index
+ (e
->u
.suffix
->len
+ e
->len
);
This page took 0.036355 seconds and 4 git commands to generate.