[blktrace.git] / blkparse.c

/*
 * block queue tracing parse application
 *
 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <getopt.h>
#include <errno.h>
#include <signal.h>

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

#define SECONDS(x) 	((unsigned long long)(x) / 1000000000)
#define NANO_SECONDS(x)	((unsigned long long)(x) % 1000000000)

static int backwards;
static unsigned long long genesis_time, last_reported_time;

struct per_cpu_info {
	int cpu;
	int nelems;

	int fd;
	char fname[128];

	FILE *ofp;
	char ofname[128];

	unsigned long qreads, qwrites, creads, cwrites, mreads, mwrites;
	unsigned long ireads, iwrites;
	unsigned long long qread_kb, qwrite_kb, cread_kb, cwrite_kb;
	unsigned long long iread_kb, iwrite_kb;
};

#define S_OPTS	"i:o:"
static struct option l_opts[] = {
	{
		.name = "input",
		.has_arg = 1,
		.flag = NULL,
		.val = 'i'
	},
	{
		.name = "output",
		.has_arg = 1,
		.flag = NULL,
		.val = 'o'
	},
	{
		.name = NULL,
		.has_arg = 0,
		.flag = NULL,
		.val = 0
	}
};

static struct rb_root rb_root;

struct trace {
	struct blk_io_trace *bit;
	struct rb_node rb_node;
};

static int max_cpus;
static struct per_cpu_info *per_cpu_info;

static unsigned long long events;

static char *dev, *output_name;

#define is_done()	(*(volatile int *)(&done))
static volatile int done;

static void resize_cpu_info(int cpuid)
{
	int new_space, new_max = cpuid + 1;
	char *new_start;

	per_cpu_info = realloc(per_cpu_info, new_max * sizeof(*per_cpu_info));
	if (!per_cpu_info) {
		fprintf(stderr, "Cannot allocate CPU info -- %d x %d bytes\n",
			new_max, (int) sizeof(*per_cpu_info));
		exit(1);
	}

	new_start = (char *)per_cpu_info + (max_cpus * sizeof(*per_cpu_info));
	new_space = (new_max - max_cpus) * sizeof(*per_cpu_info);
	memset(new_start, 0, new_space);
	max_cpus = new_max;
}

static struct per_cpu_info *get_cpu_info(int cpu)
{
	if (cpu >= max_cpus)
		resize_cpu_info(cpu);

	return &per_cpu_info[cpu];
}

static inline void check_time(struct blk_io_trace *bit)
{
	unsigned long long this = bit->time;
	unsigned long long last = last_reported_time;

	backwards = (this < last) ? 'B' : ' ';
	last_reported_time = this;
}

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

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

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

static inline void account_i(struct per_cpu_info *pci, int rw,
			     unsigned int bytes)
{
	if (rw) {
		pci->iwrites++;
		pci->iwrite_kb += bytes >> 10;
	} else {
		pci->ireads++;
		pci->iread_kb += bytes >> 10;
	}
}

static void output(struct per_cpu_info *pci, char *s)
{
	printf("%s", s);

	if (pci->ofp)
		fprintf(pci->ofp, "%s", s);
}

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

static inline char *setup_header(struct per_cpu_info *pci,
				 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, "%c %3d %15ld %5Lu.%09Lu %5u %c %3s", backwards,
		pci->cpu,
		(unsigned long)t->sequence, SECONDS(t->time), 
		NANO_SECONDS(t->time), t->pid, act, rwbs);

	return hstring;
}

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

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

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

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

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

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

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

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

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

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

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

	switch (t->action & 0xffff) {
		case __BLK_TA_QUEUE:
			log_generic(pci, t, 'Q');
			break;
		case __BLK_TA_GETRQ:
			log_generic(pci, t, 'G');
			break;
		case __BLK_TA_SLEEPRQ:
			log_generic(pci, t, 'S');
			break;
		case __BLK_TA_REQUEUE:
			log_generic(pci, t, 'R');
			break;
		case __BLK_TA_ISSUE:
			ret = log_pc(pci, t, 'D');
			break;
		case __BLK_TA_COMPLETE:
			log_pc(pci, 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, struct per_cpu_info *pci)
{
	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);

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

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

	if (output_name && !pci->ofp) {
		snprintf(pci->ofname, sizeof(pci->ofname) - 1,
				"%s_log.%d", output_name, pci->cpu);

		pci->ofp = fopen(pci->ofname, "w");
		if (pci->ofp == NULL) {
			perror(pci->ofname);
			return 1;
		}
	}

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

	events++;
	return ret;
}

static void dump_pci_stats(struct per_cpu_info *pci)
{
	printf("\tReads:\n");
	printf("\t\tQueued:    %'8lu, %'8LuKiB\n", pci->qreads, pci->qread_kb);
	printf("\t\tDispatched %'8lu, %'8LuKiB\n", pci->ireads, pci->iread_kb);
	printf("\t\tCompleted: %'8lu, %'8LuKiB\n", pci->creads, pci->cread_kb);
	printf("\t\tMerges:    %'8lu\n", pci->mreads);

	printf("\tWrites:\n");
	printf("\t\tQueued:    %'8lu, %'8LuKiB\n", pci->qwrites,pci->qwrite_kb);
	printf("\t\tDispatched %'8lu, %'8LuKiB\n", pci->iwrites,pci->iwrite_kb);
	printf("\t\tCompleted: %'8lu, %'8LuKiB\n", pci->cwrites,pci->cwrite_kb);
	printf("\t\tMerges:    %'8lu\n", pci->mwrites);
}

static void show_stats(void)
{
	struct per_cpu_info foo, *pci;
	int i, pci_events = 0;

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

	for (i = 0; i < max_cpus; i++) {
		pci = &per_cpu_info[i];

		if (!pci->nelems)
			continue;

		foo.qreads += pci->qreads;
		foo.qwrites += pci->qwrites;
		foo.creads += pci->creads;
		foo.cwrites += pci->cwrites;
		foo.mreads += pci->mreads;
		foo.mwrites += pci->mwrites;
		foo.qread_kb += pci->qread_kb;
		foo.qwrite_kb += pci->qwrite_kb;
		foo.cread_kb += pci->cread_kb;
		foo.cwrite_kb += pci->cwrite_kb;

		printf("CPU%d:\n", i);
		dump_pci_stats(pci);
		pci_events++;
	}

	if (pci_events > 1) {
		printf("Total:\n");
		dump_pci_stats(&foo);
	}

	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 nr)
{
	struct per_cpu_info *pci;
	struct blk_io_trace *bit;
	struct trace *t;
	void *start = traces;
	int nelems = 0;

	while (traces - start <= offset - sizeof(*bit)) {
		if (!nr)
			break;

		bit = traces;

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

		trace_to_cpu(bit);

		if (verify_trace(bit))
			break;

		pci = get_cpu_info(bit->cpu);
		pci->nelems++;

		if (trace_rb_insert(t))
			return -1;

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

	return nelems;
}

static void free_entries_rb(void)
{
	struct rb_node *n;

	while ((n = rb_first(&rb_root)) != NULL) {
		struct trace *t = rb_entry(n, struct trace, rb_node);

		rb_erase(&t->rb_node, &rb_root);
		free(t);
	}
}

static void show_entries_rb(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 = bit->cpu;
		if (cpu > max_cpus) {
			fprintf(stderr, "CPU number too large (%d)\n", cpu);
			break;
		}

		if (genesis_time == 0)
			genesis_time = bit->time;
		bit->time -= genesis_time;

		check_time(bit);

		if (dump_trace(bit, &per_cpu_info[cpu]))
			break;

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

static int read_data(int fd, void *buffer, int bytes, int block)
{
	int ret, bytes_left, fl;
	void *p;

	fl = fcntl(fd, F_GETFL);

	if (!block)
		fcntl(fd, F_SETFL, fl | O_NONBLOCK);
	else
		fcntl(fd, F_SETFL, fl & ~O_NONBLOCK);

	bytes_left = bytes;
	p = buffer;
	while (bytes_left > 0) {
		ret = read(fd, p, bytes_left);
		if (!ret)
			return 1;
		else if (ret < 0) {
			if (errno != EAGAIN)
				perror("read");
			return -1;
		} else {
			p += ret;
			bytes_left -= ret;
		}
	}

	return 0;
}

static int do_file(void)
{
	int i, nfiles;

	for (i = 0, nfiles = 0;; i++, nfiles++) {
		struct per_cpu_info *pci;
		struct stat st;
		void *tb;

		pci = get_cpu_info(i);
		pci->cpu = i;
		pci->ofp = NULL;

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

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

		tb = malloc(st.st_size);

		pci->fd = open(pci->fname, O_RDONLY);
		if (pci->fd < 0) {
			perror(pci->fname);
			break;
		}

		if (read_data(pci->fd, tb, st.st_size, 1))
			break;

		if (sort_entries(tb, st.st_size, ~0U) == -1)
			break;

		close(pci->fd);
		printf("\t%2d %10s %15d\n", i, pci->fname, pci->nelems);

	}

	if (!nfiles) {
		fprintf(stderr, "No files found\n");
		return 1;
	}

	show_entries_rb();
	return 0;
}

static void resize_buffer(void **buffer, long *old_size)
{
	long cur_size = *old_size;
	void *ptr;

	*old_size *= 2;
	ptr = malloc(*old_size);
	memcpy(ptr, *buffer, cur_size);
	free(*buffer);
	*buffer = ptr;
}

static int read_sort_events(int fd, void **buffer)
{
	long offset, max_offset;
	int events;

	max_offset = 128 * sizeof(struct blk_io_trace);
	*buffer = malloc(max_offset);
	events = 0;
	offset = 0;

	do {
		struct blk_io_trace *t;
		int pdu_len;

		if (max_offset - offset < sizeof(*t))
			resize_buffer(buffer, &max_offset);

		if (read_data(fd, *buffer + offset, sizeof(*t), !events)) {
			if (events)
				break;

			usleep(1000);
			continue;
		}

		t = *buffer + offset;
		offset += sizeof(*t);

		pdu_len = be16_to_cpu(t->pdu_len);

		if (max_offset - offset < pdu_len)
			resize_buffer(buffer, &max_offset);

		if (read_data(fd, *buffer + offset, pdu_len, 1))
			break;

		offset += pdu_len;
		events++;
	} while (!is_done());

	return events;
}

static int do_stdin(void)
{
	int fd;
	void *ptr;

	fd = dup(STDIN_FILENO);
	do {
		int events;

		events = read_sort_events(fd, &ptr);
		if (!events)
			break;
	
		sort_entries(ptr, ~0UL, events);
		show_entries_rb();
		free_entries_rb();
	} while (1);

	close(fd);
	free(ptr);
	return 0;
}

static void flush_output(void)
{
	int i;

	for (i = 0; i < max_cpus; i++) {
		struct per_cpu_info *pci = &per_cpu_info[i];

		if (pci->ofp) {
			fflush(pci->ofp);
			fclose(pci->ofp);
			pci->ofp = NULL;
		}
	}
}

static void handle_sigint(int sig)
{
	done = 1;
	flush_output();
}

static void usage(char *prog)
{
	fprintf(stderr, "Usage: %s -i <name> [-o <output>]\n", prog);
}

int main(int argc, char *argv[])
{
	int c, ret;

	while ((c = getopt_long(argc, argv, S_OPTS, l_opts, NULL)) != -1) {
		switch (c) {
		case 'i':
			dev = strdup(optarg);
			break;
		case 'o':
			output_name = strdup(optarg);
			break;
		default:
			usage(argv[0]);
			return 1;
		}
	}

	if (!dev) {
		usage(argv[0]);
		return 1;
	}

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

	signal(SIGINT, handle_sigint);
	signal(SIGHUP, handle_sigint);
	signal(SIGTERM, handle_sigint);

	if (!strcmp(dev, "-"))
		ret = do_stdin();
	else
		ret = do_file();

	show_stats();
	flush_output();
	return ret;
}
Commit	Line	Data
d956a2cd JA	1	/*
	2	* block queue tracing parse application
	3	*
	4	* Copyright (C) 2005 Jens Axboe <axboe@suse.de>
	5	*
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License as published by
	8	* the Free Software Foundation; either version 2 of the License, or
	9	* (at your option) any later version.
	10	*
	11	* This program is distributed in the hope that it will be useful,
	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	14	* GNU General Public License for more details.
	15	*
	16	* You should have received a copy of the GNU General Public License
	17	* along with this program; if not, write to the Free Software
	18	* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
	19	*
	20	*/
