1 /** $MirOS: src/bin/pax/cache.h,v 1.2 2012/02/12 00:27:15 tg Exp $ */ 2 /* $OpenBSD: cache.h,v 1.4 2003/10/20 06:22:27 jmc Exp $ */ 3 /* $NetBSD: cache.h,v 1.3 1995/03/21 09:07:12 cgd Exp $ */ 4 5 /*- 6 * Copyright (c) 1992 Keith Muller. 7 * Copyright (c) 1992, 1993 8 * The Regents of the University of California. All rights reserved. 9 * 10 * This code is derived from software contributed to Berkeley by 11 * Keith Muller of the University of California, San Diego. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * @(#)cache.h 8.1 (Berkeley) 5/31/93 38 */ 39 40 /* 41 * Constants and data structures used to implement group and password file 42 * caches. Traditional passwd/group cache routines perform quite poorly with 43 * archives. The chances of hitting a valid lookup with an archive is quite a 44 * bit worse than with files already resident on the file system. These misses 45 * create a MAJOR performance cost. To address this problem, these routines 46 * cache both hits and misses. 47 * 48 * NOTE: name lengths must be as large as those stored in ANY PROTOCOL and 49 * as stored in the passwd and group files. CACHE SIZES MUST BE PRIME 50 */ 51 #define UNMLEN 32 /* >= user name found in any protocol */ 52 #define GNMLEN 32 /* >= group name found in any protocol */ 53 #define UID_SZ 317 /* size of user_name/uid cache */ 54 #define UNM_SZ 317 /* size of user_name/uid cache */ 55 #define GID_SZ 251 /* size of gid cache */ 56 #define GNM_SZ 317 /* size of group name cache */ 57 #define VALID 1 /* entry and name are valid */ 58 #define INVALID 2 /* entry valid, name NOT valid */ 59 60 /* 61 * Node structures used in the user, group, uid, and gid caches. 62 */ 63 64 typedef struct uidc { 65 int valid; /* is this a valid or a miss entry */ 66 char name[UNMLEN]; /* uid name */ 67 uid_t uid; /* cached uid */ 68 } UIDC; 69 70 typedef struct gidc { 71 int valid; /* is this a valid or a miss entry */ 72 char name[GNMLEN]; /* gid name */ 73 gid_t gid; /* cached gid */ 74 } GIDC; 75