dwarves/pahole.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 <getopt.h>
#include <stdio.h>
#include <dwarf.h>
#include <stdlib.h>
#include <string.h>

#include "classes.h"

static char *class__exclude_prefix;
static size_t class__exclude_prefix_len;

static char *cu__exclude_prefix;
static size_t cu__exclude_prefix_len;

static char *decl_exclude_prefix;
static size_t decl_exclude_prefix_len;

static unsigned short nr_holes;
static unsigned short nr_bit_holes;

static enum {
	FLAG_show_sizes			= (1 << 0),
	FLAG_show_nr_members		= (1 << 1),
	FLAG_show_class_name_len	= (1 << 2),
	FLAG_show_total_structure_stats = (1 << 3),
	FLAG_show_packable		= (1 << 4),
} opts;

struct structure {
	struct list_head   node;
	const struct class *class;
	unsigned int	   nr_files;
};

static struct structure *structure__new(const struct class *class)
{
	struct structure *self = malloc(sizeof(*self));

	if (self != NULL) {
		self->class = class;
		self->nr_files = 1;
	}

	return self;
}

static LIST_HEAD(structures__list);

static struct structure *structures__find(const char *name)
{
	struct structure *pos;

	list_for_each_entry(pos, &structures__list, node)
		if (strcmp(pos->class->name, name) == 0)
			return pos;
	return NULL;
}

static void structures__add(const struct class *class)
{
	struct structure *str = structures__find(class->name);

	if (str == NULL) {
		str = structure__new(class);
		if (str != NULL)
			list_add(&str->node, &structures__list);
	} else {
		if (str->class->size != class->size)
			printf("%s size changed! was %llu, now its %llu\n",
			       class->name, str->class->size, class->size);
		str->nr_files++;
	}
}

static void structure__print(struct structure *self)
{
	printf("%-32.32s %5u\n", self->class->name, self->nr_files);
}

static void print_total_structure_stats(void)
{
	struct structure *pos;

	printf("%-32.32s %5.5s\n", "name", "src#");
	list_for_each_entry(pos, &structures__list, node)
		structure__print(pos);
}

static struct cu *cu__filter(struct cu *cu)
{
	if (cu__exclude_prefix != NULL &&
	    (cu->name == NULL ||
	     strncmp(cu__exclude_prefix, cu->name,
		     cu__exclude_prefix_len) == 0))
		return NULL;

	return cu;
}

static int class__packable(const struct class *self)
{
	struct class_member *pos;

	if (self->nr_holes == 0 && self->nr_bit_holes == 0)
		return 0;

	list_for_each_entry(pos, &self->members, tag.node)
		if (pos->hole != 0 &&
		    class__find_bit_hole(self, pos, pos->hole * 8) != NULL)
			return 1;
		else if (pos->bit_hole != 0 &&
			 class__find_bit_hole(self, pos, pos->bit_hole) != NULL)
			return 1;

	return 0;
}

static struct class *class__to_struct(struct class *class)
{
	struct class *typedef_alias;

	if (!class__is_struct(class, &typedef_alias))
		return NULL;
	return typedef_alias ?: class;
}

static struct class *class__filter(struct class *class)
{
	class = class__to_struct(class);
	if (class == NULL) /* Not a structure */
		return NULL;

	if (class->name == NULL)
		return NULL;

	if (class__exclude_prefix != NULL &&
	    strncmp(class__exclude_prefix, class->name,
		    class__exclude_prefix_len) == 0)
		return NULL;

	if (decl_exclude_prefix != NULL &&
	    (class->tag.decl_file == NULL ||
	     strncmp(decl_exclude_prefix, class->tag.decl_file,
		     decl_exclude_prefix_len) == 0))
		return NULL;

	class__find_holes(class);

	if ((opts & FLAG_show_packable) && !class__packable(class))
		return NULL;

	return class;
}

static int total_structure_iterator(struct class *class, void *cookie)
{
	structures__add(class);
	return 0;
}

static int cu_total_structure_iterator(struct cu *cu, void *cookie)
{
	return cu__for_each_class(cu, total_structure_iterator, cookie,
				  class__filter);
}

static struct option long_options[] = {
	{ "cacheline_size",	required_argument,	NULL, 'c' },
	{ "class_name_len",	no_argument,		NULL, 'N' },
	{ "help",		no_argument,		NULL, 'h' },
	{ "bit_holes",		required_argument,	NULL, 'B' },
	{ "holes",		required_argument,	NULL, 'H' },
	{ "nr_members",		no_argument,		NULL, 'n' },
	{ "sizes",		no_argument,		NULL, 's' },
	{ "total_struct_stats",	no_argument,		NULL, 't' },
	{ "exclude",		required_argument,	NULL, 'x' },
	{ "cu_exclude",		required_argument,	NULL, 'X' },
	{ "decl_exclude",	required_argument,	NULL, 'D' },
	{ "packable",		no_argument,		NULL, 'p' },
	{ NULL, 0, NULL, 0, }
};

static void usage(void)
{
	fprintf(stderr,
		"usage: pfunct [options] <file_name> {<function_name>}\n"
		" where: \n"
		"   -h, --help                   show usage info\n"
		"   -B, --bit_holes <nr_holes>   show only structs at least <nr_holes> bit holes\n"
		"   -H, --holes <nr_holes>       show only structs at least <nr_holes> holes\n"
		"   -p, --packable		 show only structs that has holes that can be packed\n"
		"   -c, --cacheline_size <size>  set cacheline size (default=%d)\n"
		"   -n, --nr_members             show number of members\n"
		"   -N, --class_name_len         show size of classes\n"
		"   -s, --sizes                  show size of classes\n"
		"   -t, --total_struct_stats     show Multi-CU structure stats\n"
		"   -D, --decl_exclude <prefix>  exclude classes declared in files with prefix\n"
		"   -x, --exclude <prefix>       exclude prefixed classes from reports\n"
		"   -X, --cu_exclude <prefix>    exclude prefixed compilation units from reports\n",
		DEFAULT_CACHELINE_SIZE);
}

