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