1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
|
/*
* Copyright (c) 1995 - 2002 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <xfs/xfs_locl.h>
#include <xfs/xfs_common.h>
#include <xfs/xfs_fs.h>
#include <xfs/xfs_deb.h>
#include <xfs/xfs_vnodeops.h>
RCSID("$Id: xfs_node-bsd.c,v 1.4 2002/06/07 04:10:32 hin Exp $");
extern vop_t **xfs_vnodeop_p;
#ifndef LK_NOPAUSE
#define LK_NOPAUSE 0
#endif
/*
* Allocate a new vnode with handle `handle' in `mp' and return it in
* `vpp'. Return 0 or error.
*/
int
xfs_getnewvnode(struct mount *mp, struct vnode **vpp,
struct xfs_handle *handle)
{
struct xfs_node *result;
int error;
error = getnewvnode(VT_AFS, mp, xfs_vnodeop_p, vpp);
if (error)
return error;
result = xfs_alloc(sizeof(*result));
bzero(result, sizeof(*result));
(*vpp)->v_data = result;
result->vn = *vpp;
result->handle = *handle;
result->flags = 0;
result->tokens = 0;
#if defined(HAVE_KERNEL_LOCKMGR) || defined(HAVE_KERNEL_DEBUGLOCKMGR)
lockinit (&result->lock, PVFS, "xfs_lock", 0, LK_NOPAUSE);
#else
result->vnlocks = 0;
#endif
result->anonrights = 0;
result->cred = NULL;
return 0;
}
/*
* Create a new xfs_node and make a vget
*
* Also prevents creation of duplicates. This happens
* whenever there are more than one name to a file,
* "." and ".." are common cases. */
int
new_xfs_node(struct xfs *xfsp,
struct xfs_msg_node *node,
struct xfs_node **xpp,
struct proc *p)
{
struct xfs_node *result;
XFSDEB(XDEBNODE, ("new_xfs_node (%d,%d,%d,%d)\n",
node->handle.a,
node->handle.b,
node->handle.c,
node->handle.d));
retry:
/* Does not allow duplicates */
result = xfs_node_find(xfsp, &node->handle);
if (result == 0) {
int error;
struct vnode *v;
error = xfs_getnewvnode(XFS_TO_VFS(xfsp), &v, &node->handle);
if (error)
return error;
result = VNODE_TO_XNODE(v);
result->anonrights = node->anonrights;
xfsp->nnodes++;
} else {
/* Node is already cached */
if(xfs_do_vget(XNODE_TO_VNODE(result), 0, p))
goto retry;
}
/* Init other fields */
xfs_attr2vattr(&node->attr, &result->attr, 1);
result->vn->v_type = result->attr.va_type;
result->tokens = node->tokens;
bcopy(node->id, result->id, sizeof(result->id));
bcopy(node->rights, result->rights, sizeof(result->rights));
#ifdef __APPLE__
if (result->vn->v_type == VREG && (!UBCINFOEXISTS(result->vn)))
ubc_info_init(result->vn);
#endif
*xpp = result;
XFSDEB(XDEBNODE, ("return: new_xfs_node\n"));
return 0;
}
void
free_xfs_node(struct xfs_node *node)
{
struct xfs *xfsp = XFS_FROM_XNODE(node);
XFSDEB(XDEBNODE, ("free_xfs_node(%lx) (%d,%d,%d,%d)\n",
(unsigned long)node,
node->handle.a,
node->handle.b,
node->handle.c,
node->handle.d));
/* XXX Really need to put back dirty data first. */
if (DATA_FROM_XNODE(node)) {
vrele(DATA_FROM_XNODE(node));
DATA_FROM_XNODE(node) = NULL;
}
xfsp->nnodes--;
XNODE_TO_VNODE(node)->v_data = NULL;
if (node->cred) {
crfree (node->cred);
node->cred = NULL;
}
xfs_free(node, sizeof(*node));
XFSDEB(XDEBNODE, ("free_xfs_node done\n"));
}
/*
* FreeBSD 4.4 and newer changed to API to vflush around June 2001
*/
static int
xfs_vflush(struct mount *mp, int flags)
{
#if __FreeBSD__ && __FreeBSD_version > 430000
return vflush(mp, 0, flags);
#else
return vflush(mp, NULL, flags);
#endif
}
int
free_all_xfs_nodes(struct xfs *xfsp, int flags, int unmountp)
{
int error = 0;
struct mount *mp = XFS_TO_VFS(xfsp);
if (mp == NULL) {
XFSDEB(XDEBNODE, ("free_all_xfs_nodes already freed\n"));
return 0;
}
XFSDEB(XDEBNODE, ("free_all_xfs_nodes starting\n"));
xfs_dnlc_purge_mp(mp);
if (xfsp->root) {
XFSDEB(XDEBNODE, ("free_all_xfs_nodes now removing root\n"));
vgone(XNODE_TO_VNODE(xfsp->root));
xfsp->root = NULL;
}
XFSDEB(XDEBNODE, ("free_all_xfs_nodes root removed\n"));
XFSDEB(XDEBNODE, ("free_all_xfs_nodes now killing all remaining nodes\n"));
/*
* If we have a syncer vnode, release it (to emulate dounmount)
* and the create it again when if we are going to need it.
*/
#ifdef HAVE_STRUCT_MOUNT_MNT_SYNCER
if (!unmountp) {
if (mp->mnt_syncer != NULL) {
#ifdef HAVE_KERNEL_VFS_DEALLOCATE_SYNCVNODE
vfs_deallocate_syncvnode(mp);
#else
/*
* FreeBSD and OpenBSD uses different semantics,
* FreeBSD does vrele, and OpenBSD does vgone.
*/
#if defined(__OpenBSD__)
vgone(mp->mnt_syncer);
#elif defined(__FreeBSD__)
vrele(mp->mnt_syncer);
#else
#error what os do you use ?
#endif
mp->mnt_syncer = NULL;
#endif
}
}
#endif
error = xfs_vflush(mp, flags);
#ifdef HAVE_STRUCT_MOUNT_MNT_SYNCER
if (!unmountp) {
XFSDEB(XDEBNODE, ("free_all_xfs_nodes not flushing syncer vnode\n"));
if (mp->mnt_syncer == NULL)
if (vfs_allocate_syncvnode(mp))
panic("failed to allocate syncer node when xfs daemon died");
}
#endif
if (error) {
XFSDEB(XDEBNODE, ("xfree_all_xfs_nodes: vflush() error == %d\n",
error));
return error;
}
XFSDEB(XDEBNODE, ("free_all_xfs_nodes done\n"));
return error;
}
struct xfs_node *
xfs_node_find(struct xfs *xfsp, xfs_handle *handlep)
{
struct vnode *t;
struct xfs_node *xn = NULL;
XFSDEB(XDEBNODE, ("xfs_node_find: xfsp = %lx "
" handlep = (%d,%d,%d,%d)\n",
(unsigned long)xfsp,
handlep->a,
handlep->b,
handlep->c,
handlep->d));
/*
* XXXSMP - the vnodes on mnt_vnodelist are invalid unless we hold
* mntvnode_slock (same on Open,Free and Net - current).
* XXX - Another problem here is that the data in the vnode doesn't
* have to be correct unless we do a vget first (if usecount on
* vnode == 0). This should only be a problem when someone uses
* revoke, when unmounting or when arlad dies or on systems
* with a shortage of vnodes.
* We might want to vget here, but that was a problem
* on FreeBSD once.
*/
/* FreeBSD 4.5 and above did rename mnt_vnodelist to mnt_nvnodelist */
#ifdef HAVE_STRUCT_MOUNT_MNT_NVNODELIST
TAILQ_FOREACH(t, &XFS_TO_VFS(xfsp)->mnt_nvnodelist, v_nmntvnodes) {
xn = VNODE_TO_XNODE(t);
if (xn && xfs_handle_eq(&xn->handle, handlep))
break;
}
#else
LIST_FOREACH(t, &XFS_TO_VFS(xfsp)->mnt_vnodelist, v_mntvnodes) {
xn = VNODE_TO_XNODE(t);
if (xn && xfs_handle_eq(&xn->handle, handlep))
break;
}
#endif
if (t != NULL)
return xn;
else
return NULL;
}
void
vattr2xfs_attr(const struct vattr *va, struct xfs_attr *xa)
{
bzero(xa, sizeof(*xa));
if (va->va_mode != (mode_t)VNOVAL)
XA_SET_MODE(xa, va->va_mode);
if (va->va_nlink != VNOVAL)
XA_SET_NLINK(xa, va->va_nlink);
if (va->va_size != VNOVAL)
XA_SET_SIZE(xa, va->va_size);
if (va->va_uid != VNOVAL)
XA_SET_UID(xa, va->va_uid);
if (va->va_gid != VNOVAL)
XA_SET_GID(xa, va->va_gid);
if (va->va_atime.tv_sec != VNOVAL)
XA_SET_ATIME(xa, va->va_atime.tv_sec);
if (va->va_mtime.tv_sec != VNOVAL)
XA_SET_MTIME(xa, va->va_mtime.tv_sec);
if (va->va_ctime.tv_sec != VNOVAL)
XA_SET_CTIME(xa, va->va_ctime.tv_sec);
if (va->va_fileid != VNOVAL)
XA_SET_FILEID(xa, va->va_fileid);
switch (va->va_type) {
case VNON:
xa->xa_type = XFS_FILE_NON;
break;
case VREG:
xa->xa_type = XFS_FILE_REG;
break;
case VDIR:
xa->xa_type = XFS_FILE_DIR;
break;
case VBLK:
xa->xa_type = XFS_FILE_BLK;
break;
case VCHR:
xa->xa_type = XFS_FILE_CHR;
break;
case VLNK:
xa->xa_type = XFS_FILE_LNK;
break;
case VSOCK:
xa->xa_type = XFS_FILE_SOCK;
break;
case VFIFO:
xa->xa_type = XFS_FILE_FIFO;
break;
case VBAD:
xa->xa_type = XFS_FILE_BAD;
break;
default:
panic("xfs_attr2attr: bad value");
}
}
#define SET_TIMEVAL(X, S, N) do { (X)->tv_sec = (S); (X)->tv_nsec = (N); } while(0)
void
xfs_attr2vattr(const struct xfs_attr *xa, struct vattr *va, int clear_node)
{
if (clear_node)
VATTR_NULL(va);
if (XA_VALID_MODE(xa))
va->va_mode = xa->xa_mode;
if (XA_VALID_NLINK(xa))
va->va_nlink = xa->xa_nlink;
if (XA_VALID_SIZE(xa))
va->va_size = xa->xa_size;
if (XA_VALID_UID(xa))
va->va_uid = xa->xa_uid;
if (XA_VALID_GID(xa))
va->va_gid = xa->xa_gid;
if (XA_VALID_ATIME(xa)) {
SET_TIMEVAL(&va->va_atime, xa->xa_atime, 0);
}
if (XA_VALID_MTIME(xa)) {
SET_TIMEVAL(&va->va_mtime, xa->xa_mtime, 0);
}
if (XA_VALID_CTIME(xa)) {
SET_TIMEVAL(&va->va_ctime, xa->xa_ctime, 0);
}
if (XA_VALID_FILEID(xa)) {
va->va_fileid = xa->xa_fileid;
}
if (XA_VALID_TYPE(xa)) {
switch (xa->xa_type) {
case XFS_FILE_NON:
va->va_type = VNON;
break;
case XFS_FILE_REG:
va->va_type = VREG;
break;
case XFS_FILE_DIR:
va->va_type = VDIR;
break;
case XFS_FILE_BLK:
va->va_type = VBLK;
break;
case XFS_FILE_CHR:
va->va_type = VCHR;
break;
case XFS_FILE_LNK:
va->va_type = VLNK;
break;
case XFS_FILE_SOCK:
va->va_type = VSOCK;
break;
case XFS_FILE_FIFO:
va->va_type = VFIFO;
break;
case XFS_FILE_BAD:
va->va_type = VBAD;
break;
default:
panic("xfs_attr2vattr: bad value");
}
}
va->va_flags = 0;
va->va_blocksize = 8192;
va->va_bytes = va->va_size;
}
/*
* A single entry DNLC for systems for handling long names that don't
* get put into the system DNLC.
*/
struct long_entry {
struct vnode *dvp, *vp;
char name[MAXNAMLEN + 1];
size_t len;
u_long dvpid, vpid;
};
static struct long_entry tbl;
/*
* Nuke the `tbl'
*/
static void
tbl_clear (void)
{
tbl.dvp = tbl.vp = NULL;
tbl.name[0] = '\0';
tbl.len = 0;
tbl.dvpid = tbl.vpid = 0;
}
/*
* Set the entry in the `tbl'
*/
static void
tbl_enter (size_t len, const char *name, struct vnode *dvp, struct vnode *vp)
{
tbl.len = len;
bcopy(name, tbl.name, len);
tbl.dvp = dvp;
tbl.vp = vp;
tbl.dvpid = dvp->v_id;
tbl.vpid = vp->v_id;
}
/*
* Lookup in tbl (`dvp', `name', `len') and return result in `res'.
* Return -1 if succesful, otherwise 0.
*/
static int
tbl_lookup (struct componentname *cnp,
struct vnode *dvp,
struct vnode **res)
{
if (tbl.dvp == dvp
&& tbl.len == cnp->cn_namelen
&& strncmp(tbl.name, cnp->cn_nameptr, tbl.len) == 0
&& tbl.dvpid == tbl.dvp->v_id
&& tbl.vpid == tbl.vp->v_id) {
*res = tbl.vp;
return -1;
} else
return 0;
}
/*
* Store a componentname in the DNLC
*/
int
xfs_dnlc_enter(struct vnode *dvp,
xfs_componentname *cnp,
struct vnode *vp)
{
XFSDEB(XDEBDNLC, ("xfs_dnlc_enter_cnp(%lx, %lx, %lx)\n",
(unsigned long)dvp,
(unsigned long)cnp,
(unsigned long)vp));
XFSDEB(XDEBDNLC, ("xfs_dnlc_enter: v_id = %ld\n", dvp->v_id));
XFSDEB(XDEBDNLC, ("xfs_dnlc_enter: calling cache_enter:"
"dvp = %lx, vp = %lx, cnp = (%s, %ld), "
"nameiop = %lu, flags = %lx\n",
(unsigned long)dvp,
(unsigned long)vp,
cnp->cn_nameptr, cnp->cn_namelen,
cnp->cn_nameiop, cnp->cn_flags));
#ifdef NCHNAMLEN
if (cnp->cn_namelen <= NCHNAMLEN)
#endif
{
/*
* This is to make sure there's no negative entry already in the dnlc
*/
u_long save_nameiop;
u_long save_flags;
struct vnode *dummy;
save_nameiop = cnp->cn_nameiop;
save_flags = cnp->cn_flags;
cnp->cn_nameiop = CREATE;
cnp->cn_flags &= ~MAKEENTRY;
/*
* The version number here is not entirely correct, but it's conservative.
* The real change is sys/kern/vfs_cache:1.20
*/
#if __NetBSD_Version__ >= 104120000
if (cache_lookup(dvp, &dummy, cnp) != -1) {
VOP_UNLOCK(dummy, 0);
printf ("XFS PANIC WARNING! xfs_dnlc_enter: %s already in cache\n",
cnp->cn_nameptr);
}
#else
if (cache_lookup(dvp, &dummy, cnp) != 0) {
printf ("XFS PANIC WARNING! xfs_dnlc_enter: %s already in cache\n",
cnp->cn_nameptr);
}
#endif
cnp->cn_nameiop = save_nameiop;
cnp->cn_flags = save_flags;
cache_enter(dvp, vp, cnp);
}
if (vp != NULL)
tbl_enter (cnp->cn_namelen, cnp->cn_nameptr, dvp, vp);
return 0;
}
static void
xfs_cnp_init (struct componentname *cn,
const char *name,
struct proc *proc, struct ucred *cred,
int nameiop)
{
const unsigned char *p;
bzero(cn, sizeof(*cn));
cn->cn_nameptr = (char *)name;
cn->cn_namelen = strlen(name);
cn->cn_flags = 0;
#if __APPLE__
{
int i;
cn->cn_hash = 0;
for (p = cn->cn_nameptr, i = 1; *p; ++p, ++i)
cn->cn_hash += *p * i;
}
#elif defined(HAVE_STRUCT_COMPONENTNAME_CN_HASH)
cn->cn_hash = 0;
for (p = cn->cn_nameptr; *p; ++p)
cn->cn_hash += *p;
#endif
cn->cn_nameiop = nameiop;
cn->cn_proc = proc;
cn->cn_cred = cred;
}
/*
* Store (dvp, name, vp) in the DNLC
*/
int
xfs_dnlc_enter_name(struct vnode *dvp,
const char *name,
struct vnode *vp)
{
struct componentname cn;
XFSDEB(XDEBDNLC, ("xfs_dnlc_enter_name(%lx, \"%s\", %lx)\n",
(unsigned long)dvp,
name,
(unsigned long)vp));
xfs_cnp_init (&cn, name, NULL, NULL, LOOKUP);
return xfs_dnlc_enter (dvp, &cn, vp);
}
/*
* Lookup (dvp, cnp) in the DNLC and return the result in `res'.
* Return the result from cache_lookup.
*/
static int
xfs_dnlc_lookup_int(struct vnode *dvp,
xfs_componentname *cnp,
struct vnode **res)
{
int error;
u_long saved_flags;
XFSDEB(XDEBDNLC, ("xfs_dnlc_lookup(%lx, \"%s\")\n",
(unsigned long)dvp, cnp->cn_nameptr));
XFSDEB(XDEBDNLC, ("xfs_dnlc_lookup: v_id = %ld\n", dvp->v_id));
XFSDEB(XDEBDNLC, ("xfs_dnlc_lookup: calling cache_lookup:"
"dvp = %lx, cnp = (%s, %ld), flags = %lx\n",
(unsigned long)dvp,
cnp->cn_nameptr, cnp->cn_namelen,
cnp->cn_flags));
saved_flags = cnp->cn_flags;
cnp->cn_flags |= MAKEENTRY | LOCKPARENT | ISLASTCN;
error = cache_lookup(dvp, res, cnp);
cnp->cn_flags = saved_flags;
XFSDEB(XDEBDNLC, ("xfs_dnlc_lookup: cache_lookup returned. "
"error = %d, *res = %lx\n", error,
(unsigned long)*res));
return error;
}
/*
* do the last (and locking protocol) portion of xnlc_lookup
*
* return:
* -1 for succesful
* 0 for failed
*/
static int
xfs_dnlc_lock(struct vnode *dvp,
xfs_componentname *cnp,
struct vnode **res)
{
int error = 0;
/*
* Try to handle the (complex) BSD locking protocol.
*/
if (*res == dvp) { /* "." */
VREF(dvp);
} else if (cnp->cn_flags & ISDOTDOT) { /* ".." */
u_long vpid = dvp->v_id;
xfs_vfs_unlock(dvp, xfs_cnp_to_proc(cnp));
error = xfs_do_vget(*res, LK_EXCLUSIVE, xfs_cnp_to_proc(cnp));
xfs_vfs_writelock(dvp, xfs_cnp_to_proc(cnp));
if (error == 0 && dvp->v_id != vpid) {
vput(*res);
return 0;
}
} else {
error = xfs_do_vget(*res, LK_EXCLUSIVE, xfs_cnp_to_proc(cnp));
}
if (error == 0)
return -1;
else
return 0;
}
/*
* Lookup (`dvp', `cnp') in the DNLC (and the local cache).
*
* Return -1 if succesful, 0 if not and ENOENT if the entry is known
* not to exist.
*
* On modern NetBSD, cache_lookup has been changed to return 0 for
* succesful and -1 for not.
* (see the comment above for version information).
*/
#if __NetBSD_Version__ >= 104120000
int
xfs_dnlc_lookup(struct vnode *dvp,
xfs_componentname *cnp,
struct vnode **res)
{
int error = xfs_dnlc_lookup_int (dvp, cnp, res);
if (error == 0)
return -1;
else if (error == ENOENT)
return error;
error = tbl_lookup (cnp, dvp, res);
if (error != -1)
return error;
return xfs_dnlc_lock (dvp, cnp, res);
}
#else /* ! __NetBSD_Version__ >= 104120000 */
int
xfs_dnlc_lookup(struct vnode *dvp,
xfs_componentname *cnp,
struct vnode **res)
{
int error = xfs_dnlc_lookup_int (dvp, cnp, res);
if (error == 0)
error = tbl_lookup (cnp, dvp, res);
if (error != -1)
return error;
return xfs_dnlc_lock (dvp, cnp, res);
}
#endif /* __NetBSD_Version__ >= 104120000 */
/*
* Remove one entry from the DNLC
*/
void
xfs_dnlc_purge (struct vnode *vp)
{
XFSDEB(XDEBDNLC, ("xfs_dnlc_purge\n"));
if (tbl.dvp == vp || tbl.vp == vp)
tbl_clear ();
cache_purge(vp);
}
/*
* Remove all entries belong to `mp' from the DNLC
*/
void
xfs_dnlc_purge_mp(struct mount *mp)
{
XFSDEB(XDEBDNLC, ("xfs_dnlc_purge_mp()\n"));
tbl_clear ();
cache_purgevfs(mp);
}
/*
* Returns 1 if pag has any rights set in the node
*/
int
xfs_has_pag(const struct xfs_node *xn, xfs_pag_t pag)
{
int i;
for (i = 0; i < MAXRIGHTS; i++)
if (xn->id[i] == pag)
return 1;
return 0;
}
|