f07b4e8047
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
1057 lines
27 KiB
C
1057 lines
27 KiB
C
/*
|
|
Copyright (C) 2006 Mandriva Conectiva S.A.
|
|
Copyright (C) 2006 Arnaldo Carvalho de Melo <acme@mandriva.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 <argp.h>
|
|
#include <limits.h>
|
|
#include <search.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <sys/types.h>
|
|
|
|
#include "dwarves_reorganize.h"
|
|
#include "dwarves_emit.h"
|
|
#include "dwarves.h"
|
|
#include "dutil.h"
|
|
|
|
/*
|
|
* target class name
|
|
*/
|
|
static char *class_name;
|
|
|
|
/*
|
|
* List of compilation units being looked for functions with
|
|
* pointers to the specified struct.
|
|
*/
|
|
static struct cus *methods_cus;
|
|
|
|
/**
|
|
* Mini class, the subset of the traced class that is collected at the probes
|
|
*/
|
|
|
|
static struct class *mini_class;
|
|
|
|
/*
|
|
* Directory where to generate source files
|
|
*/
|
|
static const char *src_dir = ".";
|
|
|
|
/*
|
|
* Where to print the ctracer_methods.stp file
|
|
*/
|
|
static FILE *fp_methods;
|
|
|
|
/*
|
|
* Where to print the ctracer_collector.c file
|
|
*/
|
|
static FILE *fp_collector;
|
|
|
|
/*
|
|
* Where to print the ctracer_classes.h file
|
|
*/
|
|
static FILE *fp_classes;
|
|
|
|
/*
|
|
* List of definitions and forward declarations already emitted for
|
|
* methods_cus, to avoid duplication.
|
|
*/
|
|
static struct type_emissions cus__emissions;
|
|
|
|
/*
|
|
* CU blacklist: if a "blacklist.cu" file is present, don't consider the
|
|
* CUs listed. Use a default of blacklist.cu.
|
|
*/
|
|
static const char *cu_blacklist_filename = "blacklist.cu";
|
|
|
|
static struct strlist *cu_blacklist;
|
|
|
|
static struct cu *cu_filter(struct cu *cu)
|
|
{
|
|
if (cu_blacklist != NULL &&
|
|
strlist__has_entry(cu_blacklist, cu->name))
|
|
return NULL;
|
|
return cu;
|
|
}
|
|
|
|
/*
|
|
* List of probes and kretprobes already emitted, this is a hack to cope with
|
|
* name space collisions, a better solution would be to in these cases to use the
|
|
* compilation unit name (net/ipv4/tcp.o, for instance) as a prefix when a
|
|
* static function has the same name in multiple compilation units (aka object
|
|
* files).
|
|
*/
|
|
static void *probes_emitted;
|
|
|
|
struct structure {
|
|
struct list_head node;
|
|
struct tag *class;
|
|
struct cu *cu;
|
|
};
|
|
|
|
static struct structure *structure__new(struct tag *class, struct cu *cu)
|
|
{
|
|
struct structure *self = malloc(sizeof(*self));
|
|
|
|
if (self != NULL) {
|
|
self->class = class;
|
|
self->cu = cu;
|
|
}
|
|
|
|
return self;
|
|
}
|
|
|
|
/*
|
|
* structs that can be casted to the target class, e.g. i.e. that has the target
|
|
* class at its first member.
|
|
*/
|
|
static LIST_HEAD(aliases);
|
|
|
|
/*
|
|
* structs have pointers to the target class.
|
|
*/
|
|
static LIST_HEAD(pointers);
|
|
|
|
static struct structure *structures__find(struct list_head *list, const char *name)
|
|
{
|
|
struct structure *pos;
|
|
|
|
if (name == NULL)
|
|
return NULL;
|
|
|
|
list_for_each_entry(pos, list, node)
|
|
if (strcmp(class__name(tag__class(pos->class), pos->cu), name) == 0)
|
|
return pos;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
static void structures__add(struct list_head *list, struct tag *class, struct cu *cu)
|
|
{
|
|
struct structure *str = structure__new(class, cu);
|
|
|
|
if (str != NULL)
|
|
list_add(&str->node, list);
|
|
}
|
|
|
|
static int methods__compare(const void *a, const void *b)
|
|
{
|
|
return strcmp(a, b);
|
|
}
|
|
|
|
static int methods__add(void **table, const char *str)
|
|
{
|
|
char **s = tsearch(str, table, methods__compare);
|
|
|
|
if (s != NULL) {
|
|
if (*s == str) {
|
|
char *dup = strdup(str);
|
|
if (dup != NULL)
|
|
*s = dup;
|
|
else {
|
|
tdelete(str, table, methods__compare);
|
|
return -1;
|
|
}
|
|
} else
|
|
return -1;
|
|
} else
|
|
return -1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static void method__add(struct cu *cu, struct function *function)
|
|
{
|
|
list_add(&function->tool_node, &cu->tool_list);
|
|
}
|
|
|
|
/*
|
|
* We want just the DW_TAG_subprogram tags that have as one of its parameters
|
|
* a pointer to the specified "class" (a struct, unions can be added later).
|
|
*/
|
|
static struct tag *function__filter(struct tag *tag, struct cu *cu, void *cookie)
|
|
{
|
|
struct function *function;
|
|
|
|
if (tag->tag != DW_TAG_subprogram)
|
|
return NULL;
|
|
|
|
function = tag__function(tag);
|
|
if (function__inlined(function) ||
|
|
function->abstract_origin != 0 ||
|
|
!list_empty(&function->tool_node) ||
|
|
!ftype__has_parm_of_type(&function->proto, cookie, cu))
|
|
return NULL;
|
|
|
|
return tag;
|
|
}
|
|
|
|
/*
|
|
* Add the function to the list of methods since it matches function__filter
|
|
* criteria.
|
|
*/
|
|
static int find_methods_iterator(struct tag *tag, struct cu *cu,
|
|
void *cookie __unused)
|
|
{
|
|
struct function *function = tag__function(tag);
|
|
method__add(cu, function);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Iterate thru all the tags in the compilation unit, looking just for the
|
|
* DW_TAG_subprogram tags that have as one of its parameters a pointer to
|
|
* the specified "class" (struct).
|
|
*/
|
|
static int cu_find_methods_iterator(struct cu *cu, void *cookie)
|
|
{
|
|
struct tag *target = cu__find_struct_by_name(cu, cookie, 0);
|
|
|
|
INIT_LIST_HEAD(&cu->tool_list);
|
|
|
|
if (target == NULL)
|
|
return 0;
|
|
|
|
return cu__for_each_tag(cu, find_methods_iterator, target, function__filter);
|
|
}
|
|
|
|
static struct class_member *class_member__bitfield_tail(struct class_member *head,
|
|
struct class *class)
|
|
{
|
|
struct class_member *tail = head,
|
|
*member = list_prepare_entry(head,
|
|
class__tags(class),
|
|
tag.node);
|
|
list_for_each_entry_continue(member, class__tags(class), tag.node)
|
|
if (member->offset == head->offset)
|
|
tail = member;
|
|
else
|
|
break;
|
|
|
|
return tail;
|
|
}
|
|
|
|
/*
|
|
* Bitfields are removed as one for simplification right now.
|
|
*/
|
|
static struct class_member *class__remove_member(struct class *self, const struct cu *cu,
|
|
struct class_member *member)
|
|
{
|
|
size_t size = class_member__size(member, cu);
|
|
struct class_member *bitfield_tail = NULL;
|
|
struct list_head *next;
|
|
uint16_t member_hole = member->hole;
|
|
|
|
if (member->bit_size != 0) {
|
|
bitfield_tail = class_member__bitfield_tail(member, self);
|
|
member_hole = bitfield_tail->hole;
|
|
}
|
|
/*
|
|
* Is this the first member?
|
|
*/
|
|
if (member->tag.node.prev == class__tags(self)) {
|
|
self->type.size -= size + member_hole;
|
|
class__subtract_offsets_from(self, cu, bitfield_tail ?: member,
|
|
size + member_hole);
|
|
/*
|
|
* Is this the last member?
|
|
*/
|
|
} else if (member->tag.node.next == class__tags(self)) {
|
|
if (size + self->padding >= cu->addr_size) {
|
|
self->type.size -= size + self->padding;
|
|
self->padding = 0;
|
|
} else
|
|
self->padding += size;
|
|
} else {
|
|
if (size + member_hole >= cu->addr_size) {
|
|
self->type.size -= size + member_hole;
|
|
class__subtract_offsets_from(self, cu,
|
|
bitfield_tail ?: member,
|
|
size + member_hole);
|
|
} else {
|
|
struct class_member *from_prev =
|
|
list_entry(member->tag.node.prev,
|
|
struct class_member,
|
|
tag.node);
|
|
if (from_prev->hole == 0)
|
|
self->nr_holes++;
|
|
from_prev->hole += size + member_hole;
|
|
}
|
|
}
|
|
if (member_hole != 0)
|
|
self->nr_holes--;
|
|
|
|
if (bitfield_tail != NULL) {
|
|
next = bitfield_tail->tag.node.next;
|
|
list_del_range(&member->tag.node, &bitfield_tail->tag.node);
|
|
if (bitfield_tail->bit_hole != 0)
|
|
self->nr_bit_holes--;
|
|
} else {
|
|
next = member->tag.node.next;
|
|
list_del(&member->tag.node);
|
|
}
|
|
|
|
return list_entry(next, struct class_member, tag.node);
|
|
}
|
|
|
|
static size_t class__find_biggest_member_name(const struct class *self)
|
|
{
|
|
struct class_member *pos;
|
|
size_t biggest_name_len = 0;
|
|
|
|
type__for_each_data_member(&self->type, pos) {
|
|
const size_t len = pos->name ? strlen(pos->name) : 0;
|
|
|
|
if (len > biggest_name_len)
|
|
biggest_name_len = len;
|
|
}
|
|
|
|
return biggest_name_len;
|
|
}
|
|
|
|
static void class__emit_class_state_collector(struct class *self,
|
|
struct class *clone,
|
|
const struct cu *cu)
|
|
{
|
|
struct class_member *pos;
|
|
int len = class__find_biggest_member_name(clone);
|
|
|
|
fprintf(fp_collector,
|
|
"void ctracer__class_state(const void *from, void *to)\n"
|
|
"{\n"
|
|
"\tconst struct %s *obj = from;\n"
|
|
"\tstruct %s *mini_obj = to;\n\n",
|
|
class__name(self, cu), class__name(clone, cu));
|
|
type__for_each_data_member(&clone->type, pos)
|
|
fprintf(fp_collector, "\tmini_obj->%-*s = obj->%s;\n",
|
|
len, pos->name, pos->name);
|
|
fputs("}\n\n", fp_collector);
|
|
}
|
|
|
|
static int tag__is_base_type(const struct tag *self, const struct cu *cu)
|
|
{
|
|
switch (self->tag) {
|
|
case DW_TAG_base_type:
|
|
return 1;
|
|
|
|
case DW_TAG_typedef: {
|
|
const struct tag *type = cu__find_tag_by_id(cu, self->type);
|
|
|
|
if (type == NULL)
|
|
return 0;
|
|
return tag__is_base_type(type, cu);
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static struct class *class__clone_base_types(const struct tag *tag_self,
|
|
const struct cu *cu,
|
|
const char *new_class_name)
|
|
{
|
|
struct class *self = tag__class(tag_self);
|
|
struct class_member *pos, *next;
|
|
struct class *clone = class__clone(self, new_class_name);
|
|
|
|
if (clone == NULL)
|
|
return NULL;
|
|
|
|
class__find_holes(clone, cu);
|
|
|
|
type__for_each_data_member_safe(&clone->type, pos, next) {
|
|
struct tag *member_type = cu__find_tag_by_id(cu, pos->tag.type);
|
|
|
|
tag__assert_search_result(member_type);
|
|
if (!tag__is_base_type(member_type, cu)) {
|
|
next = class__remove_member(clone, cu, pos);
|
|
class_member__delete(pos);
|
|
}
|
|
}
|
|
class__find_holes(clone, cu);
|
|
class__fixup_alignment(clone, cu);
|
|
class__reorganize(clone, cu, 0, NULL);
|
|
return clone;
|
|
}
|
|
|
|
/**
|
|
* Converter to the legacy ostra tables, will be much improved in the future.
|
|
*/
|
|
static void emit_struct_member_table_entry(FILE *fp,
|
|
int field, const char *name,
|
|
int traced, const char *hooks)
|
|
{
|
|
fprintf(fp, "%u:%s:", field, name);
|
|
if (traced)
|
|
fprintf(fp, "yes:%%object->%s:u:%s:none\n", name, hooks);
|
|
else
|
|
fprintf(fp, "no:None:None:%s:dev_null\n", hooks);
|
|
}
|
|
|
|
/**
|
|
* Generates a converter to the ostra lebacy tables format, needef by
|
|
* ostra-cg to preprocess the raw data collected from the debugfs/relay
|
|
* channel.
|
|
*/
|
|
static int class__emit_ostra_converter(struct tag *tag_self,
|
|
struct cu *cu)
|
|
{
|
|
struct class *self = tag__class(tag_self);
|
|
struct class_member *pos;
|
|
struct type *type = &mini_class->type;
|
|
int field = 0, first = 1;
|
|
char filename[128];
|
|
char parm_list[1024];
|
|
char *p = parm_list;
|
|
size_t n;
|
|
size_t plen = sizeof(parm_list);
|
|
FILE *fp_fields, *fp_converter;
|
|
const char *name = class__name(self, cu);
|
|
|
|
snprintf(filename, sizeof(filename), "%s/%s.fields", src_dir, name);
|
|
fp_fields = fopen(filename, "w");
|
|
if (fp_fields == NULL) {
|
|
fprintf(stderr, "ctracer: couldn't create %s\n", filename);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
snprintf(filename, sizeof(filename), "%s/ctracer2ostra.c", src_dir);
|
|
|
|
fp_converter = fopen(filename, "w");
|
|
if (fp_converter == NULL) {
|
|
fprintf(stderr, "ctracer: couldn't create %s\n", filename);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
fputs("#include \"ctracer_classes.h\"\n"
|
|
"#include <stdio.h>\n"
|
|
"#include <string.h>\n"
|
|
"#include \"ctracer_relay.h\"\n\n", fp_converter);
|
|
emit_struct_member_table_entry(fp_fields, field++, "action", 0,
|
|
"entry,exit");
|
|
emit_struct_member_table_entry(fp_fields, field++, "function_id", 0,
|
|
"entry,exit");
|
|
emit_struct_member_table_entry(fp_fields, field++, "object", 1,
|
|
"entry,exit");
|
|
|
|
fprintf(fp_converter, "\n"
|
|
"int main(void)\n"
|
|
"{\n"
|
|
"\twhile (1) {\n"
|
|
"\t\tstruct trace_entry hdr;\n"
|
|
"\t\tstruct ctracer__mini_%s obj;\n"
|
|
"\n"
|
|
"\t\tif (read(0, &hdr, sizeof(hdr)) != sizeof(hdr))\n"
|
|
"\t\t\tbreak;\n"
|
|
"\n"
|
|
"\t\tfprintf(stdout, \"%%llu %%c:%%llu:%%p\",\n"
|
|
"\t\t\thdr.nsec,\n"
|
|
"\t\t\thdr.probe_type ? 'o' : 'i',\n"
|
|
"\t\t\thdr.function_id,\n"
|
|
"\t\t\thdr.object);\n"
|
|
"\n"
|
|
"\t\tif (read(0, &obj, sizeof(obj)) != sizeof(obj))\n"
|
|
"\t\t\tbreak;\n"
|
|
"\t\tfprintf(stdout,\n"
|
|
"\t\t\t\":", name);
|
|
|
|
type__for_each_data_member(type, pos) {
|
|
if (first)
|
|
first = 0;
|
|
else {
|
|
fputc(':', fp_converter);
|
|
n = snprintf(p, plen, ",\n\t\t\t ");
|
|
plen -= n; p += n;
|
|
}
|
|
fprintf(fp_converter, "%%u");
|
|
n = snprintf(p, plen, "obj.%s", pos->name);
|
|
plen -= n; p += n;
|
|
emit_struct_member_table_entry(fp_fields, field++,
|
|
pos->name, 1, "entry,exit");
|
|
}
|
|
fprintf(fp_converter,
|
|
"\\n\",\n\t\t\t %s);\n"
|
|
"\t}\n"
|
|
"\treturn 0;\n"
|
|
"}\n", parm_list);
|
|
fclose(fp_fields);
|
|
fclose(fp_converter);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* We want just the DW_TAG_structure_type tags that have a member that is a pointer
|
|
* to the target class.
|
|
*/
|
|
static struct tag *pointer_filter(struct tag *tag, struct cu *cu, void *target_tag)
|
|
{
|
|
struct type *type, *target_type;
|
|
struct class_member *pos;
|
|
const char *class_name;
|
|
|
|
if (!tag__is_struct(tag))
|
|
return NULL;
|
|
|
|
type = tag__type(tag);
|
|
if (type->nr_members == 0)
|
|
return NULL;
|
|
|
|
class_name = class__name(tag__class(tag), cu);
|
|
if (class_name == NULL || structures__find(&pointers, class_name))
|
|
return NULL;
|
|
|
|
target_type = tag__type(target_tag);
|
|
type__for_each_member(type, pos) {
|
|
struct tag *ctype = cu__find_tag_by_id(cu, pos->tag.type);
|
|
|
|
tag__assert_search_result(ctype);
|
|
if (ctype->tag == DW_TAG_pointer_type && ctype->type == target_type->namespace.tag.id)
|
|
return tag;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* Add the struct to the list of pointers since it matches pointer_filter
|
|
* criteria.
|
|
*/
|
|
static int find_pointers_iterator(struct tag *tag, struct cu *cu,
|
|
void *cookie __unused)
|
|
{
|
|
structures__add(&pointers, tag, cu);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Iterate thru all the tags in the compilation unit, looking for classes
|
|
* that have as one member that is a pointer to the target type.
|
|
*/
|
|
static int cu_find_pointers_iterator(struct cu *cu, void *class_name)
|
|
{
|
|
struct tag *target = cu__find_struct_by_name(cu, class_name, 0);
|
|
|
|
if (target == NULL)
|
|
return 0;
|
|
|
|
return cu__for_each_tag(cu, find_pointers_iterator, target, pointer_filter);
|
|
}
|
|
|
|
static void class__find_pointers(const char *class_name)
|
|
{
|
|
cus__for_each_cu(methods_cus, cu_find_pointers_iterator, (void *)class_name, cu_filter);
|
|
}
|
|
|
|
/*
|
|
* We want just the DW_TAG_structure_type tags that have as its first member
|
|
* a struct of type target.
|
|
*/
|
|
static struct tag *alias_filter(struct tag *tag, struct cu *cu, void *target_tag)
|
|
{
|
|
struct type *type, *target_type;
|
|
struct class_member *first_member;
|
|
|
|
if (!tag__is_struct(tag))
|
|
return NULL;
|
|
|
|
type = tag__type(tag);
|
|
if (type->nr_members == 0)
|
|
return NULL;
|
|
|
|
first_member = list_first_entry(&type->namespace.tags,
|
|
struct class_member, tag.node);
|
|
target_type = tag__type(target_tag);
|
|
if (first_member->tag.type != target_type->namespace.tag.id)
|
|
return NULL;
|
|
|
|
if (structures__find(&aliases, class__name(tag__class(tag), cu)))
|
|
return NULL;
|
|
|
|
return tag;
|
|
}
|
|
|
|
static void class__find_aliases(const char *class_name);
|
|
|
|
/*
|
|
* Add the struct to the list of aliases since it matches alias_filter
|
|
* criteria.
|
|
*/
|
|
static int find_aliases_iterator(struct tag *tag, struct cu *cu,
|
|
void *cookie __unused)
|
|
{
|
|
const char *alias_name = class__name(tag__class(tag), cu);
|
|
|
|
structures__add(&aliases, tag, cu);
|
|
|
|
/*
|
|
* Now find aliases to this alias, e.g.:
|
|
*
|
|
* struct tcp_sock {
|
|
* struct inet_connection_sock {
|
|
* struct inet_sock {
|
|
* struct sock {
|
|
* }
|
|
* }
|
|
* }
|
|
* }
|
|
*/
|
|
class__find_aliases(alias_name);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Iterate thru all the tags in the compilation unit, looking for classes
|
|
* that have as its first member the specified "class" (struct).
|
|
*/
|
|
static int cu_find_aliases_iterator(struct cu *cu, void *class_name)
|
|
{
|
|
struct tag *target = cu__find_struct_by_name(cu, class_name, 0);
|
|
|
|
if (target == NULL)
|
|
return 0;
|
|
|
|
return cu__for_each_tag(cu, find_aliases_iterator, target, alias_filter);
|
|
}
|
|
|
|
static void class__find_aliases(const char *class_name)
|
|
{
|
|
cus__for_each_cu(methods_cus, cu_find_aliases_iterator, (void *)class_name, cu_filter);
|
|
}
|
|
|
|
static void emit_list_of_types(struct list_head *list)
|
|
{
|
|
struct structure *pos;
|
|
|
|
list_for_each_entry(pos, list, node) {
|
|
struct type *type = tag__type(pos->class);
|
|
/*
|
|
* Lets look at the other CUs, perhaps we have already
|
|
* emmited this one
|
|
*/
|
|
if (type_emissions__find_definition(&cus__emissions,
|
|
class__name(tag__class(pos->class),
|
|
pos->cu))) {
|
|
type->definition_emitted = 1;
|
|
continue;
|
|
}
|
|
type__emit_definitions(pos->class, pos->cu, &cus__emissions,
|
|
fp_classes);
|
|
type->definition_emitted = 1;
|
|
type__emit(pos->class, pos->cu, NULL, NULL, fp_classes);
|
|
tag__type(pos->class)->definition_emitted = 1;
|
|
fputc('\n', fp_classes);
|
|
}
|
|
}
|
|
|
|
static int class__emit_classes(struct tag *tag_self, struct cu *cu)
|
|
{
|
|
struct class *self = tag__class(tag_self);
|
|
int err = -1;
|
|
char mini_class_name[128];
|
|
|
|
snprintf(mini_class_name, sizeof(mini_class_name), "ctracer__mini_%s",
|
|
class__name(self, cu));
|
|
|
|
mini_class = class__clone_base_types(tag_self, cu, mini_class_name);
|
|
if (mini_class == NULL)
|
|
goto out;
|
|
|
|
type__emit_definitions(tag_self, cu, &cus__emissions, fp_classes);
|
|
|
|
type__emit(tag_self, cu, NULL, NULL, fp_classes);
|
|
fputs("\n/* class aliases */\n\n", fp_classes);
|
|
|
|
emit_list_of_types(&aliases);
|
|
|
|
fputs("\n/* class with pointers */\n\n", fp_classes);
|
|
|
|
emit_list_of_types(&pointers);
|
|
|
|
class__fprintf(mini_class, cu, NULL, fp_classes);
|
|
fputs(";\n\n", fp_classes);
|
|
class__emit_class_state_collector(self, mini_class, cu);
|
|
err = 0;
|
|
out:
|
|
return err;
|
|
}
|
|
|
|
/*
|
|
* Emit the kprobes routine for one of the selected "methods", later we'll
|
|
* put this into the 'kprobes' table, in cu_emit_kprobes_table_iterator.
|
|
*
|
|
* This marks the function entry, function__emit_kretprobes will emit the
|
|
* probe for the function exit.
|
|
*/
|
|
static int function__emit_probes(struct function *self, const struct cu *cu,
|
|
const struct tag *target, int probe_type,
|
|
const char *member)
|
|
{
|
|
struct parameter *pos;
|
|
const char *name = function__name(self, cu);
|
|
|
|
fprintf(fp_methods, "probe %s%s = kernel.function(\"%s@%s\")%s\n"
|
|
"{\n"
|
|
"}\n\n"
|
|
"probe %s%s\n"
|
|
"{\n", name,
|
|
probe_type == 0 ? "" : "__return",
|
|
name,
|
|
cu->name,
|
|
probe_type == 0 ? "" : ".return",
|
|
name,
|
|
probe_type == 0 ? "" : "__return");
|
|
|
|
list_for_each_entry(pos, &self->proto.parms, tag.node) {
|
|
struct tag *type = cu__find_tag_by_id(cu, pos->tag.type);
|
|
|
|
tag__assert_search_result(type);
|
|
if (type->tag != DW_TAG_pointer_type)
|
|
continue;
|
|
|
|
type = cu__find_tag_by_id(cu, type->type);
|
|
if (type == NULL || type->id != target->id)
|
|
continue;
|
|
|
|
if (member != NULL)
|
|
fprintf(fp_methods, "\tif ($%s)\n\t", pos->name);
|
|
|
|
fprintf(fp_methods,
|
|
"\tctracer__method_hook(%d, %#llx, $%s%s%s, %zd);\n",
|
|
probe_type,
|
|
(unsigned long long)self->proto.tag.id, pos->name,
|
|
member ? "->" : "", member ?: "",
|
|
class__size(mini_class));
|
|
break;
|
|
}
|
|
|
|
fputs("}\n\n", fp_methods);
|
|
fflush(fp_methods);
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Iterate thru the list of methods previously collected by
|
|
* cu_find_methods_iterator, emitting the probes for function entry.
|
|
*/
|
|
static int cu_emit_probes_iterator(struct cu *cu, void *cookie)
|
|
{
|
|
struct tag *target = cu__find_struct_by_name(cu, cookie, 0);
|
|
struct function *pos;
|
|
|
|
tag__assert_search_result(target);
|
|
list_for_each_entry(pos, &cu->tool_list, tool_node) {
|
|
if (methods__add(&probes_emitted, function__name(pos, cu)) != 0)
|
|
continue;
|
|
pos->priv = (void *)1; /* Mark as visited, for the table iterator */
|
|
function__emit_probes(pos, cu, target, 0, NULL); /* entry */
|
|
function__emit_probes(pos, cu, target, 1, NULL); /* exit */
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Iterate thru the list of methods previously collected by
|
|
* cu_find_methods_iterator, emitting the probes for function entry.
|
|
*/
|
|
static int cu_emit_pointer_probes_iterator(struct cu *cu, void *cookie)
|
|
{
|
|
struct tag *target, *pointer;
|
|
struct function *pos_tag;
|
|
struct class_member *pos_member;
|
|
|
|
/* This CU doesn't have our classes */
|
|
if (list_empty(&cu->tool_list))
|
|
return 0;
|
|
|
|
target = cu__find_struct_by_name(cu, class_name, 1);
|
|
pointer = cu__find_struct_by_name(cu, cookie, 0);
|
|
tag__assert_search_result(target);
|
|
tag__assert_search_result(pointer);
|
|
|
|
/* for now just for the first member that is a pointer */
|
|
type__for_each_member(tag__type(pointer), pos_member) {
|
|
struct tag *ctype = cu__find_tag_by_id(cu, pos_member->tag.type);
|
|
|
|
tag__assert_search_result(ctype);
|
|
if (ctype->tag == DW_TAG_pointer_type && ctype->type == target->id)
|
|
break;
|
|
}
|
|
|
|
list_for_each_entry(pos_tag, &cu->tool_list, tool_node) {
|
|
if (methods__add(&probes_emitted, function__name(pos_tag, cu)) != 0)
|
|
continue;
|
|
pos_tag->priv = (void *)1; /* Mark as visited, for the table iterator */
|
|
|
|
function__emit_probes(pos_tag, cu, pointer, 0, pos_member->name); /* entry */
|
|
function__emit_probes(pos_tag, cu, pointer, 1, pos_member->name); /* exit */
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Iterate thru the list of methods previously collected by
|
|
* cu_find_methods_iterator, creating the functions table that will
|
|
* be used by ostra-cg
|
|
*/
|
|
static int cu_emit_functions_table(struct cu *cu, void *fp)
|
|
{
|
|
struct function *pos;
|
|
|
|
list_for_each_entry(pos, &cu->tool_list, tool_node)
|
|
if (pos->priv != NULL) {
|
|
fprintf(fp, "%llu:%s\n",
|
|
(unsigned long long)pos->proto.tag.id,
|
|
function__name(pos, cu));
|
|
pos->priv = NULL;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static const struct argp_option ctracer__options[] = {
|
|
{
|
|
.key = 'd',
|
|
.name = "src_dir",
|
|
.arg = "SRC_DIR",
|
|
.doc = "generate source files in this directory",
|
|
},
|
|
{
|
|
.key = 'C',
|
|
.name = "cu_blacklist",
|
|
.arg = "FILE",
|
|
.doc = "Blacklist the CUs in FILE",
|
|
},
|
|
{
|
|
.key = 'D',
|
|
.name = "dir",
|
|
.arg = "DIR",
|
|
.doc = "load files in this directory",
|
|
},
|
|
{
|
|
.key = 'g',
|
|
.name = "glob",
|
|
.arg = "GLOB",
|
|
.doc = "file mask to load",
|
|
},
|
|
{
|
|
.key = 'r',
|
|
.name = "recursive",
|
|
.doc = "recursively load files",
|
|
},
|
|
{
|
|
.name = NULL,
|
|
}
|
|
};
|
|
|
|
static const char *dirname, *glob;
|
|
static int recursive;
|
|
|
|
static error_t ctracer__options_parser(int key, char *arg,
|
|
struct argp_state *state __unused)
|
|
{
|
|
switch (key) {
|
|
case 'd': src_dir = arg; break;
|
|
case 'C': cu_blacklist_filename = arg; break;
|
|
case 'D': dirname = arg; break;
|
|
case 'g': glob = arg; break;
|
|
case 'r': recursive = 1; break;
|
|
default: return ARGP_ERR_UNKNOWN;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static const char ctracer__args_doc[] = "FILE CLASS";
|
|
|
|
static struct argp ctracer__argp = {
|
|
.options = ctracer__options,
|
|
.parser = ctracer__options_parser,
|
|
.args_doc = ctracer__args_doc,
|
|
};
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
int remaining, err;
|
|
struct tag *class;
|
|
struct cu *cu;
|
|
const char *filename;
|
|
char functions_filename[PATH_MAX];
|
|
char methods_filename[PATH_MAX];
|
|
char collector_filename[PATH_MAX];
|
|
char classes_filename[PATH_MAX];
|
|
struct structure *pos;
|
|
FILE *fp_functions;
|
|
|
|
argp_parse(&ctracer__argp, argc, argv, 0, &remaining, NULL);
|
|
|
|
if (remaining < argc) {
|
|
switch (argc - remaining) {
|
|
case 1: goto failure;
|
|
case 2: filename = argv[remaining++];
|
|
class_name = argv[remaining++]; break;
|
|
default: goto failure;
|
|
}
|
|
} else {
|
|
failure:
|
|
argp_help(&ctracer__argp, stderr, ARGP_HELP_SEE, "ctracer");
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
/*
|
|
* Initialize libdwarves, for now just to get the machine L1 cacheline
|
|
* size, in the future may do more stuff.
|
|
*/
|
|
dwarves__init(0);
|
|
|
|
type_emissions__init(&cus__emissions);
|
|
|
|
/*
|
|
* Create the methods_cus (Compilation Units) object where we will
|
|
* load the objects where we'll look for functions pointers to the
|
|
* specified class, i.e. to find its "methods", where we'll insert
|
|
* the entry and exit hooks.
|
|
*/
|
|
methods_cus = cus__new(&cus__emissions);
|
|
if (methods_cus == NULL) {
|
|
fputs("ctracer: insufficient memory\n", stderr);
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
/*
|
|
* if --dir/-D was specified, recursively traverse the path looking for
|
|
* object files (compilation units) that match the glob specified (*.ko)
|
|
* for kernel modules, but could be "*.o" in the future when we support
|
|
* uprobes for user space tracing.
|
|
*/
|
|
if (dirname != NULL && cus__load_dir(methods_cus, dirname, glob,
|
|
recursive) != 0) {
|
|
fprintf(stderr, "ctracer: couldn't load DWARF info "
|
|
"from %s dir with glob %s\n",
|
|
dirname, glob);
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
/*
|
|
* If a filename was specified, for instance "vmlinux", load it too.
|
|
*/
|
|
if (filename != NULL) {
|
|
err = cus__load(methods_cus, filename);
|
|
if (err != 0) {
|
|
cus__print_error_msg("ctracer", methods_cus, filename, err);
|
|
return EXIT_FAILURE;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* See if the specified struct exists:
|
|
*/
|
|
class = cus__find_struct_by_name(methods_cus, &cu, class_name, 0);
|
|
if (class == NULL) {
|
|
fprintf(stderr, "ctracer: struct %s not found!\n", class_name);
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
snprintf(functions_filename, sizeof(functions_filename),
|
|
"%s/%s.functions", src_dir,
|
|
class__name(tag__class(class), cu));
|
|
fp_functions = fopen(functions_filename, "w");
|
|
if (fp_functions == NULL) {
|
|
fprintf(stderr, "ctracer: couldn't create %s\n",
|
|
functions_filename);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
snprintf(methods_filename, sizeof(methods_filename),
|
|
"%s/ctracer_methods.stp", src_dir);
|
|
fp_methods = fopen(methods_filename, "w");
|
|
if (fp_methods == NULL) {
|
|
fprintf(stderr, "ctracer: couldn't create %s\n",
|
|
methods_filename);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
snprintf(collector_filename, sizeof(collector_filename),
|
|
"%s/ctracer_collector.c", src_dir);
|
|
fp_collector = fopen(collector_filename, "w");
|
|
if (fp_collector == NULL) {
|
|
fprintf(stderr, "ctracer: couldn't create %s\n",
|
|
collector_filename);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
snprintf(classes_filename, sizeof(classes_filename),
|
|
"%s/ctracer_classes.h", src_dir);
|
|
fp_classes = fopen(classes_filename, "w");
|
|
if (fp_classes == NULL) {
|
|
fprintf(stderr, "ctracer: couldn't create %s\n",
|
|
classes_filename);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
fputs("%{\n"
|
|
"#include </home/acme/git/pahole/lib/ctracer_relay.h>\n"
|
|
"%}\n"
|
|
"function ctracer__method_hook(probe_type, func, object, state_len)\n"
|
|
"%{\n"
|
|
"\tctracer__method_hook(_stp_gettimeofday_ns(), "
|
|
"THIS->probe_type, THIS->func, "
|
|
"(void *)(long)THIS->object, "
|
|
"THIS->state_len);\n"
|
|
"%}\n\n", fp_methods);
|
|
|
|
fputs("\n#include \"ctracer_classes.h\"\n\n", fp_collector);
|
|
class__find_aliases(class_name);
|
|
class__find_pointers(class_name);
|
|
|
|
class__emit_classes(class, cu);
|
|
fputc('\n', fp_collector);
|
|
|
|
class__emit_ostra_converter(class, cu);
|
|
|
|
cu_blacklist = strlist__new(true);
|
|
if (cu_blacklist != NULL)
|
|
strlist__load(cu_blacklist, cu_blacklist_filename);
|
|
|
|
cus__for_each_cu(methods_cus, cu_find_methods_iterator,
|
|
class_name, cu_filter);
|
|
cus__for_each_cu(methods_cus, cu_emit_probes_iterator,
|
|
class_name, cu_filter);
|
|
cus__for_each_cu(methods_cus, cu_emit_functions_table,
|
|
fp_functions, cu_filter);
|
|
|
|
list_for_each_entry(pos, &aliases, node) {
|
|
const char *alias_name = class__name(tag__class(pos->class), pos->cu);
|
|
|
|
cus__for_each_cu(methods_cus, cu_find_methods_iterator,
|
|
(void *)alias_name, cu_filter);
|
|
cus__for_each_cu(methods_cus, cu_emit_probes_iterator,
|
|
(void *)alias_name, cu_filter);
|
|
cus__for_each_cu(methods_cus, cu_emit_functions_table,
|
|
fp_functions, cu_filter);
|
|
}
|
|
|
|
list_for_each_entry(pos, &pointers, node) {
|
|
const char *pointer_name = class__name(tag__class(pos->class), pos->cu);
|
|
cus__for_each_cu(methods_cus, cu_find_methods_iterator,
|
|
(void *)pointer_name, cu_filter);
|
|
cus__for_each_cu(methods_cus, cu_emit_pointer_probes_iterator,
|
|
(void *)pointer_name, cu_filter);
|
|
cus__for_each_cu(methods_cus, cu_emit_functions_table, fp_functions,
|
|
cu_filter);
|
|
}
|
|
|
|
fclose(fp_methods);
|
|
fclose(fp_collector);
|
|
fclose(fp_functions);
|
|
fclose(fp_classes);
|
|
strlist__delete(cu_blacklist);
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|