#include "parse.h"
+static void show_option_range(struct fio_option *o)
+{
+ if (!o->minval && !o->maxval)
+ return;
+
+ printf("%20s: min=%d, max=%d\n", "range", o->minval, o->maxval);
+}
+
+static void show_option_values(struct fio_option *o)
+{
+ const char *msg;
+ int i = 0;
+
+ do {
+ msg = o->posval[i].ival;
+ if (!msg)
+ break;
+
+ if (!i)
+ printf("%20s: ", "valid values");
+
+ printf("%s,", msg);
+ i++;
+ } while (i < PARSE_MAX_VP);
+
+ if (i)
+ printf("\n");
+}
+
static unsigned long get_mult_time(char c)
{
switch (c) {
case 'g':
case 'G':
return 1024 * 1024 * 1024;
+ case 'e':
+ case 'E':
+ return 1024 * 1024 * 1024 * 1024UL;
default:
return 1;
}
if (!len)
return 1;
- *val = strtol(str, NULL, 10);
+ *val = strtoll(str, NULL, 10);
if (*val == LONG_MAX && errno == ERANGE)
return 1;
static struct fio_option *find_option(struct fio_option *options,
const char *opt)
{
- struct fio_option *o = &options[0];
+ struct fio_option *o;
- while (o->name) {
+ for (o = &options[0]; o->name; o++) {
if (!strcmp(o->name, opt))
return o;
-
- o++;
+ else if (o->alias && !strcmp(o->alias, opt))
+ return o;
}
return NULL;
switch (o->type) {
case FIO_OPT_STR: {
fio_opt_str_fn *fn = o->cb;
+ const struct value_pair *vp;
+ int i;
- ret = fn(data, ptr);
+ ret = 1;
+ for (i = 0; i < PARSE_MAX_VP; i++) {
+ vp = &o->posval[i];
+ if (!vp->ival || vp->ival[0] == '\0')
+ break;
+ if (!strncmp(vp->ival, ptr, strlen(vp->ival))) {
+ ret = 0;
+ if (!o->off1)
+ break;
+ val_store(ilp, vp->oval, o->off1, data);
+ break;
+ }
+ }
+
+ if (ret)
+ show_option_values(o);
+ else if (fn)
+ ret = fn(data, ptr);
break;
}
case FIO_OPT_STR_VAL_TIME:
p1 = strchr(tmp, '-');
if (!p1) {
- ret = 1;
- break;
+ p1 = strchr(tmp, ':');
+ if (!p1) {
+ ret = 1;
+ break;
+ }
}
p2 = p1 + 1;
return 1;
}
+ if (o->neg)
+ il = !il;
+
if (fn)
ret = fn(data, &il);
else {
* Do this before parsing the first round, to check if we should
* copy set 1 options to set 2.
*/
- if (ptr)
+ if (ptr &&
+ (o->type != FIO_OPT_STR_STORE) &&
+ (o->type != FIO_OPT_STR)) {
ptr2 = strchr(ptr, ',');
+ if (!ptr2)
+ ptr2 = strchr(ptr, ':');
+ }
/*
* Don't return early if parsing the first option fails - if
return 1;
}
-static void show_option_range(struct fio_option *o)
+/*
+ * Option match, levenshtein distance. Handy for not quite remembering what
+ * the option name is.
+ */
+static int string_distance(const char *s1, const char *s2)
{
- if (!o->minval && !o->maxval)
- return;
+ unsigned int s1_len = strlen(s1);
+ unsigned int s2_len = strlen(s2);
+ unsigned int *p, *q, *r;
+ unsigned int i, j;
- printf("%16s: min=%d, max=%d\n", "range", o->minval, o->maxval);
-}
+ p = malloc(sizeof(unsigned int) * (s2_len + 1));
+ q = malloc(sizeof(unsigned int) * (s2_len + 1));
-static void show_option_values(struct fio_option *o)
-{
- const char *msg;
- int i = 0;
+ p[0] = 0;
+ for (i = 1; i <= s2_len; i++)
+ p[i] = p[i - 1] + 1;
- if (!o->posval)
- return;
+ for (i = 1; i <= s1_len; i++) {
+ q[0] = p[0] + 1;
+ for (j = 1; j <= s2_len; j++) {
+ unsigned int sub = p[j - 1];
- do {
- msg = o->posval[i];
- if (!msg)
- break;
-
- if (!i)
- printf("%16s: ", "valid values");
+ if (s1[i - 1] != s2[j - 1])
+ sub++;
- printf("%s,", msg);
- i++;
- } while (1);
+ q[j] = min(p[j] + 1, min(q[j - 1] + 1, sub));
+ }
+ r = p;
+ p = q;
+ q = r;
+ }
- if (i)
- printf("\n");
+ i = p[s2_len];
+ free(p);
+ free(q);
+ return i;
}
-int show_cmd_help(struct fio_option *options, const char *name)
+static void show_option_help(struct fio_option *o)
{
- int show_all = !strcmp(name, "all");
- struct fio_option *o = &options[0];
const char *typehelp[] = {
"string (opt=bla)",
"string with possible k/m/g postfix (opt=4k)",
"boolean value (opt=1)",
"no argument (opt)",
};
- int found = 0;
- while (o->name) {
- int match = !strcmp(name, o->name);
+ printf("%20s: %s\n", "type", typehelp[o->type]);
+ printf("%20s: %s\n", "default", o->def ? o->def : "no default");
+ show_option_range(o);
+ show_option_values(o);
+}
+
+int show_cmd_help(struct fio_option *options, const char *name)
+{
+ struct fio_option *o, *closest;
+ unsigned int best_dist;
+ int found = 0;
+ int show_all = 0;
+
+ if (!name || !strcmp(name, "all"))
+ show_all = 1;
+
+ closest = NULL;
+ best_dist = -1;
+ for (o = &options[0]; o->name; o++) {
+ int match = 0;
+
+ if (name) {
+ if (!strcmp(name, o->name))
+ match = 1;
+ else {
+ unsigned int dist;
+
+ dist = string_distance(name, o->name);
+ if (dist < best_dist) {
+ best_dist = dist;
+ closest = o;
+ }
+ }
+ }
if (show_all || match) {
found = 1;
- printf("%16s: %s\n", o->name, o->help);
- if (match) {
- printf("%16s: %s\n", "type", typehelp[o->type]);
- printf("%16s: %s\n", "default", o->def ? o->def : "no default");
- show_option_range(o);
- show_option_values(o);
- }
+ printf("%20s: %s\n", o->name, o->help);
+ if (show_all)
+ continue;
}
- o++;
+ if (!match)
+ continue;
+
+ show_option_help(o);
}
if (found)
return 0;
- printf("No such command: %s\n", name);
+ printf("No such command: %s", name);
+ if (closest) {
+ printf(" - showing closest match\n");
+ printf("%20s: %s\n", closest->name, closest->help);
+ show_option_help(closest);
+ } else
+ printf("\n");
+
return 1;
}
*/
void fill_default_options(void *data, struct fio_option *options)
{
- struct fio_option *o = &options[0];
+ struct fio_option *o;
- while (o->name) {
+ for (o = &options[0]; o->name; o++)
if (o->def)
handle_option(o, o->def, data);
- o++;
- }
}
/*
* Sanitize the options structure. For now it just sets min/max for bool
- * values.
+ * values and whether both callback and offsets are given.
*/
void options_init(struct fio_option *options)
{
- struct fio_option *o = &options[0];
+ struct fio_option *o;
- while (o->name) {
+ for (o = &options[0]; o->name; o++) {
if (o->type == FIO_OPT_BOOL) {
o->minval = 0;
o->maxval = 1;
}
- o++;
+ if (!o->cb && !o->off1)
+ fprintf(stderr, "Option %s: neither cb nor offset given\n", o->name);
+ if (o->type == FIO_OPT_STR)
+ continue;
+ if (o->cb && (o->off1 || o->off2 || o->off3 || o->off4))
+ fprintf(stderr, "Option %s: both cb and offset given\n", o->name);
}
}
projects / fio.git / blobdiff