[fio.git] / log.c

/*
 * Code related to writing an iolog of what a thread is doing, and to
 * later read that back and replay
 */
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "list.h"
#include "fio.h"

static const char iolog_ver2[] = "fio version 2 iolog";

void log_io_u(struct thread_data *td, struct io_u *io_u)
{
	const char *act[] = { "read", "write", "sync" };

	assert(io_u->ddir < 3);

	if (!td->o.write_iolog_file)
		return;

	fprintf(td->iolog_f, "%s %s %llu %lu\n", io_u->file->file_name,
						act[io_u->ddir], io_u->offset,
						io_u->buflen);
}

void log_file(struct thread_data *td, struct fio_file *f,
	      enum file_log_act what)
{
	const char *act[] = { "add", "open", "close" };

	assert(what < 3);

	if (!td->o.write_iolog_file)
		return;

	fprintf(td->iolog_f, "%s %s\n", f->file_name, act[what]);
}

static void iolog_delay(struct thread_data *td, unsigned long delay)
{
	unsigned long usec = utime_since_now(&td->last_issue);

	if (delay < usec)
		return;

	delay -= usec;

	/*
	 * less than 100 usec delay, just regard it as noise
	 */
	if (delay < 100)
		return;

	usec_sleep(td, delay);
}

int read_iolog_get(struct thread_data *td, struct io_u *io_u)
{
	struct io_piece *ipo;

	while (!list_empty(&td->io_log_list)) {
		ipo = list_entry(td->io_log_list.next, struct io_piece, list);
		list_del(&ipo->list);

		/*
		 * invalid ddir, this is a file action
		 */
		if (ipo->ddir == DDIR_INVAL) {
			struct fio_file *f = td->files[ipo->fileno];

			if (ipo->file_action == FIO_LOG_OPEN_FILE) {
				assert(!td_io_open_file(td, f));
				free(ipo);
				continue;
			} else if (ipo->file_action == FIO_LOG_CLOSE_FILE) {
				td_io_close_file(td, f);
				free(ipo);
				continue;
			}
		}

		io_u->offset = ipo->offset;
		io_u->buflen = ipo->len;
		io_u->ddir = ipo->ddir;
		io_u->file = td->files[ipo->fileno];
		get_file(io_u->file);

		dprint(FD_IO, "iolog: get %llu/%lu/%s\n", io_u->offset,
					io_u->buflen, io_u->file->file_name);

		if (ipo->delay)
			iolog_delay(td, ipo->delay);

		free(ipo);
		return 0;
	}

	td->done = 1;
	return 1;
}

void prune_io_piece_log(struct thread_data *td)
{
	struct io_piece *ipo;
	struct rb_node *n;

	while ((n = rb_first(&td->io_hist_tree)) != NULL) {
		ipo = rb_entry(n, struct io_piece, rb_node);
		rb_erase(n, &td->io_hist_tree);
		free(ipo);
	}

	while (!list_empty(&td->io_hist_list)) {
		ipo = list_entry(td->io_hist_list.next, struct io_piece, list);
		list_del(&ipo->list);
		free(ipo);
	}
}

/*
 * log a successful write, so we can unwind the log for verify
 */
void log_io_piece(struct thread_data *td, struct io_u *io_u)
{
	struct rb_node **p, *parent;
	struct io_piece *ipo, *__ipo;

	ipo = malloc(sizeof(struct io_piece));
	ipo->file = io_u->file;
	ipo->offset = io_u->offset;
	ipo->len = io_u->buflen;

	/*
	 * We don't need to sort the entries, if:
	 *
	 *	Sequential writes, or
	 *	Random writes that lay out the file as it goes along
	 *
	 * For both these cases, just reading back data in the order we
	 * wrote it out is the fastest.
	 */
	if (!td_random(td) || !td->o.overwrite) {
		INIT_LIST_HEAD(&ipo->list);
		list_add_tail(&ipo->list, &td->io_hist_list);
		return;
	}

	RB_CLEAR_NODE(&ipo->rb_node);
	p = &td->io_hist_tree.rb_node;
	parent = NULL;

	/*
	 * Sort the entry into the verification list
	 */
	while (*p) {
		parent = *p;

		__ipo = rb_entry(parent, struct io_piece, rb_node);
		if (ipo->offset <= __ipo->offset)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&ipo->rb_node, parent, p);
	rb_insert_color(&ipo->rb_node, &td->io_hist_tree);
}

