2 * block queue tracing application
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 #include <sys/types.h>
36 #define TRACE_TO_STRING(f) {.bit_field = f, .string = #f}
37 static struct trace_info traces[] = {
38 TRACE_TO_STRING( BLK_TC_READ ),
39 TRACE_TO_STRING( BLK_TC_WRITE ),
40 TRACE_TO_STRING( BLK_TC_BARRIER ),
41 TRACE_TO_STRING( BLK_TC_SYNC ),
42 TRACE_TO_STRING( BLK_TC_QUEUE ),
43 TRACE_TO_STRING( BLK_TC_REQUEUE ),
44 TRACE_TO_STRING( BLK_TC_ISSUE ),
45 TRACE_TO_STRING( BLK_TC_COMPLETE ),
46 TRACE_TO_STRING( BLK_TC_FS ),
47 TRACE_TO_STRING( BLK_TC_PC )
49 #define N_TRACES (sizeof(traces) / sizeof(struct trace_info))
56 #define ACT_TO_STRING(f) {.val = f, .string = #f}
57 static struct act_info acts[] = {
58 ACT_TO_STRING( __BLK_TA_QUEUE ),
59 ACT_TO_STRING( __BLK_TA_QUEUE ),
60 ACT_TO_STRING( __BLK_TA_BACKMERGE ),
61 ACT_TO_STRING( __BLK_TA_FRONTMERGE ),
62 ACT_TO_STRING( __BLK_TA_GETRQ ),
63 ACT_TO_STRING( __BLK_TA_SLEEPRQ ),
64 ACT_TO_STRING( __BLK_TA_REQUEUE ),
65 ACT_TO_STRING( __BLK_TA_ISSUE ),
66 ACT_TO_STRING( __BLK_TA_COMPLETE ),
67 ACT_TO_STRING( __BLK_TA_PLUG ),
68 ACT_TO_STRING( __BLK_TA_UNPLUG_IO ),
69 ACT_TO_STRING( __BLK_TA_UNPLUG_TIMER ),
70 ACT_TO_STRING( __BLK_TA_INSERT ),
71 ACT_TO_STRING( __BLK_TA_SPLIT ),
72 ACT_TO_STRING( __BLK_TA_BOUNCE ),
73 ACT_TO_STRING( __BLK_TA_REMAP )
75 #define N_ACTS (sizeof(acts) / sizeof(struct act_info))
77 static char *act_to_str(__u32 action)
79 static char buf[1024];
81 int act = action & 0xffff;
82 int trace = (action >> BLK_TC_SHIFT) & 0xffff;
85 sprintf(buf, "%s ", acts[act].string);
86 for (i = 0; i < N_TRACES; i++)
87 if (trace & (1 << i)) {
89 sprintf(buf2, "| %s ", traces[i].string);
94 sprintf(buf, "Invalid action=%08x", action);
99 static void dump_trace(FILE *ofp, char *prefix, struct blk_io_trace *bit)
101 fprintf(ofp, " Dump %s\n", prefix);
102 fprintf(ofp, " %8s: %08x\n", "magic", bit->magic);
103 fprintf(ofp, " %8s: %u\n", "sequence", bit->sequence);
104 fprintf(ofp, " %8s: %llu\n", "time", bit->time);
105 fprintf(ofp, " %8s: %llu\n", "sector", bit->sector);
106 fprintf(ofp, " %8s: %u\n", "bytes", bit->bytes);
107 fprintf(ofp, " %8s: %s\n", "action", act_to_str(bit->action));
108 fprintf(ofp, " %8s: %u\n", "bytes", bit->bytes);
109 fprintf(ofp, " %8s: %u\n", "cpu", bit->cpu);
110 fprintf(ofp, " %8s: %u\n", "error", bit->error);
111 fprintf(ofp, " %8s: %u\n", "pdu_len", bit->pdu_len);
112 fprintf(ofp, " %8s: (%u,%u)\n\n", "device", MAJOR(bit->device),
116 static int process(FILE *ofp, char *file, int cpu)
118 # define SWAP_BITS() do { \
120 struct blk_io_trace *tmp = bit_save; \
126 bit = malloc(sizeof(struct blk_io_trace)); \
130 # define INC_BAD(str) do { \
132 fprintf(ofp, " ----------------\n"); \
133 if (bit_save) dump_trace(ofp,"seq-1",bit_save); \
134 dump_trace(ofp, str, bit); \
140 __u32 save_device = 0, save_sequence = 0;
142 struct blk_io_trace *bit_save = NULL;
143 struct blk_io_trace *bit = malloc(sizeof(struct blk_io_trace));
144 unsigned int ngood = 0;
145 unsigned int nbad = 0;
146 unsigned int nbad_trace = 0, nbad_pdu = 0, nbad_cpu = 0;
147 unsigned int nbad_seq = 0, nbad_dev = 0, nbad_time = 0;
149 ifp = fopen(file, "r");
150 while ((n = fread(bit, sizeof(struct blk_io_trace), 1, ifp)) == 1) {
152 if (verify_trace(bit)) {
153 INC_BAD("bad trace");
160 pdu_buf = malloc(bit->pdu_len);
161 n = fread(pdu_buf, bit->pdu_len, 1, ifp);
170 if (bit->cpu != cpu) {
177 if (bit->sequence <= save_sequence) {
182 else if (bit->time <= save_time) {
183 INC_BAD("time regression");
187 else if (bit->device != save_device) {
194 save_sequence = bit->sequence;
195 save_time = bit->time;
196 save_device = bit->device;
203 fprintf(stderr,"%s: fread failed %d/%s\n",
204 file, errno, strerror(errno));
207 fprintf(ofp, " ---------------------\n");
208 fprintf(ofp, " Summary for cpu %d:\n", cpu);
209 fprintf(ofp, " %10d valid + %10d invalid (%5.1f%%) processed\n\n",
211 ngood ? 100.0 * (float)ngood / (float)(ngood + nbad) : 0.0);
215 fprintf(ofp, "%8s %d traces\n", "", nbad_trace);
217 fprintf(ofp, "%8s %d pdu\n", "", nbad_pdu);
219 fprintf(ofp, "%8s %d cpu\n", "", nbad_cpu);
221 fprintf(ofp, "%8s %d seq\n", "", nbad_seq);
223 fprintf(ofp, "%8s %d dev\n", "", nbad_dev);
225 fprintf(ofp, "%8s %d time\n", "", nbad_time);
232 int main(int argc, char *argv[])
238 char *ofname = malloc(1024);
239 char *fname = malloc(1024);
242 fprintf(stderr,"FATAL: Need device name(s)\n");
243 fprintf(stderr,"Usage: blkrawverify <dev> [<dev>...]\n");
247 for (i = 1; i < argc; i++) {
249 sprintf(ofname, "%s.verify.out", devname);
250 ofp = fopen(ofname, "w");
252 fprintf(stderr,"Failed to open %s (%s), skipping %s\n",
253 ofname, strerror(errno), devname);
257 fprintf(ofp, "\n---------------\n" );
258 fprintf(ofp, "Verifying %s\n", devname);
259 printf("Verifying %s\n", devname); fflush(stdout);
260 for (cpu = 0; ; cpu++) {
261 sprintf(fname, "%s.blktrace.%d", devname, cpu);
262 if (stat(fname, &st) < 0)
264 printf(" CPU %d ", cpu); fflush(stdout);
265 nbad = process(ofp, fname, cpu);
267 printf("-- %d bad", nbad);