[blktrace.git] / blkparse.c

#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>

#include "blktrace.h"
#include "rbtree.h"

#define MAX_CPUS	(512)

struct per_file_info {
	int cpu;
	int nelems;

	int fd;
	char fname[128];

	FILE *ofp;
	char ofname[128];

	unsigned long long start_time;
};

static struct rb_root rb_root;

struct trace {
	struct blk_io_trace *bit;
	unsigned int cpu;
	struct rb_node rb_node;
};

static struct per_file_info per_file_info[MAX_CPUS];
static struct per_file_info *cur_file;

static unsigned long qreads, qwrites, creads, cwrites, mreads, mwrites;
static unsigned long long qread_kb, qwrite_kb, cread_kb, cwrite_kb;
static unsigned long long events;

static int max_cpus;

static inline void account_m(int rw, unsigned int bytes)
{
	if (rw) {
		mwrites++;
		qwrite_kb += bytes >> 10;
	} else {
		mreads++;
		qread_kb += bytes >> 10;
	}
}

static inline void account_q(int rw, unsigned int bytes)
{
	if (rw) {
		qwrites++;
		qwrite_kb += bytes >> 10;
	} else {
		qreads++;
		qread_kb += bytes >> 10;
	}
}

static inline void account_c(int rw, unsigned int bytes)
{
	if (rw) {
		cwrites++;
		cwrite_kb += bytes >> 10;
	} else {
		creads++;
		cread_kb += bytes >> 10;
	}
}

static void output(char *s)
{
	printf("%s", s);
	fprintf(cur_file->ofp,"%s",s);
}

static char hstring[256];
static char tstring[256];

static inline char *setup_header(struct blk_io_trace *t, char act)
{
	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);
	int b = t->action & BLK_TC_ACT(BLK_TC_BARRIER);
	int s = t->action & BLK_TC_ACT(BLK_TC_SYNC);
	char rwbs[4];
	int i = 0;

	if (w)
		rwbs[i++] = 'W';
	else
		rwbs[i++] = 'R';
	if (b)
		rwbs[i++] = 'B';
	if (s)
		rwbs[i++] = 'S';

	rwbs[i] = '\0';

	sprintf(hstring, "%3d %15ld %12Lu %5u %c %3s", cur_file->cpu,
		(unsigned long)t->sequence, (unsigned long long)t->time, t->pid,
		act, rwbs);

	return hstring;
}

static void log_complete(struct blk_io_trace *t, char act)
{
	sprintf(tstring,"%s %Lu + %u [%d]\n", setup_header(t, act),
		(unsigned long long)t->sector, t->bytes >> 9, t->error);
	output(tstring);
}

static void log_queue(struct blk_io_trace *t, char act)
{
	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
		(unsigned long long)t->sector, t->bytes >> 9);
	output(tstring);
}

static void log_issue(struct blk_io_trace *t, char act)
{
	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
		(unsigned long long)t->sector, t->bytes >> 9);
	output(tstring);
}

static void log_merge(struct blk_io_trace *t, char act)
{
	sprintf(tstring,"%s   %Lu + %u\n", setup_header(t, act),
		(unsigned long long)t->sector, t->bytes >> 9);
	output(tstring);
}

static void log_generic(struct blk_io_trace *t, char act)
{
	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
		(unsigned long long)t->sector, t->bytes >> 9);
	output(tstring);
}

static int log_pc(struct blk_io_trace *t, char act)
{
	unsigned char *buf;
	int i;

	sprintf(tstring,"%s ", setup_header(t, act));
	output(tstring);

	buf = (unsigned char *) t + sizeof(*t);
	for (i = 0; i < t->pdu_len; i++) {
		sprintf(tstring,"%02x ", buf[i]);
		output(tstring);
	}

	if (act == 'C') {
		sprintf(tstring,"[%d]", t->error);
		output(tstring);
	}

	printf("\n");
	return 0;
}

