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