Sync ACPICA with Intel's version 20170831.
[dragonfly.git] / bin / pax / cache.h
blobf8e813ef6c273dc4dda93096d0e97bc8db27a7cf
1 /*-
2 * Copyright (c) 1992 Keith Muller.
3 * Copyright (c) 1992, 1993
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * Keith Muller of the University of California, San Diego.
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. 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.
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.
33 * @(#)cache.h 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/bin/pax/cache.h,v 1.6 1999/08/27 23:14:40 peter Exp $
35 * $DragonFly: src/bin/pax/cache.h,v 1.2 2003/06/17 04:22:50 dillon Exp $
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.
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
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 user_name/uid cache */
52 #define UNM_SZ 317 /* size of user_name/uid cache */
53 #define GID_SZ 251 /* size of gid cache */
54 #define GNM_SZ 317 /* size of group name cache */
55 #define VALID 1 /* entry and name are valid */
56 #define INVALID 2 /* entry valid, name NOT valid */
59 * Node structures used in the user, group, uid, and gid caches.
62 typedef 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;
68 typedef 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;