[fio.git] / io_u.c

#include <unistd.h>
#include <fcntl.h>
#include <string.h>
#include <signal.h>
#include <time.h>
#include <assert.h>

#include "fio.h"
#include "os.h"

/*
 * The ->file_map[] contains a map of blocks we have or have not done io
 * to yet. Used to make sure we cover the entire range in a fair fashion.
 */
static int random_map_free(struct thread_data *td, struct fio_file *f,
			   unsigned long long block)
{
	unsigned int idx = RAND_MAP_IDX(td, f, block);
	unsigned int bit = RAND_MAP_BIT(td, f, block);

	return (f->file_map[idx] & (1UL << bit)) == 0;
}

/*
 * Mark a given offset as used in the map.
 */
static void mark_random_map(struct thread_data *td, struct fio_file *f,
			    struct io_u *io_u)
{
	unsigned long long block = io_u->offset / (unsigned long long) td->min_bs;
	unsigned int blocks = 0;

	while (blocks < (io_u->buflen / td->min_bs)) {
		unsigned int idx, bit;

		if (!random_map_free(td, f, block))
			break;

		idx = RAND_MAP_IDX(td, f, block);
		bit = RAND_MAP_BIT(td, f, block);

		assert(idx < f->num_maps);

		f->file_map[idx] |= (1UL << bit);
		block++;
		blocks++;
	}

	if ((blocks * td->min_bs) < io_u->buflen)
		io_u->buflen = blocks * td->min_bs;
}

/*
 * Return the next free block in the map.
 */
static int get_next_free_block(struct thread_data *td, struct fio_file *f,
			       unsigned long long *b)
{
	int i;

	*b = 0;
	i = 0;
	while ((*b) * td->min_bs < f->file_size) {
		if (f->file_map[i] != -1UL) {
			*b += ffz(f->file_map[i]);
			return 0;
		}

		*b += BLOCKS_PER_MAP;
		i++;
	}

	return 1;
}

/*
 * For random io, generate a random new block and see if it's used. Repeat
 * until we find a free one. For sequential io, just return the end of
 * the last io issued.
 */
static int get_next_offset(struct thread_data *td, struct fio_file *f,
			   unsigned long long *offset)
{
	unsigned long long b, rb;
	long r;

	if (!td->sequential) {
		unsigned long long max_blocks = td->io_size / td->min_bs;
		int loops = 50;

		do {
			r = os_random_long(&td->random_state);
			b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0));
			if (td->norandommap)
				break;
			rb = b + (f->file_offset / td->min_bs);
			loops--;
		} while (!random_map_free(td, f, rb) && loops);

		if (!loops) {
			if (get_next_free_block(td, f, &b))
				return 1;
		}
	} else
		b = f->last_pos / td->min_bs;

	*offset = (b * td->min_bs) + f->file_offset;
	if (*offset > f->file_size)
		return 1;

	return 0;
}

static unsigned int get_next_buflen(struct thread_data *td)
{
	unsigned int buflen;
	long r;

	if (td->min_bs == td->max_bs)
		buflen = td->min_bs;
	else {
		r = os_random_long(&td->bsrange_state);
		buflen = (1 + (double) (td->max_bs - 1) * r / (RAND_MAX + 1.0));
		buflen = (buflen + td->min_bs - 1) & ~(td->min_bs - 1);
	}

	if (buflen > td->io_size - td->this_io_bytes[td->ddir]) {
		/*
		 * if using direct/raw io, we may not be able to
		 * shrink the size. so just fail it.
		 */
		if (td->io_ops->flags & FIO_RAWIO)
			return 0;

		buflen = td->io_size - td->this_io_bytes[td->ddir];
	}

	return buflen;
}

/*
 * Return the data direction for the next io_u. If the job is a
 * mixed read/write workload, check the rwmix cycle and switch if
 * necessary.
 */
