source: trunk/minix/commands/pax/cache.h@ 21

Last change on this file since 21 was 9, checked in by Mattia Monga, 13 years ago

Minix 3.1.2a

File size: 3.2 KB
Line 
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 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 * @(#)cache.h 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/bin/pax/cache.h,v 1.9 2004/04/06 20:06:48 markm Exp $
35 */
36
37/*
38 * Constants and data structures used to implement group and password file
39 * caches. Traditional passwd/group cache routines perform quite poorly with
40 * archives. The chances of hitting a valid lookup with an archive is quite a
41 * bit worse than with files already resident on the file system. These misses
42 * create a MAJOR performance cost. To address this problem, these routines
43 * cache both hits and misses.
44 *
45 * NOTE: name lengths must be as large as those stored in ANY PROTOCOL and
46 * as stored in the passwd and group files. CACHE SIZES MUST BE PRIME
47 */
48#define UNMLEN 32 /* >= user name found in any protocol */
49#define GNMLEN 32 /* >= group name found in any protocol */
50#define UID_SZ 317 /* size of user_name/uid cache */
51#define UNM_SZ 317 /* size of user_name/uid cache */
52#define GID_SZ 251 /* size of gid cache */
53#define GNM_SZ 317 /* size of group name cache */
54#define VALID 1 /* entry and name are valid */
55#define INVALID 2 /* entry valid, name NOT valid */
56
57/*
58 * Node structures used in the user, group, uid, and gid caches.
59 */
60
61typedef struct uidc {
62 int valid; /* is this a valid or a miss entry */
63 char name[UNMLEN]; /* uid name */
64 uid_t uid; /* cached uid */
65} UIDC;
66
67typedef struct gidc {
68 int valid; /* is this a valid or a miss entry */
69 char name[GNMLEN]; /* gid name */
70 gid_t gid; /* cached gid */
71} GIDC;
Note: See TracBrowser for help on using the repository browser.