|
|
1.1 root 1: /*
2: * Copyright (c) 1980, 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted provided
6: * that: (1) source distributions retain this entire copyright notice and
7: * comment, and (2) distributions including binaries display the following
8: * acknowledgement: ``This product includes software developed by the
9: * University of California, Berkeley and its contributors'' in the
10: * documentation or other materials provided with the distribution and in
11: * all advertising materials mentioning features or use of this software.
12: * Neither the name of the University nor the names of its contributors may
13: * be used to endorse or promote products derived from this software without
14: * specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #ifndef lint
21: char copyright[] =
22: "@(#) Copyright (c) 1980, 1987 Regents of the University of California.\n\
23: All rights reserved.\n";
24: #endif /* not lint */
25:
26: #ifndef lint
27: static char sccsid[] = "@(#)users.c 5.9 (Berkeley) 6/1/90";
28: #endif /* not lint */
29:
30: #include <sys/types.h>
31: #include <errno.h>
32: #include <utmp.h>
33: #include <stdio.h>
34:
35: #define MAXUSERS 200
36:
37: main()
38: {
39: register int cnt, ncnt;
40: struct utmp utmp;
41: char names[MAXUSERS][UT_NAMESIZE];
42: int scmp();
43:
44: if (!freopen(_PATH_UTMP, "r", stdin)) {
45: (void)fprintf(stderr, "users: can't open %s.\n", _PATH_UTMP);
46: exit(1);
47: }
48: for (ncnt = 0;
49: fread((char *)&utmp, sizeof(utmp), 1, stdin) == 1;)
50: if (*utmp.ut_name) {
51: if (ncnt == MAXUSERS) {
52: (void)fprintf(stderr,
53: "users: too many users.\n");
54: break;
55: }
56: (void)strncpy(names[ncnt], utmp.ut_name, UT_NAMESIZE);
57: ++ncnt;
58: }
59:
60: if (ncnt) {
61: qsort(names, ncnt, UT_NAMESIZE, scmp);
62: (void)printf("%s", names[0]);
63: for (cnt = 1; cnt < ncnt; ++cnt) {
64: while (cnt < ncnt - 1 &&
65: !strncmp(names[cnt], names[cnt + 1], UT_NAMESIZE))
66: ++cnt;
67: (void)printf(" %.*s", UT_NAMESIZE, names[cnt]);
68: }
69: (void)printf("\n");
70: }
71: exit(0);
72: }
73:
74: scmp(p, q)
75: char *p, *q;
76: {
77: return(strcmp(p, q));
78: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.