]>
Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
74c3cbe3 | 2 | #include "audit.h" |
28a3a7eb | 3 | #include <linux/fsnotify_backend.h> |
74c3cbe3 AV |
4 | #include <linux/namei.h> |
5 | #include <linux/mount.h> | |
916d7576 | 6 | #include <linux/kthread.h> |
9d2378f8 | 7 | #include <linux/refcount.h> |
5a0e3ad6 | 8 | #include <linux/slab.h> |
74c3cbe3 AV |
9 | |
10 | struct audit_tree; | |
11 | struct audit_chunk; | |
12 | ||
13 | struct audit_tree { | |
9d2378f8 | 14 | refcount_t count; |
74c3cbe3 AV |
15 | int goner; |
16 | struct audit_chunk *root; | |
17 | struct list_head chunks; | |
18 | struct list_head rules; | |
19 | struct list_head list; | |
20 | struct list_head same_root; | |
21 | struct rcu_head head; | |
22 | char pathname[]; | |
23 | }; | |
24 | ||
25 | struct audit_chunk { | |
26 | struct list_head hash; | |
8d20d6e9 | 27 | unsigned long key; |
5f516130 | 28 | struct fsnotify_mark *mark; |
74c3cbe3 AV |
29 | struct list_head trees; /* with root here */ |
30 | int dead; | |
31 | int count; | |
8f7b0ba1 | 32 | atomic_long_t refs; |
74c3cbe3 AV |
33 | struct rcu_head head; |
34 | struct node { | |
35 | struct list_head list; | |
36 | struct audit_tree *owner; | |
37 | unsigned index; /* index; upper bit indicates 'will prune' */ | |
38 | } owners[]; | |
39 | }; | |
40 | ||
5f516130 JK |
41 | struct audit_tree_mark { |
42 | struct fsnotify_mark mark; | |
43 | struct audit_chunk *chunk; | |
44 | }; | |
45 | ||
74c3cbe3 AV |
46 | static LIST_HEAD(tree_list); |
47 | static LIST_HEAD(prune_list); | |
f1aaf262 | 48 | static struct task_struct *prune_thread; |
74c3cbe3 AV |
49 | |
50 | /* | |
51 | * One struct chunk is attached to each inode of interest. | |
52 | * We replace struct chunk on tagging/untagging. | |
53 | * Rules have pointer to struct audit_tree. | |
54 | * Rules have struct list_head rlist forming a list of rules over | |
55 | * the same tree. | |
56 | * References to struct chunk are collected at audit_inode{,_child}() | |
57 | * time and used in AUDIT_TREE rule matching. | |
58 | * These references are dropped at the same time we are calling | |
59 | * audit_free_names(), etc. | |
60 | * | |
61 | * Cyclic lists galore: | |
62 | * tree.chunks anchors chunk.owners[].list hash_lock | |
63 | * tree.rules anchors rule.rlist audit_filter_mutex | |
64 | * chunk.trees anchors tree.same_root hash_lock | |
65 | * chunk.hash is a hash with middle bits of watch.inode as | |
66 | * a hash function. RCU, hash_lock | |
67 | * | |
68 | * tree is refcounted; one reference for "some rules on rules_list refer to | |
69 | * it", one for each chunk with pointer to it. | |
70 | * | |
28a3a7eb | 71 | * chunk is refcounted by embedded fsnotify_mark + .refs (non-zero refcount |
8f7b0ba1 | 72 | * of watch contributes 1 to .refs). |
74c3cbe3 AV |
73 | * |
74 | * node.index allows to get from node.list to containing chunk. | |
75 | * MSB of that sucker is stolen to mark taggings that we might have to | |
76 | * revert - several operations have very unpleasant cleanup logics and | |
77 | * that makes a difference. Some. | |
78 | */ | |
79 | ||
28a3a7eb | 80 | static struct fsnotify_group *audit_tree_group; |
5f516130 | 81 | static struct kmem_cache *audit_tree_mark_cachep __read_mostly; |
74c3cbe3 AV |
82 | |
83 | static struct audit_tree *alloc_tree(const char *s) | |
84 | { | |
85 | struct audit_tree *tree; | |
86 | ||
87 | tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); | |
88 | if (tree) { | |
9d2378f8 | 89 | refcount_set(&tree->count, 1); |
74c3cbe3 AV |
90 | tree->goner = 0; |
91 | INIT_LIST_HEAD(&tree->chunks); | |
92 | INIT_LIST_HEAD(&tree->rules); | |
93 | INIT_LIST_HEAD(&tree->list); | |
94 | INIT_LIST_HEAD(&tree->same_root); | |
95 | tree->root = NULL; | |
96 | strcpy(tree->pathname, s); | |
97 | } | |
98 | return tree; | |
99 | } | |
100 | ||
101 | static inline void get_tree(struct audit_tree *tree) | |
102 | { | |
9d2378f8 | 103 | refcount_inc(&tree->count); |
74c3cbe3 AV |
104 | } |
105 | ||
74c3cbe3 AV |
106 | static inline void put_tree(struct audit_tree *tree) |
107 | { | |
9d2378f8 | 108 | if (refcount_dec_and_test(&tree->count)) |
3b097c46 | 109 | kfree_rcu(tree, head); |
74c3cbe3 AV |
110 | } |
111 | ||
112 | /* to avoid bringing the entire thing in audit.h */ | |
113 | const char *audit_tree_path(struct audit_tree *tree) | |
114 | { | |
115 | return tree->pathname; | |
116 | } | |
117 | ||
8f7b0ba1 | 118 | static void free_chunk(struct audit_chunk *chunk) |
74c3cbe3 | 119 | { |
74c3cbe3 AV |
120 | int i; |
121 | ||
122 | for (i = 0; i < chunk->count; i++) { | |
123 | if (chunk->owners[i].owner) | |
124 | put_tree(chunk->owners[i].owner); | |
125 | } | |
126 | kfree(chunk); | |
127 | } | |
128 | ||
8f7b0ba1 | 129 | void audit_put_chunk(struct audit_chunk *chunk) |
74c3cbe3 | 130 | { |
8f7b0ba1 AV |
131 | if (atomic_long_dec_and_test(&chunk->refs)) |
132 | free_chunk(chunk); | |
74c3cbe3 AV |
133 | } |
134 | ||
8f7b0ba1 | 135 | static void __put_chunk(struct rcu_head *rcu) |
74c3cbe3 | 136 | { |
8f7b0ba1 AV |
137 | struct audit_chunk *chunk = container_of(rcu, struct audit_chunk, head); |
138 | audit_put_chunk(chunk); | |
74c3cbe3 AV |
139 | } |
140 | ||
a8375713 JK |
141 | /* |
142 | * Drop reference to the chunk that was held by the mark. This is the reference | |
143 | * that gets dropped after we've removed the chunk from the hash table and we | |
144 | * use it to make sure chunk cannot be freed before RCU grace period expires. | |
145 | */ | |
146 | static void audit_mark_put_chunk(struct audit_chunk *chunk) | |
147 | { | |
148 | call_rcu(&chunk->head, __put_chunk); | |
149 | } | |
150 | ||
5f516130 JK |
151 | static inline struct audit_tree_mark *audit_mark(struct fsnotify_mark *entry) |
152 | { | |
153 | return container_of(entry, struct audit_tree_mark, mark); | |
154 | } | |
155 | ||
156 | static struct audit_chunk *mark_chunk(struct fsnotify_mark *mark) | |
157 | { | |
158 | return audit_mark(mark)->chunk; | |
159 | } | |
160 | ||
e61ce867 | 161 | static void audit_tree_destroy_watch(struct fsnotify_mark *entry) |
28a3a7eb | 162 | { |
5f516130 | 163 | struct audit_chunk *chunk = mark_chunk(entry); |
a8375713 | 164 | audit_mark_put_chunk(chunk); |
5f516130 JK |
165 | kmem_cache_free(audit_tree_mark_cachep, audit_mark(entry)); |
166 | } | |
167 | ||
168 | static struct fsnotify_mark *alloc_mark(void) | |
169 | { | |
170 | struct audit_tree_mark *amark; | |
171 | ||
172 | amark = kmem_cache_zalloc(audit_tree_mark_cachep, GFP_KERNEL); | |
173 | if (!amark) | |
174 | return NULL; | |
175 | fsnotify_init_mark(&amark->mark, audit_tree_group); | |
176 | amark->mark.mask = FS_IN_IGNORED; | |
177 | return &amark->mark; | |
28a3a7eb EP |
178 | } |
179 | ||
180 | static struct audit_chunk *alloc_chunk(int count) | |
181 | { | |
182 | struct audit_chunk *chunk; | |
183 | size_t size; | |
184 | int i; | |
185 | ||
186 | size = offsetof(struct audit_chunk, owners) + count * sizeof(struct node); | |
187 | chunk = kzalloc(size, GFP_KERNEL); | |
188 | if (!chunk) | |
189 | return NULL; | |
190 | ||
5f516130 JK |
191 | chunk->mark = alloc_mark(); |
192 | if (!chunk->mark) { | |
193 | kfree(chunk); | |
194 | return NULL; | |
195 | } | |
196 | audit_mark(chunk->mark)->chunk = chunk; | |
197 | ||
28a3a7eb EP |
198 | INIT_LIST_HEAD(&chunk->hash); |
199 | INIT_LIST_HEAD(&chunk->trees); | |
200 | chunk->count = count; | |
201 | atomic_long_set(&chunk->refs, 1); | |
202 | for (i = 0; i < count; i++) { | |
203 | INIT_LIST_HEAD(&chunk->owners[i].list); | |
204 | chunk->owners[i].index = i; | |
205 | } | |
28a3a7eb EP |
206 | return chunk; |
207 | } | |
208 | ||
74c3cbe3 AV |
209 | enum {HASH_SIZE = 128}; |
210 | static struct list_head chunk_hash_heads[HASH_SIZE]; | |
211 | static __cacheline_aligned_in_smp DEFINE_SPINLOCK(hash_lock); | |
212 | ||
f410ff65 JK |
213 | /* Function to return search key in our hash from inode. */ |
214 | static unsigned long inode_to_key(const struct inode *inode) | |
74c3cbe3 | 215 | { |
36f10f55 AG |
216 | /* Use address pointed to by connector->obj as the key */ |
217 | return (unsigned long)&inode->i_fsnotify_marks; | |
f410ff65 JK |
218 | } |
219 | ||
f410ff65 JK |
220 | static inline struct list_head *chunk_hash(unsigned long key) |
221 | { | |
222 | unsigned long n = key / L1_CACHE_BYTES; | |
74c3cbe3 AV |
223 | return chunk_hash_heads + n % HASH_SIZE; |
224 | } | |
225 | ||
9f16d2e6 | 226 | /* hash_lock & entry->group->mark_mutex is held by caller */ |
74c3cbe3 AV |
227 | static void insert_hash(struct audit_chunk *chunk) |
228 | { | |
28a3a7eb EP |
229 | struct list_head *list; |
230 | ||
1635e572 JK |
231 | /* |
232 | * Make sure chunk is fully initialized before making it visible in the | |
233 | * hash. Pairs with a data dependency barrier in READ_ONCE() in | |
234 | * audit_tree_lookup(). | |
235 | */ | |
236 | smp_wmb(); | |
8d20d6e9 JK |
237 | WARN_ON_ONCE(!chunk->key); |
238 | list = chunk_hash(chunk->key); | |
74c3cbe3 AV |
239 | list_add_rcu(&chunk->hash, list); |
240 | } | |
241 | ||
242 | /* called under rcu_read_lock */ | |
243 | struct audit_chunk *audit_tree_lookup(const struct inode *inode) | |
244 | { | |
f410ff65 JK |
245 | unsigned long key = inode_to_key(inode); |
246 | struct list_head *list = chunk_hash(key); | |
6793a051 | 247 | struct audit_chunk *p; |
74c3cbe3 | 248 | |
6793a051 | 249 | list_for_each_entry_rcu(p, list, hash) { |
1635e572 JK |
250 | /* |
251 | * We use a data dependency barrier in READ_ONCE() to make sure | |
252 | * the chunk we see is fully initialized. | |
253 | */ | |
254 | if (READ_ONCE(p->key) == key) { | |
8f7b0ba1 | 255 | atomic_long_inc(&p->refs); |
74c3cbe3 AV |
256 | return p; |
257 | } | |
258 | } | |
259 | return NULL; | |
260 | } | |
261 | ||
6f1b5d7a | 262 | bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) |
74c3cbe3 AV |
263 | { |
264 | int n; | |
265 | for (n = 0; n < chunk->count; n++) | |
266 | if (chunk->owners[n].owner == tree) | |
6f1b5d7a YB |
267 | return true; |
268 | return false; | |
74c3cbe3 AV |
269 | } |
270 | ||
271 | /* tagging and untagging inodes with trees */ | |
272 | ||
8f7b0ba1 AV |
273 | static struct audit_chunk *find_chunk(struct node *p) |
274 | { | |
275 | int index = p->index & ~(1U<<31); | |
276 | p -= index; | |
277 | return container_of(p, struct audit_chunk, owners[0]); | |
278 | } | |
279 | ||
d31b326d JK |
280 | static void replace_chunk(struct audit_chunk *new, struct audit_chunk *old, |
281 | struct node *skip) | |
282 | { | |
283 | struct audit_tree *owner; | |
284 | int i, j; | |
285 | ||
286 | new->key = old->key; | |
287 | list_splice_init(&old->trees, &new->trees); | |
288 | list_for_each_entry(owner, &new->trees, same_root) | |
289 | owner->root = new; | |
290 | for (i = j = 0; j < old->count; i++, j++) { | |
291 | if (&old->owners[j] == skip) { | |
292 | i--; | |
293 | continue; | |
294 | } | |
295 | owner = old->owners[j].owner; | |
296 | new->owners[i].owner = owner; | |
297 | new->owners[i].index = old->owners[j].index - j + i; | |
298 | if (!owner) /* result of earlier fallback */ | |
299 | continue; | |
300 | get_tree(owner); | |
301 | list_replace_init(&old->owners[j].list, &new->owners[i].list); | |
302 | } | |
303 | /* | |
304 | * Make sure chunk is fully initialized before making it visible in the | |
305 | * hash. Pairs with a data dependency barrier in READ_ONCE() in | |
306 | * audit_tree_lookup(). | |
307 | */ | |
308 | smp_wmb(); | |
309 | list_replace_rcu(&old->hash, &new->hash); | |
310 | } | |
311 | ||
8f7b0ba1 | 312 | static void untag_chunk(struct node *p) |
74c3cbe3 | 313 | { |
8f7b0ba1 | 314 | struct audit_chunk *chunk = find_chunk(p); |
5f516130 | 315 | struct fsnotify_mark *entry = chunk->mark; |
f7a998a9 | 316 | struct audit_chunk *new = NULL; |
74c3cbe3 AV |
317 | struct audit_tree *owner; |
318 | int size = chunk->count - 1; | |
74c3cbe3 | 319 | |
28a3a7eb | 320 | fsnotify_get_mark(entry); |
8f7b0ba1 AV |
321 | |
322 | spin_unlock(&hash_lock); | |
323 | ||
f7a998a9 AV |
324 | if (size) |
325 | new = alloc_chunk(size); | |
326 | ||
be29d20f | 327 | mutex_lock(&entry->group->mark_mutex); |
6b3f05d2 JK |
328 | /* |
329 | * mark_mutex protects mark from getting detached and thus also from | |
36f10f55 | 330 | * mark->connector->obj getting NULL. |
6b3f05d2 | 331 | */ |
43471d15 | 332 | if (chunk->dead || !(entry->flags & FSNOTIFY_MARK_FLAG_ATTACHED)) { |
be29d20f | 333 | mutex_unlock(&entry->group->mark_mutex); |
f7a998a9 | 334 | if (new) |
5f516130 | 335 | fsnotify_put_mark(new->mark); |
8f7b0ba1 | 336 | goto out; |
74c3cbe3 AV |
337 | } |
338 | ||
339 | owner = p->owner; | |
340 | ||
341 | if (!size) { | |
342 | chunk->dead = 1; | |
343 | spin_lock(&hash_lock); | |
344 | list_del_init(&chunk->trees); | |
345 | if (owner->root == chunk) | |
346 | owner->root = NULL; | |
347 | list_del_init(&p->list); | |
348 | list_del_rcu(&chunk->hash); | |
349 | spin_unlock(&hash_lock); | |
b1e4603b | 350 | fsnotify_detach_mark(entry); |
be29d20f | 351 | mutex_unlock(&entry->group->mark_mutex); |
b1e4603b | 352 | fsnotify_free_mark(entry); |
8f7b0ba1 | 353 | goto out; |
74c3cbe3 AV |
354 | } |
355 | ||
74c3cbe3 AV |
356 | if (!new) |
357 | goto Fallback; | |
f7a998a9 | 358 | |
5f516130 | 359 | if (fsnotify_add_mark_locked(new->mark, entry->connector->obj, |
36f10f55 | 360 | FSNOTIFY_OBJ_TYPE_INODE, 1)) { |
5f516130 | 361 | fsnotify_put_mark(new->mark); |
74c3cbe3 AV |
362 | goto Fallback; |
363 | } | |
364 | ||
365 | chunk->dead = 1; | |
366 | spin_lock(&hash_lock); | |
74c3cbe3 AV |
367 | if (owner->root == chunk) { |
368 | list_del_init(&owner->same_root); | |
369 | owner->root = NULL; | |
370 | } | |
d31b326d | 371 | list_del_init(&p->list); |
1635e572 | 372 | /* |
d31b326d JK |
373 | * This has to go last when updating chunk as once replace_chunk() is |
374 | * called, new RCU readers can see the new chunk. | |
1635e572 | 375 | */ |
d31b326d | 376 | replace_chunk(new, chunk, p); |
74c3cbe3 | 377 | spin_unlock(&hash_lock); |
b1e4603b | 378 | fsnotify_detach_mark(entry); |
be29d20f | 379 | mutex_unlock(&entry->group->mark_mutex); |
b1e4603b | 380 | fsnotify_free_mark(entry); |
5f516130 | 381 | fsnotify_put_mark(new->mark); /* drop initial reference */ |
8f7b0ba1 | 382 | goto out; |
74c3cbe3 AV |
383 | |
384 | Fallback: | |
385 | // do the best we can | |
386 | spin_lock(&hash_lock); | |
387 | if (owner->root == chunk) { | |
388 | list_del_init(&owner->same_root); | |
389 | owner->root = NULL; | |
390 | } | |
391 | list_del_init(&p->list); | |
392 | p->owner = NULL; | |
393 | put_tree(owner); | |
394 | spin_unlock(&hash_lock); | |
be29d20f | 395 | mutex_unlock(&entry->group->mark_mutex); |
8f7b0ba1 | 396 | out: |
28a3a7eb | 397 | fsnotify_put_mark(entry); |
8f7b0ba1 | 398 | spin_lock(&hash_lock); |
74c3cbe3 AV |
399 | } |
400 | ||
a5789b07 | 401 | /* Call with group->mark_mutex held, releases it */ |
74c3cbe3 AV |
402 | static int create_chunk(struct inode *inode, struct audit_tree *tree) |
403 | { | |
e61ce867 | 404 | struct fsnotify_mark *entry; |
74c3cbe3 | 405 | struct audit_chunk *chunk = alloc_chunk(1); |
a5789b07 JK |
406 | |
407 | if (!chunk) { | |
408 | mutex_unlock(&audit_tree_group->mark_mutex); | |
74c3cbe3 | 409 | return -ENOMEM; |
a5789b07 | 410 | } |
74c3cbe3 | 411 | |
5f516130 | 412 | entry = chunk->mark; |
a5789b07 JK |
413 | if (fsnotify_add_inode_mark_locked(entry, inode, 0)) { |
414 | mutex_unlock(&audit_tree_group->mark_mutex); | |
0fe33aae | 415 | fsnotify_put_mark(entry); |
74c3cbe3 AV |
416 | return -ENOSPC; |
417 | } | |
418 | ||
74c3cbe3 AV |
419 | spin_lock(&hash_lock); |
420 | if (tree->goner) { | |
421 | spin_unlock(&hash_lock); | |
422 | chunk->dead = 1; | |
b1e4603b | 423 | fsnotify_detach_mark(entry); |
a5789b07 | 424 | mutex_unlock(&audit_tree_group->mark_mutex); |
b1e4603b | 425 | fsnotify_free_mark(entry); |
28a3a7eb | 426 | fsnotify_put_mark(entry); |
74c3cbe3 AV |
427 | return 0; |
428 | } | |
429 | chunk->owners[0].index = (1U << 31); | |
430 | chunk->owners[0].owner = tree; | |
431 | get_tree(tree); | |
432 | list_add(&chunk->owners[0].list, &tree->chunks); | |
433 | if (!tree->root) { | |
434 | tree->root = chunk; | |
435 | list_add(&tree->same_root, &chunk->trees); | |
436 | } | |
8d20d6e9 | 437 | chunk->key = inode_to_key(inode); |
1635e572 JK |
438 | /* |
439 | * Inserting into the hash table has to go last as once we do that RCU | |
440 | * readers can see the chunk. | |
441 | */ | |
74c3cbe3 AV |
442 | insert_hash(chunk); |
443 | spin_unlock(&hash_lock); | |
a5789b07 | 444 | mutex_unlock(&audit_tree_group->mark_mutex); |
b3e8692b | 445 | fsnotify_put_mark(entry); /* drop initial reference */ |
74c3cbe3 AV |
446 | return 0; |
447 | } | |
448 | ||
449 | /* the first tagged inode becomes root of tree */ | |
450 | static int tag_chunk(struct inode *inode, struct audit_tree *tree) | |
451 | { | |
e61ce867 | 452 | struct fsnotify_mark *old_entry, *chunk_entry; |
74c3cbe3 AV |
453 | struct audit_chunk *chunk, *old; |
454 | struct node *p; | |
455 | int n; | |
456 | ||
a5789b07 | 457 | mutex_lock(&audit_tree_group->mark_mutex); |
b1362edf JK |
458 | old_entry = fsnotify_find_mark(&inode->i_fsnotify_marks, |
459 | audit_tree_group); | |
28a3a7eb | 460 | if (!old_entry) |
74c3cbe3 AV |
461 | return create_chunk(inode, tree); |
462 | ||
5f516130 | 463 | old = mark_chunk(old_entry); |
74c3cbe3 AV |
464 | |
465 | /* are we already there? */ | |
466 | spin_lock(&hash_lock); | |
467 | for (n = 0; n < old->count; n++) { | |
468 | if (old->owners[n].owner == tree) { | |
469 | spin_unlock(&hash_lock); | |
a5789b07 | 470 | mutex_unlock(&audit_tree_group->mark_mutex); |
28a3a7eb | 471 | fsnotify_put_mark(old_entry); |
74c3cbe3 AV |
472 | return 0; |
473 | } | |
474 | } | |
475 | spin_unlock(&hash_lock); | |
476 | ||
477 | chunk = alloc_chunk(old->count + 1); | |
b4c30aad | 478 | if (!chunk) { |
a5789b07 | 479 | mutex_unlock(&audit_tree_group->mark_mutex); |
28a3a7eb | 480 | fsnotify_put_mark(old_entry); |
74c3cbe3 | 481 | return -ENOMEM; |
b4c30aad | 482 | } |
74c3cbe3 | 483 | |
5f516130 | 484 | chunk_entry = chunk->mark; |
28a3a7eb | 485 | |
6b3f05d2 JK |
486 | /* |
487 | * mark_mutex protects mark from getting detached and thus also from | |
36f10f55 | 488 | * mark->connector->obj getting NULL. |
6b3f05d2 | 489 | */ |
43471d15 | 490 | if (!(old_entry->flags & FSNOTIFY_MARK_FLAG_ATTACHED)) { |
28a3a7eb | 491 | /* old_entry is being shot, lets just lie */ |
a5789b07 | 492 | mutex_unlock(&audit_tree_group->mark_mutex); |
28a3a7eb | 493 | fsnotify_put_mark(old_entry); |
5f516130 | 494 | fsnotify_put_mark(chunk->mark); |
28a3a7eb EP |
495 | return -ENOENT; |
496 | } | |
497 | ||
36f10f55 AG |
498 | if (fsnotify_add_mark_locked(chunk_entry, old_entry->connector->obj, |
499 | FSNOTIFY_OBJ_TYPE_INODE, 1)) { | |
a5789b07 | 500 | mutex_unlock(&audit_tree_group->mark_mutex); |
0fe33aae | 501 | fsnotify_put_mark(chunk_entry); |
28a3a7eb | 502 | fsnotify_put_mark(old_entry); |
74c3cbe3 AV |
503 | return -ENOSPC; |
504 | } | |
28a3a7eb | 505 | |
74c3cbe3 AV |
506 | spin_lock(&hash_lock); |
507 | if (tree->goner) { | |
508 | spin_unlock(&hash_lock); | |
509 | chunk->dead = 1; | |
b1e4603b | 510 | fsnotify_detach_mark(chunk_entry); |
a5789b07 | 511 | mutex_unlock(&audit_tree_group->mark_mutex); |
b1e4603b | 512 | fsnotify_free_mark(chunk_entry); |
28a3a7eb EP |
513 | fsnotify_put_mark(chunk_entry); |
514 | fsnotify_put_mark(old_entry); | |
74c3cbe3 AV |
515 | return 0; |
516 | } | |
d31b326d | 517 | p = &chunk->owners[chunk->count - 1]; |
74c3cbe3 AV |
518 | p->index = (chunk->count - 1) | (1U<<31); |
519 | p->owner = tree; | |
520 | get_tree(tree); | |
521 | list_add(&p->list, &tree->chunks); | |
74c3cbe3 AV |
522 | old->dead = 1; |
523 | if (!tree->root) { | |
524 | tree->root = chunk; | |
525 | list_add(&tree->same_root, &chunk->trees); | |
526 | } | |
1635e572 | 527 | /* |
d31b326d JK |
528 | * This has to go last when updating chunk as once replace_chunk() is |
529 | * called, new RCU readers can see the new chunk. | |
1635e572 | 530 | */ |
d31b326d | 531 | replace_chunk(chunk, old, NULL); |
74c3cbe3 | 532 | spin_unlock(&hash_lock); |
b1e4603b | 533 | fsnotify_detach_mark(old_entry); |
a5789b07 | 534 | mutex_unlock(&audit_tree_group->mark_mutex); |
b1e4603b | 535 | fsnotify_free_mark(old_entry); |
b3e8692b | 536 | fsnotify_put_mark(chunk_entry); /* drop initial reference */ |
28a3a7eb | 537 | fsnotify_put_mark(old_entry); /* pair to fsnotify_find mark_entry */ |
74c3cbe3 AV |
538 | return 0; |
539 | } | |
540 | ||
2991dd2b | 541 | static void audit_tree_log_remove_rule(struct audit_krule *rule) |
0644ec0c KC |
542 | { |
543 | struct audit_buffer *ab; | |
544 | ||
65a8766f RGB |
545 | if (!audit_enabled) |
546 | return; | |
0644ec0c KC |
547 | ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE); |
548 | if (unlikely(!ab)) | |
549 | return; | |
c1e8f06d | 550 | audit_log_format(ab, "op=remove_rule"); |
0644ec0c KC |
551 | audit_log_format(ab, " dir="); |
552 | audit_log_untrustedstring(ab, rule->tree->pathname); | |
553 | audit_log_key(ab, rule->filterkey); | |
554 | audit_log_format(ab, " list=%d res=1", rule->listnr); | |
555 | audit_log_end(ab); | |
556 | } | |
557 | ||
74c3cbe3 AV |
558 | static void kill_rules(struct audit_tree *tree) |
559 | { | |
560 | struct audit_krule *rule, *next; | |
561 | struct audit_entry *entry; | |
74c3cbe3 AV |
562 | |
563 | list_for_each_entry_safe(rule, next, &tree->rules, rlist) { | |
564 | entry = container_of(rule, struct audit_entry, rule); | |
565 | ||
566 | list_del_init(&rule->rlist); | |
567 | if (rule->tree) { | |
568 | /* not a half-baked one */ | |
2991dd2b | 569 | audit_tree_log_remove_rule(rule); |
34d99af5 RGB |
570 | if (entry->rule.exe) |
571 | audit_remove_mark(entry->rule.exe); | |
74c3cbe3 AV |
572 | rule->tree = NULL; |
573 | list_del_rcu(&entry->list); | |
e45aa212 | 574 | list_del(&entry->rule.list); |
74c3cbe3 AV |
575 | call_rcu(&entry->rcu, audit_free_rule_rcu); |
576 | } | |
577 | } | |
578 | } | |
579 | ||
580 | /* | |
581 | * finish killing struct audit_tree | |
582 | */ | |
583 | static void prune_one(struct audit_tree *victim) | |
584 | { | |
585 | spin_lock(&hash_lock); | |
586 | while (!list_empty(&victim->chunks)) { | |
587 | struct node *p; | |
74c3cbe3 AV |
588 | |
589 | p = list_entry(victim->chunks.next, struct node, list); | |
74c3cbe3 | 590 | |
8f7b0ba1 | 591 | untag_chunk(p); |
74c3cbe3 AV |
592 | } |
593 | spin_unlock(&hash_lock); | |
594 | put_tree(victim); | |
595 | } | |
596 | ||
597 | /* trim the uncommitted chunks from tree */ | |
598 | ||
599 | static void trim_marked(struct audit_tree *tree) | |
600 | { | |
601 | struct list_head *p, *q; | |
602 | spin_lock(&hash_lock); | |
603 | if (tree->goner) { | |
604 | spin_unlock(&hash_lock); | |
605 | return; | |
606 | } | |
607 | /* reorder */ | |
608 | for (p = tree->chunks.next; p != &tree->chunks; p = q) { | |
609 | struct node *node = list_entry(p, struct node, list); | |
610 | q = p->next; | |
611 | if (node->index & (1U<<31)) { | |
612 | list_del_init(p); | |
613 | list_add(p, &tree->chunks); | |
614 | } | |
615 | } | |
616 | ||
617 | while (!list_empty(&tree->chunks)) { | |
618 | struct node *node; | |
74c3cbe3 AV |
619 | |
620 | node = list_entry(tree->chunks.next, struct node, list); | |
621 | ||
622 | /* have we run out of marked? */ | |
623 | if (!(node->index & (1U<<31))) | |
624 | break; | |
625 | ||
8f7b0ba1 | 626 | untag_chunk(node); |
74c3cbe3 AV |
627 | } |
628 | if (!tree->root && !tree->goner) { | |
629 | tree->goner = 1; | |
630 | spin_unlock(&hash_lock); | |
631 | mutex_lock(&audit_filter_mutex); | |
632 | kill_rules(tree); | |
633 | list_del_init(&tree->list); | |
634 | mutex_unlock(&audit_filter_mutex); | |
635 | prune_one(tree); | |
636 | } else { | |
637 | spin_unlock(&hash_lock); | |
638 | } | |
639 | } | |
640 | ||
916d7576 AV |
641 | static void audit_schedule_prune(void); |
642 | ||
74c3cbe3 AV |
643 | /* called with audit_filter_mutex */ |
644 | int audit_remove_tree_rule(struct audit_krule *rule) | |
645 | { | |
646 | struct audit_tree *tree; | |
647 | tree = rule->tree; | |
648 | if (tree) { | |
649 | spin_lock(&hash_lock); | |
650 | list_del_init(&rule->rlist); | |
651 | if (list_empty(&tree->rules) && !tree->goner) { | |
652 | tree->root = NULL; | |
653 | list_del_init(&tree->same_root); | |
654 | tree->goner = 1; | |
655 | list_move(&tree->list, &prune_list); | |
656 | rule->tree = NULL; | |
657 | spin_unlock(&hash_lock); | |
658 | audit_schedule_prune(); | |
659 | return 1; | |
660 | } | |
661 | rule->tree = NULL; | |
662 | spin_unlock(&hash_lock); | |
663 | return 1; | |
664 | } | |
665 | return 0; | |
666 | } | |
667 | ||
1f707137 AV |
668 | static int compare_root(struct vfsmount *mnt, void *arg) |
669 | { | |
f410ff65 JK |
670 | return inode_to_key(d_backing_inode(mnt->mnt_root)) == |
671 | (unsigned long)arg; | |
1f707137 AV |
672 | } |
673 | ||
74c3cbe3 AV |
674 | void audit_trim_trees(void) |
675 | { | |
676 | struct list_head cursor; | |
677 | ||
678 | mutex_lock(&audit_filter_mutex); | |
679 | list_add(&cursor, &tree_list); | |
680 | while (cursor.next != &tree_list) { | |
681 | struct audit_tree *tree; | |
98bc993f | 682 | struct path path; |
74c3cbe3 AV |
683 | struct vfsmount *root_mnt; |
684 | struct node *node; | |
74c3cbe3 AV |
685 | int err; |
686 | ||
687 | tree = container_of(cursor.next, struct audit_tree, list); | |
688 | get_tree(tree); | |
689 | list_del(&cursor); | |
690 | list_add(&cursor, &tree->list); | |
691 | mutex_unlock(&audit_filter_mutex); | |
692 | ||
98bc993f | 693 | err = kern_path(tree->pathname, 0, &path); |
74c3cbe3 AV |
694 | if (err) |
695 | goto skip_it; | |
696 | ||
589ff870 | 697 | root_mnt = collect_mounts(&path); |
98bc993f | 698 | path_put(&path); |
be34d1a3 | 699 | if (IS_ERR(root_mnt)) |
74c3cbe3 AV |
700 | goto skip_it; |
701 | ||
74c3cbe3 AV |
702 | spin_lock(&hash_lock); |
703 | list_for_each_entry(node, &tree->chunks, list) { | |
28a3a7eb | 704 | struct audit_chunk *chunk = find_chunk(node); |
25985edc | 705 | /* this could be NULL if the watch is dying else where... */ |
74c3cbe3 | 706 | node->index |= 1U<<31; |
f410ff65 | 707 | if (iterate_mounts(compare_root, |
8d20d6e9 | 708 | (void *)(chunk->key), |
f410ff65 | 709 | root_mnt)) |
1f707137 | 710 | node->index &= ~(1U<<31); |
74c3cbe3 AV |
711 | } |
712 | spin_unlock(&hash_lock); | |
713 | trim_marked(tree); | |
74c3cbe3 AV |
714 | drop_collected_mounts(root_mnt); |
715 | skip_it: | |
12b2f117 | 716 | put_tree(tree); |
74c3cbe3 AV |
717 | mutex_lock(&audit_filter_mutex); |
718 | } | |
719 | list_del(&cursor); | |
720 | mutex_unlock(&audit_filter_mutex); | |
721 | } | |
722 | ||
74c3cbe3 AV |
723 | int audit_make_tree(struct audit_krule *rule, char *pathname, u32 op) |
724 | { | |
725 | ||
726 | if (pathname[0] != '/' || | |
727 | rule->listnr != AUDIT_FILTER_EXIT || | |
5af75d8d | 728 | op != Audit_equal || |
74c3cbe3 AV |
729 | rule->inode_f || rule->watch || rule->tree) |
730 | return -EINVAL; | |
731 | rule->tree = alloc_tree(pathname); | |
732 | if (!rule->tree) | |
733 | return -ENOMEM; | |
734 | return 0; | |
735 | } | |
736 | ||
737 | void audit_put_tree(struct audit_tree *tree) | |
738 | { | |
739 | put_tree(tree); | |
740 | } | |
741 | ||
1f707137 AV |
742 | static int tag_mount(struct vfsmount *mnt, void *arg) |
743 | { | |
3b362157 | 744 | return tag_chunk(d_backing_inode(mnt->mnt_root), arg); |
1f707137 AV |
745 | } |
746 | ||
f1aaf262 IP |
747 | /* |
748 | * That gets run when evict_chunk() ends up needing to kill audit_tree. | |
749 | * Runs from a separate thread. | |
750 | */ | |
751 | static int prune_tree_thread(void *unused) | |
752 | { | |
753 | for (;;) { | |
0bf676d1 JS |
754 | if (list_empty(&prune_list)) { |
755 | set_current_state(TASK_INTERRUPTIBLE); | |
f1aaf262 | 756 | schedule(); |
0bf676d1 | 757 | } |
f1aaf262 | 758 | |
ce423631 | 759 | audit_ctl_lock(); |
f1aaf262 IP |
760 | mutex_lock(&audit_filter_mutex); |
761 | ||
762 | while (!list_empty(&prune_list)) { | |
763 | struct audit_tree *victim; | |
764 | ||
765 | victim = list_entry(prune_list.next, | |
766 | struct audit_tree, list); | |
767 | list_del_init(&victim->list); | |
768 | ||
769 | mutex_unlock(&audit_filter_mutex); | |
770 | ||
771 | prune_one(victim); | |
772 | ||
773 | mutex_lock(&audit_filter_mutex); | |
774 | } | |
775 | ||
776 | mutex_unlock(&audit_filter_mutex); | |
ce423631 | 777 | audit_ctl_unlock(); |
f1aaf262 IP |
778 | } |
779 | return 0; | |
780 | } | |
781 | ||
782 | static int audit_launch_prune(void) | |
783 | { | |
784 | if (prune_thread) | |
785 | return 0; | |
0bf676d1 | 786 | prune_thread = kthread_run(prune_tree_thread, NULL, |
f1aaf262 IP |
787 | "audit_prune_tree"); |
788 | if (IS_ERR(prune_thread)) { | |
789 | pr_err("cannot start thread audit_prune_tree"); | |
790 | prune_thread = NULL; | |
791 | return -ENOMEM; | |
f1aaf262 | 792 | } |
0bf676d1 | 793 | return 0; |
f1aaf262 IP |
794 | } |
795 | ||
74c3cbe3 AV |
796 | /* called with audit_filter_mutex */ |
797 | int audit_add_tree_rule(struct audit_krule *rule) | |
798 | { | |
799 | struct audit_tree *seed = rule->tree, *tree; | |
98bc993f | 800 | struct path path; |
1f707137 | 801 | struct vfsmount *mnt; |
74c3cbe3 AV |
802 | int err; |
803 | ||
736f3203 | 804 | rule->tree = NULL; |
74c3cbe3 AV |
805 | list_for_each_entry(tree, &tree_list, list) { |
806 | if (!strcmp(seed->pathname, tree->pathname)) { | |
807 | put_tree(seed); | |
808 | rule->tree = tree; | |
809 | list_add(&rule->rlist, &tree->rules); | |
810 | return 0; | |
811 | } | |
812 | } | |
813 | tree = seed; | |
814 | list_add(&tree->list, &tree_list); | |
815 | list_add(&rule->rlist, &tree->rules); | |
816 | /* do not set rule->tree yet */ | |
817 | mutex_unlock(&audit_filter_mutex); | |
818 | ||
f1aaf262 IP |
819 | if (unlikely(!prune_thread)) { |
820 | err = audit_launch_prune(); | |
821 | if (err) | |
822 | goto Err; | |
823 | } | |
824 | ||
98bc993f | 825 | err = kern_path(tree->pathname, 0, &path); |
74c3cbe3 AV |
826 | if (err) |
827 | goto Err; | |
589ff870 | 828 | mnt = collect_mounts(&path); |
98bc993f | 829 | path_put(&path); |
be34d1a3 DH |
830 | if (IS_ERR(mnt)) { |
831 | err = PTR_ERR(mnt); | |
74c3cbe3 AV |
832 | goto Err; |
833 | } | |
74c3cbe3 AV |
834 | |
835 | get_tree(tree); | |
1f707137 | 836 | err = iterate_mounts(tag_mount, tree, mnt); |
74c3cbe3 AV |
837 | drop_collected_mounts(mnt); |
838 | ||
839 | if (!err) { | |
840 | struct node *node; | |
841 | spin_lock(&hash_lock); | |
842 | list_for_each_entry(node, &tree->chunks, list) | |
843 | node->index &= ~(1U<<31); | |
844 | spin_unlock(&hash_lock); | |
845 | } else { | |
846 | trim_marked(tree); | |
847 | goto Err; | |
848 | } | |
849 | ||
850 | mutex_lock(&audit_filter_mutex); | |
851 | if (list_empty(&rule->rlist)) { | |
852 | put_tree(tree); | |
853 | return -ENOENT; | |
854 | } | |
855 | rule->tree = tree; | |
856 | put_tree(tree); | |
857 | ||
858 | return 0; | |
859 | Err: | |
860 | mutex_lock(&audit_filter_mutex); | |
861 | list_del_init(&tree->list); | |
862 | list_del_init(&tree->rules); | |
863 | put_tree(tree); | |
864 | return err; | |
865 | } | |
866 | ||
867 | int audit_tag_tree(char *old, char *new) | |
868 | { | |
869 | struct list_head cursor, barrier; | |
870 | int failed = 0; | |
2096f759 | 871 | struct path path1, path2; |
74c3cbe3 | 872 | struct vfsmount *tagged; |
74c3cbe3 AV |
873 | int err; |
874 | ||
2096f759 | 875 | err = kern_path(new, 0, &path2); |
74c3cbe3 AV |
876 | if (err) |
877 | return err; | |
2096f759 AV |
878 | tagged = collect_mounts(&path2); |
879 | path_put(&path2); | |
be34d1a3 DH |
880 | if (IS_ERR(tagged)) |
881 | return PTR_ERR(tagged); | |
74c3cbe3 | 882 | |
2096f759 | 883 | err = kern_path(old, 0, &path1); |
74c3cbe3 AV |
884 | if (err) { |
885 | drop_collected_mounts(tagged); | |
886 | return err; | |
887 | } | |
74c3cbe3 | 888 | |
74c3cbe3 AV |
889 | mutex_lock(&audit_filter_mutex); |
890 | list_add(&barrier, &tree_list); | |
891 | list_add(&cursor, &barrier); | |
892 | ||
893 | while (cursor.next != &tree_list) { | |
894 | struct audit_tree *tree; | |
2096f759 | 895 | int good_one = 0; |
74c3cbe3 AV |
896 | |
897 | tree = container_of(cursor.next, struct audit_tree, list); | |
898 | get_tree(tree); | |
899 | list_del(&cursor); | |
900 | list_add(&cursor, &tree->list); | |
901 | mutex_unlock(&audit_filter_mutex); | |
902 | ||
2096f759 AV |
903 | err = kern_path(tree->pathname, 0, &path2); |
904 | if (!err) { | |
905 | good_one = path_is_under(&path1, &path2); | |
906 | path_put(&path2); | |
74c3cbe3 AV |
907 | } |
908 | ||
2096f759 | 909 | if (!good_one) { |
74c3cbe3 AV |
910 | put_tree(tree); |
911 | mutex_lock(&audit_filter_mutex); | |
912 | continue; | |
913 | } | |
74c3cbe3 | 914 | |
1f707137 | 915 | failed = iterate_mounts(tag_mount, tree, tagged); |
74c3cbe3 AV |
916 | if (failed) { |
917 | put_tree(tree); | |
918 | mutex_lock(&audit_filter_mutex); | |
919 | break; | |
920 | } | |
921 | ||
922 | mutex_lock(&audit_filter_mutex); | |
923 | spin_lock(&hash_lock); | |
924 | if (!tree->goner) { | |
925 | list_del(&tree->list); | |
926 | list_add(&tree->list, &tree_list); | |
927 | } | |
928 | spin_unlock(&hash_lock); | |
929 | put_tree(tree); | |
930 | } | |
931 | ||
932 | while (barrier.prev != &tree_list) { | |
933 | struct audit_tree *tree; | |
934 | ||
935 | tree = container_of(barrier.prev, struct audit_tree, list); | |
936 | get_tree(tree); | |
937 | list_del(&tree->list); | |
938 | list_add(&tree->list, &barrier); | |
939 | mutex_unlock(&audit_filter_mutex); | |
940 | ||
941 | if (!failed) { | |
942 | struct node *node; | |
943 | spin_lock(&hash_lock); | |
944 | list_for_each_entry(node, &tree->chunks, list) | |
945 | node->index &= ~(1U<<31); | |
946 | spin_unlock(&hash_lock); | |
947 | } else { | |
948 | trim_marked(tree); | |
949 | } | |
950 | ||
951 | put_tree(tree); | |
952 | mutex_lock(&audit_filter_mutex); | |
953 | } | |
954 | list_del(&barrier); | |
955 | list_del(&cursor); | |
74c3cbe3 | 956 | mutex_unlock(&audit_filter_mutex); |
2096f759 | 957 | path_put(&path1); |
74c3cbe3 AV |
958 | drop_collected_mounts(tagged); |
959 | return failed; | |
960 | } | |
961 | ||
916d7576 AV |
962 | |
963 | static void audit_schedule_prune(void) | |
964 | { | |
f1aaf262 | 965 | wake_up_process(prune_thread); |
916d7576 AV |
966 | } |
967 | ||
968 | /* | |
969 | * ... and that one is done if evict_chunk() decides to delay until the end | |
970 | * of syscall. Runs synchronously. | |
971 | */ | |
972 | void audit_kill_trees(struct list_head *list) | |
973 | { | |
ce423631 | 974 | audit_ctl_lock(); |
916d7576 AV |
975 | mutex_lock(&audit_filter_mutex); |
976 | ||
977 | while (!list_empty(list)) { | |
978 | struct audit_tree *victim; | |
979 | ||
980 | victim = list_entry(list->next, struct audit_tree, list); | |
981 | kill_rules(victim); | |
982 | list_del_init(&victim->list); | |
983 | ||
984 | mutex_unlock(&audit_filter_mutex); | |
985 | ||
986 | prune_one(victim); | |
987 | ||
988 | mutex_lock(&audit_filter_mutex); | |
989 | } | |
990 | ||
991 | mutex_unlock(&audit_filter_mutex); | |
ce423631 | 992 | audit_ctl_unlock(); |
74c3cbe3 AV |
993 | } |
994 | ||
995 | /* | |
996 | * Here comes the stuff asynchronous to auditctl operations | |
997 | */ | |
998 | ||
74c3cbe3 AV |
999 | static void evict_chunk(struct audit_chunk *chunk) |
1000 | { | |
1001 | struct audit_tree *owner; | |
916d7576 AV |
1002 | struct list_head *postponed = audit_killed_trees(); |
1003 | int need_prune = 0; | |
74c3cbe3 AV |
1004 | int n; |
1005 | ||
1006 | if (chunk->dead) | |
1007 | return; | |
1008 | ||
1009 | chunk->dead = 1; | |
1010 | mutex_lock(&audit_filter_mutex); | |
1011 | spin_lock(&hash_lock); | |
1012 | while (!list_empty(&chunk->trees)) { | |
1013 | owner = list_entry(chunk->trees.next, | |
1014 | struct audit_tree, same_root); | |
1015 | owner->goner = 1; | |
1016 | owner->root = NULL; | |
1017 | list_del_init(&owner->same_root); | |
1018 | spin_unlock(&hash_lock); | |
916d7576 AV |
1019 | if (!postponed) { |
1020 | kill_rules(owner); | |
1021 | list_move(&owner->list, &prune_list); | |
1022 | need_prune = 1; | |
1023 | } else { | |
1024 | list_move(&owner->list, postponed); | |
1025 | } | |
74c3cbe3 AV |
1026 | spin_lock(&hash_lock); |
1027 | } | |
1028 | list_del_rcu(&chunk->hash); | |
1029 | for (n = 0; n < chunk->count; n++) | |
1030 | list_del_init(&chunk->owners[n].list); | |
1031 | spin_unlock(&hash_lock); | |
f1aaf262 | 1032 | mutex_unlock(&audit_filter_mutex); |
916d7576 AV |
1033 | if (need_prune) |
1034 | audit_schedule_prune(); | |
74c3cbe3 AV |
1035 | } |
1036 | ||
3a9b16b4 | 1037 | static int audit_tree_handle_event(struct fsnotify_group *group, |
7053aee2 | 1038 | struct inode *to_tell, |
3cd5eca8 | 1039 | u32 mask, const void *data, int data_type, |
9385a84d JK |
1040 | const unsigned char *file_name, u32 cookie, |
1041 | struct fsnotify_iter_info *iter_info) | |
74c3cbe3 | 1042 | { |
83c4c4b0 | 1043 | return 0; |
28a3a7eb | 1044 | } |
74c3cbe3 | 1045 | |
e61ce867 | 1046 | static void audit_tree_freeing_mark(struct fsnotify_mark *entry, struct fsnotify_group *group) |
28a3a7eb | 1047 | { |
5f516130 | 1048 | struct audit_chunk *chunk = mark_chunk(entry); |
28a3a7eb EP |
1049 | |
1050 | evict_chunk(chunk); | |
b3e8692b MS |
1051 | |
1052 | /* | |
1053 | * We are guaranteed to have at least one reference to the mark from | |
1054 | * either the inode or the caller of fsnotify_destroy_mark(). | |
1055 | */ | |
ab97f873 | 1056 | BUG_ON(refcount_read(&entry->refcnt) < 1); |
74c3cbe3 AV |
1057 | } |
1058 | ||
28a3a7eb EP |
1059 | static const struct fsnotify_ops audit_tree_ops = { |
1060 | .handle_event = audit_tree_handle_event, | |
28a3a7eb | 1061 | .freeing_mark = audit_tree_freeing_mark, |
054c636e | 1062 | .free_mark = audit_tree_destroy_watch, |
74c3cbe3 AV |
1063 | }; |
1064 | ||
1065 | static int __init audit_tree_init(void) | |
1066 | { | |
1067 | int i; | |
1068 | ||
5f516130 JK |
1069 | audit_tree_mark_cachep = KMEM_CACHE(audit_tree_mark, SLAB_PANIC); |
1070 | ||
0d2e2a1d | 1071 | audit_tree_group = fsnotify_alloc_group(&audit_tree_ops); |
28a3a7eb EP |
1072 | if (IS_ERR(audit_tree_group)) |
1073 | audit_panic("cannot initialize fsnotify group for rectree watches"); | |
74c3cbe3 AV |
1074 | |
1075 | for (i = 0; i < HASH_SIZE; i++) | |
1076 | INIT_LIST_HEAD(&chunk_hash_heads[i]); | |
1077 | ||
1078 | return 0; | |
1079 | } | |
1080 | __initcall(audit_tree_init); |