coda_namecache.h revision 1.3 1 1.3 rvb /* $NetBSD: coda_namecache.h,v 1.3 1998/09/12 15:05:50 rvb Exp $ */
2 1.2 rvb
3 1.1 rvb /*
4 1.2 rvb *
5 1.2 rvb * Coda: an Experimental Distributed File System
6 1.2 rvb * Release 3.1
7 1.2 rvb *
8 1.2 rvb * Copyright (c) 1987-1998 Carnegie Mellon University
9 1.2 rvb * All Rights Reserved
10 1.2 rvb *
11 1.2 rvb * Permission to use, copy, modify and distribute this software and its
12 1.2 rvb * documentation is hereby granted, provided that both the copyright
13 1.2 rvb * notice and this permission notice appear in all copies of the
14 1.2 rvb * software, derivative works or modified versions, and any portions
15 1.2 rvb * thereof, and that both notices appear in supporting documentation, and
16 1.2 rvb * that credit is given to Carnegie Mellon University in all documents
17 1.2 rvb * and publicity pertaining to direct or indirect use of this code or its
18 1.2 rvb * derivatives.
19 1.2 rvb *
20 1.2 rvb * CODA IS AN EXPERIMENTAL SOFTWARE SYSTEM AND IS KNOWN TO HAVE BUGS,
21 1.2 rvb * SOME OF WHICH MAY HAVE SERIOUS CONSEQUENCES. CARNEGIE MELLON ALLOWS
22 1.2 rvb * FREE USE OF THIS SOFTWARE IN ITS "AS IS" CONDITION. CARNEGIE MELLON
23 1.2 rvb * DISCLAIMS ANY LIABILITY OF ANY KIND FOR ANY DAMAGES WHATSOEVER
24 1.2 rvb * RESULTING DIRECTLY OR INDIRECTLY FROM THE USE OF THIS SOFTWARE OR OF
25 1.2 rvb * ANY DERIVATIVE WORK.
26 1.2 rvb *
27 1.2 rvb * Carnegie Mellon encourages users of this software to return any
28 1.2 rvb * improvements or extensions that they make, and to grant Carnegie
29 1.2 rvb * Mellon the rights to redistribute these changes without encumbrance.
30 1.2 rvb *
31 1.2 rvb * @(#) cfs/cfsnc.h,v 1.1.1.1 1998/08/29 21:26:46 rvb Exp $
32 1.2 rvb */
33 1.1 rvb
34 1.1 rvb /*
35 1.1 rvb * Mach Operating System
36 1.1 rvb * Copyright (c) 1990 Carnegie-Mellon University
37 1.1 rvb * Copyright (c) 1989 Carnegie-Mellon University
38 1.1 rvb * All rights reserved. The CMU software License Agreement specifies
39 1.1 rvb * the terms and conditions for use and redistribution.
40 1.1 rvb */
41 1.1 rvb
42 1.1 rvb /*
43 1.1 rvb * This code was written for the Coda file system at Carnegie Mellon University.
44 1.1 rvb * Contributers include David Steere, James Kistler, and M. Satyanarayanan.
45 1.1 rvb */
46 1.1 rvb
47 1.1 rvb /*
48 1.1 rvb * HISTORY
49 1.1 rvb * $Log: coda_namecache.h,v $
50 1.3 rvb * Revision 1.3 1998/09/12 15:05:50 rvb
51 1.3 rvb * Change cfs/CFS in symbols, strings and constants to coda/CODA
52 1.3 rvb * to avoid fs conflicts.
53 1.2 rvb *
54 1.2 rvb * Revision 1.2 1998/09/08 17:12:48 rvb
55 1.2 rvb * Pass2 complete
56 1.1 rvb *
57 1.1 rvb * Revision 1.1.1.1 1998/08/29 21:26:46 rvb
58 1.1 rvb * Very Preliminary Coda
59 1.1 rvb *
60 1.1 rvb * Revision 1.8 1998/08/28 18:12:25 rvb
61 1.1 rvb * Now it also works on FreeBSD -current. This code will be
62 1.1 rvb * committed to the FreeBSD -current and NetBSD -current
63 1.1 rvb * trees. It will then be tailored to the particular platform
64 1.1 rvb * by flushing conditional code.
65 1.1 rvb *
66 1.1 rvb * Revision 1.7 1998/08/18 17:05:24 rvb
67 1.1 rvb * Don't use __RCSID now
68 1.1 rvb *
69 1.3 rvb * Revision 1.6 1998/08/18 16:31:49 rvb
70 1.1 rvb * Sync the code for NetBSD -current; test on 1.3 later
71 1.1 rvb *
72 1.1 rvb * Revision 1.5 98/01/23 11:53:51 rvb
73 1.1 rvb * Bring RVB_CODA1_1 to HEAD
74 1.1 rvb *
75 1.1 rvb * Revision 1.4.2.1 97/12/16 12:40:23 rvb
76 1.1 rvb * Sync with 1.3
77 1.1 rvb *
78 1.1 rvb * Revision 1.4 97/12/05 10:39:29 rvb
79 1.1 rvb * Read CHANGES
80 1.1 rvb *
81 1.1 rvb * Revision 1.3.4.3 97/11/24 15:44:51 rvb
82 1.1 rvb * Final cfs_venus.c w/o macros, but one locking bug
83 1.1 rvb *
84 1.1 rvb * Revision 1.3.4.2 97/11/12 12:09:44 rvb
85 1.1 rvb * reorg pass1
86 1.1 rvb *
87 1.3 rvb * Revision 1.3.4.1 97/11/06 21:06:05 rvb
88 1.1 rvb * don't include headers in headers
89 1.1 rvb *
90 1.1 rvb * Revision 1.3 97/08/05 11:08:19 lily
91 1.1 rvb * Removed cfsnc_replace, replaced it with a coda_find, unhash, and
92 1.1 rvb * rehash. This fixes a cnode leak and a bug in which the fid is
93 1.1 rvb * not actually replaced. (cfs_namecache.c, cfsnc.h, cfs_subr.c)
94 1.1 rvb *
95 1.3 rvb * Revision 1.2 96/01/02 16:57:19 bnoble
96 1.1 rvb * Added support for Coda MiniCache and raw inode calls (final commit)
97 1.1 rvb *
98 1.1 rvb * Revision 1.1.2.1 1995/12/20 01:57:45 bnoble
99 1.1 rvb * Added CODA-specific files
100 1.1 rvb *
101 1.1 rvb * Revision 3.1.1.1 1995/03/04 19:08:22 bnoble
102 1.1 rvb * Branch for NetBSD port revisions
103 1.1 rvb *
104 1.3 rvb * Revision 3.1 1995/03/04 19:08:21 bnoble
105 1.1 rvb * Bump to major revision 3 to prepare for NetBSD port
106 1.1 rvb *
107 1.1 rvb * Revision 2.2 1994/08/28 19:37:39 luqi
108 1.3 rvb * Add a new CODA_REPLACE call to allow venus to replace a ViceFid in the
109 1.1 rvb * mini-cache.
110 1.1 rvb *
111 1.1 rvb * In "cfs.h":
112 1.1 rvb * Add CODA_REPLACE decl.
113 1.1 rvb *
114 1.3 rvb * In "cfs_namecache.c":
115 1.1 rvb * Add routine cfsnc_replace.
116 1.1 rvb *
117 1.3 rvb * In "cfs_subr.c":
118 1.1 rvb * Add case-statement to process CODA_REPLACE.
119 1.1 rvb *
120 1.1 rvb * In "cfsnc.h":
121 1.1 rvb * Add decl for CODA_NC_REPLACE.
122 1.1 rvb *
123 1.1 rvb * Revision 2.1 94/07/21 16:25:27 satya
124 1.1 rvb * Conversion to C++ 3.0; start of Coda Release 2.0
125 1.1 rvb *
126 1.1 rvb * Revision 1.2 92/10/27 17:58:34 lily
127 1.1 rvb * merge kernel/latest and alpha/src/cfs
128 1.1 rvb *
129 1.1 rvb * Revision 2.2 90/07/05 11:27:04 mrt
130 1.1 rvb * Created for the Coda File System.
131 1.1 rvb * [90/05/23 dcs]
132 1.1 rvb *
133 1.1 rvb * Revision 1.4 90/05/31 17:02:12 dcs
134 1.2 rvb * Prepare for merge with facilities kernel.
135 1.3 rvb *
136 1.3 rvb *
137 1.1 rvb */
138 1.1 rvb
139 1.3 rvb #ifndef _CODA_NC_HEADER_
140 1.1 rvb #define _CODA_NC_HEADER_
141 1.3 rvb
142 1.3 rvb /*
143 1.3 rvb * Coda constants
144 1.1 rvb */
145 1.1 rvb #define CODA_NC_NAMELEN 15 /* longest name stored in cache */
146 1.1 rvb #define CODA_NC_CACHESIZE 256 /* Default cache size */
147 1.1 rvb #define CODA_NC_HASHSIZE 64 /* Must be multiple of 2 */
148 1.1 rvb
149 1.1 rvb /*
150 1.1 rvb * Hash function for the primary hash.
151 1.1 rvb */
152 1.1 rvb
153 1.1 rvb /*
154 1.1 rvb * First try -- (first + last letters + length + (int)cp) mod size
155 1.3 rvb * 2nd try -- same, except dir fid.vnode instead of cp
156 1.3 rvb */
157 1.1 rvb
158 1.3 rvb #ifdef oldhash
159 1.3 rvb #define CODA_NC_HASH(name, namelen, cp) \
160 1.1 rvb ((name[0] + name[namelen-1] + namelen + (int)(cp)) & (coda_nc_hashsize-1))
161 1.1 rvb #else
162 1.3 rvb #define CODA_NC_HASH(name, namelen, cp) \
163 1.1 rvb ((name[0] + (name[namelen-1]<<4) + namelen + (((int)cp)>>8)) & (coda_nc_hashsize-1))
164 1.1 rvb #endif
165 1.1 rvb
166 1.1 rvb #define CODA_NAMEMATCH(cp, name, namelen, dcp) \
167 1.1 rvb ((namelen == cp->namelen) && (dcp == cp->dcp) && \
168 1.1 rvb (bcmp(cp->name,name,namelen) == 0))
169 1.1 rvb
170 1.1 rvb /*
171 1.1 rvb * Functions to modify the hash and lru chains.
172 1.3 rvb * insque and remque assume that the pointers are the first thing
173 1.3 rvb * in the list node, thus the trickery for lru.
174 1.3 rvb */
175 1.1 rvb
176 1.1 rvb #define CODA_NC_HSHINS(elem, pred) insque(elem,pred)
177 1.3 rvb #define CODA_NC_HSHREM(elem) remque(elem)
178 1.3 rvb #define CODA_NC_HSHNUL(elem) (elem)->hash_next = \
179 1.3 rvb (elem)->hash_prev = (elem)
180 1.1 rvb
181 1.3 rvb #define CODA_NC_LRUINS(elem, pred) insque(LRU_PART(elem), LRU_PART(pred))
182 1.1 rvb #define CODA_NC_LRUREM(elem) remque(LRU_PART(elem));
183 1.3 rvb #define CODA_NC_LRUGET(lruhead) LRU_TOP((lruhead).lru_prev)
184 1.3 rvb
185 1.3 rvb #define CODA_NC_VALID(cncp) (cncp->dcp != (struct cnode *)0)
186 1.3 rvb
187 1.3 rvb #define LRU_PART(cncp) (struct coda_cache *) \
188 1.3 rvb ((char *)cncp + (2*sizeof(struct coda_cache *)))
189 1.3 rvb #define LRU_TOP(cncp) (struct coda_cache *) \
190 1.1 rvb ((char *)cncp - (2*sizeof(struct coda_cache *)))
191 1.1 rvb #define DATA_PART(cncp) (struct coda_cache *) \
192 1.3 rvb ((char *)cncp + (4*sizeof(struct coda_cache *)))
193 1.1 rvb #define DATA_SIZE (sizeof(struct coda_cache)-(4*sizeof(struct coda_cache *)))
194 1.3 rvb
195 1.1 rvb /*
196 1.1 rvb * Structure for an element in the CODA Name Cache.
197 1.1 rvb * NOTE: I use the position of arguments and their size in the
198 1.3 rvb * implementation of the functions CODA_NC_LRUINS, CODA_NC_LRUREM, and
199 1.3 rvb * DATA_PART.
200 1.3 rvb */
201 1.1 rvb
202 1.1 rvb struct coda_cache {
203 1.1 rvb struct coda_cache *hash_next,*hash_prev; /* Hash list */
204 1.3 rvb struct coda_cache *lru_next, *lru_prev; /* LRU list */
205 1.1 rvb struct cnode *cp; /* vnode of the file */
206 1.1 rvb struct cnode *dcp; /* parent's cnode */
207 1.1 rvb struct ucred *cred; /* user credentials */
208 1.3 rvb char name[CODA_NC_NAMELEN]; /* segment name */
209 1.1 rvb int namelen; /* length of name */
210 1.3 rvb };
211 1.1 rvb
212 1.1 rvb struct coda_lru { /* Start of LRU chain */
213 1.1 rvb char *dummy1, *dummy2; /* place holders */
214 1.3 rvb struct coda_cache *lru_next, *lru_prev; /* position of pointers is important */
215 1.3 rvb };
216 1.1 rvb
217 1.1 rvb
218 1.1 rvb struct coda_hash { /* Start of Hash chain */
219 1.1 rvb struct coda_cache *hash_next, *hash_prev; /* NOTE: chain pointers must be first */
220 1.1 rvb int length; /* used for tuning purposes */
221 1.1 rvb };
222 1.3 rvb
223 1.1 rvb
224 1.3 rvb /*
225 1.1 rvb * Symbols to aid in debugging the namecache code. Assumes the existence
226 1.1 rvb * of the variable coda_nc_debug, which is defined in cfs_namecache.c
227 1.3 rvb */
228 1.3 rvb #define CODA_NC_DEBUG(N, STMT) { if (coda_nc_debug & (1 <<N)) { STMT } }
229 1.3 rvb
230 1.3 rvb /* Prototypes of functions exported within cfs */
231 1.3 rvb extern void coda_nc_init(void);
232 1.3 rvb extern void coda_nc_enter(struct cnode *, const char *, int, struct ucred *, struct cnode *);
233 1.3 rvb extern struct cnode *coda_nc_lookup(struct cnode *, const char *, int, struct ucred *);
234 1.3 rvb
235 1.3 rvb extern void coda_nc_zapParentfid(ViceFid *, enum dc_status);
236 1.3 rvb extern void coda_nc_zapfid(ViceFid *, enum dc_status);
237 1.3 rvb extern void coda_nc_zapvnode(ViceFid *, struct ucred *, enum dc_status);
238 1.3 rvb extern void coda_nc_zapfile(struct cnode *, const char *, int);
239 1.3 rvb extern void coda_nc_purge_user(vuid_t, enum dc_status);
240 1.3 rvb extern void coda_nc_flush(enum dc_status);
241 1.3 rvb
242 1.1 rvb extern void print_coda_nc(void);
243 1.1 rvb extern void coda_nc_gather_stats(void);
244 1.1 rvb extern int coda_nc_resize(int, int, enum dc_status);
245 1.1 rvb extern void coda_nc_name(struct cnode *cp);
246 1.1 rvb
247 1.3 rvb /*
248 1.1 rvb * Structure to contain statistics on the cache usage
249 1.1 rvb */
250 1.1 rvb
251 1.1 rvb struct coda_nc_statistics {
252 1.1 rvb unsigned hits;
253 1.1 rvb unsigned misses;
254 1.1 rvb unsigned enters;
255 1.1 rvb unsigned dbl_enters;
256 1.1 rvb unsigned long_name_enters;
257 1.1 rvb unsigned long_name_lookups;
258 1.1 rvb unsigned long_remove;
259 1.1 rvb unsigned lru_rm;
260 1.1 rvb unsigned zapPfids;
261 1.1 rvb unsigned zapFids;
262 1.1 rvb unsigned zapFile;
263 1.1 rvb unsigned zapUsers;
264 1.1 rvb unsigned Flushes;
265 1.1 rvb unsigned Sum_bucket_len;
266 1.1 rvb unsigned Sum2_bucket_len;
267 1.1 rvb unsigned Max_bucket_len;
268 1.3 rvb unsigned Num_zero_len;
269 1.3 rvb unsigned Search_len;
270 1.3 rvb };
271 1.3 rvb
272 1.3 rvb #define CODA_NC_FIND ((u_long) 1)
273 1.3 rvb #define CODA_NC_REMOVE ((u_long) 2)
274 1.3 rvb #define CODA_NC_INIT ((u_long) 3)
275 1.3 rvb #define CODA_NC_ENTER ((u_long) 4)
276 1.3 rvb #define CODA_NC_LOOKUP ((u_long) 5)
277 1.3 rvb #define CODA_NC_ZAPPFID ((u_long) 6)
278 1.3 rvb #define CODA_NC_ZAPFID ((u_long) 7)
279 1.3 rvb #define CODA_NC_ZAPVNODE ((u_long) 8)
280 1.3 rvb #define CODA_NC_ZAPFILE ((u_long) 9)
281 1.1 rvb #define CODA_NC_PURGEUSER ((u_long) 10)
282 1.1 rvb #define CODA_NC_FLUSH ((u_long) 11)
283 #define CODA_NC_PRINTCODA_NC ((u_long) 12)
284 #define CODA_NC_PRINTSTATS ((u_long) 13)
285
286 #endif /* _CFSNC_HEADER_ */
287