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> | |
0c6e7517 | 6 | #include <assert.h> |
10ba535a JA |
7 | |
8 | #include "fio.h" | |
5973cafb | 9 | #include "hash.h" |
10ba535a | 10 | |
5945b9b4 JA |
11 | /* |
12 | * Change this define to play with the timeout handling | |
13 | */ | |
14 | #undef FIO_USE_TIMEOUT | |
15 | ||
97601024 JA |
16 | struct io_completion_data { |
17 | int nr; /* input */ | |
97601024 JA |
18 | |
19 | int error; /* output */ | |
20 | unsigned long bytes_done[2]; /* output */ | |
21 | struct timeval time; /* output */ | |
22 | }; | |
23 | ||
10ba535a JA |
24 | /* |
25 | * The ->file_map[] contains a map of blocks we have or have not done io | |
26 | * to yet. Used to make sure we cover the entire range in a fair fashion. | |
27 | */ | |
aec2de20 | 28 | static int random_map_free(struct fio_file *f, const unsigned long long block) |
10ba535a | 29 | { |
aec2de20 JA |
30 | unsigned int idx = RAND_MAP_IDX(f, block); |
31 | unsigned int bit = RAND_MAP_BIT(f, block); | |
10ba535a | 32 | |
84422acd JA |
33 | dprint(FD_RANDOM, "free: b=%llu, idx=%u, bit=%u\n", block, idx, bit); |
34 | ||
10ba535a JA |
35 | return (f->file_map[idx] & (1UL << bit)) == 0; |
36 | } | |
37 | ||
df415585 JA |
38 | /* |
39 | * Mark a given offset as used in the map. | |
40 | */ | |
9bf2061e | 41 | static void mark_random_map(struct thread_data *td, struct io_u *io_u) |
df415585 | 42 | { |
2dc1bbeb | 43 | unsigned int min_bs = td->o.rw_min_bs; |
9bf2061e | 44 | struct fio_file *f = io_u->file; |
a00735e6 JA |
45 | unsigned long long block; |
46 | unsigned int blocks; | |
c685b5b2 | 47 | unsigned int nr_blocks; |
df415585 | 48 | |
b9c5b644 | 49 | block = (io_u->offset - f->file_offset) / (unsigned long long) min_bs; |
a00735e6 | 50 | blocks = 0; |
c685b5b2 JA |
51 | nr_blocks = (io_u->buflen + min_bs - 1) / min_bs; |
52 | ||
53 | while (blocks < nr_blocks) { | |
df415585 JA |
54 | unsigned int idx, bit; |
55 | ||
1e3d53ac JA |
56 | /* |
57 | * If we have a mixed random workload, we may | |
58 | * encounter blocks we already did IO to. | |
59 | */ | |
aec2de20 | 60 | if ((td->o.ddir_nr == 1) && !random_map_free(f, block)) |
df415585 JA |
61 | break; |
62 | ||
aec2de20 JA |
63 | idx = RAND_MAP_IDX(f, block); |
64 | bit = RAND_MAP_BIT(f, block); | |
df415585 | 65 | |
0032bf9f | 66 | fio_assert(td, idx < f->num_maps); |
df415585 JA |
67 | |
68 | f->file_map[idx] |= (1UL << bit); | |
69 | block++; | |
70 | blocks++; | |
71 | } | |
72 | ||
a00735e6 JA |
73 | if ((blocks * min_bs) < io_u->buflen) |
74 | io_u->buflen = blocks * min_bs; | |
df415585 JA |
75 | } |
76 | ||
2ba1c290 | 77 | static inline unsigned long long last_block(struct thread_data *td, |
4ba66134 JA |
78 | struct fio_file *f, |
79 | enum fio_ddir ddir) | |
2ba1c290 JA |
80 | { |
81 | unsigned long long max_blocks; | |
d9dd70f7 | 82 | unsigned long long max_size; |
2ba1c290 | 83 | |
d9dd70f7 JA |
84 | /* |
85 | * Hmm, should we make sure that ->io_size <= ->real_file_size? | |
86 | */ | |
87 | max_size = f->io_size; | |
88 | if (max_size > f->real_file_size) | |
89 | max_size = f->real_file_size; | |
90 | ||
91 | max_blocks = max_size / (unsigned long long) td->o.min_bs[ddir]; | |
2ba1c290 JA |
92 | if (!max_blocks) |
93 | return 0; | |
94 | ||
67778e88 | 95 | return max_blocks; |
2ba1c290 JA |
96 | } |
97 | ||
10ba535a JA |
98 | /* |
99 | * Return the next free block in the map. | |
100 | */ | |
101 | static int get_next_free_block(struct thread_data *td, struct fio_file *f, | |
4ba66134 | 102 | enum fio_ddir ddir, unsigned long long *b) |
10ba535a | 103 | { |
84422acd | 104 | unsigned long long min_bs = td->o.rw_min_bs; |
10ba535a JA |
105 | int i; |
106 | ||
c685b5b2 JA |
107 | i = f->last_free_lookup; |
108 | *b = (i * BLOCKS_PER_MAP); | |
84422acd | 109 | while ((*b) * min_bs < f->real_file_size) { |
10ba535a | 110 | if (f->file_map[i] != -1UL) { |
b12ebc65 | 111 | *b += fio_ffz(f->file_map[i]); |
4ba66134 | 112 | if (*b > last_block(td, f, ddir)) |
2ba1c290 | 113 | break; |
c685b5b2 | 114 | f->last_free_lookup = i; |
10ba535a JA |
115 | return 0; |
116 | } | |
117 | ||
118 | *b += BLOCKS_PER_MAP; | |
119 | i++; | |
120 | } | |
121 | ||
2ba1c290 | 122 | dprint(FD_IO, "failed finding a free block\n"); |
10ba535a JA |
123 | return 1; |
124 | } | |
125 | ||
ec4015da | 126 | static int get_next_rand_offset(struct thread_data *td, struct fio_file *f, |
4ba66134 | 127 | enum fio_ddir ddir, unsigned long long *b) |
ec4015da | 128 | { |
84422acd | 129 | unsigned long long r; |
ec4015da JA |
130 | int loops = 5; |
131 | ||
132 | do { | |
133 | r = os_random_long(&td->random_state); | |
84422acd | 134 | dprint(FD_RANDOM, "off rand %llu\n", r); |
5ec10eaa JA |
135 | *b = (last_block(td, f, ddir) - 1) |
136 | * (r / ((unsigned long long) RAND_MAX + 1.0)); | |
2ba1c290 | 137 | |
43c63a78 JA |
138 | /* |
139 | * if we are not maintaining a random map, we are done. | |
140 | */ | |
303032ae | 141 | if (!file_randommap(td, f)) |
43c63a78 JA |
142 | return 0; |
143 | ||
144 | /* | |
84422acd | 145 | * calculate map offset and check if it's free |
43c63a78 | 146 | */ |
aec2de20 | 147 | if (random_map_free(f, *b)) |
43c63a78 JA |
148 | return 0; |
149 | ||
84422acd JA |
150 | dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n", |
151 | *b); | |
43c63a78 | 152 | } while (--loops); |
ec4015da JA |
153 | |
154 | /* | |
43c63a78 JA |
155 | * we get here, if we didn't suceed in looking up a block. generate |
156 | * a random start offset into the filemap, and find the first free | |
157 | * block from there. | |
ec4015da | 158 | */ |
43c63a78 JA |
159 | loops = 10; |
160 | do { | |
161 | f->last_free_lookup = (f->num_maps - 1) * (r / (RAND_MAX+1.0)); | |
4ba66134 | 162 | if (!get_next_free_block(td, f, ddir, b)) |
43c63a78 | 163 | return 0; |
ec4015da | 164 | |
43c63a78 JA |
165 | r = os_random_long(&td->random_state); |
166 | } while (--loops); | |
167 | ||
168 | /* | |
169 | * that didn't work either, try exhaustive search from the start | |
170 | */ | |
171 | f->last_free_lookup = 0; | |
4ba66134 | 172 | return get_next_free_block(td, f, ddir, b); |
ec4015da JA |
173 | } |
174 | ||
10ba535a JA |
175 | /* |
176 | * For random io, generate a random new block and see if it's used. Repeat | |
177 | * until we find a free one. For sequential io, just return the end of | |
178 | * the last io issued. | |
179 | */ | |
9bf2061e | 180 | static int get_next_offset(struct thread_data *td, struct io_u *io_u) |
10ba535a | 181 | { |
9bf2061e | 182 | struct fio_file *f = io_u->file; |
ec4015da | 183 | unsigned long long b; |
4ba66134 | 184 | enum fio_ddir ddir = io_u->ddir; |
10ba535a | 185 | |
ec4015da JA |
186 | if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) { |
187 | td->ddir_nr = td->o.ddir_nr; | |
211097b2 | 188 | |
4ba66134 | 189 | if (get_next_rand_offset(td, f, ddir, &b)) |
bca4ed4d | 190 | return 1; |
43063a1c | 191 | } else { |
0c3d768a | 192 | if (f->last_pos >= f->real_file_size) { |
4ba66134 JA |
193 | if (!td_random(td) || |
194 | get_next_rand_offset(td, f, ddir, &b)) | |
0c3d768a | 195 | return 1; |
bcdedd0a | 196 | } else |
4ba66134 | 197 | b = (f->last_pos - f->file_offset) / td->o.min_bs[ddir]; |
43063a1c | 198 | } |
10ba535a | 199 | |
009bd847 JA |
200 | io_u->offset = b * td->o.min_bs[ddir]; |
201 | if (io_u->offset >= f->io_size) { | |
202 | dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n", | |
203 | io_u->offset, f->io_size); | |
204 | return 1; | |
205 | } | |
206 | ||
207 | io_u->offset += f->file_offset; | |
2ba1c290 JA |
208 | if (io_u->offset >= f->real_file_size) { |
209 | dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n", | |
210 | io_u->offset, f->real_file_size); | |
10ba535a | 211 | return 1; |
2ba1c290 | 212 | } |
10ba535a JA |
213 | |
214 | return 0; | |
215 | } | |
216 | ||
9bf2061e | 217 | static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u) |
10ba535a | 218 | { |
bca4ed4d | 219 | const int ddir = io_u->ddir; |
fc4398fd | 220 | unsigned int buflen = buflen; /* silence dumb gcc warning */ |
10ba535a JA |
221 | long r; |
222 | ||
2dc1bbeb JA |
223 | if (td->o.min_bs[ddir] == td->o.max_bs[ddir]) |
224 | buflen = td->o.min_bs[ddir]; | |
10ba535a JA |
225 | else { |
226 | r = os_random_long(&td->bsrange_state); | |
5ec10eaa JA |
227 | if (!td->o.bssplit_nr) { |
228 | buflen = (unsigned int) | |
229 | (1 + (double) (td->o.max_bs[ddir] - 1) | |
230 | * r / (RAND_MAX + 1.0)); | |
231 | } else { | |
564ca972 JA |
232 | long perc = 0; |
233 | unsigned int i; | |
234 | ||
235 | for (i = 0; i < td->o.bssplit_nr; i++) { | |
236 | struct bssplit *bsp = &td->o.bssplit[i]; | |
237 | ||
238 | buflen = bsp->bs; | |
239 | perc += bsp->perc; | |
240 | if (r <= ((LONG_MAX / 100L) * perc)) | |
241 | break; | |
242 | } | |
243 | } | |
5ec10eaa JA |
244 | if (!td->o.bs_unaligned) { |
245 | buflen = (buflen + td->o.min_bs[ddir] - 1) | |
246 | & ~(td->o.min_bs[ddir] - 1); | |
247 | } | |
10ba535a JA |
248 | } |
249 | ||
4ba66134 JA |
250 | if (io_u->offset + buflen > io_u->file->real_file_size) { |
251 | dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen, | |
252 | td->o.min_bs[ddir], ddir); | |
6a5e6884 | 253 | buflen = td->o.min_bs[ddir]; |
4ba66134 | 254 | } |
6a5e6884 | 255 | |
10ba535a JA |
256 | return buflen; |
257 | } | |
258 | ||
afe24a5a JA |
259 | static void set_rwmix_bytes(struct thread_data *td) |
260 | { | |
afe24a5a JA |
261 | unsigned int diff; |
262 | ||
263 | /* | |
264 | * we do time or byte based switch. this is needed because | |
265 | * buffered writes may issue a lot quicker than they complete, | |
266 | * whereas reads do not. | |
267 | */ | |
e47f799f | 268 | diff = td->o.rwmix[td->rwmix_ddir ^ 1]; |
04c540d9 | 269 | td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100; |
e47f799f JA |
270 | } |
271 | ||
272 | static inline enum fio_ddir get_rand_ddir(struct thread_data *td) | |
273 | { | |
274 | unsigned int v; | |
275 | long r; | |
276 | ||
277 | r = os_random_long(&td->rwmix_state); | |
278 | v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0))); | |
04c540d9 | 279 | if (v <= td->o.rwmix[DDIR_READ]) |
e47f799f JA |
280 | return DDIR_READ; |
281 | ||
282 | return DDIR_WRITE; | |
afe24a5a JA |
283 | } |
284 | ||
10ba535a JA |
285 | /* |
286 | * Return the data direction for the next io_u. If the job is a | |
287 | * mixed read/write workload, check the rwmix cycle and switch if | |
288 | * necessary. | |
289 | */ | |
1e97cce9 | 290 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
10ba535a JA |
291 | { |
292 | if (td_rw(td)) { | |
10ba535a JA |
293 | /* |
294 | * Check if it's time to seed a new data direction. | |
295 | */ | |
e4928662 | 296 | if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) { |
e47f799f | 297 | unsigned long long max_bytes; |
5ec10eaa | 298 | enum fio_ddir ddir; |
e47f799f JA |
299 | |
300 | /* | |
301 | * Put a top limit on how many bytes we do for | |
302 | * one data direction, to avoid overflowing the | |
303 | * ranges too much | |
304 | */ | |
305 | ddir = get_rand_ddir(td); | |
306 | max_bytes = td->this_io_bytes[ddir]; | |
5ec10eaa JA |
307 | if (max_bytes >= |
308 | (td->o.size * td->o.rwmix[ddir] / 100)) { | |
e4928662 | 309 | if (!td->rw_end_set[ddir]) |
38d77cae | 310 | td->rw_end_set[ddir] = 1; |
e4928662 | 311 | |
e47f799f | 312 | ddir ^= 1; |
38d77cae | 313 | } |
e47f799f JA |
314 | |
315 | if (ddir != td->rwmix_ddir) | |
316 | set_rwmix_bytes(td); | |
317 | ||
318 | td->rwmix_ddir = ddir; | |
10ba535a JA |
319 | } |
320 | return td->rwmix_ddir; | |
321 | } else if (td_read(td)) | |
322 | return DDIR_READ; | |
323 | else | |
324 | return DDIR_WRITE; | |
325 | } | |
326 | ||
60f2c658 JA |
327 | static void put_file_log(struct thread_data *td, struct fio_file *f) |
328 | { | |
329 | int ret = put_file(td, f); | |
330 | ||
331 | if (ret) | |
332 | td_verror(td, ret, "file close"); | |
333 | } | |
334 | ||
10ba535a JA |
335 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
336 | { | |
0c6e7517 JA |
337 | assert((io_u->flags & IO_U_F_FREE) == 0); |
338 | io_u->flags |= IO_U_F_FREE; | |
339 | ||
60f2c658 JA |
340 | if (io_u->file) |
341 | put_file_log(td, io_u->file); | |
2dbdab7e | 342 | |
10ba535a JA |
343 | io_u->file = NULL; |
344 | list_del(&io_u->list); | |
345 | list_add(&io_u->list, &td->io_u_freelist); | |
346 | td->cur_depth--; | |
347 | } | |
348 | ||
755200a3 JA |
349 | void requeue_io_u(struct thread_data *td, struct io_u **io_u) |
350 | { | |
351 | struct io_u *__io_u = *io_u; | |
352 | ||
4d2e0f49 | 353 | __io_u->flags |= IO_U_F_FREE; |
e4f54adb JA |
354 | if ((__io_u->flags & IO_U_F_FLIGHT) && (__io_u->ddir != DDIR_SYNC)) |
355 | td->io_issues[__io_u->ddir]--; | |
5ec10eaa | 356 | |
4d2e0f49 JA |
357 | __io_u->flags &= ~IO_U_F_FLIGHT; |
358 | ||
755200a3 JA |
359 | list_del(&__io_u->list); |
360 | list_add_tail(&__io_u->list, &td->io_u_requeues); | |
361 | td->cur_depth--; | |
362 | *io_u = NULL; | |
363 | } | |
364 | ||
9bf2061e | 365 | static int fill_io_u(struct thread_data *td, struct io_u *io_u) |
10ba535a | 366 | { |
b4c5e1ac JA |
367 | if (td->io_ops->flags & FIO_NOIO) |
368 | goto out; | |
369 | ||
87dc1ab1 JA |
370 | /* |
371 | * see if it's time to sync | |
372 | */ | |
2dc1bbeb JA |
373 | if (td->o.fsync_blocks && |
374 | !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) && | |
375 | td->io_issues[DDIR_WRITE] && should_fsync(td)) { | |
87dc1ab1 | 376 | io_u->ddir = DDIR_SYNC; |
c38e9468 | 377 | goto out; |
87dc1ab1 JA |
378 | } |
379 | ||
a00735e6 JA |
380 | io_u->ddir = get_rw_ddir(td); |
381 | ||
48f5abd3 JA |
382 | /* |
383 | * See if it's time to switch to a new zone | |
384 | */ | |
385 | if (td->zone_bytes >= td->o.zone_size) { | |
386 | td->zone_bytes = 0; | |
387 | io_u->file->last_pos += td->o.zone_skip; | |
388 | td->io_skip_bytes += td->o.zone_skip; | |
389 | } | |
390 | ||
10ba535a | 391 | /* |
c685b5b2 JA |
392 | * No log, let the seq/rand engine retrieve the next buflen and |
393 | * position. | |
10ba535a | 394 | */ |
2ba1c290 JA |
395 | if (get_next_offset(td, io_u)) { |
396 | dprint(FD_IO, "io_u %p, failed getting offset\n", io_u); | |
bca4ed4d | 397 | return 1; |
2ba1c290 | 398 | } |
10ba535a | 399 | |
9bf2061e | 400 | io_u->buflen = get_next_buflen(td, io_u); |
2ba1c290 JA |
401 | if (!io_u->buflen) { |
402 | dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u); | |
bca4ed4d | 403 | return 1; |
2ba1c290 | 404 | } |
bca4ed4d | 405 | |
2ba1c290 JA |
406 | if (io_u->offset + io_u->buflen > io_u->file->real_file_size) { |
407 | dprint(FD_IO, "io_u %p, offset too large\n", io_u); | |
4ba66134 JA |
408 | dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset, |
409 | io_u->buflen, io_u->file->real_file_size); | |
6a5e6884 | 410 | return 1; |
2ba1c290 | 411 | } |
6a5e6884 | 412 | |
bca4ed4d JA |
413 | /* |
414 | * mark entry before potentially trimming io_u | |
415 | */ | |
303032ae | 416 | if (td_random(td) && file_randommap(td, io_u->file)) |
9bf2061e | 417 | mark_random_map(td, io_u); |
bca4ed4d JA |
418 | |
419 | /* | |
420 | * If using a write iolog, store this entry. | |
421 | */ | |
c38e9468 | 422 | out: |
2ba1c290 | 423 | dprint_io_u(io_u, "fill_io_u"); |
d9d91e39 | 424 | td->zone_bytes += io_u->buflen; |
f29b25a3 | 425 | log_io_u(td, io_u); |
bca4ed4d | 426 | return 0; |
10ba535a JA |
427 | } |
428 | ||
838bc709 JA |
429 | static void __io_u_mark_map(unsigned int *map, unsigned int nr) |
430 | { | |
431 | int index = 0; | |
432 | ||
433 | switch (nr) { | |
434 | default: | |
435 | index = 6; | |
436 | break; | |
437 | case 33 ... 64: | |
438 | index = 5; | |
439 | break; | |
440 | case 17 ... 32: | |
441 | index = 4; | |
442 | break; | |
443 | case 9 ... 16: | |
444 | index = 3; | |
445 | break; | |
446 | case 5 ... 8: | |
447 | index = 2; | |
448 | break; | |
449 | case 1 ... 4: | |
450 | index = 1; | |
451 | case 0: | |
452 | break; | |
453 | } | |
454 | ||
455 | map[index]++; | |
456 | } | |
457 | ||
458 | void io_u_mark_submit(struct thread_data *td, unsigned int nr) | |
459 | { | |
460 | __io_u_mark_map(td->ts.io_u_submit, nr); | |
461 | td->ts.total_submit++; | |
462 | } | |
463 | ||
464 | void io_u_mark_complete(struct thread_data *td, unsigned int nr) | |
465 | { | |
466 | __io_u_mark_map(td->ts.io_u_complete, nr); | |
467 | td->ts.total_complete++; | |
468 | } | |
469 | ||
d8005759 | 470 | void io_u_mark_depth(struct thread_data *td, unsigned int nr) |
71619dc2 JA |
471 | { |
472 | int index = 0; | |
473 | ||
474 | switch (td->cur_depth) { | |
475 | default: | |
a783e61a JA |
476 | index = 6; |
477 | break; | |
71619dc2 | 478 | case 32 ... 63: |
a783e61a JA |
479 | index = 5; |
480 | break; | |
71619dc2 | 481 | case 16 ... 31: |
a783e61a JA |
482 | index = 4; |
483 | break; | |
71619dc2 | 484 | case 8 ... 15: |
a783e61a JA |
485 | index = 3; |
486 | break; | |
71619dc2 | 487 | case 4 ... 7: |
a783e61a JA |
488 | index = 2; |
489 | break; | |
71619dc2 | 490 | case 2 ... 3: |
a783e61a | 491 | index = 1; |
71619dc2 JA |
492 | case 1: |
493 | break; | |
494 | } | |
495 | ||
3bec7ae0 | 496 | td->ts.io_u_map[index] += nr; |
71619dc2 JA |
497 | } |
498 | ||
04a0feae JA |
499 | static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec) |
500 | { | |
501 | int index = 0; | |
502 | ||
503 | assert(usec < 1000); | |
504 | ||
505 | switch (usec) { | |
506 | case 750 ... 999: | |
507 | index = 9; | |
508 | break; | |
509 | case 500 ... 749: | |
510 | index = 8; | |
511 | break; | |
512 | case 250 ... 499: | |
513 | index = 7; | |
514 | break; | |
515 | case 100 ... 249: | |
516 | index = 6; | |
517 | break; | |
518 | case 50 ... 99: | |
519 | index = 5; | |
520 | break; | |
521 | case 20 ... 49: | |
522 | index = 4; | |
523 | break; | |
524 | case 10 ... 19: | |
525 | index = 3; | |
526 | break; | |
527 | case 4 ... 9: | |
528 | index = 2; | |
529 | break; | |
530 | case 2 ... 3: | |
531 | index = 1; | |
532 | case 0 ... 1: | |
533 | break; | |
534 | } | |
535 | ||
536 | assert(index < FIO_IO_U_LAT_U_NR); | |
537 | td->ts.io_u_lat_u[index]++; | |
538 | } | |
539 | ||
540 | static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec) | |
ec118304 JA |
541 | { |
542 | int index = 0; | |
543 | ||
544 | switch (msec) { | |
545 | default: | |
04a0feae JA |
546 | index = 11; |
547 | break; | |
8abdce66 | 548 | case 1000 ... 1999: |
04a0feae JA |
549 | index = 10; |
550 | break; | |
8abdce66 | 551 | case 750 ... 999: |
04a0feae JA |
552 | index = 9; |
553 | break; | |
8abdce66 | 554 | case 500 ... 749: |
04a0feae JA |
555 | index = 8; |
556 | break; | |
8abdce66 | 557 | case 250 ... 499: |
04a0feae JA |
558 | index = 7; |
559 | break; | |
8abdce66 | 560 | case 100 ... 249: |
04a0feae JA |
561 | index = 6; |
562 | break; | |
8abdce66 | 563 | case 50 ... 99: |
04a0feae JA |
564 | index = 5; |
565 | break; | |
8abdce66 | 566 | case 20 ... 49: |
04a0feae JA |
567 | index = 4; |
568 | break; | |
8abdce66 | 569 | case 10 ... 19: |
04a0feae JA |
570 | index = 3; |
571 | break; | |
8abdce66 | 572 | case 4 ... 9: |
04a0feae JA |
573 | index = 2; |
574 | break; | |
ec118304 | 575 | case 2 ... 3: |
04a0feae | 576 | index = 1; |
ec118304 JA |
577 | case 0 ... 1: |
578 | break; | |
579 | } | |
580 | ||
04a0feae JA |
581 | assert(index < FIO_IO_U_LAT_M_NR); |
582 | td->ts.io_u_lat_m[index]++; | |
583 | } | |
584 | ||
585 | static void io_u_mark_latency(struct thread_data *td, unsigned long usec) | |
586 | { | |
587 | if (usec < 1000) | |
588 | io_u_mark_lat_usec(td, usec); | |
589 | else | |
590 | io_u_mark_lat_msec(td, usec / 1000); | |
ec118304 JA |
591 | } |
592 | ||
0aabe160 JA |
593 | /* |
594 | * Get next file to service by choosing one at random | |
595 | */ | |
1c178180 JA |
596 | static struct fio_file *get_next_file_rand(struct thread_data *td, int goodf, |
597 | int badf) | |
0aabe160 | 598 | { |
0aabe160 | 599 | struct fio_file *f; |
1c178180 | 600 | int fno; |
0aabe160 JA |
601 | |
602 | do { | |
7c83c089 JA |
603 | long r = os_random_long(&td->next_file_state); |
604 | ||
5ec10eaa JA |
605 | fno = (unsigned int) ((double) td->o.nr_files |
606 | * (r / (RAND_MAX + 1.0))); | |
126d65c6 | 607 | f = td->files[fno]; |
059e63c0 JA |
608 | if (f->flags & FIO_FILE_DONE) |
609 | continue; | |
1c178180 | 610 | |
2ba1c290 JA |
611 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) { |
612 | dprint(FD_FILE, "get_next_file_rand: %p\n", f); | |
0aabe160 | 613 | return f; |
2ba1c290 | 614 | } |
0aabe160 JA |
615 | } while (1); |
616 | } | |
617 | ||
618 | /* | |
619 | * Get next file to service by doing round robin between all available ones | |
620 | */ | |
1c178180 JA |
621 | static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf, |
622 | int badf) | |
3d7c391d JA |
623 | { |
624 | unsigned int old_next_file = td->next_file; | |
625 | struct fio_file *f; | |
626 | ||
627 | do { | |
126d65c6 | 628 | f = td->files[td->next_file]; |
3d7c391d JA |
629 | |
630 | td->next_file++; | |
2dc1bbeb | 631 | if (td->next_file >= td->o.nr_files) |
3d7c391d JA |
632 | td->next_file = 0; |
633 | ||
d5ed68ea JA |
634 | if (f->flags & FIO_FILE_DONE) { |
635 | f = NULL; | |
059e63c0 | 636 | continue; |
d5ed68ea | 637 | } |
059e63c0 | 638 | |
1c178180 | 639 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) |
3d7c391d JA |
640 | break; |
641 | ||
642 | f = NULL; | |
643 | } while (td->next_file != old_next_file); | |
644 | ||
2ba1c290 | 645 | dprint(FD_FILE, "get_next_file_rr: %p\n", f); |
3d7c391d JA |
646 | return f; |
647 | } | |
648 | ||
bdb4e2e9 JA |
649 | static struct fio_file *get_next_file(struct thread_data *td) |
650 | { | |
1907dbc6 JA |
651 | struct fio_file *f; |
652 | ||
2dc1bbeb | 653 | assert(td->o.nr_files <= td->files_index); |
1c178180 | 654 | |
2ba1c290 | 655 | if (!td->nr_open_files || td->nr_done_files >= td->o.nr_files) { |
5ec10eaa JA |
656 | dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d," |
657 | " nr_files=%d\n", td->nr_open_files, | |
658 | td->nr_done_files, | |
659 | td->o.nr_files); | |
bdb4e2e9 | 660 | return NULL; |
2ba1c290 | 661 | } |
bdb4e2e9 | 662 | |
1907dbc6 | 663 | f = td->file_service_file; |
f11bd94d | 664 | if (f && (f->flags & FIO_FILE_OPEN) && td->file_service_left--) |
2ba1c290 | 665 | goto out; |
1907dbc6 | 666 | |
2dc1bbeb | 667 | if (td->o.file_service_type == FIO_FSERVICE_RR) |
1c178180 | 668 | f = get_next_file_rr(td, FIO_FILE_OPEN, FIO_FILE_CLOSING); |
bdb4e2e9 | 669 | else |
1c178180 | 670 | f = get_next_file_rand(td, FIO_FILE_OPEN, FIO_FILE_CLOSING); |
1907dbc6 JA |
671 | |
672 | td->file_service_file = f; | |
673 | td->file_service_left = td->file_service_nr - 1; | |
2ba1c290 JA |
674 | out: |
675 | dprint(FD_FILE, "get_next_file: %p\n", f); | |
1907dbc6 | 676 | return f; |
bdb4e2e9 JA |
677 | } |
678 | ||
1c178180 JA |
679 | static struct fio_file *find_next_new_file(struct thread_data *td) |
680 | { | |
681 | struct fio_file *f; | |
682 | ||
1020a139 JA |
683 | if (!td->nr_open_files || td->nr_done_files >= td->o.nr_files) |
684 | return NULL; | |
685 | ||
2dc1bbeb | 686 | if (td->o.file_service_type == FIO_FSERVICE_RR) |
1c178180 JA |
687 | f = get_next_file_rr(td, 0, FIO_FILE_OPEN); |
688 | else | |
689 | f = get_next_file_rand(td, 0, FIO_FILE_OPEN); | |
690 | ||
691 | return f; | |
692 | } | |
693 | ||
429f6675 JA |
694 | static int set_io_u_file(struct thread_data *td, struct io_u *io_u) |
695 | { | |
696 | struct fio_file *f; | |
697 | ||
698 | do { | |
699 | f = get_next_file(td); | |
700 | if (!f) | |
701 | return 1; | |
702 | ||
703 | set_file: | |
704 | io_u->file = f; | |
705 | get_file(f); | |
706 | ||
707 | if (!fill_io_u(td, io_u)) | |
708 | break; | |
709 | ||
009bd847 JA |
710 | /* |
711 | * optimization to prevent close/open of the same file. This | |
712 | * way we preserve queueing etc. | |
713 | */ | |
714 | if (td->o.nr_files == 1 && td->o.time_based) { | |
60f2c658 | 715 | put_file_log(td, f); |
009bd847 JA |
716 | fio_file_reset(f); |
717 | goto set_file; | |
718 | } | |
719 | ||
429f6675 JA |
720 | /* |
721 | * td_io_close() does a put_file() as well, so no need to | |
722 | * do that here. | |
723 | */ | |
724 | io_u->file = NULL; | |
725 | td_io_close_file(td, f); | |
726 | f->flags |= FIO_FILE_DONE; | |
727 | td->nr_done_files++; | |
728 | ||
729 | /* | |
730 | * probably not the right place to do this, but see | |
731 | * if we need to open a new file | |
732 | */ | |
733 | if (td->nr_open_files < td->o.open_files && | |
734 | td->o.open_files != td->o.nr_files) { | |
735 | f = find_next_new_file(td); | |
736 | ||
737 | if (!f || td_io_open_file(td, f)) | |
738 | return 1; | |
739 | ||
740 | goto set_file; | |
741 | } | |
742 | } while (1); | |
743 | ||
744 | return 0; | |
745 | } | |
746 | ||
747 | ||
10ba535a JA |
748 | struct io_u *__get_io_u(struct thread_data *td) |
749 | { | |
750 | struct io_u *io_u = NULL; | |
751 | ||
755200a3 JA |
752 | if (!list_empty(&td->io_u_requeues)) |
753 | io_u = list_entry(td->io_u_requeues.next, struct io_u, list); | |
754 | else if (!queue_full(td)) { | |
10ba535a JA |
755 | io_u = list_entry(td->io_u_freelist.next, struct io_u, list); |
756 | ||
6040dabc | 757 | io_u->buflen = 0; |
10ba535a | 758 | io_u->resid = 0; |
755200a3 | 759 | io_u->file = NULL; |
d7762cf8 | 760 | io_u->end_io = NULL; |
755200a3 JA |
761 | } |
762 | ||
763 | if (io_u) { | |
0c6e7517 JA |
764 | assert(io_u->flags & IO_U_F_FREE); |
765 | io_u->flags &= ~IO_U_F_FREE; | |
766 | ||
755200a3 | 767 | io_u->error = 0; |
10ba535a JA |
768 | list_del(&io_u->list); |
769 | list_add(&io_u->list, &td->io_u_busylist); | |
770 | td->cur_depth++; | |
771 | } | |
772 | ||
773 | return io_u; | |
774 | } | |
775 | ||
776 | /* | |
777 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, | |
778 | * etc. The returned io_u is fully ready to be prepped and submitted. | |
779 | */ | |
3d7c391d | 780 | struct io_u *get_io_u(struct thread_data *td) |
10ba535a | 781 | { |
3d7c391d | 782 | struct fio_file *f; |
10ba535a JA |
783 | struct io_u *io_u; |
784 | ||
785 | io_u = __get_io_u(td); | |
2ba1c290 JA |
786 | if (!io_u) { |
787 | dprint(FD_IO, "__get_io_u failed\n"); | |
10ba535a | 788 | return NULL; |
2ba1c290 | 789 | } |
10ba535a | 790 | |
755200a3 JA |
791 | /* |
792 | * from a requeue, io_u already setup | |
793 | */ | |
794 | if (io_u->file) | |
77f392bf | 795 | goto out; |
755200a3 | 796 | |
429f6675 JA |
797 | /* |
798 | * If using an iolog, grab next piece if any available. | |
799 | */ | |
800 | if (td->o.read_iolog_file) { | |
801 | if (read_iolog_get(td, io_u)) | |
802 | goto err_put; | |
2ba1c290 JA |
803 | } else if (set_io_u_file(td, io_u)) { |
804 | dprint(FD_IO, "io_u %p, setting file failed\n", io_u); | |
429f6675 | 805 | goto err_put; |
2ba1c290 | 806 | } |
5ec10eaa | 807 | |
429f6675 JA |
808 | f = io_u->file; |
809 | assert(f->flags & FIO_FILE_OPEN); | |
97af62ce | 810 | |
87dc1ab1 | 811 | if (io_u->ddir != DDIR_SYNC) { |
d0656a93 | 812 | if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) { |
2ba1c290 | 813 | dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u); |
429f6675 | 814 | goto err_put; |
2ba1c290 | 815 | } |
10ba535a | 816 | |
36167d82 | 817 | f->last_pos = io_u->offset + io_u->buflen; |
10ba535a | 818 | |
2dc1bbeb | 819 | if (td->o.verify != VERIFY_NONE) |
87dc1ab1 JA |
820 | populate_verify_io_u(td, io_u); |
821 | } | |
10ba535a | 822 | |
165faf16 JA |
823 | /* |
824 | * Set io data pointers. | |
825 | */ | |
d460eb31 | 826 | io_u->endpos = io_u->offset + io_u->buflen; |
cec6b55d JA |
827 | io_u->xfer_buf = io_u->buf; |
828 | io_u->xfer_buflen = io_u->buflen; | |
5973cafb JA |
829 | |
830 | if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE) | |
831 | io_u_fill_buffer(td, io_u, io_u->xfer_buflen); | |
6ac7a331 | 832 | out: |
429f6675 JA |
833 | if (!td_io_prep(td, io_u)) { |
834 | fio_gettime(&io_u->start_time, NULL); | |
835 | return io_u; | |
36167d82 | 836 | } |
429f6675 | 837 | err_put: |
2ba1c290 | 838 | dprint(FD_IO, "get_io_u failed\n"); |
429f6675 JA |
839 | put_io_u(td, io_u); |
840 | return NULL; | |
10ba535a JA |
841 | } |
842 | ||
5451792e JA |
843 | void io_u_log_error(struct thread_data *td, struct io_u *io_u) |
844 | { | |
845 | const char *msg[] = { "read", "write", "sync" }; | |
846 | ||
847 | log_err("fio: io_u error"); | |
848 | ||
849 | if (io_u->file) | |
850 | log_err(" on file %s", io_u->file->file_name); | |
851 | ||
852 | log_err(": %s\n", strerror(io_u->error)); | |
853 | ||
5ec10eaa JA |
854 | log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], |
855 | io_u->offset, io_u->xfer_buflen); | |
5451792e JA |
856 | |
857 | if (!td->error) | |
858 | td_verror(td, io_u->error, "io_u error"); | |
859 | } | |
860 | ||
97601024 JA |
861 | static void io_completed(struct thread_data *td, struct io_u *io_u, |
862 | struct io_completion_data *icd) | |
10ba535a | 863 | { |
d85f5118 | 864 | unsigned long usec; |
10ba535a | 865 | |
2ba1c290 JA |
866 | dprint_io_u(io_u, "io complete"); |
867 | ||
0c6e7517 JA |
868 | assert(io_u->flags & IO_U_F_FLIGHT); |
869 | io_u->flags &= ~IO_U_F_FLIGHT; | |
870 | ||
87dc1ab1 JA |
871 | if (io_u->ddir == DDIR_SYNC) { |
872 | td->last_was_sync = 1; | |
873 | return; | |
874 | } | |
875 | ||
876 | td->last_was_sync = 0; | |
877 | ||
10ba535a JA |
878 | if (!io_u->error) { |
879 | unsigned int bytes = io_u->buflen - io_u->resid; | |
1e97cce9 | 880 | const enum fio_ddir idx = io_u->ddir; |
3af6ef39 | 881 | int ret; |
10ba535a JA |
882 | |
883 | td->io_blocks[idx]++; | |
884 | td->io_bytes[idx] += bytes; | |
10ba535a JA |
885 | td->this_io_bytes[idx] += bytes; |
886 | ||
d85f5118 | 887 | usec = utime_since(&io_u->issue_time, &icd->time); |
10ba535a | 888 | |
d85f5118 | 889 | add_clat_sample(td, idx, usec); |
02bcaa8c | 890 | add_bw_sample(td, idx, &icd->time); |
04a0feae | 891 | io_u_mark_latency(td, usec); |
10ba535a | 892 | |
660a1cb5 | 893 | if (td_write(td) && idx == DDIR_WRITE && |
8670579e | 894 | td->o.do_verify && |
41128405 | 895 | td->o.verify != VERIFY_NONE) |
10ba535a JA |
896 | log_io_piece(td, io_u); |
897 | ||
898 | icd->bytes_done[idx] += bytes; | |
3af6ef39 | 899 | |
d7762cf8 | 900 | if (io_u->end_io) { |
36690c9b | 901 | ret = io_u->end_io(td, io_u); |
3af6ef39 JA |
902 | if (ret && !icd->error) |
903 | icd->error = ret; | |
904 | } | |
5451792e | 905 | } else { |
10ba535a | 906 | icd->error = io_u->error; |
5451792e JA |
907 | io_u_log_error(td, io_u); |
908 | } | |
10ba535a JA |
909 | } |
910 | ||
d7762cf8 | 911 | static void init_icd(struct io_completion_data *icd, int nr) |
10ba535a | 912 | { |
02bcaa8c JA |
913 | fio_gettime(&icd->time, NULL); |
914 | ||
3af6ef39 JA |
915 | icd->nr = nr; |
916 | ||
10ba535a JA |
917 | icd->error = 0; |
918 | icd->bytes_done[0] = icd->bytes_done[1] = 0; | |
36167d82 JA |
919 | } |
920 | ||
97601024 JA |
921 | static void ios_completed(struct thread_data *td, |
922 | struct io_completion_data *icd) | |
36167d82 JA |
923 | { |
924 | struct io_u *io_u; | |
925 | int i; | |
926 | ||
10ba535a JA |
927 | for (i = 0; i < icd->nr; i++) { |
928 | io_u = td->io_ops->event(td, i); | |
929 | ||
930 | io_completed(td, io_u, icd); | |
931 | put_io_u(td, io_u); | |
932 | } | |
933 | } | |
97601024 | 934 | |
e7e6cfb4 JA |
935 | /* |
936 | * Complete a single io_u for the sync engines. | |
937 | */ | |
d7762cf8 | 938 | long io_u_sync_complete(struct thread_data *td, struct io_u *io_u) |
97601024 JA |
939 | { |
940 | struct io_completion_data icd; | |
941 | ||
d7762cf8 | 942 | init_icd(&icd, 1); |
97601024 JA |
943 | io_completed(td, io_u, &icd); |
944 | put_io_u(td, io_u); | |
945 | ||
946 | if (!icd.error) | |
947 | return icd.bytes_done[0] + icd.bytes_done[1]; | |
948 | ||
37e974a5 | 949 | td_verror(td, icd.error, "io_u_sync_complete"); |
97601024 JA |
950 | return -1; |
951 | } | |
952 | ||
e7e6cfb4 JA |
953 | /* |
954 | * Called to complete min_events number of io for the async engines. | |
955 | */ | |
d7762cf8 | 956 | long io_u_queued_complete(struct thread_data *td, int min_events) |
97601024 | 957 | { |
97601024 | 958 | struct io_completion_data icd; |
00de55ef | 959 | struct timespec *tvp = NULL; |
97601024 | 960 | int ret; |
4d06a338 | 961 | struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, }; |
97601024 | 962 | |
b271fe62 JA |
963 | dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_events); |
964 | ||
4d06a338 | 965 | if (!min_events) |
00de55ef | 966 | tvp = &ts; |
97601024 | 967 | |
00de55ef | 968 | ret = td_io_getevents(td, min_events, td->cur_depth, tvp); |
97601024 | 969 | if (ret < 0) { |
e1161c32 | 970 | td_verror(td, -ret, "td_io_getevents"); |
97601024 JA |
971 | return ret; |
972 | } else if (!ret) | |
973 | return ret; | |
974 | ||
d7762cf8 | 975 | init_icd(&icd, ret); |
97601024 JA |
976 | ios_completed(td, &icd); |
977 | if (!icd.error) | |
978 | return icd.bytes_done[0] + icd.bytes_done[1]; | |
979 | ||
37e974a5 | 980 | td_verror(td, icd.error, "io_u_queued_complete"); |
97601024 JA |
981 | return -1; |
982 | } | |
7e77dd02 JA |
983 | |
984 | /* | |
985 | * Call when io_u is really queued, to update the submission latency. | |
986 | */ | |
987 | void io_u_queued(struct thread_data *td, struct io_u *io_u) | |
988 | { | |
989 | unsigned long slat_time; | |
990 | ||
d85f5118 | 991 | slat_time = utime_since(&io_u->start_time, &io_u->issue_time); |
7e77dd02 JA |
992 | add_slat_sample(td, io_u->ddir, slat_time); |
993 | } | |
433afcb4 | 994 | |
5973cafb JA |
995 | /* |
996 | * "randomly" fill the buffer contents | |
997 | */ | |
998 | void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u, | |
999 | unsigned int max_bs) | |
1000 | { | |
1001 | long *ptr = io_u->buf; | |
1002 | ||
1003 | if (!td->o.zero_buffers) { | |
1004 | while ((void *) ptr - io_u->buf < max_bs) { | |
1005 | *ptr = rand() * GOLDEN_RATIO_PRIME; | |
1006 | ptr++; | |
1007 | } | |
1008 | } else | |
1009 | memset(ptr, 0, max_bs); | |
1010 | } | |
1011 | ||
55bc9728 | 1012 | #ifdef FIO_USE_TIMEOUT |
433afcb4 JA |
1013 | void io_u_set_timeout(struct thread_data *td) |
1014 | { | |
1015 | assert(td->cur_depth); | |
1016 | ||
1017 | td->timer.it_interval.tv_sec = 0; | |
1018 | td->timer.it_interval.tv_usec = 0; | |
1019 | td->timer.it_value.tv_sec = IO_U_TIMEOUT + IO_U_TIMEOUT_INC; | |
1020 | td->timer.it_value.tv_usec = 0; | |
1021 | setitimer(ITIMER_REAL, &td->timer, NULL); | |
1022 | fio_gettime(&td->timeout_end, NULL); | |
1023 | } | |
5945b9b4 JA |
1024 | |
1025 | static void io_u_dump(struct io_u *io_u) | |
1026 | { | |
1027 | unsigned long t_start = mtime_since_now(&io_u->start_time); | |
1028 | unsigned long t_issue = mtime_since_now(&io_u->issue_time); | |
1029 | ||
1030 | log_err("io_u=%p, t_start=%lu, t_issue=%lu\n", io_u, t_start, t_issue); | |
5ec10eaa JA |
1031 | log_err(" buf=%p/%p, len=%lu/%lu, offset=%llu\n", io_u->buf, |
1032 | io_u->xfer_buf, io_u->buflen, | |
1033 | io_u->xfer_buflen, | |
1034 | io_u->offset); | |
5945b9b4 JA |
1035 | log_err(" ddir=%d, fname=%s\n", io_u->ddir, io_u->file->file_name); |
1036 | } | |
55bc9728 JA |
1037 | #else |
1038 | void io_u_set_timeout(struct thread_data fio_unused *td) | |
1039 | { | |
1040 | } | |
1041 | #endif | |
433afcb4 | 1042 | |
55bc9728 | 1043 | #ifdef FIO_USE_TIMEOUT |
433afcb4 JA |
1044 | static void io_u_timeout_handler(int fio_unused sig) |
1045 | { | |
1046 | struct thread_data *td, *__td; | |
1047 | pid_t pid = getpid(); | |
5945b9b4 JA |
1048 | struct list_head *entry; |
1049 | struct io_u *io_u; | |
433afcb4 JA |
1050 | int i; |
1051 | ||
1052 | log_err("fio: io_u timeout\n"); | |
1053 | ||
1054 | /* | |
1055 | * TLS would be nice... | |
1056 | */ | |
1057 | td = NULL; | |
1058 | for_each_td(__td, i) { | |
1059 | if (__td->pid == pid) { | |
1060 | td = __td; | |
1061 | break; | |
1062 | } | |
1063 | } | |
1064 | ||
1065 | if (!td) { | |
1066 | log_err("fio: io_u timeout, can't find job\n"); | |
1067 | exit(1); | |
1068 | } | |
1069 | ||
1070 | if (!td->cur_depth) { | |
1071 | log_err("fio: timeout without pending work?\n"); | |
1072 | return; | |
1073 | } | |
1074 | ||
15506d09 | 1075 | log_err("fio: io_u timeout: job=%s, pid=%d\n", td->o.name, td->pid); |
5945b9b4 JA |
1076 | |
1077 | list_for_each(entry, &td->io_u_busylist) { | |
1078 | io_u = list_entry(entry, struct io_u, list); | |
1079 | ||
1080 | io_u_dump(io_u); | |
1081 | } | |
1082 | ||
1083 | td_verror(td, ETIMEDOUT, "io_u timeout"); | |
433afcb4 JA |
1084 | exit(1); |
1085 | } | |
55bc9728 | 1086 | #endif |
433afcb4 JA |
1087 | |
1088 | void io_u_init_timeout(void) | |
1089 | { | |
55bc9728 | 1090 | #ifdef FIO_USE_TIMEOUT |
433afcb4 | 1091 | signal(SIGALRM, io_u_timeout_handler); |
55bc9728 | 1092 | #endif |
433afcb4 | 1093 | } |