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