[blktrace.git] / btt / devs.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 "globals.h"

#define N_DEV_HASH	128
#define DEV_HASH(dev)	((MAJOR(dev) ^ MINOR(dev)) & (N_DEV_HASH - 1))
struct list_head	dev_heads[N_DEV_HASH];

static inline void *dip_rb_mkhds(void)
{
	size_t len = N_IOP_TYPES * sizeof(struct rb_root);
	return memset(malloc(len), 0, len);
}

static void __destroy(struct rb_node *n)
{
	if (n) {
		struct io *iop = rb_entry(n, struct io, rb_node);

		__destroy(n->rb_left);
		__destroy(n->rb_right);
		io_release(iop);
	}
}

static void __destroy_heads(struct rb_root *roots)
{
	int i;

	for (i = 0; i < N_IOP_TYPES; i++)
		__destroy(roots[i].rb_node);

	free(roots);
}

void init_dev_heads(void)
{
	int i;
	for (i = 0; i < N_DEV_HASH; i++)
		INIT_LIST_HEAD(&dev_heads[i]);
}

struct d_info *__dip_find(__u32 device)
{
	struct d_info *dip;
	struct list_head *p;

	__list_for_each(p, &dev_heads[DEV_HASH(device)]) {
		dip = list_entry(p, struct d_info, hash_head);
		if (device == dip->device)
			return dip;
	}

	return NULL;
}

void __dip_exit(struct d_info *dip)
{
	list_del(&dip->all_head);
	__destroy_heads(dip->heads);
	region_exit(&dip->regions);
	seeki_free(dip->seek_handle);
	seeki_free(dip->q2q_handle);
	aqd_free(dip->aqd_handle);
	plat_free(dip->q2d_plat_handle);
	plat_free(dip->q2c_plat_handle);
	plat_free(dip->d2c_plat_handle);
	bno_dump_free(dip->bno_dump_handle);
	unplug_hist_free(dip->up_hist_handle);
	rstat_free(dip->rstat_handle);
	if (output_all_data)
		q2d_free(dip->q2d_priv);
	if (dip->pit_fp)
		fclose(dip->pit_fp);
	free(dip);
}

void dip_exit(void)
{
	struct list_head *p, *q;

	list_for_each_safe(p, q, &all_devs) {
		struct d_info *dip = list_entry(p, struct d_info, all_head);
		__dip_exit(dip);
	}
}

static inline FILE *open_pit(struct d_info *dip)
{
	FILE *fp;
	char str[256];

	sprintf(str, "%s_pit.dat", dip->dip_name);
	if ((fp = my_fopen(str, "w")) == NULL)
		perror(str);

	return fp;
}

struct d_info *dip_alloc(__u32 device, struct io *iop)
{
	struct d_info *dip = __dip_find(device);

	if (dip == NULL) {
		dip = malloc(sizeof(struct d_info));
		memset(dip, 0, sizeof(*dip));
		dip->device = device;
		dip->devmap = dev_map_find(device);
		dip->last_q = (__u64)-1;
		dip->heads = dip_rb_mkhds();
		region_init(&dip->regions);
		dip->start_time = BIT_TIME(iop->t.time);
		dip->pre_culling = 1;

		mkhandle(dip, dip->dip_name, 256);

		latency_alloc(dip);
		dip->aqd_handle = aqd_alloc(dip);
		dip->bno_dump_handle = bno_dump_alloc(dip);
		dip->up_hist_handle = unplug_hist_alloc(dip);
		dip->seek_handle = seeki_alloc(dip, "_d2d");
		dip->q2q_handle = seeki_alloc(dip, "_q2q");
		dip->q2d_plat_handle = plat_alloc(dip, "_q2d");
		dip->q2c_plat_handle = plat_alloc(dip, "_q2c");
		dip->d2c_plat_handle = plat_alloc(dip, "_d2c");
		dip->rstat_handle = rstat_alloc(dip);

		if (per_io_trees)
			dip->pit_fp = open_pit(dip);

		if (output_all_data)
			dip->q2d_priv = q2d_alloc();

		list_add_tail(&dip->hash_head, &dev_heads[DEV_HASH(device)]);
		list_add_tail(&dip->all_head, &all_devs);
		n_devs++;
	}

	if (dip->pre_culling) {
		if (iop->type == IOP_Q || iop->type == IOP_A)
			dip->pre_culling = 0;
		else
			return NULL;
	}

	iop->linked = dip_rb_ins(dip, iop);
	dip->end_time = BIT_TIME(iop->t.time);

