-
Notifications
You must be signed in to change notification settings - Fork 1
/
dwarves.h
1136 lines (988 loc) · 32.8 KB
/
dwarves.h
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
#ifndef _DWARVES_H_
#define _DWARVES_H_ 1
/*
Copyright (C) 2006 Mandriva Conectiva S.A.
Copyright (C) 2006..2009 Arnaldo Carvalho de Melo <[email protected]>
This program is free software; you can redistribute it and/or modify it
under the terms of version 2 of the GNU General Public License as
published by the Free Software Foundation.
*/
#include <stdint.h>
#include <stdio.h>
#include <obstack.h>
#include <dwarf.h>
#include <elfutils/libdwfl.h>
#include "dutil.h"
#include "list.h"
#include "rbtree.h"
#include "strings.h"
struct cu;
enum load_steal_kind {
LSK__KEEPIT,
LSK__DELETE,
LSK__STOP_LOADING,
};
/** struct conf_load - load configuration
* @extra_dbg_info - keep original debugging format extra info
* (e.g. DWARF's decl_{line,file}, id, etc)
* @fixup_silly_bitfields - Fixup silly things such as "int foo:32;"
* @get_addr_info - wheter to load DW_AT_location and other addr info
*/
struct conf_load {
enum load_steal_kind (*steal)(struct cu *cu,
struct conf_load *conf);
void *cookie;
char *format_path;
bool extra_dbg_info;
bool fixup_silly_bitfields;
bool get_addr_info;
};
/** struct conf_fprintf - hints to the __fprintf routines
*
* @flat_arrays - a->foo[10][2] becomes a->foo[20]
* @classes_as_structs - class f becomes struct f, CTF doesn't have a "class"
* @cachelinep - pointer to current cacheline, so that when expanding types we keep track of it,
* needs to be "global", i.e. not set at each recursion.
*/
struct conf_fprintf {
const char *prefix;
const char *suffix;
int32_t type_spacing;
int32_t name_spacing;
uint32_t base_offset;
uint32_t *cachelinep;
uint8_t indent;
uint8_t expand_types:1;
uint8_t expand_pointers:1;
uint8_t rel_offset:1;
uint8_t emit_stats:1;
uint8_t suppress_comments:1;
uint8_t suppress_offset_comment:1;
uint8_t show_decl_info:1;
uint8_t show_only_data_members:1;
uint8_t no_semicolon:1;
uint8_t show_first_biggest_size_base_type_member:1;
uint8_t flat_arrays:1;
uint8_t no_parm_names:1;
uint8_t classes_as_structs:1;
uint8_t hex_fmt:1;
};
struct cus {
struct list_head cus;
};
struct cus *cus__new(void);
void cus__delete(struct cus *cus);
int cus__load_file(struct cus *cus, struct conf_load *conf,
const char *filename);
int cus__load_files(struct cus *cus, struct conf_load *conf,
char *filenames[]);
int cus__fprintf_load_files_err(struct cus *cus, const char *tool,
char *argv[], int err, FILE *output);
int cus__load_dir(struct cus *cus, struct conf_load *conf,
const char *dirname, const char *filename_mask,
const int recursive);
void cus__add(struct cus *cus, struct cu *cu);
void cus__print_error_msg(const char *progname, const struct cus *cus,
const char *filename, const int err);
struct cu *cus__find_cu_by_name(const struct cus *cus, const char *name);
struct tag *cus__find_struct_by_name(const struct cus *cus, struct cu **cu,
const char *name, const int include_decls,
uint16_t *id);
struct function *cus__find_function_at_addr(const struct cus *cus,
uint64_t addr, struct cu **cu);
void cus__for_each_cu(struct cus *cus, int (*iterator)(struct cu *cu, void *cookie),
void *cookie,
struct cu *(*filter)(struct cu *cu));
struct ptr_table {
void **entries;
uint32_t nr_entries;
uint32_t allocated_entries;
};
struct function;
struct tag;
struct cu;
struct variable;
/* Same as DW_LANG, so that we don't have to include dwarf.h in CTF */
enum dwarf_languages {
LANG_C89 = 0x01, /* ISO C:1989 */
LANG_C = 0x02, /* C */
LANG_Ada83 = 0x03, /* ISO Ada:1983 */
LANG_C_plus_plus = 0x04, /* ISO C++:1998 */
LANG_Cobol74 = 0x05, /* ISO Cobol:1974 */
LANG_Cobol85 = 0x06, /* ISO Cobol:1985 */
LANG_Fortran77 = 0x07, /* ISO FORTRAN 77 */
LANG_Fortran90 = 0x08, /* ISO Fortran 90 */
LANG_Pascal83 = 0x09, /* ISO Pascal:1983 */
LANG_Modula2 = 0x0a, /* ISO Modula-2:1996 */
LANG_Java = 0x0b, /* Java */
LANG_C99 = 0x0c, /* ISO C:1999 */
LANG_Ada95 = 0x0d, /* ISO Ada:1995 */
LANG_Fortran95 = 0x0e, /* ISO Fortran 95 */
LANG_PL1 = 0x0f, /* ISO PL/1:1976 */
LANG_Objc = 0x10, /* Objective-C */
LANG_ObjC_plus_plus = 0x11, /* Objective-C++ */
LANG_UPC = 0x12, /* Unified Parallel C */
LANG_D = 0x13, /* D */
};
/** struct debug_fmt_ops - specific to the underlying debug file format
*
* @function__name - will be called by function__name(), giving a chance to
* formats such as CTF to get this from some other place
* than the global strings table. CTF does this by storing
* GElf_Sym->st_name in function->name, and by using
* function->name as an index into the .strtab ELF section.
* @variable__name - will be called by variable__name(), see @function_name
* cu__delete - called at cu__delete(), to give a chance to formats such as
* CTF to keep the .strstab ELF section available till the cu is
* deleted. See @function__name
*/
struct debug_fmt_ops {
const char *name;
int (*init)(void);
void (*exit)(void);
int (*load_file)(struct cus *cus,
struct conf_load *conf,
const char *filename);
const char *(*tag__decl_file)(const struct tag *tag,
const struct cu *cu);
uint32_t (*tag__decl_line)(const struct tag *tag,
const struct cu *cu);
unsigned long long (*tag__orig_id)(const struct tag *tag,
const struct cu *cu);
void (*tag__free_orig_info)(struct tag *tag,
struct cu *cu);
const char *(*function__name)(struct function *tag,
const struct cu *cu);
const char *(*variable__name)(const struct variable *var,
const struct cu *cu);
const char *(*strings__ptr)(const struct cu *cu, strings_t s);
void (*cu__delete)(struct cu *cu);
};
struct cu {
struct list_head node;
struct list_head tags;
struct list_head tool_list; /* To be used by tools such as ctracer */
struct ptr_table types_table;
struct ptr_table functions_table;
struct ptr_table tags_table;
struct rb_root functions;
char *name;
char *filename;
void *priv;
struct obstack obstack;
struct debug_fmt_ops *dfops;
Elf *elf;
Dwfl_Module *dwfl;
uint32_t cached_symtab_nr_entries;
uint8_t addr_size;
uint8_t extra_dbg_info:1;
uint8_t has_addr_info:1;
uint8_t uses_global_strings:1;
uint16_t language;
unsigned long nr_inline_expansions;
size_t size_inline_expansions;
uint32_t nr_functions_changed;
uint32_t nr_structures_changed;
size_t max_len_changed_item;
size_t function_bytes_added;
size_t function_bytes_removed;
int build_id_len;
unsigned char build_id[0];
};
struct cu *cu__new(const char *name, uint8_t addr_size,
const unsigned char *build_id, int build_id_len,
const char *filename);
void cu__delete(struct cu *cu);
const char *cu__string(const struct cu *cu, strings_t s);
static inline int cu__cache_symtab(struct cu *cu)
{
int err = dwfl_module_getsymtab(cu->dwfl);
if (err > 0)
cu->cached_symtab_nr_entries = dwfl_module_getsymtab(cu->dwfl);
return err;
}
static inline __pure bool cu__is_c_plus_plus(const struct cu *cu)
{
return cu->language == LANG_C_plus_plus;
}
/**
* cu__for_each_cached_symtab_entry - iterate thru the cached symtab entries
* @cu: struct cu instance
* @id: uint32_t tag id
* @pos: struct GElf_Sym iterator
* @name: char pointer where the symbol_name will be stored
*/
#define cu__for_each_cached_symtab_entry(cu, id, pos, name) \
for (id = 1, \
name = dwfl_module_getsym(cu->dwfl, id, &sym, NULL); \
id < cu->cached_symtab_nr_entries; \
++id, name = dwfl_module_getsym(cu->dwfl, id, &sym, NULL))
/**
* cu__for_each_type - iterate thru all the type tags
* @cu: struct cu instance to iterate
* @id: uint16_t tag id
* @pos: struct tag iterator
*
* See cu__table_nullify_type_entry and users for the reason for
* the NULL test (hint: CTF Unknown types)
*/
#define cu__for_each_type(cu, id, pos) \
for (id = 1; id < cu->types_table.nr_entries; ++id) \
if (!(pos = cu->types_table.entries[id])) \
continue; \
else
/**
* cu__for_each_struct - iterate thru all the struct tags
* @cu: struct cu instance to iterate
* @pos: struct class iterator
* @id: uint16_t tag id
*/
#define cu__for_each_struct(cu, id, pos) \
for (id = 1; id < cu->types_table.nr_entries; ++id) \
if (!(pos = tag__class(cu->types_table.entries[id])) || \
!tag__is_struct(class__tag(pos))) \
continue; \
else
/**
* cu__for_each_function - iterate thru all the function tags
* @cu: struct cu instance to iterate
* @pos: struct function iterator
* @id: uint32_t tag id
*/
#define cu__for_each_function(cu, id, pos) \
for (id = 0; id < cu->functions_table.nr_entries; ++id) \
if (!(pos = tag__function(cu->functions_table.entries[id]))) \
continue; \
else
/**
* cu__for_each_variable - iterate thru all the global variable tags
* @cu: struct cu instance to iterate
* @pos: struct tag iterator
* @id: uint32_t tag id
*/
#define cu__for_each_variable(cu, id, pos) \
for (id = 0; id < cu->tags_table.nr_entries; ++id) \
if (!(pos = cu->tags_table.entries[id]) || \
!tag__is_variable(pos)) \
continue; \
else
int cu__add_tag(struct cu *cu, struct tag *tag, long *id);
int cu__table_add_tag(struct cu *cu, struct tag *tag, long *id);
int cu__table_nullify_type_entry(struct cu *cu, uint32_t id);
struct tag *cu__find_base_type_by_name(const struct cu *cu, const char *name,
uint16_t *id);
struct tag *cu__find_base_type_by_sname_and_size(const struct cu *cu,
strings_t name,
uint16_t bit_size,
uint16_t *idp);
struct tag *cu__find_enumeration_by_sname_and_size(const struct cu *cu,
strings_t sname,
uint16_t bit_size,
uint16_t *idp);
struct tag *cu__find_first_typedef_of_type(const struct cu *cu,
const uint16_t type);
struct tag *cu__find_function_by_name(const struct cu *cu, const char *name);
struct tag *cu__find_struct_by_sname(const struct cu *cu, strings_t sname,
const int include_decls, uint16_t *idp);
struct function *cu__find_function_at_addr(const struct cu *cu,
uint64_t addr);
struct tag *cu__function(const struct cu *cu, const uint32_t id);
struct tag *cu__tag(const struct cu *cu, const uint32_t id);
struct tag *cu__type(const struct cu *cu, const uint16_t id);
struct tag *cu__find_struct_by_name(const struct cu *cu, const char *name,
const int include_decls, uint16_t *id);
bool cu__same_build_id(const struct cu *cu, const struct cu *other);
void cu__account_inline_expansions(struct cu *cu);
int cu__for_all_tags(struct cu *cu,
int (*iterator)(struct tag *tag,
struct cu *cu, void *cookie),
void *cookie);
/** struct tag - basic representation of a debug info element
* @priv - extra data, for instance, DWARF offset, id, decl_{file,line}
* @top_level -
*/
struct tag {
struct list_head node;
uint16_t type;
uint16_t tag;
bool visited;
bool top_level;
uint16_t recursivity_level;
void *priv;
};
void tag__delete(struct tag *tag, struct cu *cu);
static inline int tag__is_enumeration(const struct tag *tag)
{
return tag->tag == DW_TAG_enumeration_type;
}
static inline int tag__is_namespace(const struct tag *tag)
{
return tag->tag == DW_TAG_namespace;
}
static inline int tag__is_struct(const struct tag *tag)
{
return tag->tag == DW_TAG_structure_type ||
tag->tag == DW_TAG_interface_type ||
tag->tag == DW_TAG_class_type;
}
static inline int tag__is_typedef(const struct tag *tag)
{
return tag->tag == DW_TAG_typedef;
}
static inline int tag__is_rvalue_reference_type(const struct tag *tag)
{
return tag->tag == DW_TAG_rvalue_reference_type;
}
static inline int tag__is_union(const struct tag *tag)
{
return tag->tag == DW_TAG_union_type;
}
static inline int tag__is_const(const struct tag *tag)
{
return tag->tag == DW_TAG_const_type;
}
static inline bool tag__is_variable(const struct tag *tag)
{
return tag->tag == DW_TAG_variable;
}
static inline bool tag__is_volatile(const struct tag *tag)
{
return tag->tag == DW_TAG_volatile_type;
}
static inline bool tag__has_namespace(const struct tag *tag)
{
return tag__is_struct(tag) ||
tag__is_union(tag) ||
tag__is_namespace(tag) ||
tag__is_enumeration(tag);
}
/**
* tag__is_tag_type - is this tag derived from the 'type' class?
* @tag - tag queried
*/
static inline int tag__is_type(const struct tag *tag)
{
return tag__is_union(tag) ||
tag__is_struct(tag) ||
tag__is_typedef(tag) ||
tag__is_rvalue_reference_type(tag) ||
tag__is_enumeration(tag);
}
/**
* tag__is_tag_type - is this one of the possible types for a tag?
* @tag - tag queried
*/
static inline int tag__is_tag_type(const struct tag *tag)
{
return tag__is_type(tag) ||
tag->tag == DW_TAG_array_type ||
tag->tag == DW_TAG_base_type ||
tag->tag == DW_TAG_const_type ||
tag->tag == DW_TAG_pointer_type ||
tag->tag == DW_TAG_rvalue_reference_type ||
tag->tag == DW_TAG_ptr_to_member_type ||
tag->tag == DW_TAG_reference_type ||
tag->tag == DW_TAG_restrict_type ||
tag->tag == DW_TAG_subroutine_type ||
tag->tag == DW_TAG_unspecified_type ||
tag->tag == DW_TAG_volatile_type;
}
static inline const char *tag__decl_file(const struct tag *tag,
const struct cu *cu)
{
if (cu->dfops && cu->dfops->tag__decl_file)
return cu->dfops->tag__decl_file(tag, cu);
return NULL;
}
static inline uint32_t tag__decl_line(const struct tag *tag,
const struct cu *cu)
{
if (cu->dfops && cu->dfops->tag__decl_line)
return cu->dfops->tag__decl_line(tag, cu);
return 0;
}
static inline unsigned long long tag__orig_id(const struct tag *tag,
const struct cu *cu)
{
if (cu->dfops && cu->dfops->tag__orig_id)
return cu->dfops->tag__orig_id(tag, cu);
return 0;
}
static inline void tag__free_orig_info(struct tag *tag, struct cu *cu)
{
if (cu->dfops && cu->dfops->tag__free_orig_info)
cu->dfops->tag__free_orig_info(tag, cu);
}
size_t tag__fprintf_decl_info(const struct tag *tag,
const struct cu *cu, FILE *fp);
size_t tag__fprintf(struct tag *tag, const struct cu *cu,
const struct conf_fprintf *conf, FILE *fp);
const char *tag__name(const struct tag *tag, const struct cu *cu,
char *bf, size_t len, const struct conf_fprintf *conf);
void tag__not_found_die(const char *file, int line, const char *func);
#define tag__assert_search_result(tag) \
do { if (!tag) tag__not_found_die(__FILE__,\
__LINE__, __func__); } while (0)
size_t tag__size(const struct tag *tag, const struct cu *cu);
size_t tag__nr_cachelines(const struct tag *tag, const struct cu *cu);
struct tag *tag__follow_typedef(const struct tag *tag, const struct cu *cu);
size_t __tag__id_not_found_fprintf(FILE *fp, uint16_t id,
const char *fn, int line);
#define tag__id_not_found_fprintf(fp, id) \
__tag__id_not_found_fprintf(fp, id, __func__, __LINE__)
int __tag__has_type_loop(const struct tag *tag, const struct tag *type,
char *bf, size_t len, FILE *fp,
const char *fn, int line);
#define tag__has_type_loop(tag, type, bf, len, fp) \
__tag__has_type_loop(tag, type, bf, len, fp, __func__, __LINE__)
struct ptr_to_member_type {
struct tag tag;
uint16_t containing_type;
};
static inline struct ptr_to_member_type *
tag__ptr_to_member_type(const struct tag *tag)
{
return (struct ptr_to_member_type *)tag;
}
/** struct namespace - base class for enums, structs, unions, typedefs, etc
*
* @sname - for clones, for instance, where we can't always add a new string
* @tags - class_member, enumerators, etc
* @shared_tags: if this bit is set, don't free the entries in @tags
*/
struct namespace {
struct tag tag;
strings_t name;
uint16_t nr_tags;
uint8_t shared_tags;
char * sname;
struct list_head tags;
};
static inline struct namespace *tag__namespace(const struct tag *tag)
{
return (struct namespace *)tag;
}
void namespace__delete(struct namespace *nspace, struct cu *cu);
/**
* namespace__for_each_tag - iterate thru all the tags
* @nspace: struct namespace instance to iterate
* @pos: struct tag iterator
*/
#define namespace__for_each_tag(nspace, pos) \
list_for_each_entry(pos, &(nspace)->tags, node)
/**
* namespace__for_each_tag_safe_reverse - safely iterate thru all the tags, in reverse order
* @nspace: struct namespace instance to iterate
* @pos: struct tag iterator
* @n: struct class_member temp iterator
*/
#define namespace__for_each_tag_safe_reverse(nspace, pos, n) \
list_for_each_entry_safe_reverse(pos, n, &(nspace)->tags, node)
void namespace__add_tag(struct namespace *nspace, struct tag *tag);
struct ip_tag {
struct tag tag;
uint64_t addr;
};
struct inline_expansion {
struct ip_tag ip;
size_t size;
uint64_t high_pc;
};
static inline struct inline_expansion *
tag__inline_expansion(const struct tag *tag)
{
return (struct inline_expansion *)tag;
}
struct label {
struct ip_tag ip;
strings_t name;
};
static inline struct label *tag__label(const struct tag *tag)
{
return (struct label *)tag;
}
static inline const char *label__name(const struct label *label,
const struct cu *cu)
{
return cu__string(cu, label->name);
}
enum vlocation {
LOCATION_UNKNOWN,
LOCATION_LOCAL,
LOCATION_GLOBAL,
LOCATION_REGISTER,
LOCATION_OPTIMIZED
} __attribute__((packed));
struct variable {
struct ip_tag ip;
strings_t name;
uint8_t external:1;
uint8_t declaration:1;
enum vlocation location;
struct hlist_node tool_hnode;
};
static inline struct variable *tag__variable(const struct tag *tag)
{
return (struct variable *)tag;
}
const char *variable__name(const struct variable *var, const struct cu *cu);
const char *variable__type_name(const struct variable *var,
const struct cu *cu, char *bf, size_t len);
struct lexblock {
struct ip_tag ip;
struct list_head tags;
uint32_t size;
uint16_t nr_inline_expansions;
uint16_t nr_labels;
uint16_t nr_variables;
uint16_t nr_lexblocks;
uint32_t size_inline_expansions;
};
static inline struct lexblock *tag__lexblock(const struct tag *tag)
{
return (struct lexblock *)tag;
}
void lexblock__delete(struct lexblock *lexblock, struct cu *cu);
struct function;
void lexblock__add_inline_expansion(struct lexblock *lexblock,
struct inline_expansion *exp);
void lexblock__add_label(struct lexblock *lexblock, struct label *label);
void lexblock__add_lexblock(struct lexblock *lexblock, struct lexblock *child);
void lexblock__add_tag(struct lexblock *lexblock, struct tag *tag);
void lexblock__add_variable(struct lexblock *lexblock, struct variable *var);
size_t lexblock__fprintf(const struct lexblock *lexblock, const struct cu *cu,
struct function *function, uint16_t indent,
const struct conf_fprintf *conf, FILE *fp);
struct parameter {
struct tag tag;
strings_t name;
};
static inline struct parameter *tag__parameter(const struct tag *tag)
{
return (struct parameter *)tag;
}
static inline const char *parameter__name(const struct parameter *parm,
const struct cu *cu)
{
return cu__string(cu, parm->name);
}
/*
* tag.tag can be DW_TAG_subprogram_type or DW_TAG_subroutine_type.
*/
struct ftype {
struct tag tag;
struct list_head parms;
uint16_t nr_parms;
uint8_t unspec_parms; /* just one bit is needed */
};
static inline struct ftype *tag__ftype(const struct tag *tag)
{
return (struct ftype *)tag;
}
void ftype__delete(struct ftype *ftype, struct cu *cu);
/**
* ftype__for_each_parameter - iterate thru all the parameters
* @ftype: struct ftype instance to iterate
* @pos: struct parameter iterator
*/
#define ftype__for_each_parameter(ftype, pos) \
list_for_each_entry(pos, &(ftype)->parms, tag.node)
/**
* ftype__for_each_parameter_safe - safely iterate thru all the parameters
* @ftype: struct ftype instance to iterate
* @pos: struct parameter iterator
* @n: struct parameter temp iterator
*/
#define ftype__for_each_parameter_safe(ftype, pos, n) \
list_for_each_entry_safe(pos, n, &(ftype)->parms, tag.node)
/**
* ftype__for_each_parameter_safe_reverse - safely iterate thru all the parameters, in reverse order
* @ftype: struct ftype instance to iterate
* @pos: struct parameter iterator
* @n: struct parameter temp iterator
*/
#define ftype__for_each_parameter_safe_reverse(ftype, pos, n) \
list_for_each_entry_safe_reverse(pos, n, &(ftype)->parms, tag.node)
void ftype__add_parameter(struct ftype *ftype, struct parameter *parm);
size_t ftype__fprintf(const struct ftype *ftype, const struct cu *cu,
const char *name, const int inlined,
const int is_pointer, const int type_spacing,
const struct conf_fprintf *conf, FILE *fp);
size_t ftype__fprintf_parms(const struct ftype *ftype,
const struct cu *cu, int indent,
const struct conf_fprintf *conf, FILE *fp);
int ftype__has_parm_of_type(const struct ftype *ftype, const uint16_t target,
const struct cu *cu);
struct function {
struct ftype proto;
struct lexblock lexblock;
struct rb_node rb_node;
strings_t name;
strings_t linkage_name;
uint32_t cu_total_size_inline_expansions;
uint16_t cu_total_nr_inline_expansions;
uint8_t inlined:2;
uint8_t abstract_origin:1;
uint8_t external:1;
uint8_t accessibility:2; /* DW_ACCESS_{public,protected,private} */
uint8_t virtuality:2; /* DW_VIRTUALITY_{none,virtual,pure_virtual} */
int32_t vtable_entry;
struct list_head vtable_node;
/* fields used by tools */
union {
struct list_head tool_node;
struct hlist_node tool_hnode;
};
void *priv;
};
static inline struct function *tag__function(const struct tag *tag)
{
return (struct function *)tag;
}
static inline struct tag *function__tag(const struct function *func)
{
return (struct tag *)func;
}
void function__delete(struct function *func, struct cu *cu);
static __pure inline int tag__is_function(const struct tag *tag)
{
return tag->tag == DW_TAG_subprogram;
}
/**
* function__for_each_parameter - iterate thru all the parameters
* @func: struct function instance to iterate
* @pos: struct parameter iterator
*/
#define function__for_each_parameter(func, pos) \
ftype__for_each_parameter(&func->proto, pos)
const char *function__name(struct function *func, const struct cu *cu);
static inline const char *function__linkage_name(const struct function *func,
const struct cu *cu)
{
return cu__string(cu, func->linkage_name);
}
size_t function__fprintf_stats(const struct tag *tag_func,
const struct cu *cu,
const struct conf_fprintf *conf,
FILE *fp);
const char *function__prototype(const struct function *func,
const struct cu *cu, char *bf, size_t len);
static __pure inline uint64_t function__addr(const struct function *func)
{
return func->lexblock.ip.addr;
}
static __pure inline uint32_t function__size(const struct function *func)
{
return func->lexblock.size;
}
static inline int function__declared_inline(const struct function *func)
{
return (func->inlined == DW_INL_declared_inlined ||
func->inlined == DW_INL_declared_not_inlined);
}
static inline int function__inlined(const struct function *func)
{
return (func->inlined == DW_INL_inlined ||
func->inlined == DW_INL_declared_inlined);
}
/* struct class_member - struct, union, class member
*
* @bit_offset - offset in bits from the start of the struct
* @bit_size - cached bit size, can be smaller than the integral type if in a bitfield
* @byte_offset - offset in bytes from the start of the struct
* @byte_size - cached byte size, integral type byte size for bitfields
* @bitfield_offset - offset in the current bitfield
* @bitfield_offset - size in the current bitfield
* @bit_hole - If there is a bit hole before the next one (or the end of the struct)
* @bitfield_end - Is this the last entry in a bitfield?
* @accessibility - DW_ACCESS_{public,protected,private}
* @virtuality - DW_VIRTUALITY_{none,virtual,pure_virtual}
* @hole - If there is a hole before the next one (or the end of the struct)
*/
struct class_member {
struct tag tag;
strings_t name;
uint32_t bit_offset;
uint32_t bit_size;
uint32_t byte_offset;
size_t byte_size;
uint8_t bitfield_offset;
uint8_t bitfield_size;
uint8_t bit_hole;
uint8_t bitfield_end:1;
uint64_t const_value;
uint8_t visited:1;
uint8_t is_static:1;
uint8_t accessibility:2;
uint8_t virtuality:2;
uint16_t hole;
};
void class_member__delete(struct class_member *member, struct cu *cu);
static inline struct class_member *tag__class_member(const struct tag *tag)
{
return (struct class_member *)tag;
}
static inline const char *class_member__name(const struct class_member *member,
const struct cu *cu)
{
return cu__string(cu, member->name);
}
static __pure inline int tag__is_class_member(const struct tag *tag)
{
return tag->tag == DW_TAG_member;
}
/**
* struct type - base type for enumerations, structs and unions
*
* @nnr_members: number of non static DW_TAG_member entries
* @nr_static_members: number of static DW_TAG_member entries
* @nr_tags: number of tags
*/
struct type {
struct namespace namespace;
struct list_head node;
uint32_t size;
int32_t size_diff;
uint16_t nr_static_members;
uint16_t nr_members;
uint8_t declaration; /* only one bit used */
uint8_t definition_emitted:1;
uint8_t fwd_decl_emitted:1;
uint8_t resized:1;
};
static inline struct class *type__class(const struct type *type)
{
return (struct class *)type;
}
void type__delete(struct type *type, struct cu *cu);
/**
* type__for_each_tag - iterate thru all the tags
* @type: struct type instance to iterate
* @pos: struct tag iterator
*/
#define type__for_each_tag(type, pos) \
list_for_each_entry(pos, &(type)->namespace.tags, node)
/**
* type__for_each_enumerator - iterate thru the enumerator entries
* @type: struct type instance to iterate
* @pos: struct enumerator iterator
*/
#define type__for_each_enumerator(type, pos) \
struct list_head *__type__for_each_enumerator_head = \
(type)->namespace.shared_tags ? \
(type)->namespace.tags.next : \
&(type)->namespace.tags; \
list_for_each_entry(pos, __type__for_each_enumerator_head, tag.node)
/**
* type__for_each_enumerator_safe_reverse - safely iterate thru the enumerator entries, in reverse order
* @type: struct type instance to iterate
* @pos: struct enumerator iterator
* @n: struct enumerator temp iterator
*/
#define type__for_each_enumerator_safe_reverse(type, pos, n) \
if ((type)->namespace.shared_tags) /* Do nothing */ ; else \
list_for_each_entry_safe_reverse(pos, n, &(type)->namespace.tags, tag.node)
/**
* type__for_each_member - iterate thru the entries that use space
* (data members and inheritance entries)
* @type: struct type instance to iterate
* @pos: struct class_member iterator
*/
#define type__for_each_member(type, pos) \
list_for_each_entry(pos, &(type)->namespace.tags, tag.node) \
if (!(pos->tag.tag == DW_TAG_member || \
pos->tag.tag == DW_TAG_inheritance)) \
continue; \
else
/**
* type__for_each_data_member - iterate thru the data member entries
* @type: struct type instance to iterate
* @pos: struct class_member iterator
*/
#define type__for_each_data_member(type, pos) \
list_for_each_entry(pos, &(type)->namespace.tags, tag.node) \
if (pos->tag.tag != DW_TAG_member) \
continue; \
else
/**
* type__for_each_member_safe - safely iterate thru the entries that use space
* (data members and inheritance entries)
* @type: struct type instance to iterate
* @pos: struct class_member iterator
* @n: struct class_member temp iterator
*/
#define type__for_each_member_safe(type, pos, n) \
list_for_each_entry_safe(pos, n, &(type)->namespace.tags, tag.node) \
if (pos->tag.tag != DW_TAG_member) \
continue; \
else
/**
* type__for_each_data_member_safe - safely iterate thru the data member entries
* @type: struct type instance to iterate
* @pos: struct class_member iterator
* @n: struct class_member temp iterator
*/
#define type__for_each_data_member_safe(type, pos, n) \
list_for_each_entry_safe(pos, n, &(type)->namespace.tags, tag.node) \
if (pos->tag.tag != DW_TAG_member) \
continue; \
else
/**
* type__for_each_tag_safe_reverse - safely iterate thru all tags in a type, in reverse order
* @type: struct type instance to iterate
* @pos: struct class_member iterator
* @n: struct class_member temp iterator
*/
#define type__for_each_tag_safe_reverse(type, pos, n) \
list_for_each_entry_safe_reverse(pos, n, &(type)->namespace.tags, tag.node)
void type__add_member(struct type *type, struct class_member *member);
struct class_member *
type__find_first_biggest_size_base_type_member(struct type *type,
const struct cu *cu);
struct class_member *type__find_member_by_name(const struct type *type,
const struct cu *cu,
const char *name);
uint32_t type__nr_members_of_type(const struct type *type, const uint16_t oftype);
struct class_member *type__last_member(struct type *type);
size_t typedef__fprintf(const struct tag *tag_type, const struct cu *cu,
const struct conf_fprintf *conf, FILE *fp);
static inline struct type *tag__type(const struct tag *tag)
{
return (struct type *)tag;
}
struct class {
struct type type;
struct list_head vtable;
uint16_t nr_vtable_entries;
uint8_t nr_holes;
uint8_t nr_bit_holes;
uint16_t padding;
uint8_t bit_padding;
bool holes_searched;
void *priv;
};
static inline struct class *tag__class(const struct tag *tag)
{
return (struct class *)tag;
}
static inline struct tag *class__tag(const struct class *cls)
{
return (struct tag *)cls;
}
struct class *class__clone(const struct class *from,
const char *new_class_name, struct cu *cu);
void class__delete(struct class *cls, struct cu *cu);
static inline struct list_head *class__tags(struct class *cls)
{
return &cls->type.namespace.tags;
}