18d2fbde5SJustin T. Gibbs /* 28d2fbde5SJustin T. Gibbs * Copyright (c) 1998 Kenneth D. Merry. 38d2fbde5SJustin T. Gibbs * All rights reserved. 48d2fbde5SJustin T. Gibbs * 58d2fbde5SJustin T. Gibbs * Redistribution and use in source and binary forms, with or without 68d2fbde5SJustin T. Gibbs * modification, are permitted provided that the following conditions 78d2fbde5SJustin T. Gibbs * are met: 88d2fbde5SJustin T. Gibbs * 1. Redistributions of source code must retain the above copyright 98d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer. 108d2fbde5SJustin T. Gibbs * 2. Redistributions in binary form must reproduce the above copyright 118d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer in the 128d2fbde5SJustin T. Gibbs * documentation and/or other materials provided with the distribution. 138d2fbde5SJustin T. Gibbs * 3. The name of the author may not be used to endorse or promote products 148d2fbde5SJustin T. Gibbs * derived from this software without specific prior written permission. 158d2fbde5SJustin T. Gibbs * 168d2fbde5SJustin T. Gibbs * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 178d2fbde5SJustin T. Gibbs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 188d2fbde5SJustin T. Gibbs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 198d2fbde5SJustin T. Gibbs * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 208d2fbde5SJustin T. Gibbs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 218d2fbde5SJustin T. Gibbs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 228d2fbde5SJustin T. Gibbs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 238d2fbde5SJustin T. Gibbs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 248d2fbde5SJustin T. Gibbs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 258d2fbde5SJustin T. Gibbs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 268d2fbde5SJustin T. Gibbs * SUCH DAMAGE. 278d2fbde5SJustin T. Gibbs * 288d2fbde5SJustin T. Gibbs * $Id$ 298d2fbde5SJustin T. Gibbs */ 308d2fbde5SJustin T. Gibbs /* 318d2fbde5SJustin T. Gibbs * Some code and ideas taken from the old disks.c. 328d2fbde5SJustin T. Gibbs * static char sccsid[] = "@(#)disks.c 8.1 (Berkeley) 6/6/93"; 338d2fbde5SJustin T. Gibbs */ 348d2fbde5SJustin T. Gibbs /*- 358d2fbde5SJustin T. Gibbs * Copyright (c) 1980, 1992, 1993 368d2fbde5SJustin T. Gibbs * The Regents of the University of California. All rights reserved. 378d2fbde5SJustin T. Gibbs * 388d2fbde5SJustin T. Gibbs * Redistribution and use in source and binary forms, with or without 398d2fbde5SJustin T. Gibbs * modification, are permitted provided that the following conditions 408d2fbde5SJustin T. Gibbs * are met: 418d2fbde5SJustin T. Gibbs * 1. Redistributions of source code must retain the above copyright 428d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer. 438d2fbde5SJustin T. Gibbs * 2. Redistributions in binary form must reproduce the above copyright 448d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer in the 458d2fbde5SJustin T. Gibbs * documentation and/or other materials provided with the distribution. 468d2fbde5SJustin T. Gibbs * 3. All advertising materials mentioning features or use of this software 478d2fbde5SJustin T. Gibbs * must display the following acknowledgement: 488d2fbde5SJustin T. Gibbs * This product includes software developed by the University of 498d2fbde5SJustin T. Gibbs * California, Berkeley and its contributors. 508d2fbde5SJustin T. Gibbs * 4. Neither the name of the University nor the names of its contributors 518d2fbde5SJustin T. Gibbs * may be used to endorse or promote products derived from this software 528d2fbde5SJustin T. Gibbs * without specific prior written permission. 538d2fbde5SJustin T. Gibbs * 548d2fbde5SJustin T. Gibbs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 558d2fbde5SJustin T. Gibbs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 568d2fbde5SJustin T. Gibbs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 578d2fbde5SJustin T. Gibbs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 588d2fbde5SJustin T. Gibbs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 598d2fbde5SJustin T. Gibbs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 608d2fbde5SJustin T. Gibbs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 618d2fbde5SJustin T. Gibbs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 628d2fbde5SJustin T. Gibbs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 638d2fbde5SJustin T. Gibbs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 648d2fbde5SJustin T. Gibbs * SUCH DAMAGE. 658d2fbde5SJustin T. Gibbs */ 668d2fbde5SJustin T. Gibbs 678d2fbde5SJustin T. Gibbs #include <sys/types.h> 688d2fbde5SJustin T. Gibbs #include <sys/devicestat.h> 698d2fbde5SJustin T. Gibbs #include <sys/dkstat.h> 708d2fbde5SJustin T. Gibbs 718d2fbde5SJustin T. Gibbs #include <string.h> 728d2fbde5SJustin T. Gibbs #include <devstat.h> 738d2fbde5SJustin T. Gibbs #include "systat.h" 748d2fbde5SJustin T. Gibbs #include "extern.h" 758d2fbde5SJustin T. Gibbs 768d2fbde5SJustin T. Gibbs typedef enum { 778d2fbde5SJustin T. Gibbs DS_MATCHTYPE_NONE, 788d2fbde5SJustin T. Gibbs DS_MATCHTYPE_SPEC, 798d2fbde5SJustin T. Gibbs DS_MATCHTYPE_PATTERN 808d2fbde5SJustin T. Gibbs } last_match_type; 818d2fbde5SJustin T. Gibbs 828d2fbde5SJustin T. Gibbs last_match_type last_type; 838d2fbde5SJustin T. Gibbs struct device_selection *dev_select; 848d2fbde5SJustin T. Gibbs int generation, num_devices, num_selected; 858d2fbde5SJustin T. Gibbs int num_selections, select_generation; 868d2fbde5SJustin T. Gibbs struct devstat_match *matches = NULL; 878d2fbde5SJustin T. Gibbs int num_matches = 0; 888d2fbde5SJustin T. Gibbs char **specified_devices; 898d2fbde5SJustin T. Gibbs int num_devices_specified = 0; 908d2fbde5SJustin T. Gibbs 918d2fbde5SJustin T. Gibbs static int dsmatchselect(char *args, devstat_select_mode select_mode, 928d2fbde5SJustin T. Gibbs int maxshowdevs, struct statinfo *s1); 938d2fbde5SJustin T. Gibbs static int dsselect(char *args, devstat_select_mode select_mode, 948d2fbde5SJustin T. Gibbs int maxshowdevs, struct statinfo *s1); 958d2fbde5SJustin T. Gibbs 968d2fbde5SJustin T. Gibbs int 978d2fbde5SJustin T. Gibbs dsinit(int maxshowdevs, struct statinfo *s1, struct statinfo *s2, 988d2fbde5SJustin T. Gibbs struct statinfo *s3) 998d2fbde5SJustin T. Gibbs { 1008d2fbde5SJustin T. Gibbs 1018d2fbde5SJustin T. Gibbs /* 1028d2fbde5SJustin T. Gibbs * Make sure that the userland devstat version matches the kernel 1038d2fbde5SJustin T. Gibbs * devstat version. If not, exit and print a message informing 1048d2fbde5SJustin T. Gibbs * the user of his mistake. 1058d2fbde5SJustin T. Gibbs */ 1068d2fbde5SJustin T. Gibbs if (checkversion() < 0) 1078d2fbde5SJustin T. Gibbs errx(1, "%s", devstat_errbuf); 1088d2fbde5SJustin T. Gibbs 1098d2fbde5SJustin T. Gibbs generation = 0; 1108d2fbde5SJustin T. Gibbs num_devices = 0; 1118d2fbde5SJustin T. Gibbs num_selected = 0; 1128d2fbde5SJustin T. Gibbs num_selections = 0; 1138d2fbde5SJustin T. Gibbs select_generation = 0; 1148d2fbde5SJustin T. Gibbs last_type = DS_MATCHTYPE_NONE; 1158d2fbde5SJustin T. Gibbs 1168d2fbde5SJustin T. Gibbs if (getdevs(s1) == -1) 1178d2fbde5SJustin T. Gibbs errx(1, "%s", devstat_errbuf); 1188d2fbde5SJustin T. Gibbs 1198d2fbde5SJustin T. Gibbs num_devices = s1->dinfo->numdevs; 1208d2fbde5SJustin T. Gibbs generation = s1->dinfo->generation; 1218d2fbde5SJustin T. Gibbs 1228d2fbde5SJustin T. Gibbs dev_select = NULL; 1238d2fbde5SJustin T. Gibbs 1248d2fbde5SJustin T. Gibbs /* 1258d2fbde5SJustin T. Gibbs * At this point, selectdevs will almost surely indicate that the 1268d2fbde5SJustin T. Gibbs * device list has changed, so we don't look for return values of 0 1278d2fbde5SJustin T. Gibbs * or 1. If we get back -1, though, there is an error. 1288d2fbde5SJustin T. Gibbs */ 1298d2fbde5SJustin T. Gibbs if (selectdevs(&dev_select, &num_selected, &num_selections, 1308d2fbde5SJustin T. Gibbs &select_generation, generation, s1->dinfo->devices, 1318d2fbde5SJustin T. Gibbs num_devices, NULL, 0, NULL, 0, DS_SELECT_ADD, 1328d2fbde5SJustin T. Gibbs maxshowdevs, 0) == -1) 1338d2fbde5SJustin T. Gibbs errx(1, "%s", devstat_errbuf); 1348d2fbde5SJustin T. Gibbs 1358d2fbde5SJustin T. Gibbs return(1); 1368d2fbde5SJustin T. Gibbs } 1378d2fbde5SJustin T. Gibbs 1388d2fbde5SJustin T. Gibbs int 1398d2fbde5SJustin T. Gibbs dscmd(char *cmd, char *args, int maxshowdevs, struct statinfo *s1) 1408d2fbde5SJustin T. Gibbs { 1418d2fbde5SJustin T. Gibbs int retval; 1428d2fbde5SJustin T. Gibbs 1438d2fbde5SJustin T. Gibbs if (prefix(cmd, "display") || prefix(cmd, "add")) 1448d2fbde5SJustin T. Gibbs return(dsselect(args, DS_SELECT_ADDONLY, maxshowdevs, s1)); 1458d2fbde5SJustin T. Gibbs if (prefix(cmd, "ignore") || prefix(cmd, "delete")) 1468d2fbde5SJustin T. Gibbs return(dsselect(args, DS_SELECT_REMOVE, maxshowdevs, s1)); 1478d2fbde5SJustin T. Gibbs if (prefix(cmd, "show") || prefix(cmd, "only")) 1488d2fbde5SJustin T. Gibbs return(dsselect(args, DS_SELECT_ONLY, maxshowdevs, s1)); 1498d2fbde5SJustin T. Gibbs if (prefix(cmd, "type") || prefix(cmd, "match")) 1508d2fbde5SJustin T. Gibbs return(dsmatchselect(args, DS_SELECT_ONLY, maxshowdevs, s1)); 1518d2fbde5SJustin T. Gibbs if (prefix(cmd, "refresh")) { 1528d2fbde5SJustin T. Gibbs retval = selectdevs(&dev_select, &num_selected, &num_selections, 1538d2fbde5SJustin T. Gibbs &select_generation, generation, 1548d2fbde5SJustin T. Gibbs s1->dinfo->devices, num_devices, 1558d2fbde5SJustin T. Gibbs (last_type == DS_MATCHTYPE_PATTERN) ? 1568d2fbde5SJustin T. Gibbs matches : NULL, 1578d2fbde5SJustin T. Gibbs (last_type == DS_MATCHTYPE_PATTERN) ? 1588d2fbde5SJustin T. Gibbs num_matches : 0, 1598d2fbde5SJustin T. Gibbs (last_type == DS_MATCHTYPE_SPEC) ? 1608d2fbde5SJustin T. Gibbs specified_devices : NULL, 1618d2fbde5SJustin T. Gibbs (last_type == DS_MATCHTYPE_SPEC) ? 1628d2fbde5SJustin T. Gibbs num_devices_specified : 0, 1638d2fbde5SJustin T. Gibbs (last_type == DS_MATCHTYPE_NONE) ? 1648d2fbde5SJustin T. Gibbs DS_SELECT_ADD : DS_SELECT_ADDONLY, 1658d2fbde5SJustin T. Gibbs maxshowdevs, 0); 1668d2fbde5SJustin T. Gibbs if (retval == -1) { 1678d2fbde5SJustin T. Gibbs warnx("%s", devstat_errbuf); 1688d2fbde5SJustin T. Gibbs return(0); 1698d2fbde5SJustin T. Gibbs } else if (retval == 1) 1708d2fbde5SJustin T. Gibbs return(2); 1718d2fbde5SJustin T. Gibbs } 1728d2fbde5SJustin T. Gibbs if (prefix(cmd, "drives")) { 1738d2fbde5SJustin T. Gibbs register int i; 1748d2fbde5SJustin T. Gibbs move(CMDLINE, 0); 1758d2fbde5SJustin T. Gibbs clrtoeol(); 1768d2fbde5SJustin T. Gibbs for (i = 0; i < num_devices; i++) { 1778d2fbde5SJustin T. Gibbs printw("%s%d ", s1->dinfo->devices[i].device_name, 1788d2fbde5SJustin T. Gibbs s1->dinfo->devices[i].unit_number); 1798d2fbde5SJustin T. Gibbs } 1808d2fbde5SJustin T. Gibbs return(1); 1818d2fbde5SJustin T. Gibbs } 1828d2fbde5SJustin T. Gibbs return(0); 1838d2fbde5SJustin T. Gibbs } 1848d2fbde5SJustin T. Gibbs 1858d2fbde5SJustin T. Gibbs static int 1868d2fbde5SJustin T. Gibbs dsmatchselect(char *args, devstat_select_mode select_mode, int maxshowdevs, 1878d2fbde5SJustin T. Gibbs struct statinfo *s1) 1888d2fbde5SJustin T. Gibbs { 1898d2fbde5SJustin T. Gibbs char **tempstr; 1908d2fbde5SJustin T. Gibbs char *tstr[100]; 1918d2fbde5SJustin T. Gibbs char *err_str; 1928d2fbde5SJustin T. Gibbs int num_args = 0; 1938d2fbde5SJustin T. Gibbs register int i; 1948d2fbde5SJustin T. Gibbs int retval = 0; 1958d2fbde5SJustin T. Gibbs 1968d2fbde5SJustin T. Gibbs /* 1978d2fbde5SJustin T. Gibbs * Break the (pipe delimited) input string out into separate 1988d2fbde5SJustin T. Gibbs * strings. 1998d2fbde5SJustin T. Gibbs */ 2008d2fbde5SJustin T. Gibbs for (tempstr = tstr, num_args = 0; 2018d2fbde5SJustin T. Gibbs (*tempstr = strsep(&args, "|")) != NULL && (num_args < 100); 2028d2fbde5SJustin T. Gibbs num_args++) 2038d2fbde5SJustin T. Gibbs if (**tempstr != '\0') 2048d2fbde5SJustin T. Gibbs if (++tempstr >= &tstr[100]) 2058d2fbde5SJustin T. Gibbs break; 2068d2fbde5SJustin T. Gibbs 2078d2fbde5SJustin T. Gibbs if (num_args > 99) { 2088d2fbde5SJustin T. Gibbs warnx("dsmatchselect: too many match arguments"); 2098d2fbde5SJustin T. Gibbs return(0); 2108d2fbde5SJustin T. Gibbs } 2118d2fbde5SJustin T. Gibbs 2128d2fbde5SJustin T. Gibbs /* 2138d2fbde5SJustin T. Gibbs * If we've gone through the matching code before, clean out 2148d2fbde5SJustin T. Gibbs * previously used memory. 2158d2fbde5SJustin T. Gibbs */ 2168d2fbde5SJustin T. Gibbs if (num_matches > 0) { 2178d2fbde5SJustin T. Gibbs free(matches); 2188d2fbde5SJustin T. Gibbs matches = NULL; 2198d2fbde5SJustin T. Gibbs num_matches = 0; 2208d2fbde5SJustin T. Gibbs } 2218d2fbde5SJustin T. Gibbs 2228d2fbde5SJustin T. Gibbs for (i = 0; i < num_args; i++) { 2238d2fbde5SJustin T. Gibbs if (buildmatch(tstr[i], &matches, &num_matches) != 0) { 2248d2fbde5SJustin T. Gibbs warnx("%s", devstat_errbuf); 2258d2fbde5SJustin T. Gibbs return(0); 2268d2fbde5SJustin T. Gibbs } 2278d2fbde5SJustin T. Gibbs } 2288d2fbde5SJustin T. Gibbs if (num_args > 0) { 2298d2fbde5SJustin T. Gibbs 2308d2fbde5SJustin T. Gibbs last_type = DS_MATCHTYPE_PATTERN; 2318d2fbde5SJustin T. Gibbs 2328d2fbde5SJustin T. Gibbs retval = selectdevs(&dev_select, &num_selected, &num_selections, 2338d2fbde5SJustin T. Gibbs &select_generation, generation, 2348d2fbde5SJustin T. Gibbs s1->dinfo->devices, num_devices, matches, 2358d2fbde5SJustin T. Gibbs num_matches, NULL, 0, select_mode, 2368d2fbde5SJustin T. Gibbs maxshowdevs, 0); 2378d2fbde5SJustin T. Gibbs if (retval == -1) 2388d2fbde5SJustin T. Gibbs err(1, "device selection error"); 2398d2fbde5SJustin T. Gibbs else if (retval == 1) 2408d2fbde5SJustin T. Gibbs return(2); 2418d2fbde5SJustin T. Gibbs } 2428d2fbde5SJustin T. Gibbs return(1); 2438d2fbde5SJustin T. Gibbs } 2448d2fbde5SJustin T. Gibbs 2458d2fbde5SJustin T. Gibbs static int 2468d2fbde5SJustin T. Gibbs dsselect(char *args, devstat_select_mode select_mode, int maxshowdevs, 2478d2fbde5SJustin T. Gibbs struct statinfo *s1) 2488d2fbde5SJustin T. Gibbs { 2498d2fbde5SJustin T. Gibbs register char *cp; 2508d2fbde5SJustin T. Gibbs register int i; 2518d2fbde5SJustin T. Gibbs int retval = 0; 2528d2fbde5SJustin T. Gibbs char *index(); 2538d2fbde5SJustin T. Gibbs 2548d2fbde5SJustin T. Gibbs /* 2558d2fbde5SJustin T. Gibbs * If we've gone through this code before, free previously 2568d2fbde5SJustin T. Gibbs * allocated resources. 2578d2fbde5SJustin T. Gibbs */ 2588d2fbde5SJustin T. Gibbs if (num_devices_specified > 0) { 2598d2fbde5SJustin T. Gibbs for (i = 0; i < num_devices_specified; i++) 2608d2fbde5SJustin T. Gibbs free(specified_devices[i]); 2618d2fbde5SJustin T. Gibbs free(specified_devices); 2628d2fbde5SJustin T. Gibbs specified_devices = NULL; 2638d2fbde5SJustin T. Gibbs num_devices_specified = 0; 2648d2fbde5SJustin T. Gibbs } 2658d2fbde5SJustin T. Gibbs 2668d2fbde5SJustin T. Gibbs /* do an initial malloc */ 2678d2fbde5SJustin T. Gibbs specified_devices = (char **)malloc(sizeof(char *)); 2688d2fbde5SJustin T. Gibbs 2698d2fbde5SJustin T. Gibbs cp = index(args, '\n'); 2708d2fbde5SJustin T. Gibbs if (cp) 2718d2fbde5SJustin T. Gibbs *cp = '\0'; 2728d2fbde5SJustin T. Gibbs for (;;) { 2738d2fbde5SJustin T. Gibbs for (cp = args; *cp && isspace(*cp); cp++) 2748d2fbde5SJustin T. Gibbs ; 2758d2fbde5SJustin T. Gibbs args = cp; 2768d2fbde5SJustin T. Gibbs for (; *cp && !isspace(*cp); cp++) 2778d2fbde5SJustin T. Gibbs ; 2788d2fbde5SJustin T. Gibbs if (*cp) 2798d2fbde5SJustin T. Gibbs *cp++ = '\0'; 2808d2fbde5SJustin T. Gibbs if (cp - args == 0) 2818d2fbde5SJustin T. Gibbs break; 2828d2fbde5SJustin T. Gibbs for (i = 0; i < num_devices; i++) { 2838d2fbde5SJustin T. Gibbs char tmpstr[80]; 2848d2fbde5SJustin T. Gibbs 2858d2fbde5SJustin T. Gibbs sprintf(tmpstr, "%s%d", dev_select[i].device_name, 2868d2fbde5SJustin T. Gibbs dev_select[i].unit_number); 2878d2fbde5SJustin T. Gibbs if (strcmp(args, tmpstr) == 0) { 2888d2fbde5SJustin T. Gibbs 2898d2fbde5SJustin T. Gibbs num_devices_specified++; 2908d2fbde5SJustin T. Gibbs 2918d2fbde5SJustin T. Gibbs specified_devices =(char **)realloc( 2928d2fbde5SJustin T. Gibbs specified_devices, 2938d2fbde5SJustin T. Gibbs sizeof(char *) * 2948d2fbde5SJustin T. Gibbs num_devices_specified); 2958d2fbde5SJustin T. Gibbs specified_devices[num_devices_specified -1]= 2968d2fbde5SJustin T. Gibbs strdup(args); 2978d2fbde5SJustin T. Gibbs 2988d2fbde5SJustin T. Gibbs break; 2998d2fbde5SJustin T. Gibbs } 3008d2fbde5SJustin T. Gibbs } 3018d2fbde5SJustin T. Gibbs if (i >= num_devices) 3028d2fbde5SJustin T. Gibbs error("%s: unknown drive", args); 3038d2fbde5SJustin T. Gibbs args = cp; 3048d2fbde5SJustin T. Gibbs } 3058d2fbde5SJustin T. Gibbs 3068d2fbde5SJustin T. Gibbs if (num_devices_specified > 0) { 3078d2fbde5SJustin T. Gibbs last_type = DS_MATCHTYPE_SPEC; 3088d2fbde5SJustin T. Gibbs 3098d2fbde5SJustin T. Gibbs retval = selectdevs(&dev_select, &num_selected, &num_selections, 3108d2fbde5SJustin T. Gibbs &select_generation, generation, 3118d2fbde5SJustin T. Gibbs s1->dinfo->devices, num_devices, NULL, 0, 3128d2fbde5SJustin T. Gibbs specified_devices, num_devices_specified, 3138d2fbde5SJustin T. Gibbs select_mode, maxshowdevs, 0); 3148d2fbde5SJustin T. Gibbs if (retval == -1) 3158d2fbde5SJustin T. Gibbs err(1, "%s", devstat_errbuf); 3168d2fbde5SJustin T. Gibbs else if (retval == 1) 3178d2fbde5SJustin T. Gibbs return(2); 3188d2fbde5SJustin T. Gibbs } 3198d2fbde5SJustin T. Gibbs return(1); 3208d2fbde5SJustin T. Gibbs } 321