]>
Commit | Line | Data |
---|---|---|
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> | |
24 | #include <linux/skbuff.h> | |
25 | #include <uapi/linux/mqueue.h> | |
26 | #include <linux/tty.h> | |
27 | ||
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 | ||
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. */ | |
40 | AUDIT_BUILD_CONTEXT, /* Create the per-task audit_context, | |
41 | * and fill it in at syscall | |
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 */ | |
53 | struct audit_watch; | |
54 | struct audit_fsnotify_mark; | |
55 | struct audit_tree; | |
56 | struct audit_chunk; | |
57 | ||
58 | struct audit_entry { | |
59 | struct list_head list; | |
60 | struct rcu_head rcu; | |
61 | struct audit_krule rule; | |
62 | }; | |
63 | ||
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 | ||
73 | /* When fs/namei.c:getname() is called, we store the pointer in name and bump | |
74 | * the refcnt in the associated filename struct. | |
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 */ | |
83 | bool hidden; /* don't log this record */ | |
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 | ||
103 | struct audit_proctitle { | |
104 | int len; /* length of the cmdline field. */ | |
105 | char *value; /* the cmdline field */ | |
106 | }; | |
107 | ||
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; | |
199 | struct { | |
200 | int argc; | |
201 | } execve; | |
202 | struct { | |
203 | char *name; | |
204 | } module; | |
205 | }; | |
206 | int fds[2]; | |
207 | struct audit_proctitle proctitle; | |
208 | }; | |
209 | ||
210 | extern u32 audit_ever_enabled; | |
211 | ||
212 | extern void audit_copy_inode(struct audit_names *name, | |
213 | const struct dentry *dentry, | |
214 | struct inode *inode); | |
215 | extern void audit_log_cap(struct audit_buffer *ab, char *prefix, | |
216 | kernel_cap_t *cap); | |
217 | extern void audit_log_name(struct audit_context *context, | |
218 | struct audit_names *n, const struct path *path, | |
219 | int record_num, int *call_panic); | |
220 | ||
221 | extern int audit_pid; | |
222 | ||
223 | #define AUDIT_INODE_BUCKETS 32 | |
224 | extern struct list_head audit_inode_hash[AUDIT_INODE_BUCKETS]; | |
225 | ||
226 | static inline int audit_hash_ino(u32 ino) | |
227 | { | |
228 | return (ino & (AUDIT_INODE_BUCKETS-1)); | |
229 | } | |
230 | ||
231 | /* Indicates that audit should log the full pathname. */ | |
232 | #define AUDIT_NAME_FULL -1 | |
233 | ||
234 | extern int audit_match_class(int class, unsigned syscall); | |
235 | extern int audit_comparator(const u32 left, const u32 op, const u32 right); | |
236 | extern int audit_uid_comparator(kuid_t left, u32 op, kuid_t right); | |
237 | extern int audit_gid_comparator(kgid_t left, u32 op, kgid_t right); | |
238 | extern int parent_len(const char *path); | |
239 | extern int audit_compare_dname_path(const char *dname, const char *path, int plen); | |
240 | extern struct sk_buff *audit_make_reply(__u32 portid, int seq, int type, | |
241 | int done, int multi, | |
242 | const void *payload, int size); | |
243 | extern void audit_panic(const char *message); | |
244 | ||
245 | struct audit_netlink_list { | |
246 | __u32 portid; | |
247 | struct net *net; | |
248 | struct sk_buff_head q; | |
249 | }; | |
250 | ||
251 | int audit_send_list(void *); | |
252 | ||
253 | struct audit_net { | |
254 | struct sock *nlsk; | |
255 | }; | |
256 | ||
257 | extern int selinux_audit_rule_update(void); | |
258 | ||
259 | extern struct mutex audit_filter_mutex; | |
260 | extern int audit_del_rule(struct audit_entry *); | |
261 | extern void audit_free_rule_rcu(struct rcu_head *); | |
262 | extern struct list_head audit_filter_list[]; | |
263 | ||
264 | extern struct audit_entry *audit_dupe_rule(struct audit_krule *old); | |
265 | ||
266 | extern void audit_log_d_path_exe(struct audit_buffer *ab, | |
267 | struct mm_struct *mm); | |
268 | ||
269 | extern struct tty_struct *audit_get_tty(struct task_struct *tsk); | |
270 | extern void audit_put_tty(struct tty_struct *tty); | |
271 | ||
272 | /* audit watch functions */ | |
273 | #ifdef CONFIG_AUDIT_WATCH | |
274 | extern void audit_put_watch(struct audit_watch *watch); | |
275 | extern void audit_get_watch(struct audit_watch *watch); | |
276 | extern int audit_to_watch(struct audit_krule *krule, char *path, int len, u32 op); | |
277 | extern int audit_add_watch(struct audit_krule *krule, struct list_head **list); | |
278 | extern void audit_remove_watch_rule(struct audit_krule *krule); | |
279 | extern char *audit_watch_path(struct audit_watch *watch); | |
280 | extern int audit_watch_compare(struct audit_watch *watch, unsigned long ino, dev_t dev); | |
281 | ||
282 | extern struct audit_fsnotify_mark *audit_alloc_mark(struct audit_krule *krule, char *pathname, int len); | |
283 | extern char *audit_mark_path(struct audit_fsnotify_mark *mark); | |
284 | extern void audit_remove_mark(struct audit_fsnotify_mark *audit_mark); | |
285 | extern void audit_remove_mark_rule(struct audit_krule *krule); | |
286 | extern int audit_mark_compare(struct audit_fsnotify_mark *mark, unsigned long ino, dev_t dev); | |
287 | extern int audit_dupe_exe(struct audit_krule *new, struct audit_krule *old); | |
288 | extern int audit_exe_compare(struct task_struct *tsk, struct audit_fsnotify_mark *mark); | |
289 | ||
290 | #else | |
291 | #define audit_put_watch(w) {} | |
292 | #define audit_get_watch(w) {} | |
293 | #define audit_to_watch(k, p, l, o) (-EINVAL) | |
294 | #define audit_add_watch(k, l) (-EINVAL) | |
295 | #define audit_remove_watch_rule(k) BUG() | |
296 | #define audit_watch_path(w) "" | |
297 | #define audit_watch_compare(w, i, d) 0 | |
298 | ||
299 | #define audit_alloc_mark(k, p, l) (ERR_PTR(-EINVAL)) | |
300 | #define audit_mark_path(m) "" | |
301 | #define audit_remove_mark(m) | |
302 | #define audit_remove_mark_rule(k) | |
303 | #define audit_mark_compare(m, i, d) 0 | |
304 | #define audit_exe_compare(t, m) (-EINVAL) | |
305 | #define audit_dupe_exe(n, o) (-EINVAL) | |
306 | #endif /* CONFIG_AUDIT_WATCH */ | |
307 | ||
308 | #ifdef CONFIG_AUDIT_TREE | |
309 | extern struct audit_chunk *audit_tree_lookup(const struct inode *); | |
310 | extern void audit_put_chunk(struct audit_chunk *); | |
311 | extern bool audit_tree_match(struct audit_chunk *, struct audit_tree *); | |
312 | extern int audit_make_tree(struct audit_krule *, char *, u32); | |
313 | extern int audit_add_tree_rule(struct audit_krule *); | |
314 | extern int audit_remove_tree_rule(struct audit_krule *); | |
315 | extern void audit_trim_trees(void); | |
316 | extern int audit_tag_tree(char *old, char *new); | |
317 | extern const char *audit_tree_path(struct audit_tree *); | |
318 | extern void audit_put_tree(struct audit_tree *); | |
319 | extern void audit_kill_trees(struct list_head *); | |
320 | #else | |
321 | #define audit_remove_tree_rule(rule) BUG() | |
322 | #define audit_add_tree_rule(rule) -EINVAL | |
323 | #define audit_make_tree(rule, str, op) -EINVAL | |
324 | #define audit_trim_trees() (void)0 | |
325 | #define audit_put_tree(tree) (void)0 | |
326 | #define audit_tag_tree(old, new) -EINVAL | |
327 | #define audit_tree_path(rule) "" /* never called */ | |
328 | #define audit_kill_trees(list) BUG() | |
329 | #endif | |
330 | ||
331 | extern char *audit_unpack_string(void **, size_t *, size_t); | |
332 | ||
333 | extern pid_t audit_sig_pid; | |
334 | extern kuid_t audit_sig_uid; | |
335 | extern u32 audit_sig_sid; | |
336 | ||
337 | extern int audit_filter(int msgtype, unsigned int listtype); | |
338 | ||
339 | #ifdef CONFIG_AUDITSYSCALL | |
340 | extern int __audit_signal_info(int sig, struct task_struct *t); | |
341 | static inline int audit_signal_info(int sig, struct task_struct *t) | |
342 | { | |
343 | if (unlikely((audit_pid && t->tgid == audit_pid) || | |
344 | (audit_signals && !audit_dummy_context()))) | |
345 | return __audit_signal_info(sig, t); | |
346 | return 0; | |
347 | } | |
348 | extern void audit_filter_inodes(struct task_struct *, struct audit_context *); | |
349 | extern struct list_head *audit_killed_trees(void); | |
350 | #else | |
351 | #define audit_signal_info(s,t) AUDIT_DISABLED | |
352 | #define audit_filter_inodes(t,c) AUDIT_DISABLED | |
353 | #endif | |
354 | ||
355 | extern struct mutex audit_cmd_mutex; |