static void mark_random_map(struct thread_data *td, struct fio_file *f,
struct io_u *io_u)
{
- unsigned int min_bs = td->min_bs[io_u->ddir];
+ unsigned int min_bs = td->rw_min_bs;
unsigned long long block;
unsigned int blocks;
+ unsigned int nr_blocks;
block = io_u->offset / (unsigned long long) min_bs;
blocks = 0;
- while (blocks < (io_u->buflen / min_bs)) {
+ nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
+
+ while (blocks < nr_blocks) {
unsigned int idx, bit;
if (!random_map_free(td, f, block))
{
int i;
- *b = 0;
- i = 0;
- while ((*b) * td->rw_min_bs < f->file_size) {
+ i = f->last_free_lookup;
+ *b = (i * BLOCKS_PER_MAP);
+ while ((*b) * td->rw_min_bs < f->real_file_size) {
if (f->file_map[i] != -1UL) {
*b += ffz(f->file_map[i]);
+ f->last_free_lookup = i;
return 0;
}
* the last io issued.
*/
static int get_next_offset(struct thread_data *td, struct fio_file *f,
- unsigned long long *offset, int ddir)
+ struct io_u *io_u)
{
+ const int ddir = io_u->ddir;
unsigned long long b, rb;
long r;
if (!td->sequential) {
unsigned long long max_blocks = f->file_size / td->min_bs[ddir];
- int loops = 50;
+ int loops = 5;
do {
r = os_random_long(&td->random_state);
if (!loops) {
if (get_next_free_block(td, f, &b))
return 1;
+
+ b += f->file_offset / td->min_bs[ddir];
}
} else
b = f->last_pos / td->min_bs[ddir];
- *offset = (b * td->min_bs[ddir]) + f->file_offset;
- if (*offset > f->file_size)
+ io_u->offset = (b * td->min_bs[ddir]) + f->file_offset;
+ if (io_u->offset > f->real_file_size)
return 1;
return 0;
io_u->ddir = get_rw_ddir(td);
/*
- * No log, let the seq/rand engine retrieve the next position.
+ * No log, let the seq/rand engine retrieve the next buflen and
+ * position.
*/
- if (!get_next_offset(td, f, &io_u->offset, io_u->ddir)) {
- io_u->buflen = get_next_buflen(td, io_u->ddir);
- if (io_u->buflen) {
+ io_u->buflen = get_next_buflen(td, io_u->ddir);
+ if (io_u->buflen) {
+ if (!get_next_offset(td, f, io_u)) {
+ /*
+ * mark entry before potentially trimming io_u
+ */
+ if (!td->read_iolog && !td->sequential &&
+ !td->norandommap)
+ mark_random_map(td, f, io_u);
+
/*
* If using a write iolog, store this entry.
*/
return 1;
}
+static void io_u_mark_depth(struct thread_data *td)
+{
+ int index = 0;
+
+ switch (td->cur_depth) {
+ default:
+ index++;
+ case 32 ... 63:
+ index++;
+ case 16 ... 31:
+ index++;
+ case 8 ... 15:
+ index++;
+ case 4 ... 7:
+ index++;
+ case 2 ... 3:
+ index++;
+ case 1:
+ break;
+ }
+
+ td->io_u_map[index]++;
+ td->total_io_u++;
+}
+
struct io_u *__get_io_u(struct thread_data *td)
{
struct io_u *io_u = NULL;
list_del(&io_u->list);
list_add(&io_u->list, &td->io_u_busylist);
td->cur_depth++;
+ io_u_mark_depth(td);
}
return io_u;
return NULL;
}
- if (io_u->buflen + io_u->offset > f->file_size) {
+ if (io_u->buflen + io_u->offset > f->real_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;
+ io_u->buflen = f->real_file_size - io_u->offset;
}
if (io_u->ddir != DDIR_SYNC) {
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)
return NULL;
}
+ /*
+ * Set io data pointers.
+ */
+ io_u->xfer_buf = io_u->buf;
+ io_u->xfer_buflen = io_u->buflen;
+
fio_gettime(&io_u->start_time, NULL);
return io_u;
}
put_io_u(td, io_u);
}
}
-
-