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