1 2 /* 3 * list.c 4 * 5 * Copyright (c) 1996-1999 Whistle Communications, Inc. 6 * All rights reserved. 7 * 8 * Subject to the following obligations and disclaimer of warranty, use and 9 * redistribution of this software, in source or object code forms, with or 10 * without modifications are expressly permitted by Whistle Communications; 11 * provided, however, that: 12 * 1. Any and all reproductions of the source or object code must include the 13 * copyright notice above and the following disclaimer of warranties; and 14 * 2. No rights are granted, in any manner or form, to use Whistle 15 * Communications, Inc. trademarks, including the mark "WHISTLE 16 * COMMUNICATIONS" on advertising, endorsements, or otherwise except as 17 * such appears in the above copyright notice or in the software. 18 * 19 * THIS SOFTWARE IS BEING PROVIDED BY WHISTLE COMMUNICATIONS "AS IS", AND 20 * TO THE MAXIMUM EXTENT PERMITTED BY LAW, WHISTLE COMMUNICATIONS MAKES NO 21 * REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, REGARDING THIS SOFTWARE, 22 * INCLUDING WITHOUT LIMITATION, ANY AND ALL IMPLIED WARRANTIES OF 23 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT. 24 * WHISTLE COMMUNICATIONS DOES NOT WARRANT, GUARANTEE, OR MAKE ANY 25 * REPRESENTATIONS REGARDING THE USE OF, OR THE RESULTS OF THE USE OF THIS 26 * SOFTWARE IN TERMS OF ITS CORRECTNESS, ACCURACY, RELIABILITY OR OTHERWISE. 27 * IN NO EVENT SHALL WHISTLE COMMUNICATIONS BE LIABLE FOR ANY DAMAGES 28 * RESULTING FROM OR ARISING OUT OF ANY USE OF THIS SOFTWARE, INCLUDING 29 * WITHOUT LIMITATION, ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, 30 * PUNITIVE, OR CONSEQUENTIAL DAMAGES, PROCUREMENT OF SUBSTITUTE GOODS OR 31 * SERVICES, LOSS OF USE, DATA OR PROFITS, HOWEVER CAUSED AND UNDER ANY 32 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 33 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 34 * THIS SOFTWARE, EVEN IF WHISTLE COMMUNICATIONS IS ADVISED OF THE POSSIBILITY 35 * OF SUCH DAMAGE. 36 * 37 * $FreeBSD$ 38 */ 39 40 #include "ngctl.h" 41 42 static int ListCmd(int ac, char **av); 43 44 const struct ngcmd list_cmd = { 45 ListCmd, 46 "list [-n]", 47 "Show information about all nodes", 48 "The list command shows information every node that currently" 49 " exists in the netgraph system. The optional -n argument limits" 50 " this list to only those nodes with a global name assignment." 51 }; 52 53 static int 54 ListCmd(int ac, char **av) 55 { 56 u_char rbuf[16 * 1024]; 57 struct ng_mesg *const resp = (struct ng_mesg *) rbuf; 58 struct namelist *const nlist = (struct namelist *) resp->data; 59 int named_only = 0; 60 int k, ch, rtn = CMDRTN_OK; 61 62 /* Get options */ 63 optind = 1; 64 while ((ch = getopt(ac, av, "n")) != EOF) { 65 switch (ch) { 66 case 'n': 67 named_only = 1; 68 break; 69 case '?': 70 default: 71 return(CMDRTN_USAGE); 72 break; 73 } 74 } 75 ac -= optind; 76 av += optind; 77 78 /* Get arguments */ 79 switch (ac) { 80 case 0: 81 break; 82 default: 83 return(CMDRTN_USAGE); 84 } 85 86 /* Get list of nodes */ 87 if (NgSendMsg(csock, ".", NGM_GENERIC_COOKIE, 88 named_only ? NGM_LISTNAMES : NGM_LISTNODES, NULL, 0) < 0) { 89 warn("send msg"); 90 return(CMDRTN_ERROR); 91 } 92 if (NgRecvMsg(csock, resp, sizeof(rbuf), NULL) < 0) { 93 warn("recv msg"); 94 return(CMDRTN_ERROR); 95 } 96 97 /* Show each node */ 98 printf("There are %d total %snodes:\n", 99 nlist->numnames, named_only ? "named " : ""); 100 for (k = 0; k < nlist->numnames; k++) { 101 char path[NG_PATHLEN+1]; 102 char *av[3] = { "list", "-n", path }; 103 104 snprintf(path, sizeof(path), 105 "[%lx]:", (u_long) nlist->nodeinfo[k].id); 106 if ((rtn = (*show_cmd.func)(3, av)) != CMDRTN_OK) 107 break; 108 } 109 110 /* Done */ 111 return (rtn); 112 } 113 114