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