fid.c 7.2 KB

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