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>
43 /* Open the auxiliary database file containing failed authentication
44 * counters, and the times at which the last failures occurred.
48 kaux_opendb(char *path)
50 char dbpathname[1024];
51 static char dbname[] = "auxdb";
53 if (strlen(path) < 1024 - strlen(dbname)) { /* bullet-proofing */
55 strcpy(dbpathname, path);
56 strcat(dbpathname, dbname);
58 fd = open(dbpathname, O_CREAT | O_RDWR, 0600);
66 /* close that auxiliary database. Unneccessary, but here for symmetry.
79 * The read and write routines take as a parameter, the offset into
80 * the main database at which a particular user's entry resides. They
81 * then convert that into an offset into the auxiliary database. This
82 * makes the main code a little simpler, though it obscures a small
86 kaux_read(afs_int32 to, /* this is the offset of the user id in the main database.
87 * we do the conversion here - probably a bad idea. */
88 unsigned int *nfailures, afs_uint32 * lasttime)
92 *nfailures = *lasttime = 0;
98 ((to - sizeof(struct kaheader)) / ENTRYSIZE) * (sizeof(int) +
100 /* can't get there from here */
101 if (offset > lseek(fd, offset, SEEK_SET))
104 /* we should just end up with 0 for nfailures and lasttime if EOF is
105 * encountered here, I hope */
106 if ((0 > read(fd, nfailures, sizeof(int)))
107 || (0 > read(fd, lasttime, sizeof(afs_int32)))) {
108 *nfailures = *lasttime = 0;
109 perror("kaux_read()");
116 kaux_write(afs_int32 to, unsigned int nfailures, afs_uint32 lasttime)
124 ((to - sizeof(struct kaheader)) / ENTRYSIZE) * (sizeof(int) +
126 /* can't get there from here */
127 if (offset > lseek(fd, offset, SEEK_SET))
130 if ((write(fd, &nfailures, sizeof(int)) != sizeof(int))
131 || (write(fd, &lasttime, sizeof(afs_int32)) != sizeof(afs_int32)))
132 perror("kaux_write()");
137 /* adjust this user's records to reflect a failure.
138 * locktime is the value stored in the main database that specifies
139 * how long a user's ID should be locked once the attempts limit has
140 * been exceeded. It also functions as the interval during which the
141 * permitted N-1 authentication failures plus the forbidden Nth
142 * failure must occur, in order for the ID to actually be locked. Ie,
143 * all failures which occurred more than _locktime_ seconds ago are
145 * locktime == 0 signifies that the ID should be locked indefinitely
148 kaux_inc(afs_int32 to, afs_uint32 locktime)
151 afs_uint32 lasttime, now;
155 kaux_read(to, &nfailures, &lasttime);
157 if (locktime && lasttime + locktime < now)
162 kaux_write(to, nfailures, now);
167 * report on whether a particular id is locked or not...
168 * has to get some dirt from ubik.
169 * We multiply the actual number of permitted attempts by two because
170 * klog tries to authenticate twice when the password is bogus: once
171 * with the ka_string_to_key, and once with des_string_to_key, for
172 * Kerberos compatibility. It's easier to frob here than to explain
174 * RETURNS: time when the ID will be unlocked, or 0 if it's not locked.
177 kaux_islocked(afs_int32 to, u_int attempts, u_int locktime)
179 extern int ubeacon_Debug(), ubeacon_AmSyncSite();
180 unsigned int nfailures, myshare;
182 struct ubik_debug beaconinfo;
184 /* if attempts is 0, that means there's no limit, so the id
185 * can't ever be locked...
190 kaux_read(to, &nfailures, &lasttime);
192 ubeacon_Debug(&beaconinfo);
193 attempts = attempts * 2;
195 myshare = attempts / beaconinfo.nServers;
196 if (ubeacon_AmSyncSite())
197 myshare += attempts % beaconinfo.nServers;
201 } else if ((nfailures < myshare)
202 || (locktime && lasttime + locktime < time(0))) {
204 } else if (locktime == 0) { /* infinite */
207 return (lasttime + locktime);