1*8a16b7a1SPedro F. Giffuni /*- 2*8a16b7a1SPedro F. Giffuni * SPDX-License-Identifier: BSD-3-Clause 3*8a16b7a1SPedro F. Giffuni * 48d2fbde5SJustin T. Gibbs * Copyright (c) 1998 Kenneth D. Merry. 58d2fbde5SJustin T. Gibbs * All rights reserved. 68d2fbde5SJustin T. Gibbs * 78d2fbde5SJustin T. Gibbs * Redistribution and use in source and binary forms, with or without 88d2fbde5SJustin T. Gibbs * modification, are permitted provided that the following conditions 98d2fbde5SJustin T. Gibbs * are met: 108d2fbde5SJustin T. Gibbs * 1. Redistributions of source code must retain the above copyright 118d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer. 128d2fbde5SJustin T. Gibbs * 2. Redistributions in binary form must reproduce the above copyright 138d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer in the 148d2fbde5SJustin T. Gibbs * documentation and/or other materials provided with the distribution. 158d2fbde5SJustin T. Gibbs * 3. The name of the author may not be used to endorse or promote products 168d2fbde5SJustin T. Gibbs * derived from this software without specific prior written permission. 178d2fbde5SJustin T. Gibbs * 188d2fbde5SJustin T. Gibbs * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 198d2fbde5SJustin T. Gibbs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 208d2fbde5SJustin T. Gibbs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 218d2fbde5SJustin T. Gibbs * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 228d2fbde5SJustin T. Gibbs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 238d2fbde5SJustin T. Gibbs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 248d2fbde5SJustin T. Gibbs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 258d2fbde5SJustin T. Gibbs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 268d2fbde5SJustin T. Gibbs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 278d2fbde5SJustin T. Gibbs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 288d2fbde5SJustin T. Gibbs * SUCH DAMAGE. 298d2fbde5SJustin T. Gibbs */ 308d2fbde5SJustin T. Gibbs /*- 318d2fbde5SJustin T. Gibbs * Copyright (c) 1980, 1992, 1993 328d2fbde5SJustin T. Gibbs * The Regents of the University of California. All rights reserved. 338d2fbde5SJustin T. Gibbs * 348d2fbde5SJustin T. Gibbs * Redistribution and use in source and binary forms, with or without 358d2fbde5SJustin T. Gibbs * modification, are permitted provided that the following conditions 368d2fbde5SJustin T. Gibbs * are met: 378d2fbde5SJustin T. Gibbs * 1. Redistributions of source code must retain the above copyright 388d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer. 398d2fbde5SJustin T. Gibbs * 2. Redistributions in binary form must reproduce the above copyright 408d2fbde5SJustin T. Gibbs * notice, this list of conditions and the following disclaimer in the 418d2fbde5SJustin T. Gibbs * documentation and/or other materials provided with the distribution. 42fbbd9655SWarner Losh * 3. Neither the name of the University nor the names of its contributors 438d2fbde5SJustin T. Gibbs * may be used to endorse or promote products derived from this software 448d2fbde5SJustin T. Gibbs * without specific prior written permission. 458d2fbde5SJustin T. Gibbs * 468d2fbde5SJustin T. Gibbs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 478d2fbde5SJustin T. Gibbs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 488d2fbde5SJustin T. Gibbs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 498d2fbde5SJustin T. Gibbs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 508d2fbde5SJustin T. Gibbs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 518d2fbde5SJustin T. Gibbs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 528d2fbde5SJustin T. Gibbs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 538d2fbde5SJustin T. Gibbs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 548d2fbde5SJustin T. Gibbs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 558d2fbde5SJustin T. Gibbs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 568d2fbde5SJustin T. Gibbs * SUCH DAMAGE. 578d2fbde5SJustin T. Gibbs */ 588d2fbde5SJustin T. Gibbs 599ff712b0SMark Murray #include <sys/cdefs.h> 609ff712b0SMark Murray 619ff712b0SMark Murray __FBSDID("$FreeBSD$"); 629ff712b0SMark Murray 639ff712b0SMark Murray #ifdef lint 649ff712b0SMark Murray static const char sccsid[] = "@(#)disks.c 8.1 (Berkeley) 6/6/93"; 659ff712b0SMark Murray #endif 669ff712b0SMark Murray 678d2fbde5SJustin T. Gibbs #include <sys/types.h> 688d2fbde5SJustin T. Gibbs #include <sys/devicestat.h> 693bd41074SPoul-Henning Kamp #include <sys/resource.h> 708d2fbde5SJustin T. Gibbs 71d22889b8SDavid E. O'Brien #include <ctype.h> 729ff712b0SMark Murray #include <devstat.h> 73d22889b8SDavid E. O'Brien #include <err.h> 749ff712b0SMark Murray #include <stdlib.h> 759ff712b0SMark Murray #include <string.h> 769ff712b0SMark Murray 778d2fbde5SJustin T. Gibbs #include "systat.h" 788d2fbde5SJustin T. Gibbs #include "extern.h" 79d22889b8SDavid E. O'Brien #include "devs.h" 808d2fbde5SJustin T. Gibbs 818d2fbde5SJustin T. Gibbs typedef enum { 828d2fbde5SJustin T. Gibbs DS_MATCHTYPE_NONE, 838d2fbde5SJustin T. Gibbs DS_MATCHTYPE_SPEC, 848d2fbde5SJustin T. Gibbs DS_MATCHTYPE_PATTERN 858d2fbde5SJustin T. Gibbs } last_match_type; 868d2fbde5SJustin T. Gibbs 878d2fbde5SJustin T. Gibbs last_match_type last_type; 888d2fbde5SJustin T. Gibbs struct device_selection *dev_select; 89bcc6a3daSKenneth D. Merry long generation; 90bcc6a3daSKenneth D. Merry int num_devices, num_selected; 91bcc6a3daSKenneth D. Merry int num_selections; 92bcc6a3daSKenneth D. Merry long select_generation; 938d2fbde5SJustin T. Gibbs struct devstat_match *matches = NULL; 948d2fbde5SJustin T. Gibbs int num_matches = 0; 958d2fbde5SJustin T. Gibbs char **specified_devices; 968d2fbde5SJustin T. Gibbs int num_devices_specified = 0; 978d2fbde5SJustin T. Gibbs 989ff712b0SMark Murray static int dsmatchselect(const char *args, devstat_select_mode select_mode, 998d2fbde5SJustin T. Gibbs int maxshowdevs, struct statinfo *s1); 1009ff712b0SMark Murray static int dsselect(const char *args, devstat_select_mode select_mode, 1018d2fbde5SJustin T. Gibbs int maxshowdevs, struct statinfo *s1); 1028d2fbde5SJustin T. Gibbs 1038d2fbde5SJustin T. Gibbs int 1049ff712b0SMark Murray dsinit(int maxshowdevs, struct statinfo *s1, struct statinfo *s2 __unused, 1059ff712b0SMark Murray struct statinfo *s3 __unused) 1068d2fbde5SJustin T. Gibbs { 1078d2fbde5SJustin T. Gibbs 1088d2fbde5SJustin T. Gibbs /* 1098d2fbde5SJustin T. Gibbs * Make sure that the userland devstat version matches the kernel 1108d2fbde5SJustin T. Gibbs * devstat version. If not, exit and print a message informing 1118d2fbde5SJustin T. Gibbs * the user of his mistake. 1128d2fbde5SJustin T. Gibbs */ 1138f29de8bSKenneth D. Merry if (devstat_checkversion(NULL) < 0) 1148d2fbde5SJustin T. Gibbs errx(1, "%s", devstat_errbuf); 1158d2fbde5SJustin T. Gibbs 1168d2fbde5SJustin T. Gibbs generation = 0; 1178d2fbde5SJustin T. Gibbs num_devices = 0; 1188d2fbde5SJustin T. Gibbs num_selected = 0; 1198d2fbde5SJustin T. Gibbs num_selections = 0; 1208d2fbde5SJustin T. Gibbs select_generation = 0; 1218d2fbde5SJustin T. Gibbs last_type = DS_MATCHTYPE_NONE; 1228d2fbde5SJustin T. Gibbs 1238f29de8bSKenneth D. Merry if (devstat_getdevs(NULL, s1) == -1) 1248d2fbde5SJustin T. Gibbs errx(1, "%s", devstat_errbuf); 1258d2fbde5SJustin T. Gibbs 1268d2fbde5SJustin T. Gibbs num_devices = s1->dinfo->numdevs; 1278d2fbde5SJustin T. Gibbs generation = s1->dinfo->generation; 1288d2fbde5SJustin T. Gibbs 1298d2fbde5SJustin T. Gibbs dev_select = NULL; 1308d2fbde5SJustin T. Gibbs 1318d2fbde5SJustin T. Gibbs /* 1328d2fbde5SJustin T. Gibbs * At this point, selectdevs will almost surely indicate that the 1338d2fbde5SJustin T. Gibbs * device list has changed, so we don't look for return values of 0 1348d2fbde5SJustin T. Gibbs * or 1. If we get back -1, though, there is an error. 1358d2fbde5SJustin T. Gibbs */ 1368f29de8bSKenneth D. Merry if (devstat_selectdevs(&dev_select, &num_selected, &num_selections, 1378f29de8bSKenneth D. Merry &select_generation, generation, s1->dinfo->devices, num_devices, 1388f29de8bSKenneth D. Merry NULL, 0, NULL, 0, DS_SELECT_ADD, maxshowdevs, 0) == -1) 139f46a0535SPoul-Henning Kamp errx(1, "%d %s", __LINE__, devstat_errbuf); 1408d2fbde5SJustin T. Gibbs 1418d2fbde5SJustin T. Gibbs return(1); 1428d2fbde5SJustin T. Gibbs } 1438d2fbde5SJustin T. Gibbs 1448d2fbde5SJustin T. Gibbs int 1459ff712b0SMark Murray dscmd(const char *cmd, const char *args, int maxshowdevs, struct statinfo *s1) 1468d2fbde5SJustin T. Gibbs { 1478d2fbde5SJustin T. Gibbs int retval; 1488d2fbde5SJustin T. Gibbs 1498d2fbde5SJustin T. Gibbs if (prefix(cmd, "display") || prefix(cmd, "add")) 1508d2fbde5SJustin T. Gibbs return(dsselect(args, DS_SELECT_ADDONLY, maxshowdevs, s1)); 1518d2fbde5SJustin T. Gibbs if (prefix(cmd, "ignore") || prefix(cmd, "delete")) 1528d2fbde5SJustin T. Gibbs return(dsselect(args, DS_SELECT_REMOVE, maxshowdevs, s1)); 1538d2fbde5SJustin T. Gibbs if (prefix(cmd, "show") || prefix(cmd, "only")) 1548d2fbde5SJustin T. Gibbs return(dsselect(args, DS_SELECT_ONLY, maxshowdevs, s1)); 1558d2fbde5SJustin T. Gibbs if (prefix(cmd, "type") || prefix(cmd, "match")) 1568d2fbde5SJustin T. Gibbs return(dsmatchselect(args, DS_SELECT_ONLY, maxshowdevs, s1)); 1578d2fbde5SJustin T. Gibbs if (prefix(cmd, "refresh")) { 1588f29de8bSKenneth D. Merry retval = devstat_selectdevs(&dev_select, &num_selected, 1598f29de8bSKenneth D. Merry &num_selections, &select_generation, generation, 1608d2fbde5SJustin T. Gibbs s1->dinfo->devices, num_devices, 1618f29de8bSKenneth D. Merry (last_type ==DS_MATCHTYPE_PATTERN) ? matches : NULL, 1628f29de8bSKenneth D. Merry (last_type ==DS_MATCHTYPE_PATTERN) ? num_matches : 0, 1638f29de8bSKenneth D. Merry (last_type == DS_MATCHTYPE_SPEC) ?specified_devices : NULL, 1648f29de8bSKenneth D. Merry (last_type == DS_MATCHTYPE_SPEC) ?num_devices_specified : 0, 1658f29de8bSKenneth D. Merry (last_type == DS_MATCHTYPE_NONE) ? DS_SELECT_ADD : 1668f29de8bSKenneth D. Merry DS_SELECT_ADDONLY, maxshowdevs, 0); 1678d2fbde5SJustin T. Gibbs if (retval == -1) { 1688d2fbde5SJustin T. Gibbs warnx("%s", devstat_errbuf); 1698d2fbde5SJustin T. Gibbs return(0); 1708d2fbde5SJustin T. Gibbs } else if (retval == 1) 1718d2fbde5SJustin T. Gibbs return(2); 1728d2fbde5SJustin T. Gibbs } 1738d2fbde5SJustin T. Gibbs if (prefix(cmd, "drives")) { 17493b9f504SXin LI int i; 1758d2fbde5SJustin T. Gibbs move(CMDLINE, 0); 1768d2fbde5SJustin T. Gibbs clrtoeol(); 1778d2fbde5SJustin T. Gibbs for (i = 0; i < num_devices; i++) { 1788d2fbde5SJustin T. Gibbs printw("%s%d ", s1->dinfo->devices[i].device_name, 1798d2fbde5SJustin T. Gibbs s1->dinfo->devices[i].unit_number); 1808d2fbde5SJustin T. Gibbs } 1818d2fbde5SJustin T. Gibbs return(1); 1828d2fbde5SJustin T. Gibbs } 1838d2fbde5SJustin T. Gibbs return(0); 1848d2fbde5SJustin T. Gibbs } 1858d2fbde5SJustin T. Gibbs 1868d2fbde5SJustin T. Gibbs static int 1879ff712b0SMark Murray dsmatchselect(const char *args, devstat_select_mode select_mode, int maxshowdevs, 1888d2fbde5SJustin T. Gibbs struct statinfo *s1) 1898d2fbde5SJustin T. Gibbs { 1909ff712b0SMark Murray char **tempstr, *tmpstr, *tmpstr1; 1918d2fbde5SJustin T. Gibbs char *tstr[100]; 1928d2fbde5SJustin T. Gibbs int num_args = 0; 1939ff712b0SMark Murray 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 */ 2009ff712b0SMark Murray tmpstr = tmpstr1 = strdup(args); 2018d2fbde5SJustin T. Gibbs for (tempstr = tstr, num_args = 0; 2029ff712b0SMark Murray (*tempstr = strsep(&tmpstr1, "|")) != NULL && (num_args < 100); 2038d2fbde5SJustin T. Gibbs num_args++) 2048d2fbde5SJustin T. Gibbs if (**tempstr != '\0') 2058d2fbde5SJustin T. Gibbs if (++tempstr >= &tstr[100]) 2068d2fbde5SJustin T. Gibbs break; 2079ff712b0SMark Murray free(tmpstr); 2088d2fbde5SJustin T. Gibbs 2098d2fbde5SJustin T. Gibbs if (num_args > 99) { 2108d2fbde5SJustin T. Gibbs warnx("dsmatchselect: too many match arguments"); 2118d2fbde5SJustin T. Gibbs return(0); 2128d2fbde5SJustin T. Gibbs } 2138d2fbde5SJustin T. Gibbs 2148d2fbde5SJustin T. Gibbs /* 2158d2fbde5SJustin T. Gibbs * If we've gone through the matching code before, clean out 2168d2fbde5SJustin T. Gibbs * previously used memory. 2178d2fbde5SJustin T. Gibbs */ 2188d2fbde5SJustin T. Gibbs if (num_matches > 0) { 2198d2fbde5SJustin T. Gibbs free(matches); 2208d2fbde5SJustin T. Gibbs matches = NULL; 2218d2fbde5SJustin T. Gibbs num_matches = 0; 2228d2fbde5SJustin T. Gibbs } 2238d2fbde5SJustin T. Gibbs 2248d2fbde5SJustin T. Gibbs for (i = 0; i < num_args; i++) { 2258f29de8bSKenneth D. Merry if (devstat_buildmatch(tstr[i], &matches, &num_matches) != 0) { 2268d2fbde5SJustin T. Gibbs warnx("%s", devstat_errbuf); 2278d2fbde5SJustin T. Gibbs return(0); 2288d2fbde5SJustin T. Gibbs } 2298d2fbde5SJustin T. Gibbs } 2308d2fbde5SJustin T. Gibbs if (num_args > 0) { 2318d2fbde5SJustin T. Gibbs 2328d2fbde5SJustin T. Gibbs last_type = DS_MATCHTYPE_PATTERN; 2338d2fbde5SJustin T. Gibbs 2348f29de8bSKenneth D. Merry retval = devstat_selectdevs(&dev_select, &num_selected, 2358f29de8bSKenneth D. Merry &num_selections, &select_generation, generation, 2368f29de8bSKenneth D. Merry s1->dinfo->devices, num_devices, matches, num_matches, 2378f29de8bSKenneth D. Merry NULL, 0, select_mode, maxshowdevs, 0); 2388d2fbde5SJustin T. Gibbs if (retval == -1) 2398d2fbde5SJustin T. Gibbs err(1, "device selection error"); 2408d2fbde5SJustin T. Gibbs else if (retval == 1) 2418d2fbde5SJustin T. Gibbs return(2); 2428d2fbde5SJustin T. Gibbs } 2438d2fbde5SJustin T. Gibbs return(1); 2448d2fbde5SJustin T. Gibbs } 2458d2fbde5SJustin T. Gibbs 2468d2fbde5SJustin T. Gibbs static int 2479ff712b0SMark Murray dsselect(const char *args, devstat_select_mode select_mode, int maxshowdevs, 2488d2fbde5SJustin T. Gibbs struct statinfo *s1) 2498d2fbde5SJustin T. Gibbs { 2509ff712b0SMark Murray char *cp, *tmpstr, *tmpstr1, *buffer; 2519ff712b0SMark Murray int i; 2528d2fbde5SJustin T. Gibbs int retval = 0; 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 2699ff712b0SMark Murray tmpstr = tmpstr1 = strdup(args); 270b3608ae1SEd Schouten cp = strchr(tmpstr1, '\n'); 2718d2fbde5SJustin T. Gibbs if (cp) 2728d2fbde5SJustin T. Gibbs *cp = '\0'; 2738d2fbde5SJustin T. Gibbs for (;;) { 2749ff712b0SMark Murray for (cp = tmpstr1; *cp && isspace(*cp); cp++) 2758d2fbde5SJustin T. Gibbs ; 2769ff712b0SMark Murray tmpstr1 = cp; 2778d2fbde5SJustin T. Gibbs for (; *cp && !isspace(*cp); cp++) 2788d2fbde5SJustin T. Gibbs ; 2798d2fbde5SJustin T. Gibbs if (*cp) 2808d2fbde5SJustin T. Gibbs *cp++ = '\0'; 2818d2fbde5SJustin T. Gibbs if (cp - args == 0) 2828d2fbde5SJustin T. Gibbs break; 2838d2fbde5SJustin T. Gibbs for (i = 0; i < num_devices; i++) { 2849ff712b0SMark Murray asprintf(&buffer, "%s%d", dev_select[i].device_name, 2858d2fbde5SJustin T. Gibbs dev_select[i].unit_number); 2869ff712b0SMark Murray if (strcmp(buffer, tmpstr1) == 0) { 2878d2fbde5SJustin T. Gibbs 2888d2fbde5SJustin T. Gibbs num_devices_specified++; 2898d2fbde5SJustin T. Gibbs 2908d2fbde5SJustin T. Gibbs specified_devices =(char **)realloc( 2918d2fbde5SJustin T. Gibbs specified_devices, 2928d2fbde5SJustin T. Gibbs sizeof(char *) * 2938d2fbde5SJustin T. Gibbs num_devices_specified); 2948d2fbde5SJustin T. Gibbs specified_devices[num_devices_specified -1]= 2959ff712b0SMark Murray strdup(tmpstr1); 2969ff712b0SMark Murray free(buffer); 2978d2fbde5SJustin T. Gibbs 2988d2fbde5SJustin T. Gibbs break; 2998d2fbde5SJustin T. Gibbs } 3009ff712b0SMark Murray else 3019ff712b0SMark Murray free(buffer); 3028d2fbde5SJustin T. Gibbs } 3038d2fbde5SJustin T. Gibbs if (i >= num_devices) 3048d2fbde5SJustin T. Gibbs error("%s: unknown drive", args); 3058d2fbde5SJustin T. Gibbs args = cp; 3068d2fbde5SJustin T. Gibbs } 3079ff712b0SMark Murray free(tmpstr); 3088d2fbde5SJustin T. Gibbs 3098d2fbde5SJustin T. Gibbs if (num_devices_specified > 0) { 3108d2fbde5SJustin T. Gibbs last_type = DS_MATCHTYPE_SPEC; 3118d2fbde5SJustin T. Gibbs 3128f29de8bSKenneth D. Merry retval = devstat_selectdevs(&dev_select, &num_selected, 3138f29de8bSKenneth D. Merry &num_selections, &select_generation, generation, 3148d2fbde5SJustin T. Gibbs s1->dinfo->devices, num_devices, NULL, 0, 3158d2fbde5SJustin T. Gibbs specified_devices, num_devices_specified, 3168d2fbde5SJustin T. Gibbs select_mode, maxshowdevs, 0); 3178d2fbde5SJustin T. Gibbs if (retval == -1) 3188d2fbde5SJustin T. Gibbs err(1, "%s", devstat_errbuf); 3198d2fbde5SJustin T. Gibbs else if (retval == 1) 3208d2fbde5SJustin T. Gibbs return(2); 3218d2fbde5SJustin T. Gibbs } 3228d2fbde5SJustin T. Gibbs return(1); 3238d2fbde5SJustin T. Gibbs } 324