projects / fio.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
[PATCH] Add -h help option
[fio.git] / fio-ini.c
... / ...
CommitLineData
1#include <stdio.h>
2#include <stdlib.h>
3#include <unistd.h>
4#include <fcntl.h>
5#include <ctype.h>
6#include <string.h>
7#include <errno.h>
8#include <sys/ipc.h>
9#include <sys/shm.h>
10#include <sys/types.h>
11#include <sys/stat.h>
12
13#include "fio.h"
14
15#define DEF_BS (4096)
16#define DEF_TIMEOUT (0)
17#define DEF_RATE_CYCLE (1000)
18#define DEF_ODIRECT (1)
19#define DEF_IO_ENGINE (FIO_SYNCIO)
20#define DEF_IO_ENGINE_NAME "sync"
21#define DEF_SEQUENTIAL (1)
22#define DEF_RAND_REPEAT (1)
23#define DEF_OVERWRITE (1)
24#define DEF_CREATE (1)
25#define DEF_INVALIDATE (1)
26#define DEF_SYNCIO (0)
27#define DEF_RANDSEED (0xb1899bedUL)
28#define DEF_BWAVGTIME (500)
29#define DEF_CREATE_SER (1)
30#define DEF_CREATE_FSYNC (1)
31#define DEF_LOOPS (1)
32#define DEF_VERIFY (0)
33#define DEF_STONEWALL (0)
34#define DEF_NUMJOBS (1)
35#define DEF_USE_THREAD (0)
36#define DEF_FILE_SIZE (1024 * 1024 * 1024UL)
37#define DEF_ZONE_SIZE (0)
38#define DEF_ZONE_SKIP (0)
39
40static char fio_version_string[] = "fio 1.3";
41
42static int repeatable = DEF_RAND_REPEAT;
43static char *ini_file;
44static int max_jobs = MAX_JOBS;
45
46struct thread_data def_thread;
47struct thread_data *threads = NULL;
48
49int rate_quit = 0;
50int write_lat_log = 0;
51int write_bw_log = 0;
52int exitall_on_terminate = 0;
53
54static int setup_rate(struct thread_data *td)
55{
56 int nr_reads_per_sec;
57
58 if (!td->rate)
59 return 0;
60
61 if (td->rate < td->ratemin) {
62 fprintf(stderr, "min rate larger than nominal rate\n");
63 return -1;
64 }
65
66 nr_reads_per_sec = (td->rate * 1024) / td->min_bs;
67 td->rate_usec_cycle = 1000000 / nr_reads_per_sec;
68 td->rate_pending_usleep = 0;
69 return 0;
70}
71
72static void setup_log(struct io_log **log)
73{
74 struct io_log *l = malloc(sizeof(*l));
75
76 l->nr_samples = 0;
77 l->max_samples = 1024;
78 l->log = malloc(l->max_samples * sizeof(struct io_sample));
79 *log = l;
80}
81
82void finish_log(struct thread_data *td, struct io_log *log, const char *name)
83{
84 char file_name[128];
85 FILE *f;
86 unsigned int i;
87
88 sprintf(file_name, "client%d_%s.log", td->thread_number, name);
89 f = fopen(file_name, "w");
90 if (!f) {
91 perror("fopen log");
92 return;
93 }
94
95 for (i = 0; i < log->nr_samples; i++)
96 fprintf(f, "%lu, %lu, %u\n", log->log[i].time, log->log[i].val, log->log[i].ddir);
97
98 fclose(f);
99 free(log->log);
100 free(log);
101}
102
103static struct thread_data *get_new_job(int global, struct thread_data *parent)
104{
105 struct thread_data *td;
106
107 if (global)
108 return &def_thread;
109 if (thread_number >= max_jobs)
110 return NULL;
111
112 td = &threads[thread_number++];
113 memset(td, 0, sizeof(*td));
114
115 td->fd = -1;
116 td->thread_number = thread_number;
117
118 td->ddir = parent->ddir;
119 td->ioprio = parent->ioprio;
120 td->sequential = parent->sequential;
121 td->bs = parent->bs;
122 td->min_bs = parent->min_bs;
123 td->max_bs = parent->max_bs;
124 td->odirect = parent->odirect;
125 td->thinktime = parent->thinktime;
126 td->fsync_blocks = parent->fsync_blocks;
127 td->start_delay = parent->start_delay;
128 td->timeout = parent->timeout;
129 td->io_engine = parent->io_engine;
130 td->create_file = parent->create_file;
131 td->overwrite = parent->overwrite;
132 td->invalidate_cache = parent->invalidate_cache;
133 td->file_size = parent->file_size;
134 td->file_offset = parent->file_offset;
135 td->zone_size = parent->zone_size;
136 td->zone_skip = parent->zone_skip;
137 td->rate = parent->rate;
138 td->ratemin = parent->ratemin;
139 td->ratecycle = parent->ratecycle;
140 td->iodepth = parent->iodepth;
141 td->sync_io = parent->sync_io;
142 td->mem_type = parent->mem_type;
143 td->bw_avg_time = parent->bw_avg_time;
144 td->create_serialize = parent->create_serialize;
145 td->create_fsync = parent->create_fsync;
146 td->loops = parent->loops;
147 td->verify = parent->verify;
148 td->stonewall = parent->stonewall;
149 td->numjobs = parent->numjobs;
150 td->use_thread = parent->use_thread;
151 td->do_disk_util = parent->do_disk_util;
152 memcpy(&td->cpumask, &parent->cpumask, sizeof(td->cpumask));
153 strcpy(td->io_engine_name, parent->io_engine_name);
154
155 return td;
156}
157
158static void put_job(struct thread_data *td)
159{
160 memset(&threads[td->thread_number - 1], 0, sizeof(*td));
161 thread_number--;
162}
163
164static int add_job(struct thread_data *td, const char *jobname, int prioclass,
165 int prio)
166{
167 char *ddir_str[] = { "read", "write", "randread", "randwrite",
168 "rw", NULL, "randrw" };
169 struct stat sb;
170 int numjobs, ddir;
171
172#ifndef FIO_HAVE_LIBAIO
173 if (td->io_engine == FIO_LIBAIO) {
174 fprintf(stderr, "Linux libaio not available\n");
175 return 1;
176 }
177#endif
178#ifndef FIO_HAVE_POSIXAIO
179 if (td->io_engine == FIO_POSIXAIO) {
180 fprintf(stderr, "posix aio not available\n");
181 return 1;
182 }
183#endif
184#ifdef FIO_HAVE_IOPRIO
185 td->ioprio = (prioclass << IOPRIO_CLASS_SHIFT) | prio;
186#endif
187
188 /*
189 * the def_thread is just for options, it's not a real job
190 */
191 if (td == &def_thread)
192 return 0;
193
194 if (td->io_engine & FIO_SYNCIO)
195 td->iodepth = 1;
196 else {
197 if (!td->iodepth)
198 td->iodepth = 1;
199 }
200
201 /*
202 * only really works for sequential io for now
203 */
204 if (td->zone_size && !td->sequential)
205 td->zone_size = 0;
206
207 td->filetype = FIO_TYPE_FILE;
208 if (!stat(jobname, &sb)) {
209 if (S_ISBLK(sb.st_mode))
210 td->filetype = FIO_TYPE_BD;
211 else if (S_ISCHR(sb.st_mode))
212 td->filetype = FIO_TYPE_CHAR;
213 }
214
215 if (td->filetype == FIO_TYPE_FILE) {
216 if (td->directory[0] != '\0')
217 sprintf(td->file_name, "%s/%s.%d", td->directory, jobname, td->jobnum);
218 else
219 sprintf(td->file_name, "%s.%d", jobname, td->jobnum);
220 } else
221 strcpy(td->file_name, jobname);
222
223 sem_init(&td->mutex, 0, 0);
224
225 td->clat_stat[0].min_val = td->clat_stat[1].min_val = ULONG_MAX;
226 td->slat_stat[0].min_val = td->slat_stat[1].min_val = ULONG_MAX;
227 td->bw_stat[0].min_val = td->bw_stat[1].min_val = ULONG_MAX;
228
229 if (td->min_bs == -1U)
230 td->min_bs = td->bs;
231 if (td->max_bs == -1U)
232 td->max_bs = td->bs;
233 if (td_read(td) && !td_rw(td))
234 td->verify = 0;
235
236 if (td->stonewall && td->thread_number > 1)
237 groupid++;
238
239 td->groupid = groupid;
240
241 if (setup_rate(td))
242 goto err;
243
244 if (write_lat_log) {
245 setup_log(&td->slat_log);
246 setup_log(&td->clat_log);
247 }
248 if (write_bw_log)
249 setup_log(&td->bw_log);
250
251 ddir = td->ddir + (!td->sequential << 1) + (td->iomix << 2);
252 printf("Client%d (g=%d): rw=%s, prio=%d/%d, odir=%d, bs=%d-%d, rate=%d, ioengine=%s, iodepth=%d\n", td->thread_number, td->groupid, ddir_str[ddir], prioclass, prio, td->odirect, td->min_bs, td->max_bs, td->rate, td->io_engine_name, td->iodepth);
253
254 /*
255 * recurse add identical jobs, clear numjobs and stonewall options
256 * as they don't apply to sub-jobs
257 */
258 numjobs = td->numjobs;
259 while (--numjobs) {
260 struct thread_data *td_new = get_new_job(0, td);
261
262 if (!td_new)
263 goto err;
264
265 td_new->numjobs = 1;
266 td_new->stonewall = 0;
267 td_new->jobnum = numjobs;
268
269 if (add_job(td_new, jobname, prioclass, prio))
270 goto err;
271 }
272 return 0;
273err:
274 put_job(td);
275 return -1;
276}
277
278int init_random_state(struct thread_data *td)
279{
280 unsigned long seed;
281 int fd, num_maps, blocks;
282
283 fd = open("/dev/random", O_RDONLY);
284 if (fd == -1) {
285 td_verror(td, errno);
286 return 1;
287 }
288
289 if (read(fd, &seed, sizeof(seed)) < (int) sizeof(seed)) {
290 td_verror(td, EIO);
291 close(fd);
292 return 1;
293 }
294
295 close(fd);
296
297 srand48_r(seed, &td->bsrange_state);
298 srand48_r(seed, &td->verify_state);
299
300 if (td->sequential)
301 return 0;
302
303 if (repeatable)
304 seed = DEF_RANDSEED;
305
306 blocks = (td->io_size + td->min_bs - 1) / td->min_bs;
307 num_maps = blocks / BLOCKS_PER_MAP;
308 td->file_map = malloc(num_maps * sizeof(long));
309 td->num_maps = num_maps;
310 memset(td->file_map, 0, num_maps * sizeof(long));
311
312 srand48_r(seed, &td->random_state);
313 return 0;
314}
315
316static void fill_cpu_mask(os_cpu_mask_t cpumask, int cpu)
317{
318#ifdef FIO_HAVE_CPU_AFFINITY
319 unsigned int i;
320
321 CPU_ZERO(&cpumask);
322
323 for (i = 0; i < sizeof(int) * 8; i++) {
324 if ((1 << i) & cpu)
325 CPU_SET(i, &cpumask);
326 }
327#endif
328}
329
330static unsigned long get_mult(char c)
331{
332 switch (c) {
333 case 'k':
334 case 'K':
335 return 1024;
336 case 'm':
337 case 'M':
338 return 1024 * 1024;
339 case 'g':
340 case 'G':
341 return 1024 * 1024 * 1024;
342 default:
343 return 1;
344 }
345}
346
347/*
348 * convert string after '=' into decimal value, noting any size suffix
349 */
350static int str_cnv(char *p, unsigned long long *val)
351{
352 char *str;
353 int len;
354
355 str = strchr(p, '=');
356 if (!str)
357 return 1;
358
359 str++;
360 len = strlen(str);
361
362 *val = strtoul(str, NULL, 10);
363 if (*val == ULONG_MAX && errno == ERANGE)
364 return 1;
365
366 *val *= get_mult(str[len - 2]);
367 return 0;
368}
369
370static int check_strcnv(char *p, char *name, unsigned long long *val)
371{
372 if (strncmp(p, name, strlen(name) - 1))
373 return 1;
374
375 return str_cnv(p, val);
376}
377
378static void strip_blank_front(char **p)
379{
380 char *s = *p;
381
382 while (isblank(*s))
383 s++;
384}
385
386static void strip_blank_end(char *p)
387{
388 while (isblank(*p)) {
389 *p = '\0';
390 p--;
391 }
392}
393
394typedef int (str_cb_fn)(struct thread_data *, char *);
395
396static int check_str(char *p, char *name, str_cb_fn *cb, struct thread_data *td)
397{
398 char *s = strstr(p, name);
399
400 if (!s)
401 return 1;
402
403 s = strchr(s, '=');
404 if (!s)
405 return 1;
406
407 s++;
408 strip_blank_front(&s);
409 return cb(td, s);
410}
411
412static int check_strstore(char *p, char *name, char *dest)
413{
414 char *s = strstr(p, name);
415
416 if (!s)
417 return 1;
418
419 s = strchr(p, '=');
420 if (!s)
421 return 1;
422
423 s++;
424 strip_blank_front(&s);
425
426 strcpy(dest, s);
427
428 s = dest + strlen(dest) - 1;
429 strip_blank_end(s);
430 return 0;
431}
432
433static int __check_range(char *str, unsigned long *val)
434{
435 char suffix;
436
437 if (sscanf(str, "%lu%c", val, &suffix) == 2) {
438 *val *= get_mult(suffix);
439 return 0;
440 }
441
442 if (sscanf(str, "%lu", val) == 1)
443 return 0;
444
445 return 1;
446}
447
448static int check_range(char *p, char *name, unsigned long *s, unsigned long *e)
449{
450 char option[128];
451 char *str, *p1, *p2;
452
453 strcpy(option, p);
454 p = option;
455
456 str = strstr(p, name);
457 if (!str)
458 return 1;
459
460 p += strlen(name);
461
462 str = strchr(p, '=');
463 if (!str)
464 return 1;
465
466 /*
467 * 'p' now holds whatever is after the '=' sign
468 */
469 p1 = str + 1;
470
471 /*
472 * terminate p1 at the '-' sign
473 */
474 p = strchr(p1, '-');
475 if (!p)
476 return 1;
477
478 p2 = p + 1;
479 *p = '\0';
480
481 if (!__check_range(p1, s) && !__check_range(p2, e))
482 return 0;
483
484 return 1;
485}
486
487static int check_int(char *p, char *name, unsigned int *val)
488{
489 char *str;
490
491 str = strstr(p, name);
492 if (!str)
493 return 1;
494
495 str = strchr(p, '=');
496 if (!str)
497 return 1;
498
499 str++;
500
501 if (sscanf(str, "%u", val) == 1)
502 return 0;
503
504 return 1;
505}
506
507static int check_strset(char *p, char *name)
508{
509 return strncmp(p, name, strlen(name));
510}
511
512static int is_empty_or_comment(char *line)
513{
514 unsigned int i;
515
516 for (i = 0; i < strlen(line); i++) {
517 if (line[i] == ';')
518 return 1;
519 if (!isspace(line[i]) && !iscntrl(line[i]))
520 return 0;
521 }
522
523 return 1;
524}
525
526static int str_rw_cb(struct thread_data *td, char *mem)
527{
528 if (!strncmp(mem, "read", 4) || !strncmp(mem, "0", 1)) {
529 td->ddir = DDIR_READ;
530 td->sequential = 1;
531 return 0;
532 } else if (!strncmp(mem, "randread", 8)) {
533 td->ddir = DDIR_READ;
534 td->sequential = 0;
535 return 0;
536 } else if (!strncmp(mem, "write", 5) || !strncmp(mem, "1", 1)) {
537 td->ddir = DDIR_WRITE;
538 td->sequential = 1;
539 return 0;
540 } else if (!strncmp(mem, "randwrite", 9)) {
541 td->ddir = DDIR_WRITE;
542 td->sequential = 0;
543 return 0;
544 } else if (!strncmp(mem, "rw", 2)) {
545 td->ddir = 0;
546 td->iomix = 1;
547 td->sequential = 1;
548 return 0;
549 } else if (!strncmp(mem, "randrw", 6)) {
550 td->ddir = 0;
551 td->iomix = 1;
552 td->sequential = 0;
553 return 0;
554 }
555
556 fprintf(stderr, "bad data direction: %s\n", mem);
557 return 1;
558}
559
560static int str_verify_cb(struct thread_data *td, char *mem)
561{
562 if (!strncmp(mem, "0", 1)) {
563 td->verify = VERIFY_NONE;
564 return 0;
565 } else if (!strncmp(mem, "md5", 3) || !strncmp(mem, "1", 1)) {
566 td->verify = VERIFY_MD5;
567 return 0;
568 } else if (!strncmp(mem, "crc32", 5)) {
569 td->verify = VERIFY_CRC32;
570 return 0;
571 }
572
573 fprintf(stderr, "bad verify type: %s\n", mem);
574 return 1;
575}
576
577static int str_mem_cb(struct thread_data *td, char *mem)
578{
579 if (!strncmp(mem, "malloc", 6)) {
580 td->mem_type = MEM_MALLOC;
581 return 0;
582 } else if (!strncmp(mem, "shm", 3)) {
583 td->mem_type = MEM_SHM;
584 return 0;
585 } else if (!strncmp(mem, "mmap", 4)) {
586 td->mem_type = MEM_MMAP;
587 return 0;
588 }
589
590 fprintf(stderr, "bad mem type: %s\n", mem);
591 return 1;
592}
593
594static int str_ioengine_cb(struct thread_data *td, char *str)
595{
596 if (!strncmp(str, "linuxaio", 8) || !strncmp(str, "aio", 3) ||
597 !strncmp(str, "libaio", 6)) {
598 strcpy(td->io_engine_name, "libaio");
599 td->io_engine = FIO_LIBAIO;
600 return 0;
601 } else if (!strncmp(str, "posixaio", 8)) {
602 strcpy(td->io_engine_name, "posixaio");
603 td->io_engine = FIO_POSIXAIO;
604 return 0;
605 } else if (!strncmp(str, "sync", 4)) {
606 strcpy(td->io_engine_name, "sync");
607 td->io_engine = FIO_SYNCIO;
608 return 0;
609 } else if (!strncmp(str, "mmap", 4)) {
610 strcpy(td->io_engine_name, "mmap");
611 td->io_engine = FIO_MMAPIO;
612 return 0;
613 } else if (!strncmp(str, "sgio", 4)) {
614 strcpy(td->io_engine_name, "sgio");
615 td->io_engine = FIO_SGIO;
616 return 0;
617 }
618
619 fprintf(stderr, "bad ioengine type: %s\n", str);
620 return 1;
621}
622
623
624int parse_jobs_ini(char *file)
625{
626 unsigned int prioclass, prio, cpu, global;
627 unsigned long long ull;
628 unsigned long ul1, ul2;
629 struct thread_data *td;
630 char *string, *name;
631 fpos_t off;
632 FILE *f;
633 char *p;
634
635 f = fopen(file, "r");
636 if (!f) {
637 perror("fopen");
638 return 1;
639 }
640
641 string = malloc(4096);
642 name = malloc(256);
643
644 while ((p = fgets(string, 4096, f)) != NULL) {
645 if (is_empty_or_comment(p))
646 continue;
647 if (sscanf(p, "[%s]", name) != 1)
648 continue;
649
650 global = !strncmp(name, "global", 6);
651
652 name[strlen(name) - 1] = '\0';
653
654 td = get_new_job(global, &def_thread);
655 if (!td)
656 return 1;
657
658 prioclass = 2;
659 prio = 4;
660
661 fgetpos(f, &off);
662 while ((p = fgets(string, 4096, f)) != NULL) {
663 if (is_empty_or_comment(p))
664 continue;
665 if (strstr(p, "["))
666 break;
667 if (!check_int(p, "prio", &prio)) {
668#ifndef FIO_HAVE_IOPRIO
669 fprintf(stderr, "io priorities not available\n");
670 return 1;
671#endif
672 fgetpos(f, &off);
673 continue;
674 }
675 if (!check_int(p, "prioclass", &prioclass)) {
676#ifndef FIO_HAVE_IOPRIO
677 fprintf(stderr, "io priorities not available\n");
678 return 1;
679#endif
680 fgetpos(f, &off);
681 continue;
682 }
683 if (!check_int(p, "direct", &td->odirect)) {
684 fgetpos(f, &off);
685 continue;
686 }
687 if (!check_int(p, "rate", &td->rate)) {
688 fgetpos(f, &off);
689 continue;
690 }
691 if (!check_int(p, "ratemin", &td->ratemin)) {
692 fgetpos(f, &off);
693 continue;
694 }
695 if (!check_int(p, "ratecycle", &td->ratecycle)) {
696 fgetpos(f, &off);
697 continue;
698 }
699 if (!check_int(p, "thinktime", &td->thinktime)) {
700 fgetpos(f, &off);
701 continue;
702 }
703 if (!check_int(p, "cpumask", &cpu)) {
704#ifndef FIO_HAVE_CPU_AFFINITY
705 fprintf(stderr, "cpu affinity not available\n");
706 return 1;
707#endif
708 fill_cpu_mask(td->cpumask, cpu);
709 fgetpos(f, &off);
710 continue;
711 }
712 if (!check_int(p, "fsync", &td->fsync_blocks)) {
713 fgetpos(f, &off);
714 continue;
715 }
716 if (!check_int(p, "startdelay", &td->start_delay)) {
717 fgetpos(f, &off);
718 continue;
719 }
720 if (!check_int(p, "timeout", &td->timeout)) {
721 fgetpos(f, &off);
722 continue;
723 }
724 if (!check_int(p, "invalidate",&td->invalidate_cache)) {
725 fgetpos(f, &off);
726 continue;
727 }
728 if (!check_int(p, "iodepth", &td->iodepth)) {
729 fgetpos(f, &off);
730 continue;
731 }
732 if (!check_int(p, "sync", &td->sync_io)) {
733 fgetpos(f, &off);
734 continue;
735 }
736 if (!check_int(p, "bwavgtime", &td->bw_avg_time)) {
737 fgetpos(f, &off);
738 continue;
739 }
740 if (!check_int(p, "create_serialize", &td->create_serialize)) {
741 fgetpos(f, &off);
742 continue;
743 }
744 if (!check_int(p, "create_fsync", &td->create_fsync)) {
745 fgetpos(f, &off);
746 continue;
747 }
748 if (!check_int(p, "loops", &td->loops)) {
749 fgetpos(f, &off);
750 continue;
751 }
752 if (!check_int(p, "numjobs", &td->numjobs)) {
753 fgetpos(f, &off);
754 continue;
755 }
756 if (!check_int(p, "overwrite", &td->overwrite)) {
757 fgetpos(f, &off);
758 continue;
759 }
760 if (!check_range(p, "bsrange", &ul1, &ul2)) {
761 if (ul1 > ul2) {
762 td->max_bs = ul1;
763 td->min_bs = ul2;
764 } else {
765 td->max_bs = ul2;
766 td->min_bs = ul1;
767 }
768 fgetpos(f, &off);
769 continue;
770 }
771 if (!check_strcnv(p, "bs", &ull)) {
772 td->bs = ull;
773 fgetpos(f, &off);
774 continue;
775 }
776 if (!check_strcnv(p, "size", &td->file_size)) {
777 fgetpos(f, &off);
778 continue;
779 }
780 if (!check_strcnv(p, "offset", &td->file_offset)) {
781 fgetpos(f, &off);
782 continue;
783 }
784 if (!check_strcnv(p, "zonesize", &td->zone_size)) {
785 fgetpos(f, &off);
786 continue;
787 }
788 if (!check_strcnv(p, "zoneskip", &td->zone_skip)) {
789 fgetpos(f, &off);
790 continue;
791 }
792 if (!check_strstore(p, "directory", td->directory)) {
793 fgetpos(f, &off);
794 continue;
795 }
796 if (!check_str(p, "mem", str_mem_cb, td)) {
797 fgetpos(f, &off);
798 continue;
799 }
800 if (!check_str(p, "verify", str_verify_cb, td)) {
801 fgetpos(f, &off);
802 continue;
803 }
804 if (!check_str(p, "rw", str_rw_cb, td)) {
805 fgetpos(f, &off);
806 continue;
807 }
808 if (!check_str(p, "ioengine", str_ioengine_cb, td)) {
809 fgetpos(f, &off);
810 continue;
811 }
812 if (!check_strset(p, "create")) {
813 td->create_file = 1;
814 fgetpos(f, &off);
815 continue;
816 }
817 if (!check_strset(p, "exitall")) {
818 exitall_on_terminate = 1;
819 fgetpos(f, &off);
820 continue;
821 }
822 if (!check_strset(p, "stonewall")) {
823 td->stonewall = 1;
824 fgetpos(f, &off);
825 continue;
826 }
827 if (!check_strset(p, "thread")) {
828 td->use_thread = 1;
829 fgetpos(f, &off);
830 continue;
831 }
832
833 printf("Client%d: bad option %s\n",td->thread_number,p);
834 }
835 fsetpos(f, &off);
836
837 if (add_job(td, name, prioclass, prio))
838 return 1;
839 }
840
841 free(string);
842 free(name);
843 fclose(f);
844 return 0;
845}
846
847static int fill_def_thread(void)
848{
849 memset(&def_thread, 0, sizeof(def_thread));
850
851 if (fio_getaffinity(getpid(), &def_thread.cpumask) == -1) {
852 perror("sched_getaffinity");
853 return 1;
854 }
855
856 /*
857 * fill globals
858 */
859 def_thread.ddir = DDIR_READ;
860 def_thread.iomix = 0;
861 def_thread.bs = DEF_BS;
862 def_thread.min_bs = -1;
863 def_thread.max_bs = -1;
864 def_thread.io_engine = DEF_IO_ENGINE;
865 strcpy(def_thread.io_engine_name, DEF_IO_ENGINE_NAME);
866 def_thread.odirect = DEF_ODIRECT;
867 def_thread.ratecycle = DEF_RATE_CYCLE;
868 def_thread.sequential = DEF_SEQUENTIAL;
869 def_thread.timeout = DEF_TIMEOUT;
870 def_thread.create_file = DEF_CREATE;
871 def_thread.overwrite = DEF_OVERWRITE;
872 def_thread.invalidate_cache = DEF_INVALIDATE;
873 def_thread.sync_io = DEF_SYNCIO;
874 def_thread.mem_type = MEM_MALLOC;
875 def_thread.bw_avg_time = DEF_BWAVGTIME;
876 def_thread.create_serialize = DEF_CREATE_SER;
877 def_thread.create_fsync = DEF_CREATE_FSYNC;
878 def_thread.loops = DEF_LOOPS;
879 def_thread.verify = DEF_VERIFY;
880 def_thread.stonewall = DEF_STONEWALL;
881 def_thread.numjobs = DEF_NUMJOBS;
882 def_thread.use_thread = DEF_USE_THREAD;
883#ifdef FIO_HAVE_DISK_UTIL
884 def_thread.do_disk_util = 1;
885#endif
886
887 return 0;
888}
889
890static void usage(char *name)
891{
892 printf("%s\n", fio_version_string);
893 printf("\t-s IO is sequential\n");
894 printf("\t-b Block size in KiB for each IO\n");
895 printf("\t-t Runtime in seconds\n");
896 printf("\t-R Exit all threads on failure to meet rate goal\n");
897 printf("\t-o Use O_DIRECT\n");
898 printf("\t-l Generate per-job latency logs\n");
899 printf("\t-w Generate per-job bandwidth logs\n");
900 printf("\t-f Job file (Required)\n");
901 printf("\t-v Print version info and exit\n");
902}
903
904static void parse_cmd_line(int argc, char *argv[])
905{
906 int c;
907
908 while ((c = getopt(argc, argv, "s:b:t:r:R:o:f:lwvh")) != EOF) {
909 switch (c) {
910 case 's':
911 def_thread.sequential = !!atoi(optarg);
912 break;
913 case 'b':
914 def_thread.bs = atoi(optarg);
915 def_thread.bs <<= 10;
916 if (!def_thread.bs) {
917 printf("bad block size\n");
918 def_thread.bs = DEF_BS;
919 }
920 break;
921 case 't':
922 def_thread.timeout = atoi(optarg);
923 break;
924 case 'r':
925 repeatable = !!atoi(optarg);
926 break;
927 case 'R':
928 rate_quit = !!atoi(optarg);
929 break;
930 case 'o':
931 def_thread.odirect = !!atoi(optarg);
932 break;
933 case 'f':
934 ini_file = strdup(optarg);
935 break;
936 case 'l':
937 write_lat_log = 1;
938 break;
939 case 'w':
940 write_bw_log = 1;
941 break;
942 case 'h':
943 usage(argv[0]);
944 exit(0);
945 case 'v':
946 printf("%s\n", fio_version_string);
947 exit(0);
948 }
949 }
950}
951
952static void free_shm(void)
953{
954 struct shmid_ds sbuf;
955
956 if (threads) {
957 shmdt(threads);
958 threads = NULL;
959 shmctl(shm_id, IPC_RMID, &sbuf);
960 }
961}
962
963static int setup_thread_area(void)
964{
965 /*
966 * 1024 is too much on some machines, scale max_jobs if
967 * we get a failure that looks like too large a shm segment
968 */
969 do {
970 int s = max_jobs * sizeof(struct thread_data);
971
972 shm_id = shmget(0, s, IPC_CREAT | 0600);
973 if (shm_id != -1)
974 break;
975 if (errno != EINVAL) {
976 perror("shmget");
977 break;
978 }
979
980 max_jobs >>= 1;
981 } while (max_jobs);
982
983 if (shm_id == -1)
984 return 1;
985
986 threads = shmat(shm_id, NULL, 0);
987 if (threads == (void *) -1) {
988 perror("shmat");
989 return 1;
990 }
991
992 atexit(free_shm);
993 return 0;
994}
995
996int parse_options(int argc, char *argv[])
997{
998 if (setup_thread_area())
999 return 1;
1000 if (fill_def_thread())
1001 return 1;
1002
1003 parse_cmd_line(argc, argv);
1004
1005 if (!ini_file) {
1006 printf("Need job file\n");
1007 usage(argv[0]);
1008 return 1;
1009 }
1010
1011 if (parse_jobs_ini(ini_file))
1012 return 1;
1013
1014 return 0;
1015}
fio - Flexible IO Tester