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