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