2 * Copyright (c) 1983, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
37 static char copyright[] =
38 "@(#) Copyright (c) 1983, 1993, 1994\n\
39 The Regents of the University of California. All rights reserved.\n";
43 static char sccsid[] = "@(#)ruptime.c 8.2 (Berkeley) 4/5/94";
46 #include <sys/param.h>
48 #include <protocols/rwhod.h>
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))
73 int hscmp __P((const void *, const void *));
74 char *interval __P((time_t, char *));
75 int lcmp __P((const void *, const void *));
76 void morehosts __P((void));
77 int tcmp __P((const void *, const void *));
78 int ucmp __P((const void *, const void *));
79 void usage __P((void));
93 int aflg, cc, ch, fd, i, maxloadav;
94 char buf[sizeof(struct whod)];
95 int (*cmp) __P((const void *, const void *));
99 while ((ch = getopt(argc, argv, "alrut")) != -1)
125 if (chdir(_PATH_RWHODIR) || (dirp = opendir(".")) == NULL)
126 err(1, "%s", _PATH_RWHODIR);
129 for (nhosts = hspace = 0; (dp = readdir(dirp)) != NULL;) {
130 if (dp->d_ino == 0 || strncmp(dp->d_name, "whod.", 5))
132 if ((fd = open(dp->d_name, O_RDONLY, 0)) < 0) {
133 warn("%s", dp->d_name);
136 cc = read(fd, buf, sizeof(struct whod));
141 if (nhosts == hspace) {
143 realloc(hs, (hspace += 40) * sizeof(*hs))) == NULL)
148 if ((hsp->hs_wd = malloc((size_t)WHDRSIZE)) == NULL)
150 memmove(hsp->hs_wd, buf, (size_t)WHDRSIZE);
152 for (wd = (struct whod *)buf, i = 0; i < 2; ++i)
153 if (wd->wd_loadav[i] > maxloadav)
154 maxloadav = wd->wd_loadav[i];
156 for (hsp->hs_nusers = 0,
157 we = (struct whoent *)(buf + cc); --we >= wd->wd_we;)
158 if (aflg || we->we_idle < 3600)
164 errx(1, "no hosts in %s.", _PATH_RWHODIR);
167 qsort(hs, nhosts, sizeof(hs[0]), cmp);
168 for (i = 0; i < nhosts; i++) {
173 (void)printf("%-12.12s%s\n", hsp->hs_wd->wd_hostname,
174 interval(now - hsp->hs_wd->wd_recvtime, "down"));
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"),
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);
195 interval(tval, updown)
199 static char resbuf[32];
200 int days, hours, minutes;
203 (void)snprintf(resbuf, sizeof(resbuf), " %s ??:??", updown);
206 /* round to minutes. */
207 minutes = (tval + (60 - 1)) / 60;
208 hours = minutes / 60;
213 (void)snprintf(resbuf, sizeof(resbuf),
214 "%s %3d+%02d:%02d", updown, days, hours, minutes);
216 (void)snprintf(resbuf, sizeof(resbuf),
217 "%s %2d:%02d", updown, hours, minutes);
221 #define HS(a) ((struct hs *)(a))
223 /* Alphabetical comparison. */
229 strcmp(HS(a1)->hs_wd->wd_hostname, HS(a2)->hs_wd->wd_hostname));
232 /* Load average comparison. */
239 return (tcmp(a1, a2));
242 else if (ISDOWN(HS(a2)))
246 (HS(a2)->hs_wd->wd_loadav[0] - HS(a1)->hs_wd->wd_loadav[0]));
249 /* Number of users comparison. */
256 return (tcmp(a1, a2));
259 else if (ISDOWN(HS(a2)))
262 return (rflg * (HS(a2)->hs_nusers - HS(a1)->hs_nusers));
265 /* Uptime comparison. */
271 (ISDOWN(HS(a2)) ? HS(a2)->hs_wd->wd_recvtime - now
272 : HS(a2)->hs_wd->wd_sendtime - HS(a2)->hs_wd->wd_boottime)
274 (ISDOWN(HS(a1)) ? HS(a1)->hs_wd->wd_recvtime - now
275 : HS(a1)->hs_wd->wd_sendtime - HS(a1)->hs_wd->wd_boottime)
282 (void)fprintf(stderr, "usage: ruptime [-alrut]\n");