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