void write_iolog_close(struct thread_data *td)
{
	fflush(td->iolog_f);
	fclose(td->iolog_f);
	free(td->iolog_buf);
	td->iolog_f = NULL;
	td->iolog_buf = NULL;
}

/*
 * Read version 2 iolog data. It is enhanced to include per-file logging,
 * syncs, etc.
 */
static int read_iolog2(struct thread_data *td, FILE *f)
{
	unsigned long long offset;
	unsigned int bytes;
	int reads, writes, fileno = 0, file_action = 0; /* stupid gcc */
	char *fname, *act;
	char *str, *p;
	enum fio_ddir rw;

	free_release_files(td);

	/*
	 * Read in the read iolog and store it, reuse the infrastructure
	 * for doing verifications.
	 */
	str = malloc(4096);
	fname = malloc(256+16);
	act = malloc(256+16);

	reads = writes = 0;
	while ((p = fgets(str, 4096, f)) != NULL) {
		struct io_piece *ipo;
		int r;

		r = sscanf(p, "%256s %256s %llu %u", fname, act, &offset,
									&bytes);
		if (r == 4) {
			/*
			 * Check action first
			 */
			if (!strcmp(act, "read"))
				rw = DDIR_READ;
			else if (!strcmp(act, "write"))
				rw = DDIR_WRITE;
			else if (!strcmp(act, "sync"))
				rw = DDIR_SYNC;
			else {
				log_err("fio: bad iolog file action: %s\n",
									act);
				continue;
			}
		} else if (r == 2) {
			rw = DDIR_INVAL;
			if (!strcmp(act, "add")) {
				td->o.nr_files++;
				fileno = add_file(td, fname);
				file_action = FIO_LOG_ADD_FILE;
				continue;
			} else if (!strcmp(act, "open")) {
				fileno = get_fileno(td, fname);
				file_action = FIO_LOG_OPEN_FILE;
			} else if (!strcmp(act, "close")) {
				fileno = get_fileno(td, fname);
				file_action = FIO_LOG_CLOSE_FILE;
			} else {
				log_err("fio: bad iolog file action: %s\n",
									act);
				continue;
			}
		} else {
			log_err("bad iolog2: %s", p);
			continue;
		}

		if (rw == DDIR_READ)
			reads++;
		else if (rw == DDIR_WRITE) {
			writes++;
			/*
			 * Don't add a write for ro mode
			 */
			if (read_only)
				continue;
		} else if (rw != DDIR_SYNC && rw != DDIR_INVAL) {
			log_err("bad ddir: %d\n", rw);
			continue;
		}

		/*
		 * Make note of file
		 */
		ipo = malloc(sizeof(*ipo));
		memset(ipo, 0, sizeof(*ipo));
		INIT_LIST_HEAD(&ipo->list);
		ipo->offset = offset;
		ipo->len = bytes;
		ipo->ddir = rw;
		if (bytes > td->o.max_bs[rw])
			td->o.max_bs[rw] = bytes;
		if (rw == DDIR_INVAL) {
			ipo->fileno = fileno;
			ipo->file_action = file_action;
		}
		list_add_tail(&ipo->list, &td->io_log_list);
		td->total_io_size += bytes;
	}

	free(str);
	free(act);
	free(fname);

	if (writes && read_only) {
		log_err("fio: <%s> skips replay of %d writes due to"
			" read-only\n", td->o.name, writes);
		writes = 0;
	}

	if (!reads && !writes)
		return 1;
	else if (reads && !writes)
		td->o.td_ddir = TD_DDIR_READ;
	else if (!reads && writes)
		td->o.td_ddir = TD_DDIR_WRITE;
	else
		td->o.td_ddir = TD_DDIR_RW;

	return 0;
}

/*
 * Read version 1 iolog data.
 */