d0ca268b JA	21	#include <sys/types.h>
	22	#include <sys/stat.h>
	23	#include <unistd.h>
	24	#include <stdio.h>
	25	#include <fcntl.h>
	26	#include <stdlib.h>
8fc0abbc	27	#include <string.h>
d5396421	28	#include <getopt.h>
412819ce JA	29	#include <errno.h>
412819ce JA	30	#include <signal.h>
d0ca268b	31
8fc0abbc JA	32	#include "blktrace.h"
8fc0abbc JA	33	#include "rbtree.h"
d0ca268b	34
cfab07eb AB	35	#define SECONDS(x) ((unsigned long long)(x) / 1000000000)
	36	#define NANO_SECONDS(x) ((unsigned long long)(x) % 1000000000)
	37
d5396421 JA	38	static int backwards;
	39	static unsigned long long genesis_time, last_reported_time;
	40
	41	struct per_cpu_info {
d0ca268b JA	42	int cpu;
d0ca268b JA	43	int nelems;
d0ca268b JA	44
d0ca268b JA	45	int fd;
87b72777	46	char fname[128];
d0ca268b	47
87b72777 JA	48	FILE *ofp;
87b72777 JA	49	char ofname[128];
8fc0abbc	50
5c017e4b	51	unsigned long qreads, qwrites, creads, cwrites, mreads, mwrites;
afd2d7ad	52	unsigned long ireads, iwrites;
5c017e4b	53	unsigned long long qread_kb, qwrite_kb, cread_kb, cwrite_kb;
afd2d7ad	54	unsigned long long iread_kb, iwrite_kb;
d0ca268b JA	55	};
d0ca268b JA	56
d5396421 JA	57	#define S_OPTS "i:o:"
	58	static struct option l_opts[] = {
	59	{
	60	.name = "input",
	61	.has_arg = 1,
	62	.flag = NULL,
	63	.val = 'i'
	64	},
	65	{
	66	.name = "output",
	67	.has_arg = 1,
	68	.flag = NULL,
	69	.val = 'o'
	70	},
	71	{
	72	.name = NULL,
	73	.has_arg = 0,
	74	.flag = NULL,
	75	.val = 0
	76	}
	77	};
	78
