Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 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 | |
| 24 | /* |
Jens Axboe | df41558 | 2006-10-20 11:41:03 +0200 | [diff] [blame] | 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 | { |
Jens Axboe | afdbe58 | 2007-02-10 19:01:57 +0100 | [diff] [blame] | 30 | unsigned int min_bs = td->rw_min_bs; |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 31 | unsigned long long block; |
| 32 | unsigned int blocks; |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 33 | unsigned int nr_blocks; |
Jens Axboe | df41558 | 2006-10-20 11:41:03 +0200 | [diff] [blame] | 34 | |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 35 | block = io_u->offset / (unsigned long long) min_bs; |
| 36 | blocks = 0; |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 37 | nr_blocks = (io_u->buflen + min_bs - 1) / min_bs; |
| 38 | |
| 39 | while (blocks < nr_blocks) { |
Jens Axboe | df41558 | 2006-10-20 11:41:03 +0200 | [diff] [blame] | 40 | unsigned int idx, bit; |
| 41 | |
| 42 | if (!random_map_free(td, f, block)) |
| 43 | break; |
| 44 | |
| 45 | idx = RAND_MAP_IDX(td, f, block); |
| 46 | bit = RAND_MAP_BIT(td, f, block); |
| 47 | |
| 48 | assert(idx < f->num_maps); |
| 49 | |
| 50 | f->file_map[idx] |= (1UL << bit); |
| 51 | block++; |
| 52 | blocks++; |
| 53 | } |
| 54 | |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 55 | if ((blocks * min_bs) < io_u->buflen) |
| 56 | io_u->buflen = blocks * min_bs; |
Jens Axboe | df41558 | 2006-10-20 11:41:03 +0200 | [diff] [blame] | 57 | } |
| 58 | |
| 59 | /* |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 60 | * Return the next free block in the map. |
| 61 | */ |
| 62 | static int get_next_free_block(struct thread_data *td, struct fio_file *f, |
| 63 | unsigned long long *b) |
| 64 | { |
| 65 | int i; |
| 66 | |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 67 | i = f->last_free_lookup; |
| 68 | *b = (i * BLOCKS_PER_MAP); |
Jens Axboe | ee88470 | 2006-12-20 10:58:07 +0100 | [diff] [blame] | 69 | while ((*b) * td->rw_min_bs < f->real_file_size) { |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 70 | if (f->file_map[i] != -1UL) { |
| 71 | *b += ffz(f->file_map[i]); |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 72 | f->last_free_lookup = i; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 73 | return 0; |
| 74 | } |
| 75 | |
| 76 | *b += BLOCKS_PER_MAP; |
| 77 | i++; |
| 78 | } |
| 79 | |
| 80 | return 1; |
| 81 | } |
| 82 | |
| 83 | /* |
| 84 | * For random io, generate a random new block and see if it's used. Repeat |
| 85 | * until we find a free one. For sequential io, just return the end of |
| 86 | * the last io issued. |
| 87 | */ |
| 88 | static int get_next_offset(struct thread_data *td, struct fio_file *f, |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 89 | struct io_u *io_u) |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 90 | { |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 91 | const int ddir = io_u->ddir; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 92 | unsigned long long b, rb; |
| 93 | long r; |
| 94 | |
| 95 | if (!td->sequential) { |
Jens Axboe | f697125 | 2006-11-15 10:00:31 +0100 | [diff] [blame] | 96 | unsigned long long max_blocks = f->file_size / td->min_bs[ddir]; |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 97 | int loops = 5; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 98 | |
| 99 | do { |
| 100 | r = os_random_long(&td->random_state); |
| 101 | b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0)); |
Jens Axboe | bb8895e | 2006-10-30 15:14:48 +0100 | [diff] [blame] | 102 | if (td->norandommap) |
| 103 | break; |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 104 | rb = b + (f->file_offset / td->min_bs[ddir]); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 105 | loops--; |
| 106 | } while (!random_map_free(td, f, rb) && loops); |
| 107 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 108 | /* |
| 109 | * if we failed to retrieve a truly random offset within |
| 110 | * the loops assigned, see if there are free ones left at all |
| 111 | */ |
| 112 | if (!loops && get_next_free_block(td, f, &b)) |
| 113 | return 1; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 114 | } else |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 115 | b = f->last_pos / td->min_bs[ddir]; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 116 | |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 117 | io_u->offset = (b * td->min_bs[ddir]) + f->file_offset; |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 118 | if (io_u->offset >= f->real_file_size) |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 119 | return 1; |
| 120 | |
| 121 | return 0; |
| 122 | } |
| 123 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 124 | static unsigned int get_next_buflen(struct thread_data *td, struct fio_file *f, |
| 125 | struct io_u *io_u) |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 126 | { |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 127 | const int ddir = io_u->ddir; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 128 | unsigned int buflen; |
| 129 | long r; |
| 130 | |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 131 | if (td->min_bs[ddir] == td->max_bs[ddir]) |
| 132 | buflen = td->min_bs[ddir]; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 133 | else { |
| 134 | r = os_random_long(&td->bsrange_state); |
Jens Axboe | 1e97cce | 2006-12-05 11:44:16 +0100 | [diff] [blame] | 135 | buflen = (unsigned int) (1 + (double) (td->max_bs[ddir] - 1) * r / (RAND_MAX + 1.0)); |
Jens Axboe | 690adba | 2006-10-30 15:25:09 +0100 | [diff] [blame] | 136 | if (!td->bs_unaligned) |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 137 | buflen = (buflen + td->min_bs[ddir] - 1) & ~(td->min_bs[ddir] - 1); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 138 | } |
| 139 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 140 | while (buflen + io_u->offset > f->real_file_size) { |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 141 | /* |
| 142 | * if using direct/raw io, we may not be able to |
| 143 | * shrink the size. so just fail it. |
| 144 | */ |
| 145 | if (td->io_ops->flags & FIO_RAWIO) |
| 146 | return 0; |
| 147 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 148 | if (buflen == td->min_bs[ddir]) |
| 149 | return 0; |
| 150 | |
| 151 | buflen = td->min_bs[ddir]; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 152 | } |
| 153 | |
| 154 | return buflen; |
| 155 | } |
| 156 | |
| 157 | /* |
| 158 | * Return the data direction for the next io_u. If the job is a |
| 159 | * mixed read/write workload, check the rwmix cycle and switch if |
| 160 | * necessary. |
| 161 | */ |
Jens Axboe | 1e97cce | 2006-12-05 11:44:16 +0100 | [diff] [blame] | 162 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 163 | { |
| 164 | if (td_rw(td)) { |
| 165 | struct timeval now; |
| 166 | unsigned long elapsed; |
| 167 | |
Jens Axboe | 02bcaa8 | 2006-11-24 10:42:00 +0100 | [diff] [blame] | 168 | fio_gettime(&now, NULL); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 169 | elapsed = mtime_since_now(&td->rwmix_switch); |
| 170 | |
| 171 | /* |
| 172 | * Check if it's time to seed a new data direction. |
| 173 | */ |
| 174 | if (elapsed >= td->rwmixcycle) { |
| 175 | unsigned int v; |
| 176 | long r; |
| 177 | |
| 178 | r = os_random_long(&td->rwmix_state); |
| 179 | v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0))); |
| 180 | if (v < td->rwmixread) |
| 181 | td->rwmix_ddir = DDIR_READ; |
| 182 | else |
| 183 | td->rwmix_ddir = DDIR_WRITE; |
| 184 | memcpy(&td->rwmix_switch, &now, sizeof(now)); |
| 185 | } |
| 186 | return td->rwmix_ddir; |
| 187 | } else if (td_read(td)) |
| 188 | return DDIR_READ; |
| 189 | else |
| 190 | return DDIR_WRITE; |
| 191 | } |
| 192 | |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 193 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
| 194 | { |
| 195 | io_u->file = NULL; |
| 196 | list_del(&io_u->list); |
| 197 | list_add(&io_u->list, &td->io_u_freelist); |
| 198 | td->cur_depth--; |
| 199 | } |
| 200 | |
| 201 | static int fill_io_u(struct thread_data *td, struct fio_file *f, |
| 202 | struct io_u *io_u) |
| 203 | { |
| 204 | /* |
| 205 | * If using an iolog, grab next piece if any available. |
| 206 | */ |
| 207 | if (td->read_iolog) |
| 208 | return read_iolog_get(td, io_u); |
| 209 | |
| 210 | /* |
Jens Axboe | 87dc1ab | 2006-10-24 14:41:26 +0200 | [diff] [blame] | 211 | * see if it's time to sync |
| 212 | */ |
| 213 | if (td->fsync_blocks && !(td->io_blocks[DDIR_WRITE] % td->fsync_blocks) |
| 214 | && should_fsync(td)) { |
| 215 | io_u->ddir = DDIR_SYNC; |
| 216 | io_u->file = f; |
| 217 | return 0; |
| 218 | } |
| 219 | |
Jens Axboe | a00735e | 2006-11-03 08:58:08 +0100 | [diff] [blame] | 220 | io_u->ddir = get_rw_ddir(td); |
| 221 | |
Jens Axboe | 87dc1ab | 2006-10-24 14:41:26 +0200 | [diff] [blame] | 222 | /* |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 223 | * No log, let the seq/rand engine retrieve the next buflen and |
| 224 | * position. |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 225 | */ |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 226 | if (get_next_offset(td, f, io_u)) |
| 227 | return 1; |
Jens Axboe | c685b5b | 2007-02-10 20:02:28 +0100 | [diff] [blame] | 228 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 229 | io_u->buflen = get_next_buflen(td, f, io_u); |
| 230 | if (!io_u->buflen) |
| 231 | return 1; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 232 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 233 | /* |
| 234 | * mark entry before potentially trimming io_u |
| 235 | */ |
| 236 | if (!td->read_iolog && !td->sequential && !td->norandommap) |
| 237 | mark_random_map(td, f, io_u); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 238 | |
Jens Axboe | bca4ed4 | 2007-02-12 05:13:23 +0100 | [diff] [blame^] | 239 | /* |
| 240 | * If using a write iolog, store this entry. |
| 241 | */ |
| 242 | if (td->write_iolog_file) |
| 243 | write_iolog_put(td, io_u); |
| 244 | |
| 245 | io_u->file = f; |
| 246 | return 0; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 247 | } |
| 248 | |
Jens Axboe | 71619dc | 2007-01-13 23:56:33 +0100 | [diff] [blame] | 249 | static void io_u_mark_depth(struct thread_data *td) |
| 250 | { |
| 251 | int index = 0; |
| 252 | |
| 253 | switch (td->cur_depth) { |
| 254 | default: |
| 255 | index++; |
| 256 | case 32 ... 63: |
| 257 | index++; |
| 258 | case 16 ... 31: |
| 259 | index++; |
| 260 | case 8 ... 15: |
| 261 | index++; |
| 262 | case 4 ... 7: |
| 263 | index++; |
| 264 | case 2 ... 3: |
| 265 | index++; |
| 266 | case 1: |
| 267 | break; |
| 268 | } |
| 269 | |
| 270 | td->io_u_map[index]++; |
| 271 | td->total_io_u++; |
| 272 | } |
| 273 | |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 274 | struct io_u *__get_io_u(struct thread_data *td) |
| 275 | { |
| 276 | struct io_u *io_u = NULL; |
| 277 | |
| 278 | if (!queue_full(td)) { |
| 279 | io_u = list_entry(td->io_u_freelist.next, struct io_u, list); |
| 280 | |
Jens Axboe | 6040dab | 2006-10-24 19:38:15 +0200 | [diff] [blame] | 281 | io_u->buflen = 0; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 282 | io_u->error = 0; |
| 283 | io_u->resid = 0; |
| 284 | list_del(&io_u->list); |
| 285 | list_add(&io_u->list, &td->io_u_busylist); |
| 286 | td->cur_depth++; |
Jens Axboe | 71619dc | 2007-01-13 23:56:33 +0100 | [diff] [blame] | 287 | io_u_mark_depth(td); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 288 | } |
| 289 | |
| 290 | return io_u; |
| 291 | } |
| 292 | |
| 293 | /* |
| 294 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, |
| 295 | * etc. The returned io_u is fully ready to be prepped and submitted. |
| 296 | */ |
| 297 | struct io_u *get_io_u(struct thread_data *td, struct fio_file *f) |
| 298 | { |
| 299 | struct io_u *io_u; |
| 300 | |
| 301 | io_u = __get_io_u(td); |
| 302 | if (!io_u) |
| 303 | return NULL; |
| 304 | |
| 305 | if (td->zone_bytes >= td->zone_size) { |
| 306 | td->zone_bytes = 0; |
| 307 | f->last_pos += td->zone_skip; |
| 308 | } |
| 309 | |
| 310 | if (fill_io_u(td, f, io_u)) { |
| 311 | put_io_u(td, io_u); |
| 312 | return NULL; |
| 313 | } |
| 314 | |
Jens Axboe | ee88470 | 2006-12-20 10:58:07 +0100 | [diff] [blame] | 315 | if (io_u->buflen + io_u->offset > f->real_file_size) { |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 316 | if (td->io_ops->flags & FIO_RAWIO) { |
| 317 | put_io_u(td, io_u); |
| 318 | return NULL; |
| 319 | } |
| 320 | |
Jens Axboe | ee88470 | 2006-12-20 10:58:07 +0100 | [diff] [blame] | 321 | io_u->buflen = f->real_file_size - io_u->offset; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 322 | } |
| 323 | |
Jens Axboe | 87dc1ab | 2006-10-24 14:41:26 +0200 | [diff] [blame] | 324 | if (io_u->ddir != DDIR_SYNC) { |
| 325 | if (!io_u->buflen) { |
| 326 | put_io_u(td, io_u); |
| 327 | return NULL; |
| 328 | } |
| 329 | |
Jens Axboe | 87dc1ab | 2006-10-24 14:41:26 +0200 | [diff] [blame] | 330 | f->last_pos += io_u->buflen; |
| 331 | |
| 332 | if (td->verify != VERIFY_NONE) |
| 333 | populate_verify_io_u(td, io_u); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 334 | } |
| 335 | |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 336 | if (td_io_prep(td, io_u)) { |
| 337 | put_io_u(td, io_u); |
| 338 | return NULL; |
| 339 | } |
| 340 | |
Jens Axboe | 165faf1 | 2007-02-07 11:30:37 +0100 | [diff] [blame] | 341 | /* |
| 342 | * Set io data pointers. |
| 343 | */ |
Jens Axboe | cec6b55 | 2007-02-06 20:15:38 +0100 | [diff] [blame] | 344 | io_u->xfer_buf = io_u->buf; |
| 345 | io_u->xfer_buflen = io_u->buflen; |
Jens Axboe | 165faf1 | 2007-02-07 11:30:37 +0100 | [diff] [blame] | 346 | |
Jens Axboe | 02bcaa8 | 2006-11-24 10:42:00 +0100 | [diff] [blame] | 347 | fio_gettime(&io_u->start_time, NULL); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 348 | return io_u; |
| 349 | } |
| 350 | |
| 351 | void io_completed(struct thread_data *td, struct io_u *io_u, |
| 352 | struct io_completion_data *icd) |
| 353 | { |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 354 | unsigned long msec; |
| 355 | |
Jens Axboe | 87dc1ab | 2006-10-24 14:41:26 +0200 | [diff] [blame] | 356 | if (io_u->ddir == DDIR_SYNC) { |
| 357 | td->last_was_sync = 1; |
| 358 | return; |
| 359 | } |
| 360 | |
| 361 | td->last_was_sync = 0; |
| 362 | |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 363 | if (!io_u->error) { |
| 364 | unsigned int bytes = io_u->buflen - io_u->resid; |
Jens Axboe | 1e97cce | 2006-12-05 11:44:16 +0100 | [diff] [blame] | 365 | const enum fio_ddir idx = io_u->ddir; |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 366 | |
| 367 | td->io_blocks[idx]++; |
| 368 | td->io_bytes[idx] += bytes; |
| 369 | td->zone_bytes += bytes; |
| 370 | td->this_io_bytes[idx] += bytes; |
| 371 | |
Jens Axboe | 02bcaa8 | 2006-11-24 10:42:00 +0100 | [diff] [blame] | 372 | io_u->file->last_completed_pos = io_u->offset + io_u->buflen; |
| 373 | |
| 374 | msec = mtime_since(&io_u->issue_time, &icd->time); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 375 | |
| 376 | add_clat_sample(td, idx, msec); |
Jens Axboe | 02bcaa8 | 2006-11-24 10:42:00 +0100 | [diff] [blame] | 377 | add_bw_sample(td, idx, &icd->time); |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 378 | |
| 379 | if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE) |
| 380 | log_io_piece(td, io_u); |
| 381 | |
| 382 | icd->bytes_done[idx] += bytes; |
| 383 | } else |
| 384 | icd->error = io_u->error; |
| 385 | } |
| 386 | |
| 387 | void ios_completed(struct thread_data *td, struct io_completion_data *icd) |
| 388 | { |
| 389 | struct io_u *io_u; |
| 390 | int i; |
| 391 | |
Jens Axboe | 02bcaa8 | 2006-11-24 10:42:00 +0100 | [diff] [blame] | 392 | fio_gettime(&icd->time, NULL); |
| 393 | |
Jens Axboe | 10ba535 | 2006-10-20 11:39:27 +0200 | [diff] [blame] | 394 | icd->error = 0; |
| 395 | icd->bytes_done[0] = icd->bytes_done[1] = 0; |
| 396 | |
| 397 | for (i = 0; i < icd->nr; i++) { |
| 398 | io_u = td->io_ops->event(td, i); |
| 399 | |
| 400 | io_completed(td, io_u, icd); |
| 401 | put_io_u(td, io_u); |
| 402 | } |
| 403 | } |