static int read_iolog(struct thread_data *td, FILE *f)
{
	unsigned long long offset;
	unsigned int bytes;
	char *str, *p;
	int reads, writes;
	int rw;

	/*
	 * Read in the read iolog and store it, reuse the infrastructure
	 * for doing verifications.
	 */
	str = malloc(4096);
	reads = writes = 0;
	while ((p = fgets(str, 4096, f)) != NULL) {
		struct io_piece *ipo;

		if (sscanf(p, "%d,%llu,%u", &rw, &offset, &bytes) != 3) {
			log_err("bad iolog: %s\n", p);
			continue;
		}
		if (rw == DDIR_READ)
			reads++;
		else if (rw == DDIR_WRITE) {
			writes++;
			/*
			 * Don't add a write for ro mode
			 */
			if (read_only)
				continue;
		} else if (rw != DDIR_SYNC) {
			log_err("bad ddir: %d\n", rw);
			continue;
		}

		ipo = malloc(sizeof(*ipo));
		memset(ipo, 0, sizeof(*ipo));
		INIT_LIST_HEAD(&ipo->list);
		ipo->offset = offset;
		ipo->len = bytes;
		ipo->ddir = (enum fio_ddir) rw;
		if (bytes > td->o.max_bs[rw])
			td->o.max_bs[rw] = bytes;
		list_add_tail(&ipo->list, &td->io_log_list);
		td->total_io_size += bytes;
	}

	free(str);

	if (writes && read_only) {
		log_err("fio: <%s> skips replay of %d writes due to"
			" read-only\n", td->o.name, writes);
		writes = 0;
	}

	if (!reads && !writes)
		return 1;
	else if (reads && !writes)
		td->o.td_ddir = TD_DDIR_READ;
	else if (!reads && writes)
		td->o.td_ddir = TD_DDIR_WRITE;
	else
		td->o.td_ddir = TD_DDIR_RW;

	return 0;
}

/*
 * open iolog, check version, and call appropriate parser
 */
static int init_iolog_read(struct thread_data *td)
{
	char buffer[256], *p;
	FILE *f;
	int ret;

	f = fopen(td->o.read_iolog_file, "r");
	if (!f) {
		perror("fopen read iolog");
		return 1;
	}

	p = fgets(buffer, sizeof(buffer), f);
	if (!p) {
		td_verror(td, errno, "iolog read");
		log_err("fio: unable to read iolog\n");
		return 1;
	}

	/*
	 * version 2 of the iolog stores a specific string as the
	 * first line, check for that
	 */
	if (!strncmp(iolog_ver2, buffer, strlen(iolog_ver2)))
		ret = read_iolog2(td, f);
	else {
		/*
		 * seek back to the beginning
		 */
		if (fseek(f, 0, SEEK_SET) < 0) {
			td_verror(td, errno, "iolog read");
			log_err("fio: unable to read iolog\n");
			return 1;
		}

		ret = read_iolog(td, f);
	}

	fclose(f);
	return ret;
}

/*
 * Setup a log for storing io patterns.
 */
static int init_iolog_write(struct thread_data *td)
{
	struct fio_file *ff;
	FILE *f;
	unsigned int i;

	f = fopen(td->o.write_iolog_file, "w+");
	if (!f) {
		perror("fopen write iolog");
		return 1;
	}

	/*
	 * That's it for writing, setup a log buffer and we're done.
	  */
	td->iolog_f = f;
	td->iolog_buf = malloc(8192);
	setvbuf(f, td->iolog_buf, _IOFBF, 8192);

	/*
	 * write our version line
	 */
	if (fprintf(f, "%s\n", iolog_ver2) < 0) {
		perror("iolog init\n");
		return 1;
	}

	/*
	 * add all known files
	 */
	for_each_file(td, ff, i)
		log_file(td, ff, FIO_LOG_ADD_FILE);

	return 0;
}

int init_iolog(struct thread_data *td)
{
	int ret = 0;

	if (td->io_ops->flags & FIO_DISKLESSIO)
		return 0;

	if (td->o.read_iolog_file) {
		/*
		 * Check if it's a blktrace file and load that if possible.
		 * Otherwise assume it's a normal log file and load that.
		 */
		if (is_blktrace(td->o.read_iolog_file))
			ret = load_blktrace(td, td->o.read_iolog_file);
		else
			ret = init_iolog_read(td);
	} else if (td->o.write_iolog_file)
		ret = init_iolog_write(td);

	return ret;
}