8fc0abbc JA	79	static struct rb_root rb_root;
	80
	81	struct trace {
	82	struct blk_io_trace *bit;
	83	struct rb_node rb_node;
	84	};
	85
a718bd37 NS	86	static int max_cpus;
a718bd37 NS	87	static struct per_cpu_info *per_cpu_info;
d0ca268b	88
87b72777 JA	89	static unsigned long long events;
87b72777 JA	90
d5396421	91	static char dev, output_name;
d0ca268b	92
412819ce JA	93	#define is_done() ((volatile int )(&done))
	94	static volatile int done;
	95
a718bd37 NS	96	static void resize_cpu_info(int cpuid)
	97	{
	98	int new_space, new_max = cpuid + 1;
	99	char *new_start;
	100
	101	per_cpu_info = realloc(per_cpu_info, new_max * sizeof(*per_cpu_info));
	102	if (!per_cpu_info) {
	103	fprintf(stderr, "Cannot allocate CPU info -- %d x %d bytes\n",
	104	new_max, (int) sizeof(*per_cpu_info));
	105	exit(1);
	106	}
	107
	108	new_start = (char )per_cpu_info + (max_cpus sizeof(*per_cpu_info));
	109	new_space = (new_max - max_cpus) * sizeof(*per_cpu_info);
	110	memset(new_start, 0, new_space);
	111	max_cpus = new_max;
	112	}
	113
	114	static struct per_cpu_info *get_cpu_info(int cpu)
	115	{
	116	if (cpu >= max_cpus)
	117	resize_cpu_info(cpu);
	118
	119	return &per_cpu_info[cpu];
	120	}
	121