	return dip;
}

void iop_rem_dip(struct io *iop)
{
	if (iop->linked) {
		dip_rb_rem(iop);
		iop->linked = 0;
	}
}

void dip_foreach(struct io *iop, enum iop_type type,
		 void (*fnc)(struct io *iop, struct io *this), int rm_after)
{
	if (rm_after) {
		LIST_HEAD(head);
		struct io *this;
		struct list_head *p, *q;

		dip_rb_fe(iop->dip, type, iop, fnc, &head);
		list_for_each_safe(p, q, &head) {
			this = list_entry(p, struct io, f_head);
			list_del(&this->f_head);
			io_release(this);
		}
	} else
		dip_rb_fe(iop->dip, type, iop, fnc, NULL);
}

void dip_foreach_list(struct io *iop, enum iop_type type, struct list_head *hd)
{
	dip_rb_fe(iop->dip, type, iop, NULL, hd);
}

struct io *dip_find_sec(struct d_info *dip, enum iop_type type, __u64 sec)
{
	return dip_rb_find_sec(dip, type, sec);
}

void dip_foreach_out(void (*func)(struct d_info *, void *), void *arg)
{
	if (devices == NULL) {
		struct list_head *p;
		__list_for_each(p, &all_devs)
			func(list_entry(p, struct d_info, all_head), arg);
	} else {
		int i;
		struct d_info *dip;
		unsigned int mjr, mnr;
		char *p = devices;

		while (p && ((i = sscanf(p, "%u,%u", &mjr, &mnr)) == 2)) {
			dip = __dip_find((__u32)((mjr << MINORBITS) | mnr));
			func(dip, arg);
			p = strchr(p, ';');
			if (p) p++;
		}
	}
}

void dip_plug(__u32 dev, double cur_time)
{
	struct d_info *dip = __dip_find(dev);

	if (dip && !dip->is_plugged) {
		dip->is_plugged = 1;
		dip->last_plug = cur_time;
	}
}

static inline void unplug(struct d_info *dip, double cur_time)
{
	dip->is_plugged = 0;
	dip->plugged_time += (cur_time - dip->last_plug);
}

void dip_unplug(__u32 dev, double cur_time, __u64 nios_up)
{
	struct d_info *dip = __dip_find(dev);

	if (dip && dip->is_plugged) {
		dip->nplugs++;
		dip->nios_up += nios_up;
		unplug(dip, cur_time);
	}
}

void dip_unplug_tm(__u32 dev, double cur_time, __u64 nios_up)
{
	struct d_info *dip = __dip_find(dev);

	if (dip && dip->is_plugged) {
		dip->nios_upt += nios_up;
		dip->nplugs_t++;
		unplug(dip, cur_time);
	}
}

void dip_cleanup(void)
{
	struct list_head *p, *q;

	list_for_each_safe(p, q, &all_devs) {
		struct d_info *dip = list_entry(p, struct d_info, all_head);

		if (dip->n_qs == 0 && dip->n_ds == 0)
			__dip_exit(dip);
	}
}
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>
63eba147 JA	22	#include "globals.h"
	23
	24	#define N_DEV_HASH 128
	25	#define DEV_HASH(dev) ((MAJOR(dev) ^ MINOR(dev)) & (N_DEV_HASH - 1))
6eb42155	26	struct list_head dev_heads[N_DEV_HASH];
63eba147	27
69040794 AB	28	static inline void *dip_rb_mkhds(void)
	29	{
	30	size_t len = N_IOP_TYPES * sizeof(struct rb_root);
	31	return memset(malloc(len), 0, len);
	32	}
	33
	34	static void __destroy(struct rb_node *n)
	35	{
	36	if (n) {
	37	struct io *iop = rb_entry(n, struct io, rb_node);
	38
	39	__destroy(n->rb_left);
	40	__destroy(n->rb_right);
	41	io_release(iop);
	42	}
	43	}
	44
	45	static void __destroy_heads(struct rb_root *roots)
	46	{
	47	int i;
	48
	49	for (i = 0; i < N_IOP_TYPES; i++)
	50	__destroy(roots[i].rb_node);
	51
	52	free(roots);
	53	}
	54
6eb42155	55	void init_dev_heads(void)
63eba147 JA	56	{
63eba147 JA	57	int i;
63eba147 JA	58	for (i = 0; i < N_DEV_HASH; i++)
	59	INIT_LIST_HEAD(&dev_heads[i]);
	60	}
	61
	62	struct d_info *__dip_find(__u32 device)
	63	{
63eba147	64	struct d_info *dip;
d76c5b81	65	struct list_head *p;
63eba147	66
63eba147 JA	67	__list_for_each(p, &dev_heads[DEV_HASH(device)]) {
	68	dip = list_entry(p, struct d_info, hash_head);
	69	if (device == dip->device)
	70	return dip;
	71	}
	72
	73	return NULL;
	74	}
	75
