Windows: io cancellation often fails and causes crashes, so remove it.
[fio.git] / parse.c
CommitLineData
cb2c86fd
JA
1/*
2 * This file contains the ini and command liner parser main.
3 */
4#include <stdio.h>
5#include <stdlib.h>
6#include <unistd.h>
7#include <ctype.h>
8#include <string.h>
9#include <errno.h>
10#include <limits.h>
88b5a391 11#include <stdlib.h>
83349190 12#include <math.h>
ab9461ea 13#include <float.h>
cb2c86fd
JA
14
15#include "parse.h"
a3d741fa 16#include "debug.h"
9f988e2e 17#include "options.h"
e25839d4 18#include "minmax.h"
fd112d34 19#include "lib/ieee754.h"
cb2c86fd 20
3b8b7135 21static struct fio_option *fio_options;
d6978a32 22extern unsigned int fio_get_kb_base(void *);
3b8b7135 23
f085737f
JA
24static int vp_cmp(const void *p1, const void *p2)
25{
26 const struct value_pair *vp1 = p1;
27 const struct value_pair *vp2 = p2;
28
29 return strlen(vp2->ival) - strlen(vp1->ival);
30}
31
ce952ab6 32static void posval_sort(struct fio_option *o, struct value_pair *vpmap)
f085737f
JA
33{
34 const struct value_pair *vp;
35 int entries;
36
37 memset(vpmap, 0, PARSE_MAX_VP * sizeof(struct value_pair));
38
39 for (entries = 0; entries < PARSE_MAX_VP; entries++) {
40 vp = &o->posval[entries];
41 if (!vp->ival || vp->ival[0] == '\0')
42 break;
43
44 memcpy(&vpmap[entries], vp, sizeof(*vp));
45 }
46
47 qsort(vpmap, entries, sizeof(struct value_pair), vp_cmp);
48}
49
06b0be6e
JA
50static void show_option_range(struct fio_option *o,
51 int (*logger)(const char *format, ...))
b1ec1da6 52{
83349190 53 if (o->type == FIO_OPT_FLOAT_LIST){
ab9461ea 54 if (o->minfp == DBL_MIN && o->maxfp == DBL_MAX)
83349190
YH
55 return;
56
06b0be6e 57 logger("%20s: min=%f", "range", o->minfp);
ab9461ea 58 if (o->maxfp != DBL_MAX)
06b0be6e
JA
59 logger(", max=%f", o->maxfp);
60 logger("\n");
83349190
YH
61 } else {
62 if (!o->minval && !o->maxval)
63 return;
b1ec1da6 64
06b0be6e 65 logger("%20s: min=%d", "range", o->minval);
83349190 66 if (o->maxval)
06b0be6e
JA
67 logger(", max=%d", o->maxval);
68 logger("\n");
83349190 69 }
b1ec1da6
JA
70}
71
72static void show_option_values(struct fio_option *o)
73{
a3073f4a 74 int i;
b1ec1da6 75
a3073f4a 76 for (i = 0; i < PARSE_MAX_VP; i++) {
7837213b 77 const struct value_pair *vp = &o->posval[i];
b1ec1da6 78
7837213b 79 if (!vp->ival)
a3073f4a 80 continue;
b1ec1da6 81
06b0be6e 82 log_info("%20s: %-10s", i == 0 ? "valid values" : "", vp->ival);
7837213b 83 if (vp->help)
06b0be6e
JA
84 log_info(" %s", vp->help);
85 log_info("\n");
a3073f4a 86 }
b1ec1da6
JA
87
88 if (i)
06b0be6e 89 log_info("\n");
b1ec1da6
JA
90}
91
06b0be6e 92static void show_option_help(struct fio_option *o, int is_err)
d447a8c2
JA
93{
94 const char *typehelp[] = {
07b3232d 95 "invalid",
d447a8c2 96 "string (opt=bla)",
ae3fb6fb 97 "string (opt=bla)",
d447a8c2
JA
98 "string with possible k/m/g postfix (opt=4k)",
99 "string with time postfix (opt=10s)",
100 "string (opt=bla)",
101 "string with dual range (opt=1k-4k,4k-8k)",
102 "integer value (opt=100)",
103 "boolean value (opt=1)",
83349190 104 "list of floating point values separated by ':' (opt=5.9:7.8)",
d447a8c2 105 "no argument (opt)",
07b3232d 106 "deprecated",
d447a8c2 107 };
06b0be6e
JA
108 int (*logger)(const char *format, ...);
109
110 if (is_err)
111 logger = log_err;
112 else
113 logger = log_info;
d447a8c2
JA
114
115 if (o->alias)
06b0be6e 116 logger("%20s: %s\n", "alias", o->alias);
d447a8c2 117
06b0be6e
JA
118 logger("%20s: %s\n", "type", typehelp[o->type]);
119 logger("%20s: %s\n", "default", o->def ? o->def : "no default");
07b3232d 120 if (o->prof_name)
06b0be6e
JA
121 logger("%20s: only for profile '%s'\n", "valid", o->prof_name);
122 show_option_range(o, logger);
d447a8c2
JA
123 show_option_values(o);
124}
125
cb2c86fd
JA
126static unsigned long get_mult_time(char c)
127{
128 switch (c) {
5ec10eaa
JA
129 case 'm':
130 case 'M':
131 return 60;
132 case 'h':
133 case 'H':
134 return 60 * 60;
135 case 'd':
136 case 'D':
137 return 24 * 60 * 60;
138 default:
139 return 1;
cb2c86fd
JA
140 }
141}
142
7bb59102
JA
143static unsigned long long __get_mult_bytes(const char *p, void *data,
144 int *percent)
cb2c86fd 145{
d6978a32 146 unsigned int kb_base = fio_get_kb_base(data);
a639f0bb 147 unsigned long long ret = 1;
57fc29fa
JA
148 unsigned int i, pow = 0, mult = kb_base;
149 char *c;
a639f0bb 150
57fc29fa
JA
151 if (!p)
152 return 1;
a639f0bb 153
57fc29fa
JA
154 c = strdup(p);
155
156 for (i = 0; i < strlen(c); i++)
157 c[i] = tolower(c[i]);
158
159 if (!strcmp("pib", c)) {
160 pow = 5;
161 mult = 1000;
162 } else if (!strcmp("tib", c)) {
163 pow = 4;
164 mult = 1000;
165 } else if (!strcmp("gib", c)) {
166 pow = 3;
167 mult = 1000;
168 } else if (!strcmp("mib", c)) {
169 pow = 2;
170 mult = 1000;
171 } else if (!strcmp("kib", c)) {
172 pow = 1;
173 mult = 1000;
174 } else if (!strcmp("p", c) || !strcmp("pb", c))
175 pow = 5;
176 else if (!strcmp("t", c) || !strcmp("tb", c))
177 pow = 4;
178 else if (!strcmp("g", c) || !strcmp("gb", c))
179 pow = 3;
180 else if (!strcmp("m", c) || !strcmp("mb", c))
181 pow = 2;
182 else if (!strcmp("k", c) || !strcmp("kb", c))
183 pow = 1;
7bb59102
JA
184 else if (!strcmp("%", c)) {
185 *percent = 1;
e721c57f 186 free(c);
7bb59102
JA
187 return ret;
188 }
57fc29fa
JA
189
190 while (pow--)
191 ret *= (unsigned long long) mult;
192
193 free(c);
a639f0bb 194 return ret;
cb2c86fd
JA
195}
196
7bb59102 197static unsigned long long get_mult_bytes(const char *str, int len, void *data,
6925dd35 198 int *percent)
57fc29fa 199{
55ed9636 200 const char *p = str;
ba4ddd69 201 int digit_seen = 0;
57fc29fa 202
1d1c187b 203 if (len < 2)
7bb59102 204 return __get_mult_bytes(str, data, percent);
1d1c187b 205
d0c814ec
SL
206 /*
207 * Go forward until we hit a non-digit, or +/- sign
208 */
55ed9636 209 while ((p - str) <= len) {
ba4ddd69
JA
210 if (!isdigit((int) *p) &&
211 (((*p != '+') && (*p != '-')) || digit_seen))
55ed9636 212 break;
3c703d13 213 digit_seen |= isdigit((int) *p);
55ed9636
JA
214 p++;
215 }
216
7bb59102 217 if (!isalpha((int) *p) && (*p != '%'))
57fc29fa
JA
218 p = NULL;
219
7bb59102 220 return __get_mult_bytes(p, data, percent);
57fc29fa
JA
221}
222
83349190
YH
223/*
224 * Convert string into a floating number. Return 1 for success and 0 otherwise.
225 */
e25839d4 226int str_to_float(const char *str, double *val)
83349190
YH
227{
228 return (1 == sscanf(str, "%lf", val));
229}
230
cb2c86fd 231/*
e1f36503 232 * convert string into decimal value, noting any size suffix
cb2c86fd 233 */
6925dd35 234int str_to_decimal(const char *str, long long *val, int kilo, void *data)
cb2c86fd 235{
b347f9da 236 int len, base;
cb2c86fd 237
cb2c86fd 238 len = strlen(str);
f90eff5a
JA
239 if (!len)
240 return 1;
cb2c86fd 241
b347f9da
JA
242 if (strstr(str, "0x") || strstr(str, "0X"))
243 base = 16;
244 else
245 base = 10;
246
247 *val = strtoll(str, NULL, base);
cda866ca 248 if (*val == LONG_MAX && errno == ERANGE)
cb2c86fd
JA
249 return 1;
250
7bb59102
JA
251 if (kilo) {
252 unsigned long long mult;
253 int perc = 0;
254
6925dd35 255 mult = get_mult_bytes(str, len, data, &perc);
7bb59102
JA
256 if (perc)
257 *val = -1ULL - *val;
258 else
259 *val *= mult;
260 } else
cb2c86fd 261 *val *= get_mult_time(str[len - 1]);
787f7e95 262
cb2c86fd
JA
263 return 0;
264}
265
6925dd35 266static int check_str_bytes(const char *p, long long *val, void *data)
cb2c86fd 267{
6925dd35 268 return str_to_decimal(p, val, 1, data);
cb2c86fd
JA
269}
270
63f29372 271static int check_str_time(const char *p, long long *val)
cb2c86fd 272{
6925dd35 273 return str_to_decimal(p, val, 0, NULL);
cb2c86fd
JA
274}
275
276void strip_blank_front(char **p)
277{
278 char *s = *p;
279
4c8e9640
JA
280 if (!strlen(s))
281 return;
76cd9378 282 while (isspace((int) *s))
cb2c86fd 283 s++;
4d651dad
JA
284
285 *p = s;
cb2c86fd
JA
286}
287
288void strip_blank_end(char *p)
289{
853ee7fc 290 char *start = p, *s;
523bfadb 291
4c8e9640
JA
292 if (!strlen(p))
293 return;
294
523bfadb
JA
295 s = strchr(p, ';');
296 if (s)
297 *s = '\0';
298 s = strchr(p, '#');
299 if (s)
300 *s = '\0';
301 if (s)
302 p = s;
303
7f7e6e59 304 s = p + strlen(p);
76cd9378 305 while ((isspace((int) *s) || iscntrl((int) *s)) && (s > start))
cb2c86fd
JA
306 s--;
307
308 *(s + 1) = '\0';
309}
310
d6978a32 311static int check_range_bytes(const char *str, long *val, void *data)
cb2c86fd 312{
57fc29fa 313 long long __val;
cb2c86fd 314
6925dd35 315 if (!str_to_decimal(str, &__val, 1, data)) {
57fc29fa 316 *val = __val;
cb2c86fd
JA
317 return 0;
318 }
319
cb2c86fd
JA
320 return 1;
321}
322
63f29372 323static int check_int(const char *p, int *val)
cb2c86fd 324{
787f7e95
JA
325 if (!strlen(p))
326 return 1;
d78ee463 327 if (strstr(p, "0x") || strstr(p, "0X")) {
a61bdfd8
JA
328 if (sscanf(p, "%x", val) == 1)
329 return 0;
330 } else {
331 if (sscanf(p, "%u", val) == 1)
332 return 0;
333 }
cb2c86fd 334
e1f36503
JA
335 return 1;
336}
cb2c86fd 337
808def70
JA
338static int opt_len(const char *str)
339{
340 char *postfix;
341
342 postfix = strchr(str, ':');
343 if (!postfix)
344 return strlen(str);
345
346 return (int)(postfix - str);
347}
348
119cd939
JA
349static int str_match_len(const struct value_pair *vp, const char *str)
350{
351 return max(strlen(vp->ival), opt_len(str));
352}
353
5f6ddf1e 354#define val_store(ptr, val, off, or, data) \
17abbe89
JA
355 do { \
356 ptr = td_var((data), (off)); \
5f6ddf1e
JA
357 if ((or)) \
358 *ptr |= (val); \
359 else \
360 *ptr = (val); \
17abbe89
JA
361 } while (0)
362
f90eff5a 363static int __handle_option(struct fio_option *o, const char *ptr, void *data,
83349190 364 int first, int more, int curr)
cb2c86fd 365{
63f29372 366 int il, *ilp;
fd112d34 367 fio_fp64_t *flp;
63f29372
JA
368 long long ull, *ullp;
369 long ul1, ul2;
83349190 370 double uf;
bfe1d592 371 char **cp = NULL;
e42b01eb 372 int ret = 0, is_time = 0;
c44b1ff5
JA
373 const struct value_pair *vp;
374 struct value_pair posval[PARSE_MAX_VP];
eef02441 375 int i, all_skipped = 1;
cb2c86fd 376
a3d741fa
JA
377 dprint(FD_PARSE, "__handle_option=%s, type=%d, ptr=%s\n", o->name,
378 o->type, ptr);
379
e3cedca7 380 if (!ptr && o->type != FIO_OPT_STR_SET && o->type != FIO_OPT_STR) {
28d7c363 381 log_err("Option %s requires an argument\n", o->name);
08e26e35
JA
382 return 1;
383 }
384
e1f36503 385 switch (o->type) {
5f6ddf1e
JA
386 case FIO_OPT_STR:
387 case FIO_OPT_STR_MULTI: {
e1f36503 388 fio_opt_str_fn *fn = o->cb;
b1ec1da6 389
f085737f
JA
390 posval_sort(o, posval);
391
5f6ddf1e 392 ret = 1;
b1ec1da6 393 for (i = 0; i < PARSE_MAX_VP; i++) {
f085737f 394 vp = &posval[i];
b1ec1da6 395 if (!vp->ival || vp->ival[0] == '\0')
a3073f4a 396 continue;
ae2ddba4 397 all_skipped = 0;
119cd939 398 if (!strncmp(vp->ival, ptr, str_match_len(vp, ptr))) {
b1ec1da6 399 ret = 0;
5f6ddf1e
JA
400 if (o->roff1) {
401 if (vp->or)
402 *(unsigned int *) o->roff1 |= vp->oval;
403 else
404 *(unsigned int *) o->roff1 = vp->oval;
405 } else {
02c6aad5 406 if (!o->off1)
5f6ddf1e
JA
407 continue;
408 val_store(ilp, vp->oval, o->off1, vp->or, data);
02c6aad5 409 }
5f6ddf1e 410 continue;
b1ec1da6
JA
411 }
412 }
cb2c86fd 413
ae2ddba4 414 if (ret && !all_skipped)
b1ec1da6
JA
415 show_option_values(o);
416 else if (fn)
417 ret = fn(data, ptr);
e1f36503
JA
418 break;
419 }
e42b01eb
JA
420 case FIO_OPT_STR_VAL_TIME:
421 is_time = 1;
1a1137d9 422 case FIO_OPT_INT:
e42b01eb
JA
423 case FIO_OPT_STR_VAL: {
424 fio_opt_str_val_fn *fn = o->cb;
6eaf09d6
SL
425 char tmp[128], *p;
426
427 strncpy(tmp, ptr, sizeof(tmp) - 1);
428 p = strchr(tmp, ',');
429 if (p)
430 *p = '\0';
e42b01eb
JA
431
432 if (is_time)
6eaf09d6 433 ret = check_str_time(tmp, &ull);
e42b01eb 434 else
6eaf09d6 435 ret = check_str_bytes(tmp, &ull, data);
e1f36503
JA
436
437 if (ret)
438 break;
439
db8e0165 440 if (o->maxval && ull > o->maxval) {
d4fc2f04
JA
441 log_err("max value out of range: %llu"
442 " (%u max)\n", ull, o->maxval);
db8e0165
JA
443 return 1;
444 }
445 if (o->minval && ull < o->minval) {
d4fc2f04
JA
446 log_err("min value out of range: %llu"
447 " (%u min)\n", ull, o->minval);
db8e0165
JA
448 return 1;
449 }
e1f36503
JA
450
451 if (fn)
452 ret = fn(data, &ull);
453 else {
e01b22b8 454 if (o->type == FIO_OPT_INT) {
02c6aad5
JA
455 if (first) {
456 if (o->roff1)
7758d4f0 457 *(unsigned int *) o->roff1 = ull;
02c6aad5 458 else
5f6ddf1e 459 val_store(ilp, ull, o->off1, 0, data);
02c6aad5 460 }
6eaf09d6 461 if (curr == 1) {
02c6aad5 462 if (o->roff2)
7758d4f0 463 *(unsigned int *) o->roff2 = ull;
02c6aad5 464 else if (o->off2)
5f6ddf1e 465 val_store(ilp, ull, o->off2, 0, data);
02c6aad5 466 }
6eaf09d6
SL
467 if (curr == 2) {
468 if (o->roff3)
469 *(unsigned int *) o->roff3 = ull;
470 else if (o->off3)
471 val_store(ilp, ull, o->off3, 0, data);
472 }
473 if (!more) {
474 if (curr < 1) {
475 if (o->roff2)
476 *(unsigned int *) o->roff2 = ull;
477 else if (o->off2)
478 val_store(ilp, ull, o->off2, 0, data);
479 }
480 if (curr < 2) {
481 if (o->roff3)
482 *(unsigned int *) o->roff3 = ull;
483 else if (o->off3)
484 val_store(ilp, ull, o->off3, 0, data);
485 }
486 }
75e6f36f 487 } else {
02c6aad5
JA
488 if (first) {
489 if (o->roff1)
490 *(unsigned long long *) o->roff1 = ull;
491 else
5f6ddf1e 492 val_store(ullp, ull, o->off1, 0, data);
02c6aad5
JA
493 }
494 if (!more) {
495 if (o->roff2)
496 *(unsigned long long *) o->roff2 = ull;
497 else if (o->off2)
5f6ddf1e 498 val_store(ullp, ull, o->off2, 0, data);
02c6aad5 499 }
75e6f36f 500 }
e1f36503
JA
501 }
502 break;
503 }
83349190 504 case FIO_OPT_FLOAT_LIST: {
eef02441
JA
505 char *cp2;
506
435d195a
VKF
507 if (first) {
508 /*
509 ** Initialize precision to 0 and zero out list
510 ** in case specified list is shorter than default
511 */
512 ul2 = 0;
513 ilp = td_var(data, o->off2);
514 *ilp = ul2;
515
516 flp = td_var(data, o->off1);
517 for(i = 0; i < o->maxlen; i++)
518 flp[i].u.f = 0.0;
519 }
83349190 520 if (curr >= o->maxlen) {
28d7c363 521 log_err("the list exceeding max length %d\n",
83349190
YH
522 o->maxlen);
523 return 1;
524 }
619adf9c 525 if (!str_to_float(ptr, &uf)) {
28d7c363 526 log_err("not a floating point value: %s\n", ptr);
83349190
YH
527 return 1;
528 }
26650695 529 if (uf > o->maxfp) {
28d7c363 530 log_err("value out of range: %f"
83349190
YH
531 " (range max: %f)\n", uf, o->maxfp);
532 return 1;
533 }
26650695 534 if (uf < o->minfp) {
28d7c363 535 log_err("value out of range: %f"
83349190
YH
536 " (range min: %f)\n", uf, o->minfp);
537 return 1;
538 }
539
540 flp = td_var(data, o->off1);
fd112d34 541 flp[curr].u.f = uf;
83349190 542
435d195a
VKF
543 /*
544 ** Calculate precision for output by counting
545 ** number of digits after period. Find first
546 ** period in entire remaining list each time
547 */
548 cp2 = strchr(ptr, '.');
549 if (cp2 != NULL) {
eef02441 550 int len = 0;
435d195a
VKF
551
552 while (*++cp2 != '\0' && *cp2 >= '0' && *cp2 <= '9')
553 len++;
554
555 ilp = td_var(data, o->off2);
556 if (len > *ilp)
557 *ilp = len;
558 }
559
83349190
YH
560 break;
561 }
af52b345
JA
562 case FIO_OPT_STR_STORE: {
563 fio_opt_str_fn *fn = o->cb;
564
184b4098
SL
565 if (o->roff1 || o->off1) {
566 if (o->roff1)
567 cp = (char **) o->roff1;
568 else if (o->off1)
569 cp = td_var(data, o->off1);
570
571 *cp = strdup(ptr);
1c964ce5 572 }
02c6aad5 573
184b4098
SL
574 if (fn)
575 ret = fn(data, ptr);
576 else if (o->posval[0].ival) {
577 posval_sort(o, posval);
578
579 ret = 1;
580 for (i = 0; i < PARSE_MAX_VP; i++) {
581 vp = &posval[i];
582 if (!vp->ival || vp->ival[0] == '\0')
583 continue;
584 all_skipped = 0;
119cd939 585 if (!strncmp(vp->ival, ptr, str_match_len(vp, ptr))) {
184b4098
SL
586 char *rest;
587
588 ret = 0;
589 if (vp->cb)
590 fn = vp->cb;
591 rest = strstr(*cp ?: ptr, ":");
592 if (rest) {
593 if (*cp)
594 *rest = '\0';
595 ptr = rest + 1;
596 } else
597 ptr = NULL;
598 break;
599 }
af52b345
JA
600 }
601 }
c44b1ff5 602
184b4098
SL
603 if (!all_skipped) {
604 if (ret && !*cp)
605 show_option_values(o);
606 else if (ret && *cp)
607 ret = 0;
608 else if (fn && ptr)
609 ret = fn(data, ptr);
610 }
c44b1ff5 611
e1f36503 612 break;
af52b345 613 }
e1f36503 614 case FIO_OPT_RANGE: {
b765a372 615 char tmp[128];
e1f36503
JA
616 char *p1, *p2;
617
0bbab0e7 618 strncpy(tmp, ptr, sizeof(tmp) - 1);
b765a372 619
31d23f47
DE
620 /* Handle bsrange with separate read,write values: */
621 p1 = strchr(tmp, ',');
622 if (p1)
623 *p1 = '\0';
624
b765a372 625 p1 = strchr(tmp, '-');
e1f36503 626 if (!p1) {
0c9baf91
JA
627 p1 = strchr(tmp, ':');
628 if (!p1) {
629 ret = 1;
630 break;
631 }
e1f36503
JA
632 }
633
634 p2 = p1 + 1;
635 *p1 = '\0';
b765a372 636 p1 = tmp;
e1f36503
JA
637
638 ret = 1;
d6978a32
JA
639 if (!check_range_bytes(p1, &ul1, data) &&
640 !check_range_bytes(p2, &ul2, data)) {
e1f36503 641 ret = 0;
e1f36503 642 if (ul1 > ul2) {
f90eff5a
JA
643 unsigned long foo = ul1;
644
645 ul1 = ul2;
646 ul2 = foo;
647 }
648
649 if (first) {
02c6aad5 650 if (o->roff1)
7758d4f0 651 *(unsigned int *) o->roff1 = ul1;
02c6aad5 652 else
5f6ddf1e 653 val_store(ilp, ul1, o->off1, 0, data);
02c6aad5 654 if (o->roff2)
7758d4f0 655 *(unsigned int *) o->roff2 = ul2;
02c6aad5 656 else
5f6ddf1e 657 val_store(ilp, ul2, o->off2, 0, data);
17abbe89 658 }
6eaf09d6
SL
659 if (curr == 1) {
660 if (o->roff3 && o->roff4) {
661 *(unsigned int *) o->roff3 = ul1;
662 *(unsigned int *) o->roff4 = ul2;
663 } else if (o->off3 && o->off4) {
664 val_store(ilp, ul1, o->off3, 0, data);
665 val_store(ilp, ul2, o->off4, 0, data);
666 }
667 }
668 if (curr == 2) {
669 if (o->roff5 && o->roff6) {
670 *(unsigned int *) o->roff5 = ul1;
671 *(unsigned int *) o->roff6 = ul2;
672 } else if (o->off5 && o->off6) {
673 val_store(ilp, ul1, o->off5, 0, data);
674 val_store(ilp, ul2, o->off6, 0, data);
675 }
676 }
677 if (!more) {
678 if (curr < 1) {
679 if (o->roff3 && o->roff4) {
680 *(unsigned int *) o->roff3 = ul1;
681 *(unsigned int *) o->roff4 = ul2;
682 } else if (o->off3 && o->off4) {
683 val_store(ilp, ul1, o->off3, 0, data);
684 val_store(ilp, ul2, o->off4, 0, data);
685 }
686 }
687 if (curr < 2) {
688 if (o->roff5 && o->roff6) {
689 *(unsigned int *) o->roff5 = ul1;
690 *(unsigned int *) o->roff6 = ul2;
691 } else if (o->off5 && o->off6) {
692 val_store(ilp, ul1, o->off5, 0, data);
693 val_store(ilp, ul2, o->off6, 0, data);
694 }
695 }
e1f36503 696 }
17abbe89
JA
697 }
698
e1f36503
JA
699 break;
700 }
74ba1808
JA
701 case FIO_OPT_BOOL:
702 case FIO_OPT_STR_SET: {
e1f36503
JA
703 fio_opt_int_fn *fn = o->cb;
704
74ba1808
JA
705 if (ptr)
706 ret = check_int(ptr, &il);
707 else if (o->type == FIO_OPT_BOOL)
708 ret = 1;
709 else
710 il = 1;
711
e1f36503
JA
712 if (ret)
713 break;
714
db8e0165 715 if (o->maxval && il > (int) o->maxval) {
28d7c363 716 log_err("max value out of range: %d (%d max)\n",
5ec10eaa 717 il, o->maxval);
db8e0165
JA
718 return 1;
719 }
720 if (o->minval && il < o->minval) {
28d7c363 721 log_err("min value out of range: %d (%d min)\n",
5ec10eaa 722 il, o->minval);
db8e0165
JA
723 return 1;
724 }
e1f36503 725
76a43db4
JA
726 if (o->neg)
727 il = !il;
728
e1f36503
JA
729 if (fn)
730 ret = fn(data, &il);
731 else {
02c6aad5
JA
732 if (first) {
733 if (o->roff1)
734 *(unsigned int *)o->roff1 = il;
735 else
5f6ddf1e 736 val_store(ilp, il, o->off1, 0, data);
02c6aad5
JA
737 }
738 if (!more) {
739 if (o->roff2)
740 *(unsigned int *) o->roff2 = il;
741 else if (o->off2)
5f6ddf1e 742 val_store(ilp, il, o->off2, 0, data);
02c6aad5 743 }
e1f36503
JA
744 }
745 break;
746 }
15ca150e 747 case FIO_OPT_DEPRECATED:
06b0be6e 748 log_info("Option %s is deprecated\n", o->name);
15ca150e 749 break;
e1f36503 750 default:
06b0be6e 751 log_err("Bad option type %u\n", o->type);
e1f36503
JA
752 ret = 1;
753 }
cb2c86fd 754
70a4c0c8
JA
755 if (ret)
756 return ret;
757
d447a8c2 758 if (o->verify) {
70a4c0c8 759 ret = o->verify(o, data);
d447a8c2 760 if (ret) {
28d7c363
JA
761 log_err("Correct format for offending option\n");
762 log_err("%20s: %s\n", o->name, o->help);
06b0be6e 763 show_option_help(o, 1);
d447a8c2
JA
764 }
765 }
70a4c0c8 766
e1f36503 767 return ret;
cb2c86fd
JA
768}
769
7c8f1a5c 770static int handle_option(struct fio_option *o, const char *__ptr, void *data)
f90eff5a 771{
b62bdf2c
JA
772 char *o_ptr, *ptr, *ptr2;
773 int ret, done;
f90eff5a 774
7c8f1a5c
JA
775 dprint(FD_PARSE, "handle_option=%s, ptr=%s\n", o->name, __ptr);
776
b62bdf2c 777 o_ptr = ptr = NULL;
7c8f1a5c 778 if (__ptr)
b62bdf2c 779 o_ptr = ptr = strdup(__ptr);
a3d741fa 780
f90eff5a 781 /*
b62bdf2c
JA
782 * See if we have another set of parameters, hidden after a comma.
783 * Do this before parsing this round, to check if we should
787f7e95 784 * copy set 1 options to set 2.
f90eff5a 785 */
b62bdf2c
JA
786 done = 0;
787 ret = 1;
788 do {
789 int __ret;
790
791 ptr2 = NULL;
792 if (ptr &&
793 (o->type != FIO_OPT_STR_STORE) &&
83349190
YH
794 (o->type != FIO_OPT_STR) &&
795 (o->type != FIO_OPT_FLOAT_LIST)) {
b62bdf2c
JA
796 ptr2 = strchr(ptr, ',');
797 if (ptr2 && *(ptr2 + 1) == '\0')
798 *ptr2 = '\0';
6eaf09d6 799 if (o->type != FIO_OPT_STR_MULTI && o->type != FIO_OPT_RANGE) {
b62bdf2c
JA
800 if (!ptr2)
801 ptr2 = strchr(ptr, ':');
802 if (!ptr2)
803 ptr2 = strchr(ptr, '-');
804 }
83349190
YH
805 } else if (ptr && o->type == FIO_OPT_FLOAT_LIST) {
806 ptr2 = strchr(ptr, ':');
b62bdf2c 807 }
787f7e95 808
b62bdf2c
JA
809 /*
810 * Don't return early if parsing the first option fails - if
811 * we are doing multiple arguments, we can allow the first one
812 * being empty.
813 */
83349190 814 __ret = __handle_option(o, ptr, data, !done, !!ptr2, done);
b62bdf2c
JA
815 if (ret)
816 ret = __ret;
787f7e95 817
b62bdf2c
JA
818 if (!ptr2)
819 break;
f90eff5a 820
b62bdf2c
JA
821 ptr = ptr2 + 1;
822 done++;
823 } while (1);
787f7e95 824
b62bdf2c
JA
825 if (o_ptr)
826 free(o_ptr);
827 return ret;
f90eff5a
JA
828}
829
de890a1e 830static struct fio_option *get_option(char *opt,
07b3232d 831 struct fio_option *options, char **post)
3b8b7135
JA
832{
833 struct fio_option *o;
834 char *ret;
835
836 ret = strchr(opt, '=');
837 if (ret) {
838 *post = ret;
839 *ret = '\0';
de890a1e 840 ret = opt;
3b8b7135 841 (*post)++;
43c129b4 842 strip_blank_end(ret);
07b3232d 843 o = find_option(options, ret);
3b8b7135 844 } else {
07b3232d 845 o = find_option(options, opt);
3b8b7135
JA
846 *post = NULL;
847 }
848
849 return o;
850}
851
852static int opt_cmp(const void *p1, const void *p2)
853{
de890a1e
SL
854 struct fio_option *o;
855 char *s, *foo;
8cdabc1d 856 int prio1, prio2;
3b8b7135 857
8cdabc1d 858 prio1 = prio2 = 0;
3b8b7135 859
de890a1e
SL
860 if (*(char **)p1) {
861 s = strdup(*((char **) p1));
862 o = get_option(s, fio_options, &foo);
863 if (o)
864 prio1 = o->prio;
865 free(s);
866 }
867 if (*(char **)p2) {
868 s = strdup(*((char **) p2));
869 o = get_option(s, fio_options, &foo);
870 if (o)
871 prio2 = o->prio;
872 free(s);
873 }
874
8cdabc1d 875 return prio2 - prio1;
3b8b7135
JA
876}
877
878void sort_options(char **opts, struct fio_option *options, int num_opts)
879{
880 fio_options = options;
881 qsort(opts, num_opts, sizeof(char *), opt_cmp);
882 fio_options = NULL;
883}
884
b4692828 885int parse_cmd_option(const char *opt, const char *val,
07b3232d 886 struct fio_option *options, void *data)
b4692828
JA
887{
888 struct fio_option *o;
889
07b3232d 890 o = find_option(options, opt);
b4692828 891 if (!o) {
06b0be6e 892 log_err("Bad option <%s>\n", opt);
b4692828
JA
893 return 1;
894 }
895
b1508cf9
JA
896 if (!handle_option(o, val, data))
897 return 0;
898
06b0be6e 899 log_err("fio: failed parsing %s=%s\n", opt, val);
b1508cf9 900 return 1;
b4692828
JA
901}
902
de890a1e
SL
903int parse_option(char *opt, const char *input,
904 struct fio_option *options, struct fio_option **o, void *data)
cb2c86fd 905{
d0c814ec 906 char *post;
e1f36503 907
d0c814ec
SL
908 if (!opt) {
909 log_err("fio: failed parsing %s\n", input);
de890a1e 910 *o = NULL;
38789b58 911 return 1;
d0c814ec 912 }
e1f36503 913
de890a1e
SL
914 *o = get_option(opt, options, &post);
915 if (!*o) {
916 if (post) {
917 int len = strlen(opt);
918 if (opt + len + 1 != post)
919 memmove(opt + len + 1, post, strlen(post));
920 opt[len] = '=';
921 }
e1f36503
JA
922 return 1;
923 }
924
de890a1e 925 if (!handle_option(*o, post, data)) {
b1508cf9 926 return 0;
0401bca6 927 }
b1508cf9 928
d0c814ec 929 log_err("fio: failed parsing %s\n", input);
b1508cf9 930 return 1;
e1f36503 931}
fd28ca49 932
0e9f7fac
JA
933/*
934 * Option match, levenshtein distance. Handy for not quite remembering what
935 * the option name is.
936 */
937static int string_distance(const char *s1, const char *s2)
938{
939 unsigned int s1_len = strlen(s1);
940 unsigned int s2_len = strlen(s2);
941 unsigned int *p, *q, *r;
942 unsigned int i, j;
943
944 p = malloc(sizeof(unsigned int) * (s2_len + 1));
945 q = malloc(sizeof(unsigned int) * (s2_len + 1));
946
947 p[0] = 0;
948 for (i = 1; i <= s2_len; i++)
949 p[i] = p[i - 1] + 1;
950
951 for (i = 1; i <= s1_len; i++) {
952 q[0] = p[0] + 1;
953 for (j = 1; j <= s2_len; j++) {
954 unsigned int sub = p[j - 1];
955
956 if (s1[i - 1] != s2[j - 1])
957 sub++;
958
959 q[j] = min(p[j] + 1, min(q[j - 1] + 1, sub));
960 }
961 r = p;
962 p = q;
963 q = r;
964 }
965
966 i = p[s2_len];
967 free(p);
968 free(q);
969 return i;
970}
971
afdf9352
JA
972static struct fio_option *find_child(struct fio_option *options,
973 struct fio_option *o)
974{
975 struct fio_option *__o;
976
fdf28744
JA
977 for (__o = options + 1; __o->name; __o++)
978 if (__o->parent && !strcmp(__o->parent, o->name))
afdf9352
JA
979 return __o;
980
981 return NULL;
982}
983
323d9113
JA
984static void __print_option(struct fio_option *o, struct fio_option *org,
985 int level)
afdf9352
JA
986{
987 char name[256], *p;
323d9113 988 int depth;
afdf9352
JA
989
990 if (!o)
991 return;
ef9aff52
JA
992 if (!org)
993 org = o;
5ec10eaa 994
afdf9352 995 p = name;
323d9113
JA
996 depth = level;
997 while (depth--)
998 p += sprintf(p, "%s", " ");
afdf9352
JA
999
1000 sprintf(p, "%s", o->name);
1001
28d7c363 1002 log_info("%-24s: %s\n", name, o->help);
323d9113
JA
1003}
1004
1005static void print_option(struct fio_option *o)
1006{
1007 struct fio_option *parent;
1008 struct fio_option *__o;
1009 unsigned int printed;
1010 unsigned int level;
1011
1012 __print_option(o, NULL, 0);
1013 parent = o;
1014 level = 0;
1015 do {
1016 level++;
1017 printed = 0;
1018
1019 while ((__o = find_child(o, parent)) != NULL) {
1020 __print_option(__o, o, level);
1021 o = __o;
1022 printed++;
1023 }
1024
1025 parent = o;
1026 } while (printed);
afdf9352
JA
1027}
1028
07b3232d 1029int show_cmd_help(struct fio_option *options, const char *name)
0e9f7fac
JA
1030{
1031 struct fio_option *o, *closest;
d091d099 1032 unsigned int best_dist = -1U;
29fc6afe 1033 int found = 0;
320beefe
JA
1034 int show_all = 0;
1035
1036 if (!name || !strcmp(name, "all"))
1037 show_all = 1;
fd28ca49 1038
0e9f7fac
JA
1039 closest = NULL;
1040 best_dist = -1;
4945ba12 1041 for (o = &options[0]; o->name; o++) {
320beefe
JA
1042 int match = 0;
1043
15ca150e
JA
1044 if (o->type == FIO_OPT_DEPRECATED)
1045 continue;
07b3232d
JA
1046 if (!exec_profile && o->prof_name)
1047 continue;
15ca150e 1048
0e9f7fac 1049 if (name) {
7f9348f8
JA
1050 if (!strcmp(name, o->name) ||
1051 (o->alias && !strcmp(name, o->alias)))
0e9f7fac
JA
1052 match = 1;
1053 else {
1054 unsigned int dist;
1055
1056 dist = string_distance(name, o->name);
1057 if (dist < best_dist) {
1058 best_dist = dist;
1059 closest = o;
1060 }
1061 }
1062 }
fd28ca49
JA
1063
1064 if (show_all || match) {
29fc6afe 1065 found = 1;
c167dedc 1066 if (match)
28d7c363 1067 log_info("%20s: %s\n", o->name, o->help);
c167dedc 1068 if (show_all) {
afdf9352 1069 if (!o->parent)
323d9113 1070 print_option(o);
4945ba12 1071 continue;
c167dedc 1072 }
fd28ca49
JA
1073 }
1074
70df2f19
JA
1075 if (!match)
1076 continue;
1077
06b0be6e 1078 show_option_help(o, 0);
fd28ca49
JA
1079 }
1080
29fc6afe
JA
1081 if (found)
1082 return 0;
fd28ca49 1083
28d7c363 1084 log_err("No such command: %s", name);
d091d099
JA
1085
1086 /*
1087 * Only print an appropriately close option, one where the edit
1088 * distance isn't too big. Otherwise we get crazy matches.
1089 */
1090 if (closest && best_dist < 3) {
28d7c363
JA
1091 log_info(" - showing closest match\n");
1092 log_info("%20s: %s\n", closest->name, closest->help);
06b0be6e 1093 show_option_help(closest, 0);
0e9f7fac 1094 } else
28d7c363 1095 log_info("\n");
0e9f7fac 1096
29fc6afe 1097 return 1;
fd28ca49 1098}
ee738499 1099
13335ddb
JA
1100/*
1101 * Handle parsing of default parameters.
1102 */
ee738499
JA
1103void fill_default_options(void *data, struct fio_option *options)
1104{
4945ba12 1105 struct fio_option *o;
ee738499 1106
a3d741fa
JA
1107 dprint(FD_PARSE, "filling default options\n");
1108
4945ba12 1109 for (o = &options[0]; o->name; o++)
ee738499
JA
1110 if (o->def)
1111 handle_option(o, o->def, data);
ee738499 1112}
13335ddb 1113
9f988e2e
JA
1114void option_init(struct fio_option *o)
1115{
1116 if (o->type == FIO_OPT_DEPRECATED)
1117 return;
1118 if (o->type == FIO_OPT_BOOL) {
1119 o->minval = 0;
1120 o->maxval = 1;
1121 }
d4fc2f04
JA
1122 if (o->type == FIO_OPT_INT) {
1123 if (!o->maxval)
1124 o->maxval = UINT_MAX;
1125 }
83349190 1126 if (o->type == FIO_OPT_FLOAT_LIST) {
ab9461ea
BC
1127 o->minfp = DBL_MIN;
1128 o->maxfp = DBL_MAX;
83349190 1129 }
9f988e2e 1130 if (o->type == FIO_OPT_STR_SET && o->def) {
06b0be6e 1131 log_err("Option %s: string set option with"
9f988e2e
JA
1132 " default will always be true\n", o->name);
1133 }
06b0be6e
JA
1134 if (!o->cb && (!o->off1 && !o->roff1))
1135 log_err("Option %s: neither cb nor offset given\n", o->name);
5f6ddf1e
JA
1136 if (o->type == FIO_OPT_STR || o->type == FIO_OPT_STR_STORE ||
1137 o->type == FIO_OPT_STR_MULTI)
9f988e2e 1138 return;
e2de69da
JA
1139 if (o->cb && ((o->off1 || o->off2 || o->off3 || o->off4) ||
1140 (o->roff1 || o->roff2 || o->roff3 || o->roff4))) {
06b0be6e 1141 log_err("Option %s: both cb and offset given\n", o->name);
9f988e2e
JA
1142 }
1143}
1144
13335ddb
JA
1145/*
1146 * Sanitize the options structure. For now it just sets min/max for bool
5b0a8880 1147 * values and whether both callback and offsets are given.
13335ddb
JA
1148 */
1149void options_init(struct fio_option *options)
1150{
4945ba12 1151 struct fio_option *o;
13335ddb 1152
a3d741fa
JA
1153 dprint(FD_PARSE, "init options\n");
1154
9f988e2e
JA
1155 for (o = &options[0]; o->name; o++)
1156 option_init(o);
13335ddb 1157}
7e356b2d
JA
1158
1159void options_free(struct fio_option *options, void *data)
1160{
1161 struct fio_option *o;
1162 char **ptr;
1163
1164 dprint(FD_PARSE, "free options\n");
1165
1166 for (o = &options[0]; o->name; o++) {
de890a1e 1167 if (o->type != FIO_OPT_STR_STORE || !o->off1)
7e356b2d
JA
1168 continue;
1169
1170 ptr = td_var(data, o->off1);
1171 if (*ptr) {
1172 free(*ptr);
1173 *ptr = NULL;
1174 }
1175 }
1176}