coda_subr.c revision 1.26 1 1.26 christos /* $NetBSD: coda_subr.c,v 1.26 2012/04/26 03:04:54 christos Exp $ */
2 1.2 rvb
3 1.1 rvb /*
4 1.17 perry *
5 1.2 rvb * Coda: an Experimental Distributed File System
6 1.2 rvb * Release 3.1
7 1.17 perry *
8 1.2 rvb * Copyright (c) 1987-1998 Carnegie Mellon University
9 1.2 rvb * All Rights Reserved
10 1.17 perry *
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.17 perry *
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.17 perry *
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.17 perry *
31 1.17 perry * @(#) 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.17 perry /*
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 /* NOTES: rvb
47 1.3 rvb * 1. Added coda_unmounting to mark all cnodes as being UNMOUNTING. This has to
48 1.1 rvb * be done before dounmount is called. Because some of the routines that
49 1.3 rvb * dounmount calls before coda_unmounted might try to force flushes to venus.
50 1.1 rvb * The vnode pager does this.
51 1.3 rvb * 2. coda_unmounting marks all cnodes scanning coda_cache.
52 1.1 rvb * 3. cfs_checkunmounting (under DEBUG) checks all cnodes by chasing the vnodes
53 1.1 rvb * under the /coda mount point.
54 1.3 rvb * 4. coda_cacheprint (under DEBUG) prints names with vnode/cnode address
55 1.1 rvb */
56 1.13 lukem
57 1.13 lukem #include <sys/cdefs.h>
58 1.26 christos __KERNEL_RCSID(0, "$NetBSD: coda_subr.c,v 1.26 2012/04/26 03:04:54 christos Exp $");
59 1.1 rvb
60 1.1 rvb #include <sys/param.h>
61 1.1 rvb #include <sys/systm.h>
62 1.1 rvb #include <sys/malloc.h>
63 1.1 rvb #include <sys/proc.h>
64 1.1 rvb #include <sys/select.h>
65 1.1 rvb #include <sys/mount.h>
66 1.1 rvb
67 1.4 rvb #include <coda/coda.h>
68 1.4 rvb #include <coda/cnode.h>
69 1.4 rvb #include <coda/coda_subr.h>
70 1.4 rvb #include <coda/coda_namecache.h>
71 1.1 rvb
72 1.16 mrg #ifdef _KERNEL_OPT
73 1.15 drochner #include "opt_coda_compat.h"
74 1.16 mrg #endif
75 1.15 drochner
76 1.3 rvb int coda_active = 0;
77 1.3 rvb int coda_reuse = 0;
78 1.3 rvb int coda_new = 0;
79 1.1 rvb
80 1.3 rvb struct cnode *coda_freelist = NULL;
81 1.3 rvb struct cnode *coda_cache[CODA_CACHESIZE];
82 1.26 christos MALLOC_DEFINE(M_CODA, "coda", "Coda file system structures and tables");
83 1.26 christos
84 1.26 christos int codadebug = 0;
85 1.26 christos int coda_printf_delay = 0; /* in microseconds */
86 1.26 christos int coda_vnop_print_entry = 0;
87 1.26 christos int coda_vfsop_print_entry = 0;
88 1.1 rvb
89 1.15 drochner #define CNODE_NEXT(cp) ((cp)->c_next)
90 1.15 drochner
91 1.15 drochner #ifdef CODA_COMPAT_5
92 1.3 rvb #define coda_hash(fid) \
93 1.3 rvb (((fid)->Volume + (fid)->Vnode) & (CODA_CACHESIZE-1))
94 1.15 drochner #define IS_DIR(cnode) (cnode.Vnode & 0x1)
95 1.15 drochner #else
96 1.15 drochner #define coda_hash(fid) \
97 1.15 drochner (coda_f2i(fid) & (CODA_CACHESIZE-1))
98 1.15 drochner #define IS_DIR(cnode) (cnode.opaque[2] & 0x1)
99 1.15 drochner #endif
100 1.1 rvb
101 1.1 rvb /*
102 1.1 rvb * Allocate a cnode.
103 1.1 rvb */
104 1.1 rvb struct cnode *
105 1.3 rvb coda_alloc(void)
106 1.1 rvb {
107 1.1 rvb struct cnode *cp;
108 1.1 rvb
109 1.3 rvb if (coda_freelist) {
110 1.3 rvb cp = coda_freelist;
111 1.3 rvb coda_freelist = CNODE_NEXT(cp);
112 1.3 rvb coda_reuse++;
113 1.1 rvb }
114 1.1 rvb else {
115 1.3 rvb CODA_ALLOC(cp, struct cnode *, sizeof(struct cnode));
116 1.1 rvb /* NetBSD vnodes don't have any Pager info in them ('cause there are
117 1.1 rvb no external pagers, duh!) */
118 1.1 rvb #define VNODE_VM_INFO_INIT(vp) /* MT */
119 1.1 rvb VNODE_VM_INFO_INIT(CTOV(cp));
120 1.3 rvb coda_new++;
121 1.1 rvb }
122 1.12 thorpej memset(cp, 0, sizeof (struct cnode));
123 1.1 rvb
124 1.1 rvb return(cp);
125 1.1 rvb }
126 1.1 rvb
127 1.1 rvb /*
128 1.1 rvb * Deallocate a cnode.
129 1.1 rvb */
130 1.1 rvb void
131 1.18 xtraeme coda_free(struct cnode *cp)
132 1.1 rvb {
133 1.1 rvb
134 1.3 rvb CNODE_NEXT(cp) = coda_freelist;
135 1.3 rvb coda_freelist = cp;
136 1.1 rvb }
137 1.1 rvb
138 1.1 rvb /*
139 1.1 rvb * Put a cnode in the hash table
140 1.1 rvb */
141 1.1 rvb void
142 1.18 xtraeme coda_save(struct cnode *cp)
143 1.1 rvb {
144 1.3 rvb CNODE_NEXT(cp) = coda_cache[coda_hash(&cp->c_fid)];
145 1.3 rvb coda_cache[coda_hash(&cp->c_fid)] = cp;
146 1.1 rvb }
147 1.1 rvb
148 1.1 rvb /*
149 1.1 rvb * Remove a cnode from the hash table
150 1.1 rvb */
151 1.1 rvb void
152 1.18 xtraeme coda_unsave(struct cnode *cp)
153 1.1 rvb {
154 1.1 rvb struct cnode *ptr;
155 1.1 rvb struct cnode *ptrprev = NULL;
156 1.17 perry
157 1.17 perry ptr = coda_cache[coda_hash(&cp->c_fid)];
158 1.17 perry while (ptr != NULL) {
159 1.17 perry if (ptr == cp) {
160 1.1 rvb if (ptrprev == NULL) {
161 1.17 perry coda_cache[coda_hash(&cp->c_fid)]
162 1.1 rvb = CNODE_NEXT(ptr);
163 1.1 rvb } else {
164 1.1 rvb CNODE_NEXT(ptrprev) = CNODE_NEXT(ptr);
165 1.1 rvb }
166 1.25 plunky CNODE_NEXT(cp) = NULL;
167 1.17 perry
168 1.17 perry return;
169 1.17 perry }
170 1.1 rvb ptrprev = ptr;
171 1.1 rvb ptr = CNODE_NEXT(ptr);
172 1.17 perry }
173 1.1 rvb }
174 1.1 rvb
175 1.1 rvb /*
176 1.1 rvb * Lookup a cnode by fid. If the cnode is dying, it is bogus so skip it.
177 1.1 rvb * NOTE: this allows multiple cnodes with same fid -- dcs 1/25/95
178 1.1 rvb */
179 1.1 rvb struct cnode *
180 1.18 xtraeme coda_find(CodaFid *fid)
181 1.1 rvb {
182 1.1 rvb struct cnode *cp;
183 1.1 rvb
184 1.3 rvb cp = coda_cache[coda_hash(fid)];
185 1.1 rvb while (cp) {
186 1.15 drochner if (coda_fid_eq(&(cp->c_fid), fid) &&
187 1.1 rvb (!IS_UNMOUNTING(cp)))
188 1.1 rvb {
189 1.3 rvb coda_active++;
190 1.17 perry return(cp);
191 1.17 perry }
192 1.1 rvb cp = CNODE_NEXT(cp);
193 1.1 rvb }
194 1.1 rvb return(NULL);
195 1.1 rvb }
196 1.1 rvb
197 1.1 rvb /*
198 1.3 rvb * coda_kill is called as a side effect to vcopen. To prevent any
199 1.1 rvb * cnodes left around from an earlier run of a venus or warden from
200 1.1 rvb * causing problems with the new instance, mark any outstanding cnodes
201 1.1 rvb * as dying. Future operations on these cnodes should fail (excepting
202 1.3 rvb * coda_inactive of course!). Since multiple venii/wardens can be
203 1.1 rvb * running, only kill the cnodes for a particular entry in the
204 1.3 rvb * coda_mnttbl. -- DCS 12/1/94 */
205 1.1 rvb
206 1.1 rvb int
207 1.18 xtraeme coda_kill(struct mount *whoIam, enum dc_status dcstat)
208 1.1 rvb {
209 1.1 rvb int hash, count = 0;
210 1.1 rvb struct cnode *cp;
211 1.17 perry
212 1.17 perry /*
213 1.17 perry * Algorithm is as follows:
214 1.1 rvb * Second, flush whatever vnodes we can from the name cache.
215 1.17 perry *
216 1.1 rvb * Finally, step through whatever is left and mark them dying.
217 1.1 rvb * This prevents any operation at all.
218 1.2 rvb
219 1.1 rvb */
220 1.17 perry
221 1.1 rvb /* This is slightly overkill, but should work. Eventually it'd be
222 1.1 rvb * nice to only flush those entries from the namecache that
223 1.1 rvb * reference a vnode in this vfs. */
224 1.3 rvb coda_nc_flush(dcstat);
225 1.17 perry
226 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
227 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
228 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
229 1.1 rvb #ifdef DEBUG
230 1.3 rvb printf("coda_kill: vp %p, cp %p\n", CTOV(cp), cp);
231 1.1 rvb #endif
232 1.1 rvb count++;
233 1.17 perry CODADEBUG(CODA_FLUSH,
234 1.15 drochner myprintf(("Live cnode fid %s flags %d count %d\n",
235 1.15 drochner coda_f2s(&cp->c_fid),
236 1.1 rvb cp->c_flags,
237 1.1 rvb CTOV(cp)->v_usecount)); );
238 1.1 rvb }
239 1.1 rvb }
240 1.1 rvb }
241 1.1 rvb return count;
242 1.1 rvb }
243 1.1 rvb
244 1.1 rvb /*
245 1.1 rvb * There are two reasons why a cnode may be in use, it may be in the
246 1.17 perry * name cache or it may be executing.
247 1.1 rvb */
248 1.1 rvb void
249 1.18 xtraeme coda_flush(enum dc_status dcstat)
250 1.1 rvb {
251 1.1 rvb int hash;
252 1.1 rvb struct cnode *cp;
253 1.17 perry
254 1.3 rvb coda_clstat.ncalls++;
255 1.3 rvb coda_clstat.reqs[CODA_FLUSH]++;
256 1.17 perry
257 1.3 rvb coda_nc_flush(dcstat); /* flush files from the name cache */
258 1.1 rvb
259 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
260 1.17 perry for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
261 1.15 drochner if (!IS_DIR(cp->c_fid)) /* only files can be executed */
262 1.3 rvb coda_vmflush(cp);
263 1.1 rvb }
264 1.1 rvb }
265 1.1 rvb }
266 1.1 rvb
267 1.1 rvb /*
268 1.1 rvb * As a debugging measure, print out any cnodes that lived through a
269 1.17 perry * name cache flush.
270 1.1 rvb */
271 1.1 rvb void
272 1.3 rvb coda_testflush(void)
273 1.1 rvb {
274 1.1 rvb int hash;
275 1.1 rvb struct cnode *cp;
276 1.17 perry
277 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
278 1.3 rvb for (cp = coda_cache[hash];
279 1.1 rvb cp != NULL;
280 1.17 perry cp = CNODE_NEXT(cp)) {
281 1.15 drochner myprintf(("Live cnode fid %s count %d\n",
282 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount));
283 1.1 rvb }
284 1.1 rvb }
285 1.1 rvb }
286 1.1 rvb
287 1.1 rvb /*
288 1.1 rvb * First, step through all cnodes and mark them unmounting.
289 1.1 rvb * NetBSD kernels may try to fsync them now that venus
290 1.1 rvb * is dead, which would be a bad thing.
291 1.1 rvb *
292 1.1 rvb */
293 1.1 rvb void
294 1.18 xtraeme coda_unmounting(struct mount *whoIam)
295 1.17 perry {
296 1.1 rvb int hash;
297 1.1 rvb struct cnode *cp;
298 1.1 rvb
299 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
300 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
301 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
302 1.1 rvb if (cp->c_flags & (C_LOCKED|C_WANTED)) {
303 1.3 rvb printf("coda_unmounting: Unlocking %p\n", cp);
304 1.1 rvb cp->c_flags &= ~(C_LOCKED|C_WANTED);
305 1.23 christos wakeup((void *) cp);
306 1.1 rvb }
307 1.1 rvb cp->c_flags |= C_UNMOUNTING;
308 1.1 rvb }
309 1.1 rvb }
310 1.1 rvb }
311 1.1 rvb }
312 1.1 rvb
313 1.1 rvb #ifdef DEBUG
314 1.5 rvb void
315 1.18 xtraeme coda_checkunmounting(struct mount *mp)
316 1.17 perry {
317 1.21 reinoud struct vnode *vp;
318 1.1 rvb struct cnode *cp;
319 1.1 rvb int count = 0, bad = 0;
320 1.1 rvb loop:
321 1.21 reinoud TAILQ_FOREACH(vp, &mp->mnt_vnodelist, v_mntvnodes) {
322 1.1 rvb if (vp->v_mount != mp)
323 1.1 rvb goto loop;
324 1.1 rvb cp = VTOC(vp);
325 1.1 rvb count++;
326 1.1 rvb if (!(cp->c_flags & C_UNMOUNTING)) {
327 1.1 rvb bad++;
328 1.1 rvb printf("vp %p, cp %p missed\n", vp, cp);
329 1.1 rvb cp->c_flags |= C_UNMOUNTING;
330 1.1 rvb }
331 1.1 rvb }
332 1.1 rvb }
333 1.1 rvb
334 1.5 rvb void
335 1.18 xtraeme coda_cacheprint(struct mount *whoIam)
336 1.17 perry {
337 1.1 rvb int hash;
338 1.1 rvb struct cnode *cp;
339 1.1 rvb int count = 0;
340 1.1 rvb
341 1.3 rvb printf("coda_cacheprint: coda_ctlvp %p, cp %p", coda_ctlvp, VTOC(coda_ctlvp));
342 1.5 rvb coda_nc_name(VTOC(coda_ctlvp));
343 1.1 rvb printf("\n");
344 1.1 rvb
345 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
346 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
347 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
348 1.3 rvb printf("coda_cacheprint: vp %p, cp %p", CTOV(cp), cp);
349 1.3 rvb coda_nc_name(cp);
350 1.1 rvb printf("\n");
351 1.1 rvb count++;
352 1.1 rvb }
353 1.1 rvb }
354 1.1 rvb }
355 1.3 rvb printf("coda_cacheprint: count %d\n", count);
356 1.1 rvb }
357 1.1 rvb #endif
358 1.1 rvb
359 1.1 rvb /*
360 1.1 rvb * There are 6 cases where invalidations occur. The semantics of each
361 1.1 rvb * is listed here.
362 1.1 rvb *
363 1.3 rvb * CODA_FLUSH -- flush all entries from the name cache and the cnode cache.
364 1.3 rvb * CODA_PURGEUSER -- flush all entries from the name cache for a specific user
365 1.1 rvb * This call is a result of token expiration.
366 1.1 rvb *
367 1.1 rvb * The next two are the result of callbacks on a file or directory.
368 1.3 rvb * CODA_ZAPDIR -- flush the attributes for the dir from its cnode.
369 1.1 rvb * Zap all children of this directory from the namecache.
370 1.3 rvb * CODA_ZAPFILE -- flush the attributes for a file.
371 1.1 rvb *
372 1.1 rvb * The fifth is a result of Venus detecting an inconsistent file.
373 1.3 rvb * CODA_PURGEFID -- flush the attribute for the file
374 1.17 perry * If it is a dir (odd vnode), purge its
375 1.1 rvb * children from the namecache
376 1.1 rvb * remove the file from the namecache.
377 1.1 rvb *
378 1.1 rvb * The sixth allows Venus to replace local fids with global ones
379 1.1 rvb * during reintegration.
380 1.1 rvb *
381 1.17 perry * CODA_REPLACE -- replace one CodaFid with another throughout the name cache
382 1.1 rvb */
383 1.1 rvb
384 1.18 xtraeme int handleDownCall(int opcode, union outputArgs *out)
385 1.1 rvb {
386 1.1 rvb int error;
387 1.1 rvb
388 1.1 rvb /* Handle invalidate requests. */
389 1.1 rvb switch (opcode) {
390 1.3 rvb case CODA_FLUSH : {
391 1.1 rvb
392 1.3 rvb coda_flush(IS_DOWNCALL);
393 1.17 perry
394 1.3 rvb CODADEBUG(CODA_FLUSH,coda_testflush();) /* print remaining cnodes */
395 1.1 rvb return(0);
396 1.1 rvb }
397 1.17 perry
398 1.3 rvb case CODA_PURGEUSER : {
399 1.3 rvb coda_clstat.ncalls++;
400 1.3 rvb coda_clstat.reqs[CODA_PURGEUSER]++;
401 1.17 perry
402 1.1 rvb /* XXX - need to prevent fsync's */
403 1.15 drochner #ifdef CODA_COMPAT_5
404 1.3 rvb coda_nc_purge_user(out->coda_purgeuser.cred.cr_uid, IS_DOWNCALL);
405 1.15 drochner #else
406 1.15 drochner coda_nc_purge_user(out->coda_purgeuser.uid, IS_DOWNCALL);
407 1.15 drochner #endif
408 1.1 rvb return(0);
409 1.1 rvb }
410 1.17 perry
411 1.3 rvb case CODA_ZAPFILE : {
412 1.1 rvb struct cnode *cp;
413 1.1 rvb
414 1.1 rvb error = 0;
415 1.3 rvb coda_clstat.ncalls++;
416 1.3 rvb coda_clstat.reqs[CODA_ZAPFILE]++;
417 1.17 perry
418 1.15 drochner cp = coda_find(&out->coda_zapfile.Fid);
419 1.1 rvb if (cp != NULL) {
420 1.1 rvb vref(CTOV(cp));
421 1.17 perry
422 1.1 rvb cp->c_flags &= ~C_VATTR;
423 1.24 ad if (CTOV(cp)->v_iflag & VI_TEXT)
424 1.3 rvb error = coda_vmflush(cp);
425 1.11 lukem CODADEBUG(CODA_ZAPFILE, myprintf((
426 1.15 drochner "zapfile: fid = %s, refcnt = %d, error = %d\n",
427 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount - 1, error)););
428 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
429 1.1 rvb cp->c_flags |= C_PURGING;
430 1.1 rvb }
431 1.1 rvb vrele(CTOV(cp));
432 1.1 rvb }
433 1.17 perry
434 1.1 rvb return(error);
435 1.1 rvb }
436 1.17 perry
437 1.3 rvb case CODA_ZAPDIR : {
438 1.1 rvb struct cnode *cp;
439 1.1 rvb
440 1.3 rvb coda_clstat.ncalls++;
441 1.3 rvb coda_clstat.reqs[CODA_ZAPDIR]++;
442 1.17 perry
443 1.15 drochner cp = coda_find(&out->coda_zapdir.Fid);
444 1.1 rvb if (cp != NULL) {
445 1.1 rvb vref(CTOV(cp));
446 1.17 perry
447 1.1 rvb cp->c_flags &= ~C_VATTR;
448 1.17 perry coda_nc_zapParentfid(&out->coda_zapdir.Fid, IS_DOWNCALL);
449 1.17 perry
450 1.11 lukem CODADEBUG(CODA_ZAPDIR, myprintf((
451 1.15 drochner "zapdir: fid = %s, refcnt = %d\n",
452 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount - 1)););
453 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
454 1.1 rvb cp->c_flags |= C_PURGING;
455 1.1 rvb }
456 1.1 rvb vrele(CTOV(cp));
457 1.1 rvb }
458 1.17 perry
459 1.1 rvb return(0);
460 1.1 rvb }
461 1.17 perry
462 1.3 rvb case CODA_PURGEFID : {
463 1.1 rvb struct cnode *cp;
464 1.1 rvb
465 1.1 rvb error = 0;
466 1.3 rvb coda_clstat.ncalls++;
467 1.3 rvb coda_clstat.reqs[CODA_PURGEFID]++;
468 1.1 rvb
469 1.15 drochner cp = coda_find(&out->coda_purgefid.Fid);
470 1.1 rvb if (cp != NULL) {
471 1.1 rvb vref(CTOV(cp));
472 1.15 drochner if (IS_DIR(out->coda_purgefid.Fid)) { /* Vnode is a directory */
473 1.15 drochner coda_nc_zapParentfid(&out->coda_purgefid.Fid,
474 1.17 perry IS_DOWNCALL);
475 1.1 rvb }
476 1.1 rvb cp->c_flags &= ~C_VATTR;
477 1.15 drochner coda_nc_zapfid(&out->coda_purgefid.Fid, IS_DOWNCALL);
478 1.17 perry if (!(IS_DIR(out->coda_purgefid.Fid))
479 1.24 ad && (CTOV(cp)->v_iflag & VI_TEXT)) {
480 1.17 perry
481 1.3 rvb error = coda_vmflush(cp);
482 1.1 rvb }
483 1.15 drochner CODADEBUG(CODA_PURGEFID, myprintf((
484 1.15 drochner "purgefid: fid = %s, refcnt = %d, error = %d\n",
485 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount - 1, error)););
486 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
487 1.1 rvb cp->c_flags |= C_PURGING;
488 1.1 rvb }
489 1.1 rvb vrele(CTOV(cp));
490 1.1 rvb }
491 1.1 rvb return(error);
492 1.1 rvb }
493 1.1 rvb
494 1.3 rvb case CODA_REPLACE : {
495 1.1 rvb struct cnode *cp = NULL;
496 1.1 rvb
497 1.3 rvb coda_clstat.ncalls++;
498 1.3 rvb coda_clstat.reqs[CODA_REPLACE]++;
499 1.17 perry
500 1.3 rvb cp = coda_find(&out->coda_replace.OldFid);
501 1.17 perry if (cp != NULL) {
502 1.1 rvb /* remove the cnode from the hash table, replace the fid, and reinsert */
503 1.1 rvb vref(CTOV(cp));
504 1.3 rvb coda_unsave(cp);
505 1.3 rvb cp->c_fid = out->coda_replace.NewFid;
506 1.3 rvb coda_save(cp);
507 1.3 rvb
508 1.15 drochner CODADEBUG(CODA_REPLACE, myprintf((
509 1.15 drochner "replace: oldfid = %s, newfid = %s, cp = %p\n",
510 1.15 drochner coda_f2s(&out->coda_replace.OldFid),
511 1.15 drochner coda_f2s(&cp->c_fid), cp));)
512 1.1 rvb vrele(CTOV(cp));
513 1.1 rvb }
514 1.1 rvb return (0);
515 1.1 rvb }
516 1.1 rvb default:
517 1.1 rvb myprintf(("handleDownCall: unknown opcode %d\n", opcode));
518 1.1 rvb return (EINVAL);
519 1.1 rvb }
520 1.1 rvb }
521 1.1 rvb
522 1.3 rvb /* coda_grab_vnode: lives in either cfs_mach.c or cfs_nbsd.c */
523 1.1 rvb
524 1.1 rvb int
525 1.22 christos coda_vmflush(struct cnode *cp)
526 1.1 rvb {
527 1.1 rvb return 0;
528 1.1 rvb }
529 1.1 rvb
530 1.1 rvb
531 1.17 perry /*
532 1.1 rvb * kernel-internal debugging switches
533 1.1 rvb */
534 1.1 rvb
535 1.3 rvb void coda_debugon(void)
536 1.1 rvb {
537 1.3 rvb codadebug = -1;
538 1.3 rvb coda_nc_debug = -1;
539 1.3 rvb coda_vnop_print_entry = 1;
540 1.3 rvb coda_psdev_print_entry = 1;
541 1.3 rvb coda_vfsop_print_entry = 1;
542 1.3 rvb }
543 1.3 rvb
544 1.3 rvb void coda_debugoff(void)
545 1.3 rvb {
546 1.3 rvb codadebug = 0;
547 1.3 rvb coda_nc_debug = 0;
548 1.3 rvb coda_vnop_print_entry = 0;
549 1.3 rvb coda_psdev_print_entry = 0;
550 1.3 rvb coda_vfsop_print_entry = 0;
551 1.1 rvb }
552 1.1 rvb
553 1.1 rvb /*
554 1.1 rvb * Utilities used by both client and server
555 1.1 rvb * Standard levels:
556 1.1 rvb * 0) no debugging
557 1.1 rvb * 1) hard failures
558 1.1 rvb * 2) soft failures
559 1.1 rvb * 3) current test software
560 1.1 rvb * 4) main procedure entry points
561 1.1 rvb * 5) main procedure exit points
562 1.1 rvb * 6) utility procedure entry points
563 1.1 rvb * 7) utility procedure exit points
564 1.1 rvb * 8) obscure procedure entry points
565 1.1 rvb * 9) obscure procedure exit points
566 1.1 rvb * 10) random stuff
567 1.1 rvb * 11) all <= 1
568 1.1 rvb * 12) all <= 2
569 1.1 rvb * 13) all <= 3
570 1.1 rvb * ...
571 1.1 rvb */
572