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