xref: /dragonfly/usr.bin/ruptime/ruptime.c (revision e8364298)
1 /*
2  * Copyright (c) 1983, 1993, 1994
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  * 3. All advertising materials mentioning features or use of this software
14  *    must display the following acknowledgement:
15  *	This product includes software developed by the University of
16  *	California, Berkeley and its contributors.
17  * 4. Neither the name of the University nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  *
33  * @(#) Copyright (c) 1983, 1993, 1994 The Regents of the University of California.  All rights reserved.
34  * @(#)ruptime.c	8.2 (Berkeley) 4/5/94
35  * $FreeBSD: src/usr.bin/ruptime/ruptime.c,v 1.12.2.1 2000/06/30 09:45:00 ps Exp $
36  * $DragonFly: src/usr.bin/ruptime/ruptime.c,v 1.3 2003/11/03 19:31:32 eirikn Exp $
37  */
38 
39 #include <sys/param.h>
40 
41 #include <protocols/rwhod.h>
42 
43 #include <dirent.h>
44 #include <err.h>
45 #include <errno.h>
46 #include <fcntl.h>
47 #include <stdio.h>
48 #include <stdlib.h>
49 #include <string.h>
50 #include <time.h>
51 #include <unistd.h>
52 
53 struct hs {
54 	struct	whod *hs_wd;
55 	int	hs_nusers;
56 } *hs;
57 struct	whod awhod;
58 #define LEFTEARTH(h)		(now - (h)->hs_wd->wd_recvtime > 4*24*60*60)
59 #define	ISDOWN(h)		(now - (h)->hs_wd->wd_recvtime > 11 * 60)
60 #define	WHDRSIZE	(sizeof (awhod) - sizeof (awhod.wd_we))
61 
62 size_t nhosts;
63 time_t now;
64 int rflg = 1;
65 
66 int	 hscmp(const void *, const void *);
67 char	*interval(time_t, char *);
68 int	 lcmp(const void *, const void *);
69 void	 morehosts(void);
70 int	 tcmp(const void *, const void *);
71 int	 ucmp(const void *, const void *);
72 void	 usage(void);
73 
74 int
75 main(argc, argv)
76 	int argc;
77 	char **argv;
78 {
79 	struct dirent *dp;
80 	struct hs *hsp;
81 	struct whod *wd;
82 	struct whoent *we;
83 	DIR *dirp;
84 	size_t hspace;
85 	int aflg, cc, ch, fd, i, maxloadav;
86 	char buf[sizeof(struct whod)];
87 	int (*cmp)(const void *, const void *);
88 
89 	aflg = 0;
90 	cmp = hscmp;
91 	while ((ch = getopt(argc, argv, "alrut")) != -1)
92 		switch (ch) {
93 		case 'a':
94 			aflg = 1;
95 			break;
96 		case 'l':
97 			cmp = lcmp;
98 			break;
99 		case 'r':
100 			rflg = -1;
101 			break;
102 		case 't':
103 			cmp = tcmp;
104 			break;
105 		case 'u':
106 			cmp = ucmp;
107 			break;
108 		default:
109 			usage();
110 		}
111 	argc -= optind;
112 	argv += optind;
113 
114 	if (argc != 0)
115 		usage();
116 
117 	if (chdir(_PATH_RWHODIR) || (dirp = opendir(".")) == NULL)
118 		err(1, "%s", _PATH_RWHODIR);
119 
120 	maxloadav = -1;
121 	for (nhosts = hspace = 0; (dp = readdir(dirp)) != NULL;) {
122 		if (dp->d_ino == 0 || strncmp(dp->d_name, "whod.", 5))
123 			continue;
124 		if ((fd = open(dp->d_name, O_RDONLY, 0)) < 0) {
125 			warn("%s", dp->d_name);
126 			continue;
127 		}
128 		cc = read(fd, buf, sizeof(struct whod));
129 		(void)close(fd);
130 
131 		if (cc < WHDRSIZE)
132 			continue;
133 		if (nhosts == hspace) {
134 			if ((hs =
135 			    realloc(hs, (hspace += 40) * sizeof(*hs))) == NULL)
136 				err(1, NULL);
137 			hsp = hs + nhosts;
138 		}
139 
140 		if ((hsp->hs_wd = malloc((size_t)WHDRSIZE)) == NULL)
141 			err(1, NULL);
142 		memmove(hsp->hs_wd, buf, (size_t)WHDRSIZE);
143 
144 		for (wd = (struct whod *)buf, i = 0; i < 2; ++i)
145 			if (wd->wd_loadav[i] > maxloadav)
146 				maxloadav = wd->wd_loadav[i];
147 
148 		for (hsp->hs_nusers = 0,
149 		    we = (struct whoent *)(buf + cc); --we >= wd->wd_we;)
150 			if (aflg || we->we_idle < 3600)
151 				++hsp->hs_nusers;
152 		++hsp;
153 		++nhosts;
154 	}
155 	if (nhosts == 0)
156 		errx(1, "no hosts in %s", _PATH_RWHODIR);
157 
158 	(void)time(&now);
159 	qsort(hs, nhosts, sizeof(hs[0]), cmp);
160 	for (i = 0; i < nhosts; i++) {
161 		hsp = &hs[i];
162 		if (LEFTEARTH(hsp))
163 			continue;
164 		if (ISDOWN(hsp)) {
165 			(void)printf("%-12.12s%s\n", hsp->hs_wd->wd_hostname,
166 			    interval(now - hsp->hs_wd->wd_recvtime, "down"));
167 			continue;
168 		}
169 		(void)printf(
170 		    "%-12.12s%s,  %4d user%s  load %*.2f, %*.2f, %*.2f\n",
171 		    hsp->hs_wd->wd_hostname,
172 		    interval((time_t)hsp->hs_wd->wd_sendtime -
173 			(time_t)hsp->hs_wd->wd_boottime, "  up"),
174 		    hsp->hs_nusers,
175 		    hsp->hs_nusers == 1 ? ", " : "s,",
176 		    maxloadav >= 1000 ? 5 : 4,
177 			hsp->hs_wd->wd_loadav[0] / 100.0,
178 		    maxloadav >= 1000 ? 5 : 4,
179 		        hsp->hs_wd->wd_loadav[1] / 100.0,
180 		    maxloadav >= 1000 ? 5 : 4,
181 		        hsp->hs_wd->wd_loadav[2] / 100.0);
182 	}
183 	exit(0);
184 }
185 
186 char *
187 interval(tval, updown)
188 	time_t tval;
189 	char *updown;
190 {
191 	static char resbuf[32];
192 	int days, hours, minutes;
193 
194 	if (tval < 0) {
195 		(void)snprintf(resbuf, sizeof(resbuf), "   %s ??:??", updown);
196 		return (resbuf);
197 	}
198 						/* round to minutes. */
199 	minutes = (tval + (60 - 1)) / 60;
200 	hours = minutes / 60;
201 	minutes %= 60;
202 	days = hours / 24;
203 	hours %= 24;
204 	if (days)
205 		(void)snprintf(resbuf, sizeof(resbuf),
206 		    "%s %3d+%02d:%02d", updown, days, hours, minutes);
207 	else
208 		(void)snprintf(resbuf, sizeof(resbuf),
209 		    "%s     %2d:%02d", updown, hours, minutes);
210 	return (resbuf);
211 }
212 
213 #define	HS(a)	((struct hs *)(a))
214 
215 /* Alphabetical comparison. */
216 int
217 hscmp(a1, a2)
218 	const void *a1, *a2;
219 {
220 	return (rflg *
221 	    strcmp(HS(a1)->hs_wd->wd_hostname, HS(a2)->hs_wd->wd_hostname));
222 }
223 
224 /* Load average comparison. */
225 int
226 lcmp(a1, a2)
227 	const void *a1, *a2;
228 {
229 	if (ISDOWN(HS(a1)))
230 		if (ISDOWN(HS(a2)))
231 			return (tcmp(a1, a2));
232 		else
233 			return (rflg);
234 	else if (ISDOWN(HS(a2)))
235 		return (-rflg);
236 	else
237 		return (rflg *
238 		   (HS(a2)->hs_wd->wd_loadav[0] - HS(a1)->hs_wd->wd_loadav[0]));
239 }
240 
241 /* Number of users comparison. */
242 int
243 ucmp(a1, a2)
244 	const void *a1, *a2;
245 {
246 	if (ISDOWN(HS(a1)))
247 		if (ISDOWN(HS(a2)))
248 			return (tcmp(a1, a2));
249 		else
250 			return (rflg);
251 	else if (ISDOWN(HS(a2)))
252 		return (-rflg);
253 	else
254 		return (rflg * (HS(a2)->hs_nusers - HS(a1)->hs_nusers));
255 }
256 
257 /* Uptime comparison. */
258 int
259 tcmp(a1, a2)
260 	const void *a1, *a2;
261 {
262 	return (rflg * (
263 		(ISDOWN(HS(a2)) ? HS(a2)->hs_wd->wd_recvtime - now
264 		    : HS(a2)->hs_wd->wd_sendtime - HS(a2)->hs_wd->wd_boottime)
265 		-
266 		(ISDOWN(HS(a1)) ? HS(a1)->hs_wd->wd_recvtime - now
267 		    : HS(a1)->hs_wd->wd_sendtime - HS(a1)->hs_wd->wd_boottime)
268 	));
269 }
270 
271 void
272 usage()
273 {
274 	(void)fprintf(stderr, "usage: ruptime [-alrut]\n");
275 	exit(1);
276 }
277