pnode.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358
  1. /*
  2. * linux/fs/pnode.c
  3. *
  4. * (C) Copyright IBM Corporation 2005.
  5. * Released under GPL v2.
  6. * Author : Ram Pai (linuxram@us.ibm.com)
  7. *
  8. */
  9. #include <linux/mnt_namespace.h>
  10. #include <linux/mount.h>
  11. #include <linux/fs.h>
  12. #include "internal.h"
  13. #include "pnode.h"
  14. /* return the next shared peer mount of @p */
  15. static inline struct vfsmount *next_peer(struct vfsmount *p)
  16. {
  17. return list_entry(p->mnt_share.next, struct vfsmount, mnt_share);
  18. }
  19. static inline struct vfsmount *first_slave(struct vfsmount *p)
  20. {
  21. return list_entry(p->mnt_slave_list.next, struct vfsmount, mnt_slave);
  22. }
  23. static inline struct vfsmount *next_slave(struct vfsmount *p)
  24. {
  25. return list_entry(p->mnt_slave.next, struct vfsmount, mnt_slave);
  26. }
  27. /*
  28. * Return true if path is reachable from root
  29. *
  30. * namespace_sem is held, and mnt is attached
  31. */
  32. static bool is_path_reachable(struct vfsmount *mnt, struct dentry *dentry,
  33. const struct path *root)
  34. {
  35. while (mnt != root->mnt && mnt->mnt_parent != mnt) {
  36. dentry = mnt->mnt_mountpoint;
  37. mnt = mnt->mnt_parent;
  38. }
  39. return mnt == root->mnt && is_subdir(dentry, root->dentry);
  40. }
  41. static struct vfsmount *get_peer_under_root(struct vfsmount *mnt,
  42. struct mnt_namespace *ns,
  43. const struct path *root)
  44. {
  45. struct vfsmount *m = mnt;
  46. do {
  47. /* Check the namespace first for optimization */
  48. if (m->mnt_ns == ns && is_path_reachable(m, m->mnt_root, root))
  49. return m;
  50. m = next_peer(m);
  51. } while (m != mnt);
  52. return NULL;
  53. }
  54. /*
  55. * Get ID of closest dominating peer group having a representative
  56. * under the given root.
  57. *
  58. * Caller must hold namespace_sem
  59. */
  60. int get_dominating_id(struct vfsmount *mnt, const struct path *root)
  61. {
  62. struct vfsmount *m;
  63. for (m = mnt->mnt_master; m != NULL; m = m->mnt_master) {
  64. struct vfsmount *d = get_peer_under_root(m, mnt->mnt_ns, root);
  65. if (d)
  66. return d->mnt_group_id;
  67. }
  68. return 0;
  69. }
  70. static int do_make_slave(struct vfsmount *mnt)
  71. {
  72. struct vfsmount *peer_mnt = mnt, *master = mnt->mnt_master;
  73. struct vfsmount *slave_mnt;
  74. /*
  75. * slave 'mnt' to a peer mount that has the
  76. * same root dentry. If none is available than
  77. * slave it to anything that is available.
  78. */
  79. while ((peer_mnt = next_peer(peer_mnt)) != mnt &&
  80. peer_mnt->mnt_root != mnt->mnt_root) ;
  81. if (peer_mnt == mnt) {
  82. peer_mnt = next_peer(mnt);
  83. if (peer_mnt == mnt)
  84. peer_mnt = NULL;
  85. }
  86. if (IS_MNT_SHARED(mnt) && list_empty(&mnt->mnt_share))
  87. mnt_release_group_id(mnt);
  88. list_del_init(&mnt->mnt_share);
  89. mnt->mnt_group_id = 0;
  90. if (peer_mnt)
  91. master = peer_mnt;
  92. if (master) {
  93. list_for_each_entry(slave_mnt, &mnt->mnt_slave_list, mnt_slave)
  94. slave_mnt->mnt_master = master;
  95. list_move(&mnt->mnt_slave, &master->mnt_slave_list);
  96. list_splice(&mnt->mnt_slave_list, master->mnt_slave_list.prev);
  97. INIT_LIST_HEAD(&mnt->mnt_slave_list);
  98. } else {
  99. struct list_head *p = &mnt->mnt_slave_list;
  100. while (!list_empty(p)) {
  101. slave_mnt = list_first_entry(p,
  102. struct vfsmount, mnt_slave);
  103. list_del_init(&slave_mnt->mnt_slave);
  104. slave_mnt->mnt_master = NULL;
  105. }
  106. }
  107. mnt->mnt_master = master;
  108. CLEAR_MNT_SHARED(mnt);
  109. return 0;
  110. }
  111. void change_mnt_propagation(struct vfsmount *mnt, int type)
  112. {
  113. if (type == MS_SHARED) {
  114. set_mnt_shared(mnt);
  115. return;
  116. }
  117. do_make_slave(mnt);
  118. if (type != MS_SLAVE) {
  119. list_del_init(&mnt->mnt_slave);
  120. mnt->mnt_master = NULL;
  121. if (type == MS_UNBINDABLE)
  122. mnt->mnt_flags |= MNT_UNBINDABLE;
  123. else
  124. mnt->mnt_flags &= ~MNT_UNBINDABLE;
  125. }
  126. }
  127. /*
  128. * get the next mount in the propagation tree.
  129. * @m: the mount seen last
  130. * @origin: the original mount from where the tree walk initiated
  131. */
  132. static struct vfsmount *propagation_next(struct vfsmount *m,
  133. struct vfsmount *origin)
  134. {
  135. /* are there any slaves of this mount? */
  136. if (!IS_MNT_NEW(m) && !list_empty(&m->mnt_slave_list))
  137. return first_slave(m);
  138. while (1) {
  139. struct vfsmount *next;
  140. struct vfsmount *master = m->mnt_master;
  141. if (master == origin->mnt_master) {
  142. next = next_peer(m);
  143. return ((next == origin) ? NULL : next);
  144. } else if (m->mnt_slave.next != &master->mnt_slave_list)
  145. return next_slave(m);
  146. /* back at master */
  147. m = master;
  148. }
  149. }
  150. /*
  151. * return the source mount to be used for cloning
  152. *
  153. * @dest the current destination mount
  154. * @last_dest the last seen destination mount
  155. * @last_src the last seen source mount
  156. * @type return CL_SLAVE if the new mount has to be
  157. * cloned as a slave.
  158. */
  159. static struct vfsmount *get_source(struct vfsmount *dest,
  160. struct vfsmount *last_dest,
  161. struct vfsmount *last_src,
  162. int *type)
  163. {
  164. struct vfsmount *p_last_src = NULL;
  165. struct vfsmount *p_last_dest = NULL;
  166. *type = CL_PROPAGATION;
  167. if (IS_MNT_SHARED(dest))
  168. *type |= CL_MAKE_SHARED;
  169. while (last_dest != dest->mnt_master) {
  170. p_last_dest = last_dest;
  171. p_last_src = last_src;
  172. last_dest = last_dest->mnt_master;
  173. last_src = last_src->mnt_master;
  174. }
  175. if (p_last_dest) {
  176. do {
  177. p_last_dest = next_peer(p_last_dest);
  178. } while (IS_MNT_NEW(p_last_dest));
  179. }
  180. if (dest != p_last_dest) {
  181. *type |= CL_SLAVE;
  182. return last_src;
  183. } else
  184. return p_last_src;
  185. }
  186. /*
  187. * mount 'source_mnt' under the destination 'dest_mnt' at
  188. * dentry 'dest_dentry'. And propagate that mount to
  189. * all the peer and slave mounts of 'dest_mnt'.
  190. * Link all the new mounts into a propagation tree headed at
  191. * source_mnt. Also link all the new mounts using ->mnt_list
  192. * headed at source_mnt's ->mnt_list
  193. *
  194. * @dest_mnt: destination mount.
  195. * @dest_dentry: destination dentry.
  196. * @source_mnt: source mount.
  197. * @tree_list : list of heads of trees to be attached.
  198. */
  199. int propagate_mnt(struct vfsmount *dest_mnt, struct dentry *dest_dentry,
  200. struct vfsmount *source_mnt, struct list_head *tree_list)
  201. {
  202. struct vfsmount *m, *child;
  203. int ret = 0;
  204. struct vfsmount *prev_dest_mnt = dest_mnt;
  205. struct vfsmount *prev_src_mnt = source_mnt;
  206. LIST_HEAD(tmp_list);
  207. LIST_HEAD(umount_list);
  208. for (m = propagation_next(dest_mnt, dest_mnt); m;
  209. m = propagation_next(m, dest_mnt)) {
  210. int type;
  211. struct vfsmount *source;
  212. if (IS_MNT_NEW(m))
  213. continue;
  214. source = get_source(m, prev_dest_mnt, prev_src_mnt, &type);
  215. if (!(child = copy_tree(source, source->mnt_root, type))) {
  216. ret = -ENOMEM;
  217. list_splice(tree_list, tmp_list.prev);
  218. goto out;
  219. }
  220. if (is_subdir(dest_dentry, m->mnt_root)) {
  221. mnt_set_mountpoint(m, dest_dentry, child);
  222. list_add_tail(&child->mnt_hash, tree_list);
  223. } else {
  224. /*
  225. * This can happen if the parent mount was bind mounted
  226. * on some subdirectory of a shared/slave mount.
  227. */
  228. list_add_tail(&child->mnt_hash, &tmp_list);
  229. }
  230. prev_dest_mnt = m;
  231. prev_src_mnt = child;
  232. }
  233. out:
  234. spin_lock(&vfsmount_lock);
  235. while (!list_empty(&tmp_list)) {
  236. child = list_first_entry(&tmp_list, struct vfsmount, mnt_hash);
  237. umount_tree(child, 0, &umount_list);
  238. }
  239. spin_unlock(&vfsmount_lock);
  240. release_mounts(&umount_list);
  241. return ret;
  242. }
  243. /*
  244. * return true if the refcount is greater than count
  245. */
  246. static inline int do_refcount_check(struct vfsmount *mnt, int count)
  247. {
  248. int mycount = atomic_read(&mnt->mnt_count) - mnt->mnt_ghosts;
  249. return (mycount > count);
  250. }
  251. /*
  252. * check if the mount 'mnt' can be unmounted successfully.
  253. * @mnt: the mount to be checked for unmount
  254. * NOTE: unmounting 'mnt' would naturally propagate to all
  255. * other mounts its parent propagates to.
  256. * Check if any of these mounts that **do not have submounts**
  257. * have more references than 'refcnt'. If so return busy.
  258. */
  259. int propagate_mount_busy(struct vfsmount *mnt, int refcnt)
  260. {
  261. struct vfsmount *m, *child;
  262. struct vfsmount *parent = mnt->mnt_parent;
  263. int ret = 0;
  264. if (mnt == parent)
  265. return do_refcount_check(mnt, refcnt);
  266. /*
  267. * quickly check if the current mount can be unmounted.
  268. * If not, we don't have to go checking for all other
  269. * mounts
  270. */
  271. if (!list_empty(&mnt->mnt_mounts) || do_refcount_check(mnt, refcnt))
  272. return 1;
  273. for (m = propagation_next(parent, parent); m;
  274. m = propagation_next(m, parent)) {
  275. child = __lookup_mnt(m, mnt->mnt_mountpoint, 0);
  276. if (child && list_empty(&child->mnt_mounts) &&
  277. (ret = do_refcount_check(child, 1)))
  278. break;
  279. }
  280. return ret;
  281. }
  282. /*
  283. * NOTE: unmounting 'mnt' naturally propagates to all other mounts its
  284. * parent propagates to.
  285. */
  286. static void __propagate_umount(struct vfsmount *mnt)
  287. {
  288. struct vfsmount *parent = mnt->mnt_parent;
  289. struct vfsmount *m;
  290. BUG_ON(parent == mnt);
  291. for (m = propagation_next(parent, parent); m;
  292. m = propagation_next(m, parent)) {
  293. struct vfsmount *child = __lookup_mnt(m,
  294. mnt->mnt_mountpoint, 0);
  295. /*
  296. * umount the child only if the child has no
  297. * other children
  298. */
  299. if (child && list_empty(&child->mnt_mounts))
  300. list_move_tail(&child->mnt_hash, &mnt->mnt_hash);
  301. }
  302. }
  303. /*
  304. * collect all mounts that receive propagation from the mount in @list,
  305. * and return these additional mounts in the same list.
  306. * @list: the list of mounts to be unmounted.
  307. */
  308. int propagate_umount(struct list_head *list)
  309. {
  310. struct vfsmount *mnt;
  311. list_for_each_entry(mnt, list, mnt_hash)
  312. __propagate_umount(mnt);
  313. return 0;
  314. }