ruptime.c revision 24360 
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
34/* $Id: ruptime.c,v 1.9 1997/02/22 19:56:50 peter Exp $ */
35
36#ifndef lint
37static char copyright[] =
38"@(#) Copyright (c) 1983, 1993, 1994\n\
39	The Regents of the University of California.  All rights reserved.\n";
40#endif /* not lint */
41
42#ifndef lint
43static char sccsid[] = "@(#)ruptime.c	8.2 (Berkeley) 4/5/94";
44#endif /* not lint */
45
46#include <sys/param.h>
47
48#include <protocols/rwhod.h>
49
50#include <dirent.h>
51#include <err.h>
52#include <errno.h>
53#include <fcntl.h>
54#include <stdio.h>
55#include <stdlib.h>
56#include <string.h>
57#include <time.h>
58#include <unistd.h>
59
60struct hs {
61	struct	whod *hs_wd;
62	int	hs_nusers;
63} *hs;
64struct	whod awhod;
65#define LEFTEARTH(h)		(now - (h)->hs_wd->wd_recvtime > 4*24*60*60)
66#define	ISDOWN(h)		(now - (h)->hs_wd->wd_recvtime > 11 * 60)
67#define	WHDRSIZE	(sizeof (awhod) - sizeof (awhod.wd_we))
68
69size_t nhosts;
70time_t now;
71int rflg = 1;
72
73int	 hscmp __P((const void *, const void *));
74char	*interval __P((time_t, char *));
75int	 lcmp __P((const void *, const void *));
76void	 morehosts __P((void));
77int	 tcmp __P((const void *, const void *));
78int	 ucmp __P((const void *, const void *));
79void	 usage __P((void));
80
81int
82main(argc, argv)
83	int argc;
84	char **argv;
85{
86	extern int optind;
87	struct dirent *dp;
88	struct hs *hsp;
89	struct whod *wd;
90	struct whoent *we;
91	DIR *dirp;
92	size_t hspace;
93	int aflg, cc, ch, fd, i, maxloadav;
94	char buf[sizeof(struct whod)];
95	int (*cmp) __P((const void *, const void *));
96
97	aflg = 0;
98	cmp = hscmp;
99	while ((ch = getopt(argc, argv, "alrut")) != -1)
100		switch (ch) {
101		case 'a':
102			aflg = 1;
103			break;
104		case 'l':
105			cmp = lcmp;
106			break;
107		case 'r':
108			rflg = -1;
109			break;
110		case 't':
111			cmp = tcmp;
112			break;
113		case 'u':
114			cmp = ucmp;
115			break;
116		default:
117			usage();
118		}
119	argc -= optind;
120	argv += optind;
121
122	if (argc != 0)
123		usage();
124
125	if (chdir(_PATH_RWHODIR) || (dirp = opendir(".")) == NULL)
126		err(1, "%s", _PATH_RWHODIR);
127
128	maxloadav = -1;
129	for (nhosts = hspace = 0; (dp = readdir(dirp)) != NULL;) {
130		if (dp->d_ino == 0 || strncmp(dp->d_name, "whod.", 5))
131			continue;
132		if ((fd = open(dp->d_name, O_RDONLY, 0)) < 0) {
133			warn("%s", dp->d_name);
134			continue;
135		}
136		cc = read(fd, buf, sizeof(struct whod));
137		(void)close(fd);
138
139		if (cc < WHDRSIZE)
140			continue;
141		if (nhosts == hspace) {
142			if ((hs =
143			    realloc(hs, (hspace += 40) * sizeof(*hs))) == NULL)
144				err(1, NULL);
145			hsp = hs + nhosts;
146		}
147
148		if ((hsp->hs_wd = malloc((size_t)WHDRSIZE)) == NULL)
149			err(1, NULL);
150		memmove(hsp->hs_wd, buf, (size_t)WHDRSIZE);
151
152		for (wd = (struct whod *)buf, i = 0; i < 2; ++i)
153			if (wd->wd_loadav[i] > maxloadav)
154				maxloadav = wd->wd_loadav[i];
155
156		for (hsp->hs_nusers = 0,
157		    we = (struct whoent *)(buf + cc); --we >= wd->wd_we;)
158			if (aflg || we->we_idle < 3600)
159				++hsp->hs_nusers;
160		++hsp;
161		++nhosts;
162	}
163	if (nhosts == 0)
164		errx(1, "no hosts in %s.", _PATH_RWHODIR);
165
166	(void)time(&now);
167	qsort(hs, nhosts, sizeof(hs[0]), cmp);
168	for (i = 0; i < nhosts; i++) {
169		hsp = &hs[i];
170		if (LEFTEARTH(hsp))
171			continue;
172		if (ISDOWN(hsp)) {
173			(void)printf("%-12.12s%s\n", hsp->hs_wd->wd_hostname,
174			    interval(now - hsp->hs_wd->wd_recvtime, "down"));
175			continue;
176		}
177		(void)printf(
178		    "%-12.12s%s,  %4d user%s  load %*.2f, %*.2f, %*.2f\n",
179		    hsp->hs_wd->wd_hostname,
180		    interval((time_t)hsp->hs_wd->wd_sendtime -
181			(time_t)hsp->hs_wd->wd_boottime, "  up"),
182		    hsp->hs_nusers,
183		    hsp->hs_nusers == 1 ? ", " : "s,",
184		    maxloadav >= 1000 ? 5 : 4,
185			hsp->hs_wd->wd_loadav[0] / 100.0,
186		    maxloadav >= 1000 ? 5 : 4,
187		        hsp->hs_wd->wd_loadav[1] / 100.0,
188		    maxloadav >= 1000 ? 5 : 4,
189		        hsp->hs_wd->wd_loadav[2] / 100.0);
190	}
191	exit(0);
192}
193
194char *
195interval(tval, updown)
196	time_t tval;
197	char *updown;
198{
199	static char resbuf[32];
200	int days, hours, minutes;
201
202	if (tval < 0) {
203		(void)snprintf(resbuf, sizeof(resbuf), "   %s ??:??", updown);
204		return (resbuf);
205	}
206						/* round to minutes. */
207	minutes = (tval + (60 - 1)) / 60;
208	hours = minutes / 60;
209	minutes %= 60;
210	days = hours / 24;
211	hours %= 24;
212	if (days)
213		(void)snprintf(resbuf, sizeof(resbuf),
214		    "%s %2d+%02d:%02d", updown, days, hours, minutes);
215	else
216		(void)snprintf(resbuf, sizeof(resbuf),
217		    "%s    %2d:%02d", updown, hours, minutes);
218	return (resbuf);
219}
220
221#define	HS(a)	((struct hs *)(a))
222
223/* Alphabetical comparison. */
224int
225hscmp(a1, a2)
226	const void *a1, *a2;
227{
228	return (rflg *
229	    strcmp(HS(a1)->hs_wd->wd_hostname, HS(a2)->hs_wd->wd_hostname));
230}
231
232/* Load average comparison. */
233int
234lcmp(a1, a2)
235	const void *a1, *a2;
236{
237	if (ISDOWN(HS(a1)))
238		if (ISDOWN(HS(a2)))
239			return (tcmp(a1, a2));
240		else
241			return (rflg);
242	else if (ISDOWN(HS(a2)))
243		return (-rflg);
244	else
245		return (rflg *
246		   (HS(a2)->hs_wd->wd_loadav[0] - HS(a1)->hs_wd->wd_loadav[0]));
247}
248
249/* Number of users comparison. */
250int
251ucmp(a1, a2)
252	const void *a1, *a2;
253{
254	if (ISDOWN(HS(a1)))
255		if (ISDOWN(HS(a2)))
256			return (tcmp(a1, a2));
257		else
258			return (rflg);
259	else if (ISDOWN(HS(a2)))
260		return (-rflg);
261	else
262		return (rflg * (HS(a2)->hs_nusers - HS(a1)->hs_nusers));
263}
264
265/* Uptime comparison. */
266int
267tcmp(a1, a2)
268	const void *a1, *a2;
269{
270	return (rflg * (
271		(ISDOWN(HS(a2)) ? HS(a2)->hs_wd->wd_recvtime - now
272		    : HS(a2)->hs_wd->wd_sendtime - HS(a2)->hs_wd->wd_boottime)
273		-
274		(ISDOWN(HS(a1)) ? HS(a1)->hs_wd->wd_recvtime - now
275		    : HS(a1)->hs_wd->wd_sendtime - HS(a1)->hs_wd->wd_boottime)
276	));
277}
278
279void
280usage()
281{
282	(void)fprintf(stderr, "usage: ruptime [-alrut]\n");
283	exit(1);
284}
285