void setup_log(struct io_log **log)
{
	struct io_log *l = malloc(sizeof(*l));

	l->nr_samples = 0;
	l->max_samples = 1024;
	l->log = malloc(l->max_samples * sizeof(struct io_sample));
	*log = l;
}

void __finish_log(struct io_log *log, const char *name)
{
	unsigned int i;
	FILE *f;

	f = fopen(name, "w");
	if (!f) {
		perror("fopen log");
		return;
	}

	for (i = 0; i < log->nr_samples; i++) {
		fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val,
						log->log[i].ddir);
	}

	fclose(f);
	free(log->log);
	free(log);
}

void finish_log(struct thread_data *td, struct io_log *log, const char *name)
{
	char file_name[256];

	snprintf(file_name, 200, "client%d_%s.log", td->thread_number, name);
	__finish_log(log, file_name);
}
Commit	Line	Data
f29b25a3 JA	1	/*
	2	* Code related to writing an iolog of what a thread is doing, and to
	3	* later read that back and replay
	4	*/
3c39a379 JA	5	#include <stdio.h>
3c39a379 JA	6	#include <stdlib.h>
f29b25a3	7	#include <assert.h>
3c39a379 JA	8	#include "list.h"
	9	#include "fio.h"
	10
f29b25a3 JA	11	static const char iolog_ver2[] = "fio version 2 iolog";
	12
	13	void log_io_u(struct thread_data td, struct io_u io_u)
3c39a379	14	{
f29b25a3 JA	15	const char *act[] = { "read", "write", "sync" };
	16
	17	assert(io_u->ddir < 3);
	18
	19	if (!td->o.write_iolog_file)
	20	return;
	21
5ec10eaa JA	22	fprintf(td->iolog_f, "%s %s %llu %lu\n", io_u->file->file_name,
	23	act[io_u->ddir], io_u->offset,
	24	io_u->buflen);
f29b25a3 JA	25	}
	26
	27	void log_file(struct thread_data td, struct fio_file f,
	28	enum file_log_act what)
	29	{
	30	const char *act[] = { "add", "open", "close" };
	31
	32	assert(what < 3);
	33
	34	if (!td->o.write_iolog_file)
	35	return;
	36
	37	fprintf(td->iolog_f, "%s %s\n", f->file_name, act[what]);
3c39a379 JA	38	}
3c39a379 JA	39
a61eddec JA	40	static void iolog_delay(struct thread_data *td, unsigned long delay)
	41	{
	42	unsigned long usec = utime_since_now(&td->last_issue);
	43
	44	if (delay < usec)
	45	return;
	46
	47	delay -= usec;
	48
	49	/*
	50	* less than 100 usec delay, just regard it as noise
	51	*/
	52	if (delay < 100)
	53	return;
	54
	55	usec_sleep(td, delay);
	56	}
	57
