notification.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
  1. /*
  2. * Copyright (C) 2008 Red Hat, Inc., Eric Paris <eparis@redhat.com>
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2, or (at your option)
  7. * any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; see the file COPYING. If not, write to
  16. * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
  17. */
  18. /*
  19. * Basic idea behind the notification queue: An fsnotify group (like inotify)
  20. * sends the userspace notification about events asyncronously some time after
  21. * the event happened. When inotify gets an event it will need to add that
  22. * event to the group notify queue. Since a single event might need to be on
  23. * multiple group's notification queues we can't add the event directly to each
  24. * queue and instead add a small "event_holder" to each queue. This event_holder
  25. * has a pointer back to the original event. Since the majority of events are
  26. * going to end up on one, and only one, notification queue we embed one
  27. * event_holder into each event. This means we have a single allocation instead
  28. * of always needing two. If the embedded event_holder is already in use by
  29. * another group a new event_holder (from fsnotify_event_holder_cachep) will be
  30. * allocated and used.
  31. */
  32. #include <linux/fs.h>
  33. #include <linux/init.h>
  34. #include <linux/kernel.h>
  35. #include <linux/list.h>
  36. #include <linux/module.h>
  37. #include <linux/mount.h>
  38. #include <linux/mutex.h>
  39. #include <linux/namei.h>
  40. #include <linux/path.h>
  41. #include <linux/slab.h>
  42. #include <linux/spinlock.h>
  43. #include <asm/atomic.h>
  44. #include <linux/fsnotify_backend.h>
  45. #include "fsnotify.h"
  46. static struct kmem_cache *fsnotify_event_cachep;
  47. static struct kmem_cache *fsnotify_event_holder_cachep;
  48. /*
  49. * This is a magic event we send when the q is too full. Since it doesn't
  50. * hold real event information we just keep one system wide and use it any time
  51. * it is needed. It's refcnt is set 1 at kernel init time and will never
  52. * get set to 0 so it will never get 'freed'
  53. */
  54. static struct fsnotify_event *q_overflow_event;
  55. static atomic_t fsnotify_sync_cookie = ATOMIC_INIT(0);
  56. /**
  57. * fsnotify_get_cookie - return a unique cookie for use in synchronizing events.
  58. * Called from fsnotify_move, which is inlined into filesystem modules.
  59. */
  60. u32 fsnotify_get_cookie(void)
  61. {
  62. return atomic_inc_return(&fsnotify_sync_cookie);
  63. }
  64. EXPORT_SYMBOL_GPL(fsnotify_get_cookie);
  65. /* return true if the notify queue is empty, false otherwise */
  66. bool fsnotify_notify_queue_is_empty(struct fsnotify_group *group)
  67. {
  68. BUG_ON(!mutex_is_locked(&group->notification_mutex));
  69. return list_empty(&group->notification_list) ? true : false;
  70. }
  71. void fsnotify_get_event(struct fsnotify_event *event)
  72. {
  73. atomic_inc(&event->refcnt);
  74. }
  75. void fsnotify_put_event(struct fsnotify_event *event)
  76. {
  77. if (!event)
  78. return;
  79. if (atomic_dec_and_test(&event->refcnt)) {
  80. if (event->data_type == FSNOTIFY_EVENT_PATH)
  81. path_put(&event->path);
  82. BUG_ON(!list_empty(&event->private_data_list));
  83. kfree(event->file_name);
  84. kmem_cache_free(fsnotify_event_cachep, event);
  85. }
  86. }
  87. struct fsnotify_event_holder *fsnotify_alloc_event_holder(void)
  88. {
  89. return kmem_cache_alloc(fsnotify_event_holder_cachep, GFP_KERNEL);
  90. }
  91. void fsnotify_destroy_event_holder(struct fsnotify_event_holder *holder)
  92. {
  93. if (holder)
  94. kmem_cache_free(fsnotify_event_holder_cachep, holder);
  95. }
  96. /*
  97. * Find the private data that the group previously attached to this event when
  98. * the group added the event to the notification queue (fsnotify_add_notify_event)
  99. */
  100. struct fsnotify_event_private_data *fsnotify_remove_priv_from_event(struct fsnotify_group *group, struct fsnotify_event *event)
  101. {
  102. struct fsnotify_event_private_data *lpriv;
  103. struct fsnotify_event_private_data *priv = NULL;
  104. assert_spin_locked(&event->lock);
  105. list_for_each_entry(lpriv, &event->private_data_list, event_list) {
  106. if (lpriv->group == group) {
  107. priv = lpriv;
  108. list_del(&priv->event_list);
  109. break;
  110. }
  111. }
  112. return priv;
  113. }
  114. /*
  115. * Add an event to the group notification queue. The group can later pull this
  116. * event off the queue to deal with. If the event is successfully added to the
  117. * group's notification queue, a reference is taken on event.
  118. */
  119. int fsnotify_add_notify_event(struct fsnotify_group *group, struct fsnotify_event *event,
  120. struct fsnotify_event_private_data *priv,
  121. int (*merge)(struct list_head *, struct fsnotify_event *))
  122. {
  123. struct fsnotify_event_holder *holder = NULL;
  124. struct list_head *list = &group->notification_list;
  125. int rc = 0;
  126. /*
  127. * There is one fsnotify_event_holder embedded inside each fsnotify_event.
  128. * Check if we expect to be able to use that holder. If not alloc a new
  129. * holder.
  130. * For the overflow event it's possible that something will use the in
  131. * event holder before we get the lock so we may need to jump back and
  132. * alloc a new holder, this can't happen for most events...
  133. */
  134. if (!list_empty(&event->holder.event_list)) {
  135. alloc_holder:
  136. holder = fsnotify_alloc_event_holder();
  137. if (!holder)
  138. return -ENOMEM;
  139. }
  140. mutex_lock(&group->notification_mutex);
  141. if (group->q_len >= group->max_events) {
  142. event = q_overflow_event;
  143. rc = -EOVERFLOW;
  144. /* sorry, no private data on the overflow event */
  145. priv = NULL;
  146. }
  147. if (!list_empty(list) && merge) {
  148. int ret;
  149. ret = merge(list, event);
  150. if (ret) {
  151. mutex_unlock(&group->notification_mutex);
  152. if (holder != &event->holder)
  153. fsnotify_destroy_event_holder(holder);
  154. return ret;
  155. }
  156. }
  157. spin_lock(&event->lock);
  158. if (list_empty(&event->holder.event_list)) {
  159. if (unlikely(holder))
  160. fsnotify_destroy_event_holder(holder);
  161. holder = &event->holder;
  162. } else if (unlikely(!holder)) {
  163. /* between the time we checked above and got the lock the in
  164. * event holder was used, go back and get a new one */
  165. spin_unlock(&event->lock);
  166. mutex_unlock(&group->notification_mutex);
  167. goto alloc_holder;
  168. }
  169. group->q_len++;
  170. holder->event = event;
  171. fsnotify_get_event(event);
  172. list_add_tail(&holder->event_list, list);
  173. if (priv)
  174. list_add_tail(&priv->event_list, &event->private_data_list);
  175. spin_unlock(&event->lock);
  176. mutex_unlock(&group->notification_mutex);
  177. wake_up(&group->notification_waitq);
  178. return rc;
  179. }
  180. /*
  181. * Remove and return the first event from the notification list. There is a
  182. * reference held on this event since it was on the list. It is the responsibility
  183. * of the caller to drop this reference.
  184. */
  185. struct fsnotify_event *fsnotify_remove_notify_event(struct fsnotify_group *group)
  186. {
  187. struct fsnotify_event *event;
  188. struct fsnotify_event_holder *holder;
  189. BUG_ON(!mutex_is_locked(&group->notification_mutex));
  190. holder = list_first_entry(&group->notification_list, struct fsnotify_event_holder, event_list);
  191. event = holder->event;
  192. spin_lock(&event->lock);
  193. holder->event = NULL;
  194. list_del_init(&holder->event_list);
  195. spin_unlock(&event->lock);
  196. /* event == holder means we are referenced through the in event holder */
  197. if (holder != &event->holder)
  198. fsnotify_destroy_event_holder(holder);
  199. group->q_len--;
  200. return event;
  201. }
  202. /*
  203. * This will not remove the event, that must be done with fsnotify_remove_notify_event()
  204. */
  205. struct fsnotify_event *fsnotify_peek_notify_event(struct fsnotify_group *group)
  206. {
  207. struct fsnotify_event *event;
  208. struct fsnotify_event_holder *holder;
  209. BUG_ON(!mutex_is_locked(&group->notification_mutex));
  210. holder = list_first_entry(&group->notification_list, struct fsnotify_event_holder, event_list);
  211. event = holder->event;
  212. return event;
  213. }
  214. /*
  215. * Called when a group is being torn down to clean up any outstanding
  216. * event notifications.
  217. */
  218. void fsnotify_flush_notify(struct fsnotify_group *group)
  219. {
  220. struct fsnotify_event *event;
  221. struct fsnotify_event_private_data *priv;
  222. mutex_lock(&group->notification_mutex);
  223. while (!fsnotify_notify_queue_is_empty(group)) {
  224. event = fsnotify_remove_notify_event(group);
  225. /* if they don't implement free_event_priv they better not have attached any */
  226. if (group->ops->free_event_priv) {
  227. spin_lock(&event->lock);
  228. priv = fsnotify_remove_priv_from_event(group, event);
  229. spin_unlock(&event->lock);
  230. if (priv)
  231. group->ops->free_event_priv(priv);
  232. }
  233. fsnotify_put_event(event); /* matches fsnotify_add_notify_event */
  234. }
  235. mutex_unlock(&group->notification_mutex);
  236. }
  237. static void initialize_event(struct fsnotify_event *event)
  238. {
  239. INIT_LIST_HEAD(&event->holder.event_list);
  240. atomic_set(&event->refcnt, 1);
  241. spin_lock_init(&event->lock);
  242. INIT_LIST_HEAD(&event->private_data_list);
  243. }
  244. /*
  245. * Caller damn well better be holding whatever mutex is protecting the
  246. * old_holder->event_list and the new_event must be a clean event which
  247. * cannot be found anywhere else in the kernel.
  248. */
  249. int fsnotify_replace_event(struct fsnotify_event_holder *old_holder,
  250. struct fsnotify_event *new_event)
  251. {
  252. struct fsnotify_event *old_event = old_holder->event;
  253. struct fsnotify_event_holder *new_holder = &new_event->holder;
  254. enum event_spinlock_class {
  255. SPINLOCK_OLD,
  256. SPINLOCK_NEW,
  257. };
  258. /*
  259. * if the new_event's embedded holder is in use someone
  260. * screwed up and didn't give us a clean new event.
  261. */
  262. BUG_ON(!list_empty(&new_holder->event_list));
  263. spin_lock_nested(&old_event->lock, SPINLOCK_OLD);
  264. spin_lock_nested(&new_event->lock, SPINLOCK_NEW);
  265. new_holder->event = new_event;
  266. list_replace_init(&old_holder->event_list, &new_holder->event_list);
  267. spin_unlock(&new_event->lock);
  268. spin_unlock(&old_event->lock);
  269. /* event == holder means we are referenced through the in event holder */
  270. if (old_holder != &old_event->holder)
  271. fsnotify_destroy_event_holder(old_holder);
  272. fsnotify_get_event(new_event); /* on the list take reference */
  273. fsnotify_put_event(old_event); /* off the list, drop reference */
  274. return 0;
  275. }
  276. struct fsnotify_event *fsnotify_clone_event(struct fsnotify_event *old_event)
  277. {
  278. struct fsnotify_event *event;
  279. event = kmem_cache_alloc(fsnotify_event_cachep, GFP_KERNEL);
  280. if (!event)
  281. return NULL;
  282. memcpy(event, old_event, sizeof(*event));
  283. initialize_event(event);
  284. if (event->name_len) {
  285. event->file_name = kstrdup(old_event->file_name, GFP_KERNEL);
  286. if (!event->file_name) {
  287. kmem_cache_free(fsnotify_event_cachep, event);
  288. return NULL;
  289. }
  290. }
  291. if (event->data_type == FSNOTIFY_EVENT_PATH)
  292. path_get(&event->path);
  293. return event;
  294. }
  295. /*
  296. * fsnotify_create_event - Allocate a new event which will be sent to each
  297. * group's handle_event function if the group was interested in this
  298. * particular event.
  299. *
  300. * @to_tell the inode which is supposed to receive the event (sometimes a
  301. * parent of the inode to which the event happened.
  302. * @mask what actually happened.
  303. * @data pointer to the object which was actually affected
  304. * @data_type flag indication if the data is a file, path, inode, nothing...
  305. * @name the filename, if available
  306. */
  307. struct fsnotify_event *fsnotify_create_event(struct inode *to_tell, __u32 mask, void *data,
  308. int data_type, const char *name, u32 cookie,
  309. gfp_t gfp)
  310. {
  311. struct fsnotify_event *event;
  312. event = kmem_cache_zalloc(fsnotify_event_cachep, gfp);
  313. if (!event)
  314. return NULL;
  315. initialize_event(event);
  316. if (name) {
  317. event->file_name = kstrdup(name, gfp);
  318. if (!event->file_name) {
  319. kmem_cache_free(fsnotify_event_cachep, event);
  320. return NULL;
  321. }
  322. event->name_len = strlen(event->file_name);
  323. }
  324. event->sync_cookie = cookie;
  325. event->to_tell = to_tell;
  326. event->data_type = data_type;
  327. switch (data_type) {
  328. case FSNOTIFY_EVENT_FILE: {
  329. struct file *file = data;
  330. struct path *path = &file->f_path;
  331. event->path.dentry = path->dentry;
  332. event->path.mnt = path->mnt;
  333. path_get(&event->path);
  334. event->data_type = FSNOTIFY_EVENT_PATH;
  335. break;
  336. }
  337. case FSNOTIFY_EVENT_PATH: {
  338. struct path *path = data;
  339. event->path.dentry = path->dentry;
  340. event->path.mnt = path->mnt;
  341. path_get(&event->path);
  342. break;
  343. }
  344. case FSNOTIFY_EVENT_INODE:
  345. event->inode = data;
  346. break;
  347. case FSNOTIFY_EVENT_NONE:
  348. event->inode = NULL;
  349. event->path.dentry = NULL;
  350. event->path.mnt = NULL;
  351. break;
  352. default:
  353. BUG();
  354. }
  355. event->mask = mask;
  356. return event;
  357. }
  358. __init int fsnotify_notification_init(void)
  359. {
  360. fsnotify_event_cachep = KMEM_CACHE(fsnotify_event, SLAB_PANIC);
  361. fsnotify_event_holder_cachep = KMEM_CACHE(fsnotify_event_holder, SLAB_PANIC);
  362. q_overflow_event = fsnotify_create_event(NULL, FS_Q_OVERFLOW, NULL,
  363. FSNOTIFY_EVENT_NONE, NULL, 0,
  364. GFP_KERNEL);
  365. if (!q_overflow_event)
  366. panic("unable to allocate fsnotify q_overflow_event\n");
  367. return 0;
  368. }
  369. subsys_initcall(fsnotify_notification_init);