static bool
parse_args(int argc, char *argv[])
{
int opt;
const char known_opts[] = "chs"
#ifdef SOL_FLOW_INSPECTOR_ENABLED
"D"
#endif
;
while ((opt = getopt(argc, argv, known_opts)) != -1) {
switch (opt) {
case 'c':
args.check_only = true;
break;
case 's':
args.provide_sim_nodes = true;
break;
case 'h':
usage(argv[0]);
exit(EXIT_SUCCESS);
break;
#ifdef SOL_FLOW_INSPECTOR_ENABLED
case 'D':
inspector_init();
break;
#endif
default:
return false;
}
}
if (optind == argc)
return false;
args.filename = argv[optind];
sol_args_set(argc - optind, &argv[optind]);
return true;
}
static bool
parse_args(int argc, char *argv[])
{
int opt, err;
const char known_opts[] = "cho:stI:"
#ifdef SOL_FLOW_INSPECTOR_ENABLED
"D"
#endif
;
sol_ptr_vector_init(&args.fbp_search_paths);
while ((opt = getopt(argc, argv, known_opts)) != -1) {
switch (opt) {
case 'c':
args.check_only = true;
break;
case 's':
args.provide_sim_nodes = true;
break;
case 'h':
usage(argv[0]);
exit(EXIT_SUCCESS);
break;
case 'o':
if (args.options_count == MAX_OPTS) {
printf("Too many options.\n");
exit(EXIT_FAILURE);
}
args.options[args.options_count++] = optarg;
break;
case 't':
args.execute_type = true;
break;
#ifdef SOL_FLOW_INSPECTOR_ENABLED
case 'D':
inspector_init();
break;
#endif
case 'I':
err = sol_ptr_vector_append(&args.fbp_search_paths, optarg);
if (err < 0) {
printf("Out of memory\n");
exit(1);
}
break;
default:
return false;
}
}
if (optind == argc)
return false;
args.name = argv[optind];
if (args.execute_type) {
args.provide_sim_nodes = true;
}
sol_args_set(argc - optind, &argv[optind]);
return true;
}
