]>
Commit | Line | Data |
---|---|---|
90586523 EP |
1 | /* |
2 | * Copyright (C) 2008 Red Hat, Inc., Eric Paris <[email protected]> | |
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 | ||
a2d8bc6c EP |
19 | /* |
20 | * Basic idea behind the notification queue: An fsnotify group (like inotify) | |
b3834be5 | 21 | * sends the userspace notification about events asynchronously some time after |
a2d8bc6c EP |
22 | * 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 | ||
90586523 EP |
34 | #include <linux/fs.h> |
35 | #include <linux/init.h> | |
36 | #include <linux/kernel.h> | |
37 | #include <linux/list.h> | |
47882c6f | 38 | #include <linux/module.h> |
90586523 EP |
39 | #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 | ||
60063497 | 46 | #include <linux/atomic.h> |
90586523 EP |
47 | |
48 | #include <linux/fsnotify_backend.h> | |
49 | #include "fsnotify.h" | |
50 | ||
47882c6f EP |
51 | static 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 | */ | |
57 | u32 fsnotify_get_cookie(void) | |
58 | { | |
59 | return atomic_inc_return(&fsnotify_sync_cookie); | |
60 | } | |
61 | EXPORT_SYMBOL_GPL(fsnotify_get_cookie); | |
a2d8bc6c EP |
62 | |
63 | /* return true if the notify queue is empty, false otherwise */ | |
64 | bool fsnotify_notify_queue_is_empty(struct fsnotify_group *group) | |
65 | { | |
ed272640 | 66 | assert_spin_locked(&group->notification_lock); |
a2d8bc6c EP |
67 | return list_empty(&group->notification_list) ? true : false; |
68 | } | |
90586523 | 69 | |
7053aee2 JK |
70 | void fsnotify_destroy_event(struct fsnotify_group *group, |
71 | struct fsnotify_event *event) | |
90586523 | 72 | { |
7053aee2 JK |
73 | /* Overflow events are per-group and we don't want to free them */ |
74 | if (!event || event->mask == FS_Q_OVERFLOW) | |
90586523 | 75 | return; |
0b1b8652 JK |
76 | /* |
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 | } | |
7053aee2 | 87 | group->ops->free_event(event); |
e4aff117 EP |
88 | } |
89 | ||
90586523 | 90 | /* |
a2d8bc6c | 91 | * Add an event to the group notification queue. The group can later pull this |
83c0e1b4 | 92 | * event off the queue to deal with. The function returns 0 if the event was |
482ef06c | 93 | * added to the queue, 1 if the event was merged with some other queued event, |
12703dbf JK |
94 | * 2 if the event was not queued - either the queue of events has overflown |
95 | * or the group is shutting down. | |
90586523 | 96 | */ |
8ba8fa91 JK |
97 | int fsnotify_add_event(struct fsnotify_group *group, |
98 | struct fsnotify_event *event, | |
99 | int (*merge)(struct list_head *, | |
100 | struct fsnotify_event *)) | |
a2d8bc6c | 101 | { |
83c0e1b4 | 102 | int ret = 0; |
a2d8bc6c | 103 | struct list_head *list = &group->notification_list; |
e4aff117 | 104 | |
7053aee2 | 105 | pr_debug("%s: group=%p event=%p\n", __func__, group, event); |
a2d8bc6c | 106 | |
c21dbe20 | 107 | spin_lock(&group->notification_lock); |
a2d8bc6c | 108 | |
12703dbf | 109 | if (group->shutdown) { |
c21dbe20 | 110 | spin_unlock(&group->notification_lock); |
12703dbf JK |
111 | return 2; |
112 | } | |
113 | ||
e4aff117 | 114 | if (group->q_len >= group->max_events) { |
482ef06c | 115 | ret = 2; |
7053aee2 | 116 | /* Queue overflow event only if it isn't already queued */ |
ff57cd58 | 117 | if (!list_empty(&group->overflow_event->list)) { |
c21dbe20 | 118 | spin_unlock(&group->notification_lock); |
482ef06c JK |
119 | return ret; |
120 | } | |
ff57cd58 | 121 | event = group->overflow_event; |
482ef06c | 122 | goto queue; |
e4aff117 | 123 | } |
a2d8bc6c | 124 | |
74766bbf | 125 | if (!list_empty(list) && merge) { |
83c0e1b4 JK |
126 | ret = merge(list, event); |
127 | if (ret) { | |
c21dbe20 | 128 | spin_unlock(&group->notification_lock); |
83c0e1b4 | 129 | return ret; |
f70ab54c | 130 | } |
a2d8bc6c EP |
131 | } |
132 | ||
482ef06c | 133 | queue: |
a2d8bc6c | 134 | group->q_len++; |
7053aee2 | 135 | list_add_tail(&event->list, list); |
c21dbe20 | 136 | spin_unlock(&group->notification_lock); |
a2d8bc6c EP |
137 | |
138 | wake_up(&group->notification_waitq); | |
0a6b6bd5 | 139 | kill_fasync(&group->fsn_fa, SIGIO, POLL_IN); |
83c0e1b4 | 140 | return ret; |
a2d8bc6c EP |
141 | } |
142 | ||
143 | /* | |
7053aee2 JK |
144 | * Remove and return the first event from the notification list. It is the |
145 | * responsibility of the caller to destroy the obtained event | |
a2d8bc6c | 146 | */ |
8ba8fa91 | 147 | struct fsnotify_event *fsnotify_remove_first_event(struct fsnotify_group *group) |
90586523 EP |
148 | { |
149 | struct fsnotify_event *event; | |
150 | ||
ed272640 | 151 | assert_spin_locked(&group->notification_lock); |
90586523 | 152 | |
5ba08e2e EP |
153 | pr_debug("%s: group=%p\n", __func__, group); |
154 | ||
7053aee2 JK |
155 | event = list_first_entry(&group->notification_list, |
156 | struct fsnotify_event, list); | |
2513190a JK |
157 | /* |
158 | * We need to init list head for the case of overflow event so that | |
8ba8fa91 | 159 | * check in fsnotify_add_event() works |
2513190a JK |
160 | */ |
161 | list_del_init(&event->list); | |
a2d8bc6c EP |
162 | group->q_len--; |
163 | ||
164 | return event; | |
165 | } | |
166 | ||
167 | /* | |
8ba8fa91 JK |
168 | * This will not remove the event, that must be done with |
169 | * fsnotify_remove_first_event() | |
a2d8bc6c | 170 | */ |
8ba8fa91 | 171 | struct fsnotify_event *fsnotify_peek_first_event(struct fsnotify_group *group) |
a2d8bc6c | 172 | { |
ed272640 | 173 | assert_spin_locked(&group->notification_lock); |
a2d8bc6c | 174 | |
7053aee2 JK |
175 | return list_first_entry(&group->notification_list, |
176 | struct fsnotify_event, list); | |
a2d8bc6c EP |
177 | } |
178 | ||
179 | /* | |
180 | * Called when a group is being torn down to clean up any outstanding | |
181 | * event notifications. | |
182 | */ | |
183 | void fsnotify_flush_notify(struct fsnotify_group *group) | |
184 | { | |
185 | struct fsnotify_event *event; | |
186 | ||
c21dbe20 | 187 | spin_lock(&group->notification_lock); |
a2d8bc6c | 188 | while (!fsnotify_notify_queue_is_empty(group)) { |
8ba8fa91 | 189 | event = fsnotify_remove_first_event(group); |
c21dbe20 | 190 | spin_unlock(&group->notification_lock); |
7053aee2 | 191 | fsnotify_destroy_event(group, event); |
c21dbe20 | 192 | spin_lock(&group->notification_lock); |
a2d8bc6c | 193 | } |
c21dbe20 | 194 | spin_unlock(&group->notification_lock); |
a2d8bc6c EP |
195 | } |
196 | ||
a2d8bc6c EP |
197 | /* |
198 | * fsnotify_create_event - Allocate a new event which will be sent to each | |
199 | * group's handle_event function if the group was interested in this | |
200 | * particular event. | |
201 | * | |
7053aee2 | 202 | * @inode the inode which is supposed to receive the event (sometimes a |
a2d8bc6c EP |
203 | * parent of the inode to which the event happened. |
204 | * @mask what actually happened. | |
205 | * @data pointer to the object which was actually affected | |
206 | * @data_type flag indication if the data is a file, path, inode, nothing... | |
62ffe5df | 207 | * @name the filename, if available |
a2d8bc6c | 208 | */ |
7053aee2 JK |
209 | void fsnotify_init_event(struct fsnotify_event *event, struct inode *inode, |
210 | u32 mask) | |
a2d8bc6c | 211 | { |
7053aee2 JK |
212 | INIT_LIST_HEAD(&event->list); |
213 | event->inode = inode; | |
90586523 | 214 | event->mask = mask; |
90586523 | 215 | } |