-
Notifications
You must be signed in to change notification settings - Fork 53
/
btf_encoder.c
875 lines (731 loc) · 21.8 KB
/
btf_encoder.c
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
/*
SPDX-License-Identifier: GPL-2.0-only
Copyright (C) 2019 Facebook
Derived from ctf_encoder.c, which is:
Copyright (C) Arnaldo Carvalho de Melo <acme@redhat.com>
Copyright (C) Red Hat Inc
*/
#include "dwarves.h"
#include "libbtf.h"
#include "lib/bpf/include/uapi/linux/btf.h"
#include "lib/bpf/src/libbpf.h"
#include "hash.h"
#include "elf_symtab.h"
#include "btf_encoder.h"
#include <ctype.h> /* for isalpha() and isalnum() */
#include <stdlib.h> /* for qsort() and bsearch() */
#include <inttypes.h>
/*
* This corresponds to the same macro defined in
* include/linux/kallsyms.h
*/
#define KSYM_NAME_LEN 128
struct funcs_layout {
unsigned long mcount_start;
unsigned long mcount_stop;
unsigned long mcount_sec_idx;
};
struct elf_function {
const char *name;
unsigned long addr;
unsigned long sh_addr;
bool generated;
};
static struct elf_function *functions;
static int functions_alloc;
static int functions_cnt;
static int functions_cmp(const void *_a, const void *_b)
{
const struct elf_function *a = _a;
const struct elf_function *b = _b;
return strcmp(a->name, b->name);
}
static void delete_functions(void)
{
free(functions);
functions_alloc = functions_cnt = 0;
functions = NULL;
}
#ifndef max
#define max(x, y) ((x) < (y) ? (y) : (x))
#endif
static int collect_function(struct btf_elf *btfe, GElf_Sym *sym,
size_t sym_sec_idx)
{
struct elf_function *new;
static GElf_Shdr sh;
static size_t last_idx;
const char *name;
if (elf_sym__type(sym) != STT_FUNC)
return 0;
name = elf_sym__name(sym, btfe->symtab);
if (!name)
return 0;
if (functions_cnt == functions_alloc) {
functions_alloc = max(1000, functions_alloc * 3 / 2);
new = realloc(functions, functions_alloc * sizeof(*functions));
if (!new) {
/*
* The cleanup - delete_functions is called
* in cu__encode_btf error path.
*/
return -1;
}
functions = new;
}
if (sym_sec_idx != last_idx) {
if (!elf_section_by_idx(btfe->elf, &sh, sym_sec_idx))
return 0;
last_idx = sym_sec_idx;
}
functions[functions_cnt].name = name;
functions[functions_cnt].addr = elf_sym__value(sym);
functions[functions_cnt].sh_addr = sh.sh_addr;
functions[functions_cnt].generated = false;
functions_cnt++;
return 0;
}
static int addrs_cmp(const void *_a, const void *_b)
{
const __u64 *a = _a;
const __u64 *b = _b;
if (*a == *b)
return 0;
return *a < *b ? -1 : 1;
}
static int get_vmlinux_addrs(struct btf_elf *btfe, struct funcs_layout *fl,
__u64 **paddrs, __u64 *pcount)
{
__u64 *addrs, count, offset;
unsigned int addr_size, i;
Elf_Data *data;
GElf_Shdr shdr;
Elf_Scn *sec;
/* Initialize for the sake of all error paths below. */
*paddrs = NULL;
*pcount = 0;
if (!fl->mcount_start || !fl->mcount_stop)
return 0;
/*
* Find mcount addressed marked by __start_mcount_loc
* and __stop_mcount_loc symbols and load them into
* sorted array.
*/
sec = elf_getscn(btfe->elf, fl->mcount_sec_idx);
if (!sec || !gelf_getshdr(sec, &shdr)) {
fprintf(stderr, "Failed to get section(%lu) header.\n",
fl->mcount_sec_idx);
return -1;
}
/* Get address size from processed file's ELF class. */
addr_size = gelf_getclass(btfe->elf) == ELFCLASS32 ? 4 : 8;
offset = fl->mcount_start - shdr.sh_addr;
count = (fl->mcount_stop - fl->mcount_start) / addr_size;
data = elf_getdata(sec, 0);
if (!data) {
fprintf(stderr, "Failed to get section(%lu) data.\n",
fl->mcount_sec_idx);
return -1;
}
addrs = malloc(count * sizeof(addrs[0]));
if (!addrs) {
fprintf(stderr, "Failed to allocate memory for ftrace addresses.\n");
return -1;
}
if (addr_size == sizeof(__u64)) {
memcpy(addrs, data->d_buf + offset, count * addr_size);
} else {
for (i = 0; i < count; i++)
addrs[i] = (__u64) *((__u32 *) (data->d_buf + offset + i * addr_size));
}
*paddrs = addrs;
*pcount = count;
return 0;
}
static int
get_kmod_addrs(struct btf_elf *btfe, __u64 **paddrs, __u64 *pcount)
{
__u64 *addrs, count;
unsigned int addr_size, i;
GElf_Shdr shdr_mcount;
Elf_Data *data;
Elf_Scn *sec;
/* Initialize for the sake of all error paths below. */
*paddrs = NULL;
*pcount = 0;
/* get __mcount_loc */
sec = elf_section_by_name(btfe->elf, &btfe->ehdr, &shdr_mcount,
"__mcount_loc", NULL);
if (!sec) {
if (btf_elf__verbose) {
printf("%s: '%s' doesn't have __mcount_loc section\n", __func__,
btfe->filename);
}
return 0;
}
data = elf_getdata(sec, NULL);
if (!data) {
fprintf(stderr, "Failed to data for __mcount_loc section.\n");
return -1;
}
/* Get address size from processed file's ELF class. */
addr_size = gelf_getclass(btfe->elf) == ELFCLASS32 ? 4 : 8;
count = data->d_size / addr_size;
addrs = malloc(count * sizeof(addrs[0]));
if (!addrs) {
fprintf(stderr, "Failed to allocate memory for ftrace addresses.\n");
return -1;
}
if (addr_size == sizeof(__u64)) {
memcpy(addrs, data->d_buf, count * addr_size);
} else {
for (i = 0; i < count; i++)
addrs[i] = (__u64) *((__u32 *) (data->d_buf + i * addr_size));
}
/*
* We get Elf object from dwfl_module_getelf function,
* which performs all possible relocations, including
* __mcount_loc section.
*
* So addrs array now contains relocated values, which
* we need take into account when we compare them to
* functions values, see comment in setup_functions
* function.
*/
*paddrs = addrs;
*pcount = count;
return 0;
}
static int setup_functions(struct btf_elf *btfe, struct funcs_layout *fl)
{
__u64 *addrs, count, i;
int functions_valid = 0;
bool kmod = false;
/*
* Check if we are processing vmlinux image and
* get mcount data if it's detected.
*/
if (get_vmlinux_addrs(btfe, fl, &addrs, &count))
return -1;
/*
* Check if we are processing kernel module and
* get mcount data if it's detected.
*/
if (!addrs) {
if (get_kmod_addrs(btfe, &addrs, &count))
return -1;
kmod = true;
}
if (!addrs) {
if (btf_elf__verbose)
printf("ftrace symbols not detected, falling back to DWARF data\n");
delete_functions();
return 0;
}
qsort(addrs, count, sizeof(addrs[0]), addrs_cmp);
qsort(functions, functions_cnt, sizeof(functions[0]), functions_cmp);
/*
* Let's got through all collected functions and filter
* out those that are not in ftrace.
*/
for (i = 0; i < functions_cnt; i++) {
struct elf_function *func = &functions[i];
/*
* For vmlinux image both addrs[x] and functions[x]::addr
* values are final address and are comparable.
*
* For kernel module addrs[x] is final address, but
* functions[x]::addr is relative address within section
* and needs to be relocated by adding sh_addr.
*/
__u64 addr = kmod ? func->addr + func->sh_addr : func->addr;
/* Make sure function is within ftrace addresses. */
if (bsearch(&addr, addrs, count, sizeof(addrs[0]), addrs_cmp)) {
/*
* We iterate over sorted array, so we can easily skip
* not valid item and move following valid field into
* its place, and still keep the 'new' array sorted.
*/
if (i != functions_valid)
functions[functions_valid] = functions[i];
functions_valid++;
}
}
functions_cnt = functions_valid;
free(addrs);
if (btf_elf__verbose)
printf("Found %d functions!\n", functions_cnt);
return 0;
}
static struct elf_function *find_function(const struct btf_elf *btfe,
const char *name)
{
struct elf_function key = { .name = name };
return bsearch(&key, functions, functions_cnt, sizeof(functions[0]),
functions_cmp);
}
static bool btf_name_char_ok(char c, bool first)
{
if (c == '_' || c == '.')
return true;
return first ? isalpha(c) : isalnum(c);
}
/* Check whether the given name is valid in vmlinux btf. */
static bool btf_name_valid(const char *p)
{
const char *limit;
if (!btf_name_char_ok(*p, true))
return false;
/* set a limit on identifier length */
limit = p + KSYM_NAME_LEN;
p++;
while (*p && p < limit) {
if (!btf_name_char_ok(*p, false))
return false;
p++;
}
return !*p;
}
static void dump_invalid_symbol(const char *msg, const char *sym,
int verbose, bool force)
{
if (force) {
if (verbose)
fprintf(stderr, "PAHOLE: Warning: %s, ignored (sym: '%s').\n",
msg, sym);
return;
}
fprintf(stderr, "PAHOLE: Error: %s (sym: '%s').\n", msg, sym);
fprintf(stderr, "PAHOLE: Error: Use '--btf_encode_force' to ignore such symbols and force emit the btf.\n");
}
extern struct debug_fmt_ops *dwarves__active_loader;
static int tag__check_id_drift(const struct tag *tag,
uint32_t core_id, uint32_t btf_type_id,
uint32_t type_id_off)
{
if (btf_type_id != (core_id + type_id_off)) {
fprintf(stderr,
"%s: %s id drift, core_id: %u, btf_type_id: %u, type_id_off: %u\n",
__func__, dwarf_tag_name(tag->tag),
core_id, btf_type_id, type_id_off);
return -1;
}
return 0;
}
static int32_t structure_type__encode(struct btf_elf *btfe, struct cu *cu, struct tag *tag, uint32_t type_id_off)
{
struct type *type = tag__type(tag);
struct class_member *pos;
const char *name;
int32_t type_id;
uint8_t kind;
kind = (tag->tag == DW_TAG_union_type) ?
BTF_KIND_UNION : BTF_KIND_STRUCT;
name = dwarves__active_loader->strings__ptr(cu, type->namespace.name);
type_id = btf_elf__add_struct(btfe, kind, name, type->size);
if (type_id < 0)
return type_id;
type__for_each_data_member(type, pos) {
/*
* dwarf_loader uses DWARF's recommended bit offset addressing
* scheme, which conforms to BTF requirement, so no conversion
* is required.
*/
name = dwarves__active_loader->strings__ptr(cu, pos->name);
if (btf_elf__add_member(btfe, name, type_id_off + pos->tag.type, pos->bitfield_size, pos->bit_offset))
return -1;
}
return type_id;
}
static uint32_t array_type__nelems(struct tag *tag)
{
int i;
uint32_t nelem = 1;
struct array_type *array = tag__array_type(tag);
for (i = array->dimensions - 1; i >= 0; --i)
nelem *= array->nr_entries[i];
return nelem;
}
static int32_t enumeration_type__encode(struct btf_elf *btfe, struct cu *cu, struct tag *tag)
{
struct type *etype = tag__type(tag);
struct enumerator *pos;
const char *name;
int32_t type_id;
name = dwarves__active_loader->strings__ptr(cu, etype->namespace.name);
type_id = btf_elf__add_enum(btfe, name, etype->size);
if (type_id < 0)
return type_id;
type__for_each_enumerator(etype, pos) {
name = dwarves__active_loader->strings__ptr(cu, pos->name);
if (btf_elf__add_enum_val(btfe, name, pos->value))
return -1;
}
return type_id;
}
static bool need_index_type;
static int tag__encode_btf(struct cu *cu, struct tag *tag, uint32_t core_id, struct btf_elf *btfe,
uint32_t array_index_id, uint32_t type_id_off)
{
/* single out type 0 as it represents special type "void" */
uint32_t ref_type_id = tag->type == 0 ? 0 : type_id_off + tag->type;
const char *name;
switch (tag->tag) {
case DW_TAG_base_type:
name = dwarves__active_loader->strings__ptr(cu, tag__base_type(tag)->name);
return btf_elf__add_base_type(btfe, tag__base_type(tag), name);
case DW_TAG_const_type:
return btf_elf__add_ref_type(btfe, BTF_KIND_CONST, ref_type_id, NULL, false);
case DW_TAG_pointer_type:
return btf_elf__add_ref_type(btfe, BTF_KIND_PTR, ref_type_id, NULL, false);
case DW_TAG_restrict_type:
return btf_elf__add_ref_type(btfe, BTF_KIND_RESTRICT, ref_type_id, NULL, false);
case DW_TAG_volatile_type:
return btf_elf__add_ref_type(btfe, BTF_KIND_VOLATILE, ref_type_id, NULL, false);
case DW_TAG_typedef:
name = dwarves__active_loader->strings__ptr(cu, tag__namespace(tag)->name);
return btf_elf__add_ref_type(btfe, BTF_KIND_TYPEDEF, ref_type_id, name, false);
case DW_TAG_structure_type:
case DW_TAG_union_type:
case DW_TAG_class_type:
name = dwarves__active_loader->strings__ptr(cu, tag__namespace(tag)->name);
if (tag__type(tag)->declaration)
return btf_elf__add_ref_type(btfe, BTF_KIND_FWD, 0, name, tag->tag == DW_TAG_union_type);
else
return structure_type__encode(btfe, cu, tag, type_id_off);
case DW_TAG_array_type:
/* TODO: Encode one dimension at a time. */
need_index_type = true;
return btf_elf__add_array(btfe, ref_type_id, array_index_id, array_type__nelems(tag));
case DW_TAG_enumeration_type:
return enumeration_type__encode(btfe, cu, tag);
case DW_TAG_subroutine_type:
return btf_elf__add_func_proto(btfe, cu, tag__ftype(tag), type_id_off);
default:
fprintf(stderr, "Unsupported DW_TAG_%s(0x%x)\n",
dwarf_tag_name(tag->tag), tag->tag);
return -1;
}
}
static struct btf_elf *btfe;
static uint32_t array_index_id;
static bool has_index_type;
int btf_encoder__encode()
{
int err;
if (gobuffer__size(&btfe->percpu_secinfo) != 0)
btf_elf__add_datasec_type(btfe, PERCPU_SECTION, &btfe->percpu_secinfo);
err = btf_elf__encode(btfe, 0);
delete_functions();
btf_elf__delete(btfe);
btfe = NULL;
return err;
}
#define MAX_PERCPU_VAR_CNT 4096
struct var_info {
uint64_t addr;
uint32_t sz;
const char *name;
};
static struct var_info percpu_vars[MAX_PERCPU_VAR_CNT];
static int percpu_var_cnt;
static int percpu_var_cmp(const void *_a, const void *_b)
{
const struct var_info *a = _a;
const struct var_info *b = _b;
if (a->addr == b->addr)
return 0;
return a->addr < b->addr ? -1 : 1;
}
static bool percpu_var_exists(uint64_t addr, uint32_t *sz, const char **name)
{
const struct var_info *p;
struct var_info key = { .addr = addr };
p = bsearch(&key, percpu_vars, percpu_var_cnt,
sizeof(percpu_vars[0]), percpu_var_cmp);
if (!p)
return false;
*sz = p->sz;
*name = p->name;
return true;
}
static int collect_percpu_var(struct btf_elf *btfe, GElf_Sym *sym,
size_t sym_sec_idx)
{
const char *sym_name;
uint64_t addr;
uint32_t size;
/* compare a symbol's shndx to determine if it's a percpu variable */
if (sym_sec_idx != btfe->percpu_shndx)
return 0;
if (elf_sym__type(sym) != STT_OBJECT)
return 0;
addr = elf_sym__value(sym);
size = elf_sym__size(sym);
if (!size)
return 0; /* ignore zero-sized symbols */
sym_name = elf_sym__name(sym, btfe->symtab);
if (!btf_name_valid(sym_name)) {
dump_invalid_symbol("Found symbol of invalid name when encoding btf",
sym_name, btf_elf__verbose, btf_elf__force);
if (btf_elf__force)
return 0;
return -1;
}
if (btf_elf__verbose)
printf("Found per-CPU symbol '%s' at address 0x%" PRIx64 "\n", sym_name, addr);
if (percpu_var_cnt == MAX_PERCPU_VAR_CNT) {
fprintf(stderr, "Reached the limit of per-CPU variables: %d\n",
MAX_PERCPU_VAR_CNT);
return -1;
}
percpu_vars[percpu_var_cnt].addr = addr;
percpu_vars[percpu_var_cnt].sz = size;
percpu_vars[percpu_var_cnt].name = sym_name;
percpu_var_cnt++;
return 0;
}
static void collect_symbol(GElf_Sym *sym, struct funcs_layout *fl,
size_t sym_sec_idx)
{
if (!fl->mcount_start &&
!strcmp("__start_mcount_loc", elf_sym__name(sym, btfe->symtab))) {
fl->mcount_start = sym->st_value;
fl->mcount_sec_idx = sym_sec_idx;
}
if (!fl->mcount_stop &&
!strcmp("__stop_mcount_loc", elf_sym__name(sym, btfe->symtab)))
fl->mcount_stop = sym->st_value;
}
static int collect_symbols(struct btf_elf *btfe, bool collect_percpu_vars)
{
struct funcs_layout fl = { };
Elf32_Word sym_sec_idx;
uint32_t core_id;
GElf_Sym sym;
/* cache variables' addresses, preparing for searching in symtab. */
percpu_var_cnt = 0;
/* search within symtab for percpu variables */
elf_symtab__for_each_symbol_index(btfe->symtab, core_id, sym, sym_sec_idx) {
if (collect_percpu_vars && collect_percpu_var(btfe, &sym, sym_sec_idx))
return -1;
if (collect_function(btfe, &sym, sym_sec_idx))
return -1;
collect_symbol(&sym, &fl, sym_sec_idx);
}
if (collect_percpu_vars) {
if (percpu_var_cnt)
qsort(percpu_vars, percpu_var_cnt, sizeof(percpu_vars[0]), percpu_var_cmp);
if (btf_elf__verbose)
printf("Found %d per-CPU variables!\n", percpu_var_cnt);
}
if (functions_cnt && setup_functions(btfe, &fl)) {
fprintf(stderr, "Failed to filter DWARF functions\n");
return -1;
}
return 0;
}
static bool has_arg_names(struct cu *cu, struct ftype *ftype)
{
struct parameter *param;
const char *name;
ftype__for_each_parameter(ftype, param) {
name = dwarves__active_loader->strings__ptr(cu, param->name);
if (name == NULL)
return false;
}
return true;
}
int cu__encode_btf(struct cu *cu, int verbose, bool force,
bool skip_encoding_vars)
{
uint32_t type_id_off;
uint32_t core_id;
struct variable *var;
struct function *fn;
struct tag *pos;
int err = 0;
btf_elf__verbose = verbose;
btf_elf__force = force;
if (btfe && strcmp(btfe->filename, cu->filename)) {
err = btf_encoder__encode();
if (err)
goto out;
/* Finished one file, add one empty line */
if (verbose)
printf("\n");
}
if (!btfe) {
btfe = btf_elf__new(cu->filename, cu->elf, base_btf);
if (!btfe)
return -1;
err = collect_symbols(btfe, !skip_encoding_vars);
if (err)
goto out;
has_index_type = false;
need_index_type = false;
array_index_id = 0;
if (verbose)
printf("File %s:\n", btfe->filename);
}
type_id_off = btf__get_nr_types(btfe->btf);
if (!has_index_type) {
/* cu__find_base_type_by_name() takes "type_id_t *id" */
type_id_t id;
if (cu__find_base_type_by_name(cu, "int", &id)) {
has_index_type = true;
array_index_id = type_id_off + id;
} else {
has_index_type = false;
array_index_id = type_id_off + cu->types_table.nr_entries;
}
}
cu__for_each_type(cu, core_id, pos) {
int32_t btf_type_id = tag__encode_btf(cu, pos, core_id, btfe, array_index_id, type_id_off);
if (btf_type_id < 0 ||
tag__check_id_drift(pos, core_id, btf_type_id, type_id_off)) {
err = -1;
goto out;
}
}
if (need_index_type && !has_index_type) {
struct base_type bt = {};
bt.name = 0;
bt.bit_size = 32;
btf_elf__add_base_type(btfe, &bt, "__ARRAY_SIZE_TYPE__");
has_index_type = true;
}
cu__for_each_function(cu, core_id, fn) {
int btf_fnproto_id, btf_fn_id;
const char *name;
/*
* Skip functions that:
* - are marked as declarations
* - do not have full argument names
* - are not in ftrace list (if it's available)
* - are not external (in case ftrace filter is not available)
*/
if (fn->declaration)
continue;
if (!has_arg_names(cu, &fn->proto))
continue;
if (functions_cnt) {
struct elf_function *func;
const char *name;
name = function__name(fn, cu);
if (!name)
continue;
func = find_function(btfe, name);
if (!func || func->generated)
continue;
func->generated = true;
} else {
if (!fn->external)
continue;
}
btf_fnproto_id = btf_elf__add_func_proto(btfe, cu, &fn->proto, type_id_off);
name = dwarves__active_loader->strings__ptr(cu, fn->name);
btf_fn_id = btf_elf__add_ref_type(btfe, BTF_KIND_FUNC, btf_fnproto_id, name, false);
if (btf_fnproto_id < 0 || btf_fn_id < 0) {
err = -1;
printf("error: failed to encode function '%s'\n", function__name(fn, cu));
goto out;
}
}
if (skip_encoding_vars)
goto out;
if (btfe->percpu_shndx == 0 || !btfe->symtab)
goto out;
if (verbose)
printf("search cu '%s' for percpu global variables.\n", cu->name);
cu__for_each_variable(cu, core_id, pos) {
uint32_t size, type, linkage;
const char *name, *dwarf_name;
uint64_t addr;
int id;
var = tag__variable(pos);
if (var->declaration && !var->spec)
continue;
/* percpu variables are allocated in global space */
if (variable__scope(var) != VSCOPE_GLOBAL && !var->spec)
continue;
/* addr has to be recorded before we follow spec */
addr = var->ip.addr;
/* DWARF takes into account .data..percpu section offset
* within its segment, which for vmlinux is 0, but for kernel
* modules is >0. ELF symbols, on the other hand, don't take
* into account these offsets (as they are relative to the
* section start), so to match DWARF and ELF symbols we need
* to negate the section base address here.
*/
if (addr < btfe->percpu_base_addr || addr >= btfe->percpu_base_addr + btfe->percpu_sec_sz)
continue;
addr -= btfe->percpu_base_addr;
if (!percpu_var_exists(addr, &size, &name))
continue; /* not a per-CPU variable */
/* A lot of "special" DWARF variables (e.g, __UNIQUE_ID___xxx)
* have addr == 0, which is the same as, say, valid
* fixed_percpu_data per-CPU variable. To distinguish between
* them, additionally compare DWARF and ELF symbol names. If
* DWARF doesn't provide proper name, pessimistically assume
* bad variable.
*
* Examples of such special variables are:
*
* 1. __ADDRESSABLE(sym), which are forcely emitted as symbols.
* 2. __UNIQUE_ID(prefix), which are introduced to generate unique ids.
* 3. __exitcall(fn), functions which are labeled as exit calls.
*
* This is relevant only for vmlinux image, as for kernel
* modules per-CPU data section has non-zero offset so all
* per-CPU symbols have non-zero values.
*/
if (var->ip.addr == 0) {
dwarf_name = variable__name(var, cu);
if (!dwarf_name || strcmp(dwarf_name, name))
continue;
}
if (var->spec)
var = var->spec;
if (var->ip.tag.type == 0) {
fprintf(stderr, "error: found variable '%s' in CU '%s' that has void type\n",
name, cu->name);
if (force)
continue;
err = -1;
break;
}
type = var->ip.tag.type + type_id_off;
linkage = var->external ? BTF_VAR_GLOBAL_ALLOCATED : BTF_VAR_STATIC;
if (btf_elf__verbose) {
printf("Variable '%s' from CU '%s' at address 0x%" PRIx64 " encoded\n",
name, cu->name, addr);
}
/* add a BTF_KIND_VAR in btfe->types */
id = btf_elf__add_var_type(btfe, type, name, linkage);
if (id < 0) {
err = -1;
fprintf(stderr, "error: failed to encode variable '%s' at addr 0x%" PRIx64 "\n",
name, addr);
break;
}
/*
* add a BTF_VAR_SECINFO in btfe->percpu_secinfo, which will be added into
* btfe->types later when we add BTF_VAR_DATASEC.
*/
id = btf_elf__add_var_secinfo(&btfe->percpu_secinfo, id, addr, size);
if (id < 0) {
err = -1;
fprintf(stderr, "error: failed to encode section info for variable '%s' at addr 0x%" PRIx64 "\n",
name, addr);
break;
}
}
out:
if (err) {
delete_functions();
btf_elf__delete(btfe);
btfe = NULL;
}
return err;
}