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