cfab07eb AB	122	static inline void check_time(struct blk_io_trace *bit)
	123	{
	124	unsigned long long this = bit->time;
	125	unsigned long long last = last_reported_time;
	126
	127	backwards = (this < last) ? 'B' : ' ';
	128	last_reported_time = this;
	129	}
	130
d5396421	131	static inline void account_m(struct per_cpu_info *pci, int rw,
5c017e4b	132	unsigned int bytes)
d0ca268b JA	133	{
d0ca268b JA	134	if (rw) {
d5396421 JA	135	pci->mwrites++;
d5396421 JA	136	pci->qwrite_kb += bytes >> 10;
d0ca268b	137	} else {
d5396421 JA	138	pci->mreads++;
d5396421 JA	139	pci->qread_kb += bytes >> 10;
d0ca268b JA	140	}
	141	}
	142
d5396421	143	static inline void account_q(struct per_cpu_info *pci, int rw,
5c017e4b	144	unsigned int bytes)
d0ca268b JA	145	{
d0ca268b JA	146	if (rw) {
d5396421 JA	147	pci->qwrites++;
d5396421 JA	148	pci->qwrite_kb += bytes >> 10;
d0ca268b	149	} else {
d5396421 JA	150	pci->qreads++;
d5396421 JA	151	pci->qread_kb += bytes >> 10;
d0ca268b JA	152	}
	153	}
	154
d5396421	155	static inline void account_c(struct per_cpu_info *pci, int rw,
5c017e4b	156	unsigned int bytes)
d0ca268b JA	157	{
d0ca268b JA	158	if (rw) {
d5396421 JA	159	pci->cwrites++;
d5396421 JA	160	pci->cwrite_kb += bytes >> 10;
d0ca268b	161	} else {
d5396421 JA	162	pci->creads++;
d5396421 JA	163	pci->cread_kb += bytes >> 10;
d0ca268b JA	164	}
	165	}
	166
d5396421	167	static inline void account_i(struct per_cpu_info *pci, int rw,
afd2d7ad	168	unsigned int bytes)
	169	{
	170	if (rw) {
d5396421 JA	171	pci->iwrites++;
d5396421 JA	172	pci->iwrite_kb += bytes >> 10;
afd2d7ad	173	} else {
d5396421 JA	174	pci->ireads++;
d5396421 JA	175	pci->iread_kb += bytes >> 10;
afd2d7ad	176	}
	177	}
	178
d5396421	179	static void output(struct per_cpu_info pci, char s)
d0ca268b JA	180	{
d0ca268b JA	181	printf("%s", s);
d5396421 JA	182
d5396421 JA	183	if (pci->ofp)
33b56019	184	fprintf(pci->ofp, "%s", s);
d0ca268b JA	185	}
d0ca268b JA	186
3aabcd89 JA	187	static char hstring[256];
3aabcd89 JA	188	static char tstring[256];
d0ca268b	189
d5396421 JA	190	static inline char setup_header(struct per_cpu_info pci,
d5396421 JA	191	struct blk_io_trace *t, char act)
d0ca268b JA	192	{
	193	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);
	194	int b = t->action & BLK_TC_ACT(BLK_TC_BARRIER);
	195	int s = t->action & BLK_TC_ACT(BLK_TC_SYNC);
	196	char rwbs[4];
	197	int i = 0;
	198
	199	if (w)
	200	rwbs[i++] = 'W';
	201	else
	202	rwbs[i++] = 'R';
	203	if (b)
	204	rwbs[i++] = 'B';
	205	if (s)
	206	rwbs[i++] = 'S';
	207
	208	rwbs[i] = '\0';
	209
cfab07eb	210	sprintf(hstring, "%c %3d %15ld %5Lu.%09Lu %5u %c %3s", backwards,
d5396421	211	pci->cpu,
cfab07eb AB	212	(unsigned long)t->sequence, SECONDS(t->time),
cfab07eb AB	213	NANO_SECONDS(t->time), t->pid, act, rwbs);
d0ca268b JA	214
	215	return hstring;
	216	}
	217
