fid.c 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  1. /*
  2. * V9FS FID Management
  3. *
  4. * Copyright (C) 2007 by Latchesar Ionkov <lucho@ionkov.net>
  5. * Copyright (C) 2005, 2006 by Eric Van Hensbergen <ericvh@gmail.com>
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License version 2
  9. * as published by the Free Software Foundation.
  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. #include <linux/module.h>
  24. #include <linux/errno.h>
  25. #include <linux/fs.h>
  26. #include <linux/slab.h>
  27. #include <linux/sched.h>
  28. #include <linux/idr.h>
  29. #include <net/9p/9p.h>
  30. #include <net/9p/client.h>
  31. #include "v9fs.h"
  32. #include "v9fs_vfs.h"
  33. #include "fid.h"
  34. /**
  35. * v9fs_fid_add - add a fid to a dentry
  36. * @dentry: dentry that the fid is being added to
  37. * @fid: fid to add
  38. *
  39. */
  40. int v9fs_fid_add(struct dentry *dentry, struct p9_fid *fid)
  41. {
  42. struct v9fs_dentry *dent;
  43. p9_debug(P9_DEBUG_VFS, "fid %d dentry %s\n",
  44. fid->fid, dentry->d_name.name);
  45. dent = dentry->d_fsdata;
  46. if (!dent) {
  47. dent = kmalloc(sizeof(struct v9fs_dentry), GFP_KERNEL);
  48. if (!dent)
  49. return -ENOMEM;
  50. spin_lock_init(&dent->lock);
  51. INIT_LIST_HEAD(&dent->fidlist);
  52. dentry->d_fsdata = dent;
  53. }
  54. spin_lock(&dent->lock);
  55. list_add(&fid->dlist, &dent->fidlist);
  56. spin_unlock(&dent->lock);
  57. return 0;
  58. }
  59. /**
  60. * v9fs_fid_find - retrieve a fid that belongs to the specified uid
  61. * @dentry: dentry to look for fid in
  62. * @uid: return fid that belongs to the specified user
  63. * @any: if non-zero, return any fid associated with the dentry
  64. *
  65. */
  66. static struct p9_fid *v9fs_fid_find(struct dentry *dentry, u32 uid, int any)
  67. {
  68. struct v9fs_dentry *dent;
  69. struct p9_fid *fid, *ret;
  70. p9_debug(P9_DEBUG_VFS, " dentry: %s (%p) uid %d any %d\n",
  71. dentry->d_name.name, dentry, uid, any);
  72. dent = (struct v9fs_dentry *) dentry->d_fsdata;
  73. ret = NULL;
  74. if (dent) {
  75. spin_lock(&dent->lock);
  76. list_for_each_entry(fid, &dent->fidlist, dlist) {
  77. if (any || fid->uid == uid) {
  78. ret = fid;
  79. break;
  80. }
  81. }
  82. spin_unlock(&dent->lock);
  83. }
  84. return ret;
  85. }
  86. /*
  87. * We need to hold v9ses->rename_sem as long as we hold references
  88. * to returned path array. Array element contain pointers to
  89. * dentry names.
  90. */
  91. static int build_path_from_dentry(struct v9fs_session_info *v9ses,
  92. struct dentry *dentry, char ***names)
  93. {
  94. int n = 0, i;
  95. char **wnames;
  96. struct dentry *ds;
  97. for (ds = dentry; !IS_ROOT(ds); ds = ds->d_parent)
  98. n++;
  99. wnames = kmalloc(sizeof(char *) * n, GFP_KERNEL);
  100. if (!wnames)
  101. goto err_out;
  102. for (ds = dentry, i = (n-1); i >= 0; i--, ds = ds->d_parent)
  103. wnames[i] = (char *)ds->d_name.name;
  104. *names = wnames;
  105. return n;
  106. err_out:
  107. return -ENOMEM;
  108. }
  109. static struct p9_fid *v9fs_fid_lookup_with_uid(struct dentry *dentry,
  110. uid_t uid, int any)
  111. {
  112. struct dentry *ds;
  113. char **wnames, *uname;
  114. int i, n, l, clone, access;
  115. struct v9fs_session_info *v9ses;
  116. struct p9_fid *fid, *old_fid = NULL;
  117. v9ses = v9fs_dentry2v9ses(dentry);
  118. access = v9ses->flags & V9FS_ACCESS_MASK;
  119. fid = v9fs_fid_find(dentry, uid, any);
  120. if (fid)
  121. return fid;
  122. /*
  123. * we don't have a matching fid. To do a TWALK we need
  124. * parent fid. We need to prevent rename when we want to
  125. * look at the parent.
  126. */
  127. down_read(&v9ses->rename_sem);
  128. ds = dentry->d_parent;
  129. fid = v9fs_fid_find(ds, uid, any);
  130. if (fid) {
  131. /* Found the parent fid do a lookup with that */
  132. fid = p9_client_walk(fid, 1, (char **)&dentry->d_name.name, 1);
  133. goto fid_out;
  134. }
  135. up_read(&v9ses->rename_sem);
  136. /* start from the root and try to do a lookup */
  137. fid = v9fs_fid_find(dentry->d_sb->s_root, uid, any);
  138. if (!fid) {
  139. /* the user is not attached to the fs yet */
  140. if (access == V9FS_ACCESS_SINGLE)
  141. return ERR_PTR(-EPERM);
  142. if (v9fs_proto_dotu(v9ses) || v9fs_proto_dotl(v9ses))
  143. uname = NULL;
  144. else
  145. uname = v9ses->uname;
  146. fid = p9_client_attach(v9ses->clnt, NULL, uname, uid,
  147. v9ses->aname);
  148. if (IS_ERR(fid))
  149. return fid;
  150. v9fs_fid_add(dentry->d_sb->s_root, fid);
  151. }
  152. /* If we are root ourself just return that */
  153. if (dentry->d_sb->s_root == dentry)
  154. return fid;
  155. /*
  156. * Do a multipath walk with attached root.
  157. * When walking parent we need to make sure we
  158. * don't have a parallel rename happening
  159. */
  160. down_read(&v9ses->rename_sem);
  161. n = build_path_from_dentry(v9ses, dentry, &wnames);
  162. if (n < 0) {
  163. fid = ERR_PTR(n);
  164. goto err_out;
  165. }
  166. clone = 1;
  167. i = 0;
  168. while (i < n) {
  169. l = min(n - i, P9_MAXWELEM);
  170. /*
  171. * We need to hold rename lock when doing a multipath
  172. * walk to ensure none of the patch component change
  173. */
  174. fid = p9_client_walk(fid, l, &wnames[i], clone);
  175. if (IS_ERR(fid)) {
  176. if (old_fid) {
  177. /*
  178. * If we fail, clunk fid which are mapping
  179. * to path component and not the last component
  180. * of the path.
  181. */
  182. p9_client_clunk(old_fid);
  183. }
  184. kfree(wnames);
  185. goto err_out;
  186. }
  187. old_fid = fid;
  188. i += l;
  189. clone = 0;
  190. }
  191. kfree(wnames);
  192. fid_out:
  193. if (!IS_ERR(fid))
  194. v9fs_fid_add(dentry, fid);
  195. err_out:
  196. up_read(&v9ses->rename_sem);
  197. return fid;
  198. }
  199. /**
  200. * v9fs_fid_lookup - lookup for a fid, try to walk if not found
  201. * @dentry: dentry to look for fid in
  202. *
  203. * Look for a fid in the specified dentry for the current user.
  204. * If no fid is found, try to create one walking from a fid from the parent
  205. * dentry (if it has one), or the root dentry. If the user haven't accessed
  206. * the fs yet, attach now and walk from the root.
  207. */
  208. struct p9_fid *v9fs_fid_lookup(struct dentry *dentry)
  209. {
  210. uid_t uid;
  211. int any, access;
  212. struct v9fs_session_info *v9ses;
  213. v9ses = v9fs_dentry2v9ses(dentry);
  214. access = v9ses->flags & V9FS_ACCESS_MASK;
  215. switch (access) {
  216. case V9FS_ACCESS_SINGLE:
  217. case V9FS_ACCESS_USER:
  218. case V9FS_ACCESS_CLIENT:
  219. uid = current_fsuid();
  220. any = 0;
  221. break;
  222. case V9FS_ACCESS_ANY:
  223. uid = v9ses->uid;
  224. any = 1;
  225. break;
  226. default:
  227. uid = ~0;
  228. any = 0;
  229. break;
  230. }
  231. return v9fs_fid_lookup_with_uid(dentry, uid, any);
  232. }
  233. struct p9_fid *v9fs_fid_clone(struct dentry *dentry)
  234. {
  235. struct p9_fid *fid, *ret;
  236. fid = v9fs_fid_lookup(dentry);
  237. if (IS_ERR(fid))
  238. return fid;
  239. ret = p9_client_walk(fid, 0, NULL, 1);
  240. return ret;
  241. }
  242. static struct p9_fid *v9fs_fid_clone_with_uid(struct dentry *dentry, uid_t uid)
  243. {
  244. struct p9_fid *fid, *ret;
  245. fid = v9fs_fid_lookup_with_uid(dentry, uid, 0);
  246. if (IS_ERR(fid))
  247. return fid;
  248. ret = p9_client_walk(fid, 0, NULL, 1);
  249. return ret;
  250. }
  251. struct p9_fid *v9fs_writeback_fid(struct dentry *dentry)
  252. {
  253. int err;
  254. struct p9_fid *fid;
  255. fid = v9fs_fid_clone_with_uid(dentry, 0);
  256. if (IS_ERR(fid))
  257. goto error_out;
  258. /*
  259. * writeback fid will only be used to write back the
  260. * dirty pages. We always request for the open fid in read-write
  261. * mode so that a partial page write which result in page
  262. * read can work.
  263. */
  264. err = p9_client_open(fid, O_RDWR);
  265. if (err < 0) {
  266. p9_client_clunk(fid);
  267. fid = ERR_PTR(err);
  268. goto error_out;
  269. }
  270. error_out:
  271. return fid;
  272. }