pax/cache.h

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