d5396421 JA	218	static void log_complete(struct per_cpu_info pci, struct blk_io_trace t,
d5396421 JA	219	char act)
d0ca268b	220	{
d5396421	221	sprintf(tstring,"%s %Lu + %u [%d]\n", setup_header(pci, t, act),
d0ca268b	222	(unsigned long long)t->sector, t->bytes >> 9, t->error);
d5396421	223	output(pci, tstring);
d0ca268b JA	224	}
d0ca268b JA	225
d5396421 JA	226	static void log_queue(struct per_cpu_info pci, struct blk_io_trace t,
d5396421 JA	227	char act)
d0ca268b	228	{
d5396421	229	sprintf(tstring,"%s %Lu + %u\n", setup_header(pci, t, act),
d0ca268b	230	(unsigned long long)t->sector, t->bytes >> 9);
d5396421	231	output(pci, tstring);
d0ca268b JA	232	}
d0ca268b JA	233
d5396421 JA	234	static void log_issue(struct per_cpu_info pci, struct blk_io_trace t,
d5396421 JA	235	char act)
d0ca268b	236	{
d5396421	237	sprintf(tstring,"%s %Lu + %u\n", setup_header(pci, t, act),
d0ca268b	238	(unsigned long long)t->sector, t->bytes >> 9);
d5396421	239	output(pci, tstring);
d0ca268b JA	240	}
d0ca268b JA	241
d5396421 JA	242	static void log_merge(struct per_cpu_info pci, struct blk_io_trace t,
d5396421 JA	243	char act)
d0ca268b	244	{
d5396421	245	sprintf(tstring,"%s %Lu + %u\n", setup_header(pci, t, act),
d0ca268b	246	(unsigned long long)t->sector, t->bytes >> 9);
d5396421	247	output(pci, tstring);
d0ca268b JA	248	}
d0ca268b JA	249
d5396421 JA	250	static void log_generic(struct per_cpu_info pci, struct blk_io_trace t,
d5396421 JA	251	char act)
d0ca268b	252	{
d5396421	253	sprintf(tstring,"%s %Lu + %u\n", setup_header(pci, t, act),
d0ca268b	254	(unsigned long long)t->sector, t->bytes >> 9);
d5396421	255	output(pci, tstring);
d0ca268b JA	256	}
d0ca268b JA	257
d5396421	258	static int log_pc(struct per_cpu_info pci, struct blk_io_trace t, char act)
d0ca268b	259	{
87b72777 JA	260	unsigned char *buf;
87b72777 JA	261	int i;
d0ca268b	262
d5396421 JA	263	sprintf(tstring,"%s ", setup_header(pci, t, act));
d5396421 JA	264	output(pci, tstring);
d0ca268b	265
87b72777	266	buf = (unsigned char ) t + sizeof(t);
d0ca268b JA	267	for (i = 0; i < t->pdu_len; i++) {
d0ca268b JA	268	sprintf(tstring,"%02x ", buf[i]);
d5396421	269	output(pci, tstring);
d0ca268b JA	270	}
	271
	272	if (act == 'C') {
	273	sprintf(tstring,"[%d]", t->error);
d5396421	274	output(pci, tstring);
d0ca268b JA	275	}
	276
	277	printf("\n");
87b72777	278	return 0;
d0ca268b JA	279	}
d0ca268b JA	280
d5396421	281	static int dump_trace_pc(struct blk_io_trace t, struct per_cpu_info pci)
d0ca268b	282	{
87b72777 JA	283	int ret = 0;
87b72777 JA	284
d0ca268b JA	285	switch (t->action & 0xffff) {
d0ca268b JA	286	case __BLK_TA_QUEUE:
d5396421	287	log_generic(pci, t, 'Q');
d0ca268b JA	288	break;
d0ca268b JA	289	case __BLK_TA_GETRQ:
d5396421	290	log_generic(pci, t, 'G');
d0ca268b JA	291	break;
d0ca268b JA	292	case __BLK_TA_SLEEPRQ:
d5396421	293	log_generic(pci, t, 'S');
d0ca268b JA	294	break;
d0ca268b JA	295	case __BLK_TA_REQUEUE:
d5396421	296	log_generic(pci, t, 'R');
d0ca268b JA	297	break;
d0ca268b JA	298	case __BLK_TA_ISSUE:
d5396421	299	ret = log_pc(pci, t, 'D');
d0ca268b JA	300	break;
d0ca268b JA	301	case __BLK_TA_COMPLETE:
d5396421	302	log_pc(pci, t, 'C');
d0ca268b JA	303	break;
	304	default:
	305	fprintf(stderr, "Bad pc action %x\n", t->action);
87b72777 JA	306	ret = 1;
87b72777 JA	307	break;
d0ca268b JA	308	}
d0ca268b JA	309
87b72777	310	return ret;
d0ca268b JA	311	}
d0ca268b JA	312
d5396421	313	static void dump_trace_fs(struct blk_io_trace t, struct per_cpu_info pci)
d0ca268b JA	314	{
	315	int w = t->action & BLK_TC_ACT(BLK_TC_WRITE);
	316
	317	switch (t->action & 0xffff) {
	318	case __BLK_TA_QUEUE:
d5396421 JA	319	account_q(pci, w, t->bytes);
d5396421 JA	320	log_queue(pci, t, 'Q');
d0ca268b JA	321	break;
d0ca268b JA	322	case __BLK_TA_BACKMERGE:
d5396421 JA	323	account_m(pci, w, t->bytes);
d5396421 JA	324	log_merge(pci, t, 'M');
d0ca268b JA	325	break;
d0ca268b JA	326	case __BLK_TA_FRONTMERGE:
d5396421 JA	327	account_m(pci, w, t->bytes);
d5396421 JA	328	log_merge(pci, t, 'F');
d0ca268b JA	329	break;
d0ca268b JA	330	case __BLK_TA_GETRQ:
d5396421	331	log_generic(pci, t, 'G');
d0ca268b JA	332	break;
d0ca268b JA	333	case __BLK_TA_SLEEPRQ:
d5396421	334	log_generic(pci, t, 'S');
d0ca268b JA	335	break;
d0ca268b JA	336	case __BLK_TA_REQUEUE:
d5396421 JA	337	account_c(pci, w, -t->bytes);
d5396421 JA	338	log_queue(pci, t, 'R');
d0ca268b JA	339	break;
d0ca268b JA	340	case __BLK_TA_ISSUE:
d5396421 JA	341	account_i(pci, w, t->bytes);
d5396421 JA	342	log_issue(pci, t, 'D');
d0ca268b JA	343	break;
d0ca268b JA	344	case __BLK_TA_COMPLETE:
d5396421 JA	345	account_c(pci, w, t->bytes);
d5396421 JA	346	log_complete(pci, t, 'C');
d0ca268b JA	347	break;
	348	default:
	349	fprintf(stderr, "Bad fs action %x\n", t->action);
1f79c4a0	350	break;
d0ca268b	351	}
d0ca268b JA	352	}
d0ca268b JA	353
d5396421	354	static int dump_trace(struct blk_io_trace t, struct per_cpu_info pci)
d0ca268b	355	{
87b72777 JA	356	int ret = 0;
87b72777 JA	357
33b56019 JA	358	if (output_name && !pci->ofp) {
	359	snprintf(pci->ofname, sizeof(pci->ofname) - 1,
	360	"%s_log.%d", output_name, pci->cpu);
	361
	362	pci->ofp = fopen(pci->ofname, "w");
	363	if (pci->ofp == NULL) {
	364	perror(pci->ofname);
	365	return 1;
	366	}
	367	}
	368
d0ca268b	369	if (t->action & BLK_TC_ACT(BLK_TC_PC))
d5396421	370	ret = dump_trace_pc(t, pci);
d0ca268b	371	else
d5396421	372	dump_trace_fs(t, pci);
87b72777 JA	373
	374	events++;
	375	return ret;
d0ca268b JA	376	}
d0ca268b JA	377
d5396421	378	static void dump_pci_stats(struct per_cpu_info *pci)
5c017e4b JA	379	{
5c017e4b JA	380	printf("\tReads:\n");
d5396421 JA	381	printf("\t\tQueued: %'8lu, %'8LuKiB\n", pci->qreads, pci->qread_kb);
	382	printf("\t\tDispatched %'8lu, %'8LuKiB\n", pci->ireads, pci->iread_kb);
	383	printf("\t\tCompleted: %'8lu, %'8LuKiB\n", pci->creads, pci->cread_kb);
	384	printf("\t\tMerges: %'8lu\n", pci->mreads);
5c017e4b JA	385
5c017e4b JA	386	printf("\tWrites:\n");
d5396421 JA	387	printf("\t\tQueued: %'8lu, %'8LuKiB\n", pci->qwrites,pci->qwrite_kb);
	388	printf("\t\tDispatched %'8lu, %'8LuKiB\n", pci->iwrites,pci->iwrite_kb);
	389	printf("\t\tCompleted: %'8lu, %'8LuKiB\n", pci->cwrites,pci->cwrite_kb);
	390	printf("\t\tMerges: %'8lu\n", pci->mwrites);
5c017e4b JA	391	}
5c017e4b JA	392
d5396421	393	static void show_stats(void)
d0ca268b	394	{
d5396421	395	struct per_cpu_info foo, *pci;
412819ce	396	int i, pci_events = 0;
5c017e4b JA	397
5c017e4b JA	398	memset(&foo, 0, sizeof(foo));
d0ca268b	399
a718bd37	400	for (i = 0; i < max_cpus; i++) {
d5396421	401	pci = &per_cpu_info[i];
5c017e4b	402
d5396421	403	if (!pci->nelems)
afd2d7ad	404	continue;
afd2d7ad	405
d5396421 JA	406	foo.qreads += pci->qreads;
	407	foo.qwrites += pci->qwrites;
	408	foo.creads += pci->creads;
	409	foo.cwrites += pci->cwrites;
	410	foo.mreads += pci->mreads;
	411	foo.mwrites += pci->mwrites;
	412	foo.qread_kb += pci->qread_kb;
	413	foo.qwrite_kb += pci->qwrite_kb;
	414	foo.cread_kb += pci->cread_kb;
	415	foo.cwrite_kb += pci->cwrite_kb;
5c017e4b JA	416
5c017e4b JA	417	printf("CPU%d:\n", i);
d5396421	418	dump_pci_stats(pci);
412819ce	419	pci_events++;
5c017e4b JA	420	}
5c017e4b JA	421
412819ce	422	if (pci_events > 1) {
5c017e4b	423	printf("Total:\n");
d5396421	424	dump_pci_stats(&foo);
5c017e4b	425	}
d0ca268b JA	426
d0ca268b JA	427	printf("Events: %'Lu\n", events);
d0ca268b JA	428	}
d0ca268b JA	429
3aabcd89	430	static inline int trace_rb_insert(struct trace *t)
8fc0abbc JA	431	{
	432	struct rb_node **p = &rb_root.rb_node;
	433	struct rb_node *parent = NULL;
	434	struct trace *__t;
	435
	436	while (*p) {
	437	parent = *p;
	438	__t = rb_entry(parent, struct trace, rb_node);
	439
	440	if (t->bit->sequence < __t->bit->sequence)
	441	p = &(*p)->rb_left;
	442	else if (t->bit->sequence > __t->bit->sequence)
	443	p = &(*p)->rb_right;
	444	else {
87b72777	445	fprintf(stderr, "sequence alias!\n");
8fc0abbc JA	446	return 1;
	447	}
	448	}
	449
	450	rb_link_node(&t->rb_node, parent, p);
	451	rb_insert_color(&t->rb_node, &rb_root);
	452	return 0;
	453	}
	454
