[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 inline int verify_trace(struct blk_io_trace *t)
{
	if (!CHECK_MAGIC(t)) {
		fprintf(stderr, "bad trace magic %x\n", t->magic);
		return 1;
	}
	if ((t->magic & 0xff) != SUPPORTED_VERSION) {
		fprintf(stderr, "unsupported trace version %x\n", 
			t->magic & 0xff);
		return 1;
	}

	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;

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

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

		if (verify_trace(bit))
			break;

		if (trace_rb_insert(t))
			return -1;

		traces += sizeof(*bit) + bit->pdu_len;
		nelems++;
	} while (traces < start + offset + sizeof(*bit));

	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];

	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
d0ca268b JA	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>
8fc0abbc	7	#include <string.h>
d0ca268b	8
8fc0abbc JA	9	#include "blktrace.h"
8fc0abbc JA	10	#include "rbtree.h"
d0ca268b	11
fd92da24	12	#define MAX_CPUS (512)
d0ca268b JA	13
	14	struct per_file_info {
	15	int cpu;
	16	int nelems;
d0ca268b JA	17
d0ca268b JA	18	int fd;
87b72777	19	char fname[128];
d0ca268b	20
87b72777 JA	21	FILE *ofp;
87b72777 JA	22	char ofname[128];
8fc0abbc	23
d0ca268b JA	24	unsigned long long start_time;
	25	};
	26
8fc0abbc JA	27	static struct rb_root rb_root;
	28
	29	struct trace {
	30	struct blk_io_trace *bit;
66fa7233	31	unsigned int cpu;
8fc0abbc JA	32	struct rb_node rb_node;
	33	};
	34
87b72777 JA	35	static struct per_file_info per_file_info[MAX_CPUS];
87b72777 JA	36	static struct per_file_info *cur_file;
d0ca268b JA	37
	38	static unsigned long qreads, qwrites, creads, cwrites, mreads, mwrites;
	39	static unsigned long long qread_kb, qwrite_kb, cread_kb, cwrite_kb;
87b72777 JA	40	static unsigned long long events;
	41
	42	static int max_cpus;
d0ca268b JA	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
3aabcd89	77	static void output(char *s)
d0ca268b JA	78	{
d0ca268b JA	79	printf("%s", s);
3aabcd89	80	fprintf(cur_file->ofp,"%s",s);
d0ca268b JA	81	}
d0ca268b JA	82
3aabcd89 JA	83	static char hstring[256];
3aabcd89 JA	84	static char tstring[256];
d0ca268b	85
3aabcd89	86	static inline char setup_header(struct blk_io_trace t, char act)
d0ca268b JA	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
3aabcd89	105	sprintf(hstring, "%3d %15ld %12Lu %5u %c %3s", cur_file->cpu,
d0ca268b JA	106	(unsigned long)t->sequence, (unsigned long long)t->time, t->pid,
	107	act, rwbs);
	108
	109	return hstring;
	110	}
	111