static int nr_members_iterator(struct class *class, void *cookie)
{
	if (class->nr_members > 0)
		printf("%s: %u\n", class->name, class->nr_members);
	return 0;
}

static int cu_nr_members_iterator(struct cu *cu, void *cookie)
{
	return cu__for_each_class(cu, nr_members_iterator, cookie,
				  class__filter);
}

static int sizes_iterator(struct class *class, void *cookie)
{
	if (class->size > 0)
		printf("%s: %llu %u\n",
		       class->name, class->size, class->nr_holes);
	return 0;
}

static int cu_sizes_iterator(struct cu *cu, void *cookie)
{
	return cu__for_each_class(cu, sizes_iterator, cookie, class__filter);
}

static int holes_iterator(struct class *class, void *cookie)
{
	if ((nr_holes != 0 && class->nr_holes >= nr_holes) ||
	    (nr_bit_holes != 0 && class->nr_bit_holes >= nr_bit_holes))
		class__print(class);
	return 0;
}

static int cu_holes_iterator(struct cu *cu, void *cookie)
{
	return cu__for_each_class(cu, holes_iterator, cookie, class__filter);
}

static int class_name_len_iterator(struct class *class, void *cookie)
{
	printf("%s: %u\n", class->name, strlen(class->name));
	return 0;
}

static int cu_class_name_len_iterator(struct cu *cu, void *cookie)
{
	return cu__for_each_class(cu, class_name_len_iterator, NULL,
				  class__filter);
}

static int class__iterator(struct class *class, void *cookie)
{
	class__print(class);
	return 0;
}

static int cu__iterator(struct cu *cu, void *cookie)
{
	return cu__for_each_class(cu, class__iterator, NULL,
				  class__filter);
}

int main(int argc, char *argv[])
{
	int option, option_index;
	struct cus *cus;
	char *file_name;
	char *class_name = NULL;

	while ((option = getopt_long(argc, argv, "B:c:D:hH:nNpstx:X:",
				     long_options, &option_index)) >= 0)
		switch (option) {
		case 'c': cacheline_size = atoi(optarg);  break;
		case 'H': nr_holes = atoi(optarg);	  break;
		case 'B': nr_bit_holes = atoi(optarg);	  break;
		case 's': opts |= FLAG_show_sizes;	  break;
		case 'n': opts |= FLAG_show_nr_members;	  break;
		case 'N': opts |= FLAG_show_class_name_len;  break;
		case 'p': opts |= FLAG_show_packable;	  break;
		case 't': opts |= FLAG_show_total_structure_stats; break;
		case 'D': decl_exclude_prefix = optarg;
			  decl_exclude_prefix_len = strlen(decl_exclude_prefix);
							  break;
		case 'x': class__exclude_prefix = optarg;
			  class__exclude_prefix_len = strlen(class__exclude_prefix);
							  break;
		case 'X': cu__exclude_prefix = optarg;
			  cu__exclude_prefix_len = strlen(cu__exclude_prefix);
							  break;
		case 'h': usage();			  return EXIT_SUCCESS;
		default:  usage();			  return EXIT_FAILURE;
		}

	if (optind < argc) {
		switch (argc - optind) {
		case 1:	 file_name = argv[optind++];	break;
		case 2:	 file_name = argv[optind++];
			 class_name = argv[optind++];	break;
		default: usage();			return EXIT_FAILURE;
		}
	} else {
		usage();
		return EXIT_FAILURE;
	}

	cus = cus__new(file_name);
	if (cus == NULL) {
		fputs("pahole: insufficient memory\n", stderr);
		return EXIT_FAILURE;
	}

	if (cus__load(cus) != 0) {
		fprintf(stderr, "pahole: couldn't load DWARF info from %s\n",
		       file_name);
		return EXIT_FAILURE;
	}

	if (opts & FLAG_show_total_structure_stats) {
		cus__for_each_cu(cus, cu_total_structure_iterator, NULL,
				 cu__filter);
		print_total_structure_stats();
	} else if (opts & FLAG_show_nr_members)
		cus__for_each_cu(cus, cu_nr_members_iterator, NULL,
				 cu__filter);
	else if (opts & FLAG_show_sizes)
		cus__for_each_cu(cus, cu_sizes_iterator, NULL, cu__filter);
	else if (opts & FLAG_show_class_name_len)
		cus__for_each_cu(cus, cu_class_name_len_iterator, NULL,
				 cu__filter);
	else if (nr_holes > 0 || nr_bit_holes > 0)
		cus__for_each_cu(cus, cu_holes_iterator, NULL, cu__filter);
	else if (class_name != NULL) {
		struct class *class = cus__find_class_by_name(cus, class_name);
		struct class *alias;

		if (class != NULL && class__is_struct(class, &alias)) {
			class__find_holes(alias ?: class);
			class__print(alias ?: class);
		} else
			printf("struct %s not found!\n", class_name);
	} else
		cus__for_each_cu(cus, cu__iterator, NULL, cu__filter);

	return EXIT_SUCCESS;
}