412819ce	455	static int sort_entries(void *traces, unsigned long offset, int nr)
8fc0abbc	456	{
412819ce	457	struct per_cpu_info *pci;
8fc0abbc JA	458	struct blk_io_trace *bit;
	459	struct trace *t;
	460	void *start = traces;
	461	int nelems = 0;
	462
6fe4709e	463	while (traces - start <= offset - sizeof(*bit)) {
412819ce JA	464	if (!nr)
	465	break;
	466
8fc0abbc	467	bit = traces;
6fe4709e	468
8fc0abbc JA	469	t = malloc(sizeof(*t));
	470	t->bit = bit;
	471	memset(&t->rb_node, 0, sizeof(t->rb_node));
	472
6fe4709e JA	473	trace_to_cpu(bit);
6fe4709e JA	474
66fa7233 JA	475	if (verify_trace(bit))
	476	break;
	477
a718bd37	478	pci = get_cpu_info(bit->cpu);
412819ce JA	479	pci->nelems++;
412819ce JA	480
8fc0abbc JA	481	if (trace_rb_insert(t))
	482	return -1;
	483
	484	traces += sizeof(*bit) + bit->pdu_len;
	485	nelems++;
412819ce	486	nr--;
6fe4709e	487	}
8fc0abbc JA	488
	489	return nelems;
	490	}
	491
