1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22#include <linux/file.h>
23#include <linux/kernel.h>
24#include <linux/audit.h>
25#include <linux/kthread.h>
26#include <linux/mutex.h>
27#include <linux/fs.h>
28#include <linux/fsnotify_backend.h>
29#include <linux/namei.h>
30#include <linux/netlink.h>
31#include <linux/refcount.h>
32#include <linux/sched.h>
33#include <linux/slab.h>
34#include <linux/security.h>
35#include "audit.h"
36
37
38
39
40
41
42
43
44
45
46
47
48
49struct audit_watch {
50 refcount_t count;
51 dev_t dev;
52 char *path;
53 unsigned long ino;
54 struct audit_parent *parent;
55 struct list_head wlist;
56 struct list_head rules;
57};
58
59struct audit_parent {
60 struct list_head watches;
61 struct fsnotify_mark mark;
62};
63
64
65static struct fsnotify_group *audit_watch_group;
66
67
68#define AUDIT_FS_WATCH (FS_MOVE | FS_CREATE | FS_DELETE | FS_DELETE_SELF |\
69 FS_MOVE_SELF | FS_UNMOUNT)
70
71static void audit_free_parent(struct audit_parent *parent)
72{
73 WARN_ON(!list_empty(&parent->watches));
74 kfree(parent);
75}
76
77static void audit_watch_free_mark(struct fsnotify_mark *entry)
78{
79 struct audit_parent *parent;
80
81 parent = container_of(entry, struct audit_parent, mark);
82 audit_free_parent(parent);
83}
84
85static void audit_get_parent(struct audit_parent *parent)
86{
87 if (likely(parent))
88 fsnotify_get_mark(&parent->mark);
89}
90
91static void audit_put_parent(struct audit_parent *parent)
92{
93 if (likely(parent))
94 fsnotify_put_mark(&parent->mark);
95}
96
97
98
99
100
101static inline struct audit_parent *audit_find_parent(struct inode *inode)
102{
103 struct audit_parent *parent = NULL;
104 struct fsnotify_mark *entry;
105
106 entry = fsnotify_find_mark(&inode->i_fsnotify_marks, audit_watch_group);
107 if (entry)
108 parent = container_of(entry, struct audit_parent, mark);
109
110 return parent;
111}
112
113void audit_get_watch(struct audit_watch *watch)
114{
115 refcount_inc(&watch->count);
116}
117
118void audit_put_watch(struct audit_watch *watch)
119{
120 if (refcount_dec_and_test(&watch->count)) {
121 WARN_ON(watch->parent);
122 WARN_ON(!list_empty(&watch->rules));
123 kfree(watch->path);
124 kfree(watch);
125 }
126}
127
128static void audit_remove_watch(struct audit_watch *watch)
129{
130 list_del(&watch->wlist);
131 audit_put_parent(watch->parent);
132 watch->parent = NULL;
133 audit_put_watch(watch);
134}
135
136char *audit_watch_path(struct audit_watch *watch)
137{
138 return watch->path;
139}
140
141int audit_watch_compare(struct audit_watch *watch, unsigned long ino, dev_t dev)
142{
143 return (watch->ino != AUDIT_INO_UNSET) &&
144 (watch->ino == ino) &&
145 (watch->dev == dev);
146}
147
148
149static struct audit_parent *audit_init_parent(struct path *path)
150{
151 struct inode *inode = d_backing_inode(path->dentry);
152 struct audit_parent *parent;
153 int ret;
154
155 parent = kzalloc(sizeof(*parent), GFP_KERNEL);
156 if (unlikely(!parent))
157 return ERR_PTR(-ENOMEM);
158
159 INIT_LIST_HEAD(&parent->watches);
160
161 fsnotify_init_mark(&parent->mark, audit_watch_group);
162 parent->mark.mask = AUDIT_FS_WATCH;
163 ret = fsnotify_add_inode_mark(&parent->mark, inode, 0);
164 if (ret < 0) {
165 audit_free_parent(parent);
166 return ERR_PTR(ret);
167 }
168
169 return parent;
170}
171
172
173static struct audit_watch *audit_init_watch(char *path)
174{
175 struct audit_watch *watch;
176
177 watch = kzalloc(sizeof(*watch), GFP_KERNEL);
178 if (unlikely(!watch))
179 return ERR_PTR(-ENOMEM);
180
181 INIT_LIST_HEAD(&watch->rules);
182 refcount_set(&watch->count, 1);
183 watch->path = path;
184 watch->dev = AUDIT_DEV_UNSET;
185 watch->ino = AUDIT_INO_UNSET;
186
187 return watch;
188}
189
190
191int audit_to_watch(struct audit_krule *krule, char *path, int len, u32 op)
192{
193 struct audit_watch *watch;
194
195 if (!audit_watch_group)
196 return -EOPNOTSUPP;
197
198 if (path[0] != '/' || path[len-1] == '/' ||
199 krule->listnr != AUDIT_FILTER_EXIT ||
200 op != Audit_equal ||
201 krule->inode_f || krule->watch || krule->tree)
202 return -EINVAL;
203
204 watch = audit_init_watch(path);
205 if (IS_ERR(watch))
206 return PTR_ERR(watch);
207
208 krule->watch = watch;
209
210 return 0;
211}
212
213
214
215static struct audit_watch *audit_dupe_watch(struct audit_watch *old)
216{
217 char *path;
218 struct audit_watch *new;
219
220 path = kstrdup(old->path, GFP_KERNEL);
221 if (unlikely(!path))
222 return ERR_PTR(-ENOMEM);
223
224 new = audit_init_watch(path);
225 if (IS_ERR(new)) {
226 kfree(path);
227 goto out;
228 }
229
230 new->dev = old->dev;
231 new->ino = old->ino;
232 audit_get_parent(old->parent);
233 new->parent = old->parent;
234
235out:
236 return new;
237}
238
239static void audit_watch_log_rule_change(struct audit_krule *r, struct audit_watch *w, char *op)
240{
241 struct audit_buffer *ab;
242
243 if (!audit_enabled)
244 return;
245 ab = audit_log_start(audit_context(), GFP_NOFS, AUDIT_CONFIG_CHANGE);
246 if (!ab)
247 return;
248 audit_log_session_info(ab);
249 audit_log_format(ab, "op=%s path=", op);
250 audit_log_untrustedstring(ab, w->path);
251 audit_log_key(ab, r->filterkey);
252 audit_log_format(ab, " list=%d res=1", r->listnr);
253 audit_log_end(ab);
254}
255
256
257static void audit_update_watch(struct audit_parent *parent,
258 const struct qstr *dname, dev_t dev,
259 unsigned long ino, unsigned invalidating)
260{
261 struct audit_watch *owatch, *nwatch, *nextw;
262 struct audit_krule *r, *nextr;
263 struct audit_entry *oentry, *nentry;
264
265 mutex_lock(&audit_filter_mutex);
266
267
268 list_for_each_entry_safe(owatch, nextw, &parent->watches, wlist) {
269 if (audit_compare_dname_path(dname, owatch->path,
270 AUDIT_NAME_FULL))
271 continue;
272
273
274
275 if (invalidating && !audit_dummy_context())
276 audit_filter_inodes(current, audit_context());
277
278
279
280 nwatch = audit_dupe_watch(owatch);
281 if (IS_ERR(nwatch)) {
282 mutex_unlock(&audit_filter_mutex);
283 audit_panic("error updating watch, skipping");
284 return;
285 }
286 nwatch->dev = dev;
287 nwatch->ino = ino;
288
289 list_for_each_entry_safe(r, nextr, &owatch->rules, rlist) {
290
291 oentry = container_of(r, struct audit_entry, rule);
292 list_del(&oentry->rule.rlist);
293 list_del_rcu(&oentry->list);
294
295 nentry = audit_dupe_rule(&oentry->rule);
296 if (IS_ERR(nentry)) {
297 list_del(&oentry->rule.list);
298 audit_panic("error updating watch, removing");
299 } else {
300 int h = audit_hash_ino((u32)ino);
301
302
303
304
305
306
307 audit_put_watch(nentry->rule.watch);
308 audit_get_watch(nwatch);
309 nentry->rule.watch = nwatch;
310 list_add(&nentry->rule.rlist, &nwatch->rules);
311 list_add_rcu(&nentry->list, &audit_inode_hash[h]);
312 list_replace(&oentry->rule.list,
313 &nentry->rule.list);
314 }
315 if (oentry->rule.exe)
316 audit_remove_mark(oentry->rule.exe);
317
318 call_rcu(&oentry->rcu, audit_free_rule_rcu);
319 }
320
321 audit_remove_watch(owatch);
322 goto add_watch_to_parent;
323 }
324 mutex_unlock(&audit_filter_mutex);
325 return;
326
327add_watch_to_parent:
328 list_add(&nwatch->wlist, &parent->watches);
329 mutex_unlock(&audit_filter_mutex);
330 return;
331}
332
333
334static void audit_remove_parent_watches(struct audit_parent *parent)
335{
336 struct audit_watch *w, *nextw;
337 struct audit_krule *r, *nextr;
338 struct audit_entry *e;
339
340 mutex_lock(&audit_filter_mutex);
341 list_for_each_entry_safe(w, nextw, &parent->watches, wlist) {
342 list_for_each_entry_safe(r, nextr, &w->rules, rlist) {
343 e = container_of(r, struct audit_entry, rule);
344 audit_watch_log_rule_change(r, w, "remove_rule");
345 if (e->rule.exe)
346 audit_remove_mark(e->rule.exe);
347 list_del(&r->rlist);
348 list_del(&r->list);
349 list_del_rcu(&e->list);
350 call_rcu(&e->rcu, audit_free_rule_rcu);
351 }
352 audit_remove_watch(w);
353 }
354 mutex_unlock(&audit_filter_mutex);
355
356 fsnotify_destroy_mark(&parent->mark, audit_watch_group);
357}
358
359
360static int audit_get_nd(struct audit_watch *watch, struct path *parent)
361{
362 struct dentry *d = kern_path_locked(watch->path, parent);
363 if (IS_ERR(d))
364 return PTR_ERR(d);
365 if (d_is_positive(d)) {
366
367 watch->dev = d->d_sb->s_dev;
368 watch->ino = d_backing_inode(d)->i_ino;
369 }
370 inode_unlock(d_backing_inode(parent->dentry));
371 dput(d);
372 return 0;
373}
374
375
376
377static void audit_add_to_parent(struct audit_krule *krule,
378 struct audit_parent *parent)
379{
380 struct audit_watch *w, *watch = krule->watch;
381 int watch_found = 0;
382
383 BUG_ON(!mutex_is_locked(&audit_filter_mutex));
384
385 list_for_each_entry(w, &parent->watches, wlist) {
386 if (strcmp(watch->path, w->path))
387 continue;
388
389 watch_found = 1;
390
391
392 audit_put_watch(watch);
393
394 audit_get_watch(w);
395 krule->watch = watch = w;
396
397 audit_put_parent(parent);
398 break;
399 }
400
401 if (!watch_found) {
402 watch->parent = parent;
403
404 audit_get_watch(watch);
405 list_add(&watch->wlist, &parent->watches);
406 }
407 list_add(&krule->rlist, &watch->rules);
408}
409
410
411
412int audit_add_watch(struct audit_krule *krule, struct list_head **list)
413{
414 struct audit_watch *watch = krule->watch;
415 struct audit_parent *parent;
416 struct path parent_path;
417 int h, ret = 0;
418
419
420
421
422
423
424 audit_get_watch(watch);
425
426 mutex_unlock(&audit_filter_mutex);
427
428
429 ret = audit_get_nd(watch, &parent_path);
430
431
432 mutex_lock(&audit_filter_mutex);
433
434 if (ret) {
435 audit_put_watch(watch);
436 return ret;
437 }
438
439
440 parent = audit_find_parent(d_backing_inode(parent_path.dentry));
441 if (!parent) {
442 parent = audit_init_parent(&parent_path);
443 if (IS_ERR(parent)) {
444 ret = PTR_ERR(parent);
445 goto error;
446 }
447 }
448
449 audit_add_to_parent(krule, parent);
450
451 h = audit_hash_ino((u32)watch->ino);
452 *list = &audit_inode_hash[h];
453error:
454 path_put(&parent_path);
455 audit_put_watch(watch);
456 return ret;
457}
458
459void audit_remove_watch_rule(struct audit_krule *krule)
460{
461 struct audit_watch *watch = krule->watch;
462 struct audit_parent *parent = watch->parent;
463
464 list_del(&krule->rlist);
465
466 if (list_empty(&watch->rules)) {
467
468
469
470
471 audit_get_parent(parent);
472 audit_remove_watch(watch);
473 if (list_empty(&parent->watches))
474 fsnotify_destroy_mark(&parent->mark, audit_watch_group);
475 audit_put_parent(parent);
476 }
477}
478
479
480static int audit_watch_handle_event(struct fsnotify_group *group,
481 struct inode *to_tell,
482 u32 mask, const void *data, int data_type,
483 const struct qstr *dname, u32 cookie,
484 struct fsnotify_iter_info *iter_info)
485{
486 struct fsnotify_mark *inode_mark = fsnotify_iter_inode_mark(iter_info);
487 const struct inode *inode;
488 struct audit_parent *parent;
489
490 parent = container_of(inode_mark, struct audit_parent, mark);
491
492 BUG_ON(group != audit_watch_group);
493
494 switch (data_type) {
495 case (FSNOTIFY_EVENT_PATH):
496 inode = d_backing_inode(((const struct path *)data)->dentry);
497 break;
498 case (FSNOTIFY_EVENT_INODE):
499 inode = (const struct inode *)data;
500 break;
501 default:
502 BUG();
503 inode = NULL;
504 break;
505 }
506
507 if (mask & (FS_CREATE|FS_MOVED_TO) && inode)
508 audit_update_watch(parent, dname, inode->i_sb->s_dev, inode->i_ino, 0);
509 else if (mask & (FS_DELETE|FS_MOVED_FROM))
510 audit_update_watch(parent, dname, AUDIT_DEV_UNSET, AUDIT_INO_UNSET, 1);
511 else if (mask & (FS_DELETE_SELF|FS_UNMOUNT|FS_MOVE_SELF))
512 audit_remove_parent_watches(parent);
513
514 return 0;
515}
516
517static const struct fsnotify_ops audit_watch_fsnotify_ops = {
518 .handle_event = audit_watch_handle_event,
519 .free_mark = audit_watch_free_mark,
520};
521
522static int __init audit_watch_init(void)
523{
524 audit_watch_group = fsnotify_alloc_group(&audit_watch_fsnotify_ops);
525 if (IS_ERR(audit_watch_group)) {
526 audit_watch_group = NULL;
527 audit_panic("cannot create audit fsnotify group");
528 }
529 return 0;
530}
531device_initcall(audit_watch_init);
532
533int audit_dupe_exe(struct audit_krule *new, struct audit_krule *old)
534{
535 struct audit_fsnotify_mark *audit_mark;
536 char *pathname;
537
538 pathname = kstrdup(audit_mark_path(old->exe), GFP_KERNEL);
539 if (!pathname)
540 return -ENOMEM;
541
542 audit_mark = audit_alloc_mark(new, pathname, strlen(pathname));
543 if (IS_ERR(audit_mark)) {
544 kfree(pathname);
545 return PTR_ERR(audit_mark);
546 }
547 new->exe = audit_mark;
548
549 return 0;
550}
551
552int audit_exe_compare(struct task_struct *tsk, struct audit_fsnotify_mark *mark)
553{
554 struct file *exe_file;
555 unsigned long ino;
556 dev_t dev;
557
558 exe_file = get_task_exe_file(tsk);
559 if (!exe_file)
560 return 0;
561 ino = file_inode(exe_file)->i_ino;
562 dev = file_inode(exe_file)->i_sb->s_dev;
563 fput(exe_file);
564 return audit_mark_compare(mark, ino, dev);
565}
566