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