1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/* Return symbol table of archive.
Copyright (C) 1998, 1999, 2000, 2002, 2005 Red Hat, Inc.
Written by Ulrich Drepper <drepper@redhat.com>, 1998.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, version 2.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <assert.h>
#include <byteswap.h>
#include <endian.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <dl-hash.h>
#include "libelfP.h"
Elf_Arsym *
elf_getarsym (elf, ptr)
Elf *elf;
size_t *ptr;
{
if (elf->kind != ELF_K_AR)
{
/* This is no archive. */
__libelf_seterrno (ELF_E_NO_ARCHIVE);
return NULL;
}
if (ptr != NULL)
/* In case of an error or when we know the value store the expected
value now. Doing this allows us easier exits in an error case. */
*ptr = elf->state.ar.ar_sym_num;
if (elf->state.ar.ar_sym == (Elf_Arsym *) -1l)
{
/* There is no index. */
__libelf_seterrno (ELF_E_NO_INDEX);
return NULL;
}
Elf_Arsym *result = elf->state.ar.ar_sym;
if (result == NULL)
{
/* We have not yet read the index. */
rwlock_wrlock (elf->lock);
/* In case we find no index remember this for the next call. */
elf->state.ar.ar_sym = (Elf_Arsym *) -1l;
struct ar_hdr *index_hdr;
if (elf->map_address == NULL)
{
/* We must read index from the file. */
assert (elf->fildes != -1);
if (pread (elf->fildes, &elf->state.ar.ar_hdr,
sizeof (struct ar_hdr), elf->start_offset + SARMAG)
!= sizeof (struct ar_hdr))
{
/* It is not possible to read the index. Maybe it does not
exist. */
__libelf_seterrno (ELF_E_READ_ERROR);
goto out;
}
index_hdr = &elf->state.ar.ar_hdr;
}
else
{
if (SARMAG + sizeof (struct ar_hdr) > elf->maximum_size)
{
/* There is no room for the full archive. */
__libelf_seterrno (ELF_E_NO_INDEX);
goto out;
}
index_hdr = (struct ar_hdr *) (elf->map_address
+ elf->start_offset + SARMAG);
}
/* Now test whether this really is an archive. */
if (memcmp (index_hdr->ar_fmag, ARFMAG, 2) != 0)
{
/* Invalid magic bytes. */
__libelf_seterrno (ELF_E_ARCHIVE_FMAG);
goto out;
}
/* Now test whether this is the index. It is denoted by the
name being "/ ".
XXX This is not entirely true. There are some more forms.
Which of them shall we handle? */
if (memcmp (index_hdr->ar_name, "/ ", 16) != 0)
{
/* If the index is not the first entry, there is no index.
XXX Is this true? */
__libelf_seterrno (ELF_E_NO_INDEX);
goto out;
}
/* We have an archive. The first word in there is the number of
entries in the table. */
uint32_t n;
if (elf->map_address == NULL)
{
if (pread (elf->fildes, &n, sizeof (n),
elf->start_offset + SARMAG + sizeof (struct ar_hdr))
!= sizeof (n))
{
/* Cannot read the number of entries. */
__libelf_seterrno (ELF_E_NO_INDEX);
goto out;
}
}
else
n = *(uint32_t *) (elf->map_address + elf->start_offset
+ SARMAG + sizeof (struct ar_hdr));
if (__BYTE_ORDER == __LITTLE_ENDIAN)
n = bswap_32 (n);
/* Now we can perform some first tests on whether all the data
needed for the index is available. */
char tmpbuf[17];
memcpy (tmpbuf, index_hdr->ar_size, 10);
tmpbuf[10] = '\0';
size_t index_size = atol (tmpbuf);
if (SARMAG + sizeof (struct ar_hdr) + index_size > elf->maximum_size
|| n * sizeof (uint32_t) > index_size)
{
/* This index table cannot be right since it does not fit into
the file. */
__libelf_seterrno (ELF_E_NO_INDEX);
goto out;
}
/* Now we can allocate the arrays needed to store the index. */
size_t ar_sym_len = (n + 1) * sizeof (Elf_Arsym);
elf->state.ar.ar_sym = (Elf_Arsym *) malloc (ar_sym_len);
if (elf->state.ar.ar_sym != NULL)
{
uint32_t *file_data;
char *str_data;
if (elf->map_address == NULL)
{
file_data = (uint32_t *) alloca (n * sizeof (uint32_t));
ar_sym_len += index_size - n * sizeof (uint32_t);
Elf_Arsym *newp = (Elf_Arsym *) realloc (elf->state.ar.ar_sym,
ar_sym_len);
if (newp == NULL)
{
free (elf->state.ar.ar_sym);
elf->state.ar.ar_sym = NULL;
__libelf_seterrno (ELF_E_NOMEM);
goto out;
}
elf->state.ar.ar_sym = newp;
char *new_str = (char *) (elf->state.ar.ar_sym + n + 1);
/* Now read the data from the file. */
if ((size_t) pread (elf->fildes, file_data,
n * sizeof (uint32_t), elf->start_offset
+ SARMAG + sizeof (struct ar_hdr)
+ sizeof (uint32_t)) != n * sizeof (uint32_t)
|| ((size_t) pread (elf->fildes, new_str,
index_size - n * sizeof (uint32_t),
elf->start_offset
+ SARMAG + sizeof (struct ar_hdr)
+ (n + 1) * sizeof (uint32_t))
!= index_size - n * sizeof (uint32_t)))
{
/* We were not able to read the data. */
free (elf->state.ar.ar_sym);
elf->state.ar.ar_sym = NULL;
__libelf_seterrno (ELF_E_NO_INDEX);
goto out;
}
str_data = (char *) new_str;
}
else
{
file_data = (uint32_t *) (elf->map_address + elf->start_offset
+ SARMAG + sizeof (struct ar_hdr)
+ sizeof (uint32_t));
str_data = (char *) &file_data[n];
}
/* Now we can build the data structure. */
Elf_Arsym *arsym = elf->state.ar.ar_sym;
for (size_t cnt = 0; cnt < n; ++cnt)
{
arsym[cnt].as_name = str_data;
if (__BYTE_ORDER == __LITTLE_ENDIAN)
arsym[cnt].as_off = bswap_32 (file_data[cnt]);
else
arsym[cnt].as_off = file_data[cnt];
arsym[cnt].as_hash = _dl_elf_hash (str_data);
str_data = rawmemchr (str_data, '\0') + 1;
}
/* At the end a special entry. */
arsym[n].as_name = NULL;
arsym[n].as_off = 0;
arsym[n].as_hash = ~0UL;
/* Tell the caller how many entries we have. */
elf->state.ar.ar_sym_num = n + 1;
}
result = elf->state.ar.ar_sym;
out:
rwlock_unlock (elf->lock);
}
if (ptr != NULL)
*ptr = elf->state.ar.ar_sym_num;
return result;
}
|