3c39a379 JA	58	int read_iolog_get(struct thread_data td, struct io_u io_u)
	59	{
	60	struct io_piece *ipo;
	61
b3f4b4f5	62	while (!list_empty(&td->io_log_list)) {
3c39a379 JA	63	ipo = list_entry(td->io_log_list.next, struct io_piece, list);
3c39a379 JA	64	list_del(&ipo->list);
a61eddec	65
f29b25a3 JA	66	/*
	67	* invalid ddir, this is a file action
	68	*/
429f6675	69	if (ipo->ddir == DDIR_INVAL) {
126d65c6	70	struct fio_file *f = td->files[ipo->fileno];
f29b25a3 JA	71
	72	if (ipo->file_action == FIO_LOG_OPEN_FILE) {
	73	assert(!td_io_open_file(td, f));
	74	free(ipo);
b3f4b4f5	75	continue;
f29b25a3 JA	76	} else if (ipo->file_action == FIO_LOG_CLOSE_FILE) {
	77	td_io_close_file(td, f);
	78	free(ipo);
b3f4b4f5	79	continue;
f29b25a3 JA	80	}
	81	}
	82
429f6675 JA	83	io_u->offset = ipo->offset;
	84	io_u->buflen = ipo->len;
	85	io_u->ddir = ipo->ddir;
126d65c6	86	io_u->file = td->files[ipo->fileno];
429f6675 JA	87	get_file(io_u->file);
429f6675 JA	88
ee56ad50 JA	89	dprint(FD_IO, "iolog: get %llu/%lu/%s\n", io_u->offset,
	90	io_u->buflen, io_u->file->file_name);
	91
a61eddec JA	92	if (ipo->delay)
	93	iolog_delay(td, ipo->delay);
	94
3c39a379 JA	95	free(ipo);
	96	return 0;
	97	}
	98
20e354ef	99	td->done = 1;
3c39a379 JA	100	return 1;
	101	}
	102
	103	void prune_io_piece_log(struct thread_data *td)
	104	{
	105	struct io_piece *ipo;
4b87898e	106	struct rb_node *n;
3c39a379	107
4b87898e JA	108	while ((n = rb_first(&td->io_hist_tree)) != NULL) {
	109	ipo = rb_entry(n, struct io_piece, rb_node);
	110	rb_erase(n, &td->io_hist_tree);
3c39a379 JA	111	free(ipo);
3c39a379 JA	112	}
8ce9cd3d JA	113
	114	while (!list_empty(&td->io_hist_list)) {
	115	ipo = list_entry(td->io_hist_list.next, struct io_piece, list);
	116	list_del(&ipo->list);
	117	free(ipo);
	118	}
3c39a379 JA	119	}
	120
	121	/*
34403fb1	122	* log a successful write, so we can unwind the log for verify
3c39a379 JA	123	*/
	124	void log_io_piece(struct thread_data td, struct io_u io_u)
	125	{
8de8f047	126	struct rb_node *p, parent;
4b87898e	127	struct io_piece ipo, __ipo;
3c39a379	128
4b87898e	129	ipo = malloc(sizeof(struct io_piece));
53cdc686	130	ipo->file = io_u->file;
3c39a379 JA	131	ipo->offset = io_u->offset;
	132	ipo->len = io_u->buflen;
	133
8de8f047 JA	134	/*
	135	* We don't need to sort the entries, if:
	136	*
	137	* Sequential writes, or
	138	* Random writes that lay out the file as it goes along
	139	*
	140	* For both these cases, just reading back data in the order we
	141	* wrote it out is the fastest.
	142	*/
9b23c9fb	143	if (!td_random(td) \|\| !td->o.overwrite) {
8de8f047 JA	144	INIT_LIST_HEAD(&ipo->list);
	145	list_add_tail(&ipo->list, &td->io_hist_list);
	146	return;
	147	}
	148
	149	RB_CLEAR_NODE(&ipo->rb_node);
	150	p = &td->io_hist_tree.rb_node;
	151	parent = NULL;
	152
3c39a379	153	/*
4b87898e	154	* Sort the entry into the verification list
3c39a379	155	*/
4b87898e JA	156	while (*p) {
	157	parent = *p;
	158
	159	__ipo = rb_entry(parent, struct io_piece, rb_node);
bb5d7d0b	160	if (ipo->offset <= __ipo->offset)
4b87898e	161	p = &(*p)->rb_left;
4b87898e	162	else
bb5d7d0b	163	p = &(*p)->rb_right;
3c39a379 JA	164	}
3c39a379 JA	165
4b87898e JA	166	rb_link_node(&ipo->rb_node, parent, p);
4b87898e JA	167	rb_insert_color(&ipo->rb_node, &td->io_hist_tree);
3c39a379 JA	168	}
	169
	170	void write_iolog_close(struct thread_data *td)
	171	{
	172	fflush(td->iolog_f);
	173	fclose(td->iolog_f);
	174	free(td->iolog_buf);
f29b25a3 JA	175	td->iolog_f = NULL;
f29b25a3 JA	176	td->iolog_buf = NULL;
3c39a379 JA	177	}
3c39a379 JA	178
fb71fbd7	179	/*
f29b25a3 JA	180	* Read version 2 iolog data. It is enhanced to include per-file logging,
f29b25a3 JA	181	* syncs, etc.
fb71fbd7	182	*/
f29b25a3	183	static int read_iolog2(struct thread_data td, FILE f)
3c39a379 JA	184	{
	185	unsigned long long offset;
	186	unsigned int bytes;
53fa9b69	187	int reads, writes, fileno = 0, file_action = 0; /* stupid gcc */
f29b25a3	188	char fname, act;
3c39a379	189	char str, p;
53fa9b69	190	enum fio_ddir rw;
3c39a379	191
f29b25a3 JA	192	free_release_files(td);
	193
	194	/*
	195	* Read in the read iolog and store it, reuse the infrastructure
	196	* for doing verifications.
	197	*/
	198	str = malloc(4096);
	199	fname = malloc(256+16);
	200	act = malloc(256+16);
	201
	202	reads = writes = 0;
	203	while ((p = fgets(str, 4096, f)) != NULL) {
	204	struct io_piece *ipo;
	205	int r;
	206
5ec10eaa JA	207	r = sscanf(p, "%256s %256s %llu %u", fname, act, &offset,
5ec10eaa JA	208	&bytes);
f29b25a3 JA	209	if (r == 4) {
	210	/*
	211	* Check action first
	212	*/
	213	if (!strcmp(act, "read"))
	214	rw = DDIR_READ;
	215	else if (!strcmp(act, "write"))
	216	rw = DDIR_WRITE;
	217	else if (!strcmp(act, "sync"))
	218	rw = DDIR_SYNC;
	219	else {
5ec10eaa JA	220	log_err("fio: bad iolog file action: %s\n",
5ec10eaa JA	221	act);
f29b25a3 JA	222	continue;
	223	}
	224	} else if (r == 2) {
	225	rw = DDIR_INVAL;
	226	if (!strcmp(act, "add")) {
	227	td->o.nr_files++;
	228	fileno = add_file(td, fname);
	229	file_action = FIO_LOG_ADD_FILE;
	230	continue;
	231	} else if (!strcmp(act, "open")) {
	232	fileno = get_fileno(td, fname);
	233	file_action = FIO_LOG_OPEN_FILE;
	234	} else if (!strcmp(act, "close")) {
	235	fileno = get_fileno(td, fname);
	236	file_action = FIO_LOG_CLOSE_FILE;
	237	} else {
5ec10eaa JA	238	log_err("fio: bad iolog file action: %s\n",
5ec10eaa JA	239	act);
f29b25a3 JA	240	continue;
	241	}
	242	} else {
	243	log_err("bad iolog2: %s", p);
	244	continue;
	245	}
5ec10eaa	246
f29b25a3 JA	247	if (rw == DDIR_READ)
f29b25a3 JA	248	reads++;
4241ea8f	249	else if (rw == DDIR_WRITE) {
f29b25a3	250	writes++;
4241ea8f JA	251	/*
	252	* Don't add a write for ro mode
	253	*/
	254	if (read_only)
	255	continue;
	256	} else if (rw != DDIR_SYNC && rw != DDIR_INVAL) {
f29b25a3 JA	257	log_err("bad ddir: %d\n", rw);
	258	continue;
	259	}
	260
	261	/*
	262	* Make note of file
	263	*/
	264	ipo = malloc(sizeof(*ipo));
	265	memset(ipo, 0, sizeof(*ipo));
	266	INIT_LIST_HEAD(&ipo->list);
	267	ipo->offset = offset;
	268	ipo->len = bytes;
53fa9b69	269	ipo->ddir = rw;
f29b25a3 JA	270	if (bytes > td->o.max_bs[rw])
	271	td->o.max_bs[rw] = bytes;
	272	if (rw == DDIR_INVAL) {
	273	ipo->fileno = fileno;
	274	ipo->file_action = file_action;
	275	}
	276	list_add_tail(&ipo->list, &td->io_log_list);
ea966f81	277	td->total_io_size += bytes;
3c39a379 JA	278	}
3c39a379 JA	279
f29b25a3 JA	280	free(str);
	281	free(act);
	282	free(fname);
	283
4241ea8f	284	if (writes && read_only) {
5ec10eaa JA	285	log_err("fio: <%s> skips replay of %d writes due to"
5ec10eaa JA	286	" read-only\n", td->o.name, writes);
4241ea8f JA	287	writes = 0;
	288	}
	289
f29b25a3 JA	290	if (!reads && !writes)
	291	return 1;
	292	else if (reads && !writes)
	293	td->o.td_ddir = TD_DDIR_READ;
	294	else if (!reads && writes)
	295	td->o.td_ddir = TD_DDIR_WRITE;
	296	else
	297	td->o.td_ddir = TD_DDIR_RW;
	298
	299	return 0;
	300	}
	301
	302	/*
	303	* Read version 1 iolog data.
	304	*/
	305	static int read_iolog(struct thread_data td, FILE f)
	306	{
	307	unsigned long long offset;
	308	unsigned int bytes;
	309	char str, p;
21bd2987	310	int reads, writes;
59b9ddfc	311	int rw;
f29b25a3	312
3c39a379 JA	313	/*
	314	* Read in the read iolog and store it, reuse the infrastructure
	315	* for doing verifications.
	316	*/
	317	str = malloc(4096);
fb71fbd7	318	reads = writes = 0;
3c39a379 JA	319	while ((p = fgets(str, 4096, f)) != NULL) {
	320	struct io_piece *ipo;
	321
	322	if (sscanf(p, "%d,%llu,%u", &rw, &offset, &bytes) != 3) {
3b70d7e5	323	log_err("bad iolog: %s\n", p);
3c39a379 JA	324	continue;
	325	}
	326	if (rw == DDIR_READ)
	327	reads++;
4241ea8f	328	else if (rw == DDIR_WRITE) {
3c39a379	329	writes++;
4241ea8f JA	330	/*
	331	* Don't add a write for ro mode
	332	*/
	333	if (read_only)
	334	continue;
	335	} else if (rw != DDIR_SYNC) {
3b70d7e5	336	log_err("bad ddir: %d\n", rw);
3c39a379 JA	337	continue;
	338	}
	339
	340	ipo = malloc(sizeof(*ipo));
733ed597	341	memset(ipo, 0, sizeof(*ipo));
3c39a379 JA	342	INIT_LIST_HEAD(&ipo->list);
	343	ipo->offset = offset;
	344	ipo->len = bytes;
59b9ddfc	345	ipo->ddir = (enum fio_ddir) rw;
2dc1bbeb JA	346	if (bytes > td->o.max_bs[rw])
2dc1bbeb JA	347	td->o.max_bs[rw] = bytes;
3c39a379	348	list_add_tail(&ipo->list, &td->io_log_list);
ea966f81	349	td->total_io_size += bytes;
3c39a379 JA	350	}
	351
	352	free(str);
3c39a379	353
4241ea8f	354	if (writes && read_only) {
5ec10eaa JA	355	log_err("fio: <%s> skips replay of %d writes due to"
5ec10eaa JA	356	" read-only\n", td->o.name, writes);
4241ea8f JA	357	writes = 0;
	358	}
	359
fb71fbd7	360	if (!reads && !writes)
3c39a379	361	return 1;
fb71fbd7	362	else if (reads && !writes)
2dc1bbeb	363	td->o.td_ddir = TD_DDIR_READ;
3c39a379	364	else if (!reads && writes)
36361ebb	365	td->o.td_ddir = TD_DDIR_WRITE;
3c39a379	366	else
2dc1bbeb	367	td->o.td_ddir = TD_DDIR_RW;
3c39a379 JA	368
	369	return 0;
	370	}