static int get_rw_ddir(struct thread_data *td)
{
	if (td_rw(td)) {
		struct timeval now;
		unsigned long elapsed;

		gettimeofday(&now, NULL);
	 	elapsed = mtime_since_now(&td->rwmix_switch);

		/*
		 * Check if it's time to seed a new data direction.
		 */
		if (elapsed >= td->rwmixcycle) {
			unsigned int v;
			long r;

			r = os_random_long(&td->rwmix_state);
			v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0)));
			if (v < td->rwmixread)
				td->rwmix_ddir = DDIR_READ;
			else
				td->rwmix_ddir = DDIR_WRITE;
			memcpy(&td->rwmix_switch, &now, sizeof(now));
		}
		return td->rwmix_ddir;
	} else if (td_read(td))
		return DDIR_READ;
	else
		return DDIR_WRITE;
}

void put_io_u(struct thread_data *td, struct io_u *io_u)
{
	io_u->file = NULL;
	list_del(&io_u->list);
	list_add(&io_u->list, &td->io_u_freelist);
	td->cur_depth--;
}

static int fill_io_u(struct thread_data *td, struct fio_file *f,
		     struct io_u *io_u)
{
	/*
	 * If using an iolog, grab next piece if any available.
	 */
	if (td->read_iolog)
		return read_iolog_get(td, io_u);

	/*
	 * see if it's time to sync
	 */
	if (td->fsync_blocks && !(td->io_blocks[DDIR_WRITE] % td->fsync_blocks)
	    && should_fsync(td)) {
		io_u->ddir = DDIR_SYNC;
		io_u->file = f;
		return 0;
	}

	/*
	 * No log, let the seq/rand engine retrieve the next position.
	 */
	if (!get_next_offset(td, f, &io_u->offset)) {
		io_u->buflen = get_next_buflen(td);

		if (io_u->buflen) {
			io_u->ddir = get_rw_ddir(td);

			/*
			 * If using a write iolog, store this entry.
			 */
			if (td->write_iolog_file)
				write_iolog_put(td, io_u);

			io_u->file = f;
			return 0;
		}
	}

	return 1;
}

struct io_u *__get_io_u(struct thread_data *td)
{
	struct io_u *io_u = NULL;

	if (!queue_full(td)) {
		io_u = list_entry(td->io_u_freelist.next, struct io_u, list);

		io_u->buflen = 0;
		io_u->error = 0;
		io_u->resid = 0;
		list_del(&io_u->list);
		list_add(&io_u->list, &td->io_u_busylist);
		td->cur_depth++;
	}

	return io_u;
}

/*
 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
 * etc. The returned io_u is fully ready to be prepped and submitted.
 */
struct io_u *get_io_u(struct thread_data *td, struct fio_file *f)
{
	struct io_u *io_u;

	io_u = __get_io_u(td);
	if (!io_u)
		return NULL;

	if (td->zone_bytes >= td->zone_size) {
		td->zone_bytes = 0;
		f->last_pos += td->zone_skip;
	}

	if (fill_io_u(td, f, io_u)) {
		put_io_u(td, io_u);
		return NULL;
	}

	if (io_u->buflen + io_u->offset > f->file_size) {
		if (td->io_ops->flags & FIO_RAWIO) {
			put_io_u(td, io_u);
			return NULL;
		}

		io_u->buflen = f->file_size - io_u->offset;
	}

	if (io_u->ddir != DDIR_SYNC) {
		if (!io_u->buflen) {
			put_io_u(td, io_u);
			return NULL;
		}

		if (!td->read_iolog && !td->sequential && !td->norandommap)
			mark_random_map(td, f, io_u);

		f->last_pos += io_u->buflen;

		if (td->verify != VERIFY_NONE)
			populate_verify_io_u(td, io_u);
	}

	if (td_io_prep(td, io_u)) {
		put_io_u(td, io_u);
		return NULL;
	}

	gettimeofday(&io_u->start_time, NULL);
	return io_u;
}

void io_completed(struct thread_data *td, struct io_u *io_u,
		  struct io_completion_data *icd)
{
	struct timeval e;
	unsigned long msec;

	if (io_u->ddir == DDIR_SYNC) {
		td->last_was_sync = 1;
		return;
	}

	td->last_was_sync = 0;

	gettimeofday(&e, NULL);

