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
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 UNNAMED		"<unnamed>"
47
48static int ListCmd(int ac, char **av);
49
50const struct ngcmd list_cmd = {
51	ListCmd,
52	"list [-ln]",
53	"Show information about all nodes",
54	"The list command shows information about every node that currently"
55	" exists in the netgraph system. The optional -n argument limits"
56	" this list to only those nodes with a global name assignment."
57	" The optional -l argument provides verbose output that includes"
58	" hook information as well.",
59	{ "ls" }
60};
61
62static int
63ListCmd(int ac, char **av)
64{
65	struct ng_mesg *resp;
66	struct namelist *nlist;
67	struct nodeinfo *ninfo;
68	int list_hooks = 0;
69	int named_only = 0;
70	int ch, rtn = CMDRTN_OK;
71
72	/* Get options */
73	optind = 1;
74	while ((ch = getopt(ac, av, "ln")) != -1) {
75		switch (ch) {
76		case 'l':
77			list_hooks = 1;
78			break;
79		case 'n':
80			named_only = 1;
81			break;
82		case '?':
83		default:
84			return (CMDRTN_USAGE);
85			break;
86		}
87	}
88	ac -= optind;
89	av += optind;
90
91	/* Get arguments */
92	switch (ac) {
93	case 0:
94		break;
95	default:
96		return (CMDRTN_USAGE);
97	}
98
99	/* Get list of nodes */
100	if (NgSendMsg(csock, ".", NGM_GENERIC_COOKIE,
101	    named_only ? NGM_LISTNAMES : NGM_LISTNODES, NULL, 0) < 0) {
102		warn("send msg");
103		return (CMDRTN_ERROR);
104	}
105	if (NgAllocRecvMsg(csock, &resp, NULL) < 0) {
106		warn("recv msg");
107		return (CMDRTN_ERROR);
108	}
109
110	/* Show each node */
111	nlist = (struct namelist *) resp->data;
112	printf("There are %d total %snodes:\n",
113	    nlist->numnames, named_only ? "named " : "");
114	ninfo = nlist->nodeinfo;
115	if (list_hooks) {
116		char	path[NG_PATHSIZ];
117		char	*argv[2] = { "show", path };
118
119		while (nlist->numnames > 0) {
120			snprintf(path, sizeof(path),
121			    "[%lx]:", (u_long)ninfo->id);
122			if ((rtn = (*show_cmd.func)(2, argv)) != CMDRTN_OK)
123				break;
124			ninfo++;
125			nlist->numnames--;
126			if (nlist->numnames > 0)
127				printf("\n");
128		}
129	} else {
130		while (nlist->numnames > 0) {
131			if (!*ninfo->name)
132				snprintf(ninfo->name, sizeof(ninfo->name),
133				    "%s", UNNAMED);
134			printf("  Name: %-15s Type: %-15s ID: %08x   "
135			    "Num hooks: %d\n",
136			    ninfo->name, ninfo->type, ninfo->id, ninfo->hooks);
137			ninfo++;
138			nlist->numnames--;
139		}
140	}
141
142	/* Done */
143	free(resp);
144	return (rtn);
145}
146
147