[blktrace.git] / btt / misc.c

/*
 * blktrace output analysis: generate a timeline & gather statistics
 *
 * Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com>
 *
 *  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 <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>

#define INLINE_DECLARE
#include "globals.h"

int data_is_native = -1;

struct blk_io_trace *convert_to_cpu(struct blk_io_trace *t)
{
	if (data_is_native == -1)
		check_data_endianness(t->magic);

	trace_to_cpu(t);

	ASSERT(CHECK_MAGIC(t));
	ASSERT((t->magic & 0xff) == SUPPORTED_VERSION);

	return t;
}

int in_devices(struct blk_io_trace *t)
{
	int i;
	unsigned int mjr, mnr;
	char *p = devices;

	if (p == NULL) return 1;	/* Allow anything */

	for (;;) {
		i = sscanf(p, "%u,%u;", &mjr, &mnr);
		ASSERT(i == 2);

		if ((mjr == MAJOR(t->device) && (mnr == MINOR(t->device))))
			return 1;

		p = strchr(p, ';');
		if (!p)
			break;
		p++;
	}

	return 0;
}

unsigned int do_read(int ifd, void *buf, int len)
{
	int n;

	n = read(ifd, buf, len);
	if (n < 0) {
		perror(input_name);
		return 1;
	}
	else if (0 < n && n < len) {
		fprintf(stderr,"Short read on %s\n", input_name);
		return 1;
	}
	else if (n == 0) /* EOF */
		return 1;

	return 0;
}

void add_file(struct file_info **fipp, FILE *fp, char *oname)
{
	struct file_info *fip;
	
	fip = malloc(sizeof(struct file_info) + strlen(oname) + 1);

	fip->next = *fipp;
	*fipp = fip;

	fip->ofp = fp;
	strcpy(fip->oname, oname);
}

void clean_files(struct file_info **fipp)
{
	struct stat buf;
	struct file_info *fip;

	while ((fip = *fipp) != NULL) {
		*fipp = fip->next;

		fclose(fip->ofp);
		if (!stat(fip->oname, &buf) && (buf.st_size == 0))
			unlink(fip->oname);
		free(fip);
	}
}

void dbg_ping(void) {}
Commit	Line	Data
63eba147 JA	1	/*
	2	* blktrace output analysis: generate a timeline & gather statistics
	3	*
	4	* Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com>
	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	*/
	21	#include <stdio.h>
	22	#include <string.h>
b2ecdd0f ADB	23	#include <sys/types.h>
b2ecdd0f ADB	24	#include <sys/stat.h>
63eba147 JA	25	#include <unistd.h>
	26
	27	#define INLINE_DECLARE
	28	#include "globals.h"
	29
	30	int data_is_native = -1;
	31
	32	struct blk_io_trace convert_to_cpu(struct blk_io_trace t)
	33	{
	34	if (data_is_native == -1)
	35	check_data_endianness(t->magic);
	36
	37	trace_to_cpu(t);
	38
	39	ASSERT(CHECK_MAGIC(t));
	40	ASSERT((t->magic & 0xff) == SUPPORTED_VERSION);
	41
	42	return t;
	43	}
	44
	45	int in_devices(struct blk_io_trace *t)
	46	{
	47	int i;
	48	unsigned int mjr, mnr;
	49	char *p = devices;
	50
	51	if (p == NULL) return 1; /* Allow anything */
	52
	53	for (;;) {
	54	i = sscanf(p, "%u,%u;", &mjr, &mnr);
	55	ASSERT(i == 2);
	56
	57	if ((mjr == MAJOR(t->device) && (mnr == MINOR(t->device))))
	58	return 1;
	59
	60	p = strchr(p, ';');
	61	if (!p)
	62	break;
	63	p++;
	64	}
	65
	66	return 0;
	67	}
	68
	69	unsigned int do_read(int ifd, void *buf, int len)
	70	{
	71	int n;
	72
	73	n = read(ifd, buf, len);
	74	if (n < 0) {
	75	perror(input_name);
	76	return 1;
	77	}
	78	else if (0 < n && n < len) {
	79	fprintf(stderr,"Short read on %s\n", input_name);
	80	return 1;
	81	}
	82	else if (n == 0) /* EOF */
	83	return 1;
	84
	85	return 0;
	86	}
b2ecdd0f ADB	87
	88	void add_file(struct file_info *fipp, FILE fp, char *oname)
	89	{
6eb42155 ADB	90	struct file_info *fip;
	91
	92	fip = malloc(sizeof(struct file_info) + strlen(oname) + 1);
b2ecdd0f	93
b2ecdd0f ADB	94	fip->next = *fipp;
b2ecdd0f ADB	95	*fipp = fip;
6eb42155 ADB	96
	97	fip->ofp = fp;
	98	strcpy(fip->oname, oname);
b2ecdd0f ADB	99	}
	100
	101	void clean_files(struct file_info **fipp)
	102	{
	103	struct stat buf;
	104	struct file_info *fip;
	105
	106	while ((fip = *fipp) != NULL) {
	107	*fipp = fip->next;
	108
	109	fclose(fip->ofp);
	110	if (!stat(fip->oname, &buf) && (buf.st_size == 0))
	111	unlink(fip->oname);
b2ecdd0f ADB	112	free(fip);
	113	}
	114	}
6eb42155 ADB	115
6eb42155 ADB	116	void dbg_ping(void) {}