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