Commit | Line | Data |
---|---|---|
72c83edd | 1 | /* CTF linking. |
b3adc24a | 2 | Copyright (C) 2019-2020 Free Software Foundation, Inc. |
72c83edd NA |
3 | |
4 | This file is part of libctf. | |
5 | ||
6 | libctf is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
8 | Software Foundation; either version 3, or (at your option) any later | |
9 | version. | |
10 | ||
11 | This program is distributed in the hope that it will be useful, but | |
12 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. | |
14 | See the GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with this program; see the file COPYING. If not see | |
18 | <http://www.gnu.org/licenses/>. */ | |
19 | ||
20 | #include <ctf-impl.h> | |
21 | #include <string.h> | |
22 | ||
8d2229ad NA |
23 | #if defined (PIC) |
24 | #pragma weak ctf_open | |
25 | #endif | |
26 | ||
886453cb NA |
27 | /* Type tracking machinery. */ |
28 | ||
29 | /* Record the correspondence between a source and ctf_add_type()-added | |
30 | destination type: both types are translated into parent type IDs if need be, | |
31 | so they relate to the actual container they are in. Outside controlled | |
32 | circumstances (like linking) it is probably not useful to do more than | |
33 | compare these pointers, since there is nothing stopping the user closing the | |
34 | source container whenever they want to. | |
35 | ||
36 | Our OOM handling here is just to not do anything, because this is called deep | |
37 | enough in the call stack that doing anything useful is painfully difficult: | |
38 | the worst consequence if we do OOM is a bit of type duplication anyway. */ | |
39 | ||
40 | void | |
41 | ctf_add_type_mapping (ctf_file_t *src_fp, ctf_id_t src_type, | |
42 | ctf_file_t *dst_fp, ctf_id_t dst_type) | |
43 | { | |
44 | if (LCTF_TYPE_ISPARENT (src_fp, src_type) && src_fp->ctf_parent) | |
45 | src_fp = src_fp->ctf_parent; | |
46 | ||
47 | src_type = LCTF_TYPE_TO_INDEX(src_fp, src_type); | |
48 | ||
49 | if (LCTF_TYPE_ISPARENT (dst_fp, dst_type) && dst_fp->ctf_parent) | |
50 | dst_fp = dst_fp->ctf_parent; | |
51 | ||
52 | dst_type = LCTF_TYPE_TO_INDEX(dst_fp, dst_type); | |
53 | ||
54 | /* This dynhash is a bit tricky: it has a multivalued (structural) key, so we | |
55 | need to use the sized-hash machinery to generate key hashing and equality | |
56 | functions. */ | |
57 | ||
58 | if (dst_fp->ctf_link_type_mapping == NULL) | |
59 | { | |
3166467b NA |
60 | ctf_hash_fun f = ctf_hash_type_key; |
61 | ctf_hash_eq_fun e = ctf_hash_eq_type_key; | |
886453cb NA |
62 | |
63 | if ((dst_fp->ctf_link_type_mapping = ctf_dynhash_create (f, e, free, | |
64 | NULL)) == NULL) | |
65 | return; | |
66 | } | |
67 | ||
3166467b NA |
68 | ctf_link_type_key_t *key; |
69 | key = calloc (1, sizeof (struct ctf_link_type_key)); | |
886453cb NA |
70 | if (!key) |
71 | return; | |
72 | ||
3166467b NA |
73 | key->cltk_fp = src_fp; |
74 | key->cltk_idx = src_type; | |
886453cb | 75 | |
3166467b NA |
76 | /* No OOM checking needed, because if this doesn't work the worst we'll do is |
77 | add a few more duplicate types (which will probably run out of memory | |
78 | anyway). */ | |
886453cb NA |
79 | ctf_dynhash_insert (dst_fp->ctf_link_type_mapping, key, |
80 | (void *) (uintptr_t) dst_type); | |
81 | } | |
82 | ||
83 | /* Look up a type mapping: return 0 if none. The DST_FP is modified to point to | |
84 | the parent if need be. The ID returned is from the dst_fp's perspective. */ | |
85 | ctf_id_t | |
86 | ctf_type_mapping (ctf_file_t *src_fp, ctf_id_t src_type, ctf_file_t **dst_fp) | |
87 | { | |
3166467b | 88 | ctf_link_type_key_t key; |
886453cb NA |
89 | ctf_file_t *target_fp = *dst_fp; |
90 | ctf_id_t dst_type = 0; | |
91 | ||
92 | if (LCTF_TYPE_ISPARENT (src_fp, src_type) && src_fp->ctf_parent) | |
93 | src_fp = src_fp->ctf_parent; | |
94 | ||
95 | src_type = LCTF_TYPE_TO_INDEX(src_fp, src_type); | |
3166467b NA |
96 | key.cltk_fp = src_fp; |
97 | key.cltk_idx = src_type; | |
886453cb NA |
98 | |
99 | if (target_fp->ctf_link_type_mapping) | |
100 | dst_type = (uintptr_t) ctf_dynhash_lookup (target_fp->ctf_link_type_mapping, | |
101 | &key); | |
102 | ||
103 | if (dst_type != 0) | |
104 | { | |
105 | dst_type = LCTF_INDEX_TO_TYPE (target_fp, dst_type, | |
106 | target_fp->ctf_parent != NULL); | |
107 | *dst_fp = target_fp; | |
108 | return dst_type; | |
109 | } | |
110 | ||
111 | if (target_fp->ctf_parent) | |
112 | target_fp = target_fp->ctf_parent; | |
113 | else | |
114 | return 0; | |
115 | ||
116 | if (target_fp->ctf_link_type_mapping) | |
117 | dst_type = (uintptr_t) ctf_dynhash_lookup (target_fp->ctf_link_type_mapping, | |
118 | &key); | |
119 | ||
120 | if (dst_type) | |
121 | dst_type = LCTF_INDEX_TO_TYPE (target_fp, dst_type, | |
122 | target_fp->ctf_parent != NULL); | |
123 | ||
124 | *dst_fp = target_fp; | |
125 | return dst_type; | |
126 | } | |
127 | ||
72c83edd NA |
128 | /* Linker machinery. |
129 | ||
130 | CTF linking consists of adding CTF archives full of content to be merged into | |
131 | this one to the current file (which must be writable) by calling | |
132 | ctf_link_add_ctf(). Once this is done, a call to ctf_link() will merge the | |
133 | type tables together, generating new CTF files as needed, with this one as a | |
134 | parent, to contain types from the inputs which conflict. | |
135 | ctf_link_add_strtab() takes a callback which provides string/offset pairs to | |
136 | be added to the external symbol table and deduplicated from all CTF string | |
137 | tables in the output link; ctf_link_shuffle_syms() takes a callback which | |
138 | provides symtab entries in ascending order, and shuffles the function and | |
139 | data sections to match; and ctf_link_write() emits a CTF file (if there are | |
140 | no conflicts requiring per-compilation-unit sub-CTF files) or CTF archives | |
141 | (otherwise) and returns it, suitable for addition in the .ctf section of the | |
142 | output. */ | |
143 | ||
8d2229ad NA |
144 | /* Return the name of the compilation unit this CTF dict or its parent applies |
145 | to, or a non-null string otherwise: prefer the parent. Used in debugging | |
146 | output. Sometimes used for outputs too. */ | |
147 | const char * | |
148 | ctf_link_input_name (ctf_file_t *fp) | |
72c83edd | 149 | { |
8d2229ad NA |
150 | if (fp->ctf_parent && fp->ctf_parent->ctf_cuname) |
151 | return fp->ctf_parent->ctf_cuname; | |
152 | else if (fp->ctf_cuname) | |
153 | return fp->ctf_cuname; | |
154 | else | |
155 | return "(unnamed)"; | |
72c83edd NA |
156 | } |
157 | ||
8d2229ad NA |
158 | /* The linker inputs look like this. clin_fp is used for short-circuited |
159 | CU-mapped links that can entirely avoid the first link phase in some | |
160 | situations in favour of just passing on the contained ctf_file_t: it is | |
161 | always the sole ctf_file_t inside the corresponding clin_arc. If set, it | |
162 | gets assigned directly to the final link inputs and freed from there, so it | |
163 | never gets explicitly freed in the ctf_link_input. */ | |
164 | typedef struct ctf_link_input | |
165 | { | |
166 | const char *clin_filename; | |
167 | ctf_archive_t *clin_arc; | |
168 | ctf_file_t *clin_fp; | |
169 | int n; | |
170 | } ctf_link_input_t; | |
171 | ||
172 | static void | |
173 | ctf_link_input_close (void *input) | |
72c83edd | 174 | { |
8d2229ad NA |
175 | ctf_link_input_t *i = (ctf_link_input_t *) input; |
176 | if (i->clin_arc) | |
177 | ctf_arc_close (i->clin_arc); | |
178 | free (i); | |
72c83edd NA |
179 | } |
180 | ||
8d2229ad NA |
181 | /* Like ctf_link_add_ctf, below, but with no error-checking, so it can be called |
182 | in the middle of an ongoing link. */ | |
183 | static int | |
184 | ctf_link_add_ctf_internal (ctf_file_t *fp, ctf_archive_t *ctf, | |
185 | ctf_file_t *fp_input, const char *name) | |
72c83edd | 186 | { |
8d2229ad | 187 | ctf_link_input_t *input = NULL; |
72c83edd NA |
188 | char *dupname = NULL; |
189 | ||
8d2229ad | 190 | if ((input = calloc (1, sizeof (ctf_link_input_t))) == NULL) |
72c83edd NA |
191 | goto oom; |
192 | ||
193 | if ((dupname = strdup (name)) == NULL) | |
194 | goto oom; | |
195 | ||
8d2229ad NA |
196 | input->clin_arc = ctf; |
197 | input->clin_fp = fp_input; | |
198 | input->clin_filename = dupname; | |
199 | input->n = ctf_dynhash_elements (fp->ctf_link_inputs); | |
200 | ||
201 | if (ctf_dynhash_insert (fp->ctf_link_inputs, dupname, input) < 0) | |
72c83edd NA |
202 | goto oom; |
203 | ||
204 | return 0; | |
205 | oom: | |
8d2229ad | 206 | free (input); |
72c83edd | 207 | free (dupname); |
8d2229ad NA |
208 | return ctf_set_errno (fp, ENOMEM); |
209 | } | |
210 | ||
211 | /* Add a file, memory buffer, or unopened file (by name) to a link. | |
212 | ||
213 | You can call this with: | |
214 | ||
215 | CTF and NAME: link the passed ctf_archive_t, with the given NAME. | |
216 | NAME alone: open NAME as a CTF file when needed. | |
217 | BUF and NAME: open the BUF (of length N) as CTF, with the given NAME. (Not | |
218 | yet implemented.) | |
219 | ||
220 | Passed in CTF args are owned by the dictionary and will be freed by it. | |
221 | The BUF arg is *not* owned by the dictionary, and the user should not free | |
222 | its referent until the link is done. | |
223 | ||
224 | The order of calls to this function influences the order of types in the | |
225 | final link output, but otherwise is not important. | |
226 | ||
227 | Private for now, but may in time become public once support for BUF is | |
228 | implemented. */ | |
229 | ||
230 | static int | |
231 | ctf_link_add (ctf_file_t *fp, ctf_archive_t *ctf, const char *name, | |
232 | void *buf _libctf_unused_, size_t n _libctf_unused_) | |
233 | { | |
234 | if (buf) | |
235 | return (ctf_set_errno (fp, ECTF_NOTYET)); | |
236 | ||
237 | if (!((ctf && name && !buf) | |
238 | || (name && !buf && !ctf) | |
239 | || (buf && name && !ctf))) | |
240 | return (ctf_set_errno (fp, EINVAL)); | |
241 | ||
242 | /* We can only lazily open files if libctf.so is in use rather than | |
243 | libctf-nobfd.so. This is a little tricky: in shared libraries, we can use | |
244 | a weak symbol so that -lctf -lctf-nobfd works, but in static libraries we | |
245 | must distinguish between the two libraries explicitly. */ | |
246 | ||
247 | #if defined (PIC) | |
248 | if (!buf && !ctf && name && !ctf_open) | |
249 | return (ctf_set_errno (fp, ECTF_NEEDSBFD)); | |
250 | #elif NOBFD | |
251 | if (!buf && !ctf && name) | |
252 | return (ctf_set_errno (fp, ECTF_NEEDSBFD)); | |
253 | #endif | |
254 | ||
255 | if (fp->ctf_link_outputs) | |
256 | return (ctf_set_errno (fp, ECTF_LINKADDEDLATE)); | |
257 | if (fp->ctf_link_inputs == NULL) | |
258 | fp->ctf_link_inputs = ctf_dynhash_create (ctf_hash_string, | |
259 | ctf_hash_eq_string, free, | |
260 | ctf_link_input_close); | |
261 | ||
262 | if (fp->ctf_link_inputs == NULL) | |
263 | return (ctf_set_errno (fp, ENOMEM)); | |
264 | ||
265 | return ctf_link_add_ctf_internal (fp, ctf, NULL, name); | |
266 | } | |
267 | ||
268 | /* Add an opened CTF archive or unopened file (by name) to a link. | |
269 | If CTF is NULL and NAME is non-null, an unopened file is meant: | |
270 | otherwise, the specified archive is assumed to have the given NAME. | |
271 | ||
272 | Passed in CTF args are owned by the dictionary and will be freed by it. | |
273 | ||
274 | The order of calls to this function influences the order of types in the | |
275 | final link output, but otherwise is not important. */ | |
276 | ||
277 | int | |
278 | ctf_link_add_ctf (ctf_file_t *fp, ctf_archive_t *ctf, const char *name) | |
279 | { | |
280 | return ctf_link_add (fp, ctf, name, NULL, 0); | |
72c83edd NA |
281 | } |
282 | ||
eabb7154 NA |
283 | /* Return a per-CU output CTF dictionary suitable for the given CU, creating and |
284 | interning it if need be. */ | |
285 | ||
286 | static ctf_file_t * | |
287 | ctf_create_per_cu (ctf_file_t *fp, const char *filename, const char *cuname) | |
288 | { | |
289 | ctf_file_t *cu_fp; | |
49ea9b45 | 290 | const char *ctf_name = NULL; |
eabb7154 NA |
291 | char *dynname = NULL; |
292 | ||
49ea9b45 NA |
293 | /* First, check the mapping table and translate the per-CU name we use |
294 | accordingly. We check both the input filename and the CU name. Only if | |
295 | neither are set do we fall back to the input filename as the per-CU | |
296 | dictionary name. We prefer the filename because this is easier for likely | |
297 | callers to determine. */ | |
298 | ||
5f54462c | 299 | if (fp->ctf_link_in_cu_mapping) |
49ea9b45 | 300 | { |
5f54462c NA |
301 | if (((ctf_name = ctf_dynhash_lookup (fp->ctf_link_in_cu_mapping, |
302 | filename)) == NULL) && | |
303 | ((ctf_name = ctf_dynhash_lookup (fp->ctf_link_in_cu_mapping, | |
304 | cuname)) == NULL)) | |
49ea9b45 NA |
305 | ctf_name = filename; |
306 | } | |
307 | ||
308 | if (ctf_name == NULL) | |
309 | ctf_name = filename; | |
310 | ||
311 | if ((cu_fp = ctf_dynhash_lookup (fp->ctf_link_outputs, ctf_name)) == NULL) | |
eabb7154 NA |
312 | { |
313 | int err; | |
314 | ||
315 | if ((cu_fp = ctf_create (&err)) == NULL) | |
316 | { | |
8d2229ad NA |
317 | ctf_err_warn (fp, 0, "Cannot create per-CU CTF archive for " |
318 | "CU %s from input file %s: %s", cuname, filename, | |
319 | ctf_errmsg (err)); | |
eabb7154 NA |
320 | ctf_set_errno (fp, err); |
321 | return NULL; | |
322 | } | |
323 | ||
49ea9b45 | 324 | if ((dynname = strdup (ctf_name)) == NULL) |
eabb7154 NA |
325 | goto oom; |
326 | if (ctf_dynhash_insert (fp->ctf_link_outputs, dynname, cu_fp) < 0) | |
327 | goto oom; | |
328 | ||
1fa7a0c2 | 329 | ctf_import_unref (cu_fp, fp); |
eabb7154 NA |
330 | ctf_cuname_set (cu_fp, cuname); |
331 | ctf_parent_name_set (cu_fp, _CTF_SECTION); | |
332 | } | |
333 | return cu_fp; | |
334 | ||
335 | oom: | |
336 | free (dynname); | |
337 | ctf_file_close (cu_fp); | |
338 | ctf_set_errno (fp, ENOMEM); | |
339 | return NULL; | |
340 | } | |
341 | ||
49ea9b45 NA |
342 | /* Add a mapping directing that the CU named FROM should have its |
343 | conflicting/non-duplicate types (depending on link mode) go into a container | |
5f54462c | 344 | named TO. Many FROMs can share a TO. |
49ea9b45 NA |
345 | |
346 | We forcibly add a container named TO in every case, even though it may well | |
347 | wind up empty, because clients that use this facility usually expect to find | |
348 | every TO container present, even if empty, and malfunction otherwise. */ | |
349 | ||
350 | int | |
351 | ctf_link_add_cu_mapping (ctf_file_t *fp, const char *from, const char *to) | |
352 | { | |
353 | int err; | |
5f54462c NA |
354 | char *f = NULL, *t = NULL; |
355 | ctf_dynhash_t *one_out; | |
356 | ||
357 | if (fp->ctf_link_in_cu_mapping == NULL) | |
358 | fp->ctf_link_in_cu_mapping = ctf_dynhash_create (ctf_hash_string, | |
359 | ctf_hash_eq_string, free, | |
360 | free); | |
361 | if (fp->ctf_link_in_cu_mapping == NULL) | |
362 | goto oom; | |
49ea9b45 | 363 | |
5f54462c NA |
364 | if (fp->ctf_link_out_cu_mapping == NULL) |
365 | fp->ctf_link_out_cu_mapping = ctf_dynhash_create (ctf_hash_string, | |
366 | ctf_hash_eq_string, free, | |
367 | (ctf_hash_free_fun) | |
368 | ctf_dynhash_destroy); | |
369 | if (fp->ctf_link_out_cu_mapping == NULL) | |
370 | goto oom; | |
49ea9b45 | 371 | |
5f54462c NA |
372 | f = strdup (from); |
373 | t = strdup (to); | |
374 | if (!f || !t) | |
375 | goto oom; | |
49ea9b45 | 376 | |
5f54462c NA |
377 | /* Track both in a list from FROM to TO and in a list from TO to a list of |
378 | FROM. The former is used to create TUs with the mapped-to name at need: | |
379 | the latter is used in deduplicating links to pull in all input CUs | |
380 | corresponding to a single output CU. */ | |
381 | ||
382 | if ((err = ctf_dynhash_insert (fp->ctf_link_in_cu_mapping, f, t)) < 0) | |
383 | { | |
384 | ctf_set_errno (fp, err); | |
385 | goto oom_noerrno; | |
386 | } | |
49ea9b45 | 387 | |
5f54462c | 388 | /* f and t are now owned by the in_cu_mapping: reallocate them. */ |
49ea9b45 NA |
389 | f = strdup (from); |
390 | t = strdup (to); | |
391 | if (!f || !t) | |
392 | goto oom; | |
393 | ||
5f54462c NA |
394 | if ((one_out = ctf_dynhash_lookup (fp->ctf_link_out_cu_mapping, t)) == NULL) |
395 | { | |
396 | if ((one_out = ctf_dynhash_create (ctf_hash_string, ctf_hash_eq_string, | |
397 | free, NULL)) == NULL) | |
398 | goto oom; | |
399 | if ((err = ctf_dynhash_insert (fp->ctf_link_out_cu_mapping, | |
400 | t, one_out)) < 0) | |
401 | { | |
402 | ctf_dynhash_destroy (one_out); | |
403 | ctf_set_errno (fp, err); | |
404 | goto oom_noerrno; | |
405 | } | |
406 | } | |
407 | else | |
408 | free (t); | |
49ea9b45 | 409 | |
5f54462c | 410 | if (ctf_dynhash_insert (one_out, f, NULL) < 0) |
49ea9b45 NA |
411 | { |
412 | ctf_set_errno (fp, err); | |
413 | goto oom_noerrno; | |
414 | } | |
415 | ||
416 | return 0; | |
417 | ||
418 | oom: | |
419 | ctf_set_errno (fp, errno); | |
420 | oom_noerrno: | |
421 | free (f); | |
422 | free (t); | |
423 | return -1; | |
424 | } | |
425 | ||
426 | /* Set a function which is called to transform the names of archive members. | |
427 | This is useful for applying regular transformations to many names, where | |
428 | ctf_link_add_cu_mapping applies arbitrarily irregular changes to single | |
429 | names. The member name changer is applied at ctf_link_write time, so it | |
430 | cannot conflate multiple CUs into one the way ctf_link_add_cu_mapping can. | |
431 | The changer function accepts a name and should return a new | |
432 | dynamically-allocated name, or NULL if the name should be left unchanged. */ | |
433 | void | |
434 | ctf_link_set_memb_name_changer (ctf_file_t *fp, | |
435 | ctf_link_memb_name_changer_f *changer, | |
436 | void *arg) | |
437 | { | |
438 | fp->ctf_link_memb_name_changer = changer; | |
439 | fp->ctf_link_memb_name_changer_arg = arg; | |
440 | } | |
441 | ||
72c83edd NA |
442 | typedef struct ctf_link_in_member_cb_arg |
443 | { | |
8d2229ad | 444 | /* The shared output dictionary. */ |
72c83edd | 445 | ctf_file_t *out_fp; |
8d2229ad NA |
446 | |
447 | /* The filename of the input file, and an fp to each dictionary in that file | |
448 | in turn. */ | |
449 | const char *in_file_name; | |
72c83edd | 450 | ctf_file_t *in_fp; |
8d2229ad NA |
451 | |
452 | /* The CU name of the dict being processed. */ | |
72c83edd | 453 | const char *cu_name; |
72c83edd | 454 | int in_input_cu_file; |
8d2229ad NA |
455 | |
456 | /* The parent dictionary in the input, and whether it's been processed yet. | |
457 | Not needed by ctf_link_one_type / ctf_link_one_variable, only by higher | |
458 | layers. */ | |
459 | ctf_file_t *in_fp_parent; | |
460 | int done_parent; | |
461 | ||
462 | /* If true, this is the CU-mapped portion of a deduplicating link: no child | |
463 | dictionaries should be created. */ | |
464 | int cu_mapped; | |
72c83edd NA |
465 | } ctf_link_in_member_cb_arg_t; |
466 | ||
467 | /* Link one type into the link. We rely on ctf_add_type() to detect | |
468 | duplicates. This is not terribly reliable yet (unnmamed types will be | |
469 | mindlessly duplicated), but will improve shortly. */ | |
470 | ||
471 | static int | |
472 | ctf_link_one_type (ctf_id_t type, int isroot _libctf_unused_, void *arg_) | |
473 | { | |
474 | ctf_link_in_member_cb_arg_t *arg = (ctf_link_in_member_cb_arg_t *) arg_; | |
475 | ctf_file_t *per_cu_out_fp; | |
476 | int err; | |
477 | ||
8d2229ad | 478 | if (arg->in_fp->ctf_link_flags != CTF_LINK_SHARE_UNCONFLICTED) |
72c83edd | 479 | { |
8d2229ad | 480 | ctf_err_warn (arg->out_fp, 0, "Share-duplicated mode not yet implemented"); |
72c83edd NA |
481 | return ctf_set_errno (arg->out_fp, ECTF_NOTYET); |
482 | } | |
483 | ||
484 | /* Simply call ctf_add_type: if it reports a conflict and we're adding to the | |
485 | main CTF file, add to the per-CU archive member instead, creating it if | |
486 | necessary. If we got this type from a per-CU archive member, add it | |
487 | straight back to the corresponding member in the output. */ | |
488 | ||
489 | if (!arg->in_input_cu_file) | |
490 | { | |
491 | if (ctf_add_type (arg->out_fp, arg->in_fp, type) != CTF_ERR) | |
492 | return 0; | |
493 | ||
494 | err = ctf_errno (arg->out_fp); | |
495 | if (err != ECTF_CONFLICT) | |
496 | { | |
791915db | 497 | if (err != ECTF_NONREPRESENTABLE) |
8d2229ad NA |
498 | ctf_err_warn (arg->out_fp, 1, "Cannot link type %lx from input file %s, " |
499 | "CU %s into output link: %s", type, arg->cu_name, | |
500 | arg->in_file_name, ctf_errmsg (err)); | |
791915db NA |
501 | /* We must ignore this problem or we end up losing future types, then |
502 | trying to link the variables in, then exploding. Better to link as | |
8d2229ad | 503 | much as possible. */ |
791915db | 504 | return 0; |
72c83edd NA |
505 | } |
506 | ctf_set_errno (arg->out_fp, 0); | |
507 | } | |
508 | ||
8d2229ad | 509 | if ((per_cu_out_fp = ctf_create_per_cu (arg->out_fp, arg->in_file_name, |
eabb7154 NA |
510 | arg->cu_name)) == NULL) |
511 | return -1; /* Errno is set for us. */ | |
72c83edd NA |
512 | |
513 | if (ctf_add_type (per_cu_out_fp, arg->in_fp, type) != CTF_ERR) | |
514 | return 0; | |
515 | ||
516 | err = ctf_errno (per_cu_out_fp); | |
791915db | 517 | if (err != ECTF_NONREPRESENTABLE) |
8d2229ad NA |
518 | ctf_err_warn (arg->out_fp, 1, "Cannot link type %lx from input file %s, CU %s " |
519 | "into output per-CU CTF archive member %s: %s: skipped", type, | |
520 | ctf_link_input_name (arg->in_fp), arg->in_file_name, | |
521 | ctf_link_input_name (per_cu_out_fp), ctf_errmsg (err)); | |
72c83edd NA |
522 | if (err == ECTF_CONFLICT) |
523 | /* Conflicts are possible at this stage only if a non-ld user has combined | |
524 | multiple TUs into a single output dictionary. Even in this case we do not | |
525 | want to stop the link or propagate the error. */ | |
526 | ctf_set_errno (arg->out_fp, 0); | |
527 | ||
528 | return 0; /* As above: do not lose types. */ | |
529 | } | |
530 | ||
6dd2819f NA |
531 | /* Set a function which is used to filter out unwanted variables from the link. */ |
532 | int | |
533 | ctf_link_set_variable_filter (ctf_file_t *fp, ctf_link_variable_filter_f *filter, | |
534 | void *arg) | |
535 | { | |
536 | fp->ctf_link_variable_filter = filter; | |
537 | fp->ctf_link_variable_filter_arg = arg; | |
538 | return 0; | |
539 | } | |
540 | ||
eabb7154 NA |
541 | /* Check if we can safely add a variable with the given type to this container. */ |
542 | ||
543 | static int | |
544 | check_variable (const char *name, ctf_file_t *fp, ctf_id_t type, | |
545 | ctf_dvdef_t **out_dvd) | |
546 | { | |
547 | ctf_dvdef_t *dvd; | |
548 | ||
549 | dvd = ctf_dynhash_lookup (fp->ctf_dvhash, name); | |
550 | *out_dvd = dvd; | |
551 | if (!dvd) | |
552 | return 1; | |
553 | ||
554 | if (dvd->dvd_type != type) | |
555 | { | |
556 | /* Variable here. Wrong type: cannot add. Just skip it, because there is | |
8d2229ad NA |
557 | no way to express this in CTF. Don't even warn: this case is too |
558 | common. (This might be the parent, in which case we'll try adding in | |
559 | the child first, and only then give up.) */ | |
eabb7154 NA |
560 | ctf_dprintf ("Inexpressible duplicate variable %s skipped.\n", name); |
561 | } | |
562 | ||
563 | return 0; /* Already exists. */ | |
564 | } | |
565 | ||
566 | /* Link one variable in. */ | |
567 | ||
568 | static int | |
569 | ctf_link_one_variable (const char *name, ctf_id_t type, void *arg_) | |
570 | { | |
571 | ctf_link_in_member_cb_arg_t *arg = (ctf_link_in_member_cb_arg_t *) arg_; | |
572 | ctf_file_t *per_cu_out_fp; | |
573 | ctf_id_t dst_type = 0; | |
574 | ctf_file_t *check_fp; | |
575 | ctf_dvdef_t *dvd; | |
576 | ||
6dd2819f NA |
577 | /* See if this variable is filtered out. */ |
578 | ||
579 | if (arg->out_fp->ctf_link_variable_filter) | |
580 | { | |
581 | void *farg = arg->out_fp->ctf_link_variable_filter_arg; | |
582 | if (arg->out_fp->ctf_link_variable_filter (arg->in_fp, name, type, farg)) | |
583 | return 0; | |
584 | } | |
585 | ||
eabb7154 NA |
586 | /* In unconflicted link mode, if this type is mapped to a type in the parent |
587 | container, we want to try to add to that first: if it reports a duplicate, | |
588 | or if the type is in a child already, add straight to the child. */ | |
589 | ||
590 | check_fp = arg->out_fp; | |
591 | ||
592 | dst_type = ctf_type_mapping (arg->in_fp, type, &check_fp); | |
593 | if (dst_type != 0) | |
594 | { | |
595 | if (check_fp == arg->out_fp) | |
596 | { | |
597 | if (check_variable (name, check_fp, dst_type, &dvd)) | |
598 | { | |
599 | /* No variable here: we can add it. */ | |
600 | if (ctf_add_variable (check_fp, name, dst_type) < 0) | |
601 | return (ctf_set_errno (arg->out_fp, ctf_errno (check_fp))); | |
602 | return 0; | |
603 | } | |
604 | ||
605 | /* Already present? Nothing to do. */ | |
19d4b1ad | 606 | if (dvd && dvd->dvd_type == dst_type) |
eabb7154 NA |
607 | return 0; |
608 | } | |
609 | } | |
610 | ||
611 | /* Can't add to the parent due to a name clash, or because it references a | |
612 | type only present in the child. Try adding to the child, creating if need | |
8d2229ad NA |
613 | be. If we can't do that, skip it. Don't add to a child if we're doing a |
614 | CU-mapped link, since that has only one output. */ | |
615 | ||
616 | if (arg->cu_mapped) | |
617 | { | |
618 | ctf_dprintf ("Variable %s in input file %s depends on a type %lx hidden " | |
619 | "due to conflicts: skipped.\n", name, arg->in_file_name, | |
620 | type); | |
621 | return 0; | |
622 | } | |
eabb7154 | 623 | |
8d2229ad | 624 | if ((per_cu_out_fp = ctf_create_per_cu (arg->out_fp, arg->in_file_name, |
eabb7154 NA |
625 | arg->cu_name)) == NULL) |
626 | return -1; /* Errno is set for us. */ | |
627 | ||
628 | /* If the type was not found, check for it in the child too. */ | |
629 | if (dst_type == 0) | |
630 | { | |
631 | check_fp = per_cu_out_fp; | |
632 | dst_type = ctf_type_mapping (arg->in_fp, type, &check_fp); | |
633 | ||
634 | if (dst_type == 0) | |
635 | { | |
8d2229ad NA |
636 | ctf_err_warn (arg->out_fp, 1, "Type %lx for variable %s in input " |
637 | "file %s not found: skipped", type, name, | |
638 | arg->in_file_name); | |
eabb7154 NA |
639 | /* Do not terminate the link: just skip the variable. */ |
640 | return 0; | |
641 | } | |
642 | } | |
643 | ||
644 | if (check_variable (name, per_cu_out_fp, dst_type, &dvd)) | |
645 | if (ctf_add_variable (per_cu_out_fp, name, dst_type) < 0) | |
646 | return (ctf_set_errno (arg->out_fp, ctf_errno (per_cu_out_fp))); | |
647 | return 0; | |
648 | } | |
649 | ||
8d2229ad NA |
650 | /* Merge every type (and optionally, variable) in this archive member into the |
651 | link, so we can relink things that have already had ld run on them. We use | |
652 | the archive member name, sans any leading '.ctf.', as the CU name for | |
653 | ambiguous types if there is one and it's not the default: otherwise, we use | |
654 | the name of the input file. */ | |
72c83edd NA |
655 | static int |
656 | ctf_link_one_input_archive_member (ctf_file_t *in_fp, const char *name, void *arg_) | |
657 | { | |
658 | ctf_link_in_member_cb_arg_t *arg = (ctf_link_in_member_cb_arg_t *) arg_; | |
659 | int err = 0; | |
660 | ||
661 | if (strcmp (name, _CTF_SECTION) == 0) | |
662 | { | |
663 | /* This file is the default member of this archive, and has already been | |
664 | explicitly processed. | |
665 | ||
666 | In the default sharing mode of CTF_LINK_SHARE_UNCONFLICTED, it does no | |
667 | harm to rescan an existing shared repo again: all the types will just | |
668 | end up in the same place. But in CTF_LINK_SHARE_DUPLICATED mode, this | |
669 | causes the system to erroneously conclude that all types are duplicated | |
670 | and should be shared, even if they are not. */ | |
671 | ||
8d2229ad | 672 | if (arg->done_parent) |
72c83edd | 673 | return 0; |
72c83edd NA |
674 | } |
675 | else | |
676 | { | |
72c83edd | 677 | /* Get ambiguous types from our parent. */ |
8d2229ad | 678 | ctf_import (in_fp, arg->in_fp_parent); |
72c83edd NA |
679 | arg->in_input_cu_file = 1; |
680 | } | |
681 | ||
72c83edd NA |
682 | arg->cu_name = name; |
683 | if (strncmp (arg->cu_name, ".ctf.", strlen (".ctf.")) == 0) | |
684 | arg->cu_name += strlen (".ctf."); | |
685 | arg->in_fp = in_fp; | |
686 | ||
eabb7154 NA |
687 | if ((err = ctf_type_iter_all (in_fp, ctf_link_one_type, arg)) > -1) |
688 | err = ctf_variable_iter (in_fp, ctf_link_one_variable, arg); | |
72c83edd NA |
689 | |
690 | arg->in_input_cu_file = 0; | |
72c83edd NA |
691 | |
692 | if (err < 0) | |
693 | return -1; /* Errno is set for us. */ | |
694 | ||
695 | return 0; | |
696 | } | |
697 | ||
886453cb NA |
698 | /* Dump the unnecessary link type mapping after one input file is processed. */ |
699 | static void | |
700 | empty_link_type_mapping (void *key _libctf_unused_, void *value, | |
701 | void *arg _libctf_unused_) | |
702 | { | |
703 | ctf_file_t *fp = (ctf_file_t *) value; | |
704 | ||
705 | if (fp->ctf_link_type_mapping) | |
706 | ctf_dynhash_empty (fp->ctf_link_type_mapping); | |
707 | } | |
708 | ||
8d2229ad NA |
709 | /* Lazily open a CTF archive for linking, if not already open. |
710 | ||
711 | Returns the number of files contained within the opened archive (0 for none), | |
712 | or -1 on error, as usual. */ | |
713 | static ssize_t | |
714 | ctf_link_lazy_open (ctf_file_t *fp, ctf_link_input_t *input) | |
715 | { | |
716 | size_t count; | |
717 | int err; | |
718 | ||
719 | if (input->clin_arc) | |
720 | return ctf_archive_count (input->clin_arc); | |
721 | ||
722 | if (input->clin_fp) | |
723 | return 1; | |
724 | ||
725 | /* See ctf_link_add_ctf. */ | |
726 | #if defined (PIC) || !NOBFD | |
727 | input->clin_arc = ctf_open (input->clin_filename, NULL, &err); | |
728 | #else | |
729 | ctf_err_warn (fp, 0, "Cannot open %s lazily: %s", input->clin_filename, | |
730 | ctf_errmsg (ECTF_NEEDSBFD)); | |
731 | ctf_set_errno (fp, ECTF_NEEDSBFD); | |
732 | return -1; | |
733 | #endif | |
734 | ||
735 | /* Having no CTF sections is not an error. We just don't need to do | |
736 | anything. */ | |
737 | ||
738 | if (!input->clin_arc) | |
739 | { | |
740 | if (err == ECTF_NOCTFDATA) | |
741 | return 0; | |
742 | ||
743 | ctf_err_warn (fp, 0, "Opening CTF %s failed: %s", | |
744 | input->clin_filename, ctf_errmsg (err)); | |
745 | ctf_set_errno (fp, err); | |
746 | return -1; | |
747 | } | |
748 | ||
749 | if ((count = ctf_archive_count (input->clin_arc)) == 0) | |
750 | ctf_arc_close (input->clin_arc); | |
751 | ||
752 | return (ssize_t) count; | |
753 | } | |
754 | ||
755 | /* Close an input, as a ctf_dynhash_iter iterator. */ | |
756 | static void | |
757 | ctf_link_close_one_input_archive (void *key _libctf_unused_, void *value, | |
758 | void *arg _libctf_unused_) | |
759 | { | |
760 | ctf_link_input_t *input = (ctf_link_input_t *) value; | |
761 | if (input->clin_arc) | |
762 | ctf_arc_close (input->clin_arc); | |
763 | input->clin_arc = NULL; | |
764 | } | |
765 | ||
72c83edd NA |
766 | /* Link one input file's types into the output file. */ |
767 | static void | |
768 | ctf_link_one_input_archive (void *key, void *value, void *arg_) | |
769 | { | |
770 | const char *file_name = (const char *) key; | |
8d2229ad | 771 | ctf_link_input_t *input = (ctf_link_input_t *)value; |
72c83edd | 772 | ctf_link_in_member_cb_arg_t *arg = (ctf_link_in_member_cb_arg_t *) arg_; |
8d2229ad NA |
773 | int err = 0; |
774 | ||
775 | if (!input->clin_arc) | |
776 | { | |
777 | err = ctf_link_lazy_open (arg->out_fp, input); | |
778 | if (err == 0) /* Just no CTF. */ | |
779 | return; | |
780 | ||
781 | if (err < 0) | |
782 | return; /* errno is set for us. */ | |
783 | } | |
72c83edd | 784 | |
8d2229ad NA |
785 | arg->in_file_name = file_name; |
786 | arg->done_parent = 0; | |
787 | if ((arg->in_fp_parent = ctf_arc_open_by_name (input->clin_arc, NULL, | |
788 | &err)) == NULL) | |
72c83edd NA |
789 | if (err != ECTF_ARNNAME) |
790 | { | |
8d2229ad NA |
791 | ctf_err_warn (arg->out_fp, 0, "Cannot open main archive member in " |
792 | "input file %s in the link: skipping: %s", | |
793 | arg->in_file_name, ctf_errmsg (err)); | |
794 | goto out; | |
72c83edd NA |
795 | } |
796 | ||
8d2229ad | 797 | if (ctf_link_one_input_archive_member (arg->in_fp_parent, |
72c83edd NA |
798 | _CTF_SECTION, arg) < 0) |
799 | { | |
8d2229ad NA |
800 | ctf_file_close (arg->in_fp_parent); |
801 | goto out; | |
72c83edd | 802 | } |
8d2229ad NA |
803 | arg->done_parent = 1; |
804 | if (ctf_archive_iter (input->clin_arc, ctf_link_one_input_archive_member, | |
805 | arg) < 0) | |
806 | ctf_err_warn (arg->out_fp, 0, "Cannot traverse archive in input file %s: " | |
807 | "link cannot continue: %s", arg->in_file_name, | |
808 | ctf_errmsg (ctf_errno (arg->out_fp))); | |
72c83edd NA |
809 | else |
810 | { | |
811 | /* The only error indication to the caller is the errno: so ensure that it | |
812 | is zero if there was no actual error from the caller. */ | |
813 | ctf_set_errno (arg->out_fp, 0); | |
814 | } | |
8d2229ad | 815 | ctf_file_close (arg->in_fp_parent); |
886453cb | 816 | |
8d2229ad NA |
817 | out: |
818 | ctf_link_close_one_input_archive (key, value, NULL); | |
72c83edd NA |
819 | } |
820 | ||
821 | /* Merge types and variable sections in all files added to the link | |
8d2229ad | 822 | together. All the added files are closed. */ |
72c83edd | 823 | int |
8d2229ad | 824 | ctf_link (ctf_file_t *fp, int flags) |
72c83edd NA |
825 | { |
826 | ctf_link_in_member_cb_arg_t arg; | |
5f54462c NA |
827 | ctf_next_t *i = NULL; |
828 | int err; | |
72c83edd NA |
829 | |
830 | memset (&arg, 0, sizeof (struct ctf_link_in_member_cb_arg)); | |
831 | arg.out_fp = fp; | |
8d2229ad | 832 | fp->ctf_link_flags = flags; |
72c83edd NA |
833 | |
834 | if (fp->ctf_link_inputs == NULL) | |
835 | return 0; /* Nothing to do. */ | |
836 | ||
837 | if (fp->ctf_link_outputs == NULL) | |
838 | fp->ctf_link_outputs = ctf_dynhash_create (ctf_hash_string, | |
839 | ctf_hash_eq_string, free, | |
8d2229ad NA |
840 | (ctf_hash_free_fun) |
841 | ctf_file_close); | |
72c83edd NA |
842 | |
843 | if (fp->ctf_link_outputs == NULL) | |
844 | return ctf_set_errno (fp, ENOMEM); | |
845 | ||
5f54462c NA |
846 | /* Create empty CUs if requested. We do not currently claim that multiple |
847 | links in succession with CTF_LINK_EMPTY_CU_MAPPINGS set in some calls and | |
848 | not set in others will do anything especially sensible. */ | |
849 | ||
850 | if (fp->ctf_link_out_cu_mapping && (flags & CTF_LINK_EMPTY_CU_MAPPINGS)) | |
851 | { | |
852 | void *v; | |
853 | ||
854 | while ((err = ctf_dynhash_next (fp->ctf_link_out_cu_mapping, &i, &v, | |
855 | NULL)) == 0) | |
856 | { | |
857 | const char *to = (const char *) v; | |
858 | if (ctf_create_per_cu (fp, to, to) == NULL) | |
859 | { | |
860 | ctf_next_destroy (i); | |
861 | return -1; /* Errno is set for us. */ | |
862 | } | |
863 | } | |
864 | if (err != ECTF_NEXT_END) | |
865 | { | |
866 | ctf_err_warn (fp, 1, "Iteration error creating empty CUs: %s", | |
867 | ctf_errmsg (err)); | |
868 | ctf_set_errno (fp, err); | |
869 | return -1; | |
870 | } | |
871 | } | |
872 | ||
72c83edd NA |
873 | ctf_dynhash_iter (fp->ctf_link_inputs, ctf_link_one_input_archive, |
874 | &arg); | |
875 | ||
8d2229ad NA |
876 | /* Discard the now-unnecessary mapping table data from all the outputs. */ |
877 | if (fp->ctf_link_type_mapping) | |
878 | ctf_dynhash_empty (fp->ctf_link_type_mapping); | |
879 | ctf_dynhash_iter (fp->ctf_link_outputs, empty_link_type_mapping, NULL); | |
880 | ||
881 | if ((ctf_errno (fp) != 0) && (ctf_errno (fp) != ECTF_NOCTFDATA)) | |
72c83edd NA |
882 | return -1; |
883 | return 0; | |
884 | } | |
885 | ||
886 | typedef struct ctf_link_out_string_cb_arg | |
887 | { | |
888 | const char *str; | |
889 | uint32_t offset; | |
890 | int err; | |
891 | } ctf_link_out_string_cb_arg_t; | |
892 | ||
893 | /* Intern a string in the string table of an output per-CU CTF file. */ | |
894 | static void | |
895 | ctf_link_intern_extern_string (void *key _libctf_unused_, void *value, | |
896 | void *arg_) | |
897 | { | |
898 | ctf_file_t *fp = (ctf_file_t *) value; | |
899 | ctf_link_out_string_cb_arg_t *arg = (ctf_link_out_string_cb_arg_t *) arg_; | |
900 | ||
901 | fp->ctf_flags |= LCTF_DIRTY; | |
676c3ecb | 902 | if (!ctf_str_add_external (fp, arg->str, arg->offset)) |
72c83edd NA |
903 | arg->err = ENOMEM; |
904 | } | |
905 | ||
906 | /* Repeatedly call ADD_STRING to acquire strings from the external string table, | |
907 | adding them to the atoms table for this CU and all subsidiary CUs. | |
908 | ||
909 | If ctf_link() is also called, it must be called first if you want the new CTF | |
910 | files ctf_link() can create to get their strings dedupped against the ELF | |
911 | strtab properly. */ | |
912 | int | |
913 | ctf_link_add_strtab (ctf_file_t *fp, ctf_link_strtab_string_f *add_string, | |
914 | void *arg) | |
915 | { | |
916 | const char *str; | |
917 | uint32_t offset; | |
918 | int err = 0; | |
919 | ||
920 | while ((str = add_string (&offset, arg)) != NULL) | |
921 | { | |
922 | ctf_link_out_string_cb_arg_t iter_arg = { str, offset, 0 }; | |
923 | ||
924 | fp->ctf_flags |= LCTF_DIRTY; | |
676c3ecb | 925 | if (!ctf_str_add_external (fp, str, offset)) |
72c83edd NA |
926 | err = ENOMEM; |
927 | ||
928 | ctf_dynhash_iter (fp->ctf_link_outputs, ctf_link_intern_extern_string, | |
929 | &iter_arg); | |
930 | if (iter_arg.err) | |
931 | err = iter_arg.err; | |
932 | } | |
933 | ||
934 | return -err; | |
935 | } | |
936 | ||
937 | /* Not yet implemented. */ | |
938 | int | |
939 | ctf_link_shuffle_syms (ctf_file_t *fp _libctf_unused_, | |
940 | ctf_link_iter_symbol_f *add_sym _libctf_unused_, | |
941 | void *arg _libctf_unused_) | |
942 | { | |
943 | return 0; | |
944 | } | |
945 | ||
946 | typedef struct ctf_name_list_accum_cb_arg | |
947 | { | |
948 | char **names; | |
949 | ctf_file_t *fp; | |
950 | ctf_file_t **files; | |
951 | size_t i; | |
49ea9b45 NA |
952 | char **dynames; |
953 | size_t ndynames; | |
72c83edd NA |
954 | } ctf_name_list_accum_cb_arg_t; |
955 | ||
676c3ecb | 956 | /* Accumulate the names and a count of the names in the link output hash. */ |
72c83edd NA |
957 | static void |
958 | ctf_accumulate_archive_names (void *key, void *value, void *arg_) | |
959 | { | |
960 | const char *name = (const char *) key; | |
961 | ctf_file_t *fp = (ctf_file_t *) value; | |
962 | char **names; | |
963 | ctf_file_t **files; | |
964 | ctf_name_list_accum_cb_arg_t *arg = (ctf_name_list_accum_cb_arg_t *) arg_; | |
72c83edd NA |
965 | |
966 | if ((names = realloc (arg->names, sizeof (char *) * ++(arg->i))) == NULL) | |
967 | { | |
968 | (arg->i)--; | |
969 | ctf_set_errno (arg->fp, ENOMEM); | |
970 | return; | |
971 | } | |
972 | ||
973 | if ((files = realloc (arg->files, sizeof (ctf_file_t *) * arg->i)) == NULL) | |
974 | { | |
975 | (arg->i)--; | |
976 | ctf_set_errno (arg->fp, ENOMEM); | |
977 | return; | |
978 | } | |
49ea9b45 NA |
979 | |
980 | /* Allow the caller to get in and modify the name at the last minute. If the | |
981 | caller *does* modify the name, we have to stash away the new name the | |
982 | caller returned so we can free it later on. (The original name is the key | |
983 | of the ctf_link_outputs hash and is freed by the dynhash machinery.) */ | |
984 | ||
985 | if (fp->ctf_link_memb_name_changer) | |
986 | { | |
987 | char **dynames; | |
988 | char *dyname; | |
989 | void *nc_arg = fp->ctf_link_memb_name_changer_arg; | |
990 | ||
991 | dyname = fp->ctf_link_memb_name_changer (fp, name, nc_arg); | |
992 | ||
993 | if (dyname != NULL) | |
994 | { | |
995 | if ((dynames = realloc (arg->dynames, | |
996 | sizeof (char *) * ++(arg->ndynames))) == NULL) | |
997 | { | |
998 | (arg->ndynames)--; | |
999 | ctf_set_errno (arg->fp, ENOMEM); | |
1000 | return; | |
1001 | } | |
1002 | arg->dynames = dynames; | |
1003 | name = (const char *) dyname; | |
1004 | } | |
1005 | } | |
1006 | ||
72c83edd NA |
1007 | arg->names = names; |
1008 | arg->names[(arg->i) - 1] = (char *) name; | |
1009 | arg->files = files; | |
1010 | arg->files[(arg->i) - 1] = fp; | |
1011 | } | |
1012 | ||
49ea9b45 NA |
1013 | /* Change the name of the parent CTF section, if the name transformer has got to |
1014 | it. */ | |
1015 | static void | |
1016 | ctf_change_parent_name (void *key _libctf_unused_, void *value, void *arg) | |
1017 | { | |
1018 | ctf_file_t *fp = (ctf_file_t *) value; | |
1019 | const char *name = (const char *) arg; | |
1020 | ||
1021 | ctf_parent_name_set (fp, name); | |
1022 | } | |
1023 | ||
72c83edd NA |
1024 | /* Write out a CTF archive (if there are per-CU CTF files) or a CTF file |
1025 | (otherwise) into a new dynamically-allocated string, and return it. | |
1026 | Members with sizes above THRESHOLD are compressed. */ | |
1027 | unsigned char * | |
1028 | ctf_link_write (ctf_file_t *fp, size_t *size, size_t threshold) | |
1029 | { | |
1030 | ctf_name_list_accum_cb_arg_t arg; | |
1031 | char **names; | |
49ea9b45 | 1032 | char *transformed_name = NULL; |
72c83edd NA |
1033 | ctf_file_t **files; |
1034 | FILE *f = NULL; | |
1035 | int err; | |
1036 | long fsize; | |
1037 | const char *errloc; | |
1038 | unsigned char *buf = NULL; | |
1039 | ||
1040 | memset (&arg, 0, sizeof (ctf_name_list_accum_cb_arg_t)); | |
1041 | arg.fp = fp; | |
1042 | ||
72c83edd NA |
1043 | if (fp->ctf_link_outputs) |
1044 | { | |
1045 | ctf_dynhash_iter (fp->ctf_link_outputs, ctf_accumulate_archive_names, &arg); | |
1046 | if (ctf_errno (fp) < 0) | |
1047 | { | |
1048 | errloc = "hash creation"; | |
1049 | goto err; | |
1050 | } | |
1051 | } | |
1052 | ||
1053 | /* No extra outputs? Just write a simple ctf_file_t. */ | |
1054 | if (arg.i == 0) | |
1055 | return ctf_write_mem (fp, size, threshold); | |
1056 | ||
1057 | /* Writing an archive. Stick ourselves (the shared repository, parent of all | |
1058 | other archives) on the front of it with the default name. */ | |
1059 | if ((names = realloc (arg.names, sizeof (char *) * (arg.i + 1))) == NULL) | |
1060 | { | |
1061 | errloc = "name reallocation"; | |
1062 | goto err_no; | |
1063 | } | |
1064 | arg.names = names; | |
1065 | memmove (&(arg.names[1]), arg.names, sizeof (char *) * (arg.i)); | |
49ea9b45 | 1066 | |
72c83edd | 1067 | arg.names[0] = (char *) _CTF_SECTION; |
49ea9b45 NA |
1068 | if (fp->ctf_link_memb_name_changer) |
1069 | { | |
1070 | void *nc_arg = fp->ctf_link_memb_name_changer_arg; | |
1071 | ||
1072 | transformed_name = fp->ctf_link_memb_name_changer (fp, _CTF_SECTION, | |
1073 | nc_arg); | |
1074 | ||
1075 | if (transformed_name != NULL) | |
1076 | { | |
1077 | arg.names[0] = transformed_name; | |
1078 | ctf_dynhash_iter (fp->ctf_link_outputs, ctf_change_parent_name, | |
1079 | transformed_name); | |
1080 | } | |
1081 | } | |
72c83edd NA |
1082 | |
1083 | if ((files = realloc (arg.files, | |
1084 | sizeof (struct ctf_file *) * (arg.i + 1))) == NULL) | |
1085 | { | |
1086 | errloc = "ctf_file reallocation"; | |
1087 | goto err_no; | |
1088 | } | |
1089 | arg.files = files; | |
1090 | memmove (&(arg.files[1]), arg.files, sizeof (ctf_file_t *) * (arg.i)); | |
1091 | arg.files[0] = fp; | |
1092 | ||
1093 | if ((f = tmpfile ()) == NULL) | |
1094 | { | |
1095 | errloc = "tempfile creation"; | |
1096 | goto err_no; | |
1097 | } | |
1098 | ||
1099 | if ((err = ctf_arc_write_fd (fileno (f), arg.files, arg.i + 1, | |
1100 | (const char **) arg.names, | |
1101 | threshold)) < 0) | |
1102 | { | |
1103 | errloc = "archive writing"; | |
1104 | ctf_set_errno (fp, err); | |
1105 | goto err; | |
1106 | } | |
1107 | ||
1108 | if (fseek (f, 0, SEEK_END) < 0) | |
1109 | { | |
1110 | errloc = "seeking to end"; | |
1111 | goto err_no; | |
1112 | } | |
1113 | ||
1114 | if ((fsize = ftell (f)) < 0) | |
1115 | { | |
1116 | errloc = "filesize determination"; | |
1117 | goto err_no; | |
1118 | } | |
1119 | ||
1120 | if (fseek (f, 0, SEEK_SET) < 0) | |
1121 | { | |
1122 | errloc = "filepos resetting"; | |
1123 | goto err_no; | |
1124 | } | |
1125 | ||
1126 | if ((buf = malloc (fsize)) == NULL) | |
1127 | { | |
1128 | errloc = "CTF archive buffer allocation"; | |
1129 | goto err_no; | |
1130 | } | |
1131 | ||
1132 | while (!feof (f) && fread (buf, fsize, 1, f) == 0) | |
1133 | if (ferror (f)) | |
1134 | { | |
1135 | errloc = "reading archive from temporary file"; | |
1136 | goto err_no; | |
1137 | } | |
1138 | ||
1139 | *size = fsize; | |
1140 | free (arg.names); | |
1141 | free (arg.files); | |
49ea9b45 NA |
1142 | free (transformed_name); |
1143 | if (arg.ndynames) | |
1144 | { | |
1145 | size_t i; | |
1146 | for (i = 0; i < arg.ndynames; i++) | |
1147 | free (arg.dynames[i]); | |
1148 | free (arg.dynames); | |
1149 | } | |
e3f17159 | 1150 | fclose (f); |
72c83edd NA |
1151 | return buf; |
1152 | ||
1153 | err_no: | |
1154 | ctf_set_errno (fp, errno); | |
1155 | err: | |
1156 | free (buf); | |
1157 | if (f) | |
1158 | fclose (f); | |
1159 | free (arg.names); | |
1160 | free (arg.files); | |
49ea9b45 NA |
1161 | free (transformed_name); |
1162 | if (arg.ndynames) | |
1163 | { | |
1164 | size_t i; | |
1165 | for (i = 0; i < arg.ndynames; i++) | |
1166 | free (arg.dynames[i]); | |
1167 | free (arg.dynames); | |
1168 | } | |
8d2229ad NA |
1169 | ctf_err_warn (fp, 0, "Cannot write archive in link: %s failure: %s", errloc, |
1170 | ctf_errmsg (ctf_errno (fp))); | |
72c83edd NA |
1171 | return NULL; |
1172 | } |