Compile error with FIO_USE_TIMEOUT defined
[fio.git] / init.c
CommitLineData
906c8d75 1/*
cb2c86fd 2 * This file contains job initialization and setup functions.
906c8d75 3 */
ebac4655
JA
4#include <stdio.h>
5#include <stdlib.h>
6#include <unistd.h>
7#include <fcntl.h>
8#include <ctype.h>
9#include <string.h>
10#include <errno.h>
b4692828 11#include <getopt.h>
ebac4655
JA
12#include <sys/ipc.h>
13#include <sys/shm.h>
14#include <sys/types.h>
15#include <sys/stat.h>
16
17#include "fio.h"
cb2c86fd 18#include "parse.h"
ebac4655 19
214e1eca
JA
20static char fio_version_string[] = "fio 1.14a";
21
ee738499 22#define FIO_RANDSEED (0xb1899bedUL)
ebac4655 23
214e1eca
JA
24static char **ini_file;
25static int max_jobs = MAX_JOBS;
e1f36503 26
214e1eca
JA
27struct thread_data def_thread;
28struct thread_data *threads = NULL;
e1f36503 29
214e1eca
JA
30int exitall_on_terminate = 0;
31int terse_output = 0;
32unsigned long long mlock_size = 0;
33FILE *f_out = NULL;
34FILE *f_err = NULL;
ee738499 35
214e1eca
JA
36int write_bw_log = 0;
37
38static int def_timeout = 0;
39static int write_lat_log = 0;
e1f36503 40
214e1eca 41static int prev_group_jobs;
b4692828
JA
42
43/*
44 * Command line options. These will contain the above, plus a few
45 * extra that only pertain to fio itself and not jobs.
46 */
214e1eca 47static struct option long_options[FIO_NR_OPTIONS] = {
b4692828
JA
48 {
49 .name = "output",
50 .has_arg = required_argument,
51 .val = 'o',
52 },
53 {
54 .name = "timeout",
55 .has_arg = required_argument,
56 .val = 't',
57 },
58 {
59 .name = "latency-log",
60 .has_arg = required_argument,
61 .val = 'l',
62 },
63 {
64 .name = "bandwidth-log",
65 .has_arg = required_argument,
66 .val = 'b',
67 },
68 {
69 .name = "minimal",
70 .has_arg = optional_argument,
71 .val = 'm',
72 },
73 {
74 .name = "version",
75 .has_arg = no_argument,
76 .val = 'v',
77 },
fd28ca49
JA
78 {
79 .name = "help",
80 .has_arg = no_argument,
81 .val = 'h',
82 },
83 {
84 .name = "cmdhelp",
320beefe 85 .has_arg = optional_argument,
fd28ca49
JA
86 .val = 'c',
87 },
b4692828
JA
88 {
89 .name = NULL,
90 },
91};
92
9728ce37
JB
93FILE *get_f_out()
94{
95 return f_out;
96}
97
98FILE *get_f_err()
99{
100 return f_err;
101}
102
906c8d75
JA
103/*
104 * Return a free job structure.
105 */
ebac4655
JA
106static struct thread_data *get_new_job(int global, struct thread_data *parent)
107{
108 struct thread_data *td;
109
110 if (global)
111 return &def_thread;
112 if (thread_number >= max_jobs)
113 return NULL;
114
115 td = &threads[thread_number++];
ddaeaa5a 116 *td = *parent;
ebac4655 117
ebac4655 118 td->thread_number = thread_number;
ebac4655
JA
119 return td;
120}
121
122static void put_job(struct thread_data *td)
123{
549577a7
JA
124 if (td == &def_thread)
125 return;
126
16edf25d 127 if (td->error)
6d86144d 128 log_info("fio: %s\n", td->verror);
16edf25d 129
ebac4655
JA
130 memset(&threads[td->thread_number - 1], 0, sizeof(*td));
131 thread_number--;
132}
133
127f6865
JA
134static int setup_rate(struct thread_data *td)
135{
136 unsigned long nr_reads_per_msec;
137 unsigned long long rate;
138 unsigned int bs;
139
2dc1bbeb 140 if (!td->o.rate && !td->o.rate_iops)
127f6865
JA
141 return 0;
142
143 if (td_rw(td))
2dc1bbeb 144 bs = td->o.rw_min_bs;
127f6865 145 else if (td_read(td))
2dc1bbeb 146 bs = td->o.min_bs[DDIR_READ];
127f6865 147 else
2dc1bbeb 148 bs = td->o.min_bs[DDIR_WRITE];
127f6865 149
2dc1bbeb
JA
150 if (td->o.rate) {
151 rate = td->o.rate;
127f6865
JA
152 nr_reads_per_msec = (rate * 1024 * 1000LL) / bs;
153 } else
2dc1bbeb 154 nr_reads_per_msec = td->o.rate_iops * 1000UL;
127f6865
JA
155
156 if (!nr_reads_per_msec) {
157 log_err("rate lower than supported\n");
158 return -1;
159 }
160
161 td->rate_usec_cycle = 1000000000ULL / nr_reads_per_msec;
162 td->rate_pending_usleep = 0;
163 return 0;
164}
165
dad915e3
JA
166/*
167 * Lazy way of fixing up options that depend on each other. We could also
168 * define option callback handlers, but this is easier.
169 */
4e991c23 170static int fixup_options(struct thread_data *td)
e1f36503 171{
2dc1bbeb 172 struct thread_options *o = &td->o;
dad915e3 173
2dc1bbeb
JA
174 if (!o->rwmixread && o->rwmixwrite)
175 o->rwmixread = 100 - o->rwmixwrite;
176
177 if (o->write_iolog_file && o->read_iolog_file) {
076efc7c 178 log_err("fio: read iolog overrides write_iolog\n");
2dc1bbeb
JA
179 free(o->write_iolog_file);
180 o->write_iolog_file = NULL;
076efc7c 181 }
16b462ae
JA
182
183 if (td->io_ops->flags & FIO_SYNCIO)
2dc1bbeb 184 o->iodepth = 1;
16b462ae 185 else {
2dc1bbeb
JA
186 if (!o->iodepth)
187 o->iodepth = o->open_files;
16b462ae
JA
188 }
189
190 /*
191 * only really works for sequential io for now, and with 1 file
192 */
2dc1bbeb
JA
193 if (o->zone_size && td_random(td) && o->open_files == 1)
194 o->zone_size = 0;
16b462ae
JA
195
196 /*
197 * Reads can do overwrites, we always need to pre-create the file
198 */
199 if (td_read(td) || td_rw(td))
2dc1bbeb 200 o->overwrite = 1;
16b462ae 201
2dc1bbeb
JA
202 if (!o->min_bs[DDIR_READ])
203 o->min_bs[DDIR_READ]= o->bs[DDIR_READ];
204 if (!o->max_bs[DDIR_READ])
205 o->max_bs[DDIR_READ] = o->bs[DDIR_READ];
206 if (!o->min_bs[DDIR_WRITE])
207 o->min_bs[DDIR_WRITE]= o->bs[DDIR_WRITE];
208 if (!o->max_bs[DDIR_WRITE])
209 o->max_bs[DDIR_WRITE] = o->bs[DDIR_WRITE];
a00735e6 210
2dc1bbeb 211 o->rw_min_bs = min(o->min_bs[DDIR_READ], o->min_bs[DDIR_WRITE]);
a00735e6 212
2dc1bbeb
JA
213 if (!o->file_size_high)
214 o->file_size_high = o->file_size_low;
9c60ce64 215
16b462ae 216 if (td_read(td) && !td_rw(td))
2dc1bbeb 217 o->verify = 0;
bb8895e0 218
2dc1bbeb 219 if (o->norandommap && o->verify != VERIFY_NONE) {
bb8895e0 220 log_err("fio: norandommap given, verify disabled\n");
2dc1bbeb 221 o->verify = VERIFY_NONE;
bb8895e0 222 }
2dc1bbeb 223 if (o->bs_unaligned && (o->odirect || td->io_ops->flags & FIO_RAWIO))
690adba3 224 log_err("fio: bs_unaligned may not work with raw io\n");
e0a22335 225
48097d5c
JA
226 /*
227 * thinktime_spin must be less than thinktime
228 */
2dc1bbeb
JA
229 if (o->thinktime_spin > o->thinktime)
230 o->thinktime_spin = o->thinktime;
e916b390
JA
231
232 /*
233 * The low water mark cannot be bigger than the iodepth
234 */
2dc1bbeb 235 if (o->iodepth_low > o->iodepth || !o->iodepth_low) {
9467b77c
JA
236 /*
237 * syslet work around - if the workload is sequential,
238 * we want to let the queue drain all the way down to
239 * avoid seeking between async threads
240 */
241 if (!strcmp(td->io_ops->name, "syslet-rw") && !td_random(td))
2dc1bbeb 242 o->iodepth_low = 1;
9467b77c 243 else
2dc1bbeb 244 o->iodepth_low = o->iodepth;
9467b77c 245 }
cb5ab512
JA
246
247 /*
248 * If batch number isn't set, default to the same as iodepth
249 */
2dc1bbeb
JA
250 if (o->iodepth_batch > o->iodepth || !o->iodepth_batch)
251 o->iodepth_batch = o->iodepth;
b5af8293 252
2dc1bbeb
JA
253 if (o->nr_files > td->files_index)
254 o->nr_files = td->files_index;
9f9214f2 255
2dc1bbeb
JA
256 if (o->open_files > o->nr_files || !o->open_files)
257 o->open_files = o->nr_files;
4e991c23 258
2dc1bbeb 259 if ((o->rate && o->rate_iops) || (o->ratemin && o->rate_iops_min)) {
4e991c23
JA
260 log_err("fio: rate and rate_iops are mutually exclusive\n");
261 return 1;
262 }
2dc1bbeb 263 if ((o->rate < o->ratemin) || (o->rate_iops < o->rate_iops_min)) {
4e991c23
JA
264 log_err("fio: minimum rate exceeds rate\n");
265 return 1;
266 }
267
268 return 0;
e1f36503
JA
269}
270
f8977ee6
JA
271/*
272 * This function leaks the buffer
273 */
274static char *to_kmg(unsigned int val)
275{
276 char *buf = malloc(32);
f3502ba2 277 char post[] = { 0, 'K', 'M', 'G', 'P', 'E', 0 };
f8977ee6
JA
278 char *p = post;
279
245142ff 280 do {
f8977ee6
JA
281 if (val & 1023)
282 break;
283
284 val >>= 10;
285 p++;
245142ff 286 } while (*p);
f8977ee6
JA
287
288 snprintf(buf, 31, "%u%c", val, *p);
289 return buf;
290}
291
09629a90
JA
292/* External engines are specified by "external:name.o") */
293static const char *get_engine_name(const char *str)
294{
295 char *p = strstr(str, ":");
296
297 if (!p)
298 return str;
299
300 p++;
301 strip_blank_front(&p);
302 strip_blank_end(p);
303 return p;
304}
305
e132cbae
JA
306static int exists_and_not_file(const char *filename)
307{
308 struct stat sb;
309
310 if (lstat(filename, &sb) == -1)
311 return 0;
312
313 if (S_ISREG(sb.st_mode))
314 return 0;
315
316 return 1;
317}
318
9c60ce64
JA
319/*
320 * Initialize the various random states we need (random io, block size ranges,
321 * read/write mix, etc).
322 */
323static int init_random_state(struct thread_data *td)
324{
325 unsigned long seeds[6];
326 int fd, num_maps, blocks;
327 struct fio_file *f;
328 unsigned int i;
329
330 fd = open("/dev/urandom", O_RDONLY);
331 if (fd == -1) {
332 td_verror(td, errno, "open");
333 return 1;
334 }
335
336 if (read(fd, seeds, sizeof(seeds)) < (int) sizeof(seeds)) {
337 td_verror(td, EIO, "read");
338 close(fd);
339 return 1;
340 }
341
342 close(fd);
343
344 os_random_seed(seeds[0], &td->bsrange_state);
345 os_random_seed(seeds[1], &td->verify_state);
346 os_random_seed(seeds[2], &td->rwmix_state);
347
2dc1bbeb 348 if (td->o.file_service_type == FIO_FSERVICE_RANDOM)
9c60ce64
JA
349 os_random_seed(seeds[3], &td->next_file_state);
350
351 os_random_seed(seeds[5], &td->file_size_state);
352
353 if (!td_random(td))
354 return 0;
355
2dc1bbeb 356 if (td->o.rand_repeatable)
9c60ce64
JA
357 seeds[4] = FIO_RANDSEED * td->thread_number;
358
2dc1bbeb 359 if (!td->o.norandommap) {
9c60ce64 360 for_each_file(td, f, i) {
2dc1bbeb 361 blocks = (f->real_file_size + td->o.rw_min_bs - 1) / td->o.rw_min_bs;
9c60ce64
JA
362 num_maps = (blocks + BLOCKS_PER_MAP-1)/ BLOCKS_PER_MAP;
363 f->file_map = malloc(num_maps * sizeof(long));
364 if (!f->file_map) {
365 log_err("fio: failed allocating random map. If running a large number of jobs, try the 'norandommap' option\n");
366 return 1;
367 }
368 f->num_maps = num_maps;
369 memset(f->file_map, 0, num_maps * sizeof(long));
370 }
371 }
372
373 os_random_seed(seeds[4], &td->random_state);
374 return 0;
375}
376
377
906c8d75
JA
378/*
379 * Adds a job to the list of things todo. Sanitizes the various options
380 * to make sure we don't have conflicts, and initializes various
381 * members of td.
382 */
75154845 383static int add_job(struct thread_data *td, const char *jobname, int job_add_num)
ebac4655 384{
413dd459
JA
385 const char *ddir_str[] = { NULL, "read", "write", "rw", NULL,
386 "randread", "randwrite", "randrw" };
af52b345 387 unsigned int i;
53cdc686 388 struct fio_file *f;
09629a90 389 const char *engine;
af52b345 390 char fname[PATH_MAX];
e132cbae 391 int numjobs, file_alloced;
ebac4655 392
ebac4655
JA
393 /*
394 * the def_thread is just for options, it's not a real job
395 */
396 if (td == &def_thread)
397 return 0;
398
2dc1bbeb 399 engine = get_engine_name(td->o.ioengine);
09629a90
JA
400 td->io_ops = load_ioengine(td, engine);
401 if (!td->io_ops) {
402 log_err("fio: failed to load engine %s\n", engine);
205927a3 403 goto err;
09629a90 404 }
df64119d 405
2dc1bbeb 406 if (td->o.use_thread)
9cedf167
JA
407 nr_thread++;
408 else
409 nr_process++;
410
2dc1bbeb 411 if (td->o.odirect)
690adba3
JA
412 td->io_ops->flags |= FIO_RAWIO;
413
e132cbae 414 file_alloced = 0;
2dc1bbeb 415 if (!td->o.filename && !td->files_index) {
e132cbae 416 file_alloced = 1;
80be24f4 417
2dc1bbeb 418 if (td->o.nr_files == 1 && exists_and_not_file(jobname))
e132cbae 419 add_file(td, jobname);
7b05a215 420 else {
2dc1bbeb 421 for (i = 0; i < td->o.nr_files; i++) {
e132cbae 422 sprintf(fname, "%s.%d.%d", jobname, td->thread_number, i);
7b05a215
JA
423 add_file(td, fname);
424 }
af52b345 425 }
0af7b542 426 }
ebac4655 427
4e991c23
JA
428 if (fixup_options(td))
429 goto err;
e0a22335 430
af52b345 431 for_each_file(td, f, i) {
2dc1bbeb
JA
432 if (td->o.directory && f->filetype == FIO_TYPE_FILE) {
433 sprintf(fname, "%s/%s", td->o.directory, f->file_name);
af52b345 434 f->file_name = strdup(fname);
53cdc686 435 }
53cdc686
JA
436 }
437
07739b57 438 td->mutex = fio_sem_init(0);
ebac4655 439
756867bd
JA
440 td->ts.clat_stat[0].min_val = td->ts.clat_stat[1].min_val = ULONG_MAX;
441 td->ts.slat_stat[0].min_val = td->ts.slat_stat[1].min_val = ULONG_MAX;
442 td->ts.bw_stat[0].min_val = td->ts.bw_stat[1].min_val = ULONG_MAX;
ebac4655 443
2dc1bbeb 444 if ((td->o.stonewall || td->o.numjobs > 1) && prev_group_jobs) {
3c5df6fa 445 prev_group_jobs = 0;
ebac4655 446 groupid++;
3c5df6fa 447 }
ebac4655
JA
448
449 td->groupid = groupid;
3c5df6fa 450 prev_group_jobs++;
ebac4655 451
9c60ce64
JA
452 if (init_random_state(td))
453 goto err;
454
ebac4655
JA
455 if (setup_rate(td))
456 goto err;
457
2dc1bbeb 458 if (td->o.write_lat_log) {
756867bd
JA
459 setup_log(&td->ts.slat_log);
460 setup_log(&td->ts.clat_log);
ebac4655 461 }
2dc1bbeb 462 if (td->o.write_bw_log)
756867bd 463 setup_log(&td->ts.bw_log);
ebac4655 464
2dc1bbeb
JA
465 if (!td->o.name)
466 td->o.name = strdup(jobname);
01452055 467
c6ae0a5b 468 if (!terse_output) {
b990b5c0 469 if (!job_add_num) {
ba0fbe10 470 if (!strcmp(td->io_ops->name, "cpuio"))
2dc1bbeb 471 log_info("%s: ioengine=cpu, cpuload=%u, cpucycle=%u\n", td->o.name, td->o.cpuload, td->o.cpucycle);
f8977ee6
JA
472 else {
473 char *c1, *c2, *c3, *c4;
474
2dc1bbeb
JA
475 c1 = to_kmg(td->o.min_bs[DDIR_READ]);
476 c2 = to_kmg(td->o.max_bs[DDIR_READ]);
477 c3 = to_kmg(td->o.min_bs[DDIR_WRITE]);
478 c4 = to_kmg(td->o.max_bs[DDIR_WRITE]);
f8977ee6 479
2dc1bbeb 480 log_info("%s: (g=%d): rw=%s, bs=%s-%s/%s-%s, ioengine=%s, iodepth=%u\n", td->o.name, td->groupid, ddir_str[td->o.td_ddir], c1, c2, c3, c4, td->io_ops->name, td->o.iodepth);
f8977ee6
JA
481
482 free(c1);
483 free(c2);
484 free(c3);
485 free(c4);
486 }
b990b5c0 487 } else if (job_add_num == 1)
6d86144d 488 log_info("...\n");
c6ae0a5b 489 }
ebac4655
JA
490
491 /*
492 * recurse add identical jobs, clear numjobs and stonewall options
493 * as they don't apply to sub-jobs
494 */
2dc1bbeb 495 numjobs = td->o.numjobs;
ebac4655
JA
496 while (--numjobs) {
497 struct thread_data *td_new = get_new_job(0, td);
498
499 if (!td_new)
500 goto err;
501
2dc1bbeb
JA
502 td_new->o.numjobs = 1;
503 td_new->o.stonewall = 0;
e132cbae
JA
504
505 if (file_alloced) {
2dc1bbeb 506 td_new->o.filename = NULL;
e132cbae
JA
507 td_new->files_index = 0;
508 td_new->files = NULL;
509 }
510
75154845 511 job_add_num = numjobs - 1;
ebac4655 512
75154845 513 if (add_job(td_new, jobname, job_add_num))
ebac4655
JA
514 goto err;
515 }
3c5df6fa 516
2dc1bbeb 517 if (td->o.numjobs > 1) {
3c5df6fa
JA
518 groupid++;
519 prev_group_jobs = 0;
520 }
521
ebac4655
JA
522 return 0;
523err:
524 put_job(td);
525 return -1;
526}
527
ebac4655
JA
528static int is_empty_or_comment(char *line)
529{
530 unsigned int i;
531
532 for (i = 0; i < strlen(line); i++) {
533 if (line[i] == ';')
534 return 1;
5cc2da30
IM
535 if (line[i] == '#')
536 return 1;
ebac4655
JA
537 if (!isspace(line[i]) && !iscntrl(line[i]))
538 return 0;
539 }
540
541 return 1;
542}
543
07261983
JA
544/*
545 * This is our [ini] type file parser.
546 */
1e97cce9 547static int parse_jobs_ini(char *file, int stonewall_flag)
ebac4655 548{
e1f36503 549 unsigned int global;
ebac4655 550 struct thread_data *td;
fee3bb48 551 char *string, *name;
ebac4655
JA
552 fpos_t off;
553 FILE *f;
554 char *p;
0c7e37a0 555 int ret = 0, stonewall;
ebac4655
JA
556
557 f = fopen(file, "r");
558 if (!f) {
aea47d44 559 perror("fopen job file");
ebac4655
JA
560 return 1;
561 }
562
563 string = malloc(4096);
564 name = malloc(256);
fee3bb48 565 memset(name, 0, 256);
ebac4655 566
0c7e37a0 567 stonewall = stonewall_flag;
7c124ac1
JA
568 do {
569 p = fgets(string, 4095, f);
570 if (!p)
45410acb 571 break;
ebac4655
JA
572 if (is_empty_or_comment(p))
573 continue;
fee3bb48 574 if (sscanf(p, "[%255s]", name) != 1)
ebac4655
JA
575 continue;
576
577 global = !strncmp(name, "global", 6);
578
579 name[strlen(name) - 1] = '\0';
580
581 td = get_new_job(global, &def_thread);
45410acb
JA
582 if (!td) {
583 ret = 1;
584 break;
585 }
ebac4655 586
972cfd25
JA
587 /*
588 * Seperate multiple job files by a stonewall
589 */
f9481919 590 if (!global && stonewall) {
2dc1bbeb 591 td->o.stonewall = stonewall;
972cfd25
JA
592 stonewall = 0;
593 }
594
ebac4655
JA
595 fgetpos(f, &off);
596 while ((p = fgets(string, 4096, f)) != NULL) {
597 if (is_empty_or_comment(p))
598 continue;
e1f36503 599
b6754f9d 600 strip_blank_front(&p);
7c124ac1
JA
601
602 if (p[0] == '[')
603 break;
604
4ae3f763 605 strip_blank_end(p);
aea47d44 606
e1f36503 607 fgetpos(f, &off);
ebac4655 608
45410acb
JA
609 /*
610 * Don't break here, continue parsing options so we
611 * dump all the bad ones. Makes trial/error fixups
612 * easier on the user.
613 */
214e1eca 614 ret |= fio_option_parse(td, p);
ebac4655 615 }
ebac4655 616
45410acb
JA
617 if (!ret) {
618 fsetpos(f, &off);
619 ret = add_job(td, name, 0);
b1508cf9
JA
620 } else {
621 log_err("fio: job %s dropped\n", name);
622 put_job(td);
45410acb 623 }
7c124ac1 624 } while (!ret);
ebac4655
JA
625
626 free(string);
627 free(name);
628 fclose(f);
45410acb 629 return ret;
ebac4655
JA
630}
631
632static int fill_def_thread(void)
633{
634 memset(&def_thread, 0, sizeof(def_thread));
635
2dc1bbeb 636 if (fio_getaffinity(getpid(), &def_thread.o.cpumask) == -1) {
ebac4655
JA
637 perror("sched_getaffinity");
638 return 1;
639 }
640
641 /*
ee738499 642 * fill default options
ebac4655 643 */
214e1eca 644 fio_fill_default_options(&def_thread);
ee738499 645
2dc1bbeb
JA
646 def_thread.o.timeout = def_timeout;
647 def_thread.o.write_bw_log = write_bw_log;
648 def_thread.o.write_lat_log = write_lat_log;
ee738499 649
ebac4655 650#ifdef FIO_HAVE_DISK_UTIL
2dc1bbeb 651 def_thread.o.do_disk_util = 1;
ebac4655
JA
652#endif
653
654 return 0;
655}
656
214e1eca
JA
657static void free_shm(void)
658{
659 struct shmid_ds sbuf;
660
661 if (threads) {
662 shmdt((void *) threads);
663 threads = NULL;
664 shmctl(shm_id, IPC_RMID, &sbuf);
665 }
666}
667
668/*
669 * The thread area is shared between the main process and the job
670 * threads/processes. So setup a shared memory segment that will hold
671 * all the job info.
672 */
673static int setup_thread_area(void)
674{
675 /*
676 * 1024 is too much on some machines, scale max_jobs if
677 * we get a failure that looks like too large a shm segment
678 */
679 do {
680 size_t size = max_jobs * sizeof(struct thread_data);
681
682 shm_id = shmget(0, size, IPC_CREAT | 0600);
683 if (shm_id != -1)
684 break;
685 if (errno != EINVAL) {
686 perror("shmget");
687 break;
688 }
689
690 max_jobs >>= 1;
691 } while (max_jobs);
692
693 if (shm_id == -1)
694 return 1;
695
696 threads = shmat(shm_id, NULL, 0);
697 if (threads == (void *) -1) {
698 perror("shmat");
699 return 1;
700 }
701
702 atexit(free_shm);
703 return 0;
704}
705
0ab8db89 706static void usage(void)
4785f995
JA
707{
708 printf("%s\n", fio_version_string);
b4692828
JA
709 printf("\t--output\tWrite output to file\n");
710 printf("\t--timeout\tRuntime in seconds\n");
711 printf("\t--latency-log\tGenerate per-job latency logs\n");
712 printf("\t--bandwidth-log\tGenerate per-job bandwidth logs\n");
713 printf("\t--minimal\tMinimal (terse) output\n");
714 printf("\t--version\tPrint version info and exit\n");
fd28ca49
JA
715 printf("\t--help\t\tPrint this page\n");
716 printf("\t--cmdhelp=cmd\tPrint command help, \"all\" for all of them\n");
4785f995
JA
717}
718
972cfd25 719static int parse_cmd_line(int argc, char *argv[])
ebac4655 720{
b4692828 721 struct thread_data *td = NULL;
b1ec1da6 722 int c, ini_idx = 0, lidx, ret, dont_add_job = 0;
ebac4655 723
0be06ea2 724 while ((c = getopt_long_only(argc, argv, "", long_options, &lidx)) != -1) {
ebac4655 725 switch (c) {
b4692828
JA
726 case 't':
727 def_timeout = atoi(optarg);
728 break;
729 case 'l':
730 write_lat_log = 1;
731 break;
732 case 'w':
733 write_bw_log = 1;
734 break;
735 case 'o':
736 f_out = fopen(optarg, "w+");
737 if (!f_out) {
738 perror("fopen output");
739 exit(1);
740 }
741 f_err = f_out;
742 break;
743 case 'm':
744 terse_output = 1;
745 break;
746 case 'h':
747 usage();
748 exit(0);
fd28ca49 749 case 'c':
214e1eca 750 exit(fio_show_option_help(optarg));
b4692828
JA
751 case 'v':
752 printf("%s\n", fio_version_string);
753 exit(0);
754 case FIO_GETOPT_JOB: {
755 const char *opt = long_options[lidx].name;
756 char *val = optarg;
757
c2b1e753 758 if (!strncmp(opt, "name", 4) && td) {
2dc1bbeb 759 ret = add_job(td, td->o.name ?: "fio", 0);
c2b1e753
JA
760 if (ret) {
761 put_job(td);
762 return 0;
763 }
764 td = NULL;
765 }
b4692828 766 if (!td) {
38d0adb0 767 int global = !strncmp(val, "global", 6);
c2b1e753
JA
768
769 td = get_new_job(global, &def_thread);
b4692828
JA
770 if (!td)
771 return 0;
772 }
38d0adb0 773
214e1eca 774 ret = fio_cmd_option_parse(td, opt, val);
78217dfa 775 if (ret)
b1ec1da6 776 dont_add_job = 1;
b4692828
JA
777 break;
778 }
779 default:
b4692828 780 break;
ebac4655
JA
781 }
782 }
c9fad893 783
b4692828 784 if (td) {
b1ec1da6 785 if (dont_add_job)
b4692828 786 put_job(td);
b1ec1da6 787 else {
2dc1bbeb 788 ret = add_job(td, td->o.name ?: "fio", 0);
b1ec1da6
JA
789 if (ret)
790 put_job(td);
791 }
972cfd25 792 }
774a6177 793
b4692828
JA
794 while (optind < argc) {
795 ini_idx++;
796 ini_file = realloc(ini_file, ini_idx * sizeof(char *));
797 ini_file[ini_idx - 1] = strdup(argv[optind]);
798 optind++;
eb8bbf48 799 }
972cfd25
JA
800
801 return ini_idx;
ebac4655
JA
802}
803
b4692828 804
ebac4655
JA
805int parse_options(int argc, char *argv[])
806{
972cfd25
JA
807 int job_files, i;
808
b4692828
JA
809 f_out = stdout;
810 f_err = stderr;
811
214e1eca 812 fio_options_dup_and_init(long_options);
b4692828 813
ebac4655
JA
814 if (setup_thread_area())
815 return 1;
816 if (fill_def_thread())
817 return 1;
818
972cfd25 819 job_files = parse_cmd_line(argc, argv);
ebac4655 820
972cfd25
JA
821 for (i = 0; i < job_files; i++) {
822 if (fill_def_thread())
823 return 1;
0c7e37a0 824 if (parse_jobs_ini(ini_file[i], i))
972cfd25 825 return 1;
88c6ed80 826 free(ini_file[i]);
972cfd25 827 }
ebac4655 828
88c6ed80 829 free(ini_file);
b4692828
JA
830
831 if (!thread_number) {
832 log_err("No jobs defined(s)\n");
b4692828
JA
833 return 1;
834 }
835
ebac4655
JA
836 return 0;
837}