1
2 /*
3 * show.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 <err.h>
41 #include <netgraph.h>
42 #include <stdio.h>
43 #include <stdlib.h>
44 #include <unistd.h>
45
46 #include "ngctl.h"
47
48 #define FMT " %-15s %-15s %-12s %-15s %-15s\n"
49 #define UNNAMED "<unnamed>"
50 #define NOSTATUS "<no status>"
51
52 static int ShowCmd(int ac, char **av);
53
54 const struct ngcmd show_cmd = {
55 ShowCmd,
56 "show [-n] <path>",
57 "Show information about the node at <path>",
58 "If the -n flag is given, hooks are not listed.",
59 { "inquire", "info" }
60 };
61
62 static int
ShowCmd(int ac,char ** av)63 ShowCmd(int ac, char **av)
64 {
65 char *path;
66 struct ng_mesg *resp;
67 struct hooklist *hlist;
68 struct nodeinfo *ninfo;
69 int ch, no_hooks = 0;
70
71 /* Get options */
72 optind = 1;
73 while ((ch = getopt(ac, av, "n")) != -1) {
74 switch (ch) {
75 case 'n':
76 no_hooks = 1;
77 break;
78 case '?':
79 default:
80 return (CMDRTN_USAGE);
81 break;
82 }
83 }
84 ac -= optind;
85 av += optind;
86
87 /* Get arguments */
88 switch (ac) {
89 case 1:
90 path = av[0];
91 break;
92 default:
93 return (CMDRTN_USAGE);
94 }
95
96 /* Get node info and hook list */
97 if (NgSendMsg(csock, path, NGM_GENERIC_COOKIE,
98 NGM_LISTHOOKS, NULL, 0) < 0) {
99 warn("send msg");
100 return (CMDRTN_ERROR);
101 }
102 if (NgAllocRecvMsg(csock, &resp, NULL) < 0) {
103 warn("recv msg");
104 return (CMDRTN_ERROR);
105 }
106
107 /* Show node information */
108 hlist = (struct hooklist *) resp->data;
109 ninfo = &hlist->nodeinfo;
110 if (!*ninfo->name)
111 snprintf(ninfo->name, sizeof(ninfo->name), "%s", UNNAMED);
112 printf(" Name: %-15s Type: %-15s ID: %08x Num hooks: %d\n",
113 ninfo->name, ninfo->type, ninfo->id, ninfo->hooks);
114 if (!no_hooks && ninfo->hooks > 0) {
115 u_int k;
116
117 printf(FMT, "Local hook", "Peer name",
118 "Peer type", "Peer ID", "Peer hook");
119 printf(FMT, "----------", "---------",
120 "---------", "-------", "---------");
121 for (k = 0; k < ninfo->hooks; k++) {
122 struct linkinfo *const link = &hlist->link[k];
123 struct nodeinfo *const peer = &hlist->link[k].nodeinfo;
124 char idbuf[20];
125
126 if (!*peer->name) {
127 snprintf(peer->name, sizeof(peer->name),
128 "%s", UNNAMED);
129 }
130 snprintf(idbuf, sizeof(idbuf), "%08x", peer->id);
131 printf(FMT, link->ourhook, peer->name,
132 peer->type, idbuf, link->peerhook);
133 }
134 }
135 free(resp);
136 return (CMDRTN_OK);
137 }
138
139
140