00001 /*- 00002 * Copyright (c) 1992 Keith Muller. 00003 * Copyright (c) 1992, 1993 00004 * The Regents of the University of California. All rights reserved. 00005 * 00006 * This code is derived from software contributed to Berkeley by 00007 * Keith Muller of the University of California, San Diego. 00008 * 00009 * Redistribution and use in source and binary forms, with or without 00010 * modification, are permitted provided that the following conditions 00011 * are met: 00012 * 1. Redistributions of source code must retain the above copyright 00013 * notice, this list of conditions and the following disclaimer. 00014 * 2. Redistributions in binary form must reproduce the above copyright 00015 * notice, this list of conditions and the following disclaimer in the 00016 * documentation and/or other materials provided with the distribution. 00017 * 4. Neither the name of the University nor the names of its contributors 00018 * may be used to endorse or promote products derived from this software 00019 * without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00022 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00023 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00024 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00025 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00026 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00027 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00028 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00029 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00030 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00031 * SUCH DAMAGE. 00032 * 00033 * @(#)cache.h 8.1 (Berkeley) 5/31/93 00034 * $FreeBSD: src/bin/pax/cache.h,v 1.9 2004/04/06 20:06:48 markm Exp $ 00035 */ 00036 00037 /* 00038 * Constants and data structures used to implement group and password file 00039 * caches. Traditional passwd/group cache routines perform quite poorly with 00040 * archives. The chances of hitting a valid lookup with an archive is quite a 00041 * bit worse than with files already resident on the file system. These misses 00042 * create a MAJOR performance cost. To address this problem, these routines 00043 * cache both hits and misses. 00044 * 00045 * NOTE: name lengths must be as large as those stored in ANY PROTOCOL and 00046 * as stored in the passwd and group files. CACHE SIZES MUST BE PRIME 00047 */ 00048 #define UNMLEN 32 /* >= user name found in any protocol */ 00049 #define GNMLEN 32 /* >= group name found in any protocol */ 00050 #define UID_SZ 317 /* size of user_name/uid cache */ 00051 #define UNM_SZ 317 /* size of user_name/uid cache */ 00052 #define GID_SZ 251 /* size of gid cache */ 00053 #define GNM_SZ 317 /* size of group name cache */ 00054 #define VALID 1 /* entry and name are valid */ 00055 #define INVALID 2 /* entry valid, name NOT valid */ 00056 00057 /* 00058 * Node structures used in the user, group, uid, and gid caches. 00059 */ 00060 00061 typedef struct uidc { 00062 int valid; /* is this a valid or a miss entry */ 00063 char name[UNMLEN]; /* uid name */ 00064 uid_t uid; /* cached uid */ 00065 } UIDC; 00066 00067 typedef struct gidc { 00068 int valid; /* is this a valid or a miss entry */ 00069 char name[GNMLEN]; /* gid name */ 00070 gid_t gid; /* cached gid */ 00071 } GIDC;
1.5.8