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