static int
be_do_list(int argc, char **argv)
{
be_node_list_t *be_nodes = NULL;
boolean_t all = B_FALSE;
boolean_t dsets = B_FALSE;
boolean_t snaps = B_FALSE;
boolean_t parsable = B_FALSE;
int err = 1;
int c = 0;
char *be_name = NULL;
be_sort_t order = BE_SORT_UNSPECIFIED;
while ((c = getopt(argc, argv, "adk:svHK:")) != -1) {
switch (c) {
case 'a':
all = B_TRUE;
break;
case 'd':
dsets = B_TRUE;
break;
case 'k':
case 'K':
if (order != BE_SORT_UNSPECIFIED) {
(void) fprintf(stderr, _("Sort key can be "
"specified only once.\n"));
usage();
return (1);
}
if (strcmp(optarg, "date") == 0) {
if (c == 'k')
order = BE_SORT_DATE;
else
order = BE_SORT_DATE_REV;
break;
}
if (strcmp(optarg, "name") == 0) {
if (c == 'k')
order = BE_SORT_NAME;
else
order = BE_SORT_NAME_REV;
break;
}
if (strcmp(optarg, "space") == 0) {
if (c == 'k')
order = BE_SORT_SPACE;
else
order = BE_SORT_SPACE_REV;
break;
}
(void) fprintf(stderr, _("Unknown sort key: %s\n"),
optarg);
usage();
return (1);
case 's':
snaps = B_TRUE;
break;
case 'v':
libbe_print_errors(B_TRUE);
break;
case 'H':
parsable = B_TRUE;
break;
default:
usage();
return (1);
}
}
if (all) {
if (dsets) {
(void) fprintf(stderr, _("Invalid options: -a and %s "
"are mutually exclusive.\n"), "-d");
usage();
return (1);
}
if (snaps) {
(void) fprintf(stderr, _("Invalid options: -a and %s "
"are mutually exclusive.\n"), "-s");
usage();
return (1);
}
dsets = B_TRUE;
snaps = B_TRUE;
}
argc -= optind;
argv += optind;
if (argc == 1)
be_name = argv[0];
err = be_list(be_name, &be_nodes);
switch (err) {
case BE_SUCCESS:
/* the default sort is ascending date, no need to sort twice */
if (order == BE_SORT_UNSPECIFIED)
order = BE_SORT_DATE;
if (order != BE_SORT_DATE) {
err = be_sort(&be_nodes, order);
if (err != BE_SUCCESS) {
(void) fprintf(stderr, _("Unable to sort Boot "
"Environment\n"));
(void) fprintf(stderr, "%s\n",
be_err_to_str(err));
break;
}
}
print_nodes(be_name, dsets, snaps, parsable, be_nodes);
break;
case BE_ERR_BE_NOENT:
if (be_name == NULL)
(void) fprintf(stderr, _("No boot environments found "
"on this system.\n"));
else {
(void) fprintf(stderr, _("%s does not exist or appear "
"to be a valid BE.\nPlease check that the name of "
"the BE provided is correct.\n"), be_name);
}
break;
default:
(void) fprintf(stderr, _("Unable to display Boot "
"Environment\n"));
(void) fprintf(stderr, "%s\n", be_err_to_str(err));
}
if (be_nodes != NULL)
be_free_list(be_nodes);
return (err);
}
static int
be_do_list(int argc, char **argv)
{
be_node_list_t *be_nodes = NULL;
boolean_t all = B_FALSE;
boolean_t dsets = B_FALSE;
boolean_t snaps = B_FALSE;
boolean_t parsable = B_FALSE;
int err = 1;
int c = 0;
char *be_name = NULL;
while ((c = getopt(argc, argv, "nadsH")) != -1) {
switch (c) {
case 'a':
all = B_TRUE;
break;
case 'd':
dsets = B_TRUE;
break;
case 's':
snaps = B_TRUE;
break;
case 'H':
parsable = B_TRUE;
break;
default:
usage();
return (1);
}
}
if (all) {
if (dsets) {
(void) fprintf(stderr, _("Invalid options: -a and %s "
"are mutually exclusive.\n"), "-d");
usage();
return (1);
}
if (snaps) {
(void) fprintf(stderr, _("Invalid options: -a and %s "
"are mutually exclusive.\n"), "-s");
usage();
return (1);
}
dsets = B_TRUE;
snaps = B_TRUE;
}
argc -= optind;
argv += optind;
if (argc == 1)
be_name = argv[0];
err = be_list(be_name, &be_nodes);
switch (err) {
case BE_SUCCESS:
print_nodes(be_name, dsets, snaps, parsable, be_nodes);
break;
case BE_ERR_BE_NOENT:
if (be_name == NULL)
(void) fprintf(stderr, _("No boot environments found "
"on this system.\n"));
else {
(void) fprintf(stderr, _("%s does not exist or appear "
"to be a valid BE.\nPlease check that the name of "
"the BE provided is correct.\n"), be_name);
}
break;
default:
(void) fprintf(stderr, _("Unable to display Boot "
"Environment\n"));
(void) fprintf(stderr, "%s\n", be_err_to_str(err));
}
if (be_nodes != NULL)
be_free_list(be_nodes);
return (err);
}