52481561 AB	76	void __dip_exit(struct d_info *dip)
	77	{
	78	list_del(&dip->all_head);
	79	__destroy_heads(dip->heads);
	80	region_exit(&dip->regions);
c053af42 AB	81	seeki_free(dip->seek_handle);
	82	seeki_free(dip->q2q_handle);
	83	aqd_free(dip->aqd_handle);
	84	plat_free(dip->q2d_plat_handle);
	85	plat_free(dip->q2c_plat_handle);
	86	plat_free(dip->d2c_plat_handle);
	87	bno_dump_free(dip->bno_dump_handle);
	88	unplug_hist_free(dip->up_hist_handle);
dbb8d92d	89	rstat_free(dip->rstat_handle);
52481561	90	if (output_all_data)
c053af42	91	q2d_free(dip->q2d_priv);
52481561 AB	92	if (dip->pit_fp)
	93	fclose(dip->pit_fp);
	94	free(dip);
	95	}
	96
69040794 AB	97	void dip_exit(void)
69040794 AB	98	{
69040794 AB	99	struct list_head p, q;
	100
	101	list_for_each_safe(p, q, &all_devs) {
52481561 AB	102	struct d_info *dip = list_entry(p, struct d_info, all_head);
52481561 AB	103	__dip_exit(dip);
69040794 AB	104	}
	105	}
	106
a155ab98	107	static inline FILE open_pit(struct d_info dip)
4c48f14e	108	{
a155ab98 AB	109	FILE *fp;
a155ab98 AB	110	char str[256];
4c48f14e	111
a155ab98 AB	112	sprintf(str, "%s_pit.dat", dip->dip_name);
a155ab98 AB	113	if ((fp = my_fopen(str, "w")) == NULL)
a22df989 AB	114	perror(str);
	115
	116	return fp;
	117	}
	118
c053af42	119	struct d_info dip_alloc(__u32 device, struct io iop)
63eba147 JA	120	{
	121	struct d_info *dip = __dip_find(device);
	122
	123	if (dip == NULL) {
6eb42155	124	dip = malloc(sizeof(struct d_info));
2fa934ce	125	memset(dip, 0, sizeof(*dip));
63eba147	126	dip->device = device;
c053af42	127	dip->devmap = dev_map_find(device);
a155ab98 AB	128	dip->last_q = (__u64)-1;
	129	dip->heads = dip_rb_mkhds();
	130	region_init(&dip->regions);
b2822cea	131	dip->start_time = BIT_TIME(iop->t.time);
11997716	132	dip->pre_culling = 1;
a155ab98 AB	133
	134	mkhandle(dip, dip->dip_name, 256);
	135
	136	latency_alloc(dip);
	137	dip->aqd_handle = aqd_alloc(dip);
	138	dip->bno_dump_handle = bno_dump_alloc(dip);
	139	dip->up_hist_handle = unplug_hist_alloc(dip);
	140	dip->seek_handle = seeki_alloc(dip, "_d2d");
	141	dip->q2q_handle = seeki_alloc(dip, "_q2q");
	142	dip->q2d_plat_handle = plat_alloc(dip, "_q2d");
	143	dip->q2c_plat_handle = plat_alloc(dip, "_q2c");
	144	dip->d2c_plat_handle = plat_alloc(dip, "_d2c");
	145	dip->rstat_handle = rstat_alloc(dip);
	146
	147	if (per_io_trees)
	148	dip->pit_fp = open_pit(dip);
	149
951ea56c	150	if (output_all_data)
c053af42	151	dip->q2d_priv = q2d_alloc();
a155ab98 AB	152
	153	list_add_tail(&dip->hash_head, &dev_heads[DEV_HASH(device)]);
	154	list_add_tail(&dip->all_head, &all_devs);
63eba147 JA	155	n_devs++;
	156	}
	157
11997716 AB	158	if (dip->pre_culling) {
	159	if (iop->type == IOP_Q \|\| iop->type == IOP_A)
	160	dip->pre_culling = 0;
	161	else
	162	return NULL;
	163	}
	164
095181f2	165	iop->linked = dip_rb_ins(dip, iop);
b2822cea	166	dip->end_time = BIT_TIME(iop->t.time);
c8b0b334	167
63eba147 JA	168	return dip;
63eba147 JA	169	}
6eb42155	170
c053af42	171	void iop_rem_dip(struct io *iop)
6eb42155	172	{
d76c5b81 AB	173	if (iop->linked) {
	174	dip_rb_rem(iop);
	175	iop->linked = 0;
	176	}
6eb42155 ADB	177	}
6eb42155 ADB	178
8b10aae0	179	void dip_foreach(struct io *iop, enum iop_type type,
6eb42155 ADB	180	void (fnc)(struct io iop, struct io *this), int rm_after)
	181	{
	182	if (rm_after) {
	183	LIST_HEAD(head);
	184	struct io *this;
	185	struct list_head p, q;
	186
	187	dip_rb_fe(iop->dip, type, iop, fnc, &head);
	188	list_for_each_safe(p, q, &head) {
	189	this = list_entry(p, struct io, f_head);
8b10aae0	190	list_del(&this->f_head);
6eb42155 ADB	191	io_release(this);
6eb42155 ADB	192	}
c053af42	193	} else
6eb42155 ADB	194	dip_rb_fe(iop->dip, type, iop, fnc, NULL);
	195	}
	196