3aabcd89	112	static void log_complete(struct blk_io_trace *t, char act)
d0ca268b JA	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
3aabcd89	119	static void log_queue(struct blk_io_trace *t, char act)
d0ca268b JA	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
3aabcd89	126	static void log_issue(struct blk_io_trace *t, char act)
d0ca268b JA	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
3aabcd89	133	static void log_merge(struct blk_io_trace *t, char act)
d0ca268b JA	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
3aabcd89	140	static void log_generic(struct blk_io_trace *t, char act)
d0ca268b JA	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
87b72777	147	static int log_pc(struct blk_io_trace *t, char act)
d0ca268b	148	{
87b72777 JA	149	unsigned char *buf;
87b72777 JA	150	int i;
d0ca268b	151
87b72777	152	sprintf(tstring,"%s ", setup_header(t, act));
d0ca268b JA	153	output(tstring);
d0ca268b JA	154
87b72777	155	buf = (unsigned char ) t + sizeof(t);
d0ca268b JA	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");
87b72777	167	return 0;
d0ca268b JA	168	}
d0ca268b JA	169
87b72777	170	static int dump_trace_pc(struct blk_io_trace *t)
d0ca268b	171	{
87b72777 JA	172	int ret = 0;
87b72777 JA	173
d0ca268b JA	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:
87b72777	188	ret = log_pc(t, 'D');
d0ca268b JA	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);
87b72777 JA	195	ret = 1;
87b72777 JA	196	break;
d0ca268b JA	197	}
d0ca268b JA	198
87b72777	199	return ret;
d0ca268b JA	200	}
d0ca268b JA	201
3aabcd89	202	static void dump_trace_fs(struct blk_io_trace *t)
d0ca268b JA	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	}
d0ca268b JA	239	}
d0ca268b JA	240
87b72777	241	static int dump_trace(struct blk_io_trace *t)
d0ca268b	242	{
87b72777 JA	243	int ret = 0;
87b72777 JA	244
d0ca268b	245	if (t->action & BLK_TC_ACT(BLK_TC_PC))
87b72777	246	ret = dump_trace_pc(t);
d0ca268b JA	247	else
d0ca268b JA	248	dump_trace_fs(t);
87b72777 JA	249
	250	events++;
	251	return ret;
d0ca268b JA	252	}
d0ca268b JA	253
3aabcd89	254	static void show_stats(void)
d0ca268b JA	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);
d0ca268b JA	267	}
d0ca268b JA	268
3aabcd89	269	static inline int trace_rb_insert(struct trace *t)
8fc0abbc JA	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 {
87b72777	284	fprintf(stderr, "sequence alias!\n");
8fc0abbc JA	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
66fa7233 JA	294	static inline int verify_trace(struct blk_io_trace *t)
	295	{
	296	if (!CHECK_MAGIC(t)) {
	297	fprintf(stderr, "bad trace magic %x\n", t->magic);
	298	return 1;
	299	}
	300	if ((t->magic & 0xff) != SUPPORTED_VERSION) {
	301	fprintf(stderr, "unsupported trace version %x\n",
	302	t->magic & 0xff);
	303	return 1;
	304	}
	305
	306	return 0;
	307	}
	308
	309	static int sort_entries(void *traces, unsigned long offset, int cpu)
8fc0abbc JA	310	{
	311	struct blk_io_trace *bit;
	312	struct trace *t;
	313	void *start = traces;
	314	int nelems = 0;
	315
	316	memset(&rb_root, 0, sizeof(rb_root));
	317
	318	do {
	319	bit = traces;
	320	t = malloc(sizeof(*t));
	321	t->bit = bit;
66fa7233	322	t->cpu = cpu;
8fc0abbc JA	323	memset(&t->rb_node, 0, sizeof(t->rb_node));
8fc0abbc JA	324
66fa7233 JA	325	if (verify_trace(bit))
	326	break;
	327
8fc0abbc JA	328	if (trace_rb_insert(t))
	329	return -1;
	330
	331	traces += sizeof(*bit) + bit->pdu_len;
	332	nelems++;
87b72777	333	} while (traces < start + offset + sizeof(*bit));
8fc0abbc JA	334
	335	return nelems;
	336	}
	337
3aabcd89	338	static void show_entries(void)
8fc0abbc	339	{
8fc0abbc	340	struct blk_io_trace *bit;
3aabcd89	341	struct rb_node *n;
8fc0abbc JA	342	struct trace *t;
	343	int cpu;
	344
3aabcd89 JA	345	n = rb_first(&rb_root);
	346	if (!n)
	347	return;
8fc0abbc	348
3aabcd89	349	do {
8fc0abbc JA	350	t = rb_entry(n, struct trace, rb_node);
	351	bit = t->bit;
	352
66fa7233	353	cpu = t->cpu;
87b72777	354	if (cpu > max_cpus) {
8fc0abbc	355	fprintf(stderr, "CPU number too large (%d)\n", cpu);
87b72777	356	break;
8fc0abbc JA	357	}
8fc0abbc JA	358
3aabcd89	359	cur_file = &per_file_info[cpu];
8fc0abbc JA	360
	361	/*
	362	* offset time by first trace event.
	363	*
	364	* NOTE: This is cpu relative, thus you can not
	365	* compare times ACROSS cpus.
	366	*/
3aabcd89 JA	367	if (cur_file->start_time == 0)
3aabcd89 JA	368	cur_file->start_time = bit->time;
8fc0abbc	369
3aabcd89	370	bit->time -= cur_file->start_time;
8fc0abbc	371
87b72777 JA	372	if (dump_trace(bit))
	373	break;
	374
8fc0abbc JA	375	} while ((n = rb_next(n)) != NULL);
	376	}
	377
d0ca268b JA	378	int main(int argc, char *argv[])
d0ca268b JA	379	{
3aabcd89 JA	380	int i, nfiles, ret;
3aabcd89 JA	381	char *dev;
d0ca268b JA	382
d0ca268b JA	383	if (argc != 2) {
87b72777	384	fprintf(stderr, "Usage: %s <dev>\n", argv[0]);
d0ca268b JA	385	return 1;
	386	}
	387
	388	dev = argv[1];
	389
87b72777 JA	390	for (max_cpus = 0, i = 0, nfiles = 0; i < MAX_CPUS; i++) {
	391	struct per_file_info *pfi = &per_file_info[i];
	392	struct stat st;
	393	void *tb;
	394
d0ca268b JA	395	pfi->cpu = i;
	396	pfi->start_time = 0;
	397
87b72777 JA	398	snprintf(pfi->fname, sizeof(pfi->fname)-1,"%s_out.%d", dev, i);
87b72777 JA	399	if (stat(pfi->fname, &st) < 0)
d0ca268b	400	break;
d0ca268b	401
87b72777	402	snprintf(pfi->ofname, sizeof(pfi->ofname)-1, "%s_log.%d", dev, i);
d0ca268b JA	403	pfi->ofp = fopen(pfi->ofname, "w");
	404	if (pfi->ofp == NULL) {
	405	perror(pfi->ofname);
3aabcd89	406	break;
d0ca268b JA	407	}
d0ca268b JA	408
8fc0abbc JA	409	printf("Processing %s\n", pfi->fname);
8fc0abbc JA	410
87b72777	411	tb = malloc(st.st_size);
8fc0abbc JA	412
	413	pfi->fd = open(pfi->fname, O_RDONLY);
	414	if (pfi->fd < 0) {
d0ca268b	415	perror(pfi->fname);
3aabcd89	416	break;
d0ca268b	417	}
87b72777	418	if (read(pfi->fd, tb, st.st_size) != st.st_size) {
8fc0abbc	419	fprintf(stderr, "error reading\n");
3aabcd89	420	break;
fd92da24	421	}
d0ca268b	422
66fa7233	423	ret = sort_entries(tb, st.st_size, i);
8fc0abbc	424	if (ret == -1)
3aabcd89	425	break;
d0ca268b	426
8fc0abbc JA	427	close(pfi->fd);
8fc0abbc JA	428	nfiles++;
87b72777	429	max_cpus++;
8fc0abbc	430	pfi->nelems = ret;
8fc0abbc	431	printf("\t%2d %10s %15d\n", i, pfi->fname, pfi->nelems);
d0ca268b	432
d0ca268b JA	433	}
d0ca268b JA	434
3aabcd89 JA	435	if (nfiles) {
	436	show_entries();
	437	show_stats();
	438	return 0;
	439	}
8fc0abbc	440
3aabcd89 JA	441	fprintf(stderr, "No files found\n");
3aabcd89 JA	442	return 1;
d0ca268b	443	}