notification.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217
  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 asynchronously 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 <linux/atomic.h>
  44. #include <linux/fsnotify_backend.h>
  45. #include "fsnotify.h"
  46. static atomic_t fsnotify_sync_cookie = ATOMIC_INIT(0);
  47. /**
  48. * fsnotify_get_cookie - return a unique cookie for use in synchronizing events.
  49. * Called from fsnotify_move, which is inlined into filesystem modules.
  50. */
  51. u32 fsnotify_get_cookie(void)
  52. {
  53. return atomic_inc_return(&fsnotify_sync_cookie);
  54. }
  55. EXPORT_SYMBOL_GPL(fsnotify_get_cookie);
  56. /* return true if the notify queue is empty, false otherwise */
  57. bool fsnotify_notify_queue_is_empty(struct fsnotify_group *group)
  58. {
  59. assert_spin_locked(&group->notification_lock);
  60. return list_empty(&group->notification_list) ? true : false;
  61. }
  62. void fsnotify_destroy_event(struct fsnotify_group *group,
  63. struct fsnotify_event *event)
  64. {
  65. /* Overflow events are per-group and we don't want to free them */
  66. if (!event || event->mask == FS_Q_OVERFLOW)
  67. return;
  68. /*
  69. * If the event is still queued, we have a problem... Do an unreliable
  70. * lockless check first to avoid locking in the common case. The
  71. * locking may be necessary for permission events which got removed
  72. * from the list by a different CPU than the one freeing the event.
  73. */
  74. if (!list_empty(&event->list)) {
  75. spin_lock(&group->notification_lock);
  76. WARN_ON(!list_empty(&event->list));
  77. spin_unlock(&group->notification_lock);
  78. }
  79. group->ops->free_event(event);
  80. }
  81. /*
  82. * Add an event to the group notification queue. The group can later pull this
  83. * event off the queue to deal with. The function returns 0 if the event was
  84. * added to the queue, 1 if the event was merged with some other queued event,
  85. * 2 if the event was not queued - either the queue of events has overflown
  86. * or the group is shutting down.
  87. */
  88. int fsnotify_add_event(struct fsnotify_group *group,
  89. struct fsnotify_event *event,
  90. int (*merge)(struct list_head *,
  91. struct fsnotify_event *))
  92. {
  93. int ret = 0;
  94. struct list_head *list = &group->notification_list;
  95. pr_debug("%s: group=%p event=%p\n", __func__, group, event);
  96. spin_lock(&group->notification_lock);
  97. if (group->shutdown) {
  98. spin_unlock(&group->notification_lock);
  99. return 2;
  100. }
  101. if (event == group->overflow_event ||
  102. group->q_len >= group->max_events) {
  103. ret = 2;
  104. /* Queue overflow event only if it isn't already queued */
  105. if (!list_empty(&group->overflow_event->list)) {
  106. spin_unlock(&group->notification_lock);
  107. return ret;
  108. }
  109. event = group->overflow_event;
  110. goto queue;
  111. }
  112. if (!list_empty(list) && merge) {
  113. ret = merge(list, event);
  114. if (ret) {
  115. spin_unlock(&group->notification_lock);
  116. return ret;
  117. }
  118. }
  119. queue:
  120. group->q_len++;
  121. list_add_tail(&event->list, list);
  122. spin_unlock(&group->notification_lock);
  123. wake_up(&group->notification_waitq);
  124. kill_fasync(&group->fsn_fa, SIGIO, POLL_IN);
  125. return ret;
  126. }
  127. /*
  128. * Remove and return the first event from the notification list. It is the
  129. * responsibility of the caller to destroy the obtained event
  130. */
  131. struct fsnotify_event *fsnotify_remove_first_event(struct fsnotify_group *group)
  132. {
  133. struct fsnotify_event *event;
  134. assert_spin_locked(&group->notification_lock);
  135. pr_debug("%s: group=%p\n", __func__, group);
  136. event = list_first_entry(&group->notification_list,
  137. struct fsnotify_event, list);
  138. /*
  139. * We need to init list head for the case of overflow event so that
  140. * check in fsnotify_add_event() works
  141. */
  142. list_del_init(&event->list);
  143. group->q_len--;
  144. return event;
  145. }
  146. /*
  147. * This will not remove the event, that must be done with
  148. * fsnotify_remove_first_event()
  149. */
  150. struct fsnotify_event *fsnotify_peek_first_event(struct fsnotify_group *group)
  151. {
  152. assert_spin_locked(&group->notification_lock);
  153. return list_first_entry(&group->notification_list,
  154. struct fsnotify_event, list);
  155. }
  156. /*
  157. * Called when a group is being torn down to clean up any outstanding
  158. * event notifications.
  159. */
  160. void fsnotify_flush_notify(struct fsnotify_group *group)
  161. {
  162. struct fsnotify_event *event;
  163. spin_lock(&group->notification_lock);
  164. while (!fsnotify_notify_queue_is_empty(group)) {
  165. event = fsnotify_remove_first_event(group);
  166. spin_unlock(&group->notification_lock);
  167. fsnotify_destroy_event(group, event);
  168. spin_lock(&group->notification_lock);
  169. }
  170. spin_unlock(&group->notification_lock);
  171. }
  172. /*
  173. * fsnotify_create_event - Allocate a new event which will be sent to each
  174. * group's handle_event function if the group was interested in this
  175. * particular event.
  176. *
  177. * @inode the inode which is supposed to receive the event (sometimes a
  178. * parent of the inode to which the event happened.
  179. * @mask what actually happened.
  180. * @data pointer to the object which was actually affected
  181. * @data_type flag indication if the data is a file, path, inode, nothing...
  182. * @name the filename, if available
  183. */
  184. void fsnotify_init_event(struct fsnotify_event *event, struct inode *inode,
  185. u32 mask)
  186. {
  187. INIT_LIST_HEAD(&event->list);
  188. event->inode = inode;
  189. event->mask = mask;
  190. }