dnotify.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432
  1. /*
  2. * Directory notifications for Linux.
  3. *
  4. * Copyright (C) 2000,2001,2002 Stephen Rothwell
  5. *
  6. * Copyright (C) 2009 Eric Paris <Red Hat Inc>
  7. * dnotify was largly rewritten to use the new fsnotify infrastructure
  8. *
  9. * This program is free software; you can redistribute it and/or modify it
  10. * under the terms of the GNU General Public License as published by the
  11. * Free Software Foundation; either version 2, or (at your option) any
  12. * later version.
  13. *
  14. * This program is distributed in the hope that it will be useful, but
  15. * WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. * General Public License for more details.
  18. */
  19. #include <linux/fs.h>
  20. #include <linux/module.h>
  21. #include <linux/sched.h>
  22. #include <linux/dnotify.h>
  23. #include <linux/init.h>
  24. #include <linux/spinlock.h>
  25. #include <linux/slab.h>
  26. #include <linux/fdtable.h>
  27. #include <linux/fsnotify_backend.h>
  28. int dir_notify_enable __read_mostly = 1;
  29. static struct kmem_cache *dnotify_struct_cache __read_mostly;
  30. static struct kmem_cache *dnotify_mark_cache __read_mostly;
  31. static struct fsnotify_group *dnotify_group __read_mostly;
  32. static DEFINE_MUTEX(dnotify_mark_mutex);
  33. /*
  34. * dnotify will attach one of these to each inode (i_fsnotify_marks) which
  35. * is being watched by dnotify. If multiple userspace applications are watching
  36. * the same directory with dnotify their information is chained in dn
  37. */
  38. struct dnotify_mark {
  39. struct fsnotify_mark fsn_mark;
  40. struct dnotify_struct *dn;
  41. };
  42. /*
  43. * When a process starts or stops watching an inode the set of events which
  44. * dnotify cares about for that inode may change. This function runs the
  45. * list of everything receiving dnotify events about this directory and calculates
  46. * the set of all those events. After it updates what dnotify is interested in
  47. * it calls the fsnotify function so it can update the set of all events relevant
  48. * to this inode.
  49. */
  50. static void dnotify_recalc_inode_mask(struct fsnotify_mark *fsn_mark)
  51. {
  52. __u32 new_mask, old_mask;
  53. struct dnotify_struct *dn;
  54. struct dnotify_mark *dn_mark = container_of(fsn_mark,
  55. struct dnotify_mark,
  56. fsn_mark);
  57. assert_spin_locked(&fsn_mark->lock);
  58. old_mask = fsn_mark->mask;
  59. new_mask = 0;
  60. for (dn = dn_mark->dn; dn != NULL; dn = dn->dn_next)
  61. new_mask |= (dn->dn_mask & ~FS_DN_MULTISHOT);
  62. fsnotify_set_mark_mask_locked(fsn_mark, new_mask);
  63. if (old_mask == new_mask)
  64. return;
  65. if (fsn_mark->i.inode)
  66. fsnotify_recalc_inode_mask(fsn_mark->i.inode);
  67. }
  68. /*
  69. * Mains fsnotify call where events are delivered to dnotify.
  70. * Find the dnotify mark on the relevant inode, run the list of dnotify structs
  71. * on that mark and determine which of them has expressed interest in receiving
  72. * events of this type. When found send the correct process and signal and
  73. * destroy the dnotify struct if it was not registered to receive multiple
  74. * events.
  75. */
  76. static int dnotify_handle_event(struct fsnotify_group *group,
  77. struct fsnotify_mark *mark,
  78. struct fsnotify_event *event)
  79. {
  80. struct fsnotify_mark *fsn_mark = NULL;
  81. struct dnotify_mark *dn_mark;
  82. struct inode *to_tell;
  83. struct dnotify_struct *dn;
  84. struct dnotify_struct **prev;
  85. struct fown_struct *fown;
  86. __u32 test_mask = event->mask & ~FS_EVENT_ON_CHILD;
  87. to_tell = event->to_tell;
  88. fsn_mark = fsnotify_find_inode_mark(group, to_tell);
  89. if (unlikely(!fsn_mark))
  90. return 0;
  91. dn_mark = container_of(fsn_mark, struct dnotify_mark, fsn_mark);
  92. spin_lock(&fsn_mark->lock);
  93. prev = &dn_mark->dn;
  94. while ((dn = *prev) != NULL) {
  95. if ((dn->dn_mask & test_mask) == 0) {
  96. prev = &dn->dn_next;
  97. continue;
  98. }
  99. fown = &dn->dn_filp->f_owner;
  100. send_sigio(fown, dn->dn_fd, POLL_MSG);
  101. if (dn->dn_mask & FS_DN_MULTISHOT)
  102. prev = &dn->dn_next;
  103. else {
  104. *prev = dn->dn_next;
  105. kmem_cache_free(dnotify_struct_cache, dn);
  106. dnotify_recalc_inode_mask(fsn_mark);
  107. }
  108. }
  109. spin_unlock(&fsn_mark->lock);
  110. fsnotify_put_mark(fsn_mark);
  111. return 0;
  112. }
  113. /*
  114. * Given an inode and mask determine if dnotify would be interested in sending
  115. * userspace notification for that pair.
  116. */
  117. static bool dnotify_should_send_event(struct fsnotify_group *group,
  118. struct inode *inode, struct vfsmount *mnt,
  119. struct fsnotify_mark *mark, __u32 mask,
  120. void *data, int data_type)
  121. {
  122. struct fsnotify_mark *fsn_mark;
  123. bool send;
  124. /* !dir_notify_enable should never get here, don't waste time checking
  125. if (!dir_notify_enable)
  126. return 0; */
  127. /* not a dir, dnotify doesn't care */
  128. if (!S_ISDIR(inode->i_mode))
  129. return false;
  130. fsn_mark = fsnotify_find_inode_mark(group, inode);
  131. if (!fsn_mark)
  132. return false;
  133. mask = (mask & ~FS_EVENT_ON_CHILD);
  134. send = (mask & fsn_mark->mask);
  135. fsnotify_put_mark(fsn_mark); /* matches fsnotify_find_inode_mark */
  136. return send;
  137. }
  138. static void dnotify_free_mark(struct fsnotify_mark *fsn_mark)
  139. {
  140. struct dnotify_mark *dn_mark = container_of(fsn_mark,
  141. struct dnotify_mark,
  142. fsn_mark);
  143. BUG_ON(dn_mark->dn);
  144. kmem_cache_free(dnotify_mark_cache, dn_mark);
  145. }
  146. static struct fsnotify_ops dnotify_fsnotify_ops = {
  147. .handle_event = dnotify_handle_event,
  148. .should_send_event = dnotify_should_send_event,
  149. .free_group_priv = NULL,
  150. .freeing_mark = NULL,
  151. .free_event_priv = NULL,
  152. };
  153. /*
  154. * Called every time a file is closed. Looks first for a dnotify mark on the
  155. * inode. If one is found run all of the ->dn structures attached to that
  156. * mark for one relevant to this process closing the file and remove that
  157. * dnotify_struct. If that was the last dnotify_struct also remove the
  158. * fsnotify_mark.
  159. */
  160. void dnotify_flush(struct file *filp, fl_owner_t id)
  161. {
  162. struct fsnotify_mark *fsn_mark;
  163. struct dnotify_mark *dn_mark;
  164. struct dnotify_struct *dn;
  165. struct dnotify_struct **prev;
  166. struct inode *inode;
  167. inode = filp->f_path.dentry->d_inode;
  168. if (!S_ISDIR(inode->i_mode))
  169. return;
  170. fsn_mark = fsnotify_find_inode_mark(dnotify_group, inode);
  171. if (!fsn_mark)
  172. return;
  173. dn_mark = container_of(fsn_mark, struct dnotify_mark, fsn_mark);
  174. mutex_lock(&dnotify_mark_mutex);
  175. spin_lock(&fsn_mark->lock);
  176. prev = &dn_mark->dn;
  177. while ((dn = *prev) != NULL) {
  178. if ((dn->dn_owner == id) && (dn->dn_filp == filp)) {
  179. *prev = dn->dn_next;
  180. kmem_cache_free(dnotify_struct_cache, dn);
  181. dnotify_recalc_inode_mask(fsn_mark);
  182. break;
  183. }
  184. prev = &dn->dn_next;
  185. }
  186. spin_unlock(&fsn_mark->lock);
  187. /* nothing else could have found us thanks to the dnotify_mark_mutex */
  188. if (dn_mark->dn == NULL)
  189. fsnotify_destroy_mark(fsn_mark);
  190. fsnotify_recalc_group_mask(dnotify_group);
  191. mutex_unlock(&dnotify_mark_mutex);
  192. fsnotify_put_mark(fsn_mark);
  193. }
  194. /* this conversion is done only at watch creation */
  195. static __u32 convert_arg(unsigned long arg)
  196. {
  197. __u32 new_mask = FS_EVENT_ON_CHILD;
  198. if (arg & DN_MULTISHOT)
  199. new_mask |= FS_DN_MULTISHOT;
  200. if (arg & DN_DELETE)
  201. new_mask |= (FS_DELETE | FS_MOVED_FROM);
  202. if (arg & DN_MODIFY)
  203. new_mask |= FS_MODIFY;
  204. if (arg & DN_ACCESS)
  205. new_mask |= FS_ACCESS;
  206. if (arg & DN_ATTRIB)
  207. new_mask |= FS_ATTRIB;
  208. if (arg & DN_RENAME)
  209. new_mask |= FS_DN_RENAME;
  210. if (arg & DN_CREATE)
  211. new_mask |= (FS_CREATE | FS_MOVED_TO);
  212. return new_mask;
  213. }
  214. /*
  215. * If multiple processes watch the same inode with dnotify there is only one
  216. * dnotify mark in inode->i_fsnotify_marks but we chain a dnotify_struct
  217. * onto that mark. This function either attaches the new dnotify_struct onto
  218. * that list, or it |= the mask onto an existing dnofiy_struct.
  219. */
  220. static int attach_dn(struct dnotify_struct *dn, struct dnotify_mark *dn_mark,
  221. fl_owner_t id, int fd, struct file *filp, __u32 mask)
  222. {
  223. struct dnotify_struct *odn;
  224. odn = dn_mark->dn;
  225. while (odn != NULL) {
  226. /* adding more events to existing dnofiy_struct? */
  227. if ((odn->dn_owner == id) && (odn->dn_filp == filp)) {
  228. odn->dn_fd = fd;
  229. odn->dn_mask |= mask;
  230. return -EEXIST;
  231. }
  232. odn = odn->dn_next;
  233. }
  234. dn->dn_mask = mask;
  235. dn->dn_fd = fd;
  236. dn->dn_filp = filp;
  237. dn->dn_owner = id;
  238. dn->dn_next = dn_mark->dn;
  239. dn_mark->dn = dn;
  240. return 0;
  241. }
  242. /*
  243. * When a process calls fcntl to attach a dnotify watch to a directory it ends
  244. * up here. Allocate both a mark for fsnotify to add and a dnotify_struct to be
  245. * attached to the fsnotify_mark.
  246. */
  247. int fcntl_dirnotify(int fd, struct file *filp, unsigned long arg)
  248. {
  249. struct dnotify_mark *new_dn_mark, *dn_mark;
  250. struct fsnotify_mark *new_fsn_mark, *fsn_mark;
  251. struct dnotify_struct *dn;
  252. struct inode *inode;
  253. fl_owner_t id = current->files;
  254. struct file *f;
  255. int destroy = 0, error = 0;
  256. __u32 mask;
  257. /* we use these to tell if we need to kfree */
  258. new_fsn_mark = NULL;
  259. dn = NULL;
  260. if (!dir_notify_enable) {
  261. error = -EINVAL;
  262. goto out_err;
  263. }
  264. /* a 0 mask means we are explicitly removing the watch */
  265. if ((arg & ~DN_MULTISHOT) == 0) {
  266. dnotify_flush(filp, id);
  267. error = 0;
  268. goto out_err;
  269. }
  270. /* dnotify only works on directories */
  271. inode = filp->f_path.dentry->d_inode;
  272. if (!S_ISDIR(inode->i_mode)) {
  273. error = -ENOTDIR;
  274. goto out_err;
  275. }
  276. /* expect most fcntl to add new rather than augment old */
  277. dn = kmem_cache_alloc(dnotify_struct_cache, GFP_KERNEL);
  278. if (!dn) {
  279. error = -ENOMEM;
  280. goto out_err;
  281. }
  282. /* new fsnotify mark, we expect most fcntl calls to add a new mark */
  283. new_dn_mark = kmem_cache_alloc(dnotify_mark_cache, GFP_KERNEL);
  284. if (!new_dn_mark) {
  285. error = -ENOMEM;
  286. goto out_err;
  287. }
  288. /* convert the userspace DN_* "arg" to the internal FS_* defines in fsnotify */
  289. mask = convert_arg(arg);
  290. /* set up the new_fsn_mark and new_dn_mark */
  291. new_fsn_mark = &new_dn_mark->fsn_mark;
  292. fsnotify_init_mark(new_fsn_mark, dnotify_free_mark);
  293. new_fsn_mark->mask = mask;
  294. new_dn_mark->dn = NULL;
  295. /* this is needed to prevent the fcntl/close race described below */
  296. mutex_lock(&dnotify_mark_mutex);
  297. /* add the new_fsn_mark or find an old one. */
  298. fsn_mark = fsnotify_find_inode_mark(dnotify_group, inode);
  299. if (fsn_mark) {
  300. dn_mark = container_of(fsn_mark, struct dnotify_mark, fsn_mark);
  301. spin_lock(&fsn_mark->lock);
  302. } else {
  303. fsnotify_add_mark(new_fsn_mark, dnotify_group, inode, NULL, 0);
  304. spin_lock(&new_fsn_mark->lock);
  305. fsn_mark = new_fsn_mark;
  306. dn_mark = new_dn_mark;
  307. /* we used new_fsn_mark, so don't free it */
  308. new_fsn_mark = NULL;
  309. }
  310. rcu_read_lock();
  311. f = fcheck(fd);
  312. rcu_read_unlock();
  313. /* if (f != filp) means that we lost a race and another task/thread
  314. * actually closed the fd we are still playing with before we grabbed
  315. * the dnotify_mark_mutex and fsn_mark->lock. Since closing the fd is the
  316. * only time we clean up the marks we need to get our mark off
  317. * the list. */
  318. if (f != filp) {
  319. /* if we added ourselves, shoot ourselves, it's possible that
  320. * the flush actually did shoot this fsn_mark. That's fine too
  321. * since multiple calls to destroy_mark is perfectly safe, if
  322. * we found a dn_mark already attached to the inode, just sod
  323. * off silently as the flush at close time dealt with it.
  324. */
  325. if (dn_mark == new_dn_mark)
  326. destroy = 1;
  327. goto out;
  328. }
  329. error = __f_setown(filp, task_pid(current), PIDTYPE_PID, 0);
  330. if (error) {
  331. /* if we added, we must shoot */
  332. if (dn_mark == new_dn_mark)
  333. destroy = 1;
  334. goto out;
  335. }
  336. error = attach_dn(dn, dn_mark, id, fd, filp, mask);
  337. /* !error means that we attached the dn to the dn_mark, so don't free it */
  338. if (!error)
  339. dn = NULL;
  340. /* -EEXIST means that we didn't add this new dn and used an old one.
  341. * that isn't an error (and the unused dn should be freed) */
  342. else if (error == -EEXIST)
  343. error = 0;
  344. dnotify_recalc_inode_mask(fsn_mark);
  345. out:
  346. spin_unlock(&fsn_mark->lock);
  347. if (destroy)
  348. fsnotify_destroy_mark(fsn_mark);
  349. fsnotify_recalc_group_mask(dnotify_group);
  350. mutex_unlock(&dnotify_mark_mutex);
  351. fsnotify_put_mark(fsn_mark);
  352. out_err:
  353. if (new_fsn_mark)
  354. fsnotify_put_mark(new_fsn_mark);
  355. if (dn)
  356. kmem_cache_free(dnotify_struct_cache, dn);
  357. return error;
  358. }
  359. static int __init dnotify_init(void)
  360. {
  361. dnotify_struct_cache = KMEM_CACHE(dnotify_struct, SLAB_PANIC);
  362. dnotify_mark_cache = KMEM_CACHE(dnotify_mark, SLAB_PANIC);
  363. dnotify_group = fsnotify_alloc_group(&dnotify_fsnotify_ops);
  364. if (IS_ERR(dnotify_group))
  365. panic("unable to allocate fsnotify group for dnotify\n");
  366. return 0;
  367. }
  368. module_init(dnotify_init)