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