095181f2 JA	197	void dip_foreach_list(struct io iop, enum iop_type type, struct list_head hd)
	198	{
	199	dip_rb_fe(iop->dip, type, iop, NULL, hd);
	200	}
	201
6eb42155 ADB	202	struct io dip_find_sec(struct d_info dip, enum iop_type type, __u64 sec)
	203	{
	204	return dip_rb_find_sec(dip, type, sec);
	205	}
	206
	207	void dip_foreach_out(void (func)(struct d_info , void ), void arg)
	208	{
	209	if (devices == NULL) {
	210	struct list_head *p;
	211	__list_for_each(p, &all_devs)
	212	func(list_entry(p, struct d_info, all_head), arg);
c053af42	213	} else {
6eb42155 ADB	214	int i;
	215	struct d_info *dip;
	216	unsigned int mjr, mnr;
	217	char *p = devices;
	218
	219	while (p && ((i = sscanf(p, "%u,%u", &mjr, &mnr)) == 2)) {
	220	dip = __dip_find((__u32)((mjr << MINORBITS) \| mnr));
6eb42155	221	func(dip, arg);
6eb42155 ADB	222	p = strchr(p, ';');
	223	if (p) p++;
	224	}
	225	}
	226	}
b2822cea AB	227
	228	void dip_plug(__u32 dev, double cur_time)
	229	{
	230	struct d_info *dip = __dip_find(dev);
	231
bb4a6607 AB	232	if (dip && !dip->is_plugged) {
	233	dip->is_plugged = 1;
	234	dip->last_plug = cur_time;
	235	}
	236	}
b2822cea	237
bb4a6607 AB	238	static inline void unplug(struct d_info *dip, double cur_time)
	239	{
	240	dip->is_plugged = 0;
	241	dip->plugged_time += (cur_time - dip->last_plug);
b2822cea AB	242	}
b2822cea AB	243
b70a6642	244	void dip_unplug(__u32 dev, double cur_time, __u64 nios_up)
b2822cea AB	245	{
	246	struct d_info *dip = __dip_find(dev);
	247
00a47cd1 AB	248	if (dip && dip->is_plugged) {
00a47cd1 AB	249	dip->nplugs++;
b70a6642	250	dip->nios_up += nios_up;
bb4a6607	251	unplug(dip, cur_time);
00a47cd1 AB	252	}
00a47cd1 AB	253	}
b2822cea	254
15d67efc	255	void dip_unplug_tm(__u32 dev, double cur_time, __u64 nios_up)
00a47cd1 AB	256	{
00a47cd1 AB	257	struct d_info *dip = __dip_find(dev);
b2822cea	258
b70a6642	259	if (dip && dip->is_plugged) {
b70a6642 AB	260	dip->nios_upt += nios_up;
b70a6642 AB	261	dip->nplugs_t++;
bb4a6607	262	unplug(dip, cur_time);
b70a6642	263	}
b2822cea	264	}
52481561 AB	265
	266	void dip_cleanup(void)
	267	{
	268	struct list_head p, q;
	269
	270	list_for_each_safe(p, q, &all_devs) {
	271	struct d_info *dip = list_entry(p, struct d_info, all_head);
	272
	273	if (dip->n_qs == 0 && dip->n_ds == 0)
	274	__dip_exit(dip);
	275	}
	276	}