	if (!io_u->error) {
		unsigned int bytes = io_u->buflen - io_u->resid;
		const int idx = io_u->ddir;

		td->io_blocks[idx]++;
		td->io_bytes[idx] += bytes;
		td->zone_bytes += bytes;
		td->this_io_bytes[idx] += bytes;

		msec = mtime_since(&io_u->issue_time, &e);

		add_clat_sample(td, idx, msec);
		add_bw_sample(td, idx);

		if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE)
			log_io_piece(td, io_u);

		icd->bytes_done[idx] += bytes;
	} else
		icd->error = io_u->error;
}

void ios_completed(struct thread_data *td, struct io_completion_data *icd)
{
	struct io_u *io_u;
	int i;

	icd->error = 0;
	icd->bytes_done[0] = icd->bytes_done[1] = 0;

	for (i = 0; i < icd->nr; i++) {
		io_u = td->io_ops->event(td, i);

		io_completed(td, io_u, icd);
		put_io_u(td, io_u);
	}
}
Commit	Line	Data
10ba535a JA	1	#include <unistd.h>
	2	#include <fcntl.h>
	3	#include <string.h>
	4	#include <signal.h>
	5	#include <time.h>
	6	#include <assert.h>
	7
	8	#include "fio.h"
	9	#include "os.h"
	10
	11	/*
	12	* The ->file_map[] contains a map of blocks we have or have not done io
	13	* to yet. Used to make sure we cover the entire range in a fair fashion.
	14	*/
	15	static int random_map_free(struct thread_data td, struct fio_file f,
	16	unsigned long long block)
	17	{
	18	unsigned int idx = RAND_MAP_IDX(td, f, block);
	19	unsigned int bit = RAND_MAP_BIT(td, f, block);
	20
	21	return (f->file_map[idx] & (1UL << bit)) == 0;
	22	}
	23
df415585 JA	24	/*
	25	* Mark a given offset as used in the map.
	26	*/
	27	static void mark_random_map(struct thread_data td, struct fio_file f,
	28	struct io_u *io_u)
	29	{
	30	unsigned long long block = io_u->offset / (unsigned long long) td->min_bs;
	31	unsigned int blocks = 0;
	32
	33	while (blocks < (io_u->buflen / td->min_bs)) {
	34	unsigned int idx, bit;
	35
	36	if (!random_map_free(td, f, block))
	37	break;
	38
	39	idx = RAND_MAP_IDX(td, f, block);
	40	bit = RAND_MAP_BIT(td, f, block);
	41
	42	assert(idx < f->num_maps);
	43
	44	f->file_map[idx] \|= (1UL << bit);
	45	block++;
	46	blocks++;
	47	}
	48
	49	if ((blocks * td->min_bs) < io_u->buflen)
	50	io_u->buflen = blocks * td->min_bs;
	51	}
	52