static int dump_trace_pc(struct blk_io_trace *t)
{
	int ret = 0;

	switch (t->action & 0xffff) {
		case __BLK_TA_QUEUE:
			log_generic(t, 'Q');
			break;
		case __BLK_TA_GETRQ:
			log_generic(t, 'G');
			break;
		case __BLK_TA_SLEEPRQ:
			log_generic(t, 'S');
			break;
		case __BLK_TA_REQUEUE:
			log_generic(t, 'R');
			break;
		case __BLK_TA_ISSUE:
			ret = log_pc(t, 'D');
			break;
		case __BLK_TA_COMPLETE:
			log_pc(t, 'C');
			break;
		default:
			fprintf(stderr, "Bad pc action %x\n", t->action);
			ret = 1;
			break;
	}
	
	return ret;
}

static void dump_trace_fs(struct blk_io_trace *t)
{
	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);

	switch (t->action & 0xffff) {
		case __BLK_TA_QUEUE:
			account_q(w, t->bytes);
			log_queue(t, 'Q');
			break;
		case __BLK_TA_BACKMERGE:
			account_m(w, t->bytes);
			log_merge(t, 'M');
			break;
		case __BLK_TA_FRONTMERGE:
			account_m(w, t->bytes);
			log_merge(t, 'F');
			break;
		case __BLK_TA_GETRQ:
			log_generic(t, 'G');
			break;
		case __BLK_TA_SLEEPRQ:
			log_generic(t, 'S');
			break;
		case __BLK_TA_REQUEUE:
			log_queue(t, 'R');
			break;
		case __BLK_TA_ISSUE:
			log_issue(t, 'D');
			break;
		case __BLK_TA_COMPLETE:
			account_c(w, t->bytes);
			log_complete(t, 'C');
			break;
		default:
			fprintf(stderr, "Bad fs action %x\n", t->action);
			return;
	}
}

static int dump_trace(struct blk_io_trace *t)
{
	int ret = 0;

	if (t->action & BLK_TC_ACT(BLK_TC_PC))
		ret = dump_trace_pc(t);
	else
		dump_trace_fs(t);

	events++;
	return ret;
}

static void show_stats(void)
{
	printf("\nReads:");
	printf("\tQueued:    %'8lu, %'8LuKiB\n", qreads, qread_kb);
	printf("\tCompleted: %'8lu, %'8LuKiB\n", creads, cread_kb);
	printf("\tMerges:    %'8lu\n", mreads);

	printf("Writes:");
	printf("\tQueued:    %'8lu, %'8LuKiB\n", qwrites, qwrite_kb);
	printf("\tCompleted: %'8lu, %'8LuKiB\n", cwrites, cwrite_kb);
	printf("\tMerges:    %'8lu\n", mwrites);

	printf("Events: %'Lu\n", events);
}

static inline int trace_rb_insert(struct trace *t)
{
	struct rb_node **p = &rb_root.rb_node;
	struct rb_node *parent = NULL;
	struct trace *__t;

	while (*p) {
		parent = *p;
		__t = rb_entry(parent, struct trace, rb_node);

		if (t->bit->sequence < __t->bit->sequence)
			p = &(*p)->rb_left;
		else if (t->bit->sequence > __t->bit->sequence)
			p = &(*p)->rb_right;
		else {
			fprintf(stderr, "sequence alias!\n");
			return 1;
		}
	}

	rb_link_node(&t->rb_node, parent, p);
	rb_insert_color(&t->rb_node, &rb_root);
	return 0;
}

static int sort_entries(void *traces, unsigned long offset, int cpu)
{
	struct blk_io_trace *bit;
	struct trace *t;
	void *start = traces;
	int nelems = 0;

	while (traces - start <= offset - sizeof(*bit)) {
		bit = traces;

		t = malloc(sizeof(*t));
		t->bit = bit;
		t->cpu = cpu;
		memset(&t->rb_node, 0, sizeof(t->rb_node));

		trace_to_cpu(bit);

		if (verify_trace(bit))
			break;

		if (trace_rb_insert(t))
			return -1;

		traces += sizeof(*bit) + bit->pdu_len;
		nelems++;
	}

	return nelems;
}

