Commit | Line | Data |
---|---|---|
fe7752ba DW |
1 | /* audit -- definition of audit_context structure and supporting types |
2 | * | |
3 | * Copyright 2003-2004 Red Hat, Inc. | |
4 | * Copyright 2005 Hewlett-Packard Development Company, L.P. | |
5 | * Copyright 2005 IBM Corporation | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU General Public License as published by | |
9 | * the Free Software Foundation; either version 2 of the License, or | |
10 | * (at your option) any later version. | |
11 | * | |
12 | * This program is distributed in the hope that it will be useful, | |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | * GNU General Public License for more details. | |
16 | * | |
17 | * You should have received a copy of the GNU General Public License | |
18 | * along with this program; if not, write to the Free Software | |
19 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
20 | */ | |
21 | ||
22 | #include <linux/fs.h> | |
23 | #include <linux/audit.h> | |
9044e6bc | 24 | #include <linux/skbuff.h> |
b24a30a7 | 25 | #include <uapi/linux/mqueue.h> |
3f5be2da | 26 | #include <linux/tty.h> |
fe7752ba | 27 | |
b24a30a7 EP |
28 | /* AUDIT_NAMES is the number of slots we reserve in the audit_context |
29 | * for saving names from getname(). If we get more names we will allocate | |
30 | * a name dynamically and also add those to the list anchored by names_list. */ | |
31 | #define AUDIT_NAMES 5 | |
32 | ||
fe7752ba DW |
33 | /* At task start time, the audit_state is set in the audit_context using |
34 | a per-task filter. At syscall entry, the audit_state is augmented by | |
35 | the syscall filter. */ | |
36 | enum audit_state { | |
37 | AUDIT_DISABLED, /* Do not create per-task audit_context. | |
38 | * No syscall-specific audit records can | |
39 | * be generated. */ | |
fe7752ba | 40 | AUDIT_BUILD_CONTEXT, /* Create the per-task audit_context, |
997f5b64 | 41 | * and fill it in at syscall |
fe7752ba DW |
42 | * entry time. This makes a full |
43 | * syscall record available if some | |
44 | * other part of the kernel decides it | |
45 | * should be recorded. */ | |
46 | AUDIT_RECORD_CONTEXT /* Create the per-task audit_context, | |
47 | * always fill it in at syscall entry | |
48 | * time, and always write out the audit | |
49 | * record at syscall exit time. */ | |
50 | }; | |
51 | ||
52 | /* Rule lists */ | |
cfcad62c | 53 | struct audit_watch; |
7f492942 | 54 | struct audit_fsnotify_mark; |
74c3cbe3 AV |
55 | struct audit_tree; |
56 | struct audit_chunk; | |
57 | ||
fe7752ba | 58 | struct audit_entry { |
93315ed6 AG |
59 | struct list_head list; |
60 | struct rcu_head rcu; | |
61 | struct audit_krule rule; | |
fe7752ba DW |
62 | }; |
63 | ||
b24a30a7 EP |
64 | struct audit_cap_data { |
65 | kernel_cap_t permitted; | |
66 | kernel_cap_t inheritable; | |
67 | union { | |
68 | unsigned int fE; /* effective bit of file cap */ | |
69 | kernel_cap_t effective; /* effective set of process */ | |
70 | }; | |
71 | }; | |
72 | ||
55422d0b PM |
73 | /* When fs/namei.c:getname() is called, we store the pointer in name and bump |
74 | * the refcnt in the associated filename struct. | |
b24a30a7 EP |
75 | * |
76 | * Further, in fs/namei.c:path_lookup() we store the inode and device. | |
77 | */ | |
78 | struct audit_names { | |
79 | struct list_head list; /* audit_context->names_list */ | |
80 | ||
81 | struct filename *name; | |
82 | int name_len; /* number of chars to log */ | |
79f6530c | 83 | bool hidden; /* don't log this record */ |
b24a30a7 EP |
84 | |
85 | unsigned long ino; | |
86 | dev_t dev; | |
87 | umode_t mode; | |
88 | kuid_t uid; | |
89 | kgid_t gid; | |
90 | dev_t rdev; | |
91 | u32 osid; | |
92 | struct audit_cap_data fcap; | |
93 | unsigned int fcap_ver; | |
94 | unsigned char type; /* record type */ | |
95 | /* | |
96 | * This was an allocated audit_names and not from the array of | |
97 | * names allocated in the task audit context. Thus this name | |
98 | * should be freed on syscall exit. | |
99 | */ | |
100 | bool should_free; | |
101 | }; | |
102 | ||
3f1c8250 WR |
103 | struct audit_proctitle { |
104 | int len; /* length of the cmdline field. */ | |
105 | char *value; /* the cmdline field */ | |
106 | }; | |
107 | ||
b24a30a7 EP |
108 | /* The per-task audit context. */ |
109 | struct audit_context { | |
110 | int dummy; /* must be the first element */ | |
111 | int in_syscall; /* 1 if task is in a syscall */ | |
112 | enum audit_state state, current_state; | |
113 | unsigned int serial; /* serial number for record */ | |
114 | int major; /* syscall number */ | |
115 | struct timespec ctime; /* time of syscall entry */ | |
116 | unsigned long argv[4]; /* syscall arguments */ | |
117 | long return_code;/* syscall return code */ | |
118 | u64 prio; | |
119 | int return_valid; /* return code is valid */ | |
120 | /* | |
121 | * The names_list is the list of all audit_names collected during this | |
122 | * syscall. The first AUDIT_NAMES entries in the names_list will | |
123 | * actually be from the preallocated_names array for performance | |
124 | * reasons. Except during allocation they should never be referenced | |
125 | * through the preallocated_names array and should only be found/used | |
126 | * by running the names_list. | |
127 | */ | |
128 | struct audit_names preallocated_names[AUDIT_NAMES]; | |
129 | int name_count; /* total records in names_list */ | |
130 | struct list_head names_list; /* struct audit_names->list anchor */ | |
131 | char *filterkey; /* key for rule that triggered record */ | |
132 | struct path pwd; | |
133 | struct audit_aux_data *aux; | |
134 | struct audit_aux_data *aux_pids; | |
135 | struct sockaddr_storage *sockaddr; | |
136 | size_t sockaddr_len; | |
137 | /* Save things to print about task_struct */ | |
138 | pid_t pid, ppid; | |
139 | kuid_t uid, euid, suid, fsuid; | |
140 | kgid_t gid, egid, sgid, fsgid; | |
141 | unsigned long personality; | |
142 | int arch; | |
143 | ||
144 | pid_t target_pid; | |
145 | kuid_t target_auid; | |
146 | kuid_t target_uid; | |
147 | unsigned int target_sessionid; | |
148 | u32 target_sid; | |
149 | char target_comm[TASK_COMM_LEN]; | |
150 | ||
151 | struct audit_tree_refs *trees, *first_trees; | |
152 | struct list_head killed_trees; | |
153 | int tree_count; | |
154 | ||
155 | int type; | |
156 | union { | |
157 | struct { | |
158 | int nargs; | |
159 | long args[6]; | |
160 | } socketcall; | |
161 | struct { | |
162 | kuid_t uid; | |
163 | kgid_t gid; | |
164 | umode_t mode; | |
165 | u32 osid; | |
166 | int has_perm; | |
167 | uid_t perm_uid; | |
168 | gid_t perm_gid; | |
169 | umode_t perm_mode; | |
170 | unsigned long qbytes; | |
171 | } ipc; | |
172 | struct { | |
173 | mqd_t mqdes; | |
174 | struct mq_attr mqstat; | |
175 | } mq_getsetattr; | |
176 | struct { | |
177 | mqd_t mqdes; | |
178 | int sigev_signo; | |
179 | } mq_notify; | |
180 | struct { | |
181 | mqd_t mqdes; | |
182 | size_t msg_len; | |
183 | unsigned int msg_prio; | |
184 | struct timespec abs_timeout; | |
185 | } mq_sendrecv; | |
186 | struct { | |
187 | int oflag; | |
188 | umode_t mode; | |
189 | struct mq_attr attr; | |
190 | } mq_open; | |
191 | struct { | |
192 | pid_t pid; | |
193 | struct audit_cap_data cap; | |
194 | } capset; | |
195 | struct { | |
196 | int fd; | |
197 | int flags; | |
198 | } mmap; | |
d9cfea91 RGB |
199 | struct { |
200 | int argc; | |
d9cfea91 | 201 | } execve; |
b24a30a7 EP |
202 | }; |
203 | int fds[2]; | |
3f1c8250 | 204 | struct audit_proctitle proctitle; |
b24a30a7 EP |
205 | }; |
206 | ||
3e1d0bb6 | 207 | extern u32 audit_ever_enabled; |
c782f242 | 208 | |
b24a30a7 EP |
209 | extern void audit_copy_inode(struct audit_names *name, |
210 | const struct dentry *dentry, | |
d6335d77 | 211 | struct inode *inode); |
b24a30a7 EP |
212 | extern void audit_log_cap(struct audit_buffer *ab, char *prefix, |
213 | kernel_cap_t *cap); | |
b24a30a7 EP |
214 | extern void audit_log_name(struct audit_context *context, |
215 | struct audit_names *n, struct path *path, | |
216 | int record_num, int *call_panic); | |
c782f242 | 217 | |
fe7752ba | 218 | extern int audit_pid; |
fe7752ba | 219 | |
f368c07d AG |
220 | #define AUDIT_INODE_BUCKETS 32 |
221 | extern struct list_head audit_inode_hash[AUDIT_INODE_BUCKETS]; | |
222 | ||
223 | static inline int audit_hash_ino(u32 ino) | |
224 | { | |
225 | return (ino & (AUDIT_INODE_BUCKETS-1)); | |
226 | } | |
227 | ||
e3d6b07b JL |
228 | /* Indicates that audit should log the full pathname. */ |
229 | #define AUDIT_NAME_FULL -1 | |
230 | ||
55669bfa | 231 | extern int audit_match_class(int class, unsigned syscall); |
f368c07d | 232 | extern int audit_comparator(const u32 left, const u32 op, const u32 right); |
ca57ec0f EB |
233 | extern int audit_uid_comparator(kuid_t left, u32 op, kuid_t right); |
234 | extern int audit_gid_comparator(kgid_t left, u32 op, kgid_t right); | |
bfcec708 | 235 | extern int parent_len(const char *path); |
e3d6b07b | 236 | extern int audit_compare_dname_path(const char *dname, const char *path, int plen); |
f9441639 RGB |
237 | extern struct sk_buff *audit_make_reply(__u32 portid, int seq, int type, |
238 | int done, int multi, | |
239 | const void *payload, int size); | |
fe7752ba | 240 | extern void audit_panic(const char *message); |
3dc7e315 | 241 | |
9044e6bc | 242 | struct audit_netlink_list { |
f9441639 | 243 | __u32 portid; |
638a0fd2 | 244 | struct net *net; |
9044e6bc AV |
245 | struct sk_buff_head q; |
246 | }; | |
247 | ||
248 | int audit_send_list(void *); | |
249 | ||
33faba7f RGB |
250 | struct audit_net { |
251 | struct sock *nlsk; | |
252 | }; | |
253 | ||
3dc7e315 | 254 | extern int selinux_audit_rule_update(void); |
e1396065 | 255 | |
74c3cbe3 | 256 | extern struct mutex audit_filter_mutex; |
7f492942 | 257 | extern int audit_del_rule(struct audit_entry *); |
74c3cbe3 | 258 | extern void audit_free_rule_rcu(struct rcu_head *); |
c782f242 | 259 | extern struct list_head audit_filter_list[]; |
74c3cbe3 | 260 | |
939a67fc EP |
261 | extern struct audit_entry *audit_dupe_rule(struct audit_krule *old); |
262 | ||
4766b199 DB |
263 | extern void audit_log_d_path_exe(struct audit_buffer *ab, |
264 | struct mm_struct *mm); | |
265 | ||
3f5be2da RGB |
266 | extern struct tty_struct *audit_get_tty(struct task_struct *tsk); |
267 | extern void audit_put_tty(struct tty_struct *tty); | |
268 | ||
cfcad62c | 269 | /* audit watch functions */ |
939a67fc | 270 | #ifdef CONFIG_AUDIT_WATCH |
cfcad62c EP |
271 | extern void audit_put_watch(struct audit_watch *watch); |
272 | extern void audit_get_watch(struct audit_watch *watch); | |
273 | extern int audit_to_watch(struct audit_krule *krule, char *path, int len, u32 op); | |
ae7b8f41 | 274 | extern int audit_add_watch(struct audit_krule *krule, struct list_head **list); |
a05fb6cc | 275 | extern void audit_remove_watch_rule(struct audit_krule *krule); |
cfcad62c | 276 | extern char *audit_watch_path(struct audit_watch *watch); |
ae7b8f41 | 277 | extern int audit_watch_compare(struct audit_watch *watch, unsigned long ino, dev_t dev); |
7f492942 RGB |
278 | |
279 | extern struct audit_fsnotify_mark *audit_alloc_mark(struct audit_krule *krule, char *pathname, int len); | |
280 | extern char *audit_mark_path(struct audit_fsnotify_mark *mark); | |
281 | extern void audit_remove_mark(struct audit_fsnotify_mark *audit_mark); | |
282 | extern void audit_remove_mark_rule(struct audit_krule *krule); | |
283 | extern int audit_mark_compare(struct audit_fsnotify_mark *mark, unsigned long ino, dev_t dev); | |
34d99af5 RGB |
284 | extern int audit_dupe_exe(struct audit_krule *new, struct audit_krule *old); |
285 | extern int audit_exe_compare(struct task_struct *tsk, struct audit_fsnotify_mark *mark); | |
7f492942 | 286 | |
939a67fc EP |
287 | #else |
288 | #define audit_put_watch(w) {} | |
289 | #define audit_get_watch(w) {} | |
290 | #define audit_to_watch(k, p, l, o) (-EINVAL) | |
291 | #define audit_add_watch(k, l) (-EINVAL) | |
292 | #define audit_remove_watch_rule(k) BUG() | |
293 | #define audit_watch_path(w) "" | |
294 | #define audit_watch_compare(w, i, d) 0 | |
295 | ||
7f492942 RGB |
296 | #define audit_alloc_mark(k, p, l) (ERR_PTR(-EINVAL)) |
297 | #define audit_mark_path(m) "" | |
298 | #define audit_remove_mark(m) | |
299 | #define audit_remove_mark_rule(k) | |
300 | #define audit_mark_compare(m, i, d) 0 | |
34d99af5 RGB |
301 | #define audit_exe_compare(t, m) (-EINVAL) |
302 | #define audit_dupe_exe(n, o) (-EINVAL) | |
939a67fc | 303 | #endif /* CONFIG_AUDIT_WATCH */ |
cfcad62c | 304 | |
74c3cbe3 AV |
305 | #ifdef CONFIG_AUDIT_TREE |
306 | extern struct audit_chunk *audit_tree_lookup(const struct inode *); | |
307 | extern void audit_put_chunk(struct audit_chunk *); | |
6f1b5d7a | 308 | extern bool audit_tree_match(struct audit_chunk *, struct audit_tree *); |
74c3cbe3 AV |
309 | extern int audit_make_tree(struct audit_krule *, char *, u32); |
310 | extern int audit_add_tree_rule(struct audit_krule *); | |
311 | extern int audit_remove_tree_rule(struct audit_krule *); | |
312 | extern void audit_trim_trees(void); | |
313 | extern int audit_tag_tree(char *old, char *new); | |
74c3cbe3 AV |
314 | extern const char *audit_tree_path(struct audit_tree *); |
315 | extern void audit_put_tree(struct audit_tree *); | |
916d7576 | 316 | extern void audit_kill_trees(struct list_head *); |
74c3cbe3 AV |
317 | #else |
318 | #define audit_remove_tree_rule(rule) BUG() | |
319 | #define audit_add_tree_rule(rule) -EINVAL | |
320 | #define audit_make_tree(rule, str, op) -EINVAL | |
321 | #define audit_trim_trees() (void)0 | |
322 | #define audit_put_tree(tree) (void)0 | |
323 | #define audit_tag_tree(old, new) -EINVAL | |
324 | #define audit_tree_path(rule) "" /* never called */ | |
916d7576 | 325 | #define audit_kill_trees(list) BUG() |
74c3cbe3 AV |
326 | #endif |
327 | ||
328 | extern char *audit_unpack_string(void **, size_t *, size_t); | |
329 | ||
c782f242 | 330 | extern pid_t audit_sig_pid; |
cca080d9 | 331 | extern kuid_t audit_sig_uid; |
c782f242 HH |
332 | extern u32 audit_sig_sid; |
333 | ||
86b2efbe RGB |
334 | extern int audit_filter(int msgtype, unsigned int listtype); |
335 | ||
e1396065 | 336 | #ifdef CONFIG_AUDITSYSCALL |
e54dc243 AG |
337 | extern int __audit_signal_info(int sig, struct task_struct *t); |
338 | static inline int audit_signal_info(int sig, struct task_struct *t) | |
e1396065 | 339 | { |
e54dc243 AG |
340 | if (unlikely((audit_pid && t->tgid == audit_pid) || |
341 | (audit_signals && !audit_dummy_context()))) | |
342 | return __audit_signal_info(sig, t); | |
343 | return 0; | |
e1396065 | 344 | } |
0590b933 | 345 | extern void audit_filter_inodes(struct task_struct *, struct audit_context *); |
916d7576 | 346 | extern struct list_head *audit_killed_trees(void); |
e1396065 | 347 | #else |
e54dc243 | 348 | #define audit_signal_info(s,t) AUDIT_DISABLED |
f368c07d | 349 | #define audit_filter_inodes(t,c) AUDIT_DISABLED |
e1396065 | 350 | #endif |
916d7576 AV |
351 | |
352 | extern struct mutex audit_cmd_mutex; |