282 lines · 6.0 KB · C
RawDownload
// SPDX-License-Identifier: LGPL-2.1/* * Copyright (C) 2009, 2010 Red Hat Inc, Steven Rostedt <srostedt@redhat.com> */#include <stdio.h>#include <stdlib.h>#include <string.h> #include "event-parse.h"#include "event-utils.h"#include "trace-seq.h" static struct func_stack {	int size;	char **stack;} *fstack; static int cpus = -1; #define STK_BLK 10 struct tep_plugin_option plugin_options[] ={	{		.name = "parent",		.plugin_alias = "ftrace",		.description =		"Print parent of functions for function events",	},	{		.name = "indent",		.plugin_alias = "ftrace",		.description =		"Try to show function call indents, based on parents",		.set = 1,	},	{		.name = "offset",		.plugin_alias = "ftrace",		.description =		"Show function names as well as their offsets",		.set = 0,	},	{		.name = NULL,	}}; static struct tep_plugin_option *ftrace_parent = &plugin_options[0];static struct tep_plugin_option *ftrace_indent = &plugin_options[1];static struct tep_plugin_option *ftrace_offset = &plugin_options[2]; static void add_child(struct func_stack *stack, const char *child, int pos){	int i; 	if (!child)		return; 	if (pos < stack->size)		free(stack->stack[pos]);	else {		char **ptr; 		ptr = realloc(stack->stack, sizeof(char *) *			      (stack->size + STK_BLK));		if (!ptr) {			warning("could not allocate plugin memory\n");			return;		} 		stack->stack = ptr; 		for (i = stack->size; i < stack->size + STK_BLK; i++)			stack->stack[i] = NULL;		stack->size += STK_BLK;	} 	stack->stack[pos] = strdup(child);} static int add_and_get_index(const char *parent, const char *child, int cpu){	int i; 	if (cpu < 0)		return 0; 	if (cpu > cpus) {		struct func_stack *ptr; 		ptr = realloc(fstack, sizeof(*fstack) * (cpu + 1));		if (!ptr) {			warning("could not allocate plugin memory\n");			return 0;		} 		fstack = ptr; 		/* Account for holes in the cpu count */		for (i = cpus + 1; i <= cpu; i++)			memset(&fstack[i], 0, sizeof(fstack[i]));		cpus = cpu;	} 	for (i = 0; i < fstack[cpu].size && fstack[cpu].stack[i]; i++) {		if (strcmp(parent, fstack[cpu].stack[i]) == 0) {			add_child(&fstack[cpu], child, i+1);			return i;		}	} 	/* Not found */	add_child(&fstack[cpu], parent, 0);	add_child(&fstack[cpu], child, 1);	return 0;} static void show_function(struct trace_seq *s, struct tep_handle *tep,			  const char *func, unsigned long long function){	unsigned long long offset; 	trace_seq_printf(s, "%s", func);	if (ftrace_offset->set) {		offset = tep_find_function_address(tep, function);		trace_seq_printf(s, "+0x%x ", (int)(function - offset));	}} static int function_handler(struct trace_seq *s, struct tep_record *record,			    struct tep_event *event, void *context){	struct tep_handle *tep = event->tep;	unsigned long long function;	unsigned long long pfunction;	const char *func;	const char *parent;	int index = 0; 	if (tep_get_field_val(s, event, "ip", record, &function, 1))		return trace_seq_putc(s, '!'); 	func = tep_find_function(tep, function); 	if (tep_get_field_val(s, event, "parent_ip", record, &pfunction, 1))		return trace_seq_putc(s, '!'); 	parent = tep_find_function(tep, pfunction); 	if (parent && ftrace_indent->set)		index = add_and_get_index(parent, func, record->cpu); 	trace_seq_printf(s, "%*s", index*3, ""); 	if (func)		show_function(s, tep, func, function);	else		trace_seq_printf(s, "0x%llx", function); 	if (ftrace_parent->set) {		trace_seq_printf(s, " <-- ");		if (parent)			show_function(s, tep, parent, pfunction);		else			trace_seq_printf(s, "0x%llx", pfunction);	} 	return 0;} static inttrace_stack_handler(struct trace_seq *s, struct tep_record *record,		    struct tep_event *event, void *context){	struct tep_format_field *field;	unsigned long long addr;	const char *func;	int long_size;	void *data = record->data; 	field = tep_find_any_field(event, "caller");	if (!field) {		trace_seq_printf(s, "<CANT FIND FIELD %s>", "caller");		return 0;	} 	trace_seq_puts(s, "<stack trace >\n"); 	long_size = tep_get_long_size(event->tep); 	for (data += field->offset; data < record->data + record->size;	     data += long_size) {		addr = tep_read_number(event->tep, data, long_size); 		if ((long_size == 8 && addr == (unsigned long long)-1) ||		    ((int)addr == -1))			break; 		func = tep_find_function(event->tep, addr);		if (func)			trace_seq_printf(s, "=> %s (%llx)\n", func, addr);		else			trace_seq_printf(s, "=> %llx\n", addr);	} 	return 0;} static inttrace_raw_data_handler(struct trace_seq *s, struct tep_record *record,		    struct tep_event *event, void *context){	struct tep_format_field *field;	unsigned long long id;	int long_size;	void *data = record->data; 	if (tep_get_field_val(s, event, "id", record, &id, 1))		return trace_seq_putc(s, '!'); 	trace_seq_printf(s, "# %llx", id); 	field = tep_find_any_field(event, "buf");	if (!field) {		trace_seq_printf(s, "<CANT FIND FIELD %s>", "buf");		return 0;	} 	long_size = tep_get_long_size(event->tep); 	for (data += field->offset; data < record->data + record->size;	     data += long_size) {		int size = sizeof(long);		int left = (record->data + record->size) - data;		int i; 		if (size > left)			size = left; 		for (i = 0; i < size; i++)			trace_seq_printf(s, " %02x", *(unsigned char *)(data + i));	} 	return 0;} int TEP_PLUGIN_LOADER(struct tep_handle *tep){	tep_register_event_handler(tep, -1, "ftrace", "function",				   function_handler, NULL); 	tep_register_event_handler(tep, -1, "ftrace", "kernel_stack",				      trace_stack_handler, NULL); 	tep_register_event_handler(tep, -1, "ftrace", "raw_data",				      trace_raw_data_handler, NULL); 	tep_plugin_add_options("ftrace", plugin_options); 	return 0;} void TEP_PLUGIN_UNLOADER(struct tep_handle *tep){	int i, x; 	tep_unregister_event_handler(tep, -1, "ftrace", "function",				     function_handler, NULL); 	for (i = 0; i <= cpus; i++) {		for (x = 0; x < fstack[i].size && fstack[i].stack[x]; x++)			free(fstack[i].stack[x]);		free(fstack[i].stack);	} 	tep_plugin_remove_options(plugin_options); 	free(fstack);	fstack = NULL;	cpus = -1;}