fid.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262
  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_DPRINTK(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_DPRINTK(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. /**
  110. * v9fs_fid_lookup - lookup for a fid, try to walk if not found
  111. * @dentry: dentry to look for fid in
  112. *
  113. * Look for a fid in the specified dentry for the current user.
  114. * If no fid is found, try to create one walking from a fid from the parent
  115. * dentry (if it has one), or the root dentry. If the user haven't accessed
  116. * the fs yet, attach now and walk from the root.
  117. */
  118. struct p9_fid *v9fs_fid_lookup(struct dentry *dentry)
  119. {
  120. int i, n, l, clone, any, access;
  121. u32 uid;
  122. struct p9_fid *fid, *old_fid = NULL;
  123. struct dentry *ds;
  124. struct v9fs_session_info *v9ses;
  125. char **wnames, *uname;
  126. v9ses = v9fs_inode2v9ses(dentry->d_inode);
  127. access = v9ses->flags & V9FS_ACCESS_MASK;
  128. switch (access) {
  129. case V9FS_ACCESS_SINGLE:
  130. case V9FS_ACCESS_USER:
  131. uid = current_fsuid();
  132. any = 0;
  133. break;
  134. case V9FS_ACCESS_ANY:
  135. uid = v9ses->uid;
  136. any = 1;
  137. break;
  138. default:
  139. uid = ~0;
  140. any = 0;
  141. break;
  142. }
  143. fid = v9fs_fid_find(dentry, uid, any);
  144. if (fid)
  145. return fid;
  146. /*
  147. * we don't have a matching fid. To do a TWALK we need
  148. * parent fid. We need to prevent rename when we want to
  149. * look at the parent.
  150. */
  151. down_read(&v9ses->rename_sem);
  152. ds = dentry->d_parent;
  153. fid = v9fs_fid_find(ds, uid, any);
  154. if (fid) {
  155. /* Found the parent fid do a lookup with that */
  156. fid = p9_client_walk(fid, 1, (char **)&dentry->d_name.name, 1);
  157. goto fid_out;
  158. }
  159. up_read(&v9ses->rename_sem);
  160. /* start from the root and try to do a lookup */
  161. fid = v9fs_fid_find(dentry->d_sb->s_root, uid, any);
  162. if (!fid) {
  163. /* the user is not attached to the fs yet */
  164. if (access == V9FS_ACCESS_SINGLE)
  165. return ERR_PTR(-EPERM);
  166. if (v9fs_proto_dotu(v9ses) || v9fs_proto_dotl(v9ses))
  167. uname = NULL;
  168. else
  169. uname = v9ses->uname;
  170. fid = p9_client_attach(v9ses->clnt, NULL, uname, uid,
  171. v9ses->aname);
  172. if (IS_ERR(fid))
  173. return fid;
  174. v9fs_fid_add(dentry->d_sb->s_root, fid);
  175. }
  176. /* If we are root ourself just return that */
  177. if (dentry->d_sb->s_root == dentry)
  178. return fid;
  179. /*
  180. * Do a multipath walk with attached root.
  181. * When walking parent we need to make sure we
  182. * don't have a parallel rename happening
  183. */
  184. down_read(&v9ses->rename_sem);
  185. n = build_path_from_dentry(v9ses, dentry, &wnames);
  186. if (n < 0) {
  187. fid = ERR_PTR(n);
  188. goto err_out;
  189. }
  190. clone = 1;
  191. i = 0;
  192. while (i < n) {
  193. l = min(n - i, P9_MAXWELEM);
  194. /*
  195. * We need to hold rename lock when doing a multipath
  196. * walk to ensure none of the patch component change
  197. */
  198. fid = p9_client_walk(fid, l, &wnames[i], clone);
  199. if (IS_ERR(fid)) {
  200. if (old_fid) {
  201. /*
  202. * If we fail, clunk fid which are mapping
  203. * to path component and not the last component
  204. * of the path.
  205. */
  206. p9_client_clunk(old_fid);
  207. }
  208. kfree(wnames);
  209. goto err_out;
  210. }
  211. old_fid = fid;
  212. i += l;
  213. clone = 0;
  214. }
  215. kfree(wnames);
  216. fid_out:
  217. if (!IS_ERR(fid))
  218. v9fs_fid_add(dentry, fid);
  219. err_out:
  220. up_read(&v9ses->rename_sem);
  221. return fid;
  222. }
  223. struct p9_fid *v9fs_fid_clone(struct dentry *dentry)
  224. {
  225. struct p9_fid *fid, *ret;
  226. fid = v9fs_fid_lookup(dentry);
  227. if (IS_ERR(fid))
  228. return fid;
  229. ret = p9_client_walk(fid, 0, NULL, 1);
  230. return ret;
  231. }