2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
10 #include <linux/sched.h>
11 #include <linux/slab.h>
12 #include <linux/spinlock.h>
13 #include <linux/completion.h>
14 #include <linux/buffer_head.h>
15 #include <linux/smp_lock.h>
16 #include <linux/gfs2_ondisk.h>
17 #include <linux/crc32.h>
18 #include <linux/lm_interface.h>
24 #include "ops_dentry.h"
28 * gfs2_drevalidate - Check directory lookup consistency
29 * @dentry: the mapping to check
32 * Check to make sure the lookup necessary to arrive at this inode from its
33 * parent is still good.
35 * Returns: 1 if the dentry is ok, 0 if it isn't
38 static int gfs2_drevalidate(struct dentry
*dentry
, struct nameidata
*nd
)
40 struct dentry
*parent
= dget_parent(dentry
);
41 struct gfs2_sbd
*sdp
= GFS2_SB(parent
->d_inode
);
42 struct gfs2_inode
*dip
= GFS2_I(parent
->d_inode
);
43 struct inode
*inode
= dentry
->d_inode
;
44 struct gfs2_holder d_gh
;
45 struct gfs2_inode
*ip
;
46 struct gfs2_inum inum
;
50 if (inode
&& is_bad_inode(inode
))
53 if (sdp
->sd_args
.ar_localcaching
)
56 error
= gfs2_glock_nq_init(dip
->i_gl
, LM_ST_SHARED
, 0, &d_gh
);
60 error
= gfs2_dir_search(parent
->d_inode
, &dentry
->d_name
, &inum
, &type
);
76 if (!gfs2_inum_equal(&ip
->i_num
, &inum
))
79 if (IF2DT(ip
->i_di
.di_mode
) != type
) {
80 gfs2_consist_inode(dip
);
85 gfs2_glock_dq_uninit(&d_gh
);
91 gfs2_glock_dq_uninit(&d_gh
);
93 if (inode
&& S_ISDIR(inode
->i_mode
)) {
94 if (have_submounts(dentry
))
96 shrink_dcache_parent(dentry
);
103 gfs2_glock_dq_uninit(&d_gh
);
109 static int gfs2_dhash(struct dentry
*dentry
, struct qstr
*str
)
111 str
->hash
= gfs2_disk_hash(str
->name
, str
->len
);
115 struct dentry_operations gfs2_dops
= {
116 .d_revalidate
= gfs2_drevalidate
,
117 .d_hash
= gfs2_dhash
,