inotify_fsnotify.c 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226
  1. /*
  2. * fs/inotify_user.c - inotify support for userspace
  3. *
  4. * Authors:
  5. * John McCutchan <ttb@tentacle.dhs.org>
  6. * Robert Love <rml@novell.com>
  7. *
  8. * Copyright (C) 2005 John McCutchan
  9. * Copyright 2006 Hewlett-Packard Development Company, L.P.
  10. *
  11. * Copyright (C) 2009 Eric Paris <Red Hat Inc>
  12. * inotify was largely rewriten to make use of the fsnotify infrastructure
  13. *
  14. * This program is free software; you can redistribute it and/or modify it
  15. * under the terms of the GNU General Public License as published by the
  16. * Free Software Foundation; either version 2, or (at your option) any
  17. * later version.
  18. *
  19. * This program is distributed in the hope that it will be useful, but
  20. * WITHOUT ANY WARRANTY; without even the implied warranty of
  21. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  22. * General Public License for more details.
  23. */
  24. #include <linux/fs.h> /* struct inode */
  25. #include <linux/fsnotify_backend.h>
  26. #include <linux/inotify.h>
  27. #include <linux/path.h> /* struct path */
  28. #include <linux/slab.h> /* kmem_* */
  29. #include <linux/types.h>
  30. #include <linux/sched.h>
  31. #include "inotify.h"
  32. /*
  33. * Check if 2 events contain the same information. We do not compare private data
  34. * but at this moment that isn't a problem for any know fsnotify listeners.
  35. */
  36. static bool event_compare(struct fsnotify_event *old, struct fsnotify_event *new)
  37. {
  38. if ((old->mask == new->mask) &&
  39. (old->to_tell == new->to_tell) &&
  40. (old->data_type == new->data_type) &&
  41. (old->name_len == new->name_len)) {
  42. switch (old->data_type) {
  43. case (FSNOTIFY_EVENT_INODE):
  44. /* remember, after old was put on the wait_q we aren't
  45. * allowed to look at the inode any more, only thing
  46. * left to check was if the file_name is the same */
  47. if (!old->name_len ||
  48. !strcmp(old->file_name, new->file_name))
  49. return true;
  50. break;
  51. case (FSNOTIFY_EVENT_PATH):
  52. if ((old->path.mnt == new->path.mnt) &&
  53. (old->path.dentry == new->path.dentry))
  54. return true;
  55. break;
  56. case (FSNOTIFY_EVENT_NONE):
  57. if (old->mask & FS_Q_OVERFLOW)
  58. return true;
  59. else if (old->mask & FS_IN_IGNORED)
  60. return false;
  61. return true;
  62. };
  63. }
  64. return false;
  65. }
  66. static int inotify_merge(struct list_head *list, struct fsnotify_event *event)
  67. {
  68. struct fsnotify_event_holder *last_holder;
  69. struct fsnotify_event *last_event;
  70. int ret = 0;
  71. /* and the list better be locked by something too */
  72. spin_lock(&event->lock);
  73. last_holder = list_entry(list->prev, struct fsnotify_event_holder, event_list);
  74. last_event = last_holder->event;
  75. if (event_compare(last_event, event))
  76. ret = -EEXIST;
  77. spin_unlock(&event->lock);
  78. return ret;
  79. }
  80. static int inotify_handle_event(struct fsnotify_group *group, struct fsnotify_event *event)
  81. {
  82. struct fsnotify_mark_entry *entry;
  83. struct inotify_inode_mark_entry *ientry;
  84. struct inode *to_tell;
  85. struct inotify_event_private_data *event_priv;
  86. struct fsnotify_event_private_data *fsn_event_priv;
  87. int wd, ret;
  88. to_tell = event->to_tell;
  89. spin_lock(&to_tell->i_lock);
  90. entry = fsnotify_find_mark_entry(group, to_tell);
  91. spin_unlock(&to_tell->i_lock);
  92. /* race with watch removal? We already passes should_send */
  93. if (unlikely(!entry))
  94. return 0;
  95. ientry = container_of(entry, struct inotify_inode_mark_entry,
  96. fsn_entry);
  97. wd = ientry->wd;
  98. event_priv = kmem_cache_alloc(event_priv_cachep, GFP_KERNEL);
  99. if (unlikely(!event_priv))
  100. return -ENOMEM;
  101. fsn_event_priv = &event_priv->fsnotify_event_priv_data;
  102. fsn_event_priv->group = group;
  103. event_priv->wd = wd;
  104. ret = fsnotify_add_notify_event(group, event, fsn_event_priv, inotify_merge);
  105. if (ret) {
  106. inotify_free_event_priv(fsn_event_priv);
  107. /* EEXIST says we tail matched, EOVERFLOW isn't something
  108. * to report up the stack. */
  109. if ((ret == -EEXIST) ||
  110. (ret == -EOVERFLOW))
  111. ret = 0;
  112. }
  113. /*
  114. * If we hold the entry until after the event is on the queue
  115. * IN_IGNORED won't be able to pass this event in the queue
  116. */
  117. fsnotify_put_mark(entry);
  118. return ret;
  119. }
  120. static void inotify_freeing_mark(struct fsnotify_mark_entry *entry, struct fsnotify_group *group)
  121. {
  122. inotify_ignored_and_remove_idr(entry, group);
  123. }
  124. static bool inotify_should_send_event(struct fsnotify_group *group, struct inode *inode,
  125. struct vfsmount *mnt, __u32 mask, void *data,
  126. int data_type)
  127. {
  128. struct fsnotify_mark_entry *entry;
  129. bool send;
  130. spin_lock(&inode->i_lock);
  131. entry = fsnotify_find_mark_entry(group, inode);
  132. spin_unlock(&inode->i_lock);
  133. if (!entry)
  134. return false;
  135. mask = (mask & ~FS_EVENT_ON_CHILD);
  136. send = (entry->mask & mask);
  137. /* find took a reference */
  138. fsnotify_put_mark(entry);
  139. return send;
  140. }
  141. /*
  142. * This is NEVER supposed to be called. Inotify marks should either have been
  143. * removed from the idr when the watch was removed or in the
  144. * fsnotify_destroy_mark_by_group() call when the inotify instance was being
  145. * torn down. This is only called if the idr is about to be freed but there
  146. * are still marks in it.
  147. */
  148. static int idr_callback(int id, void *p, void *data)
  149. {
  150. struct fsnotify_mark_entry *entry;
  151. struct inotify_inode_mark_entry *ientry;
  152. static bool warned = false;
  153. if (warned)
  154. return 0;
  155. warned = true;
  156. entry = p;
  157. ientry = container_of(entry, struct inotify_inode_mark_entry, fsn_entry);
  158. WARN(1, "inotify closing but id=%d for entry=%p in group=%p still in "
  159. "idr. Probably leaking memory\n", id, p, data);
  160. /*
  161. * I'm taking the liberty of assuming that the mark in question is a
  162. * valid address and I'm dereferencing it. This might help to figure
  163. * out why we got here and the panic is no worse than the original
  164. * BUG() that was here.
  165. */
  166. if (entry)
  167. printk(KERN_WARNING "entry->group=%p inode=%p wd=%d\n",
  168. entry->group, entry->i.inode, ientry->wd);
  169. return 0;
  170. }
  171. static void inotify_free_group_priv(struct fsnotify_group *group)
  172. {
  173. /* ideally the idr is empty and we won't hit the BUG in teh callback */
  174. idr_for_each(&group->inotify_data.idr, idr_callback, group);
  175. idr_remove_all(&group->inotify_data.idr);
  176. idr_destroy(&group->inotify_data.idr);
  177. free_uid(group->inotify_data.user);
  178. }
  179. void inotify_free_event_priv(struct fsnotify_event_private_data *fsn_event_priv)
  180. {
  181. struct inotify_event_private_data *event_priv;
  182. event_priv = container_of(fsn_event_priv, struct inotify_event_private_data,
  183. fsnotify_event_priv_data);
  184. kmem_cache_free(event_priv_cachep, event_priv);
  185. }
  186. const struct fsnotify_ops inotify_fsnotify_ops = {
  187. .handle_event = inotify_handle_event,
  188. .should_send_event = inotify_should_send_event,
  189. .free_group_priv = inotify_free_group_priv,
  190. .free_event_priv = inotify_free_event_priv,
  191. .freeing_mark = inotify_freeing_mark,
  192. };