[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 <libgen.h>
#include <assert.h>
#include "flist.h"
#include "fio.h"
#include "verify.h"

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

void queue_io_piece(struct thread_data *td, struct io_piece *ipo)
{
	flist_add_tail(&ipo->list, &td->io_log_list);
	td->total_io_size += ipo->len;
}

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

	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;


	/*
	 * this happens on the pre-open/close done before the job starts
	 */
	if (!td->iolog_f)
		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);
}

static int ipo_special(struct thread_data *td, struct io_piece *ipo)
{
	struct fio_file *f;
	int ret;

	/*
	 * Not a special ipo
	 */
	if (ipo->ddir != DDIR_INVAL)
		return 0;

	f = td->files[ipo->fileno];

	switch (ipo->file_action) {
	case FIO_LOG_OPEN_FILE:
		ret = td_io_open_file(td, f);
		if (!ret) {
			free(ipo);
			break;
		}
		td_verror(td, ret, "iolog open file");
		return -1;
	case FIO_LOG_CLOSE_FILE:
		td_io_close_file(td, f);
		break;
	case FIO_LOG_UNLINK_FILE:
		unlink(f->file_name);
		break;
	default:
		log_err("fio: bad file action %d\n", ipo->file_action);
		break;
	}

	return 1;
}

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

	while (!flist_empty(&td->io_log_list)) {
		int ret;

		ipo = flist_entry(td->io_log_list.next, struct io_piece, list);
		flist_del(&ipo->list);

		ret = ipo_special(td, ipo);
		if (ret < 0) {
			free(ipo);
			break;
		} else if (ret > 0) {
			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 (!flist_empty(&td->io_hist_list)) {
		ipo = flist_entry(td->io_hist_list.next, struct io_piece, list);
		flist_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.
	 *
	 * One exception is if we don't have a random map AND we are doing
	 * verifies, in that case we need to check for duplicate blocks and
	 * drop the old one, which we rely on the rb insert/lookup for
	 * handling.
	 */
	if ((!td_random(td) || !td->o.overwrite) &&
	      (file_randommap(td, ipo->file) || td->o.verify == VERIFY_NONE)) {
		INIT_FLIST_HEAD(&ipo->list);
		flist_add_tail(&ipo->list, &td->io_hist_list);
		return;
	}

	RB_CLEAR_NODE(&ipo->rb_node);

	/*
	 * Sort the entry into the verification list
	 */
restart:
	p = &td->io_hist_tree.rb_node;
	parent = NULL;
	while (*p) {
		parent = *p;

		__ipo = rb_entry(parent, struct io_piece, rb_node);
		if (ipo->offset < __ipo->offset)
			p = &(*p)->rb_left;
		else if (ipo->offset > __ipo->offset)
			p = &(*p)->rb_right;
		else {
			assert(ipo->len == __ipo->len);
			rb_erase(parent, &td->io_hist_tree);
			goto restart;
		}
	}

	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 if (!strcmp(act, "datasync"))
				rw = DDIR_DATASYNC;
			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) {
			/*
			 * Don't add a write for ro mode
			 */
			if (read_only)
				continue;
			writes++;
		} else if (!ddir_sync(rw)) {
			log_err("bad ddir: %d\n", rw);
			continue;
		}

		/*
		 * Make note of file
		 */
		ipo = malloc(sizeof(*ipo));
		memset(ipo, 0, sizeof(*ipo));
		INIT_FLIST_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;
		}
		queue_io_piece(td, ipo);
	}

	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;
}

/*
 * 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 {
		log_err("fio: iolog version 1 is no longer supported\n");
		ret = 1;
	}

	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, "a");
	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->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, "a");
	if (!f) {
		perror("fopen log");
		return;
	}

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

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

void finish_log_named(struct thread_data *td, struct io_log *log,
		       const char *prefix, const char *postfix)
{
	char file_name[256], *p;

	snprintf(file_name, 200, "%s_%s.log", prefix, postfix);
	p = basename(file_name);
	__finish_log(log, p);
}

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