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 *
| 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: head/usr.sbin/ngctl/list.c 122556 2003-11-12 13:04:44Z harti $
| 37 * $FreeBSD: head/usr.sbin/ngctl/list.c 125011 2004-01-26 10:27:18Z ru $
|
38 */
39
40#include "ngctl.h"
41
42static int ListCmd(int ac, char **av);
43
44const 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 { "ls" }
52};
53
54static int
55ListCmd(int ac, char **av)
56{
57 u_char rbuf[16 * 1024];
58 struct ng_mesg *const resp = (struct ng_mesg *) rbuf;
59 struct namelist *const nlist = (struct namelist *) resp->data;
60 int named_only = 0;
| 38 */
39
40#include "ngctl.h"
41
42static int ListCmd(int ac, char **av);
43
44const 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 { "ls" }
52};
53
54static int
55ListCmd(int ac, char **av)
56{
57 u_char rbuf[16 * 1024];
58 struct ng_mesg *const resp = (struct ng_mesg *) rbuf;
59 struct namelist *const nlist = (struct namelist *) resp->data;
60 int named_only = 0;
|
61 int k, ch, rtn = CMDRTN_OK;
| 61 int ch, rtn = CMDRTN_OK;
62 u_int k;
|
62
63 /* Get options */
64 optind = 1;
65 while ((ch = getopt(ac, av, "n")) != EOF) {
66 switch (ch) {
67 case 'n':
68 named_only = 1;
69 break;
70 case '?':
71 default:
72 return(CMDRTN_USAGE);
73 break;
74 }
75 }
76 ac -= optind;
77 av += optind;
78
79 /* Get arguments */
80 switch (ac) {
81 case 0:
82 break;
83 default:
84 return(CMDRTN_USAGE);
85 }
86
87 /* Get list of nodes */
88 if (NgSendMsg(csock, ".", NGM_GENERIC_COOKIE,
89 named_only ? NGM_LISTNAMES : NGM_LISTNODES, NULL, 0) < 0) {
90 warn("send msg");
91 return(CMDRTN_ERROR);
92 }
93 if (NgRecvMsg(csock, resp, sizeof(rbuf), NULL) < 0) {
94 warn("recv msg");
95 return(CMDRTN_ERROR);
96 }
97
98 /* Show each node */
99 printf("There are %d total %snodes:\n",
100 nlist->numnames, named_only ? "named " : "");
101 for (k = 0; k < nlist->numnames; k++) {
102 char path[NG_PATHSIZ];
| 63
64 /* Get options */
65 optind = 1;
66 while ((ch = getopt(ac, av, "n")) != EOF) {
67 switch (ch) {
68 case 'n':
69 named_only = 1;
70 break;
71 case '?':
72 default:
73 return(CMDRTN_USAGE);
74 break;
75 }
76 }
77 ac -= optind;
78 av += optind;
79
80 /* Get arguments */
81 switch (ac) {
82 case 0:
83 break;
84 default:
85 return(CMDRTN_USAGE);
86 }
87
88 /* Get list of nodes */
89 if (NgSendMsg(csock, ".", NGM_GENERIC_COOKIE,
90 named_only ? NGM_LISTNAMES : NGM_LISTNODES, NULL, 0) < 0) {
91 warn("send msg");
92 return(CMDRTN_ERROR);
93 }
94 if (NgRecvMsg(csock, resp, sizeof(rbuf), NULL) < 0) {
95 warn("recv msg");
96 return(CMDRTN_ERROR);
97 }
98
99 /* Show each node */
100 printf("There are %d total %snodes:\n",
101 nlist->numnames, named_only ? "named " : "");
102 for (k = 0; k < nlist->numnames; k++) {
103 char path[NG_PATHSIZ];
|
103 char *av[3] = { "list", "-n", path };
| 104 char *argv[3] = { "list", "-n", path };
|
104
105 snprintf(path, sizeof(path),
106 "[%lx]:", (u_long) nlist->nodeinfo[k].id);
| 105
106 snprintf(path, sizeof(path),
107 "[%lx]:", (u_long) nlist->nodeinfo[k].id);
|
107 if ((rtn = (*show_cmd.func)(3, av)) != CMDRTN_OK)
| 108 if ((rtn = (*show_cmd.func)(3, argv)) != CMDRTN_OK)
|
108 break;
109 }
110
111 /* Done */
112 return (rtn);
113}
114
| 109 break;
110 }
111
112 /* Done */
113 return (rtn);
114}
115
|