db741ee3fc
build/libdwarves.so.1.0.0: 1 function changed, 169 bytes removed, diff: -169 Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
2915 lines
72 KiB
C
2915 lines
72 KiB
C
/*
|
|
Copyright (C) 2006 Mandriva Conectiva S.A.
|
|
Copyright (C) 2006 Arnaldo Carvalho de Melo <acme@mandriva.com>
|
|
Copyright (C) 2007 Red Hat Inc.
|
|
Copyright (C) 2007 Arnaldo Carvalho de Melo <acme@redhat.com>
|
|
|
|
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 <assert.h>
|
|
#include <dirent.h>
|
|
#include <dwarf.h>
|
|
#include <errno.h>
|
|
#include <fcntl.h>
|
|
#include <fnmatch.h>
|
|
#include <libelf.h>
|
|
#include <search.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
#include "config.h"
|
|
#include "ctf_loader.h"
|
|
#include "dwarf_loader.h"
|
|
#include "list.h"
|
|
#include "dwarves.h"
|
|
#include "dutil.h"
|
|
#include "strings.h"
|
|
|
|
struct strings *strings;
|
|
|
|
static inline const char *s(strings_t i)
|
|
{
|
|
return strings__ptr(strings, i);
|
|
}
|
|
|
|
static const char *dwarf_tag_names[] = {
|
|
[DW_TAG_array_type] = "array_type",
|
|
[DW_TAG_class_type] = "class_type",
|
|
[DW_TAG_entry_point] = "entry_point",
|
|
[DW_TAG_enumeration_type] = "enumeration_type",
|
|
[DW_TAG_formal_parameter] = "formal_parameter",
|
|
[DW_TAG_imported_declaration] = "imported_declaration",
|
|
[DW_TAG_label] = "label",
|
|
[DW_TAG_lexical_block] = "lexical_block",
|
|
[DW_TAG_member] = "member",
|
|
[DW_TAG_pointer_type] = "pointer_type",
|
|
[DW_TAG_reference_type] = "reference_type",
|
|
[DW_TAG_compile_unit] = "compile_unit",
|
|
[DW_TAG_string_type] = "string_type",
|
|
[DW_TAG_structure_type] = "structure_type",
|
|
[DW_TAG_subroutine_type] = "subroutine_type",
|
|
[DW_TAG_typedef] = "typedef",
|
|
[DW_TAG_union_type] = "union_type",
|
|
[DW_TAG_unspecified_parameters] = "unspecified_parameters",
|
|
[DW_TAG_variant] = "variant",
|
|
[DW_TAG_common_block] = "common_block",
|
|
[DW_TAG_common_inclusion] = "common_inclusion",
|
|
[DW_TAG_inheritance] = "inheritance",
|
|
[DW_TAG_inlined_subroutine] = "inlined_subroutine",
|
|
[DW_TAG_module] = "module",
|
|
[DW_TAG_ptr_to_member_type] = "ptr_to_member_type",
|
|
[DW_TAG_set_type] = "set_type",
|
|
[DW_TAG_subrange_type] = "subrange_type",
|
|
[DW_TAG_with_stmt] = "with_stmt",
|
|
[DW_TAG_access_declaration] = "access_declaration",
|
|
[DW_TAG_base_type] = "base_type",
|
|
[DW_TAG_catch_block] = "catch_block",
|
|
[DW_TAG_const_type] = "const_type",
|
|
[DW_TAG_constant] = "constant",
|
|
[DW_TAG_enumerator] = "enumerator",
|
|
[DW_TAG_file_type] = "file_type",
|
|
[DW_TAG_friend] = "friend",
|
|
[DW_TAG_namelist] = "namelist",
|
|
[DW_TAG_namelist_item] = "namelist_item",
|
|
[DW_TAG_packed_type] = "packed_type",
|
|
[DW_TAG_subprogram] = "subprogram",
|
|
[DW_TAG_template_type_parameter] = "template_type_parameter",
|
|
[DW_TAG_template_value_parameter] = "template_value_parameter",
|
|
[DW_TAG_thrown_type] = "thrown_type",
|
|
[DW_TAG_try_block] = "try_block",
|
|
[DW_TAG_variant_part] = "variant_part",
|
|
[DW_TAG_variable] = "variable",
|
|
[DW_TAG_volatile_type] = "volatile_type",
|
|
[DW_TAG_dwarf_procedure] = "dwarf_procedure",
|
|
[DW_TAG_restrict_type] = "restrict_type",
|
|
[DW_TAG_interface_type] = "interface_type",
|
|
[DW_TAG_namespace] = "namespace",
|
|
[DW_TAG_imported_module] = "imported_module",
|
|
[DW_TAG_unspecified_type] = "unspecified_type",
|
|
[DW_TAG_partial_unit] = "partial_unit",
|
|
[DW_TAG_imported_unit] = "imported_unit",
|
|
[DW_TAG_mutable_type] = "mutable_type",
|
|
[DW_TAG_condition] = "condition",
|
|
[DW_TAG_shared_type] = "shared_type",
|
|
};
|
|
|
|
const char *dwarf_tag_name(const uint32_t tag)
|
|
{
|
|
if (tag >= DW_TAG_array_type && tag <= DW_TAG_shared_type)
|
|
return dwarf_tag_names[tag];
|
|
return "INVALID";
|
|
}
|
|
|
|
static const struct conf_fprintf conf_fprintf__defaults = {
|
|
.name_spacing = 23,
|
|
.type_spacing = 26,
|
|
.emit_stats = 1,
|
|
};
|
|
|
|
static const char tabs[] = "\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t";
|
|
|
|
static size_t cacheline_size;
|
|
|
|
static void lexblock__delete_tags(struct tag *tself)
|
|
{
|
|
struct lexblock *self = tag__lexblock(tself);
|
|
struct tag *pos, *n;
|
|
|
|
list_for_each_entry_safe(pos, n, &self->tags, node) {
|
|
list_del_init(&pos->node);
|
|
tag__delete(pos);
|
|
}
|
|
}
|
|
|
|
void lexblock__delete(struct lexblock *self)
|
|
{
|
|
lexblock__delete_tags(&self->tag);
|
|
free(self);
|
|
}
|
|
|
|
void tag__delete(struct tag *self)
|
|
{
|
|
assert(list_empty(&self->node));
|
|
|
|
switch (self->tag) {
|
|
case DW_TAG_union_type:
|
|
type__delete(tag__type(self)); break;
|
|
case DW_TAG_class_type:
|
|
case DW_TAG_structure_type:
|
|
class__delete(tag__class(self)); break;
|
|
case DW_TAG_enumeration_type:
|
|
enumeration__delete(tag__type(self)); break;
|
|
case DW_TAG_subroutine_type:
|
|
ftype__delete(tag__ftype(self)); break;
|
|
case DW_TAG_subprogram:
|
|
function__delete(tag__function(self)); break;
|
|
case DW_TAG_lexical_block:
|
|
lexblock__delete(tag__lexblock(self)); break;
|
|
default:
|
|
free(self);
|
|
}
|
|
}
|
|
|
|
void tag__not_found_die(const char *file, int line, const char *func)
|
|
{
|
|
fprintf(stderr, "%s::%s(%d): tag not found, please report to "
|
|
"acme@ghostprotocols.net\n", file, func, line);
|
|
exit(1);
|
|
}
|
|
|
|
struct tag *tag__follow_typedef(const struct tag *tag, const struct cu *cu)
|
|
{
|
|
struct tag *type = cu__type(cu, tag->type);
|
|
|
|
if (type != NULL && tag__is_typedef(type))
|
|
return tag__follow_typedef(type, cu);
|
|
|
|
return type;
|
|
}
|
|
|
|
static const char *tag__accessibility(const struct tag *self)
|
|
{
|
|
int a;
|
|
|
|
switch (self->tag) {
|
|
case DW_TAG_inheritance:
|
|
case DW_TAG_member:
|
|
a = tag__class_member(self)->accessibility;
|
|
break;
|
|
case DW_TAG_subprogram:
|
|
a = tag__function(self)->accessibility;
|
|
break;
|
|
default:
|
|
return NULL;
|
|
}
|
|
|
|
switch (a) {
|
|
case DW_ACCESS_public: return "public";
|
|
case DW_ACCESS_private: return "private";
|
|
case DW_ACCESS_protected: return "protected";
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
size_t tag__nr_cachelines(const struct tag *self, const struct cu *cu)
|
|
{
|
|
return (tag__size(self, cu) + cacheline_size - 1) / cacheline_size;
|
|
}
|
|
|
|
static size_t __tag__id_not_found_snprintf(char *bf, size_t len, Dwarf_Off id,
|
|
const char *fn)
|
|
{
|
|
return snprintf(bf, len, "<ERROR(%s): %#llx not found!>", fn,
|
|
(unsigned long long)id);
|
|
}
|
|
|
|
#define tag__id_not_found_snprintf(bf, len, id) \
|
|
__tag__id_not_found_snprintf(bf, len, id, __func__)
|
|
|
|
static size_t __tag__id_not_found_fprintf(FILE *fp, Dwarf_Off id,
|
|
const char *fn)
|
|
{
|
|
return fprintf(fp, "<ERROR(%s): %#llx not found!>", fn,
|
|
(unsigned long long)id);
|
|
}
|
|
|
|
#define tag__id_not_found_fprintf(fp, id) \
|
|
__tag__id_not_found_fprintf(fp, id, __func__)
|
|
|
|
size_t tag__fprintf_decl_info(const struct tag *self,
|
|
const struct cu *cu, FILE *fp)
|
|
{
|
|
return fprintf(fp, "/* <%llx> %s:%u */\n", tag__orig_id(self, cu),
|
|
tag__decl_file(self, cu), tag__decl_line(self, cu));
|
|
return 0;
|
|
}
|
|
|
|
static struct base_type_name_to_size {
|
|
const char *name;
|
|
strings_t sname;
|
|
size_t size;
|
|
} base_type_name_to_size_table[] = {
|
|
{ .name = "unsigned", .size = 32, },
|
|
{ .name = "signed int", .size = 32, },
|
|
{ .name = "unsigned int", .size = 32, },
|
|
{ .name = "int", .size = 32, },
|
|
{ .name = "short unsigned int", .size = 16, },
|
|
{ .name = "signed short", .size = 16, },
|
|
{ .name = "unsigned short", .size = 16, },
|
|
{ .name = "short int", .size = 16, },
|
|
{ .name = "char", .size = 8, },
|
|
{ .name = "signed char", .size = 8, },
|
|
{ .name = "unsigned char", .size = 8, },
|
|
{ .name = "signed long", .size = 0, },
|
|
{ .name = "long int", .size = 0, },
|
|
{ .name = "signed long", .size = 0, },
|
|
{ .name = "unsigned long", .size = 0, },
|
|
{ .name = "long unsigned int", .size = 0, },
|
|
{ .name = "bool", .size = 8, },
|
|
{ .name = "_Bool", .size = 8, },
|
|
{ .name = "long long unsigned int", .size = 64, },
|
|
{ .name = "long long int", .size = 64, },
|
|
{ .name = "signed long long", .size = 64, },
|
|
{ .name = "unsigned long long", .size = 64, },
|
|
{ .name = "double", .size = 64, },
|
|
{ .name = "double double", .size = 64, },
|
|
{ .name = "single float", .size = 32, },
|
|
{ .name = "float", .size = 32, },
|
|
{ .name = "long double long double", .size = 64, },
|
|
{ .name = NULL },
|
|
};
|
|
|
|
void base_type_name_to_size_table__init(void)
|
|
{
|
|
int i = 0;
|
|
|
|
while (base_type_name_to_size_table[i].name != NULL) {
|
|
if (base_type_name_to_size_table[i].sname == 0)
|
|
base_type_name_to_size_table[i].sname =
|
|
strings__find(strings,
|
|
base_type_name_to_size_table[i].name);
|
|
++i;
|
|
}
|
|
}
|
|
|
|
size_t base_type__name_to_size(struct base_type *self, struct cu *cu)
|
|
{
|
|
int i = 0;
|
|
|
|
while (base_type_name_to_size_table[i].name != NULL) {
|
|
if (base_type_name_to_size_table[i].sname == self->name) {
|
|
size_t size = base_type_name_to_size_table[i].size;
|
|
|
|
return size ?: ((size_t)cu->addr_size * 8);
|
|
}
|
|
++i;
|
|
}
|
|
fprintf(stderr, "%s: %s %s\n",
|
|
__func__, dwarf_tag_name(self->tag.tag), s(self->name));
|
|
return 0;
|
|
}
|
|
|
|
static size_t type__fprintf(struct tag *type, const struct cu *cu,
|
|
const char *name, const struct conf_fprintf *conf,
|
|
FILE *fp);
|
|
|
|
static size_t array_type__fprintf(const struct tag *tag_self,
|
|
const struct cu *cu, const char *name,
|
|
const struct conf_fprintf *conf,
|
|
FILE *fp)
|
|
{
|
|
struct array_type *self = tag__array_type(tag_self);
|
|
struct tag *type = cu__type(cu, tag_self->type);
|
|
size_t printed;
|
|
unsigned long long flat_dimensions = 0;
|
|
int i;
|
|
|
|
if (type == NULL)
|
|
return tag__id_not_found_fprintf(fp, tag_self->type);
|
|
|
|
printed = type__fprintf(type, cu, name, conf, fp);
|
|
for (i = 0; i < self->dimensions; ++i) {
|
|
if (conf->flat_arrays || self->is_vector) {
|
|
/*
|
|
* Seen on the Linux kernel on tun_filter:
|
|
*
|
|
* __u8 addr[0][ETH_ALEN];
|
|
*/
|
|
if (self->nr_entries[i] == 0 && i == 0)
|
|
break;
|
|
if (!flat_dimensions)
|
|
flat_dimensions = self->nr_entries[i];
|
|
else
|
|
flat_dimensions *= self->nr_entries[i];
|
|
} else
|
|
printed += fprintf(fp, "[%u]", self->nr_entries[i]);
|
|
}
|
|
|
|
if (self->is_vector) {
|
|
type = tag__follow_typedef(tag_self, cu);
|
|
|
|
if (flat_dimensions == 0)
|
|
flat_dimensions = 1;
|
|
printed += fprintf(fp, " __attribute__ ((__vector_size__ (%llu)))",
|
|
flat_dimensions * tag__size(type, cu));
|
|
} else if (conf->flat_arrays)
|
|
printed += fprintf(fp, "[%llu]", flat_dimensions);
|
|
|
|
return printed;
|
|
}
|
|
|
|
void namespace__delete(struct namespace *self)
|
|
{
|
|
struct tag *pos, *n;
|
|
|
|
namespace__for_each_tag_safe(self, pos, n) {
|
|
list_del_init(&pos->node);
|
|
|
|
/* Look for nested namespaces */
|
|
if (tag__has_namespace(pos))
|
|
namespace__delete(tag__namespace(pos));
|
|
tag__delete(pos);
|
|
}
|
|
|
|
tag__delete(&self->tag);
|
|
}
|
|
|
|
struct class_member *
|
|
type__find_first_biggest_size_base_type_member(struct type *self,
|
|
const struct cu *cu)
|
|
{
|
|
struct class_member *pos, *result = NULL;
|
|
size_t result_size = 0;
|
|
|
|
type__for_each_data_member(self, pos) {
|
|
struct tag *type = cu__type(cu, pos->tag.type);
|
|
size_t member_size = 0, power2;
|
|
struct class_member *inner = NULL;
|
|
|
|
if (type == NULL) {
|
|
tag__id_not_found_fprintf(stderr, pos->tag.type);
|
|
continue;
|
|
}
|
|
reevaluate:
|
|
switch (type->tag) {
|
|
case DW_TAG_base_type:
|
|
member_size = base_type__size(type);
|
|
break;
|
|
case DW_TAG_pointer_type:
|
|
case DW_TAG_reference_type:
|
|
member_size = cu->addr_size;
|
|
break;
|
|
case DW_TAG_class_type:
|
|
case DW_TAG_union_type:
|
|
case DW_TAG_structure_type:
|
|
if (tag__type(type)->nr_members == 0)
|
|
continue;
|
|
inner = type__find_first_biggest_size_base_type_member(tag__type(type), cu);
|
|
member_size = inner->byte_size;
|
|
break;
|
|
case DW_TAG_array_type:
|
|
case DW_TAG_const_type:
|
|
case DW_TAG_typedef:
|
|
case DW_TAG_volatile_type: {
|
|
struct tag *tag = type = cu__type(cu, tag->type);
|
|
if (type == NULL) {
|
|
tag__id_not_found_fprintf(stderr, tag->type);
|
|
continue;
|
|
}
|
|
}
|
|
goto reevaluate;
|
|
case DW_TAG_enumeration_type:
|
|
member_size = tag__type(type)->size / 8;
|
|
break;
|
|
}
|
|
|
|
/* long long */
|
|
if (member_size > cu->addr_size)
|
|
return pos;
|
|
|
|
for (power2 = cu->addr_size; power2 > result_size; power2 /= 2)
|
|
if (member_size >= power2) {
|
|
if (power2 == cu->addr_size)
|
|
return inner ?: pos;
|
|
result_size = power2;
|
|
result = inner ?: pos;
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
size_t typedef__fprintf(const struct tag *tag_self, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct type *self = tag__type(tag_self);
|
|
const struct conf_fprintf *pconf = conf ?: &conf_fprintf__defaults;
|
|
const struct tag *type;
|
|
const struct tag *ptr_type;
|
|
char bf[512];
|
|
int is_pointer = 0;
|
|
size_t printed;
|
|
|
|
/*
|
|
* Check for void (humm, perhaps we should have a fake void tag instance
|
|
* to avoid all these checks?
|
|
*/
|
|
if (tag_self->type == 0)
|
|
return fprintf(fp, "typedef void %s", type__name(self));
|
|
|
|
type = cu__type(cu, tag_self->type);
|
|
if (type == NULL) {
|
|
printed = fprintf(fp, "typedef ");
|
|
printed += tag__id_not_found_fprintf(fp, tag_self->type);
|
|
return printed + fprintf(fp, " %s", type__name(self));
|
|
}
|
|
|
|
switch (type->tag) {
|
|
case DW_TAG_array_type:
|
|
printed = fprintf(fp, "typedef ");
|
|
return printed + array_type__fprintf(type, cu,
|
|
type__name(self),
|
|
pconf, fp);
|
|
case DW_TAG_pointer_type:
|
|
if (type->type == 0) /* void pointer */
|
|
break;
|
|
ptr_type = cu__type(cu, type->type);
|
|
if (ptr_type == NULL) {
|
|
printed = fprintf(fp, "typedef ");
|
|
printed += tag__id_not_found_fprintf(fp, type->type);
|
|
return printed + fprintf(fp, " *%s", type__name(self));
|
|
}
|
|
if (ptr_type->tag != DW_TAG_subroutine_type)
|
|
break;
|
|
type = ptr_type;
|
|
is_pointer = 1;
|
|
/* Fall thru */
|
|
case DW_TAG_subroutine_type:
|
|
printed = fprintf(fp, "typedef ");
|
|
return printed + ftype__fprintf(tag__ftype(type), cu,
|
|
type__name(self),
|
|
0, is_pointer, 0,
|
|
pconf, fp);
|
|
case DW_TAG_class_type:
|
|
case DW_TAG_structure_type: {
|
|
struct type *ctype = tag__type(type);
|
|
|
|
if (type__name(ctype) != NULL)
|
|
return fprintf(fp, "typedef struct %s %s",
|
|
type__name(ctype),
|
|
type__name(self));
|
|
}
|
|
}
|
|
|
|
return fprintf(fp, "typedef %s %s",
|
|
tag__name(type, cu, bf, sizeof(bf)),
|
|
type__name(self));
|
|
}
|
|
|
|
static size_t imported_declaration__fprintf(const struct tag *self,
|
|
const struct cu *cu, FILE *fp)
|
|
{
|
|
char bf[512];
|
|
size_t printed = fprintf(fp, "using ::");
|
|
const struct tag *decl = cu__function(cu, self->type);
|
|
|
|
if (decl == NULL)
|
|
return printed + tag__id_not_found_fprintf(fp, self->type);
|
|
|
|
return printed + fprintf(fp, "%s", tag__name(decl, cu, bf, sizeof(bf)));
|
|
}
|
|
|
|
static size_t imported_module__fprintf(const struct tag *self,
|
|
const struct cu *cu, FILE *fp)
|
|
{
|
|
const struct tag *module = cu__tag(cu, self->type);
|
|
const char *name = "<IMPORTED MODULE ERROR!>";
|
|
|
|
if (tag__is_namespace(module))
|
|
name = s(tag__namespace(module)->name);
|
|
|
|
return fprintf(fp, "using namespace %s", name);
|
|
}
|
|
|
|
size_t enumeration__fprintf(const struct tag *tag_self,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct type *self = tag__type(tag_self);
|
|
struct enumerator *pos;
|
|
size_t printed = fprintf(fp, "enum%s%s {\n",
|
|
type__name(self) ? " " : "",
|
|
type__name(self) ?: "");
|
|
int indent = conf->indent;
|
|
|
|
if (indent >= (int)sizeof(tabs))
|
|
indent = sizeof(tabs) - 1;
|
|
|
|
type__for_each_enumerator(self, pos)
|
|
printed += fprintf(fp, "%.*s\t%s = %u,\n", indent, tabs,
|
|
s(pos->name), pos->value);
|
|
|
|
return printed + fprintf(fp, "%.*s}%s%s", indent, tabs,
|
|
conf->suffix ? " " : "", conf->suffix ?: "");
|
|
}
|
|
|
|
static void cu__find_class_holes(struct cu *self)
|
|
{
|
|
uint16_t id;
|
|
struct class *pos;
|
|
|
|
cu__for_each_struct(self, id, pos)
|
|
class__find_holes(pos);
|
|
}
|
|
|
|
void cus__add(struct cus *self, struct cu *cu)
|
|
{
|
|
list_add_tail(&cu->node, &self->cus);
|
|
cu__find_class_holes(cu);
|
|
}
|
|
|
|
static void ptr_table__init(struct ptr_table *self)
|
|
{
|
|
self->entries = NULL;
|
|
self->nr_entries = self->allocated_entries = 0;
|
|
}
|
|
|
|
static void ptr_table__exit(struct ptr_table *self)
|
|
{
|
|
free(self->entries);
|
|
self->entries = NULL;
|
|
}
|
|
|
|
static long ptr_table__add(struct ptr_table *self, void *ptr)
|
|
{
|
|
const uint32_t nr_entries = self->nr_entries + 1;
|
|
const long rc = self->nr_entries;
|
|
|
|
if (nr_entries > self->allocated_entries) {
|
|
uint32_t allocated_entries = self->allocated_entries + 256;
|
|
void *entries = realloc(self->entries,
|
|
sizeof(void *) * allocated_entries);
|
|
if (entries == NULL)
|
|
return -ENOMEM;
|
|
|
|
self->allocated_entries = allocated_entries;
|
|
self->entries = entries;
|
|
}
|
|
|
|
self->entries[rc] = ptr;
|
|
self->nr_entries = nr_entries;
|
|
return rc;
|
|
}
|
|
|
|
static int ptr_table__add_with_id(struct ptr_table *self, void *ptr,
|
|
uint32_t id)
|
|
{
|
|
/* Assume we won't be fed with the same id more than once */
|
|
if (id >= self->allocated_entries) {
|
|
uint32_t allocated_entries = roundup(id + 1, 256);
|
|
void *entries = realloc(self->entries,
|
|
sizeof(void *) * allocated_entries);
|
|
if (entries == NULL)
|
|
return -ENOMEM;
|
|
|
|
self->allocated_entries = allocated_entries;
|
|
self->entries = entries;
|
|
}
|
|
|
|
self->entries[id] = ptr;
|
|
++self->nr_entries;
|
|
return 0;
|
|
}
|
|
|
|
static void *ptr_table__entry(const struct ptr_table *self, uint32_t id)
|
|
{
|
|
return id >= self->nr_entries ? NULL : self->entries[id];
|
|
}
|
|
|
|
int cu__table_add_tag(struct cu *self, struct tag *tag, long *id)
|
|
{
|
|
struct ptr_table *pt = tag__is_tag_type(tag) ?
|
|
&self->types_table :
|
|
tag__is_function(tag) ?
|
|
&self->functions_table :
|
|
&self->tags_table;
|
|
if (*id < 0) {
|
|
*id = ptr_table__add(pt, tag);
|
|
if (*id < 0)
|
|
return -ENOMEM;
|
|
} else if (ptr_table__add_with_id(pt, tag, *id) < 0)
|
|
return -ENOMEM;
|
|
return 0;
|
|
}
|
|
|
|
int cu__table_nullify_type_entry(struct cu *self, uint32_t id)
|
|
{
|
|
return ptr_table__add_with_id(&self->types_table, NULL, id);
|
|
}
|
|
|
|
int cu__add_tag(struct cu *self, struct tag *tag, long *id)
|
|
{
|
|
int err = cu__table_add_tag(self, tag, id);
|
|
|
|
if (err == 0)
|
|
list_add_tail(&tag->node, &self->tags);
|
|
|
|
return err;
|
|
}
|
|
|
|
struct cu *cu__new(const char *name, uint8_t addr_size,
|
|
const unsigned char *build_id, int build_id_len,
|
|
const char *filename)
|
|
{
|
|
struct cu *self = malloc(sizeof(*self) + build_id_len);
|
|
|
|
if (self != NULL) {
|
|
self->name = strdup(name);
|
|
self->filename = strdup(filename);
|
|
if (self->name == NULL || self->filename == NULL)
|
|
goto out_free;
|
|
|
|
ptr_table__init(&self->tags_table);
|
|
ptr_table__init(&self->types_table);
|
|
ptr_table__init(&self->functions_table);
|
|
/*
|
|
* the first entry is historically associated with void,
|
|
* so make sure we don't use it
|
|
*/
|
|
if (ptr_table__add(&self->types_table, NULL) < 0)
|
|
goto out_free_name;
|
|
|
|
self->orig_info = NULL;
|
|
INIT_LIST_HEAD(&self->tags);
|
|
INIT_LIST_HEAD(&self->tool_list);
|
|
|
|
self->addr_size = addr_size;
|
|
self->extra_dbg_info = 0;
|
|
|
|
self->nr_inline_expansions = 0;
|
|
self->size_inline_expansions = 0;
|
|
self->nr_structures_changed = 0;
|
|
self->nr_functions_changed = 0;
|
|
self->max_len_changed_item = 0;
|
|
self->function_bytes_added = 0;
|
|
self->function_bytes_removed = 0;
|
|
self->build_id_len = build_id_len;
|
|
if (build_id_len > 0)
|
|
memcpy(self->build_id, build_id, build_id_len);
|
|
}
|
|
out:
|
|
return self;
|
|
out_free_name:
|
|
free(self->name);
|
|
free(self->filename);
|
|
out_free:
|
|
free(self);
|
|
self = NULL;
|
|
goto out;
|
|
}
|
|
|
|
static void array_type__delete(struct tag *self)
|
|
{
|
|
free(tag__array_type(self)->nr_entries);
|
|
free(self);
|
|
}
|
|
|
|
static int cu__delete_tag(struct tag *self, struct cu *cu __unused,
|
|
void *cookie __unused)
|
|
{
|
|
list_del_init(&self->node);
|
|
tag__free_orig_info(self, cu);
|
|
switch (self->tag) {
|
|
case DW_TAG_array_type:
|
|
array_type__delete(self); break;
|
|
default:
|
|
free(self); break;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void cu__delete(struct cu *self)
|
|
{
|
|
cu__for_all_tags(self, cu__delete_tag, NULL);
|
|
ptr_table__exit(&self->tags_table);
|
|
ptr_table__exit(&self->types_table);
|
|
ptr_table__exit(&self->functions_table);
|
|
free(self->name);
|
|
free(self);
|
|
}
|
|
|
|
bool cu__same_build_id(const struct cu *self, const struct cu *other)
|
|
{
|
|
return self->build_id_len != 0 &&
|
|
self->build_id_len == other->build_id_len &&
|
|
memcmp(self->build_id, other->build_id, self->build_id_len) == 0;
|
|
}
|
|
|
|
static const char *tag__prefix(const struct cu *cu, const uint32_t tag)
|
|
{
|
|
switch (tag) {
|
|
case DW_TAG_enumeration_type: return "enum ";
|
|
case DW_TAG_structure_type:
|
|
return cu->language == DW_LANG_C_plus_plus ? "class " :
|
|
"struct ";
|
|
case DW_TAG_class_type: return "class";
|
|
case DW_TAG_union_type: return "union ";
|
|
case DW_TAG_pointer_type: return " *";
|
|
case DW_TAG_reference_type: return " &";
|
|
}
|
|
|
|
return "";
|
|
}
|
|
|
|
struct tag *cu__function(const struct cu *self, const uint32_t id)
|
|
{
|
|
return self ? ptr_table__entry(&self->functions_table, id) : NULL;
|
|
}
|
|
|
|
struct tag *cu__tag(const struct cu *self, const uint32_t id)
|
|
{
|
|
return self ? ptr_table__entry(&self->tags_table, id) : NULL;
|
|
}
|
|
|
|
struct tag *cu__type(const struct cu *self, const uint16_t id)
|
|
{
|
|
return self ? ptr_table__entry(&self->types_table, id) : NULL;
|
|
}
|
|
|
|
struct tag *cu__find_first_typedef_of_type(const struct cu *self,
|
|
const Dwarf_Off type)
|
|
{
|
|
uint16_t id;
|
|
struct tag *pos;
|
|
|
|
if (self == NULL || type == 0)
|
|
return NULL;
|
|
|
|
cu__for_each_type(self, id, pos)
|
|
if (tag__is_typedef(pos) && pos->type == type)
|
|
return pos;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct tag *cu__find_base_type_by_name(const struct cu *self,
|
|
const char *name, uint16_t *idp)
|
|
{
|
|
uint16_t id;
|
|
struct tag *pos;
|
|
|
|
if (self == NULL || name == NULL)
|
|
return NULL;
|
|
|
|
strings_t sname = strings__find(strings, name);
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
cu__for_each_type(self, id, pos) {
|
|
if (pos->tag == DW_TAG_base_type) {
|
|
const struct base_type *bt = tag__base_type(pos);
|
|
|
|
if (bt->name == sname) {
|
|
if (idp != NULL)
|
|
*idp = id;
|
|
return pos;
|
|
}
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct tag *cu__find_base_type_by_sname_and_size(const struct cu *self,
|
|
strings_t sname,
|
|
uint16_t bit_size,
|
|
uint16_t *idp)
|
|
{
|
|
uint16_t id;
|
|
struct tag *pos;
|
|
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
cu__for_each_type(self, id, pos) {
|
|
if (pos->tag == DW_TAG_base_type) {
|
|
const struct base_type *bt = tag__base_type(pos);
|
|
|
|
if (bt->bit_size == bit_size &&
|
|
bt->name == sname) {
|
|
if (idp != NULL)
|
|
*idp = id;
|
|
return pos;
|
|
}
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct tag *cu__find_base_type_by_name_and_size(const struct cu *self,
|
|
const char *name,
|
|
uint16_t bit_size,
|
|
uint16_t *idp)
|
|
{
|
|
if (self == NULL || name == NULL)
|
|
return NULL;
|
|
|
|
strings_t sname = strings__find(strings, name);
|
|
|
|
return cu__find_base_type_by_sname_and_size(self, sname, bit_size, idp);
|
|
}
|
|
|
|
struct tag *cu__find_enumeration_by_sname_and_size(const struct cu *self,
|
|
strings_t sname,
|
|
uint16_t bit_size,
|
|
uint16_t *idp)
|
|
{
|
|
uint16_t id;
|
|
struct tag *pos;
|
|
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
cu__for_each_type(self, id, pos) {
|
|
if (pos->tag == DW_TAG_enumeration_type) {
|
|
const struct type *t = tag__type(pos);
|
|
|
|
if (t->size == bit_size &&
|
|
t->namespace.name == sname) {
|
|
if (idp != NULL)
|
|
*idp = id;
|
|
return pos;
|
|
}
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct tag *cu__find_struct_by_sname(const struct cu *self, strings_t sname,
|
|
const int include_decls, uint16_t *idp)
|
|
{
|
|
uint16_t id;
|
|
struct tag *pos;
|
|
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
cu__for_each_type(self, id, pos) {
|
|
struct type *type;
|
|
|
|
if (!tag__is_struct(pos))
|
|
continue;
|
|
|
|
type = tag__type(pos);
|
|
if (type->namespace.name == sname) {
|
|
if (!type->declaration)
|
|
goto found;
|
|
|
|
if (include_decls)
|
|
goto found;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
found:
|
|
if (idp != NULL)
|
|
*idp = id;
|
|
return pos;
|
|
|
|
}
|
|
|
|
struct tag *cu__find_struct_by_name(const struct cu *self, const char *name,
|
|
const int include_decls, uint16_t *idp)
|
|
{
|
|
if (self == NULL || name == NULL)
|
|
return NULL;
|
|
|
|
strings_t sname = strings__find(strings, name);
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
return cu__find_struct_by_sname(self, sname, include_decls, idp);
|
|
}
|
|
|
|
struct tag *cus__find_struct_by_name(const struct cus *self,
|
|
struct cu **cu, const char *name,
|
|
const int include_decls, uint16_t *id)
|
|
{
|
|
struct cu *pos;
|
|
|
|
list_for_each_entry(pos, &self->cus, node) {
|
|
struct tag *tag = cu__find_struct_by_name(pos, name,
|
|
include_decls,
|
|
id);
|
|
if (tag != NULL) {
|
|
if (cu != NULL)
|
|
*cu = pos;
|
|
return tag;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct cu *cus__find_cu_by_name(const struct cus *self, const char *name)
|
|
{
|
|
struct cu *pos;
|
|
|
|
list_for_each_entry(pos, &self->cus, node)
|
|
if (pos->name && strcmp(pos->name, name) == 0)
|
|
return pos;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct tag *cu__find_function_by_name(const struct cu *self, const char *name)
|
|
{
|
|
struct tag *pos;
|
|
|
|
if (self == NULL || name == NULL)
|
|
return NULL;
|
|
|
|
strings_t sname = strings__find(strings, name);
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
list_for_each_entry(pos, &self->tags, node)
|
|
if (tag__is_function(pos) &&
|
|
tag__function(pos)->name == sname)
|
|
return pos;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
static size_t array_type__nr_entries(const struct array_type *self)
|
|
{
|
|
int i;
|
|
size_t nr_entries = 1;
|
|
|
|
for (i = 0; i < self->dimensions; ++i)
|
|
nr_entries *= self->nr_entries[i];
|
|
|
|
return nr_entries;
|
|
}
|
|
|
|
size_t tag__size(const struct tag *self, const struct cu *cu)
|
|
{
|
|
size_t size;
|
|
|
|
switch (self->tag) {
|
|
case DW_TAG_member: {
|
|
/* Is it cached already? */
|
|
size = tag__class_member(self)->byte_size;
|
|
if (size != 0)
|
|
return size;
|
|
break;
|
|
}
|
|
case DW_TAG_pointer_type:
|
|
case DW_TAG_reference_type: return cu->addr_size;
|
|
case DW_TAG_base_type: return base_type__size(self);
|
|
case DW_TAG_enumeration_type: return tag__type(self)->size / 8;
|
|
}
|
|
|
|
if (self->type == 0) { /* struct class: unions, structs */
|
|
struct type *type = tag__type(self);
|
|
|
|
/* empty base optimization trick */
|
|
if (type->size == 1 && type->nr_members == 0)
|
|
size = 0;
|
|
else
|
|
size = tag__type(self)->size;
|
|
} else {
|
|
const struct tag *type = cu__type(cu, self->type);
|
|
|
|
if (type == NULL) {
|
|
tag__id_not_found_fprintf(stderr, self->type);
|
|
return -1;
|
|
}
|
|
size = tag__size(type, cu);
|
|
}
|
|
|
|
if (self->tag == DW_TAG_array_type)
|
|
return size * array_type__nr_entries(tag__array_type(self));
|
|
|
|
return size;
|
|
}
|
|
|
|
static const char *tag__ptr_name(const struct tag *self, const struct cu *cu,
|
|
char *bf, size_t len, const char *ptr_suffix)
|
|
{
|
|
if (self->type == 0) /* No type == void */
|
|
snprintf(bf, len, "void %s", ptr_suffix);
|
|
else {
|
|
const struct tag *type = cu__type(cu, self->type);
|
|
|
|
if (type == NULL) {
|
|
size_t l = tag__id_not_found_snprintf(bf, len,
|
|
self->type);
|
|
snprintf(bf + l, len - l, " %s", ptr_suffix);
|
|
} else {
|
|
char tmpbf[1024];
|
|
snprintf(bf, len, "%s %s",
|
|
tag__name(type, cu,
|
|
tmpbf, sizeof(tmpbf)), ptr_suffix);
|
|
}
|
|
}
|
|
|
|
return bf;
|
|
}
|
|
|
|
const char *tag__name(const struct tag *self, const struct cu *cu,
|
|
char *bf, size_t len)
|
|
{
|
|
struct tag *type;
|
|
|
|
if (self == NULL)
|
|
strncpy(bf, "void", len);
|
|
else switch (self->tag) {
|
|
case DW_TAG_base_type: {
|
|
const struct base_type *bt = tag__base_type(self);
|
|
const char *name = "nameless base type!";
|
|
|
|
if (bt->name)
|
|
name = s(bt->name);
|
|
|
|
strncpy(bf, name, len);
|
|
}
|
|
break;
|
|
case DW_TAG_subprogram:
|
|
strncpy(bf, function__name(tag__function(self), cu), len);
|
|
break;
|
|
case DW_TAG_pointer_type:
|
|
return tag__ptr_name(self, cu, bf, len, "*");
|
|
case DW_TAG_reference_type:
|
|
return tag__ptr_name(self, cu, bf, len, "&");
|
|
case DW_TAG_ptr_to_member_type: {
|
|
char suffix[512];
|
|
Dwarf_Off id = tag__ptr_to_member_type(self)->containing_type;
|
|
|
|
type = cu__type(cu, id);
|
|
if (type != NULL)
|
|
snprintf(suffix, sizeof(suffix), "%s::*",
|
|
class__name(tag__class(type)));
|
|
else {
|
|
size_t l = tag__id_not_found_snprintf(suffix,
|
|
sizeof(suffix),
|
|
id);
|
|
snprintf(suffix + l, sizeof(suffix) - l, "::*");
|
|
}
|
|
|
|
return tag__ptr_name(self, cu, bf, len, suffix);
|
|
}
|
|
case DW_TAG_volatile_type:
|
|
case DW_TAG_const_type:
|
|
type = cu__type(cu, self->type);
|
|
if (type == NULL && self->type != 0)
|
|
tag__id_not_found_snprintf(bf, len, self->type);
|
|
else {
|
|
char tmpbf[128];
|
|
snprintf(bf, len, "%s %s ",
|
|
self->tag == DW_TAG_volatile_type ?
|
|
"volatile" : "const",
|
|
tag__name(type, cu, tmpbf, sizeof(tmpbf)));
|
|
}
|
|
break;
|
|
case DW_TAG_array_type:
|
|
type = cu__type(cu, self->type);
|
|
if (type == NULL)
|
|
tag__id_not_found_snprintf(bf, len, self->type);
|
|
else
|
|
return tag__name(type, cu, bf, len);
|
|
break;
|
|
case DW_TAG_subroutine_type: {
|
|
FILE *bfp = fmemopen(bf, len, "w");
|
|
|
|
if (bfp != NULL) {
|
|
ftype__fprintf(tag__ftype(self), cu, NULL, 0, 0, 0,
|
|
&conf_fprintf__defaults, bfp);
|
|
fclose(bfp);
|
|
} else
|
|
snprintf(bf, len, "<ERROR(%s): fmemopen failed!>",
|
|
__func__);
|
|
}
|
|
break;
|
|
default:
|
|
snprintf(bf, len, "%s%s", tag__prefix(cu, self->tag),
|
|
type__name(tag__type(self)) ?: "");
|
|
break;
|
|
}
|
|
|
|
return bf;
|
|
}
|
|
|
|
const char *variable__type_name(const struct variable *self,
|
|
const struct cu *cu,
|
|
char *bf, size_t len)
|
|
{
|
|
const struct tag *tag = cu__type(cu, self->tag.type);
|
|
return tag != NULL ? tag__name(tag, cu, bf, len) : NULL;
|
|
}
|
|
|
|
static const char *variable__prefix(const struct variable *var)
|
|
{
|
|
switch (var->location) {
|
|
case LOCATION_REGISTER:
|
|
return "register ";
|
|
case LOCATION_UNKNOWN:
|
|
if (var->external && var->declaration)
|
|
return "extern ";
|
|
break;
|
|
case LOCATION_GLOBAL:
|
|
if (!var->external)
|
|
return "static ";
|
|
break;
|
|
case LOCATION_LOCAL:
|
|
case LOCATION_OPTIMIZED:
|
|
break;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
void class_member__delete(struct class_member *self)
|
|
{
|
|
free(self);
|
|
}
|
|
|
|
static struct class_member *class_member__clone(const struct class_member *from)
|
|
{
|
|
struct class_member *self = malloc(sizeof(*self));
|
|
|
|
if (self != NULL)
|
|
memcpy(self, from, sizeof(*self));
|
|
|
|
return self;
|
|
}
|
|
|
|
static size_t union__fprintf(struct type *self, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp);
|
|
|
|
static size_t type__fprintf(struct tag *type, const struct cu *cu,
|
|
const char *name, const struct conf_fprintf *conf,
|
|
FILE *fp)
|
|
{
|
|
char tbf[128];
|
|
char namebf[256];
|
|
struct type *ctype;
|
|
struct conf_fprintf tconf;
|
|
size_t printed = 0;
|
|
int expand_types = conf->expand_types;
|
|
int suppress_offset_comment = conf->suppress_offset_comment;
|
|
|
|
if (type == NULL)
|
|
goto out_type_not_found;
|
|
|
|
if (conf->expand_pointers) {
|
|
int nr_indirections = 0;
|
|
|
|
while (type->tag == DW_TAG_pointer_type && type->type != 0) {
|
|
type = cu__type(cu, type->type);
|
|
if (type == NULL)
|
|
goto out_type_not_found;
|
|
++nr_indirections;
|
|
}
|
|
|
|
if (nr_indirections > 0) {
|
|
const size_t len = strlen(name);
|
|
if (len + nr_indirections >= sizeof(namebf))
|
|
goto out_type_not_found;
|
|
memset(namebf, '*', nr_indirections);
|
|
memcpy(namebf + nr_indirections, name, len);
|
|
namebf[len + nr_indirections] = '\0';
|
|
name = namebf;
|
|
}
|
|
|
|
expand_types = nr_indirections;
|
|
if (!suppress_offset_comment)
|
|
suppress_offset_comment = !!nr_indirections;
|
|
|
|
/* Avoid loops */
|
|
if (type->recursivity_level != 0)
|
|
expand_types = 0;
|
|
++type->recursivity_level;
|
|
}
|
|
|
|
if (expand_types) {
|
|
int typedef_expanded = 0;
|
|
|
|
while (tag__is_typedef(type)) {
|
|
ctype = tag__type(type);
|
|
if (typedef_expanded)
|
|
printed += fprintf(fp, " -> %s",
|
|
type__name(ctype));
|
|
else {
|
|
printed += fprintf(fp, "/* typedef %s",
|
|
type__name(ctype));
|
|
typedef_expanded = 1;
|
|
}
|
|
type = cu__type(cu, type->type);
|
|
if (type == NULL)
|
|
goto out_type_not_found;
|
|
}
|
|
if (typedef_expanded)
|
|
printed += fprintf(fp, " */ ");
|
|
}
|
|
|
|
if (tag__is_struct(type) || tag__is_union(type) ||
|
|
tag__is_enumeration(type)) {
|
|
tconf = *conf;
|
|
tconf.type_spacing -= 8;
|
|
tconf.prefix = NULL;
|
|
tconf.suffix = name;
|
|
tconf.emit_stats = 0;
|
|
tconf.suppress_offset_comment = suppress_offset_comment;
|
|
}
|
|
|
|
switch (type->tag) {
|
|
case DW_TAG_pointer_type:
|
|
if (type->type != 0) {
|
|
struct tag *ptype = cu__type(cu, type->type);
|
|
if (ptype == NULL)
|
|
goto out_type_not_found;
|
|
if (ptype->tag == DW_TAG_subroutine_type) {
|
|
printed += ftype__fprintf(tag__ftype(ptype),
|
|
cu, name, 0, 1,
|
|
conf->type_spacing,
|
|
conf, fp);
|
|
break;
|
|
}
|
|
}
|
|
/* Fall Thru */
|
|
default:
|
|
printed += fprintf(fp, "%-*s %s", conf->type_spacing,
|
|
tag__name(type, cu, tbf, sizeof(tbf)), name);
|
|
break;
|
|
case DW_TAG_subroutine_type:
|
|
printed += ftype__fprintf(tag__ftype(type), cu, name, 0, 0,
|
|
conf->type_spacing, conf, fp);
|
|
break;
|
|
case DW_TAG_array_type:
|
|
printed += array_type__fprintf(type, cu, name, conf, fp);
|
|
break;
|
|
case DW_TAG_class_type:
|
|
case DW_TAG_structure_type:
|
|
ctype = tag__type(type);
|
|
|
|
if (type__name(ctype) != NULL && !expand_types)
|
|
printed += fprintf(fp, "%s %-*s %s",
|
|
type->tag == DW_TAG_class_type ? "class" : "struct",
|
|
conf->type_spacing - 7,
|
|
type__name(ctype), name);
|
|
else
|
|
printed += class__fprintf(tag__class(type),
|
|
cu, &tconf, fp);
|
|
break;
|
|
case DW_TAG_union_type:
|
|
ctype = tag__type(type);
|
|
|
|
if (type__name(ctype) != NULL && !expand_types)
|
|
printed += fprintf(fp, "union %-*s %s",
|
|
conf->type_spacing - 6,
|
|
type__name(ctype), name);
|
|
else
|
|
printed += union__fprintf(ctype, cu, &tconf, fp);
|
|
break;
|
|
case DW_TAG_enumeration_type:
|
|
ctype = tag__type(type);
|
|
|
|
if (type__name(ctype) != NULL)
|
|
printed += fprintf(fp, "enum %-*s %s",
|
|
conf->type_spacing - 5,
|
|
type__name(ctype), name);
|
|
else
|
|
printed += enumeration__fprintf(type, &tconf, fp);
|
|
break;
|
|
}
|
|
out:
|
|
if (conf->expand_types)
|
|
--type->recursivity_level;
|
|
|
|
return printed;
|
|
out_type_not_found:
|
|
printed = fprintf(fp, "%-*s %s", conf->type_spacing, "<ERROR>", name);
|
|
goto out;
|
|
}
|
|
|
|
static size_t struct_member__fprintf(struct class_member *self,
|
|
struct tag *type, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
const int size = self->byte_size;
|
|
struct conf_fprintf sconf = *conf;
|
|
uint32_t offset = self->byte_offset;
|
|
size_t printed = 0;
|
|
const char *name = s(self->name);
|
|
|
|
if (!sconf.rel_offset) {
|
|
sconf.base_offset += self->byte_offset;
|
|
offset = sconf.base_offset;
|
|
}
|
|
|
|
if (self->tag.tag == DW_TAG_inheritance) {
|
|
name = "<ancestor>";
|
|
printed += fprintf(fp, "/* ");
|
|
}
|
|
|
|
printed += type__fprintf(type, cu, name, &sconf, fp);
|
|
|
|
if (self->bitfield_size != 0)
|
|
printed += fprintf(fp, ":%u;", self->bitfield_size);
|
|
else {
|
|
fputc(';', fp);
|
|
++printed;
|
|
}
|
|
|
|
if ((tag__is_union(type) || tag__is_struct(type) ||
|
|
tag__is_enumeration(type)) &&
|
|
/* Look if is a type defined inline */
|
|
type__name(tag__type(type)) == NULL) {
|
|
if (!sconf.suppress_offset_comment) {
|
|
/* Check if this is a anonymous union */
|
|
const int slen = self->name ?
|
|
(int)strlen(s(self->name)) : -1;
|
|
printed += fprintf(fp, "%*s/* %5u %5u */",
|
|
(sconf.type_spacing +
|
|
sconf.name_spacing - slen - 3),
|
|
" ", offset, size);
|
|
}
|
|
} else {
|
|
int spacing = sconf.type_spacing + sconf.name_spacing - printed;
|
|
|
|
if (self->tag.tag == DW_TAG_inheritance) {
|
|
const size_t p = fprintf(fp, " */");
|
|
printed += p;
|
|
spacing -= p;
|
|
}
|
|
if (!sconf.suppress_offset_comment) {
|
|
int size_spacing = 5;
|
|
|
|
printed += fprintf(fp, "%*s/* %5u",
|
|
spacing > 0 ? spacing : 0, " ",
|
|
offset);
|
|
|
|
if (self->bitfield_size != 0) {
|
|
printed += fprintf(fp, ":%2d",
|
|
self->bitfield_offset);
|
|
size_spacing -= 3;
|
|
}
|
|
|
|
printed += fprintf(fp, " %*u */", size_spacing, size);
|
|
}
|
|
}
|
|
return printed;
|
|
}
|
|
|
|
static size_t union_member__fprintf(struct class_member *self,
|
|
struct tag *type, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
const size_t size = self->byte_size;
|
|
size_t printed = type__fprintf(type, cu, s(self->name), conf, fp);
|
|
|
|
if ((tag__is_union(type) || tag__is_struct(type) ||
|
|
tag__is_enumeration(type)) &&
|
|
/* Look if is a type defined inline */
|
|
type__name(tag__type(type)) == NULL) {
|
|
if (!conf->suppress_offset_comment) {
|
|
/* Check if this is a anonymous union */
|
|
const int slen = self->name ? (int)strlen(s(self->name)) : -1;
|
|
/*
|
|
* Add the comment with the union size after padding the
|
|
* '} member_name;' last line of the type printed in the
|
|
* above call to type__fprintf.
|
|
*/
|
|
printed += fprintf(fp, ";%*s/* %11zd */",
|
|
(conf->type_spacing +
|
|
conf->name_spacing - slen - 3), " ", size);
|
|
}
|
|
} else {
|
|
printed += fprintf(fp, ";");
|
|
|
|
if (!conf->suppress_offset_comment) {
|
|
const int spacing = conf->type_spacing + conf->name_spacing - printed;
|
|
printed += fprintf(fp, "%*s/* %11zd */",
|
|
spacing > 0 ? spacing : 0, " ", size);
|
|
}
|
|
}
|
|
|
|
return printed;
|
|
}
|
|
|
|
static size_t union__fprintf(struct type *self, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct class_member *pos;
|
|
size_t printed = 0;
|
|
int indent = conf->indent;
|
|
struct conf_fprintf uconf;
|
|
|
|
if (indent >= (int)sizeof(tabs))
|
|
indent = sizeof(tabs) - 1;
|
|
|
|
if (conf->prefix != NULL)
|
|
printed += fprintf(fp, "%s ", conf->prefix);
|
|
printed += fprintf(fp, "union%s%s {\n", type__name(self) ? " " : "",
|
|
type__name(self) ?: "");
|
|
|
|
uconf = *conf;
|
|
uconf.indent = indent + 1;
|
|
type__for_each_member(self, pos) {
|
|
struct tag *type = cu__type(cu, pos->tag.type);
|
|
|
|
if (type == NULL) {
|
|
printed += fprintf(fp, "%.*s", uconf.indent, tabs);
|
|
printed += tag__id_not_found_fprintf(fp, pos->tag.type);
|
|
continue;
|
|
}
|
|
|
|
printed += fprintf(fp, "%.*s", uconf.indent, tabs);
|
|
printed += union_member__fprintf(pos, type, cu, &uconf, fp);
|
|
fputc('\n', fp);
|
|
++printed;
|
|
}
|
|
|
|
return printed + fprintf(fp, "%.*s}%s%s", indent, tabs,
|
|
conf->suffix ? " " : "", conf->suffix ?: "");
|
|
}
|
|
|
|
static void type__delete_class_members(struct type *self)
|
|
{
|
|
struct class_member *pos, *next;
|
|
|
|
type__for_each_data_member_safe(self, pos, next) {
|
|
list_del_init(&pos->tag.node);
|
|
class_member__delete(pos);
|
|
}
|
|
}
|
|
|
|
void class__delete(struct class *self)
|
|
{
|
|
type__delete_class_members(&self->type);
|
|
free(self);
|
|
}
|
|
|
|
void type__delete(struct type *self)
|
|
{
|
|
type__delete_class_members(self);
|
|
free(self);
|
|
}
|
|
|
|
static void enumerator__delete(struct enumerator *self)
|
|
{
|
|
free(self);
|
|
}
|
|
|
|
void enumeration__delete(struct type *self)
|
|
{
|
|
struct enumerator *pos, *n;
|
|
type__for_each_enumerator_safe(self, pos, n) {
|
|
list_del_init(&pos->tag.node);
|
|
enumerator__delete(pos);
|
|
}
|
|
}
|
|
|
|
void class__add_vtable_entry(struct class *self, struct function *vtable_entry)
|
|
{
|
|
++self->nr_vtable_entries;
|
|
list_add_tail(&vtable_entry->vtable_node, &self->vtable);
|
|
}
|
|
|
|
void namespace__add_tag(struct namespace *self, struct tag *tag)
|
|
{
|
|
++self->nr_tags;
|
|
list_add_tail(&tag->node, &self->tags);
|
|
}
|
|
|
|
void type__add_member(struct type *self, struct class_member *member)
|
|
{
|
|
++self->nr_members;
|
|
namespace__add_tag(&self->namespace, &member->tag);
|
|
}
|
|
|
|
struct class_member *type__last_member(struct type *self)
|
|
{
|
|
struct class_member *pos;
|
|
|
|
list_for_each_entry_reverse(pos, &self->namespace.tags, tag.node)
|
|
if (pos->tag.tag == DW_TAG_member)
|
|
return pos;
|
|
return NULL;
|
|
}
|
|
|
|
static int type__clone_members(struct type *self, const struct type *from)
|
|
{
|
|
struct class_member *pos;
|
|
|
|
self->nr_members = 0;
|
|
INIT_LIST_HEAD(&self->namespace.tags);
|
|
|
|
type__for_each_member(from, pos) {
|
|
struct class_member *member_clone = class_member__clone(pos);
|
|
|
|
if (member_clone == NULL)
|
|
return -1;
|
|
type__add_member(self, member_clone);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
struct class *class__clone(const struct class *from,
|
|
const char *new_class_name)
|
|
{
|
|
struct class *self = malloc(sizeof(*self));
|
|
|
|
if (self != NULL) {
|
|
memcpy(self, from, sizeof(*self));
|
|
if (type__clone_members(&self->type, &from->type) != 0) {
|
|
class__delete(self);
|
|
self = NULL;
|
|
}
|
|
if (new_class_name != NULL)
|
|
self->type.namespace.name = strings__add(strings,
|
|
new_class_name);
|
|
}
|
|
|
|
return self;
|
|
}
|
|
|
|
void enumeration__add(struct type *self, struct enumerator *enumerator)
|
|
{
|
|
++self->nr_members;
|
|
namespace__add_tag(&self->namespace, &enumerator->tag);
|
|
}
|
|
|
|
void lexblock__add_lexblock(struct lexblock *self, struct lexblock *child)
|
|
{
|
|
++self->nr_lexblocks;
|
|
list_add_tail(&child->tag.node, &self->tags);
|
|
}
|
|
|
|
const char *function__name(struct function *self, const struct cu *cu __unused)
|
|
{
|
|
return s(self->name);
|
|
}
|
|
|
|
const char *function__prototype(const struct function *self,
|
|
const struct cu *cu, char *bf, size_t len)
|
|
{
|
|
FILE *bfp = fmemopen(bf, len, "w");
|
|
|
|
if (bfp != NULL) {
|
|
ftype__fprintf(&self->proto, cu, NULL, 0, 0, 0,
|
|
&conf_fprintf__defaults, bfp);
|
|
fclose(bfp);
|
|
} else
|
|
snprintf(bf, len, "<ERROR(%s): fmemopen failed!>", __func__);
|
|
|
|
return bf;
|
|
}
|
|
|
|
static void parameter__delete(struct parameter *self)
|
|
{
|
|
free(self);
|
|
}
|
|
|
|
void ftype__delete(struct ftype *self)
|
|
{
|
|
struct parameter *pos, *n;
|
|
|
|
if (self == NULL)
|
|
return;
|
|
|
|
ftype__for_each_parameter_safe(self, pos, n) {
|
|
list_del_init(&pos->tag.node);
|
|
parameter__delete(pos);
|
|
}
|
|
free(self);
|
|
}
|
|
|
|
void function__delete(struct function *self)
|
|
{
|
|
lexblock__delete_tags(&self->lexblock.tag);
|
|
ftype__delete(&self->proto);
|
|
}
|
|
|
|
int ftype__has_parm_of_type(const struct ftype *self, const uint16_t target,
|
|
const struct cu *cu)
|
|
{
|
|
struct parameter *pos;
|
|
|
|
ftype__for_each_parameter(self, pos) {
|
|
struct tag *type = cu__type(cu, pos->tag.type);
|
|
|
|
if (type != NULL && type->tag == DW_TAG_pointer_type) {
|
|
if (type->type == target)
|
|
return 1;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void ftype__add_parameter(struct ftype *self, struct parameter *parm)
|
|
{
|
|
++self->nr_parms;
|
|
list_add_tail(&parm->tag.node, &self->parms);
|
|
}
|
|
|
|
void lexblock__add_tag(struct lexblock *self, struct tag *tag)
|
|
{
|
|
list_add_tail(&tag->node, &self->tags);
|
|
}
|
|
|
|
void lexblock__add_inline_expansion(struct lexblock *self,
|
|
struct inline_expansion *exp)
|
|
{
|
|
++self->nr_inline_expansions;
|
|
self->size_inline_expansions += exp->size;
|
|
lexblock__add_tag(self, &exp->tag);
|
|
}
|
|
|
|
void lexblock__add_variable(struct lexblock *self, struct variable *var)
|
|
{
|
|
++self->nr_variables;
|
|
lexblock__add_tag(self, &var->tag);
|
|
}
|
|
|
|
void lexblock__add_label(struct lexblock *self, struct label *label)
|
|
{
|
|
++self->nr_labels;
|
|
lexblock__add_tag(self, &label->tag);
|
|
}
|
|
|
|
const struct class_member *class__find_bit_hole(const struct class *self,
|
|
const struct class_member *trailer,
|
|
const uint16_t bit_hole_size)
|
|
{
|
|
struct class_member *pos;
|
|
const size_t byte_hole_size = bit_hole_size / 8;
|
|
|
|
type__for_each_data_member(&self->type, pos)
|
|
if (pos == trailer)
|
|
break;
|
|
else if (pos->hole >= byte_hole_size ||
|
|
pos->bit_hole >= bit_hole_size)
|
|
return pos;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void class__find_holes(struct class *self)
|
|
{
|
|
const struct type *ctype = &self->type;
|
|
struct class_member *pos, *last = NULL;
|
|
size_t last_size = 0;
|
|
uint32_t bit_sum = 0;
|
|
uint32_t bitfield_real_offset = 0;
|
|
|
|
self->nr_holes = 0;
|
|
self->nr_bit_holes = 0;
|
|
|
|
type__for_each_member(ctype, pos) {
|
|
/* XXX for now just skip these */
|
|
if (pos->tag.tag == DW_TAG_inheritance &&
|
|
pos->virtuality == DW_VIRTUALITY_virtual)
|
|
continue;
|
|
|
|
if (last != NULL) {
|
|
/*
|
|
* We have to cast both offsets to int64_t because
|
|
* the current offset can be before the last offset
|
|
* when we are starting a bitfield that combines with
|
|
* the previous, small size fields.
|
|
*/
|
|
const ssize_t cc_last_size = ((int64_t)pos->byte_offset -
|
|
(int64_t)last->byte_offset);
|
|
|
|
/*
|
|
* If the offset is the same this better be a bitfield
|
|
* or an empty struct (see rwlock_t in the Linux kernel
|
|
* sources when compiled for UP) or...
|
|
*/
|
|
if (cc_last_size > 0) {
|
|
/*
|
|
* Check if the DWARF byte_size info is smaller
|
|
* than the size used by the compiler, i.e.
|
|
* when combining small bitfields with the next
|
|
* member.
|
|
*/
|
|
if ((size_t)cc_last_size < last_size)
|
|
last_size = cc_last_size;
|
|
|
|
last->hole = cc_last_size - last_size;
|
|
if (last->hole > 0)
|
|
++self->nr_holes;
|
|
|
|
if (bit_sum != 0) {
|
|
if (bitfield_real_offset != 0) {
|
|
last_size = bitfield_real_offset - last->byte_offset;
|
|
bitfield_real_offset = 0;
|
|
}
|
|
|
|
last->bit_hole = (last_size * 8) -
|
|
bit_sum;
|
|
if (last->bit_hole != 0)
|
|
++self->nr_bit_holes;
|
|
|
|
last->bitfield_end = 1;
|
|
bit_sum = 0;
|
|
}
|
|
} else if (cc_last_size < 0 && bit_sum == 0)
|
|
bitfield_real_offset = last->byte_offset + last_size;
|
|
}
|
|
|
|
bit_sum += pos->bitfield_size;
|
|
|
|
/*
|
|
* check for bitfields, accounting for only the biggest of the
|
|
* byte_size in the fields in each bitfield set.
|
|
*/
|
|
|
|
if (last == NULL || last->byte_offset != pos->byte_offset ||
|
|
pos->bitfield_size == 0 || last->bitfield_size == 0) {
|
|
last_size = pos->byte_size;
|
|
} else if (pos->byte_size > last_size)
|
|
last_size = pos->byte_size;
|
|
|
|
last = pos;
|
|
}
|
|
|
|
if (last != NULL) {
|
|
if (last->byte_offset + last_size != ctype->size)
|
|
self->padding = ctype->size -
|
|
(last->byte_offset + last_size);
|
|
if (last->bitfield_size != 0)
|
|
self->bit_padding = (last_size * 8) - bit_sum;
|
|
} else
|
|
/* No members? Zero sized C++ class */
|
|
self->padding = 0;
|
|
}
|
|
|
|
/** class__has_hole_ge - check if class has a hole greater or equal to @size
|
|
* @self - class instance
|
|
* @size - hole size to check
|
|
*/
|
|
int class__has_hole_ge(const struct class *self, const uint16_t size)
|
|
{
|
|
struct class_member *pos;
|
|
|
|
if (self->nr_holes == 0)
|
|
return 0;
|
|
|
|
type__for_each_data_member(&self->type, pos)
|
|
if (pos->hole >= size)
|
|
return 1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
struct class_member *type__find_member_by_name(const struct type *self,
|
|
const char *name)
|
|
{
|
|
if (name == NULL)
|
|
return NULL;
|
|
|
|
strings_t sname = strings__find(strings, name);
|
|
if (sname == 0)
|
|
return NULL;
|
|
|
|
struct class_member *pos;
|
|
type__for_each_data_member(self, pos)
|
|
if (pos->name == sname)
|
|
return pos;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
uint32_t type__nr_members_of_type(const struct type *self, const Dwarf_Off type)
|
|
{
|
|
struct class_member *pos;
|
|
uint32_t nr_members_of_type = 0;
|
|
|
|
type__for_each_member(self, pos)
|
|
if (pos->tag.type == type)
|
|
++nr_members_of_type;
|
|
|
|
return nr_members_of_type;
|
|
}
|
|
|
|
static void lexblock__account_inline_expansions(struct lexblock *self,
|
|
const struct cu *cu)
|
|
{
|
|
struct tag *pos, *type;
|
|
|
|
if (self->nr_inline_expansions == 0)
|
|
return;
|
|
|
|
list_for_each_entry(pos, &self->tags, node) {
|
|
if (pos->tag == DW_TAG_lexical_block) {
|
|
lexblock__account_inline_expansions(tag__lexblock(pos),
|
|
cu);
|
|
continue;
|
|
} else if (pos->tag != DW_TAG_inlined_subroutine)
|
|
continue;
|
|
|
|
type = cu__function(cu, pos->type);
|
|
if (type != NULL) {
|
|
struct function *ftype = tag__function(type);
|
|
|
|
ftype->cu_total_nr_inline_expansions++;
|
|
ftype->cu_total_size_inline_expansions +=
|
|
tag__inline_expansion(pos)->size;
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
void cu__account_inline_expansions(struct cu *self)
|
|
{
|
|
struct tag *pos;
|
|
struct function *fpos;
|
|
|
|
list_for_each_entry(pos, &self->tags, node) {
|
|
if (!tag__is_function(pos))
|
|
continue;
|
|
fpos = tag__function(pos);
|
|
lexblock__account_inline_expansions(&fpos->lexblock, self);
|
|
self->nr_inline_expansions += fpos->lexblock.nr_inline_expansions;
|
|
self->size_inline_expansions += fpos->lexblock.size_inline_expansions;
|
|
}
|
|
}
|
|
|
|
static size_t ftype__fprintf_parms(const struct ftype *self,
|
|
const struct cu *cu, int indent,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct parameter *pos;
|
|
int first_parm = 1;
|
|
char sbf[128];
|
|
struct tag *type;
|
|
const char *name, *stype;
|
|
size_t printed = fprintf(fp, "(");
|
|
|
|
ftype__for_each_parameter(self, pos) {
|
|
if (!first_parm) {
|
|
if (indent == 0)
|
|
printed += fprintf(fp, ", ");
|
|
else
|
|
printed += fprintf(fp, ",\n%.*s",
|
|
indent, tabs);
|
|
} else
|
|
first_parm = 0;
|
|
name = conf->no_parm_names ? NULL : parameter__name(pos);
|
|
type = cu__type(cu, pos->tag.type);
|
|
if (type == NULL) {
|
|
snprintf(sbf, sizeof(sbf),
|
|
"<ERROR: type %d not found>", pos->tag.type);
|
|
stype = sbf;
|
|
goto print_it;
|
|
}
|
|
if (type->tag == DW_TAG_pointer_type) {
|
|
if (type->type != 0) {
|
|
struct tag *ptype = cu__type(cu, type->type);
|
|
if (ptype == NULL) {
|
|
printed +=
|
|
tag__id_not_found_fprintf(fp, type->type);
|
|
continue;
|
|
}
|
|
if (ptype->tag == DW_TAG_subroutine_type) {
|
|
printed +=
|
|
ftype__fprintf(tag__ftype(ptype),
|
|
cu, name, 0, 1, 0,
|
|
conf, fp);
|
|
continue;
|
|
}
|
|
}
|
|
} else if (type->tag == DW_TAG_subroutine_type) {
|
|
printed += ftype__fprintf(tag__ftype(type), cu, name,
|
|
0, 0, 0, conf, fp);
|
|
continue;
|
|
}
|
|
stype = tag__name(type, cu, sbf, sizeof(sbf));
|
|
print_it:
|
|
printed += fprintf(fp, "%s%s%s", stype, name ? " " : "",
|
|
name ?: "");
|
|
}
|
|
|
|
/* No parameters? */
|
|
if (first_parm)
|
|
printed += fprintf(fp, "void)");
|
|
else if (self->unspec_parms)
|
|
printed += fprintf(fp, ", ...)");
|
|
else
|
|
printed += fprintf(fp, ")");
|
|
return printed;
|
|
}
|
|
|
|
static size_t function__tag_fprintf(const struct tag *tag, const struct cu *cu,
|
|
struct function *function, uint16_t indent,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
char bf[512];
|
|
size_t printed = 0, n;
|
|
const void *vtag = tag;
|
|
int c;
|
|
|
|
if (indent >= sizeof(tabs))
|
|
indent = sizeof(tabs) - 1;
|
|
c = indent * 8;
|
|
|
|
switch (tag->tag) {
|
|
case DW_TAG_inlined_subroutine: {
|
|
const struct inline_expansion *exp = vtag;
|
|
const struct tag *talias = cu__function(cu, exp->tag.type);
|
|
struct function *alias = tag__function(talias);
|
|
const char *name;
|
|
|
|
if (alias == NULL) {
|
|
printed += tag__id_not_found_fprintf(fp, exp->tag.type);
|
|
break;
|
|
}
|
|
printed = fprintf(fp, "%.*s", indent, tabs);
|
|
name = function__name(alias, cu);
|
|
n = fprintf(fp, "%s", name);
|
|
size_t namelen = 0;
|
|
if (name != NULL)
|
|
namelen = strlen(name);
|
|
n += ftype__fprintf_parms(&alias->proto, cu,
|
|
indent + (namelen + 7) / 8,
|
|
conf, fp);
|
|
n += fprintf(fp, "; /* size=%zd, low_pc=%#llx */",
|
|
exp->size, (unsigned long long)exp->low_pc);
|
|
#if 0
|
|
n = fprintf(fp, "%s(); /* size=%zd, low_pc=%#llx */",
|
|
function__name(alias, cu), exp->size,
|
|
(unsigned long long)exp->low_pc);
|
|
#endif
|
|
c = 69;
|
|
printed += n;
|
|
}
|
|
break;
|
|
case DW_TAG_variable:
|
|
printed = fprintf(fp, "%.*s", indent, tabs);
|
|
n = fprintf(fp, "%s %s;",
|
|
variable__type_name(vtag, cu, bf, sizeof(bf)),
|
|
variable__name(vtag));
|
|
c += n;
|
|
printed += n;
|
|
break;
|
|
case DW_TAG_label: {
|
|
const struct label *label = vtag;
|
|
printed = fprintf(fp, "%.*s", indent, tabs);
|
|
fputc('\n', fp);
|
|
++printed;
|
|
c = fprintf(fp, "%s:", s(label->name));
|
|
printed += c;
|
|
}
|
|
break;
|
|
case DW_TAG_lexical_block:
|
|
printed = lexblock__fprintf(vtag, cu, function, indent,
|
|
conf, fp);
|
|
fputc('\n', fp);
|
|
return printed + 1;
|
|
default:
|
|
printed = fprintf(fp, "%.*s", indent, tabs);
|
|
n = fprintf(fp, "%s <%llx>", dwarf_tag_name(tag->tag),
|
|
tag__orig_id(tag, cu));
|
|
c += n;
|
|
printed += n;
|
|
break;
|
|
}
|
|
return printed + fprintf(fp, "%-*.*s// %5u\n", 70 - c, 70 - c, " ",
|
|
tag__decl_line(tag, cu));
|
|
}
|
|
|
|
size_t lexblock__fprintf(const struct lexblock *self, const struct cu *cu,
|
|
struct function *function, uint16_t indent,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct tag *pos;
|
|
size_t printed;
|
|
|
|
if (indent >= sizeof(tabs))
|
|
indent = sizeof(tabs) - 1;
|
|
printed = fprintf(fp, "%.*s{", indent, tabs);
|
|
if (self->low_pc != 0) {
|
|
Dwarf_Off offset = self->low_pc - function->lexblock.low_pc;
|
|
|
|
if (offset == 0)
|
|
printed += fprintf(fp, " /* low_pc=%#llx */",
|
|
(unsigned long long)self->low_pc);
|
|
else
|
|
printed += fprintf(fp, " /* %s+%#llx */",
|
|
function__name(function, cu),
|
|
(unsigned long long)offset);
|
|
}
|
|
printed += fprintf(fp, "\n");
|
|
list_for_each_entry(pos, &self->tags, node)
|
|
printed += function__tag_fprintf(pos, cu, function, indent + 1,
|
|
conf, fp);
|
|
printed += fprintf(fp, "%.*s}", indent, tabs);
|
|
|
|
if (function->lexblock.low_pc != self->low_pc)
|
|
printed += fprintf(fp, " /* lexblock size=%d */", self->size);
|
|
|
|
return printed;
|
|
}
|
|
|
|
size_t ftype__fprintf(const struct ftype *self, const struct cu *cu,
|
|
const char *name, const int inlined,
|
|
const int is_pointer, int type_spacing,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct tag *type = cu__type(cu, self->tag.type);
|
|
char sbf[128];
|
|
const char *stype = tag__name(type, cu, sbf, sizeof(sbf));
|
|
size_t printed = fprintf(fp, "%s%-*s %s%s%s%s",
|
|
inlined ? "inline " : "",
|
|
type_spacing, stype,
|
|
self->tag.tag == DW_TAG_subroutine_type ?
|
|
"(" : "",
|
|
is_pointer ? "*" : "", name ?: "",
|
|
self->tag.tag == DW_TAG_subroutine_type ?
|
|
")" : "");
|
|
|
|
return printed + ftype__fprintf_parms(self, cu, 0, conf, fp);
|
|
}
|
|
|
|
static size_t function__fprintf(const struct tag *tag_self,
|
|
const struct cu *cu,
|
|
const struct conf_fprintf *conf,
|
|
FILE *fp)
|
|
{
|
|
struct function *self = tag__function(tag_self);
|
|
size_t printed = 0;
|
|
|
|
if (self->virtuality == DW_VIRTUALITY_virtual ||
|
|
self->virtuality == DW_VIRTUALITY_pure_virtual)
|
|
printed += fprintf(fp, "virtual ");
|
|
|
|
printed += ftype__fprintf(&self->proto, cu, function__name(self, cu),
|
|
function__declared_inline(self), 0, 0,
|
|
conf, fp);
|
|
|
|
if (self->virtuality == DW_VIRTUALITY_pure_virtual)
|
|
printed += fprintf(fp, " = 0");
|
|
|
|
return printed;
|
|
}
|
|
|
|
size_t function__fprintf_stats(const struct tag *tag_self,
|
|
const struct cu *cu,
|
|
const struct conf_fprintf *conf,
|
|
FILE *fp)
|
|
{
|
|
struct function *self = tag__function(tag_self);
|
|
size_t printed = lexblock__fprintf(&self->lexblock, cu, self, 0, conf, fp);
|
|
|
|
printed += fprintf(fp, "/* size: %d", function__size(self));
|
|
if (self->lexblock.nr_variables > 0)
|
|
printed += fprintf(fp, ", variables: %u",
|
|
self->lexblock.nr_variables);
|
|
if (self->lexblock.nr_labels > 0)
|
|
printed += fprintf(fp, ", goto labels: %u",
|
|
self->lexblock.nr_labels);
|
|
if (self->lexblock.nr_inline_expansions > 0)
|
|
printed += fprintf(fp, ", inline expansions: %u (%d bytes)",
|
|
self->lexblock.nr_inline_expansions,
|
|
self->lexblock.size_inline_expansions);
|
|
return printed + fprintf(fp, " */\n");
|
|
}
|
|
|
|
static size_t class__fprintf_cacheline_boundary(uint32_t last_cacheline,
|
|
size_t sum, size_t sum_holes,
|
|
uint8_t *newline,
|
|
uint32_t *cacheline,
|
|
int indent, FILE *fp)
|
|
{
|
|
const size_t real_sum = sum + sum_holes;
|
|
size_t printed = 0;
|
|
|
|
*cacheline = real_sum / cacheline_size;
|
|
|
|
if (*cacheline > last_cacheline) {
|
|
const uint32_t cacheline_pos = real_sum % cacheline_size;
|
|
const uint32_t cacheline_in_bytes = real_sum - cacheline_pos;
|
|
|
|
if (*newline) {
|
|
fputc('\n', fp);
|
|
*newline = 0;
|
|
++printed;
|
|
}
|
|
|
|
printed += fprintf(fp, "%.*s", indent, tabs);
|
|
|
|
if (cacheline_pos == 0)
|
|
printed += fprintf(fp, "/* --- cacheline %u boundary "
|
|
"(%u bytes) --- */\n", *cacheline,
|
|
cacheline_in_bytes);
|
|
else
|
|
printed += fprintf(fp, "/* --- cacheline %u boundary "
|
|
"(%u bytes) was %u bytes ago --- "
|
|
"*/\n", *cacheline,
|
|
cacheline_in_bytes, cacheline_pos);
|
|
}
|
|
return printed;
|
|
}
|
|
|
|
static size_t class__vtable_fprintf(struct class *self,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct function *pos;
|
|
size_t printed = 0;
|
|
|
|
if (self->nr_vtable_entries == 0)
|
|
goto out;
|
|
|
|
printed += fprintf(fp, "%.*s/* vtable has %u entries: {\n",
|
|
conf->indent, tabs, self->nr_vtable_entries);
|
|
|
|
list_for_each_entry(pos, &self->vtable, vtable_node) {
|
|
printed += fprintf(fp, "%.*s [%d] = %s(%s), \n",
|
|
conf->indent, tabs, pos->vtable_entry,
|
|
s(pos->name),
|
|
s(pos->linkage_name));
|
|
}
|
|
|
|
printed += fprintf(fp, "%.*s} */", conf->indent, tabs);
|
|
out:
|
|
return printed;
|
|
}
|
|
|
|
size_t class__fprintf(struct class *self, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct type *tself = &self->type;
|
|
size_t last_size = 0, size;
|
|
uint8_t newline = 0;
|
|
uint16_t nr_paddings = 0;
|
|
uint32_t sum = 0;
|
|
uint32_t sum_holes = 0;
|
|
uint32_t sum_paddings = 0;
|
|
uint32_t sum_bit_holes = 0;
|
|
uint32_t last_cacheline = 0;
|
|
uint32_t bitfield_real_offset = 0;
|
|
int first = 1;
|
|
struct class_member *pos, *last = NULL;
|
|
struct tag *tag_pos;
|
|
const char *current_accessibility = NULL;
|
|
struct conf_fprintf cconf = conf ? *conf : conf_fprintf__defaults;
|
|
size_t printed = fprintf(fp, "%s%s%s%s%s",
|
|
cconf.prefix ?: "", cconf.prefix ? " " : "",
|
|
tself->namespace.tag.tag == DW_TAG_class_type ? "class" : "struct",
|
|
type__name(tself) ? " " : "",
|
|
type__name(tself) ?: "");
|
|
int indent = cconf.indent;
|
|
|
|
if (indent >= (int)sizeof(tabs))
|
|
indent = sizeof(tabs) - 1;
|
|
|
|
cconf.indent = indent + 1;
|
|
cconf.no_semicolon = 0;
|
|
|
|
/* First look if we have DW_TAG_inheritance */
|
|
type__for_each_tag(tself, tag_pos) {
|
|
struct tag *type;
|
|
const char *accessibility;
|
|
|
|
if (tag_pos->tag != DW_TAG_inheritance)
|
|
continue;
|
|
|
|
if (first) {
|
|
printed += fprintf(fp, " :");
|
|
first = 0;
|
|
} else
|
|
printed += fprintf(fp, ",");
|
|
|
|
pos = tag__class_member(tag_pos);
|
|
|
|
if (pos->virtuality == DW_VIRTUALITY_virtual)
|
|
printed += fprintf(fp, " virtual");
|
|
|
|
accessibility = tag__accessibility(tag_pos);
|
|
if (accessibility != NULL)
|
|
printed += fprintf(fp, " %s", accessibility);
|
|
|
|
type = cu__type(cu, tag_pos->type);
|
|
if (type != NULL)
|
|
printed += fprintf(fp, " %s", type__name(tag__type(type)));
|
|
else
|
|
printed += tag__id_not_found_fprintf(fp, tag_pos->type);
|
|
}
|
|
|
|
printed += fprintf(fp, " {\n");
|
|
|
|
type__for_each_tag(tself, tag_pos) {
|
|
struct tag *type;
|
|
const char *accessibility = tag__accessibility(tag_pos);
|
|
|
|
if (accessibility != NULL &&
|
|
accessibility != current_accessibility) {
|
|
current_accessibility = accessibility;
|
|
printed += fprintf(fp, "%.*s%s:\n\n",
|
|
cconf.indent - 1, tabs,
|
|
accessibility);
|
|
}
|
|
|
|
if (tag_pos->tag != DW_TAG_member &&
|
|
tag_pos->tag != DW_TAG_inheritance) {
|
|
if (!cconf.show_only_data_members) {
|
|
printed += tag__fprintf(tag_pos, cu, &cconf, fp);
|
|
printed += fprintf(fp, "\n\n");
|
|
}
|
|
continue;
|
|
}
|
|
pos = tag__class_member(tag_pos);
|
|
|
|
if (last != NULL &&
|
|
pos->byte_offset != last->byte_offset &&
|
|
!cconf.suppress_comments)
|
|
printed +=
|
|
class__fprintf_cacheline_boundary(last_cacheline,
|
|
sum, sum_holes,
|
|
&newline,
|
|
&last_cacheline,
|
|
cconf.indent,
|
|
fp);
|
|
/*
|
|
* These paranoid checks doesn't make much sense on
|
|
* DW_TAG_inheritance, have to understand why virtual public
|
|
* ancestors make the offset go backwards...
|
|
*/
|
|
if (last != NULL && tag_pos->tag == DW_TAG_member) {
|
|
if (pos->byte_offset < last->byte_offset ||
|
|
(pos->byte_offset == last->byte_offset &&
|
|
last->bitfield_size == 0 &&
|
|
/*
|
|
* This is just when transitioning from a non-bitfield to
|
|
* a bitfield, think about zero sized arrays in the middle
|
|
* of a struct.
|
|
*/
|
|
pos->bitfield_size != 0)) {
|
|
if (!cconf.suppress_comments) {
|
|
if (!newline++) {
|
|
fputc('\n', fp);
|
|
++printed;
|
|
}
|
|
printed += fprintf(fp, "%.*s/* Bitfield combined"
|
|
" with previous fields */\n",
|
|
cconf.indent, tabs);
|
|
}
|
|
if (pos->byte_offset != last->byte_offset)
|
|
bitfield_real_offset = last->byte_offset + last_size;
|
|
} else {
|
|
const ssize_t cc_last_size = ((ssize_t)pos->byte_offset -
|
|
(ssize_t)last->byte_offset);
|
|
|
|
if (cc_last_size > 0 &&
|
|
(size_t)cc_last_size < last_size) {
|
|
if (!cconf.suppress_comments) {
|
|
if (!newline++) {
|
|
fputc('\n', fp);
|
|
++printed;
|
|
}
|
|
printed += fprintf(fp, "%.*s/* Bitfield combined"
|
|
" with next fields */\n",
|
|
cconf.indent, tabs);
|
|
}
|
|
sum -= last_size;
|
|
sum += cc_last_size;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (newline) {
|
|
fputc('\n', fp);
|
|
newline = 0;
|
|
++printed;
|
|
}
|
|
|
|
type = cu__type(cu, pos->tag.type);
|
|
if (type == NULL) {
|
|
printed += fprintf(fp, "%.*s", cconf.indent, tabs);
|
|
printed += tag__id_not_found_fprintf(fp, pos->tag.type);
|
|
continue;
|
|
}
|
|
|
|
size = pos->byte_size;
|
|
printed += fprintf(fp, "%.*s", cconf.indent, tabs);
|
|
printed += struct_member__fprintf(pos, type, cu, &cconf, fp);
|
|
|
|
if (tag__is_struct(type) && !cconf.suppress_comments) {
|
|
const uint16_t padding = tag__class(type)->padding;
|
|
if (padding > 0) {
|
|
++nr_paddings;
|
|
sum_paddings += padding;
|
|
if (!newline++) {
|
|
fputc('\n', fp);
|
|
++printed;
|
|
}
|
|
|
|
printed += fprintf(fp, "\n%.*s/* XXX last "
|
|
"struct has %d byte%s of "
|
|
"padding */", cconf.indent,
|
|
tabs, padding,
|
|
padding != 1 ? "s" : "");
|
|
}
|
|
}
|
|
|
|
if (pos->bit_hole != 0 && !cconf.suppress_comments) {
|
|
if (!newline++) {
|
|
fputc('\n', fp);
|
|
++printed;
|
|
}
|
|
printed += fprintf(fp, "\n%.*s/* XXX %d bit%s hole, "
|
|
"try to pack */", cconf.indent, tabs,
|
|
pos->bit_hole,
|
|
pos->bit_hole != 1 ? "s" : "");
|
|
sum_bit_holes += pos->bit_hole;
|
|
}
|
|
|
|
if (pos->hole > 0 && !cconf.suppress_comments) {
|
|
if (!newline++) {
|
|
fputc('\n', fp);
|
|
++printed;
|
|
}
|
|
printed += fprintf(fp, "\n%.*s/* XXX %d byte%s hole, "
|
|
"try to pack */",
|
|
cconf.indent, tabs, pos->hole,
|
|
pos->hole != 1 ? "s" : "");
|
|
sum_holes += pos->hole;
|
|
}
|
|
|
|
fputc('\n', fp);
|
|
++printed;
|
|
|
|
/* XXX for now just skip these */
|
|
if (tag_pos->tag == DW_TAG_inheritance &&
|
|
pos->virtuality == DW_VIRTUALITY_virtual)
|
|
continue;
|
|
|
|
/*
|
|
* Check if we have to adjust size because bitfields were
|
|
* combined with previous fields.
|
|
*/
|
|
if (bitfield_real_offset != 0 && last->bitfield_end) {
|
|
size_t real_last_size = pos->byte_offset - bitfield_real_offset;
|
|
sum -= last_size;
|
|
sum += real_last_size;
|
|
bitfield_real_offset = 0;
|
|
}
|
|
|
|
if (last == NULL || /* First member */
|
|
/*
|
|
* Last member was a zero sized array, typedef, struct, etc
|
|
*/
|
|
last_size == 0 ||
|
|
/*
|
|
* We moved to a new offset
|
|
*/
|
|
last->byte_offset != pos->byte_offset) {
|
|
sum += size;
|
|
last_size = size;
|
|
} else if (last->bitfield_size == 0 && pos->bitfield_size != 0) {
|
|
/*
|
|
* Transitioned from from a non-bitfield to a
|
|
* bitfield sharing the same offset
|
|
*/
|
|
/*
|
|
* Compensate by removing the size of the
|
|
* last member that is "inside" this new
|
|
* member at the same offset.
|
|
*
|
|
* E.g.:
|
|
* struct foo {
|
|
* u8 a; / 0 1 /
|
|
* int b:1; / 0:23 4 /
|
|
* }
|
|
*/
|
|
sum += size - last_size;
|
|
last_size = size;
|
|
}
|
|
|
|
last = pos;
|
|
}
|
|
|
|
/*
|
|
* Check if we have to adjust size because bitfields were
|
|
* combined with previous fields and were the last fields
|
|
* in the struct.
|
|
*/
|
|
if (bitfield_real_offset != 0) {
|
|
size_t real_last_size = tself->size - bitfield_real_offset;
|
|
sum -= last_size;
|
|
sum += real_last_size;
|
|
bitfield_real_offset = 0;
|
|
}
|
|
|
|
if (!cconf.suppress_comments)
|
|
printed += class__fprintf_cacheline_boundary(last_cacheline,
|
|
sum, sum_holes,
|
|
&newline,
|
|
&last_cacheline,
|
|
cconf.indent, fp);
|
|
class__vtable_fprintf(self, &cconf, fp);
|
|
if (!cconf.emit_stats)
|
|
goto out;
|
|
|
|
printed += fprintf(fp, "\n%.*s/* size: %zd, cachelines: %zd, members: %u */",
|
|
cconf.indent, tabs,
|
|
tag__size(class__tag(self), cu),
|
|
tag__nr_cachelines(class__tag(self), cu),
|
|
tself->nr_members);
|
|
if (sum_holes > 0)
|
|
printed += fprintf(fp, "\n%.*s/* sum members: %u, holes: %d, "
|
|
"sum holes: %u */",
|
|
cconf.indent, tabs,
|
|
sum, self->nr_holes, sum_holes);
|
|
if (sum_bit_holes > 0)
|
|
printed += fprintf(fp, "\n%.*s/* bit holes: %d, sum bit "
|
|
"holes: %u bits */",
|
|
cconf.indent, tabs,
|
|
self->nr_bit_holes, sum_bit_holes);
|
|
if (self->padding > 0)
|
|
printed += fprintf(fp, "\n%.*s/* padding: %u */",
|
|
cconf.indent,
|
|
tabs, self->padding);
|
|
if (nr_paddings > 0)
|
|
printed += fprintf(fp, "\n%.*s/* paddings: %u, sum paddings: "
|
|
"%u */",
|
|
cconf.indent, tabs,
|
|
nr_paddings, sum_paddings);
|
|
if (self->bit_padding > 0)
|
|
printed += fprintf(fp, "\n%.*s/* bit_padding: %u bits */",
|
|
cconf.indent, tabs,
|
|
self->bit_padding);
|
|
last_cacheline = tself->size % cacheline_size;
|
|
if (last_cacheline != 0)
|
|
printed += fprintf(fp, "\n%.*s/* last cacheline: %u bytes */",
|
|
cconf.indent, tabs,
|
|
last_cacheline);
|
|
if (cconf.show_first_biggest_size_base_type_member &&
|
|
tself->nr_members != 0) {
|
|
struct class_member *m = type__find_first_biggest_size_base_type_member(tself, cu);
|
|
|
|
printed += fprintf(fp, "\n%.*s/* first biggest size base type member: %s %u %zd */",
|
|
cconf.indent, tabs,
|
|
s(m->name), m->byte_offset,
|
|
m->byte_size);
|
|
}
|
|
|
|
if (sum + sum_holes != tself->size - self->padding &&
|
|
tself->nr_members != 0)
|
|
printed += fprintf(fp, "\n\n%.*s/* BRAIN FART ALERT! %d != %u "
|
|
"+ %u(holes), diff = %d */\n",
|
|
cconf.indent, tabs,
|
|
tself->size, sum, sum_holes,
|
|
tself->size - (sum + sum_holes));
|
|
fputc('\n', fp);
|
|
out:
|
|
return printed + fprintf(fp, "%.*s}%s%s", indent, tabs,
|
|
cconf.suffix ? " ": "", cconf.suffix ?: "");
|
|
}
|
|
|
|
static size_t variable__fprintf(const struct tag *tag, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
const struct variable *var = tag__variable(tag);
|
|
const char *name = variable__name(var);
|
|
size_t printed = 0;
|
|
|
|
if (name != NULL) {
|
|
struct tag *type = cu__type(cu, var->tag.type);
|
|
if (type != NULL) {
|
|
const char *varprefix = variable__prefix(var);
|
|
|
|
if (varprefix != NULL)
|
|
printed += fprintf(fp, "%s", varprefix);
|
|
printed += type__fprintf(type, cu, name, conf, fp);
|
|
}
|
|
}
|
|
return printed;
|
|
}
|
|
|
|
static size_t namespace__fprintf(const struct tag *tself, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
struct namespace *self = tag__namespace(tself);
|
|
struct conf_fprintf cconf = *conf;
|
|
size_t printed = fprintf(fp, "namespace %s {\n", s(self->name));
|
|
struct tag *pos;
|
|
|
|
++cconf.indent;
|
|
cconf.no_semicolon = 0;
|
|
|
|
namespace__for_each_tag(self, pos) {
|
|
printed += tag__fprintf(pos, cu, &cconf, fp);
|
|
printed += fprintf(fp, "\n\n");
|
|
}
|
|
|
|
return printed + fprintf(fp, "}");
|
|
}
|
|
|
|
size_t tag__fprintf(struct tag *self, const struct cu *cu,
|
|
const struct conf_fprintf *conf, FILE *fp)
|
|
{
|
|
size_t printed = 0;
|
|
struct conf_fprintf tconf;
|
|
const struct conf_fprintf *pconf = conf;
|
|
|
|
if (conf == NULL) {
|
|
tconf = conf_fprintf__defaults;
|
|
pconf = &tconf;
|
|
|
|
if (tconf.expand_types)
|
|
tconf.name_spacing = 55;
|
|
else if (tag__is_union(self))
|
|
tconf.name_spacing = 21;
|
|
} else if (conf->name_spacing == 0 || conf->type_spacing == 0) {
|
|
tconf = *conf;
|
|
pconf = &tconf;
|
|
|
|
if (tconf.name_spacing == 0) {
|
|
if (tconf.expand_types)
|
|
tconf.name_spacing = 55;
|
|
else
|
|
tconf.name_spacing =
|
|
tag__is_union(self) ? 21 : 23;
|
|
}
|
|
if (tconf.type_spacing == 0)
|
|
tconf.type_spacing = 26;
|
|
}
|
|
|
|
if (pconf->expand_types)
|
|
++self->recursivity_level;
|
|
|
|
if (pconf->show_decl_info) {
|
|
printed += fprintf(fp, "%.*s", pconf->indent, tabs);
|
|
printed += tag__fprintf_decl_info(self, cu, fp);
|
|
}
|
|
printed += fprintf(fp, "%.*s", pconf->indent, tabs);
|
|
|
|
switch (self->tag) {
|
|
case DW_TAG_array_type:
|
|
printed += array_type__fprintf(self, cu, "array", pconf, fp);
|
|
break;
|
|
case DW_TAG_enumeration_type:
|
|
printed += enumeration__fprintf(self, pconf, fp);
|
|
break;
|
|
case DW_TAG_typedef:
|
|
printed += typedef__fprintf(self, cu, pconf, fp);
|
|
break;
|
|
case DW_TAG_class_type:
|
|
case DW_TAG_structure_type:
|
|
printed += class__fprintf(tag__class(self), cu, pconf, fp);
|
|
break;
|
|
case DW_TAG_namespace:
|
|
printed += namespace__fprintf(self, cu, pconf, fp);
|
|
break;
|
|
case DW_TAG_subprogram:
|
|
printed += function__fprintf(self, cu, pconf, fp);
|
|
break;
|
|
case DW_TAG_union_type:
|
|
printed += union__fprintf(tag__type(self), cu, pconf, fp);
|
|
break;
|
|
case DW_TAG_variable:
|
|
printed += variable__fprintf(self, cu, pconf, fp);
|
|
break;
|
|
case DW_TAG_imported_declaration:
|
|
printed += imported_declaration__fprintf(self, cu, fp);
|
|
break;
|
|
case DW_TAG_imported_module:
|
|
printed += imported_module__fprintf(self, cu, fp);
|
|
break;
|
|
default:
|
|
printed += fprintf(fp, "/* %s: %s tag not supported! */", __func__,
|
|
dwarf_tag_name(self->tag));
|
|
break;
|
|
}
|
|
|
|
if (!pconf->no_semicolon) {
|
|
fputc(';', fp);
|
|
++printed;
|
|
}
|
|
|
|
if (tag__is_function(self) && !pconf->suppress_comments) {
|
|
const struct function *fself = tag__function(self);
|
|
|
|
if (fself->linkage_name)
|
|
printed += fprintf(fp, " /* linkage=%s */",
|
|
s(fself->linkage_name));
|
|
}
|
|
|
|
if (pconf->expand_types)
|
|
--self->recursivity_level;
|
|
|
|
return printed;
|
|
}
|
|
|
|
static int list__for_all_tags(struct list_head *self, struct cu *cu,
|
|
int (*iterator)(struct tag *tag,
|
|
struct cu *cu, void *cookie),
|
|
void *cookie)
|
|
{
|
|
struct tag *pos, *n;
|
|
|
|
list_for_each_entry_safe(pos, n, self, node) {
|
|
if (tag__has_namespace(pos)) {
|
|
struct namespace *space = tag__namespace(pos);
|
|
|
|
/* See comment in type__for_each_enumerator */
|
|
if (space->shared_tags)
|
|
continue;
|
|
if (list__for_all_tags(&space->tags, cu,
|
|
iterator, cookie))
|
|
return 1;
|
|
/*
|
|
* vtable functions are already in the class tags list
|
|
*/
|
|
} else if (tag__is_function(pos)) {
|
|
if (list__for_all_tags(&tag__ftype(pos)->parms,
|
|
cu, iterator, cookie))
|
|
return 1;
|
|
if (list__for_all_tags(&tag__function(pos)->lexblock.tags,
|
|
cu, iterator, cookie))
|
|
return 1;
|
|
} else if (pos->tag == DW_TAG_subroutine_type) {
|
|
if (list__for_all_tags(&tag__ftype(pos)->parms,
|
|
cu, iterator, cookie))
|
|
return 1;
|
|
} else if (pos->tag == DW_TAG_lexical_block) {
|
|
if (list__for_all_tags(&tag__lexblock(pos)->tags,
|
|
cu, iterator, cookie))
|
|
return 1;
|
|
}
|
|
|
|
if (iterator(pos, cu, cookie))
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int cu__for_all_tags(struct cu *self,
|
|
int (*iterator)(struct tag *tag,
|
|
struct cu *cu, void *cookie),
|
|
void *cookie)
|
|
{
|
|
return list__for_all_tags(&self->tags, self, iterator, cookie);
|
|
}
|
|
|
|
void cus__for_each_cu(struct cus *self,
|
|
int (*iterator)(struct cu *cu, void *cookie),
|
|
void *cookie,
|
|
struct cu *(*filter)(struct cu *cu))
|
|
{
|
|
struct cu *pos;
|
|
|
|
list_for_each_entry(pos, &self->cus, node) {
|
|
struct cu *cu = pos;
|
|
if (filter != NULL) {
|
|
cu = filter(pos);
|
|
if (cu == NULL)
|
|
continue;
|
|
}
|
|
if (iterator(cu, cookie))
|
|
break;
|
|
}
|
|
}
|
|
|
|
int cus__load_dir(struct cus *self, struct conf_load *conf,
|
|
const char *dirname, const char *filename_mask,
|
|
const int recursive)
|
|
{
|
|
struct dirent *entry;
|
|
int err = -1;
|
|
DIR *dir = opendir(dirname);
|
|
|
|
if (dir == NULL)
|
|
goto out;
|
|
|
|
err = 0;
|
|
while ((entry = readdir(dir)) != NULL) {
|
|
char pathname[PATH_MAX];
|
|
struct stat st;
|
|
|
|
if (strcmp(entry->d_name, ".") == 0 ||
|
|
strcmp(entry->d_name, "..") == 0)
|
|
continue;
|
|
|
|
snprintf(pathname, sizeof(pathname), "%s/%s",
|
|
dirname, entry->d_name);
|
|
|
|
err = lstat(pathname, &st);
|
|
if (err != 0)
|
|
break;
|
|
|
|
if (S_ISDIR(st.st_mode)) {
|
|
if (!recursive)
|
|
continue;
|
|
|
|
err = cus__load_dir(self, conf, pathname,
|
|
filename_mask, recursive);
|
|
if (err != 0)
|
|
break;
|
|
} else if (fnmatch(filename_mask, entry->d_name, 0) == 0) {
|
|
err = cus__load_file(self, conf, pathname);
|
|
if (err != 0)
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (err == -1)
|
|
puts(dirname);
|
|
closedir(dir);
|
|
out:
|
|
return err;
|
|
}
|
|
|
|
/*
|
|
* This should really do demand loading of DSOs, STABS anyone? 8-)
|
|
*/
|
|
typedef int (*debugging_format_loader_t)(struct cus *self,
|
|
struct conf_load *conf,
|
|
const char *filename);
|
|
|
|
static struct debugging_formats {
|
|
char *name;
|
|
debugging_format_loader_t loader;
|
|
} debugging_formats__table[] = {
|
|
{
|
|
.name = "dwarf",
|
|
.loader = dwarf__load_file,
|
|
},
|
|
{
|
|
.name = "ctf",
|
|
.loader = ctf__load_file,
|
|
},
|
|
{
|
|
.name = NULL,
|
|
},
|
|
};
|
|
|
|
static debugging_format_loader_t debugging_formats__loader(const char *name)
|
|
{
|
|
int i = 0;
|
|
while (debugging_formats__table[i].name != NULL) {
|
|
if (strcmp(debugging_formats__table[i].name, name) == 0)
|
|
return debugging_formats__table[i].loader;
|
|
++i;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
int cus__load_file(struct cus *self, struct conf_load *conf, char *filename)
|
|
{
|
|
int i = 0, err = 0;
|
|
debugging_format_loader_t loader;
|
|
|
|
if (conf && conf->format_path != NULL) {
|
|
char *fpath = strdup(conf->format_path);
|
|
if (fpath == NULL)
|
|
return -ENOMEM;
|
|
char *fp = fpath;
|
|
while (1) {
|
|
char *sep = strchr(fp, ',');
|
|
|
|
if (sep != NULL)
|
|
*sep = '\0';
|
|
|
|
err = -ENOTSUP;
|
|
loader = debugging_formats__loader(fp);
|
|
if (loader == NULL)
|
|
break;
|
|
|
|
err = 0;
|
|
if (loader(self, conf, filename) == 0)
|
|
break;
|
|
|
|
err = -EINVAL;
|
|
if (sep == NULL)
|
|
break;
|
|
|
|
fp = sep + 1;
|
|
}
|
|
free(fpath);
|
|
return err;
|
|
}
|
|
|
|
while (debugging_formats__table[i].name != NULL) {
|
|
loader = debugging_formats__table[i].loader;
|
|
if (loader(self, conf, filename) == 0)
|
|
return 0;
|
|
++i;
|
|
}
|
|
|
|
return -EINVAL;
|
|
}
|
|
|
|
int cus__load_files(struct cus *self, struct conf_load *conf,
|
|
char *filenames[])
|
|
{
|
|
int i = 0;
|
|
|
|
while (filenames[i] != NULL) {
|
|
if (cus__load_file(self, conf, filenames[i]))
|
|
return -i;
|
|
++i;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void cus__print_error_msg(const char *progname, const struct cus *cus,
|
|
const char *filename, const int err)
|
|
{
|
|
if (err == -EINVAL || (cus != NULL && list_empty(&cus->cus)))
|
|
fprintf(stderr, "%s: couldn't load debugging info from %s\n",
|
|
progname, filename);
|
|
else
|
|
fprintf(stderr, "%s: %s\n", progname, strerror(err));
|
|
}
|
|
|
|
struct cus *cus__new(void)
|
|
{
|
|
struct cus *self = malloc(sizeof(*self));
|
|
|
|
if (self != NULL)
|
|
INIT_LIST_HEAD(&self->cus);
|
|
|
|
return self;
|
|
}
|
|
|
|
void cus__delete(struct cus *self)
|
|
{
|
|
struct cu *pos, *n;
|
|
|
|
if (self == NULL)
|
|
return;
|
|
|
|
list_for_each_entry_safe(pos, n, &self->cus, node) {
|
|
list_del_init(&pos->node);
|
|
cu__delete(pos);
|
|
}
|
|
|
|
free(self);
|
|
}
|
|
|
|
int dwarves__init(uint16_t user_cacheline_size)
|
|
{
|
|
strings = strings__new();
|
|
|
|
if (strings == NULL)
|
|
return -ENOMEM;
|
|
|
|
if (user_cacheline_size == 0) {
|
|
long sys_cacheline_size = sysconf(_SC_LEVEL1_DCACHE_LINESIZE);
|
|
|
|
if (sys_cacheline_size > 0)
|
|
cacheline_size = sys_cacheline_size;
|
|
else
|
|
cacheline_size = 64; /* Fall back to a sane value */
|
|
} else
|
|
cacheline_size = user_cacheline_size;
|
|
|
|
return 0;
|
|
}
|
|
|
|
void dwarves__exit(void)
|
|
{
|
|
strings__delete(strings);
|
|
strings = NULL;
|
|
}
|
|
|
|
struct argp_state;
|
|
|
|
void dwarves_print_version(FILE *fp, struct argp_state *state __unused)
|
|
{
|
|
fprintf(fp, "%s\n", DWARVES_VERSION);
|
|
}
|