coda_subr.c revision 1.4 1 1.4 rvb /* $NetBSD: coda_subr.c,v 1.4 1998/09/15 02:02:59 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.4 rvb * @(#) coda/coda_subr.c,v 1.1.1.1 1998/08/29 21:26:45 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) 1989 Carnegie-Mellon University
37 1.1 rvb * All rights reserved. The CMU software License Agreement specifies
38 1.1 rvb * the terms and conditions for use and redistribution.
39 1.1 rvb */
40 1.1 rvb
41 1.1 rvb /*
42 1.1 rvb * This code was written for the Coda file system at Carnegie Mellon
43 1.1 rvb * University. Contributers include David Steere, James Kistler, and
44 1.1 rvb * M. Satyanarayanan. */
45 1.1 rvb
46 1.1 rvb /*
47 1.1 rvb * HISTORY
48 1.4 rvb * $Log: coda_subr.c,v $
49 1.4 rvb * Revision 1.4 1998/09/15 02:02:59 rvb
50 1.4 rvb * Final piece of rename cfs->coda
51 1.4 rvb *
52 1.4 rvb * Revision 1.3 1998/09/12 15:05:49 rvb
53 1.3 rvb * Change cfs/CFS in symbols, strings and constants to coda/CODA
54 1.3 rvb * to avoid fs conflicts.
55 1.3 rvb *
56 1.2 rvb * Revision 1.2 1998/09/08 17:12:47 rvb
57 1.2 rvb * Pass2 complete
58 1.2 rvb *
59 1.1 rvb * Revision 1.1.1.1 1998/08/29 21:26:45 rvb
60 1.1 rvb * Very Preliminary Coda
61 1.1 rvb *
62 1.1 rvb * Revision 1.11 1998/08/28 18:12:18 rvb
63 1.1 rvb * Now it also works on FreeBSD -current. This code will be
64 1.1 rvb * committed to the FreeBSD -current and NetBSD -current
65 1.1 rvb * trees. It will then be tailored to the particular platform
66 1.1 rvb * by flushing conditional code.
67 1.1 rvb *
68 1.1 rvb * Revision 1.10 1998/08/18 17:05:16 rvb
69 1.1 rvb * Don't use __RCSID now
70 1.1 rvb *
71 1.1 rvb * Revision 1.9 1998/08/18 16:31:41 rvb
72 1.1 rvb * Sync the code for NetBSD -current; test on 1.3 later
73 1.1 rvb *
74 1.1 rvb * Revision 1.8 98/01/31 20:53:12 rvb
75 1.3 rvb * First version that works on FreeBSD 2.2.5
76 1.1 rvb *
77 1.1 rvb * Revision 1.7 98/01/23 11:53:42 rvb
78 1.1 rvb * Bring RVB_CODA1_1 to HEAD
79 1.1 rvb *
80 1.1 rvb * Revision 1.6.2.3 98/01/23 11:21:05 rvb
81 1.1 rvb * Sync with 2.2.5
82 1.1 rvb *
83 1.1 rvb * Revision 1.6.2.2 97/12/16 12:40:06 rvb
84 1.1 rvb * Sync with 1.3
85 1.1 rvb *
86 1.1 rvb * Revision 1.6.2.1 97/12/06 17:41:21 rvb
87 1.1 rvb * Sync with peters coda.h
88 1.1 rvb *
89 1.1 rvb * Revision 1.6 97/12/05 10:39:17 rvb
90 1.1 rvb * Read CHANGES
91 1.1 rvb *
92 1.1 rvb * Revision 1.5.4.8 97/11/26 15:28:58 rvb
93 1.1 rvb * Cant make downcall pbuf == union cfs_downcalls yet
94 1.1 rvb *
95 1.1 rvb * Revision 1.5.4.7 97/11/20 11:46:42 rvb
96 1.1 rvb * Capture current cfs_venus
97 1.1 rvb *
98 1.1 rvb * Revision 1.5.4.6 97/11/18 10:27:16 rvb
99 1.1 rvb * cfs_nbsd.c is DEAD!!!; integrated into cfs_vf/vnops.c
100 1.1 rvb * cfs_nb_foo and cfs_foo are joined
101 1.1 rvb *
102 1.1 rvb * Revision 1.5.4.5 97/11/13 22:03:00 rvb
103 1.1 rvb * pass2 cfs_NetBSD.h mt
104 1.1 rvb *
105 1.1 rvb * Revision 1.5.4.4 97/11/12 12:09:39 rvb
106 1.1 rvb * reorg pass1
107 1.1 rvb *
108 1.1 rvb * Revision 1.5.4.3 97/11/06 21:02:38 rvb
109 1.1 rvb * first pass at ^c ^z
110 1.1 rvb *
111 1.1 rvb * Revision 1.5.4.2 97/10/29 16:06:27 rvb
112 1.1 rvb * Kill DYING
113 1.1 rvb *
114 1.1 rvb * Revision 1.5.4.1 97/10/28 23:10:16 rvb
115 1.3 rvb * >64Meg; venus can be killed!
116 1.1 rvb *
117 1.1 rvb * Revision 1.5 97/08/05 11:08:17 lily
118 1.1 rvb * Removed cfsnc_replace, replaced it with a coda_find, unhash, and
119 1.1 rvb * rehash. This fixes a cnode leak and a bug in which the fid is
120 1.1 rvb * not actually replaced. (cfs_namecache.c, cfsnc.h, cfs_subr.c)
121 1.1 rvb *
122 1.1 rvb * Revision 1.4 96/12/12 22:10:59 bnoble
123 1.1 rvb * Fixed the "downcall invokes venus operation" deadlock in all known cases.
124 1.1 rvb * There may be more
125 1.1 rvb *
126 1.1 rvb * Revision 1.3 1996/12/05 16:20:15 bnoble
127 1.1 rvb * Minor debugging aids
128 1.1 rvb *
129 1.1 rvb * Revision 1.2 1996/01/02 16:57:01 bnoble
130 1.3 rvb * Added support for Coda MiniCache and raw inode calls (final commit)
131 1.1 rvb *
132 1.1 rvb * Revision 1.1.2.1 1995/12/20 01:57:27 bnoble
133 1.1 rvb * Added CODA-specific files
134 1.1 rvb *
135 1.1 rvb * Revision 3.1.1.1 1995/03/04 19:07:59 bnoble
136 1.1 rvb * Branch for NetBSD port revisions
137 1.1 rvb *
138 1.1 rvb * Revision 3.1 1995/03/04 19:07:58 bnoble
139 1.1 rvb * Bump to major revision 3 to prepare for NetBSD port
140 1.1 rvb *
141 1.1 rvb * Revision 2.8 1995/03/03 17:00:04 dcs
142 1.1 rvb * Fixed kernel bug involving sleep and upcalls. Basically if you killed
143 1.1 rvb * a job waiting on venus, the venus upcall queues got trashed. Depending
144 1.1 rvb * on luck, you could kill the kernel or not.
145 1.1 rvb * (mods to cfs_subr.c and cfs_mach.d)
146 1.1 rvb *
147 1.1 rvb * Revision 2.7 95/03/02 22:45:21 dcs
148 1.1 rvb * Sun4 compatibility
149 1.1 rvb *
150 1.1 rvb * Revision 2.6 95/02/17 16:25:17 dcs
151 1.1 rvb * These versions represent several changes:
152 1.1 rvb * 1. Allow venus to restart even if outstanding references exist.
153 1.1 rvb * 2. Have only one ctlvp per client, as opposed to one per mounted cfs device.d
154 1.1 rvb * 3. Allow ody_expand to return many members, not just one.
155 1.1 rvb *
156 1.1 rvb * Revision 2.5 94/11/09 15:56:26 dcs
157 1.1 rvb * Had the thread sleeping on the wrong thing!
158 1.1 rvb *
159 1.1 rvb * Revision 2.4 94/10/14 09:57:57 dcs
160 1.1 rvb * Made changes 'cause sun4s have braindead compilers
161 1.1 rvb *
162 1.1 rvb * Revision 2.3 94/10/12 16:46:26 dcs
163 1.1 rvb * Cleaned kernel/venus interface by removing XDR junk, plus
164 1.1 rvb * so cleanup to allow this code to be more easily ported.
165 1.1 rvb *
166 1.1 rvb * Revision 1.2 92/10/27 17:58:22 lily
167 1.1 rvb * merge kernel/latest and alpha/src/cfs
168 1.3 rvb *
169 1.1 rvb * Revision 2.4 92/09/30 14:16:26 mja
170 1.1 rvb * Incorporated Dave Steere's fix for the GNU-Emacs bug.
171 1.1 rvb * Also, included his coda_flush routine in place of the former coda_nc_flush.
172 1.1 rvb * [91/02/07 jjk]
173 1.1 rvb *
174 1.1 rvb * Added contributors blurb.
175 1.1 rvb * [90/12/13 jjk]
176 1.1 rvb *
177 1.1 rvb * Hack to allow users to keep coda venus calls uninterruptible. THis
178 1.1 rvb * basically prevents the Gnu-emacs bug from appearing, in which a call
179 1.1 rvb * was being interrupted, and return EINTR, but gnu didn't check for the
180 1.1 rvb * error and figured the file was buggered.
181 1.1 rvb * [90/12/09 dcs]
182 1.1 rvb *
183 1.1 rvb * Revision 2.3 90/08/10 10:23:20 mrt
184 1.1 rvb * Removed include of vm/vm_page.h as it no longer exists.
185 1.1 rvb * [90/08/10 mrt]
186 1.1 rvb *
187 1.1 rvb * Revision 2.2 90/07/05 11:26:35 mrt
188 1.1 rvb * Initialize name cache on first call to vcopen.
189 1.1 rvb * [90/05/23 dcs]
190 1.1 rvb *
191 1.1 rvb * Created for the Coda File System.
192 1.1 rvb * [90/05/23 dcs]
193 1.1 rvb *
194 1.1 rvb * Revision 1.5 90/05/31 17:01:35 dcs
195 1.1 rvb * Prepare for merge with facilities kernel.
196 1.1 rvb *
197 1.1 rvb * Revision 1.2 90/03/19 15:56:25 dcs
198 1.1 rvb * Initialize name cache on first call to vcopen.
199 1.1 rvb *
200 1.1 rvb * Revision 1.1 90/03/15 10:43:26 jjk
201 1.1 rvb * Initial revision
202 1.1 rvb *
203 1.3 rvb */
204 1.1 rvb
205 1.3 rvb /* NOTES: rvb
206 1.1 rvb * 1. Added coda_unmounting to mark all cnodes as being UNMOUNTING. This has to
207 1.3 rvb * be done before dounmount is called. Because some of the routines that
208 1.1 rvb * dounmount calls before coda_unmounted might try to force flushes to venus.
209 1.1 rvb * The vnode pager does this.
210 1.3 rvb * 2. coda_unmounting marks all cnodes scanning coda_cache.
211 1.1 rvb * 3. cfs_checkunmounting (under DEBUG) checks all cnodes by chasing the vnodes
212 1.1 rvb * under the /coda mount point.
213 1.3 rvb * 4. coda_cacheprint (under DEBUG) prints names with vnode/cnode address
214 1.1 rvb */
215 1.1 rvb
216 1.1 rvb #include <vcoda.h>
217 1.1 rvb
218 1.1 rvb #include <sys/param.h>
219 1.1 rvb #include <sys/systm.h>
220 1.1 rvb #include <sys/malloc.h>
221 1.1 rvb #include <sys/proc.h>
222 1.4 rvb #include <sys/select.h>
223 1.4 rvb #include <sys/mount.h>
224 1.4 rvb
225 1.4 rvb #include <coda/coda.h>
226 1.1 rvb #include <coda/cnode.h>
227 1.3 rvb #include <coda/coda_subr.h>
228 1.3 rvb #include <coda/coda_namecache.h>
229 1.3 rvb
230 1.1 rvb int coda_active = 0;
231 1.3 rvb int coda_reuse = 0;
232 1.3 rvb int coda_new = 0;
233 1.1 rvb
234 1.3 rvb struct cnode *coda_freelist = NULL;
235 1.3 rvb struct cnode *coda_cache[CODA_CACHESIZE];
236 1.1 rvb
237 1.1 rvb #define coda_hash(fid) \
238 1.1 rvb (((fid)->Volume + (fid)->Vnode) & (CODA_CACHESIZE-1))
239 1.1 rvb
240 1.1 rvb #define CNODE_NEXT(cp) ((cp)->c_next)
241 1.1 rvb
242 1.1 rvb #define ODD(vnode) ((vnode) & 0x1)
243 1.1 rvb
244 1.1 rvb /*
245 1.3 rvb * Allocate a cnode.
246 1.1 rvb */
247 1.1 rvb struct cnode *
248 1.1 rvb coda_alloc(void)
249 1.3 rvb {
250 1.3 rvb struct cnode *cp;
251 1.3 rvb
252 1.3 rvb if (coda_freelist) {
253 1.1 rvb cp = coda_freelist;
254 1.1 rvb coda_freelist = CNODE_NEXT(cp);
255 1.3 rvb coda_reuse++;
256 1.1 rvb }
257 1.1 rvb else {
258 1.1 rvb CODA_ALLOC(cp, struct cnode *, sizeof(struct cnode));
259 1.1 rvb /* NetBSD vnodes don't have any Pager info in them ('cause there are
260 1.3 rvb no external pagers, duh!) */
261 1.1 rvb #define VNODE_VM_INFO_INIT(vp) /* MT */
262 1.1 rvb VNODE_VM_INFO_INIT(CTOV(cp));
263 1.1 rvb coda_new++;
264 1.1 rvb }
265 1.1 rvb bzero(cp, sizeof (struct cnode));
266 1.1 rvb
267 1.1 rvb return(cp);
268 1.1 rvb }
269 1.1 rvb
270 1.1 rvb /*
271 1.3 rvb * Deallocate a cnode.
272 1.1 rvb */
273 1.1 rvb void
274 1.1 rvb coda_free(cp)
275 1.3 rvb register struct cnode *cp;
276 1.3 rvb {
277 1.1 rvb
278 1.1 rvb CNODE_NEXT(cp) = coda_freelist;
279 1.1 rvb coda_freelist = cp;
280 1.1 rvb }
281 1.1 rvb
282 1.1 rvb /*
283 1.3 rvb * Put a cnode in the hash table
284 1.1 rvb */
285 1.1 rvb void
286 1.3 rvb coda_save(cp)
287 1.3 rvb struct cnode *cp;
288 1.1 rvb {
289 1.1 rvb CNODE_NEXT(cp) = coda_cache[coda_hash(&cp->c_fid)];
290 1.1 rvb coda_cache[coda_hash(&cp->c_fid)] = cp;
291 1.1 rvb }
292 1.1 rvb
293 1.1 rvb /*
294 1.3 rvb * Remove a cnode from the hash table
295 1.1 rvb */
296 1.1 rvb void
297 1.1 rvb coda_unsave(cp)
298 1.1 rvb struct cnode *cp;
299 1.1 rvb {
300 1.3 rvb struct cnode *ptr;
301 1.1 rvb struct cnode *ptrprev = NULL;
302 1.1 rvb
303 1.1 rvb ptr = coda_cache[coda_hash(&cp->c_fid)];
304 1.3 rvb while (ptr != NULL) {
305 1.1 rvb if (ptr == cp) {
306 1.1 rvb if (ptrprev == NULL) {
307 1.1 rvb coda_cache[coda_hash(&cp->c_fid)]
308 1.1 rvb = CNODE_NEXT(ptr);
309 1.1 rvb } else {
310 1.1 rvb CNODE_NEXT(ptrprev) = CNODE_NEXT(ptr);
311 1.1 rvb }
312 1.1 rvb CNODE_NEXT(cp) = (struct cnode *)NULL;
313 1.1 rvb
314 1.1 rvb return;
315 1.1 rvb }
316 1.1 rvb ptrprev = ptr;
317 1.1 rvb ptr = CNODE_NEXT(ptr);
318 1.1 rvb }
319 1.1 rvb }
320 1.1 rvb
321 1.1 rvb /*
322 1.1 rvb * Lookup a cnode by fid. If the cnode is dying, it is bogus so skip it.
323 1.3 rvb * NOTE: this allows multiple cnodes with same fid -- dcs 1/25/95
324 1.1 rvb */
325 1.1 rvb struct cnode *
326 1.1 rvb coda_find(fid)
327 1.1 rvb ViceFid *fid;
328 1.3 rvb {
329 1.1 rvb struct cnode *cp;
330 1.1 rvb
331 1.1 rvb cp = coda_cache[coda_hash(fid)];
332 1.1 rvb while (cp) {
333 1.1 rvb if ((cp->c_fid.Vnode == fid->Vnode) &&
334 1.1 rvb (cp->c_fid.Volume == fid->Volume) &&
335 1.3 rvb (cp->c_fid.Unique == fid->Unique) &&
336 1.1 rvb (!IS_UNMOUNTING(cp)))
337 1.1 rvb {
338 1.1 rvb coda_active++;
339 1.1 rvb return(cp);
340 1.1 rvb }
341 1.1 rvb cp = CNODE_NEXT(cp);
342 1.1 rvb }
343 1.1 rvb return(NULL);
344 1.3 rvb }
345 1.1 rvb
346 1.1 rvb /*
347 1.1 rvb * coda_kill is called as a side effect to vcopen. To prevent any
348 1.3 rvb * cnodes left around from an earlier run of a venus or warden from
349 1.1 rvb * causing problems with the new instance, mark any outstanding cnodes
350 1.3 rvb * as dying. Future operations on these cnodes should fail (excepting
351 1.1 rvb * coda_inactive of course!). Since multiple venii/wardens can be
352 1.1 rvb * running, only kill the cnodes for a particular entry in the
353 1.3 rvb * coda_mnttbl. -- DCS 12/1/94 */
354 1.1 rvb
355 1.1 rvb int
356 1.1 rvb coda_kill(whoIam, dcstat)
357 1.1 rvb struct mount *whoIam;
358 1.1 rvb enum dc_status dcstat;
359 1.1 rvb {
360 1.1 rvb int hash, count = 0;
361 1.1 rvb struct cnode *cp;
362 1.1 rvb
363 1.1 rvb /*
364 1.1 rvb * Algorithm is as follows:
365 1.1 rvb * Second, flush whatever vnodes we can from the name cache.
366 1.2 rvb *
367 1.1 rvb * Finally, step through whatever is left and mark them dying.
368 1.1 rvb * This prevents any operation at all.
369 1.1 rvb
370 1.1 rvb */
371 1.1 rvb
372 1.3 rvb /* This is slightly overkill, but should work. Eventually it'd be
373 1.1 rvb * nice to only flush those entries from the namecache that
374 1.3 rvb * reference a vnode in this vfs. */
375 1.3 rvb coda_nc_flush(dcstat);
376 1.1 rvb
377 1.1 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
378 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
379 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
380 1.1 rvb #ifdef DEBUG
381 1.3 rvb printf("coda_kill: vp %p, cp %p\n", CTOV(cp), cp);
382 1.1 rvb #endif
383 1.1 rvb count++;
384 1.1 rvb CODADEBUG(CODA_FLUSH,
385 1.1 rvb myprintf(("Live cnode fid %lx.%lx.%lx flags %d count %d\n",
386 1.1 rvb (cp->c_fid).Volume,
387 1.1 rvb (cp->c_fid).Vnode,
388 1.1 rvb (cp->c_fid).Unique,
389 1.1 rvb cp->c_flags,
390 1.1 rvb CTOV(cp)->v_usecount)); );
391 1.1 rvb }
392 1.1 rvb }
393 1.1 rvb }
394 1.1 rvb return count;
395 1.1 rvb }
396 1.1 rvb
397 1.1 rvb /*
398 1.1 rvb * There are two reasons why a cnode may be in use, it may be in the
399 1.3 rvb * name cache or it may be executing.
400 1.1 rvb */
401 1.1 rvb void
402 1.1 rvb coda_flush(dcstat)
403 1.1 rvb enum dc_status dcstat;
404 1.1 rvb {
405 1.3 rvb int hash;
406 1.3 rvb struct cnode *cp;
407 1.1 rvb
408 1.3 rvb coda_clstat.ncalls++;
409 1.1 rvb coda_clstat.reqs[CODA_FLUSH]++;
410 1.3 rvb
411 1.3 rvb coda_nc_flush(dcstat); /* flush files from the name cache */
412 1.1 rvb
413 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
414 1.1 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
415 1.1 rvb if (!ODD(cp->c_fid.Vnode)) /* only files can be executed */
416 1.1 rvb coda_vmflush(cp);
417 1.1 rvb }
418 1.1 rvb }
419 1.1 rvb }
420 1.1 rvb
421 1.1 rvb /*
422 1.1 rvb * As a debugging measure, print out any cnodes that lived through a
423 1.3 rvb * name cache flush.
424 1.1 rvb */
425 1.1 rvb void
426 1.1 rvb coda_testflush(void)
427 1.1 rvb {
428 1.3 rvb int hash;
429 1.3 rvb struct cnode *cp;
430 1.1 rvb
431 1.1 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
432 1.1 rvb for (cp = coda_cache[hash];
433 1.1 rvb cp != NULL;
434 1.1 rvb cp = CNODE_NEXT(cp)) {
435 1.1 rvb myprintf(("Live cnode fid %lx.%lx.%lx count %d\n",
436 1.1 rvb (cp->c_fid).Volume,(cp->c_fid).Vnode,
437 1.1 rvb (cp->c_fid).Unique, CTOV(cp)->v_usecount));
438 1.1 rvb }
439 1.1 rvb }
440 1.1 rvb }
441 1.1 rvb
442 1.1 rvb /*
443 1.1 rvb * First, step through all cnodes and mark them unmounting.
444 1.1 rvb * NetBSD kernels may try to fsync them now that venus
445 1.1 rvb * is dead, which would be a bad thing.
446 1.3 rvb *
447 1.1 rvb */
448 1.1 rvb void
449 1.1 rvb coda_unmounting(whoIam)
450 1.1 rvb struct mount *whoIam;
451 1.1 rvb {
452 1.3 rvb int hash;
453 1.3 rvb struct cnode *cp;
454 1.1 rvb
455 1.1 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
456 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
457 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
458 1.1 rvb if (cp->c_flags & (C_LOCKED|C_WANTED)) {
459 1.1 rvb printf("coda_unmounting: Unlocking %p\n", cp);
460 1.1 rvb cp->c_flags &= ~(C_LOCKED|C_WANTED);
461 1.1 rvb wakeup((caddr_t) cp);
462 1.1 rvb }
463 1.1 rvb cp->c_flags |= C_UNMOUNTING;
464 1.1 rvb }
465 1.1 rvb }
466 1.1 rvb }
467 1.3 rvb }
468 1.1 rvb
469 1.1 rvb #ifdef DEBUG
470 1.1 rvb coda_checkunmounting(mp)
471 1.1 rvb struct mount *mp;
472 1.1 rvb {
473 1.1 rvb register struct vnode *vp, *nvp;
474 1.1 rvb struct cnode *cp;
475 1.1 rvb int count = 0, bad = 0;
476 1.1 rvb loop:
477 1.1 rvb for (vp = mp->mnt_vnodelist.lh_first; vp; vp = nvp) {
478 1.1 rvb if (vp->v_mount != mp)
479 1.1 rvb goto loop;
480 1.1 rvb nvp = vp->v_mntvnodes.le_next;
481 1.1 rvb cp = VTOC(vp);
482 1.1 rvb count++;
483 1.1 rvb if (!(cp->c_flags & C_UNMOUNTING)) {
484 1.1 rvb bad++;
485 1.1 rvb printf("vp %p, cp %p missed\n", vp, cp);
486 1.1 rvb cp->c_flags |= C_UNMOUNTING;
487 1.1 rvb }
488 1.1 rvb }
489 1.3 rvb }
490 1.1 rvb
491 1.1 rvb int
492 1.1 rvb coda_cacheprint(whoIam)
493 1.1 rvb struct mount *whoIam;
494 1.1 rvb {
495 1.1 rvb int hash;
496 1.3 rvb struct cnode *cp;
497 1.3 rvb int count = 0;
498 1.1 rvb
499 1.1 rvb printf("coda_cacheprint: coda_ctlvp %p, cp %p", coda_ctlvp, VTOC(coda_ctlvp));
500 1.3 rvb coda_nc_name(coda_ctlvp);
501 1.3 rvb printf("\n");
502 1.1 rvb
503 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
504 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
505 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
506 1.1 rvb printf("coda_cacheprint: vp %p, cp %p", CTOV(cp), cp);
507 1.1 rvb coda_nc_name(cp);
508 1.1 rvb printf("\n");
509 1.1 rvb count++;
510 1.3 rvb }
511 1.1 rvb }
512 1.1 rvb }
513 1.1 rvb printf("coda_cacheprint: count %d\n", count);
514 1.1 rvb }
515 1.1 rvb #endif
516 1.1 rvb
517 1.1 rvb /*
518 1.3 rvb * There are 6 cases where invalidations occur. The semantics of each
519 1.3 rvb * is listed here.
520 1.1 rvb *
521 1.1 rvb * CODA_FLUSH -- flush all entries from the name cache and the cnode cache.
522 1.1 rvb * CODA_PURGEUSER -- flush all entries from the name cache for a specific user
523 1.3 rvb * This call is a result of token expiration.
524 1.1 rvb *
525 1.3 rvb * The next two are the result of callbacks on a file or directory.
526 1.1 rvb * CODA_ZAPDIR -- flush the attributes for the dir from its cnode.
527 1.1 rvb * Zap all children of this directory from the namecache.
528 1.3 rvb * CODA_ZAPFILE -- flush the attributes for a file.
529 1.1 rvb *
530 1.1 rvb * The fifth is a result of Venus detecting an inconsistent file.
531 1.1 rvb * CODA_PURGEFID -- flush the attribute for the file
532 1.1 rvb * If it is a dir (odd vnode), purge its
533 1.1 rvb * children from the namecache
534 1.1 rvb * remove the file from the namecache.
535 1.1 rvb *
536 1.3 rvb * The sixth allows Venus to replace local fids with global ones
537 1.1 rvb * during reintegration.
538 1.1 rvb *
539 1.1 rvb * CODA_REPLACE -- replace one ViceFid with another throughout the name cache
540 1.1 rvb */
541 1.1 rvb
542 1.1 rvb int handleDownCall(opcode, out)
543 1.1 rvb int opcode; union outputArgs *out;
544 1.1 rvb {
545 1.1 rvb int error;
546 1.3 rvb
547 1.1 rvb /* Handle invalidate requests. */
548 1.3 rvb switch (opcode) {
549 1.1 rvb case CODA_FLUSH : {
550 1.3 rvb
551 1.1 rvb coda_flush(IS_DOWNCALL);
552 1.1 rvb
553 1.1 rvb CODADEBUG(CODA_FLUSH,coda_testflush();) /* print remaining cnodes */
554 1.3 rvb return(0);
555 1.3 rvb }
556 1.3 rvb
557 1.1 rvb case CODA_PURGEUSER : {
558 1.1 rvb coda_clstat.ncalls++;
559 1.3 rvb coda_clstat.reqs[CODA_PURGEUSER]++;
560 1.1 rvb
561 1.1 rvb /* XXX - need to prevent fsync's */
562 1.1 rvb coda_nc_purge_user(out->coda_purgeuser.cred.cr_uid, IS_DOWNCALL);
563 1.3 rvb return(0);
564 1.1 rvb }
565 1.1 rvb
566 1.1 rvb case CODA_ZAPFILE : {
567 1.3 rvb struct cnode *cp;
568 1.3 rvb
569 1.1 rvb error = 0;
570 1.3 rvb coda_clstat.ncalls++;
571 1.1 rvb coda_clstat.reqs[CODA_ZAPFILE]++;
572 1.1 rvb
573 1.1 rvb cp = coda_find(&out->coda_zapfile.CodaFid);
574 1.1 rvb if (cp != NULL) {
575 1.1 rvb vref(CTOV(cp));
576 1.3 rvb
577 1.3 rvb cp->c_flags &= ~C_VATTR;
578 1.1 rvb if (CTOV(cp)->v_flag & VTEXT)
579 1.1 rvb error = coda_vmflush(cp);
580 1.1 rvb CODADEBUG(CODA_ZAPFILE, myprintf(("zapfile: fid = (%lx.%lx.%lx),
581 1.1 rvb refcnt = %d, error = %d\n",
582 1.1 rvb cp->c_fid.Volume,
583 1.1 rvb cp->c_fid.Vnode,
584 1.1 rvb cp->c_fid.Unique,
585 1.1 rvb CTOV(cp)->v_usecount - 1, error)););
586 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
587 1.1 rvb cp->c_flags |= C_PURGING;
588 1.1 rvb }
589 1.1 rvb vrele(CTOV(cp));
590 1.1 rvb }
591 1.1 rvb
592 1.3 rvb return(error);
593 1.1 rvb }
594 1.1 rvb
595 1.3 rvb case CODA_ZAPDIR : {
596 1.3 rvb struct cnode *cp;
597 1.1 rvb
598 1.3 rvb coda_clstat.ncalls++;
599 1.1 rvb coda_clstat.reqs[CODA_ZAPDIR]++;
600 1.1 rvb
601 1.1 rvb cp = coda_find(&out->coda_zapdir.CodaFid);
602 1.1 rvb if (cp != NULL) {
603 1.3 rvb vref(CTOV(cp));
604 1.1 rvb
605 1.3 rvb cp->c_flags &= ~C_VATTR;
606 1.1 rvb coda_nc_zapParentfid(&out->coda_zapdir.CodaFid, IS_DOWNCALL);
607 1.1 rvb
608 1.1 rvb CODADEBUG(CODA_ZAPDIR, myprintf(("zapdir: fid = (%lx.%lx.%lx),
609 1.1 rvb refcnt = %d\n",cp->c_fid.Volume,
610 1.1 rvb cp->c_fid.Vnode,
611 1.1 rvb cp->c_fid.Unique,
612 1.1 rvb CTOV(cp)->v_usecount - 1)););
613 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
614 1.1 rvb cp->c_flags |= C_PURGING;
615 1.1 rvb }
616 1.1 rvb vrele(CTOV(cp));
617 1.1 rvb }
618 1.1 rvb
619 1.3 rvb return(0);
620 1.3 rvb }
621 1.3 rvb
622 1.1 rvb case CODA_ZAPVNODE : {
623 1.3 rvb coda_clstat.ncalls++;
624 1.1 rvb coda_clstat.reqs[CODA_ZAPVNODE]++;
625 1.1 rvb
626 1.1 rvb myprintf(("CODA_ZAPVNODE: Called, but uniplemented\n"));
627 1.1 rvb /*
628 1.1 rvb * Not that below we must really translate the returned coda_cred to
629 1.1 rvb * a netbsd cred. This is a bit muddled at present and the cfsnc_zapnode
630 1.3 rvb * is further unimplemented, so punt!
631 1.1 rvb * I suppose we could use just the uid.
632 1.1 rvb */
633 1.1 rvb /* coda_nc_zapvnode(&out->coda_zapvnode.VFid, &out->coda_zapvnode.cred,
634 1.1 rvb IS_DOWNCALL); */
635 1.3 rvb return(0);
636 1.1 rvb }
637 1.1 rvb
638 1.1 rvb case CODA_PURGEFID : {
639 1.3 rvb struct cnode *cp;
640 1.3 rvb
641 1.1 rvb error = 0;
642 1.3 rvb coda_clstat.ncalls++;
643 1.1 rvb coda_clstat.reqs[CODA_PURGEFID]++;
644 1.1 rvb
645 1.3 rvb cp = coda_find(&out->coda_purgefid.CodaFid);
646 1.3 rvb if (cp != NULL) {
647 1.1 rvb vref(CTOV(cp));
648 1.1 rvb if (ODD(out->coda_purgefid.CodaFid.Vnode)) { /* Vnode is a directory */
649 1.1 rvb coda_nc_zapParentfid(&out->coda_purgefid.CodaFid,
650 1.3 rvb IS_DOWNCALL);
651 1.3 rvb }
652 1.1 rvb cp->c_flags &= ~C_VATTR;
653 1.1 rvb coda_nc_zapfid(&out->coda_purgefid.CodaFid, IS_DOWNCALL);
654 1.3 rvb if (!(ODD(out->coda_purgefid.CodaFid.Vnode))
655 1.1 rvb && (CTOV(cp)->v_flag & VTEXT)) {
656 1.3 rvb
657 1.1 rvb error = coda_vmflush(cp);
658 1.1 rvb }
659 1.1 rvb CODADEBUG(CODA_PURGEFID, myprintf(("purgefid: fid = (%lx.%lx.%lx), refcnt = %d, error = %d\n",
660 1.1 rvb cp->c_fid.Volume, cp->c_fid.Vnode,
661 1.1 rvb cp->c_fid.Unique,
662 1.1 rvb CTOV(cp)->v_usecount - 1, error)););
663 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
664 1.1 rvb cp->c_flags |= C_PURGING;
665 1.1 rvb }
666 1.1 rvb vrele(CTOV(cp));
667 1.1 rvb }
668 1.3 rvb return(error);
669 1.1 rvb }
670 1.1 rvb
671 1.3 rvb case CODA_REPLACE : {
672 1.3 rvb struct cnode *cp = NULL;
673 1.1 rvb
674 1.3 rvb coda_clstat.ncalls++;
675 1.1 rvb coda_clstat.reqs[CODA_REPLACE]++;
676 1.1 rvb
677 1.1 rvb cp = coda_find(&out->coda_replace.OldFid);
678 1.3 rvb if (cp != NULL) {
679 1.3 rvb /* remove the cnode from the hash table, replace the fid, and reinsert */
680 1.3 rvb vref(CTOV(cp));
681 1.3 rvb coda_unsave(cp);
682 1.3 rvb cp->c_fid = out->coda_replace.NewFid;
683 1.3 rvb coda_save(cp);
684 1.3 rvb
685 1.3 rvb CODADEBUG(CODA_REPLACE, myprintf(("replace: oldfid = (%lx.%lx.%lx), newfid = (%lx.%lx.%lx), cp = %p\n",
686 1.1 rvb out->coda_replace.OldFid.Volume,
687 1.1 rvb out->coda_replace.OldFid.Vnode,
688 1.1 rvb out->coda_replace.OldFid.Unique,
689 1.1 rvb cp->c_fid.Volume, cp->c_fid.Vnode,
690 1.1 rvb cp->c_fid.Unique, cp));)
691 1.1 rvb vrele(CTOV(cp));
692 1.1 rvb }
693 1.1 rvb return (0);
694 1.1 rvb }
695 1.1 rvb default:
696 1.1 rvb myprintf(("handleDownCall: unknown opcode %d\n", opcode));
697 1.1 rvb return (EINVAL);
698 1.3 rvb }
699 1.1 rvb }
700 1.1 rvb
701 1.3 rvb /* coda_grab_vnode: lives in either cfs_mach.c or cfs_nbsd.c */
702 1.1 rvb
703 1.1 rvb int
704 1.1 rvb coda_vmflush(cp)
705 1.1 rvb struct cnode *cp;
706 1.1 rvb {
707 1.1 rvb return 0;
708 1.1 rvb }
709 1.1 rvb
710 1.1 rvb
711 1.1 rvb /*
712 1.3 rvb * kernel-internal debugging switches
713 1.1 rvb */
714 1.3 rvb
715 1.3 rvb void coda_debugon(void)
716 1.3 rvb {
717 1.3 rvb codadebug = -1;
718 1.3 rvb coda_nc_debug = -1;
719 1.3 rvb coda_vnop_print_entry = 1;
720 1.3 rvb coda_psdev_print_entry = 1;
721 1.3 rvb coda_vfsop_print_entry = 1;
722 1.3 rvb }
723 1.3 rvb
724 1.3 rvb void coda_debugoff(void)
725 1.3 rvb {
726 1.3 rvb codadebug = 0;
727 1.3 rvb coda_nc_debug = 0;
728 1.1 rvb coda_vnop_print_entry = 0;
729 1.1 rvb coda_psdev_print_entry = 0;
730 1.1 rvb coda_vfsop_print_entry = 0;
731 1.1 rvb }
732 1.1 rvb
733 1.1 rvb /*
734 1.1 rvb * Utilities used by both client and server
735 1.1 rvb * Standard levels:
736 1.1 rvb * 0) no debugging
737 1.1 rvb * 1) hard failures
738 1.1 rvb * 2) soft failures
739 1.1 rvb * 3) current test software
740 1.1 rvb * 4) main procedure entry points
741 1.1 rvb * 5) main procedure exit points
742 1.1 rvb * 6) utility procedure entry points
743 1.1 rvb * 7) utility procedure exit points
744 1.1 rvb * 8) obscure procedure entry points
745 1.1 rvb * 9) obscure procedure exit points
746 1.1 rvb * 10) random stuff
747 1.1 rvb * 11) all <= 1
748 1.1 rvb * 12) all <= 2
749 * 13) all <= 3
750 * ...
751 */
752