coda_subr.c revision 1.29 1 1.29 hannken /* $NetBSD: coda_subr.c,v 1.29 2014/12/13 15:58:39 hannken 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.29 hannken __KERNEL_RCSID(0, "$NetBSD: coda_subr.c,v 1.29 2014/12/13 15:58:39 hannken 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.27 christos #include <sys/kauth.h>
67 1.1 rvb
68 1.4 rvb #include <coda/coda.h>
69 1.4 rvb #include <coda/cnode.h>
70 1.4 rvb #include <coda/coda_subr.h>
71 1.4 rvb #include <coda/coda_namecache.h>
72 1.1 rvb
73 1.15 drochner
74 1.3 rvb int coda_active = 0;
75 1.3 rvb int coda_reuse = 0;
76 1.3 rvb int coda_new = 0;
77 1.1 rvb
78 1.3 rvb struct cnode *coda_freelist = NULL;
79 1.3 rvb struct cnode *coda_cache[CODA_CACHESIZE];
80 1.26 christos MALLOC_DEFINE(M_CODA, "coda", "Coda file system structures and tables");
81 1.26 christos
82 1.26 christos int codadebug = 0;
83 1.26 christos int coda_printf_delay = 0; /* in microseconds */
84 1.26 christos int coda_vnop_print_entry = 0;
85 1.26 christos int coda_vfsop_print_entry = 0;
86 1.1 rvb
87 1.15 drochner #define CNODE_NEXT(cp) ((cp)->c_next)
88 1.15 drochner
89 1.15 drochner #ifdef CODA_COMPAT_5
90 1.3 rvb #define coda_hash(fid) \
91 1.3 rvb (((fid)->Volume + (fid)->Vnode) & (CODA_CACHESIZE-1))
92 1.15 drochner #define IS_DIR(cnode) (cnode.Vnode & 0x1)
93 1.15 drochner #else
94 1.15 drochner #define coda_hash(fid) \
95 1.15 drochner (coda_f2i(fid) & (CODA_CACHESIZE-1))
96 1.15 drochner #define IS_DIR(cnode) (cnode.opaque[2] & 0x1)
97 1.15 drochner #endif
98 1.1 rvb
99 1.27 christos struct vnode *coda_ctlvp;
100 1.27 christos
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.28 hannken if (IS_CTL_VP(CTOV(cp)))
229 1.28 hannken continue;
230 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
231 1.1 rvb #ifdef DEBUG
232 1.3 rvb printf("coda_kill: vp %p, cp %p\n", CTOV(cp), cp);
233 1.1 rvb #endif
234 1.1 rvb count++;
235 1.17 perry CODADEBUG(CODA_FLUSH,
236 1.15 drochner myprintf(("Live cnode fid %s flags %d count %d\n",
237 1.15 drochner coda_f2s(&cp->c_fid),
238 1.1 rvb cp->c_flags,
239 1.1 rvb CTOV(cp)->v_usecount)); );
240 1.1 rvb }
241 1.1 rvb }
242 1.1 rvb }
243 1.1 rvb return count;
244 1.1 rvb }
245 1.1 rvb
246 1.1 rvb /*
247 1.1 rvb * There are two reasons why a cnode may be in use, it may be in the
248 1.17 perry * name cache or it may be executing.
249 1.1 rvb */
250 1.1 rvb void
251 1.18 xtraeme coda_flush(enum dc_status dcstat)
252 1.1 rvb {
253 1.1 rvb int hash;
254 1.1 rvb struct cnode *cp;
255 1.17 perry
256 1.3 rvb coda_clstat.ncalls++;
257 1.3 rvb coda_clstat.reqs[CODA_FLUSH]++;
258 1.17 perry
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.17 perry for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
263 1.15 drochner if (!IS_DIR(cp->c_fid)) /* 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.17 perry * 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.17 perry
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.17 perry cp = CNODE_NEXT(cp)) {
283 1.15 drochner myprintf(("Live cnode fid %s count %d\n",
284 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount));
285 1.1 rvb }
286 1.1 rvb }
287 1.1 rvb }
288 1.1 rvb
289 1.1 rvb /*
290 1.1 rvb * First, step through all cnodes and mark them unmounting.
291 1.1 rvb * NetBSD kernels may try to fsync them now that venus
292 1.1 rvb * is dead, which would be a bad thing.
293 1.1 rvb *
294 1.1 rvb */
295 1.1 rvb void
296 1.18 xtraeme coda_unmounting(struct mount *whoIam)
297 1.17 perry {
298 1.1 rvb int hash;
299 1.1 rvb struct cnode *cp;
300 1.1 rvb
301 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
302 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
303 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
304 1.1 rvb cp->c_flags |= C_UNMOUNTING;
305 1.1 rvb }
306 1.1 rvb }
307 1.1 rvb }
308 1.1 rvb }
309 1.1 rvb
310 1.1 rvb #ifdef DEBUG
311 1.5 rvb void
312 1.18 xtraeme coda_checkunmounting(struct mount *mp)
313 1.17 perry {
314 1.21 reinoud struct vnode *vp;
315 1.1 rvb struct cnode *cp;
316 1.1 rvb int count = 0, bad = 0;
317 1.1 rvb loop:
318 1.21 reinoud TAILQ_FOREACH(vp, &mp->mnt_vnodelist, v_mntvnodes) {
319 1.1 rvb if (vp->v_mount != mp)
320 1.1 rvb goto loop;
321 1.1 rvb cp = VTOC(vp);
322 1.1 rvb count++;
323 1.1 rvb if (!(cp->c_flags & C_UNMOUNTING)) {
324 1.1 rvb bad++;
325 1.1 rvb printf("vp %p, cp %p missed\n", vp, cp);
326 1.1 rvb cp->c_flags |= C_UNMOUNTING;
327 1.1 rvb }
328 1.1 rvb }
329 1.1 rvb }
330 1.1 rvb
331 1.5 rvb void
332 1.18 xtraeme coda_cacheprint(struct mount *whoIam)
333 1.17 perry {
334 1.1 rvb int hash;
335 1.1 rvb struct cnode *cp;
336 1.1 rvb int count = 0;
337 1.1 rvb
338 1.3 rvb printf("coda_cacheprint: coda_ctlvp %p, cp %p", coda_ctlvp, VTOC(coda_ctlvp));
339 1.5 rvb coda_nc_name(VTOC(coda_ctlvp));
340 1.1 rvb printf("\n");
341 1.1 rvb
342 1.3 rvb for (hash = 0; hash < CODA_CACHESIZE; hash++) {
343 1.3 rvb for (cp = coda_cache[hash]; cp != NULL; cp = CNODE_NEXT(cp)) {
344 1.1 rvb if (CTOV(cp)->v_mount == whoIam) {
345 1.3 rvb printf("coda_cacheprint: vp %p, cp %p", CTOV(cp), cp);
346 1.3 rvb coda_nc_name(cp);
347 1.1 rvb printf("\n");
348 1.1 rvb count++;
349 1.1 rvb }
350 1.1 rvb }
351 1.1 rvb }
352 1.3 rvb printf("coda_cacheprint: count %d\n", count);
353 1.1 rvb }
354 1.1 rvb #endif
355 1.1 rvb
356 1.1 rvb /*
357 1.1 rvb * There are 6 cases where invalidations occur. The semantics of each
358 1.1 rvb * is listed here.
359 1.1 rvb *
360 1.3 rvb * CODA_FLUSH -- flush all entries from the name cache and the cnode cache.
361 1.3 rvb * CODA_PURGEUSER -- flush all entries from the name cache for a specific user
362 1.1 rvb * This call is a result of token expiration.
363 1.1 rvb *
364 1.1 rvb * The next two are the result of callbacks on a file or directory.
365 1.3 rvb * CODA_ZAPDIR -- flush the attributes for the dir from its cnode.
366 1.1 rvb * Zap all children of this directory from the namecache.
367 1.3 rvb * CODA_ZAPFILE -- flush the attributes for a file.
368 1.1 rvb *
369 1.1 rvb * The fifth is a result of Venus detecting an inconsistent file.
370 1.3 rvb * CODA_PURGEFID -- flush the attribute for the file
371 1.17 perry * If it is a dir (odd vnode), purge its
372 1.1 rvb * children from the namecache
373 1.1 rvb * remove the file from the namecache.
374 1.1 rvb *
375 1.1 rvb * The sixth allows Venus to replace local fids with global ones
376 1.1 rvb * during reintegration.
377 1.1 rvb *
378 1.17 perry * CODA_REPLACE -- replace one CodaFid with another throughout the name cache
379 1.1 rvb */
380 1.1 rvb
381 1.18 xtraeme int handleDownCall(int opcode, union outputArgs *out)
382 1.1 rvb {
383 1.1 rvb int error;
384 1.1 rvb
385 1.1 rvb /* Handle invalidate requests. */
386 1.1 rvb switch (opcode) {
387 1.3 rvb case CODA_FLUSH : {
388 1.1 rvb
389 1.3 rvb coda_flush(IS_DOWNCALL);
390 1.17 perry
391 1.3 rvb CODADEBUG(CODA_FLUSH,coda_testflush();) /* print remaining cnodes */
392 1.1 rvb return(0);
393 1.1 rvb }
394 1.17 perry
395 1.3 rvb case CODA_PURGEUSER : {
396 1.3 rvb coda_clstat.ncalls++;
397 1.3 rvb coda_clstat.reqs[CODA_PURGEUSER]++;
398 1.17 perry
399 1.1 rvb /* XXX - need to prevent fsync's */
400 1.15 drochner #ifdef CODA_COMPAT_5
401 1.3 rvb coda_nc_purge_user(out->coda_purgeuser.cred.cr_uid, IS_DOWNCALL);
402 1.15 drochner #else
403 1.15 drochner coda_nc_purge_user(out->coda_purgeuser.uid, IS_DOWNCALL);
404 1.15 drochner #endif
405 1.1 rvb return(0);
406 1.1 rvb }
407 1.17 perry
408 1.3 rvb case CODA_ZAPFILE : {
409 1.1 rvb struct cnode *cp;
410 1.1 rvb
411 1.1 rvb error = 0;
412 1.3 rvb coda_clstat.ncalls++;
413 1.3 rvb coda_clstat.reqs[CODA_ZAPFILE]++;
414 1.17 perry
415 1.15 drochner cp = coda_find(&out->coda_zapfile.Fid);
416 1.1 rvb if (cp != NULL) {
417 1.1 rvb vref(CTOV(cp));
418 1.17 perry
419 1.1 rvb cp->c_flags &= ~C_VATTR;
420 1.24 ad if (CTOV(cp)->v_iflag & VI_TEXT)
421 1.3 rvb error = coda_vmflush(cp);
422 1.11 lukem CODADEBUG(CODA_ZAPFILE, myprintf((
423 1.15 drochner "zapfile: fid = %s, refcnt = %d, error = %d\n",
424 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount - 1, error)););
425 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
426 1.1 rvb cp->c_flags |= C_PURGING;
427 1.1 rvb }
428 1.1 rvb vrele(CTOV(cp));
429 1.1 rvb }
430 1.17 perry
431 1.1 rvb return(error);
432 1.1 rvb }
433 1.17 perry
434 1.3 rvb case CODA_ZAPDIR : {
435 1.1 rvb struct cnode *cp;
436 1.1 rvb
437 1.3 rvb coda_clstat.ncalls++;
438 1.3 rvb coda_clstat.reqs[CODA_ZAPDIR]++;
439 1.17 perry
440 1.15 drochner cp = coda_find(&out->coda_zapdir.Fid);
441 1.1 rvb if (cp != NULL) {
442 1.1 rvb vref(CTOV(cp));
443 1.17 perry
444 1.1 rvb cp->c_flags &= ~C_VATTR;
445 1.17 perry coda_nc_zapParentfid(&out->coda_zapdir.Fid, IS_DOWNCALL);
446 1.17 perry
447 1.11 lukem CODADEBUG(CODA_ZAPDIR, myprintf((
448 1.15 drochner "zapdir: fid = %s, refcnt = %d\n",
449 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount - 1)););
450 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
451 1.1 rvb cp->c_flags |= C_PURGING;
452 1.1 rvb }
453 1.1 rvb vrele(CTOV(cp));
454 1.1 rvb }
455 1.17 perry
456 1.1 rvb return(0);
457 1.1 rvb }
458 1.17 perry
459 1.3 rvb case CODA_PURGEFID : {
460 1.1 rvb struct cnode *cp;
461 1.1 rvb
462 1.1 rvb error = 0;
463 1.3 rvb coda_clstat.ncalls++;
464 1.3 rvb coda_clstat.reqs[CODA_PURGEFID]++;
465 1.1 rvb
466 1.15 drochner cp = coda_find(&out->coda_purgefid.Fid);
467 1.1 rvb if (cp != NULL) {
468 1.1 rvb vref(CTOV(cp));
469 1.15 drochner if (IS_DIR(out->coda_purgefid.Fid)) { /* Vnode is a directory */
470 1.15 drochner coda_nc_zapParentfid(&out->coda_purgefid.Fid,
471 1.17 perry IS_DOWNCALL);
472 1.1 rvb }
473 1.1 rvb cp->c_flags &= ~C_VATTR;
474 1.15 drochner coda_nc_zapfid(&out->coda_purgefid.Fid, IS_DOWNCALL);
475 1.17 perry if (!(IS_DIR(out->coda_purgefid.Fid))
476 1.24 ad && (CTOV(cp)->v_iflag & VI_TEXT)) {
477 1.17 perry
478 1.3 rvb error = coda_vmflush(cp);
479 1.1 rvb }
480 1.15 drochner CODADEBUG(CODA_PURGEFID, myprintf((
481 1.15 drochner "purgefid: fid = %s, refcnt = %d, error = %d\n",
482 1.15 drochner coda_f2s(&cp->c_fid), CTOV(cp)->v_usecount - 1, error)););
483 1.1 rvb if (CTOV(cp)->v_usecount == 1) {
484 1.1 rvb cp->c_flags |= C_PURGING;
485 1.1 rvb }
486 1.1 rvb vrele(CTOV(cp));
487 1.1 rvb }
488 1.1 rvb return(error);
489 1.1 rvb }
490 1.1 rvb
491 1.3 rvb case CODA_REPLACE : {
492 1.1 rvb struct cnode *cp = NULL;
493 1.1 rvb
494 1.3 rvb coda_clstat.ncalls++;
495 1.3 rvb coda_clstat.reqs[CODA_REPLACE]++;
496 1.17 perry
497 1.3 rvb cp = coda_find(&out->coda_replace.OldFid);
498 1.17 perry if (cp != NULL) {
499 1.1 rvb /* remove the cnode from the hash table, replace the fid, and reinsert */
500 1.1 rvb vref(CTOV(cp));
501 1.3 rvb coda_unsave(cp);
502 1.3 rvb cp->c_fid = out->coda_replace.NewFid;
503 1.3 rvb coda_save(cp);
504 1.3 rvb
505 1.15 drochner CODADEBUG(CODA_REPLACE, myprintf((
506 1.15 drochner "replace: oldfid = %s, newfid = %s, cp = %p\n",
507 1.15 drochner coda_f2s(&out->coda_replace.OldFid),
508 1.15 drochner coda_f2s(&cp->c_fid), cp));)
509 1.1 rvb vrele(CTOV(cp));
510 1.1 rvb }
511 1.1 rvb return (0);
512 1.1 rvb }
513 1.1 rvb default:
514 1.1 rvb myprintf(("handleDownCall: unknown opcode %d\n", opcode));
515 1.1 rvb return (EINVAL);
516 1.1 rvb }
517 1.1 rvb }
518 1.1 rvb
519 1.3 rvb /* coda_grab_vnode: lives in either cfs_mach.c or cfs_nbsd.c */
520 1.1 rvb
521 1.1 rvb int
522 1.22 christos coda_vmflush(struct cnode *cp)
523 1.1 rvb {
524 1.1 rvb return 0;
525 1.1 rvb }
526 1.1 rvb
527 1.1 rvb
528 1.17 perry /*
529 1.1 rvb * kernel-internal debugging switches
530 1.1 rvb */
531 1.1 rvb
532 1.3 rvb void coda_debugon(void)
533 1.1 rvb {
534 1.3 rvb codadebug = -1;
535 1.3 rvb coda_nc_debug = -1;
536 1.3 rvb coda_vnop_print_entry = 1;
537 1.3 rvb coda_psdev_print_entry = 1;
538 1.3 rvb coda_vfsop_print_entry = 1;
539 1.3 rvb }
540 1.3 rvb
541 1.3 rvb void coda_debugoff(void)
542 1.3 rvb {
543 1.3 rvb codadebug = 0;
544 1.3 rvb coda_nc_debug = 0;
545 1.3 rvb coda_vnop_print_entry = 0;
546 1.3 rvb coda_psdev_print_entry = 0;
547 1.3 rvb coda_vfsop_print_entry = 0;
548 1.1 rvb }
549 1.1 rvb
550 1.27 christos /* How to print a ucred */
551 1.27 christos void
552 1.27 christos coda_print_cred(kauth_cred_t cred)
553 1.27 christos {
554 1.27 christos
555 1.27 christos uint16_t ngroups;
556 1.27 christos int i;
557 1.27 christos
558 1.27 christos myprintf(("ref %d\tuid %d\n", kauth_cred_getrefcnt(cred),
559 1.27 christos kauth_cred_geteuid(cred)));
560 1.27 christos
561 1.27 christos ngroups = kauth_cred_ngroups(cred);
562 1.27 christos for (i=0; i < ngroups; i++)
563 1.27 christos myprintf(("\tgroup %d: (%d)\n", i, kauth_cred_group(cred, i)));
564 1.27 christos myprintf(("\n"));
565 1.27 christos
566 1.27 christos }
567 1.27 christos
568 1.1 rvb /*
569 1.1 rvb * Utilities used by both client and server
570 1.1 rvb * Standard levels:
571 1.1 rvb * 0) no debugging
572 1.1 rvb * 1) hard failures
573 1.1 rvb * 2) soft failures
574 1.1 rvb * 3) current test software
575 1.1 rvb * 4) main procedure entry points
576 1.1 rvb * 5) main procedure exit points
577 1.1 rvb * 6) utility procedure entry points
578 1.1 rvb * 7) utility procedure exit points
579 1.1 rvb * 8) obscure procedure entry points
580 1.1 rvb * 9) obscure procedure exit points
581 1.1 rvb * 10) random stuff
582 1.1 rvb * 11) all <= 1
583 1.1 rvb * 12) all <= 2
584 1.1 rvb * 13) all <= 3
585 1.1 rvb * ...
586 1.1 rvb */
587