412819ce JA	492	static void free_entries_rb(void)
	493	{
	494	struct rb_node *n;
	495
	496	while ((n = rb_first(&rb_root)) != NULL) {
	497	struct trace *t = rb_entry(n, struct trace, rb_node);
	498
	499	rb_erase(&t->rb_node, &rb_root);
	500	free(t);
	501	}
	502	}
	503
d5396421	504	static void show_entries_rb(void)
8fc0abbc	505	{
8fc0abbc	506	struct blk_io_trace *bit;
3aabcd89	507	struct rb_node *n;
8fc0abbc JA	508	struct trace *t;
	509	int cpu;
	510
3aabcd89 JA	511	n = rb_first(&rb_root);
	512	if (!n)
	513	return;
8fc0abbc	514
3aabcd89	515	do {
8fc0abbc JA	516	t = rb_entry(n, struct trace, rb_node);
	517	bit = t->bit;
	518
d5396421	519	cpu = bit->cpu;
87b72777	520	if (cpu > max_cpus) {
8fc0abbc	521	fprintf(stderr, "CPU number too large (%d)\n", cpu);
87b72777	522	break;
8fc0abbc JA	523	}
8fc0abbc JA	524
cfab07eb AB	525	if (genesis_time == 0)
	526	genesis_time = bit->time;
	527	bit->time -= genesis_time;
8fc0abbc	528
cfab07eb	529	check_time(bit);
8fc0abbc	530
d5396421	531	if (dump_trace(bit, &per_cpu_info[cpu]))
87b72777 JA	532	break;
87b72777 JA	533
8fc0abbc JA	534	} while ((n = rb_next(n)) != NULL);
	535	}
	536
1f79c4a0 JA	537	static int read_data(int fd, void *buffer, int bytes, int block)
	538	{
	539	int ret, bytes_left, fl;
	540	void *p;
	541
	542	fl = fcntl(fd, F_GETFL);
	543
	544	if (!block)
	545	fcntl(fd, F_SETFL, fl \| O_NONBLOCK);
	546	else
	547	fcntl(fd, F_SETFL, fl & ~O_NONBLOCK);
	548
	549	bytes_left = bytes;
	550	p = buffer;
	551	while (bytes_left > 0) {
	552	ret = read(fd, p, bytes_left);
	553	if (!ret)
	554	return 1;
	555	else if (ret < 0) {
	556	if (errno != EAGAIN)
	557	perror("read");
	558	return -1;
	559	} else {
	560	p += ret;
	561	bytes_left -= ret;
	562	}
	563	}
	564
	565	return 0;
	566	}
	567
d5396421	568	static int do_file(void)
d0ca268b	569	{
a718bd37	570	int i, nfiles;
d0ca268b	571
a718bd37 NS	572	for (i = 0, nfiles = 0;; i++, nfiles++) {
a718bd37 NS	573	struct per_cpu_info *pci;
87b72777 JA	574	struct stat st;
	575	void *tb;
	576
a718bd37	577	pci = get_cpu_info(i);
d5396421 JA	578	pci->cpu = i;
d5396421 JA	579	pci->ofp = NULL;
d0ca268b	580
d5396421 JA	581	snprintf(pci->fname, sizeof(pci->fname)-1,"%s_out.%d", dev, i);
d5396421 JA	582	if (stat(pci->fname, &st) < 0)
d0ca268b	583	break;
afd2d7ad	584	if (!st.st_size)
afd2d7ad	585	continue;
d0ca268b	586
d5396421	587	printf("Processing %s\n", pci->fname);
8fc0abbc	588
87b72777	589	tb = malloc(st.st_size);
8fc0abbc	590
d5396421 JA	591	pci->fd = open(pci->fname, O_RDONLY);
	592	if (pci->fd < 0) {
	593	perror(pci->fname);
3aabcd89	594	break;
d0ca268b	595	}
afd2d7ad	596
1f79c4a0	597	if (read_data(pci->fd, tb, st.st_size, 1))
3aabcd89	598	break;
d0ca268b	599
a718bd37	600	if (sort_entries(tb, st.st_size, ~0U) == -1)
3aabcd89	601	break;
d0ca268b	602
d5396421	603	close(pci->fd);
d5396421 JA	604	printf("\t%2d %10s %15d\n", i, pci->fname, pci->nelems);
	605
	606	}
	607
	608	if (!nfiles) {
	609	fprintf(stderr, "No files found\n");
	610	return 1;
	611	}
	612
	613	show_entries_rb();
d5396421 JA	614	return 0;
	615	}
	616
