|
|
1.1 root 1: /*
2: * Copyright (c) 1988 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #if defined(LIBC_SCCS) && !defined(lint)
21: static char sccsid[] = "@(#)logout.c 5.5 (Berkeley) 6/1/90";
22: #endif /* LIBC_SCCS and not lint */
23:
24: #include <sys/types.h>
25: #include <sys/file.h>
26: #include <sys/time.h>
27: #include <utmp.h>
28:
29: typedef struct utmp UTMP;
30:
31: logout(line)
32: register char *line;
33: {
34: register int fd;
35: UTMP ut;
36: int rval;
37: off_t lseek();
38: time_t time();
39:
40: if ((fd = open(_PATH_UTMP, O_RDWR)) < 0)
41: return(0);
42: rval = 0;
43: while (read(fd, (char *)&ut, sizeof(UTMP)) == sizeof(UTMP)) {
44: if (!ut.ut_name[0] || strncmp(ut.ut_line, line, UT_LINESIZE))
45: continue;
46: bzero(ut.ut_name, UT_NAMESIZE);
47: bzero(ut.ut_host, UT_HOSTSIZE);
48: (void)time(&ut.ut_time);
49: (void)lseek(fd, -(long)sizeof(UTMP), L_INCR);
50: (void)write(fd, (char *)&ut, sizeof(UTMP));
51: rval = 1;
52: }
53: (void)close(fd);
54: return(rval);
55: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.