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/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/completion.h>
13 #include <linux/buffer_head.h>
14 #include <linux/exportfs.h>
15 #include <linux/gfs2_ondisk.h>
16 #include <linux/crc32.h>
17 #include <linux/lm_interface.h>
25 #include "ops_dentry.h"
26 #include "ops_fstype.h"
30 #define GFS2_SMALL_FH_SIZE 4
31 #define GFS2_LARGE_FH_SIZE 8
32 #define GFS2_OLD_FH_SIZE 10
34 static int gfs2_encode_fh(struct dentry
*dentry
, __u32
*p
, int *len
,
37 __be32
*fh
= (__force __be32
*)p
;
38 struct inode
*inode
= dentry
->d_inode
;
39 struct super_block
*sb
= inode
->i_sb
;
40 struct gfs2_inode
*ip
= GFS2_I(inode
);
42 if (*len
< GFS2_SMALL_FH_SIZE
||
43 (connectable
&& *len
< GFS2_LARGE_FH_SIZE
))
46 fh
[0] = cpu_to_be32(ip
->i_no_formal_ino
>> 32);
47 fh
[1] = cpu_to_be32(ip
->i_no_formal_ino
& 0xFFFFFFFF);
48 fh
[2] = cpu_to_be32(ip
->i_no_addr
>> 32);
49 fh
[3] = cpu_to_be32(ip
->i_no_addr
& 0xFFFFFFFF);
50 *len
= GFS2_SMALL_FH_SIZE
;
52 if (!connectable
|| inode
== sb
->s_root
->d_inode
)
55 spin_lock(&dentry
->d_lock
);
56 inode
= dentry
->d_parent
->d_inode
;
59 spin_unlock(&dentry
->d_lock
);
61 fh
[4] = cpu_to_be32(ip
->i_no_formal_ino
>> 32);
62 fh
[5] = cpu_to_be32(ip
->i_no_formal_ino
& 0xFFFFFFFF);
63 fh
[6] = cpu_to_be32(ip
->i_no_addr
>> 32);
64 fh
[7] = cpu_to_be32(ip
->i_no_addr
& 0xFFFFFFFF);
65 *len
= GFS2_LARGE_FH_SIZE
;
72 struct get_name_filldir
{
73 struct gfs2_inum_host inum
;
77 static int get_name_filldir(void *opaque
, const char *name
, int length
,
78 loff_t offset
, u64 inum
, unsigned int type
)
80 struct get_name_filldir
*gnfd
= opaque
;
82 if (inum
!= gnfd
->inum
.no_addr
)
85 memcpy(gnfd
->name
, name
, length
);
86 gnfd
->name
[length
] = 0;
91 static int gfs2_get_name(struct dentry
*parent
, char *name
,
94 struct inode
*dir
= parent
->d_inode
;
95 struct inode
*inode
= child
->d_inode
;
96 struct gfs2_inode
*dip
, *ip
;
97 struct get_name_filldir gnfd
;
98 struct gfs2_holder gh
;
105 if (!S_ISDIR(dir
->i_mode
) || !inode
)
112 gnfd
.inum
.no_addr
= ip
->i_no_addr
;
113 gnfd
.inum
.no_formal_ino
= ip
->i_no_formal_ino
;
116 error
= gfs2_glock_nq_init(dip
->i_gl
, LM_ST_SHARED
, 0, &gh
);
120 error
= gfs2_dir_read(dir
, &offset
, &gnfd
, get_name_filldir
);
122 gfs2_glock_dq_uninit(&gh
);
124 if (!error
&& !*name
)
130 static struct dentry
*gfs2_get_parent(struct dentry
*child
)
134 struct dentry
*dentry
;
136 gfs2_str2qstr(&dotdot
, "..");
137 inode
= gfs2_lookupi(child
->d_inode
, &dotdot
, 1, NULL
);
140 return ERR_PTR(-ENOENT
);
142 * In case of an error, @inode carries the error value, and we
143 * have to return that as a(n invalid) pointer to dentry.
146 return ERR_PTR(PTR_ERR(inode
));
148 dentry
= d_alloc_anon(inode
);
151 return ERR_PTR(-ENOMEM
);
154 dentry
->d_op
= &gfs2_dops
;
158 static struct dentry
*gfs2_get_dentry(struct super_block
*sb
,
159 struct gfs2_inum_host
*inum
)
161 struct gfs2_sbd
*sdp
= sb
->s_fs_info
;
162 struct gfs2_holder i_gh
, ri_gh
, rgd_gh
;
163 struct gfs2_rgrpd
*rgd
;
165 struct dentry
*dentry
;
170 inode
= gfs2_ilookup(sb
, inum
->no_addr
);
172 if (GFS2_I(inode
)->i_no_formal_ino
!= inum
->no_formal_ino
) {
174 return ERR_PTR(-ESTALE
);
179 error
= gfs2_glock_nq_num(sdp
, inum
->no_addr
, &gfs2_inode_glops
,
180 LM_ST_SHARED
, LM_FLAG_ANY
, &i_gh
);
182 return ERR_PTR(error
);
184 error
= gfs2_rindex_hold(sdp
, &ri_gh
);
189 rgd
= gfs2_blk2rgrpd(sdp
, inum
->no_addr
);
193 error
= gfs2_glock_nq_init(rgd
->rd_gl
, LM_ST_SHARED
, 0, &rgd_gh
);
198 if (gfs2_get_block_type(rgd
, inum
->no_addr
) != GFS2_BLKST_DINODE
)
201 gfs2_glock_dq_uninit(&rgd_gh
);
202 gfs2_glock_dq_uninit(&ri_gh
);
204 inode
= gfs2_inode_lookup(sb
, DT_UNKNOWN
,
210 error
= PTR_ERR(inode
);
214 error
= gfs2_inode_refresh(GFS2_I(inode
));
220 /* Pick up the works we bypass in gfs2_inode_lookup */
221 if (inode
->i_state
& I_NEW
)
224 if (GFS2_I(inode
)->i_no_formal_ino
!= inum
->no_formal_ino
) {
230 if (GFS2_I(inode
)->i_di
.di_flags
& GFS2_DIF_SYSTEM
) {
235 gfs2_glock_dq_uninit(&i_gh
);
238 dentry
= d_alloc_anon(inode
);
241 return ERR_PTR(-ENOMEM
);
244 dentry
->d_op
= &gfs2_dops
;
248 gfs2_glock_dq_uninit(&rgd_gh
);
251 gfs2_glock_dq_uninit(&ri_gh
);
254 gfs2_glock_dq_uninit(&i_gh
);
255 return ERR_PTR(error
);
258 static struct dentry
*gfs2_fh_to_dentry(struct super_block
*sb
, struct fid
*fid
,
259 int fh_len
, int fh_type
)
261 struct gfs2_inum_host
this;
262 __be32
*fh
= (__force __be32
*)fid
->raw
;
265 case GFS2_SMALL_FH_SIZE
:
266 case GFS2_LARGE_FH_SIZE
:
267 case GFS2_OLD_FH_SIZE
:
268 this.no_formal_ino
= ((u64
)be32_to_cpu(fh
[0])) << 32;
269 this.no_formal_ino
|= be32_to_cpu(fh
[1]);
270 this.no_addr
= ((u64
)be32_to_cpu(fh
[2])) << 32;
271 this.no_addr
|= be32_to_cpu(fh
[3]);
272 return gfs2_get_dentry(sb
, &this);
278 static struct dentry
*gfs2_fh_to_parent(struct super_block
*sb
, struct fid
*fid
,
279 int fh_len
, int fh_type
)
281 struct gfs2_inum_host parent
;
282 __be32
*fh
= (__force __be32
*)fid
->raw
;
285 case GFS2_LARGE_FH_SIZE
:
286 case GFS2_OLD_FH_SIZE
:
287 parent
.no_formal_ino
= ((u64
)be32_to_cpu(fh
[4])) << 32;
288 parent
.no_formal_ino
|= be32_to_cpu(fh
[5]);
289 parent
.no_addr
= ((u64
)be32_to_cpu(fh
[6])) << 32;
290 parent
.no_addr
|= be32_to_cpu(fh
[7]);
291 return gfs2_get_dentry(sb
, &parent
);
297 const struct export_operations gfs2_export_ops
= {
298 .encode_fh
= gfs2_encode_fh
,
299 .fh_to_dentry
= gfs2_fh_to_dentry
,
300 .fh_to_parent
= gfs2_fh_to_parent
,
301 .get_name
= gfs2_get_name
,
302 .get_parent
= gfs2_get_parent
,