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