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