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