4 * Copyright (c) 1989, 1993, 1995
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * 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.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
38 * Portions Copyright (c) 1996,1999 by Internet Software Consortium.
40 * Permission to use, copy, modify, and distribute this software for any
41 * purpose with or without fee is hereby granted, provided that the above
42 * copyright notice and this permission notice appear in all copies.
44 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
45 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
46 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
47 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
48 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
49 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
50 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
53 #if defined(LIBC_SCCS) && !defined(lint)
54 static const char rcsid
[] = "Id: lcl_pw.c,v 1.3 2005/04/27 04:56:31 sra Exp";
55 #endif /* LIBC_SCCS and not lint */
59 #include "port_before.h"
62 static int __bind_irs_pw_unneeded
;
65 #include <sys/param.h>
66 #include <sys/types.h>
67 #include <netinet/in.h>
68 #include <arpa/nameser.h>
82 #include <isc/memcluster.h>
85 #include "port_after.h"
92 * The lookup techniques and data extraction code here must be kept
93 * in sync with that in `pwd_mkdb'.
100 struct passwd passwd
; /*%< password structure */
101 DB
*pw_db
; /*%< password database */
102 int pw_keynum
; /*%< key counter */
110 static void pw_close(struct irs_pw
*);
111 static struct passwd
* pw_next(struct irs_pw
*);
112 static struct passwd
* pw_byname(struct irs_pw
*, const char *);
113 static struct passwd
* pw_byuid(struct irs_pw
*, uid_t
);
114 static void pw_rewind(struct irs_pw
*);
115 static void pw_minimize(struct irs_pw
*);
117 static int initdb(struct pvt
*);
118 static int hashpw(struct irs_pw
*, DBT
*);
122 irs_lcl_pw(struct irs_acc
*this) {
128 if (!(pw
= memget(sizeof *pw
))) {
132 memset(pw
, 0x5e, sizeof *pw
);
133 if (!(pvt
= memget(sizeof *pvt
))) {
138 memset(pvt
, 0, sizeof *pvt
);
140 pw
->close
= pw_close
;
142 pw
->byname
= pw_byname
;
143 pw
->byuid
= pw_byuid
;
144 pw
->rewind
= pw_rewind
;
145 pw
->minimize
= pw_minimize
;
154 pw_close(struct irs_pw
*this) {
155 struct pvt
*pvt
= (struct pvt
*)this->private;
158 (void)(pvt
->pw_db
->close
)(pvt
->pw_db
);
162 memput(pvt
->line
, pvt
->max
);
163 memput(pvt
, sizeof *pvt
);
164 memput(this, sizeof *this);
167 static struct passwd
*
168 pw_next(struct irs_pw
*this) {
169 struct pvt
*pvt
= (struct pvt
*)this->private;
172 char bf
[sizeof(pvt
->pw_keynum
) + 1];
178 bf
[0] = _PW_KEYBYNUM
;
179 memcpy(bf
+ 1, (char *)&pvt
->pw_keynum
, sizeof(pvt
->pw_keynum
));
180 key
.data
= (u_char
*)bf
;
181 key
.size
= sizeof(pvt
->pw_keynum
) + 1;
182 return (hashpw(this, &key
) ? &pvt
->passwd
: NULL
);
185 static struct passwd
*
186 pw_byname(struct irs_pw
*this, const char *name
) {
187 struct pvt
*pvt
= (struct pvt
*)this->private;
190 char bf
[UT_NAMESIZE
+ 1];
195 bf
[0] = _PW_KEYBYNAME
;
197 memcpy(bf
+ 1, name
, MIN(len
, UT_NAMESIZE
));
198 key
.data
= (u_char
*)bf
;
200 rval
= hashpw(this, &key
);
202 return (rval
? &pvt
->passwd
: NULL
);
206 static struct passwd
*
207 pw_byuid(struct irs_pw
*this, uid_t uid
) {
208 struct pvt
*pvt
= (struct pvt
*)this->private;
211 char bf
[sizeof(keyuid
) + 1];
216 bf
[0] = _PW_KEYBYUID
;
218 memcpy(bf
+ 1, &keyuid
, sizeof(keyuid
));
219 key
.data
= (u_char
*)bf
;
220 key
.size
= sizeof(keyuid
) + 1;
221 rval
= hashpw(this, &key
);
223 return (rval
? &pvt
->passwd
: NULL
);
227 pw_rewind(struct irs_pw
*this) {
228 struct pvt
*pvt
= (struct pvt
*)this->private;
234 pw_minimize(struct irs_pw
*this) {
235 struct pvt
*pvt
= (struct pvt
*)this->private;
237 if (pvt
->pw_db
!= NULL
) {
238 (void) (*pvt
->pw_db
->close
)(pvt
->pw_db
);
246 initdb(struct pvt
*pvt
) {
250 if (lseek((*pvt
->pw_db
->fd
)(pvt
->pw_db
), 0L, SEEK_CUR
) >= 0L)
253 (void) (*pvt
->pw_db
->close
)(pvt
->pw_db
);
255 pvt
->pw_db
= dbopen((p
= _PATH_SMP_DB
), O_RDONLY
, 0, DB_HASH
, NULL
);
257 pvt
->pw_db
= dbopen((p
=_PATH_MP_DB
), O_RDONLY
,
262 syslog(LOG_ERR
, "%s: %m", p
);
269 hashpw(struct irs_pw
*this, DBT
*key
) {
270 struct pvt
*pvt
= (struct pvt
*)this->private;
274 if ((pvt
->pw_db
->get
)(pvt
->pw_db
, key
, &data
, 0))
276 p
= (char *)data
.data
;
277 if (data
.size
> pvt
->max
) {
278 size_t newlen
= pvt
->max
+ 1024;
279 char *p
= memget(newlen
);
283 if (pvt
->line
!= NULL
) {
284 memcpy(p
, pvt
->line
, pvt
->max
);
285 memput(pvt
->line
, pvt
->max
);
291 /* THIS CODE MUST MATCH THAT IN pwd_mkdb. */
293 l
= pvt
->line
+ pvt
->max
;
294 #define EXPAND(e) if ((e = t) == NULL) return (0); else \
295 do if (t >= l) return (0); while ((*t++ = *p++) != '\0')
296 #define SCALAR(v) if (t + sizeof v >= l) return (0); else \
297 (memmove(&(v), p, sizeof v), p += sizeof v)
298 EXPAND(pvt
->passwd
.pw_name
);
299 EXPAND(pvt
->passwd
.pw_passwd
);
300 SCALAR(pvt
->passwd
.pw_uid
);
301 SCALAR(pvt
->passwd
.pw_gid
);
302 SCALAR(pvt
->passwd
.pw_change
);
303 EXPAND(pvt
->passwd
.pw_class
);
304 EXPAND(pvt
->passwd
.pw_gecos
);
305 EXPAND(pvt
->passwd
.pw_dir
);
306 EXPAND(pvt
->passwd
.pw_shell
);
307 SCALAR(pvt
->passwd
.pw_expire
);
311 #endif /* WANT_IRS_PW */