gitweb.dragonflybsd.org Git - dragonfly.git/blame_incremental

... / ...

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