10ba535a JA	53	/*
	54	* Return the next free block in the map.
	55	*/
	56	static int get_next_free_block(struct thread_data td, struct fio_file f,
	57	unsigned long long *b)
	58	{
	59	int i;
	60
	61	*b = 0;
	62	i = 0;
	63	while ((b) td->min_bs < f->file_size) {
	64	if (f->file_map[i] != -1UL) {
	65	*b += ffz(f->file_map[i]);
	66	return 0;
	67	}
	68
	69	*b += BLOCKS_PER_MAP;
	70	i++;
	71	}
	72
	73	return 1;
	74	}
	75
	76	/*
	77	* For random io, generate a random new block and see if it's used. Repeat
	78	* until we find a free one. For sequential io, just return the end of
	79	* the last io issued.
	80	*/
	81	static int get_next_offset(struct thread_data td, struct fio_file f,
	82	unsigned long long *offset)
	83	{
	84	unsigned long long b, rb;
	85	long r;
	86
	87	if (!td->sequential) {
	88	unsigned long long max_blocks = td->io_size / td->min_bs;
	89	int loops = 50;
	90
	91	do {
	92	r = os_random_long(&td->random_state);
	93	b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0));
bb8895e0 JA	94	if (td->norandommap)
bb8895e0 JA	95	break;
10ba535a JA	96	rb = b + (f->file_offset / td->min_bs);
	97	loops--;
	98	} while (!random_map_free(td, f, rb) && loops);
	99
	100	if (!loops) {
	101	if (get_next_free_block(td, f, &b))
	102	return 1;
	103	}
	104	} else
	105	b = f->last_pos / td->min_bs;
	106
	107	offset = (b td->min_bs) + f->file_offset;
	108	if (*offset > f->file_size)
	109	return 1;
	110
	111	return 0;
	112	}
	113
	114	static unsigned int get_next_buflen(struct thread_data *td)
	115	{
	116	unsigned int buflen;
	117	long r;
	118
	119	if (td->min_bs == td->max_bs)
	120	buflen = td->min_bs;
	121	else {
	122	r = os_random_long(&td->bsrange_state);
	123	buflen = (1 + (double) (td->max_bs - 1) * r / (RAND_MAX + 1.0));
	124	buflen = (buflen + td->min_bs - 1) & ~(td->min_bs - 1);
	125	}
	126
	127	if (buflen > td->io_size - td->this_io_bytes[td->ddir]) {
	128	/*
	129	* if using direct/raw io, we may not be able to
	130	* shrink the size. so just fail it.
	131	*/
	132	if (td->io_ops->flags & FIO_RAWIO)
	133	return 0;
	134
	135	buflen = td->io_size - td->this_io_bytes[td->ddir];
	136	}
	137
	138	return buflen;
	139	}
	140
	141	/*
	142	* Return the data direction for the next io_u. If the job is a
	143	* mixed read/write workload, check the rwmix cycle and switch if
	144	* necessary.
	145	*/
	146	static int get_rw_ddir(struct thread_data *td)
	147	{
	148	if (td_rw(td)) {
	149	struct timeval now;
	150	unsigned long elapsed;
	151
	152	gettimeofday(&now, NULL);
	153	elapsed = mtime_since_now(&td->rwmix_switch);
	154
	155	/*
	156	* Check if it's time to seed a new data direction.
	157	*/
	158	if (elapsed >= td->rwmixcycle) {
	159	unsigned int v;
160	long r;
161
162	r = os_random_long(&td->rwmix_state);
163	v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0)));
164	if (v < td->rwmixread)
165	td->rwmix_ddir = DDIR_READ;
166	else
167	td->rwmix_ddir = DDIR_WRITE;
168	memcpy(&td->rwmix_switch, &now, sizeof(now));
169	}
170	return td->rwmix_ddir;
171	} else if (td_read(td))
172	return DDIR_READ;
173	else
174	return DDIR_WRITE;
175	}
176
10ba535a JA	177	void put_io_u(struct thread_data td, struct io_u io_u)
	178	{
	179	io_u->file = NULL;
	180	list_del(&io_u->list);
	181	list_add(&io_u->list, &td->io_u_freelist);
	182	td->cur_depth--;
	183	}
	184
	185	static int fill_io_u(struct thread_data td, struct fio_file f,
	186	struct io_u *io_u)
	187	{
	188	/*
	189	* If using an iolog, grab next piece if any available.
	190	*/
	191	if (td->read_iolog)
	192	return read_iolog_get(td, io_u);
	193
87dc1ab1 JA	194	/*
	195	* see if it's time to sync
	196	*/
	197	if (td->fsync_blocks && !(td->io_blocks[DDIR_WRITE] % td->fsync_blocks)
	198	&& should_fsync(td)) {
	199	io_u->ddir = DDIR_SYNC;
	200	io_u->file = f;
	201	return 0;
	202	}
	203
10ba535a JA	204	/*
	205	* No log, let the seq/rand engine retrieve the next position.
	206	*/
	207	if (!get_next_offset(td, f, &io_u->offset)) {
	208	io_u->buflen = get_next_buflen(td);
	209
	210	if (io_u->buflen) {
	211	io_u->ddir = get_rw_ddir(td);
	212
	213	/*
	214	* If using a write iolog, store this entry.
	215	*/
076efc7c	216	if (td->write_iolog_file)
10ba535a JA	217	write_iolog_put(td, io_u);
	218
	219	io_u->file = f;
	220	return 0;
	221	}
	222	}
	223
	224	return 1;
	225	}
	226
	227	struct io_u __get_io_u(struct thread_data td)
	228	{
	229	struct io_u *io_u = NULL;
	230
	231	if (!queue_full(td)) {
	232	io_u = list_entry(td->io_u_freelist.next, struct io_u, list);
	233
6040dabc	234	io_u->buflen = 0;
10ba535a JA	235	io_u->error = 0;
	236	io_u->resid = 0;
	237	list_del(&io_u->list);
	238	list_add(&io_u->list, &td->io_u_busylist);
	239	td->cur_depth++;
	240	}
	241
	242	return io_u;
	243	}
	244
	245	/*
	246	* Return an io_u to be processed. Gets a buflen and offset, sets direction,
	247	* etc. The returned io_u is fully ready to be prepped and submitted.
	248	*/
	249	struct io_u get_io_u(struct thread_data td, struct fio_file *f)
	250	{
	251	struct io_u *io_u;
	252
	253	io_u = __get_io_u(td);
	254	if (!io_u)
	255	return NULL;
	256
	257	if (td->zone_bytes >= td->zone_size) {
	258	td->zone_bytes = 0;
	259	f->last_pos += td->zone_skip;
	260	}
	261
	262	if (fill_io_u(td, f, io_u)) {
	263	put_io_u(td, io_u);
	264	return NULL;
	265	}
	266
	267	if (io_u->buflen + io_u->offset > f->file_size) {
	268	if (td->io_ops->flags & FIO_RAWIO) {
	269	put_io_u(td, io_u);
	270	return NULL;
	271	}
	272
	273	io_u->buflen = f->file_size - io_u->offset;
	274	}
	275
87dc1ab1 JA	276	if (io_u->ddir != DDIR_SYNC) {
	277	if (!io_u->buflen) {
	278	put_io_u(td, io_u);
	279	return NULL;
	280	}
10ba535a	281
bb8895e0	282	if (!td->read_iolog && !td->sequential && !td->norandommap)
87dc1ab1	283	mark_random_map(td, f, io_u);
10ba535a	284
87dc1ab1	285	f->last_pos += io_u->buflen;
10ba535a	286
87dc1ab1 JA	287	if (td->verify != VERIFY_NONE)
	288	populate_verify_io_u(td, io_u);
	289	}
10ba535a JA	290
	291	if (td_io_prep(td, io_u)) {
	292	put_io_u(td, io_u);
	293	return NULL;
	294	}
	295
	296	gettimeofday(&io_u->start_time, NULL);
	297	return io_u;
	298	}
	299
	300	void io_completed(struct thread_data td, struct io_u io_u,
	301	struct io_completion_data *icd)
	302	{
	303	struct timeval e;
	304	unsigned long msec;
	305
87dc1ab1 JA	306	if (io_u->ddir == DDIR_SYNC) {
	307	td->last_was_sync = 1;
	308	return;
	309	}
	310
	311	td->last_was_sync = 0;
	312
10ba535a JA	313	gettimeofday(&e, NULL);
	314
	315	if (!io_u->error) {
	316	unsigned int bytes = io_u->buflen - io_u->resid;
	317	const int idx = io_u->ddir;
	318
	319	td->io_blocks[idx]++;
	320	td->io_bytes[idx] += bytes;
	321	td->zone_bytes += bytes;
	322	td->this_io_bytes[idx] += bytes;
	323
	324	msec = mtime_since(&io_u->issue_time, &e);
	325
	326	add_clat_sample(td, idx, msec);
	327	add_bw_sample(td, idx);
	328
	329	if ((td_rw(td) \|\| td_write(td)) && idx == DDIR_WRITE)
	330	log_io_piece(td, io_u);
	331
	332	icd->bytes_done[idx] += bytes;
	333	} else
	334	icd->error = io_u->error;
	335	}
	336
	337	void ios_completed(struct thread_data td, struct io_completion_data icd)
	338	{
	339	struct io_u *io_u;
	340	int i;
	341
	342	icd->error = 0;
	343	icd->bytes_done[0] = icd->bytes_done[1] = 0;
	344
	345	for (i = 0; i < icd->nr; i++) {
	346	io_u = td->io_ops->event(td, i);
	347
	348	io_completed(td, io_u, icd);
	349	put_io_u(td, io_u);
	350	}
	351	}
	352
	353