2 * blktrace output analysis: generate a timeline & gather statistics
4 * Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com>
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.
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.
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
25 struct list_head *rmhd;
28 void __run_issue(struct io *im_iop, struct io *d_iop, void *param)
30 struct params *p = param;
32 update_i2d(im_iop, tdelta(im_iop, d_iop));
33 run_im(im_iop, p->c_iop, p->rmhd);
35 list_add_tail(&d_iop->f_head, p->rmhd);
38 void __run_unissue(struct io *im_iop, struct io *d_iop, void *param)
40 struct params *p = param;
42 unupdate_i2d(im_iop, tdelta(im_iop, d_iop));
43 run_unim(im_iop, p->rmhd);
44 list_add_tail(&d_iop->f_head, p->rmhd);
47 void run_issue(struct io *d_iop, struct io *c_iop, void *param)
51 .rmhd = (struct list_head *)param
53 bilink_for_each_down(__run_issue, d_iop, &p, 1);
56 void run_unissue(struct io *d_iop, struct list_head *rmhd)
62 bilink_for_each_down(__run_unissue, d_iop, &p, 1);
65 int ready_issue(struct io *d_iop, struct io *c_iop)
67 if (d_iop->bytes_left > 0) {
70 struct list_head *p, *q;
72 dip_foreach_list(d_iop, IOP_I, &head);
73 dip_foreach_list(d_iop, IOP_M, &head);
74 list_for_each_safe(p, q, &head) {
75 im_iop = list_entry(p, struct io, f_head);
76 LIST_DEL(&im_iop->f_head);
78 if (ready_im(im_iop, c_iop)) {
79 ASSERT(d_iop->bytes_left >= im_iop->t.bytes);
80 bilink(im_iop, d_iop);
82 d_iop->bytes_left -= im_iop->t.bytes;
87 return d_iop->bytes_left == 0;
90 void trace_issue(struct io *d_iop)
92 if (io_setup(d_iop, IOP_D)) {
93 seeki_add(d_iop->dip->seek_handle, d_iop);