8914a9d8	371
fb71fbd7	372	/*
f29b25a3	373	* open iolog, check version, and call appropriate parser
fb71fbd7	374	*/
f29b25a3	375	static int init_iolog_read(struct thread_data *td)
fb71fbd7	376	{
f29b25a3	377	char buffer[256], *p;
076efc7c	378	FILE *f;
f29b25a3 JA	379	int ret;
	380
	381	f = fopen(td->o.read_iolog_file, "r");
	382	if (!f) {
	383	perror("fopen read iolog");
	384	return 1;
	385	}
fb71fbd7	386
f29b25a3 JA	387	p = fgets(buffer, sizeof(buffer), f);
	388	if (!p) {
	389	td_verror(td, errno, "iolog read");
	390	log_err("fio: unable to read iolog\n");
733ed597 JA	391	return 1;
	392	}
	393
f29b25a3 JA	394	/*
	395	* version 2 of the iolog stores a specific string as the
	396	* first line, check for that
	397	*/
	398	if (!strncmp(iolog_ver2, buffer, strlen(iolog_ver2)))
	399	ret = read_iolog2(td, f);
	400	else {
	401	/*
	402	* seek back to the beginning
	403	*/
	404	if (fseek(f, 0, SEEK_SET) < 0) {
	405	td_verror(td, errno, "iolog read");
	406	log_err("fio: unable to read iolog\n");
	407	return 1;
	408	}
	409
	410	ret = read_iolog(td, f);
	411	}
	412
	413	fclose(f);
	414	return ret;
	415	}
	416
	417	/*
	418	* Setup a log for storing io patterns.
	419	*/
	420	static int init_iolog_write(struct thread_data *td)
	421	{
	422	struct fio_file *ff;
	423	FILE *f;
	424	unsigned int i;
	425
2dc1bbeb	426	f = fopen(td->o.write_iolog_file, "w+");
fb71fbd7 JA	427	if (!f) {
	428	perror("fopen write iolog");
	429	return 1;
	430	}
	431
	432	/*
	433	* That's it for writing, setup a log buffer and we're done.
	434	*/
	435	td->iolog_f = f;
	436	td->iolog_buf = malloc(8192);
	437	setvbuf(f, td->iolog_buf, _IOFBF, 8192);
f29b25a3 JA	438
	439	/*
	440	* write our version line
	441	*/
	442	if (fprintf(f, "%s\n", iolog_ver2) < 0) {
	443	perror("iolog init\n");
	444	return 1;
	445	}
	446
	447	/*
	448	* add all known files
	449	*/
	450	for_each_file(td, ff, i)
	451	log_file(td, ff, FIO_LOG_ADD_FILE);
	452
fb71fbd7 JA	453	return 0;
	454	}
	455
	456	int init_iolog(struct thread_data *td)
	457	{
b4a6a59a JA	458	int ret = 0;
b4a6a59a JA	459
ba0fbe10	460	if (td->io_ops->flags & FIO_DISKLESSIO)
f48b467c JA	461	return 0;
f48b467c JA	462
fb7b71a3 JA	463	if (td->o.read_iolog_file) {
	464	/*
	465	* Check if it's a blktrace file and load that if possible.
	466	* Otherwise assume it's a normal log file and load that.
	467	*/
	468	if (is_blktrace(td->o.read_iolog_file))
	469	ret = load_blktrace(td, td->o.read_iolog_file);
	470	else
	471	ret = init_iolog_read(td);
	472	} else if (td->o.write_iolog_file)
b4a6a59a	473	ret = init_iolog_write(td);
fb71fbd7	474
1e97cce9	475	return ret;
fb71fbd7 JA	476	}
fb71fbd7 JA	477
8914a9d8 JA	478	void setup_log(struct io_log **log)
	479	{
	480	struct io_log l = malloc(sizeof(l));
	481
	482	l->nr_samples = 0;
	483	l->max_samples = 1024;
	484	l->log = malloc(l->max_samples * sizeof(struct io_sample));
	485	*log = l;
	486	}
	487
bb3884d8	488	void __finish_log(struct io_log log, const char name)
8914a9d8	489	{
8914a9d8	490	unsigned int i;
bb3884d8	491	FILE *f;
8914a9d8	492
bb3884d8	493	f = fopen(name, "w");
8914a9d8 JA	494	if (!f) {
	495	perror("fopen log");
	496	return;
	497	}
	498
5ec10eaa JA	499	for (i = 0; i < log->nr_samples; i++) {
	500	fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val,
	501	log->log[i].ddir);
	502	}
8914a9d8 JA	503
	504	fclose(f);
	505	free(log->log);
	506	free(log);
	507	}
bb3884d8 JA	508
	509	void finish_log(struct thread_data td, struct io_log log, const char *name)
	510	{
	511	char file_name[256];
	512
	513	snprintf(file_name, 200, "client%d_%s.log", td->thread_number, name);
	514	__finish_log(log, file_name);
	515	}