2 * Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute 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.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE 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 INSTITUTE 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
36 RCSID("$Id: otp_db.c,v 1.20 2003/04/16 16:20:58 lha Exp $");
41 #if !defined(HAVE_NDBM) && !defined(HAVE_DB_NDBM)
42 #include "ndbm_wrap.h"
54 for(i = 0; i < RETRIES; ++i) {
57 lock = open (OTP_DB_LOCK, O_WRONLY | O_CREAT | O_EXCL, 0666);
62 if (stat (OTP_DB_LOCK, &statbuf) == 0) {
63 if (time(NULL) - statbuf.st_mtime > OTP_DB_TIMEOUT)
71 ret = dbm_open (OTP_DB, O_RDWR | O_CREAT, 0600);
78 otp_db_close (void *dbm)
80 dbm_close ((DBM *)dbm);
85 * Remove this entry from the database.
90 otp_delete (void *v, OtpContext *ctx)
95 key.dsize = strlen(ctx->user);
98 return dbm_delete(dbm, key);
102 * Read this entry from the database and lock it if lockp.
106 otp_get_internal (void *v, OtpContext *ctx, int lockp)
113 key.dsize = strlen(ctx->user);
114 key.dptr = ctx->user;
116 dat = dbm_fetch (dbm, key);
117 if (dat.dptr == NULL) {
118 ctx->err = "Entry not found";
123 memcpy (&then, p, sizeof(then));
124 ctx->lock_time = then;
127 if (then && now - then < OTP_USER_TIMEOUT) {
128 ctx->err = "Entry locked";
131 memcpy (p, &now, sizeof(now));
134 ctx->alg = otp_find_alg (p);
135 if (ctx->alg == NULL) {
136 ctx->err = "Bad algorithm";
141 unsigned char *up = (unsigned char *)p;
142 ctx->n = (up[0] << 24) | (up[1] << 16) | (up[2] << 8) | up[3];
145 memcpy (ctx->key, p, OTPKEYSIZE);
147 strlcpy (ctx->seed, p, sizeof(ctx->seed));
149 return dbm_store (dbm, key, dat, DBM_REPLACE);
159 otp_get (void *v, OtpContext *ctx)
161 return otp_get_internal (v, ctx, 1);
165 * Get and don't lock.
169 otp_simple_get (void *v, OtpContext *ctx)
171 return otp_get_internal (v, ctx, 0);
175 * Write this entry to the database.
179 otp_put (void *v, OtpContext *ctx)
187 key.dsize = strlen(ctx->user);
188 key.dptr = ctx->user;
193 if (rem < sizeof(zero))
195 memcpy (p, &zero, sizeof(zero));
198 len = strlen(ctx->alg->name) + 1;
202 strlcpy (p, ctx->alg->name, rem);
209 unsigned char *up = (unsigned char *)p;
210 *up++ = (ctx->n >> 24) & 0xFF;
211 *up++ = (ctx->n >> 16) & 0xFF;
212 *up++ = (ctx->n >> 8) & 0xFF;
213 *up++ = (ctx->n >> 0) & 0xFF;
218 if (rem < OTPKEYSIZE)
220 memcpy (p, ctx->key, OTPKEYSIZE);
224 len = strlen(ctx->seed) + 1;
227 strlcpy (p, ctx->seed, rem);
232 return dbm_store (dbm, key, dat, DBM_REPLACE);