Merge branch 'master' of ssh://git.kernel.dk/data/git/blktrace

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

struct params {
	struct io *c_iop;
	struct list_head *rmhd;
};

void __run_issue(struct io *im_iop, struct io *d_iop, void *param)
{
	struct params *p = param;

	update_i2d(im_iop, tdelta(im_iop, d_iop));
	run_im(im_iop, p->c_iop, p->rmhd);
	dump_iop(d_iop, 0);
	list_add_tail(&d_iop->f_head, p->rmhd);
}

void __run_unissue(struct io *im_iop, struct io *d_iop, void *param)
{
	struct params *p = param;

	unupdate_i2d(im_iop, tdelta(im_iop, d_iop));
	run_unim(im_iop, p->rmhd);
	list_add_tail(&d_iop->f_head, p->rmhd);
}

void run_issue(struct io *d_iop, struct io *c_iop, void *param)
{
	struct params p = {
		.c_iop = c_iop,
		.rmhd = (struct list_head *)param
	};
	bilink_for_each_down(__run_issue, d_iop, &p, 1);
}

void run_unissue(struct io *d_iop, struct list_head *rmhd)
{
	struct params p = {
		.c_iop = NULL,
		.rmhd = rmhd
	};
	bilink_for_each_down(__run_unissue, d_iop, &p, 1);
}

int ready_issue(struct io *d_iop, struct io *c_iop)
{
	if (d_iop->bytes_left > 0) {
		LIST_HEAD(head);
		struct io *im_iop;
		struct list_head *p, *q;

		dip_foreach_list(d_iop, IOP_I, &head);
		dip_foreach_list(d_iop, IOP_M, &head);
		list_for_each_safe(p, q, &head) {
			im_iop = list_entry(p, struct io, f_head);
			LIST_DEL(&im_iop->f_head);

			ASSERT(d_iop->bytes_left >= im_iop->t.bytes);
			if (ready_im(im_iop, c_iop)) {
				bilink(im_iop, d_iop);
				dip_rem(im_iop);
				d_iop->bytes_left -= im_iop->t.bytes;
			}
		}
	}

	return d_iop->bytes_left == 0;
}

void trace_issue(struct io *d_iop)
{
	if (io_setup(d_iop, IOP_D)) {
		seeki_add(d_iop->dip->seek_handle, d_iop);
		iostat_issue(d_iop);
		d_iop->dip->n_ds++;
	}
	else
		io_release(d_iop);

}