blob: 3c3e36745f591cf8dd6953f71390afeccac58e81 [file] [log] [blame]
Eric Paris90586522009-05-21 17:01:20 -04001/*
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
Eric Parisa2d8bc62009-05-21 17:01:37 -040019/*
20 * Basic idea behind the notification queue: An fsnotify group (like inotify)
Adam Buchbinderb3834be2012-09-19 21:48:02 -040021 * sends the userspace notification about events asynchronously some time after
Eric Parisa2d8bc62009-05-21 17:01:37 -040022 * the event happened. When inotify gets an event it will need to add that
23 * event to the group notify queue. Since a single event might need to be on
24 * multiple group's notification queues we can't add the event directly to each
25 * queue and instead add a small "event_holder" to each queue. This event_holder
26 * has a pointer back to the original event. Since the majority of events are
27 * going to end up on one, and only one, notification queue we embed one
28 * event_holder into each event. This means we have a single allocation instead
29 * of always needing two. If the embedded event_holder is already in use by
30 * another group a new event_holder (from fsnotify_event_holder_cachep) will be
31 * allocated and used.
32 */
33
Eric Paris90586522009-05-21 17:01:20 -040034#include <linux/fs.h>
35#include <linux/init.h>
36#include <linux/kernel.h>
37#include <linux/list.h>
Eric Paris47882c62009-05-21 17:01:47 -040038#include <linux/module.h>
Eric Paris90586522009-05-21 17:01:20 -040039#include <linux/mount.h>
40#include <linux/mutex.h>
41#include <linux/namei.h>
42#include <linux/path.h>
43#include <linux/slab.h>
44#include <linux/spinlock.h>
45
Arun Sharma600634972011-07-26 16:09:06 -070046#include <linux/atomic.h>
Eric Paris90586522009-05-21 17:01:20 -040047
48#include <linux/fsnotify_backend.h>
49#include "fsnotify.h"
50
Eric Paris47882c62009-05-21 17:01:47 -040051static atomic_t fsnotify_sync_cookie = ATOMIC_INIT(0);
52
53/**
54 * fsnotify_get_cookie - return a unique cookie for use in synchronizing events.
55 * Called from fsnotify_move, which is inlined into filesystem modules.
56 */
57u32 fsnotify_get_cookie(void)
58{
59 return atomic_inc_return(&fsnotify_sync_cookie);
60}
61EXPORT_SYMBOL_GPL(fsnotify_get_cookie);
Eric Parisa2d8bc62009-05-21 17:01:37 -040062
63/* return true if the notify queue is empty, false otherwise */
64bool fsnotify_notify_queue_is_empty(struct fsnotify_group *group)
65{
Jan Karaed272642016-10-07 16:57:01 -070066 assert_spin_locked(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -040067 return list_empty(&group->notification_list) ? true : false;
68}
Eric Paris90586522009-05-21 17:01:20 -040069
Jan Kara7053aee2014-01-21 15:48:14 -080070void fsnotify_destroy_event(struct fsnotify_group *group,
71 struct fsnotify_event *event)
Eric Paris90586522009-05-21 17:01:20 -040072{
Jan Kara7053aee2014-01-21 15:48:14 -080073 /* Overflow events are per-group and we don't want to free them */
74 if (!event || event->mask == FS_Q_OVERFLOW)
Eric Paris90586522009-05-21 17:01:20 -040075 return;
Jan Kara0b1b8652016-10-07 16:56:58 -070076 /*
77 * If the event is still queued, we have a problem... Do an unreliable
78 * lockless check first to avoid locking in the common case. The
79 * locking may be necessary for permission events which got removed
80 * from the list by a different CPU than the one freeing the event.
81 */
82 if (!list_empty(&event->list)) {
83 spin_lock(&group->notification_lock);
84 WARN_ON(!list_empty(&event->list));
85 spin_unlock(&group->notification_lock);
86 }
Jan Kara7053aee2014-01-21 15:48:14 -080087 group->ops->free_event(event);
Eric Parise4aff112009-05-21 17:01:50 -040088}
89
90/*
Eric Parisa2d8bc62009-05-21 17:01:37 -040091 * Add an event to the group notification queue. The group can later pull this
Jan Kara83c0e1b2014-01-28 18:53:22 +010092 * event off the queue to deal with. The function returns 0 if the event was
Jan Kara482ef062014-02-21 19:07:54 +010093 * added to the queue, 1 if the event was merged with some other queued event,
Jan Kara12703db2016-09-19 14:44:27 -070094 * 2 if the event was not queued - either the queue of events has overflown
95 * or the group is shutting down.
Eric Parisa2d8bc62009-05-21 17:01:37 -040096 */
Jan Kara8ba8fa912014-08-06 16:03:26 -070097int fsnotify_add_event(struct fsnotify_group *group,
98 struct fsnotify_event *event,
99 int (*merge)(struct list_head *,
100 struct fsnotify_event *))
Eric Parisa2d8bc62009-05-21 17:01:37 -0400101{
Jan Kara83c0e1b2014-01-28 18:53:22 +0100102 int ret = 0;
Eric Parisa2d8bc62009-05-21 17:01:37 -0400103 struct list_head *list = &group->notification_list;
Eric Parise4aff112009-05-21 17:01:50 -0400104
Jan Kara7053aee2014-01-21 15:48:14 -0800105 pr_debug("%s: group=%p event=%p\n", __func__, group, event);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400106
Jan Karac21dbe22016-10-07 16:56:52 -0700107 spin_lock(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400108
Jan Kara12703db2016-09-19 14:44:27 -0700109 if (group->shutdown) {
Jan Karac21dbe22016-10-07 16:56:52 -0700110 spin_unlock(&group->notification_lock);
Jan Kara12703db2016-09-19 14:44:27 -0700111 return 2;
112 }
113
Jan Kara7b1f6412018-02-21 15:07:52 +0100114 if (event == group->overflow_event ||
115 group->q_len >= group->max_events) {
Jan Kara482ef062014-02-21 19:07:54 +0100116 ret = 2;
Jan Kara7053aee2014-01-21 15:48:14 -0800117 /* Queue overflow event only if it isn't already queued */
Jan Karaff57cd52014-02-21 19:14:11 +0100118 if (!list_empty(&group->overflow_event->list)) {
Jan Karac21dbe22016-10-07 16:56:52 -0700119 spin_unlock(&group->notification_lock);
Jan Kara482ef062014-02-21 19:07:54 +0100120 return ret;
121 }
Jan Karaff57cd52014-02-21 19:14:11 +0100122 event = group->overflow_event;
Jan Kara482ef062014-02-21 19:07:54 +0100123 goto queue;
Eric Parise4aff112009-05-21 17:01:50 -0400124 }
Eric Parisa2d8bc62009-05-21 17:01:37 -0400125
Eric Paris74766bb2009-12-17 21:24:21 -0500126 if (!list_empty(list) && merge) {
Jan Kara83c0e1b2014-01-28 18:53:22 +0100127 ret = merge(list, event);
128 if (ret) {
Jan Karac21dbe22016-10-07 16:56:52 -0700129 spin_unlock(&group->notification_lock);
Jan Kara83c0e1b2014-01-28 18:53:22 +0100130 return ret;
Eric Parisf70ab542010-07-28 10:18:37 -0400131 }
Eric Parisa2d8bc62009-05-21 17:01:37 -0400132 }
133
Jan Kara482ef062014-02-21 19:07:54 +0100134queue:
Eric Parisa2d8bc62009-05-21 17:01:37 -0400135 group->q_len++;
Jan Kara7053aee2014-01-21 15:48:14 -0800136 list_add_tail(&event->list, list);
Jan Karac21dbe22016-10-07 16:56:52 -0700137 spin_unlock(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400138
139 wake_up(&group->notification_waitq);
Eric Paris0a6b6bd2011-10-14 17:43:39 -0400140 kill_fasync(&group->fsn_fa, SIGIO, POLL_IN);
Jan Kara83c0e1b2014-01-28 18:53:22 +0100141 return ret;
Eric Parisa2d8bc62009-05-21 17:01:37 -0400142}
143
144/*
Jan Kara7053aee2014-01-21 15:48:14 -0800145 * Remove and return the first event from the notification list. It is the
146 * responsibility of the caller to destroy the obtained event
Eric Parisa2d8bc62009-05-21 17:01:37 -0400147 */
Jan Kara8ba8fa912014-08-06 16:03:26 -0700148struct fsnotify_event *fsnotify_remove_first_event(struct fsnotify_group *group)
Eric Parisa2d8bc62009-05-21 17:01:37 -0400149{
150 struct fsnotify_event *event;
Eric Parisa2d8bc62009-05-21 17:01:37 -0400151
Jan Karaed272642016-10-07 16:57:01 -0700152 assert_spin_locked(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400153
Eric Paris5ba08e22010-07-28 10:18:37 -0400154 pr_debug("%s: group=%p\n", __func__, group);
155
Jan Kara7053aee2014-01-21 15:48:14 -0800156 event = list_first_entry(&group->notification_list,
157 struct fsnotify_event, list);
Jan Kara25131902014-02-21 19:02:34 +0100158 /*
159 * We need to init list head for the case of overflow event so that
Jan Kara8ba8fa912014-08-06 16:03:26 -0700160 * check in fsnotify_add_event() works
Jan Kara25131902014-02-21 19:02:34 +0100161 */
162 list_del_init(&event->list);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400163 group->q_len--;
164
165 return event;
166}
167
168/*
Jan Kara8ba8fa912014-08-06 16:03:26 -0700169 * This will not remove the event, that must be done with
170 * fsnotify_remove_first_event()
Eric Parisa2d8bc62009-05-21 17:01:37 -0400171 */
Jan Kara8ba8fa912014-08-06 16:03:26 -0700172struct fsnotify_event *fsnotify_peek_first_event(struct fsnotify_group *group)
Eric Parisa2d8bc62009-05-21 17:01:37 -0400173{
Jan Karaed272642016-10-07 16:57:01 -0700174 assert_spin_locked(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400175
Jan Kara7053aee2014-01-21 15:48:14 -0800176 return list_first_entry(&group->notification_list,
177 struct fsnotify_event, list);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400178}
179
180/*
181 * Called when a group is being torn down to clean up any outstanding
182 * event notifications.
183 */
184void fsnotify_flush_notify(struct fsnotify_group *group)
185{
186 struct fsnotify_event *event;
187
Jan Karac21dbe22016-10-07 16:56:52 -0700188 spin_lock(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400189 while (!fsnotify_notify_queue_is_empty(group)) {
Jan Kara8ba8fa912014-08-06 16:03:26 -0700190 event = fsnotify_remove_first_event(group);
Jan Karac21dbe22016-10-07 16:56:52 -0700191 spin_unlock(&group->notification_lock);
Jan Kara7053aee2014-01-21 15:48:14 -0800192 fsnotify_destroy_event(group, event);
Jan Karac21dbe22016-10-07 16:56:52 -0700193 spin_lock(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400194 }
Jan Karac21dbe22016-10-07 16:56:52 -0700195 spin_unlock(&group->notification_lock);
Eric Parisa2d8bc62009-05-21 17:01:37 -0400196}
197
Eric Parisa2d8bc62009-05-21 17:01:37 -0400198/*
199 * fsnotify_create_event - Allocate a new event which will be sent to each
200 * group's handle_event function if the group was interested in this
201 * particular event.
202 *
Jan Kara7053aee2014-01-21 15:48:14 -0800203 * @inode the inode which is supposed to receive the event (sometimes a
Eric Parisa2d8bc62009-05-21 17:01:37 -0400204 * parent of the inode to which the event happened.
205 * @mask what actually happened.
206 * @data pointer to the object which was actually affected
207 * @data_type flag indication if the data is a file, path, inode, nothing...
Eric Paris62ffe5d2009-05-21 17:01:43 -0400208 * @name the filename, if available
Eric Paris90586522009-05-21 17:01:20 -0400209 */
Jan Kara7053aee2014-01-21 15:48:14 -0800210void fsnotify_init_event(struct fsnotify_event *event, struct inode *inode,
211 u32 mask)
Eric Paris90586522009-05-21 17:01:20 -0400212{
Jan Kara7053aee2014-01-21 15:48:14 -0800213 INIT_LIST_HEAD(&event->list);
214 event->inode = inode;
Eric Paris90586522009-05-21 17:01:20 -0400215 event->mask = mask;
Eric Paris90586522009-05-21 17:01:20 -0400216}