the list of command line files not selected was not being printed.

[unix-history] / usr / src / bin / pax / cache.h

/*-
* Copyright (c) 1992 Keith Muller.
* Copyright (c) 1992 The Regents of the University of California.
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Keith Muller of the University of California, San Diego.
*
* %sccs.include.redist.c%
*
*      @(#)cache.h     1.1 (Berkeley) %G%
*/

/*
* Constants and data structures used to implement group and password file
* caches. Traditional passwd/group cache routines perform quite poorly with
* archives. The chances of hitting a valid lookup with an archive is quite a
* bit worse than with files already resident on the file system. These misses
* create a MAJOR performance cost. To adress this problem, these routines
* cache both hits and misses.
*
* NOTE:  name lengths must be as large as those stored in ANY PROTOCOL and
* as stored in the passwd and group files. CACHE SIZES MUST BE PRIME
*/
#define UNMLEN          32      /* >= user name found in any protocol */
#define GNMLEN          32      /* >= group name found in any protocol */
#define UID_SZ          317     /* size of user_name/uid cache */
#define UNM_SZ          317     /* size of user_name/uid cache */
#define GID_SZ          251     /* size of gid cache */
#define GNM_SZ          317     /* size of group name cache */
#define VALID           1       /* entry and name are valid */
#define INVALID         2       /* entry valid, name NOT valid */

/*
* Node structures used in the user, group, uid, and gid caches.
*/

typedef struct uidc {
       int valid;              /* is this a valid or a miss entry */
       char name[UNMLEN];      /* uid name */
       uid_t uid;              /* cached uid */
} UIDC;

typedef struct gidc {
       int valid;              /* is this a valid or a miss entry */
       char name[GNMLEN];      /* gid name */
       gid_t gid;              /* cached gid */
} GIDC;