412819ce	617	static void resize_buffer(void *buffer, long old_size)
d5396421	618	{
412819ce	619	long cur_size = *old_size;
d5396421 JA	620	void *ptr;
d5396421 JA	621
412819ce JA	622	old_size = 2;
	623	ptr = malloc(*old_size);
	624	memcpy(ptr, *buffer, cur_size);
	625	free(*buffer);
	626	*buffer = ptr;
	627	}
d5396421	628
412819ce JA	629	static int read_sort_events(int fd, void **buffer)
	630	{
	631	long offset, max_offset;
	632	int events;
d5396421	633
412819ce JA	634	max_offset = 128 * sizeof(struct blk_io_trace);
	635	*buffer = malloc(max_offset);
	636	events = 0;
	637	offset = 0;
d5396421	638
412819ce JA	639	do {
	640	struct blk_io_trace *t;
	641	int pdu_len;
d5396421	642
412819ce JA	643	if (max_offset - offset < sizeof(*t))
412819ce JA	644	resize_buffer(buffer, &max_offset);
d5396421	645
412819ce JA	646	if (read_data(fd, buffer + offset, sizeof(t), !events)) {
412819ce JA	647	if (events)
d5396421	648	break;
412819ce JA	649
	650	usleep(1000);
	651	continue;
d5396421 JA	652	}
d5396421 JA	653
412819ce JA	654	t = *buffer + offset;
412819ce JA	655	offset += sizeof(*t);
d5396421	656
412819ce	657	pdu_len = be16_to_cpu(t->pdu_len);
d5396421	658
412819ce JA	659	if (max_offset - offset < pdu_len)
412819ce JA	660	resize_buffer(buffer, &max_offset);
d5396421	661
412819ce JA	662	if (read_data(fd, *buffer + offset, pdu_len, 1))
412819ce JA	663	break;
d5396421	664
412819ce JA	665	offset += pdu_len;
	666	events++;
	667	} while (!is_done());
d5396421	668
412819ce JA	669	return events;
412819ce JA	670	}
d5396421	671
412819ce JA	672	static int do_stdin(void)
	673	{
	674	int fd;
	675	void *ptr;
d5396421	676
1f79c4a0	677	fd = dup(STDIN_FILENO);
412819ce JA	678	do {
412819ce JA	679	int events;
d5396421	680
412819ce JA	681	events = read_sort_events(fd, &ptr);
	682	if (!events)
	683	break;
	684
	685	sort_entries(ptr, ~0UL, events);
	686	show_entries_rb();
	687	free_entries_rb();
d5396421 JA	688	} while (1);
	689
	690	close(fd);
	691	free(ptr);
d5396421 JA	692	return 0;
d5396421 JA	693	}
d0ca268b	694
1f79c4a0	695	static void flush_output(void)
412819ce JA	696	{
	697	int i;
	698
a718bd37	699	for (i = 0; i < max_cpus; i++) {
412819ce JA	700	struct per_cpu_info *pci = &per_cpu_info[i];
	701
	702	if (pci->ofp) {
	703	fflush(pci->ofp);
	704	fclose(pci->ofp);
	705	pci->ofp = NULL;
	706	}
	707	}
	708	}
	709
1f79c4a0	710	static void handle_sigint(int sig)
412819ce JA	711	{
	712	done = 1;
	713	flush_output();
	714	}
	715
1f79c4a0 JA	716	static void usage(char *prog)
	717	{
	718	fprintf(stderr, "Usage: %s -i <name> [-o <output>]\n", prog);
	719	}
	720
d5396421 JA	721	int main(int argc, char *argv[])
d5396421 JA	722	{
412819ce	723	int c, ret;
d5396421 JA	724
	725	while ((c = getopt_long(argc, argv, S_OPTS, l_opts, NULL)) != -1) {
	726	switch (c) {
	727	case 'i':
	728	dev = strdup(optarg);
	729	break;
	730	case 'o':
	731	output_name = strdup(optarg);
	732	break;
	733	default:
1f79c4a0	734	usage(argv[0]);
d5396421 JA	735	return 1;
d5396421 JA	736	}
d0ca268b JA	737	}
d0ca268b JA	738
d5396421	739	if (!dev) {
1f79c4a0	740	usage(argv[0]);
d5396421 JA	741	return 1;
	742	}
	743
412819ce JA	744	memset(&rb_root, 0, sizeof(rb_root));
	745
	746	signal(SIGINT, handle_sigint);
	747	signal(SIGHUP, handle_sigint);
	748	signal(SIGTERM, handle_sigint);
d5396421 JA	749
	750	if (!strcmp(dev, "-"))
	751	ret = do_stdin();
	752	else
	753	ret = do_file();
	754
412819ce JA	755	show_stats();
412819ce JA	756	flush_output();
d5396421	757	return ret;
d0ca268b	758	}