2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
14 #include <afsconfig.h>
15 #include <afs/param.h>
20 #define UBIK_INTERNALS
29 /* Open the auxiliary database file containing failed authentication
30 * counters, and the times at which the last failures occurred.
34 kaux_opendb(char *path)
36 char dbpathname[1024];
37 static char dbname[] = "auxdb";
39 if (strlen(path) < 1024 - strlen(dbname)) { /* bullet-proofing */
41 strcpy(dbpathname, path);
42 strcat(dbpathname, dbname);
44 fd = open(dbpathname, O_CREAT | O_RDWR, 0600);
52 /* close that auxiliary database. Unneccessary, but here for symmetry.
65 * The read and write routines take as a parameter, the offset into
66 * the main database at which a particular user's entry resides. They
67 * then convert that into an offset into the auxiliary database. This
68 * makes the main code a little simpler, though it obscures a small
72 kaux_read(afs_int32 to, /* this is the offset of the user id in the main database.
73 * we do the conversion here - probably a bad idea. */
74 unsigned int *nfailures, afs_uint32 * lasttime)
78 *nfailures = *lasttime = 0;
84 ((to - sizeof(struct kaheader)) / ENTRYSIZE) * (sizeof(int) +
86 /* can't get there from here */
87 if (offset > lseek(fd, offset, SEEK_SET))
90 /* we should just end up with 0 for nfailures and lasttime if EOF is
91 * encountered here, I hope */
92 if ((0 > read(fd, nfailures, sizeof(int)))
93 || (0 > read(fd, lasttime, sizeof(afs_int32)))) {
94 *nfailures = *lasttime = 0;
95 perror("kaux_read()");
102 kaux_write(afs_int32 to, unsigned int nfailures, afs_uint32 lasttime)
110 ((to - sizeof(struct kaheader)) / ENTRYSIZE) * (sizeof(int) +
112 /* can't get there from here */
113 if (offset > lseek(fd, offset, SEEK_SET))
116 if ((write(fd, &nfailures, sizeof(int)) != sizeof(int))
117 || (write(fd, &lasttime, sizeof(afs_int32)) != sizeof(afs_int32)))
118 perror("kaux_write()");
123 /* adjust this user's records to reflect a failure.
124 * locktime is the value stored in the main database that specifies
125 * how long a user's ID should be locked once the attempts limit has
126 * been exceeded. It also functions as the interval during which the
127 * permitted N-1 authentication failures plus the forbidden Nth
128 * failure must occur, in order for the ID to actually be locked. Ie,
129 * all failures which occurred more than _locktime_ seconds ago are
131 * locktime == 0 signifies that the ID should be locked indefinitely
134 kaux_inc(afs_int32 to, afs_uint32 locktime)
136 unsigned int nfailures;
137 afs_uint32 lasttime, now;
141 kaux_read(to, &nfailures, &lasttime);
143 if (locktime && lasttime + locktime < now)
148 kaux_write(to, nfailures, now);
153 * report on whether a particular id is locked or not...
154 * has to get some dirt from ubik.
155 * We multiply the actual number of permitted attempts by two because
156 * klog tries to authenticate twice when the password is bogus: once
157 * with the ka_string_to_key, and once with des_string_to_key, for
158 * Kerberos compatibility. It's easier to frob here than to explain
160 * RETURNS: time when the ID will be unlocked, or 0 if it's not locked.
163 kaux_islocked(afs_int32 to, u_int attempts, u_int locktime)
165 unsigned int nfailures, myshare;
167 struct ubik_debug beaconinfo;
169 /* if attempts is 0, that means there's no limit, so the id
170 * can't ever be locked...
175 kaux_read(to, &nfailures, &lasttime);
177 ubeacon_Debug(&beaconinfo);
178 attempts = attempts * 2;
180 myshare = attempts / beaconinfo.nServers;
181 if (ubeacon_AmSyncSite())
182 myshare += attempts % beaconinfo.nServers;
186 } else if ((nfailures < myshare)
187 || (locktime && lasttime + locktime < time(0))) {
189 } else if (locktime == 0) { /* infinite */
192 return (lasttime + locktime);