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