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