]> bbs.cooldavid.org Git - net-next-2.6.git/blame - fs/9p/fid.c
Merge branch 'for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/rostedt...
[net-next-2.6.git] / fs / 9p / fid.c
CommitLineData
3ed8491c
EVH
1/*
2 * V9FS FID Management
3 *
ba17674f 4 * Copyright (C) 2007 by Latchesar Ionkov <lucho@ionkov.net>
46f6dac2 5 * Copyright (C) 2005, 2006 by Eric Van Hensbergen <ericvh@gmail.com>
3ed8491c
EVH
6 *
7 * This program is free software; you can redistribute it and/or modify
42e8c509
EVH
8 * it under the terms of the GNU General Public License version 2
9 * as published by the Free Software Foundation.
3ed8491c
EVH
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to:
18 * Free Software Foundation
19 * 51 Franklin Street, Fifth Floor
20 * Boston, MA 02111-1301 USA
21 *
22 */
23
3ed8491c
EVH
24#include <linux/module.h>
25#include <linux/errno.h>
26#include <linux/fs.h>
5a0e3ad6 27#include <linux/slab.h>
914e2637 28#include <linux/sched.h>
3ed8491c 29#include <linux/idr.h>
bd238fb4
LI
30#include <net/9p/9p.h>
31#include <net/9p/client.h>
3ed8491c 32
3ed8491c 33#include "v9fs.h"
3ed8491c 34#include "v9fs_vfs.h"
3ed8491c
EVH
35#include "fid.h"
36
37/**
ba17674f
LI
38 * v9fs_fid_add - add a fid to a dentry
39 * @dentry: dentry that the fid is being added to
3ed8491c 40 * @fid: fid to add
3ed8491c
EVH
41 *
42 */
43
bd238fb4 44int v9fs_fid_add(struct dentry *dentry, struct p9_fid *fid)
3ed8491c 45{
bd238fb4 46 struct v9fs_dentry *dent;
3ed8491c 47
bd238fb4 48 P9_DPRINTK(P9_DEBUG_VFS, "fid %d dentry %s\n",
7dd0cdc5 49 fid->fid, dentry->d_name.name);
3ed8491c 50
bd238fb4
LI
51 dent = dentry->d_fsdata;
52 if (!dent) {
53 dent = kmalloc(sizeof(struct v9fs_dentry), GFP_KERNEL);
54 if (!dent)
55 return -ENOMEM;
3ed8491c 56
bd238fb4
LI
57 spin_lock_init(&dent->lock);
58 INIT_LIST_HEAD(&dent->fidlist);
59 dentry->d_fsdata = dent;
3ed8491c
EVH
60 }
61
bd238fb4
LI
62 spin_lock(&dent->lock);
63 list_add(&fid->dlist, &dent->fidlist);
64 spin_unlock(&dent->lock);
3ed8491c 65
bd238fb4 66 return 0;
3ed8491c
EVH
67}
68
69/**
ba17674f 70 * v9fs_fid_find - retrieve a fid that belongs to the specified uid
3ed8491c 71 * @dentry: dentry to look for fid in
ba17674f
LI
72 * @uid: return fid that belongs to the specified user
73 * @any: if non-zero, return any fid associated with the dentry
3ed8491c
EVH
74 *
75 */
76
ba17674f 77static struct p9_fid *v9fs_fid_find(struct dentry *dentry, u32 uid, int any)
3ed8491c 78{
bd238fb4 79 struct v9fs_dentry *dent;
ba17674f
LI
80 struct p9_fid *fid, *ret;
81
82 P9_DPRINTK(P9_DEBUG_VFS, " dentry: %s (%p) uid %d any %d\n",
7dd0cdc5 83 dentry->d_name.name, dentry, uid, any);
ba17674f
LI
84 dent = (struct v9fs_dentry *) dentry->d_fsdata;
85 ret = NULL;
86 if (dent) {
87 spin_lock(&dent->lock);
88 list_for_each_entry(fid, &dent->fidlist, dlist) {
89 if (any || fid->uid == uid) {
90 ret = fid;
91 break;
92 }
93 }
94 spin_unlock(&dent->lock);
95 }
bd238fb4 96
ba17674f 97 return ret;
bd238fb4 98}
3ed8491c 99
a534c8d1
AK
100/*
101 * We need to hold v9ses->rename_sem as long as we hold references
102 * to returned path array. Array element contain pointers to
103 * dentry names.
104 */
105static int build_path_from_dentry(struct v9fs_session_info *v9ses,
106 struct dentry *dentry, char ***names)
107{
108 int n = 0, i;
109 char **wnames;
110 struct dentry *ds;
111
112 for (ds = dentry; !IS_ROOT(ds); ds = ds->d_parent)
113 n++;
114
115 wnames = kmalloc(sizeof(char *) * n, GFP_KERNEL);
116 if (!wnames)
117 goto err_out;
118
119 for (ds = dentry, i = (n-1); i >= 0; i--, ds = ds->d_parent)
120 wnames[i] = (char *)ds->d_name.name;
121
122 *names = wnames;
123 return n;
124err_out:
125 return -ENOMEM;
126}
127
da977b2c 128/**
ba17674f 129 * v9fs_fid_lookup - lookup for a fid, try to walk if not found
da977b2c
EVH
130 * @dentry: dentry to look for fid in
131 *
ba17674f
LI
132 * Look for a fid in the specified dentry for the current user.
133 * If no fid is found, try to create one walking from a fid from the parent
134 * dentry (if it has one), or the root dentry. If the user haven't accessed
135 * the fs yet, attach now and walk from the root.
da977b2c
EVH
136 */
137
ba17674f 138struct p9_fid *v9fs_fid_lookup(struct dentry *dentry)
da977b2c 139{
ba17674f
LI
140 int i, n, l, clone, any, access;
141 u32 uid;
5b0fa207 142 struct p9_fid *fid, *old_fid = NULL;
a534c8d1 143 struct dentry *ds;
ba17674f
LI
144 struct v9fs_session_info *v9ses;
145 char **wnames, *uname;
146
147 v9ses = v9fs_inode2v9ses(dentry->d_inode);
148 access = v9ses->flags & V9FS_ACCESS_MASK;
149 switch (access) {
150 case V9FS_ACCESS_SINGLE:
151 case V9FS_ACCESS_USER:
76381a42 152 case V9FS_ACCESS_CLIENT:
f8b9d53a 153 uid = current_fsuid();
ba17674f
LI
154 any = 0;
155 break;
156
157 case V9FS_ACCESS_ANY:
158 uid = v9ses->uid;
159 any = 1;
160 break;
161
162 default:
163 uid = ~0;
164 any = 0;
165 break;
166 }
da977b2c 167
ba17674f
LI
168 fid = v9fs_fid_find(dentry, uid, any);
169 if (fid)
170 return fid;
a534c8d1
AK
171 /*
172 * we don't have a matching fid. To do a TWALK we need
173 * parent fid. We need to prevent rename when we want to
174 * look at the parent.
175 */
176 down_read(&v9ses->rename_sem);
ba17674f
LI
177 ds = dentry->d_parent;
178 fid = v9fs_fid_find(ds, uid, any);
a534c8d1
AK
179 if (fid) {
180 /* Found the parent fid do a lookup with that */
181 fid = p9_client_walk(fid, 1, (char **)&dentry->d_name.name, 1);
182 goto fid_out;
183 }
184 up_read(&v9ses->rename_sem);
ba17674f 185
a534c8d1
AK
186 /* start from the root and try to do a lookup */
187 fid = v9fs_fid_find(dentry->d_sb->s_root, uid, any);
188 if (!fid) {
189 /* the user is not attached to the fs yet */
190 if (access == V9FS_ACCESS_SINGLE)
191 return ERR_PTR(-EPERM);
ba17674f 192
a534c8d1
AK
193 if (v9fs_proto_dotu(v9ses) || v9fs_proto_dotl(v9ses))
194 uname = NULL;
195 else
196 uname = v9ses->uname;
ba17674f 197
a534c8d1
AK
198 fid = p9_client_attach(v9ses->clnt, NULL, uname, uid,
199 v9ses->aname);
200 if (IS_ERR(fid))
201 return fid;
ba17674f 202
a534c8d1
AK
203 v9fs_fid_add(dentry->d_sb->s_root, fid);
204 }
205 /* If we are root ourself just return that */
206 if (dentry->d_sb->s_root == dentry)
ba17674f 207 return fid;
a534c8d1
AK
208 /*
209 * Do a multipath walk with attached root.
210 * When walking parent we need to make sure we
211 * don't have a parallel rename happening
212 */
213 down_read(&v9ses->rename_sem);
214 n = build_path_from_dentry(v9ses, dentry, &wnames);
215 if (n < 0) {
216 fid = ERR_PTR(n);
217 goto err_out;
218 }
ba17674f
LI
219 clone = 1;
220 i = 0;
221 while (i < n) {
222 l = min(n - i, P9_MAXWELEM);
a534c8d1
AK
223 /*
224 * We need to hold rename lock when doing a multipath
225 * walk to ensure none of the patch component change
226 */
ba17674f 227 fid = p9_client_walk(fid, l, &wnames[i], clone);
c55703d8 228 if (IS_ERR(fid)) {
5b0fa207
AK
229 if (old_fid) {
230 /*
231 * If we fail, clunk fid which are mapping
232 * to path component and not the last component
233 * of the path.
234 */
235 p9_client_clunk(old_fid);
236 }
ba17674f 237 kfree(wnames);
a534c8d1 238 goto err_out;
ba17674f 239 }
5b0fa207 240 old_fid = fid;
ba17674f
LI
241 i += l;
242 clone = 0;
243 }
ba17674f 244 kfree(wnames);
a534c8d1 245fid_out:
8f587df4
DC
246 if (!IS_ERR(fid))
247 v9fs_fid_add(dentry, fid);
a534c8d1
AK
248err_out:
249 up_read(&v9ses->rename_sem);
bd238fb4 250 return fid;
da977b2c 251}
ba17674f
LI
252
253struct p9_fid *v9fs_fid_clone(struct dentry *dentry)
254{
255 struct p9_fid *fid, *ret;
256
257 fid = v9fs_fid_lookup(dentry);
258 if (IS_ERR(fid))
259 return fid;
260
261 ret = p9_client_walk(fid, 0, NULL, 1);
262 return ret;
263}