pwcache.h revision 241233 
1/*	$NetBSD: pwcache.h,v 1.5 2003/11/10 08:51:51 wiz Exp $	*/
2
3/*-
4 * Copyright (c) 1992 Keith Muller.
5 * Copyright (c) 1992, 1993
6 *	The Regents of the University of California.  All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * Keith Muller of the University of California, San Diego.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 *    notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 *    notice, this list of conditions and the following disclaimer in the
18 *    documentation and/or other materials provided with the distribution.
19 * 3. 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.
22 *
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
33 * SUCH DAMAGE.
34 *
35 *      @(#)cache.h	8.1 (Berkeley) 5/31/93
36 */
37
38/*
39 * Constants and data structures used to implement group and password file
40 * caches. Traditional passwd/group cache routines perform quite poorly with
41 * archives. The chances of hitting a valid lookup with an archive is quite a
42 * bit worse than with files already resident on the file system. These misses
43 * create a MAJOR performance cost. To address this problem, these routines
44 * cache both hits and misses.
45 *
46 * NOTE:  name lengths must be as large as those stored in ANY PROTOCOL and
47 * as stored in the passwd and group files. CACHE SIZES MUST BE PRIME
48 */
49#define UNMLEN		32	/* >= user name found in any protocol */
50#define GNMLEN		32	/* >= group name found in any protocol */
51#define UID_SZ		317	/* size of uid to user_name cache */
52#define UNM_SZ		317	/* size of user_name to uid cache */
53#define GID_SZ		251	/* size of gid to group_name cache */
54#define GNM_SZ		251	/* size of group_name to gid cache */
55#define VALID		1	/* entry and name are valid */
56#define INVALID		2	/* entry valid, name NOT valid */
57
58/*
59 * Node structures used in the user, group, uid, and gid caches.
60 */
61
62typedef struct uidc {
63	int valid;		/* is this a valid or a miss entry */
64	char name[UNMLEN];	/* uid name */
65	uid_t uid;		/* cached uid */
66} UIDC;
67
68typedef struct gidc {
69	int valid;		/* is this a valid or a miss entry */
70	char name[GNMLEN];	/* gid name */
71	gid_t gid;		/* cached gid */
72} GIDC;
73