static void show_entries(void)
{
	struct blk_io_trace *bit;
	struct rb_node *n;
	struct trace *t;
	int cpu;

	n = rb_first(&rb_root);
	if (!n)
		return;

	do {
		t = rb_entry(n, struct trace, rb_node);
		bit = t->bit;

		cpu = t->cpu;
		if (cpu > max_cpus) {
			fprintf(stderr, "CPU number too large (%d)\n", cpu);
			break;
		}

		cur_file = &per_file_info[cpu];

		/*
		 * offset time by first trace event.
		 *
		 * NOTE: This is *cpu* relative, thus you can not
		 * compare times ACROSS cpus.
		 */
		if (cur_file->start_time == 0)
			cur_file->start_time = bit->time;

		bit->time -= cur_file->start_time;

		if (dump_trace(bit))
			break;

	} while ((n = rb_next(n)) != NULL);
}

int main(int argc, char *argv[])
{
	int i, nfiles, ret;
	char *dev;

	if (argc != 2) {
		fprintf(stderr, "Usage: %s <dev>\n", argv[0]);
		return 1;
	}

	dev = argv[1];

	memset(&rb_root, 0, sizeof(rb_root));

	for (max_cpus = 0, i = 0, nfiles = 0; i < MAX_CPUS; i++) {
		struct per_file_info *pfi = &per_file_info[i];
		struct stat st;
		void *tb;

		pfi->cpu = i;
		pfi->start_time = 0;

		snprintf(pfi->fname, sizeof(pfi->fname)-1,"%s_out.%d", dev, i);
		if (stat(pfi->fname, &st) < 0)
			break;

		snprintf(pfi->ofname, sizeof(pfi->ofname)-1, "%s_log.%d", dev, i);
		pfi->ofp = fopen(pfi->ofname, "w");
		if (pfi->ofp == NULL) {
			perror(pfi->ofname);
			break;
		}

		printf("Processing %s\n", pfi->fname);

		tb = malloc(st.st_size);

		pfi->fd = open(pfi->fname, O_RDONLY);
		if (pfi->fd < 0) {
			perror(pfi->fname);
			break;
		}
		if (read(pfi->fd, tb, st.st_size) != st.st_size) {
			fprintf(stderr, "error reading\n");
			break;
		}

		ret = sort_entries(tb, st.st_size, i);
		if (ret == -1)
			break;

		close(pfi->fd);
		nfiles++;
		max_cpus++;
		pfi->nelems = ret;
		printf("\t%2d %10s %15d\n", i, pfi->fname, pfi->nelems);

	}

	if (nfiles) {
		show_entries();
		show_stats();
		return 0;
	}

	fprintf(stderr, "No files found\n");
	return 1;
}
Commit	Line	Data
	1	#include <sys/types.h>
	2	#include <sys/stat.h>
	3	#include <unistd.h>
	4	#include <stdio.h>
	5	#include <fcntl.h>
	6	#include <stdlib.h>
	7	#include <string.h>
	8
	9	#include "blktrace.h"
	10	#include "rbtree.h"
	11
	12	#define MAX_CPUS (512)
	13
	14	struct per_file_info {
	15	int cpu;
	16	int nelems;
	17
	18	int fd;
	19	char fname[128];
	20
	21	FILE *ofp;
	22	char ofname[128];
	23
	24	unsigned long long start_time;
	25	};
	26
	27	static struct rb_root rb_root;
	28
	29	struct trace {
	30	struct blk_io_trace *bit;
	31	unsigned int cpu;
	32	struct rb_node rb_node;
	33	};
	34
	35	static struct per_file_info per_file_info[MAX_CPUS];
	36	static struct per_file_info *cur_file;
	37
	38	static unsigned long qreads, qwrites, creads, cwrites, mreads, mwrites;
	39	static unsigned long long qread_kb, qwrite_kb, cread_kb, cwrite_kb;
	40	static unsigned long long events;
	41
	42	static int max_cpus;
	43
	44	static inline void account_m(int rw, unsigned int bytes)
	45	{
	46	if (rw) {
	47	mwrites++;
	48	qwrite_kb += bytes >> 10;
	49	} else {
	50	mreads++;
	51	qread_kb += bytes >> 10;
	52	}
	53	}
	54
	55	static inline void account_q(int rw, unsigned int bytes)
	56	{
	57	if (rw) {
	58	qwrites++;
	59	qwrite_kb += bytes >> 10;
	60	} else {
	61	qreads++;
	62	qread_kb += bytes >> 10;
	63	}
	64	}
	65
	66	static inline void account_c(int rw, unsigned int bytes)
	67	{
	68	if (rw) {
	69	cwrites++;
	70	cwrite_kb += bytes >> 10;
	71	} else {
	72	creads++;
	73	cread_kb += bytes >> 10;
	74	}
	75	}
	76
	77	static void output(char *s)
	78	{
	79	printf("%s", s);
	80	fprintf(cur_file->ofp,"%s",s);
	81	}
	82
	83	static char hstring[256];
	84	static char tstring[256];
	85
	86	static inline char setup_header(struct blk_io_trace t, char act)
	87	{
	88	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);
	89	int b = t->action & BLK_TC_ACT(BLK_TC_BARRIER);
	90	int s = t->action & BLK_TC_ACT(BLK_TC_SYNC);
	91	char rwbs[4];
	92	int i = 0;
	93
	94	if (w)
	95	rwbs[i++] = 'W';
	96	else
	97	rwbs[i++] = 'R';
	98	if (b)
	99	rwbs[i++] = 'B';
	100	if (s)
	101	rwbs[i++] = 'S';
	102
	103	rwbs[i] = '\0';
	104
	105	sprintf(hstring, "%3d %15ld %12Lu %5u %c %3s", cur_file->cpu,
	106	(unsigned long)t->sequence, (unsigned long long)t->time, t->pid,
	107	act, rwbs);
	108
	109	return hstring;
	110	}
	111
	112	static void log_complete(struct blk_io_trace *t, char act)
	113	{
	114	sprintf(tstring,"%s %Lu + %u [%d]\n", setup_header(t, act),
	115	(unsigned long long)t->sector, t->bytes >> 9, t->error);
	116	output(tstring);
	117	}
	118
	119	static void log_queue(struct blk_io_trace *t, char act)
	120	{
	121	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
	122	(unsigned long long)t->sector, t->bytes >> 9);
	123	output(tstring);
	124	}
	125
	126	static void log_issue(struct blk_io_trace *t, char act)
	127	{
	128	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
	129	(unsigned long long)t->sector, t->bytes >> 9);
	130	output(tstring);
	131	}
	132
	133	static void log_merge(struct blk_io_trace *t, char act)
	134	{
	135	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
	136	(unsigned long long)t->sector, t->bytes >> 9);
	137	output(tstring);
	138	}
	139
	140	static void log_generic(struct blk_io_trace *t, char act)
	141	{
	142	sprintf(tstring,"%s %Lu + %u\n", setup_header(t, act),
	143	(unsigned long long)t->sector, t->bytes >> 9);
	144	output(tstring);
	145	}
	146
	147	static int log_pc(struct blk_io_trace *t, char act)
	148	{
	149	unsigned char *buf;
	150	int i;
	151
	152	sprintf(tstring,"%s ", setup_header(t, act));
	153	output(tstring);
	154
	155	buf = (unsigned char ) t + sizeof(t);
	156	for (i = 0; i < t->pdu_len; i++) {
	157	sprintf(tstring,"%02x ", buf[i]);
	158	output(tstring);
	159	}
	160
	161	if (act == 'C') {
	162	sprintf(tstring,"[%d]", t->error);
	163	output(tstring);
	164	}
	165
	166	printf("\n");
	167	return 0;
	168	}
	169
	170	static int dump_trace_pc(struct blk_io_trace *t)
	171	{
	172	int ret = 0;
	173
	174	switch (t->action & 0xffff) {
	175	case __BLK_TA_QUEUE:
	176	log_generic(t, 'Q');
	177	break;
	178	case __BLK_TA_GETRQ:
	179	log_generic(t, 'G');
	180	break;
	181	case __BLK_TA_SLEEPRQ:
	182	log_generic(t, 'S');
	183	break;
	184	case __BLK_TA_REQUEUE:
	185	log_generic(t, 'R');
	186	break;
	187	case __BLK_TA_ISSUE:
	188	ret = log_pc(t, 'D');
	189	break;
	190	case __BLK_TA_COMPLETE:
	191	log_pc(t, 'C');
	192	break;
	193	default:
	194	fprintf(stderr, "Bad pc action %x\n", t->action);
	195	ret = 1;
	196	break;
	197	}
	198
	199	return ret;
	200	}
	201
	202	static void dump_trace_fs(struct blk_io_trace *t)
	203	{
	204	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);
	205
	206	switch (t->action & 0xffff) {
	207	case __BLK_TA_QUEUE:
	208	account_q(w, t->bytes);
	209	log_queue(t, 'Q');
	210	break;
	211	case __BLK_TA_BACKMERGE:
	212	account_m(w, t->bytes);
	213	log_merge(t, 'M');
	214	break;
	215	case __BLK_TA_FRONTMERGE:
	216	account_m(w, t->bytes);
	217	log_merge(t, 'F');
	218	break;
	219	case __BLK_TA_GETRQ:
	220	log_generic(t, 'G');
	221	break;
	222	case __BLK_TA_SLEEPRQ:
	223	log_generic(t, 'S');
	224	break;
	225	case __BLK_TA_REQUEUE:
	226	log_queue(t, 'R');
	227	break;
	228	case __BLK_TA_ISSUE:
	229	log_issue(t, 'D');
	230	break;
	231	case __BLK_TA_COMPLETE:
	232	account_c(w, t->bytes);
	233	log_complete(t, 'C');
	234	break;
	235	default:
	236	fprintf(stderr, "Bad fs action %x\n", t->action);
	237	return;
	238	}
	239	}
	240
	241	static int dump_trace(struct blk_io_trace *t)
	242	{
	243	int ret = 0;
	244
	245	if (t->action & BLK_TC_ACT(BLK_TC_PC))
	246	ret = dump_trace_pc(t);
	247	else
	248	dump_trace_fs(t);
	249
	250	events++;
	251	return ret;
	252	}
	253
	254	static void show_stats(void)
	255	{
	256	printf("\nReads:");
	257	printf("\tQueued: %'8lu, %'8LuKiB\n", qreads, qread_kb);
	258	printf("\tCompleted: %'8lu, %'8LuKiB\n", creads, cread_kb);
	259	printf("\tMerges: %'8lu\n", mreads);
	260
	261	printf("Writes:");
	262	printf("\tQueued: %'8lu, %'8LuKiB\n", qwrites, qwrite_kb);
	263	printf("\tCompleted: %'8lu, %'8LuKiB\n", cwrites, cwrite_kb);
	264	printf("\tMerges: %'8lu\n", mwrites);
	265
	266	printf("Events: %'Lu\n", events);
	267	}
	268
	269	static inline int trace_rb_insert(struct trace *t)
	270	{
	271	struct rb_node **p = &rb_root.rb_node;
	272	struct rb_node *parent = NULL;
	273	struct trace *__t;
	274
	275	while (*p) {
	276	parent = *p;
	277	__t = rb_entry(parent, struct trace, rb_node);
	278
	279	if (t->bit->sequence < __t->bit->sequence)
	280	p = &(*p)->rb_left;
	281	else if (t->bit->sequence > __t->bit->sequence)
	282	p = &(*p)->rb_right;
	283	else {
	284	fprintf(stderr, "sequence alias!\n");
	285	return 1;
	286	}
	287	}
	288
	289	rb_link_node(&t->rb_node, parent, p);
	290	rb_insert_color(&t->rb_node, &rb_root);
	291	return 0;
	292	}
	293
	294	static int sort_entries(void *traces, unsigned long offset, int cpu)
	295	{
	296	struct blk_io_trace *bit;
	297	struct trace *t;
	298	void *start = traces;
	299	int nelems = 0;
	300
	301	while (traces - start <= offset - sizeof(*bit)) {
	302	bit = traces;
	303
	304	t = malloc(sizeof(*t));
	305	t->bit = bit;
	306	t->cpu = cpu;
	307	memset(&t->rb_node, 0, sizeof(t->rb_node));
	308
	309	trace_to_cpu(bit);
	310
	311	if (verify_trace(bit))
	312	break;
	313
	314	if (trace_rb_insert(t))
	315	return -1;
	316
	317	traces += sizeof(*bit) + bit->pdu_len;
	318	nelems++;
	319	}
	320
	321	return nelems;
	322	}
	323
	324	static void show_entries(void)
	325	{
	326	struct blk_io_trace *bit;
	327	struct rb_node *n;
	328	struct trace *t;
	329	int cpu;
	330
	331	n = rb_first(&rb_root);
	332	if (!n)
	333	return;
	334
	335	do {
	336	t = rb_entry(n, struct trace, rb_node);
	337	bit = t->bit;
	338
	339	cpu = t->cpu;
	340	if (cpu > max_cpus) {
	341	fprintf(stderr, "CPU number too large (%d)\n", cpu);
	342	break;
	343	}
	344
	345	cur_file = &per_file_info[cpu];
	346
	347	/*
	348	* offset time by first trace event.
	349	*
	350	* NOTE: This is cpu relative, thus you can not
	351	* compare times ACROSS cpus.
	352	*/
	353	if (cur_file->start_time == 0)
	354	cur_file->start_time = bit->time;
	355
	356	bit->time -= cur_file->start_time;
	357
	358	if (dump_trace(bit))
	359	break;
	360
	361	} while ((n = rb_next(n)) != NULL);
	362	}
	363
	364	int main(int argc, char *argv[])
	365	{
	366	int i, nfiles, ret;
	367	char *dev;
	368
	369	if (argc != 2) {
	370	fprintf(stderr, "Usage: %s <dev>\n", argv[0]);
	371	return 1;
	372	}
	373
	374	dev = argv[1];
	375
	376	memset(&rb_root, 0, sizeof(rb_root));
	377
	378	for (max_cpus = 0, i = 0, nfiles = 0; i < MAX_CPUS; i++) {
	379	struct per_file_info *pfi = &per_file_info[i];
	380	struct stat st;
	381	void *tb;
	382
	383	pfi->cpu = i;
	384	pfi->start_time = 0;
	385
	386	snprintf(pfi->fname, sizeof(pfi->fname)-1,"%s_out.%d", dev, i);
	387	if (stat(pfi->fname, &st) < 0)
	388	break;
	389
	390	snprintf(pfi->ofname, sizeof(pfi->ofname)-1, "%s_log.%d", dev, i);
	391	pfi->ofp = fopen(pfi->ofname, "w");
	392	if (pfi->ofp == NULL) {
	393	perror(pfi->ofname);
	394	break;
	395	}
	396
	397	printf("Processing %s\n", pfi->fname);
	398
	399	tb = malloc(st.st_size);
	400
	401	pfi->fd = open(pfi->fname, O_RDONLY);
	402	if (pfi->fd < 0) {
	403	perror(pfi->fname);
	404	break;
	405	}
	406	if (read(pfi->fd, tb, st.st_size) != st.st_size) {
	407	fprintf(stderr, "error reading\n");
	408	break;
	409	}
	410
	411	ret = sort_entries(tb, st.st_size, i);
	412	if (ret == -1)
	413	break;
	414
	415	close(pfi->fd);
	416	nfiles++;
	417	max_cpus++;
	418	pfi->nelems = ret;
	419	printf("\t%2d %10s %15d\n", i, pfi->fname, pfi->nelems);
	420
	421	}
	422
	423	if (nfiles) {
	424	show_entries();
	425	show_stats();
	426	return 0;
	427	}
	428
	429	fprintf(stderr, "No files found\n");
	430	return 1;
	431	}