ruptime.c revision 24433
178556Sobrien/* 278556Sobrien * Copyright (c) 1983, 1993, 1994 378556Sobrien * The Regents of the University of California. All rights reserved. 478556Sobrien * 578556Sobrien * Redistribution and use in source and binary forms, with or without 678556Sobrien * modification, are permitted provided that the following conditions 7167974Sdelphij * are met: 8167974Sdelphij * 1. Redistributions of source code must retain the above copyright 9167974Sdelphij * notice, this list of conditions and the following disclaimer. 1078556Sobrien * 2. Redistributions in binary form must reproduce the above copyright 11215041Sobrien * notice, this list of conditions and the following disclaimer in the 12215041Sobrien * documentation and/or other materials provided with the distribution. 1378556Sobrien * 3. All advertising materials mentioning features or use of this software 14167974Sdelphij * must display the following acknowledgement: 15167974Sdelphij * This product includes software developed by the University of 1678556Sobrien * California, Berkeley and its contributors. 17167974Sdelphij * 4. Neither the name of the University nor the names of its contributors 18167974Sdelphij * may be used to endorse or promote products derived from this software 19167974Sdelphij * without specific prior written permission. 2078556Sobrien * 2178556Sobrien * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 2278556Sobrien * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2378556Sobrien * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2478556Sobrien * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2578556Sobrien * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2678556Sobrien * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2778556Sobrien * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2878556Sobrien * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2978556Sobrien * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 3078556Sobrien * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3178556Sobrien * SUCH DAMAGE. 3278556Sobrien */ 3378556Sobrien 3478556Sobrien/* $Id: ruptime.c,v 1.10 1997/03/29 04:32:02 imp Exp $ */ 3578556Sobrien 3678556Sobrien#ifndef lint 3778556Sobrienstatic char copyright[] = 3878556Sobrien"@(#) Copyright (c) 1983, 1993, 1994\n\ 3978556Sobrien The Regents of the University of California. All rights reserved.\n"; 4078556Sobrien#endif /* not lint */ 4178556Sobrien 4278556Sobrien#ifndef lint 4378556Sobrienstatic char sccsid[] = "@(#)ruptime.c 8.2 (Berkeley) 4/5/94"; 4478556Sobrien#endif /* not lint */ 4578556Sobrien 4678556Sobrien#include <sys/param.h> 4778556Sobrien 4878556Sobrien#include <protocols/rwhod.h> 4978556Sobrien 5078556Sobrien#include <dirent.h> 5178556Sobrien#include <err.h> 5278556Sobrien#include <errno.h> 5378556Sobrien#include <fcntl.h> 5478556Sobrien#include <stdio.h> 5578556Sobrien#include <stdlib.h> 5678556Sobrien#include <string.h> 5778556Sobrien#include <time.h> 5878556Sobrien#include <unistd.h> 5978556Sobrien 6078556Sobrienstruct hs { 6178556Sobrien struct whod *hs_wd; 6278556Sobrien int hs_nusers; 6378556Sobrien} *hs; 6478556Sobrienstruct whod awhod; 6578556Sobrien#define LEFTEARTH(h) (now - (h)->hs_wd->wd_recvtime > 4*24*60*60) 6678556Sobrien#define ISDOWN(h) (now - (h)->hs_wd->wd_recvtime > 11 * 60) 6778556Sobrien#define WHDRSIZE (sizeof (awhod) - sizeof (awhod.wd_we)) 6878556Sobrien 6978556Sobriensize_t nhosts; 7078556Sobrientime_t now; 7178556Sobrienint rflg = 1; 7278556Sobrien 7378556Sobrienint hscmp __P((const void *, const void *)); 7478556Sobrienchar *interval __P((time_t, char *)); 7578556Sobrienint lcmp __P((const void *, const void *)); 7678556Sobrienvoid morehosts __P((void)); 7778556Sobrienint tcmp __P((const void *, const void *)); 7878556Sobrienint ucmp __P((const void *, const void *)); 7978556Sobrienvoid usage __P((void)); 8078556Sobrien 8178556Sobrienint 8278556Sobrienmain(argc, argv) 8378556Sobrien int argc; 8478556Sobrien 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 %3d+%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