blob: 565743db5384c3a68b041dad31c25b09e00ea4c5 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/kernel/seccomp.c
3 *
4 * Copyright 2004-2005 Andrea Arcangeli <andrea@cpushare.com>
5 *
Will Drewrye2cfabdf2012-04-12 16:47:57 -05006 * Copyright (C) 2012 Google, Inc.
7 * Will Drewry <wad@chromium.org>
8 *
9 * This defines a simple but solid secure-computing facility.
10 *
11 * Mode 1 uses a fixed list of allowed system calls.
12 * Mode 2 allows user-defined system call filters in the form
13 * of Berkeley Packet Filters/Linux Socket Filters.
Linus Torvalds1da177e2005-04-16 15:20:36 -070014 */
15
Will Drewrye2cfabdf2012-04-12 16:47:57 -050016#include <linux/atomic.h>
Eric Paris85e7bac32012-01-03 14:23:05 -050017#include <linux/audit.h>
Roland McGrath5b101742009-02-27 23:25:54 -080018#include <linux/compat.h>
Will Drewrye2cfabdf2012-04-12 16:47:57 -050019#include <linux/sched.h>
20#include <linux/seccomp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021
22/* #define SECCOMP_DEBUG 1 */
Will Drewrye2cfabdf2012-04-12 16:47:57 -050023
24#ifdef CONFIG_SECCOMP_FILTER
25#include <asm/syscall.h>
26#include <linux/filter.h>
Will Drewryfb0fadf2012-04-12 16:48:02 -050027#include <linux/ptrace.h>
Will Drewrye2cfabdf2012-04-12 16:47:57 -050028#include <linux/security.h>
29#include <linux/slab.h>
30#include <linux/tracehook.h>
31#include <linux/uaccess.h>
32
33/**
34 * struct seccomp_filter - container for seccomp BPF programs
35 *
36 * @usage: reference count to manage the object lifetime.
37 * get/put helpers should be used when accessing an instance
38 * outside of a lifetime-guarded section. In general, this
39 * is only needed for handling filters shared across tasks.
40 * @prev: points to a previously installed, or inherited, filter
41 * @len: the number of instructions in the program
Fabian Frederick119ce5c2014-06-06 14:37:53 -070042 * @insnsi: the BPF program instructions to evaluate
Will Drewrye2cfabdf2012-04-12 16:47:57 -050043 *
44 * seccomp_filter objects are organized in a tree linked via the @prev
45 * pointer. For any task, it appears to be a singly-linked list starting
46 * with current->seccomp.filter, the most recently attached or inherited filter.
47 * However, multiple filters may share a @prev node, by way of fork(), which
48 * results in a unidirectional tree existing in memory. This is similar to
49 * how namespaces work.
50 *
51 * seccomp_filter objects should never be modified after being attached
52 * to a task_struct (other than @usage).
53 */
54struct seccomp_filter {
55 atomic_t usage;
56 struct seccomp_filter *prev;
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -070057 struct sk_filter *prog;
Will Drewrye2cfabdf2012-04-12 16:47:57 -050058};
59
60/* Limit any path through the tree to 256KB worth of instructions. */
61#define MAX_INSNS_PER_PATH ((1 << 18) / sizeof(struct sock_filter))
62
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +010063/*
Will Drewrye2cfabdf2012-04-12 16:47:57 -050064 * Endianness is explicitly ignored and left for BPF program authors to manage
65 * as per the specific architecture.
66 */
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +010067static void populate_seccomp_data(struct seccomp_data *sd)
Will Drewrye2cfabdf2012-04-12 16:47:57 -050068{
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +010069 struct task_struct *task = current;
70 struct pt_regs *regs = task_pt_regs(task);
Daniel Borkmann2eac7642014-04-14 21:02:59 +020071 unsigned long args[6];
Will Drewrye2cfabdf2012-04-12 16:47:57 -050072
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +010073 sd->nr = syscall_get_nr(task, regs);
Linus Torvalds0b747172014-04-12 12:38:53 -070074 sd->arch = syscall_get_arch();
Daniel Borkmann2eac7642014-04-14 21:02:59 +020075 syscall_get_arguments(task, regs, 0, 6, args);
76 sd->args[0] = args[0];
77 sd->args[1] = args[1];
78 sd->args[2] = args[2];
79 sd->args[3] = args[3];
80 sd->args[4] = args[4];
81 sd->args[5] = args[5];
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +010082 sd->instruction_pointer = KSTK_EIP(task);
Will Drewrye2cfabdf2012-04-12 16:47:57 -050083}
84
85/**
86 * seccomp_check_filter - verify seccomp filter code
87 * @filter: filter to verify
88 * @flen: length of filter
89 *
90 * Takes a previously checked filter (by sk_chk_filter) and
91 * redirects all filter code that loads struct sk_buff data
92 * and related data through seccomp_bpf_load. It also
93 * enforces length and alignment checking of those loads.
94 *
95 * Returns 0 if the rule set is legal or -EINVAL if not.
96 */
97static int seccomp_check_filter(struct sock_filter *filter, unsigned int flen)
98{
99 int pc;
100 for (pc = 0; pc < flen; pc++) {
101 struct sock_filter *ftest = &filter[pc];
102 u16 code = ftest->code;
103 u32 k = ftest->k;
104
105 switch (code) {
Daniel Borkmann34805932014-05-29 10:22:50 +0200106 case BPF_LD | BPF_W | BPF_ABS:
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100107 ftest->code = BPF_LDX | BPF_W | BPF_ABS;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500108 /* 32-bit aligned and not out of bounds. */
109 if (k >= sizeof(struct seccomp_data) || k & 3)
110 return -EINVAL;
111 continue;
Daniel Borkmann34805932014-05-29 10:22:50 +0200112 case BPF_LD | BPF_W | BPF_LEN:
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100113 ftest->code = BPF_LD | BPF_IMM;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500114 ftest->k = sizeof(struct seccomp_data);
115 continue;
Daniel Borkmann34805932014-05-29 10:22:50 +0200116 case BPF_LDX | BPF_W | BPF_LEN:
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100117 ftest->code = BPF_LDX | BPF_IMM;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500118 ftest->k = sizeof(struct seccomp_data);
119 continue;
120 /* Explicitly include allowed calls. */
Daniel Borkmann34805932014-05-29 10:22:50 +0200121 case BPF_RET | BPF_K:
122 case BPF_RET | BPF_A:
123 case BPF_ALU | BPF_ADD | BPF_K:
124 case BPF_ALU | BPF_ADD | BPF_X:
125 case BPF_ALU | BPF_SUB | BPF_K:
126 case BPF_ALU | BPF_SUB | BPF_X:
127 case BPF_ALU | BPF_MUL | BPF_K:
128 case BPF_ALU | BPF_MUL | BPF_X:
129 case BPF_ALU | BPF_DIV | BPF_K:
130 case BPF_ALU | BPF_DIV | BPF_X:
131 case BPF_ALU | BPF_AND | BPF_K:
132 case BPF_ALU | BPF_AND | BPF_X:
133 case BPF_ALU | BPF_OR | BPF_K:
134 case BPF_ALU | BPF_OR | BPF_X:
135 case BPF_ALU | BPF_XOR | BPF_K:
136 case BPF_ALU | BPF_XOR | BPF_X:
137 case BPF_ALU | BPF_LSH | BPF_K:
138 case BPF_ALU | BPF_LSH | BPF_X:
139 case BPF_ALU | BPF_RSH | BPF_K:
140 case BPF_ALU | BPF_RSH | BPF_X:
141 case BPF_ALU | BPF_NEG:
142 case BPF_LD | BPF_IMM:
143 case BPF_LDX | BPF_IMM:
144 case BPF_MISC | BPF_TAX:
145 case BPF_MISC | BPF_TXA:
146 case BPF_LD | BPF_MEM:
147 case BPF_LDX | BPF_MEM:
148 case BPF_ST:
149 case BPF_STX:
150 case BPF_JMP | BPF_JA:
151 case BPF_JMP | BPF_JEQ | BPF_K:
152 case BPF_JMP | BPF_JEQ | BPF_X:
153 case BPF_JMP | BPF_JGE | BPF_K:
154 case BPF_JMP | BPF_JGE | BPF_X:
155 case BPF_JMP | BPF_JGT | BPF_K:
156 case BPF_JMP | BPF_JGT | BPF_X:
157 case BPF_JMP | BPF_JSET | BPF_K:
158 case BPF_JMP | BPF_JSET | BPF_X:
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500159 continue;
160 default:
161 return -EINVAL;
162 }
163 }
164 return 0;
165}
166
167/**
168 * seccomp_run_filters - evaluates all seccomp filters against @syscall
169 * @syscall: number of the current system call
170 *
171 * Returns valid seccomp BPF response codes.
172 */
173static u32 seccomp_run_filters(int syscall)
174{
175 struct seccomp_filter *f;
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100176 struct seccomp_data sd;
Will Drewryacf3b2c2012-04-12 16:47:59 -0500177 u32 ret = SECCOMP_RET_ALLOW;
178
179 /* Ensure unexpected behavior doesn't result in failing open. */
180 if (WARN_ON(current->seccomp.filter == NULL))
181 return SECCOMP_RET_KILL;
182
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100183 populate_seccomp_data(&sd);
184
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500185 /*
186 * All filters in the list are evaluated and the lowest BPF return
Will Drewryacf3b2c2012-04-12 16:47:59 -0500187 * value always takes priority (ignoring the DATA).
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500188 */
189 for (f = current->seccomp.filter; f; f = f->prev) {
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700190 u32 cur_ret = SK_RUN_FILTER(f->prog, (void *)&sd);
191
Will Drewryacf3b2c2012-04-12 16:47:59 -0500192 if ((cur_ret & SECCOMP_RET_ACTION) < (ret & SECCOMP_RET_ACTION))
193 ret = cur_ret;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500194 }
195 return ret;
196}
197
198/**
199 * seccomp_attach_filter: Attaches a seccomp filter to current.
200 * @fprog: BPF program to install
201 *
202 * Returns 0 on success or an errno on failure.
203 */
204static long seccomp_attach_filter(struct sock_fprog *fprog)
205{
206 struct seccomp_filter *filter;
207 unsigned long fp_size = fprog->len * sizeof(struct sock_filter);
208 unsigned long total_insns = fprog->len;
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100209 struct sock_filter *fp;
210 int new_len;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500211 long ret;
212
213 if (fprog->len == 0 || fprog->len > BPF_MAXINSNS)
214 return -EINVAL;
215
216 for (filter = current->seccomp.filter; filter; filter = filter->prev)
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700217 total_insns += filter->prog->len + 4; /* include a 4 instr penalty */
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500218 if (total_insns > MAX_INSNS_PER_PATH)
219 return -ENOMEM;
220
221 /*
Fabian Frederick119ce5c2014-06-06 14:37:53 -0700222 * Installing a seccomp filter requires that the task has
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500223 * CAP_SYS_ADMIN in its namespace or be running with no_new_privs.
224 * This avoids scenarios where unprivileged tasks can affect the
225 * behavior of privileged children.
226 */
227 if (!current->no_new_privs &&
228 security_capable_noaudit(current_cred(), current_user_ns(),
229 CAP_SYS_ADMIN) != 0)
230 return -EACCES;
231
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100232 fp = kzalloc(fp_size, GFP_KERNEL|__GFP_NOWARN);
233 if (!fp)
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500234 return -ENOMEM;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500235
236 /* Copy the instructions from fprog. */
237 ret = -EFAULT;
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100238 if (copy_from_user(fp, fprog->filter, fp_size))
239 goto free_prog;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500240
241 /* Check and rewrite the fprog via the skb checker */
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100242 ret = sk_chk_filter(fp, fprog->len);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500243 if (ret)
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100244 goto free_prog;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500245
246 /* Check and rewrite the fprog for seccomp use */
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100247 ret = seccomp_check_filter(fp, fprog->len);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500248 if (ret)
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100249 goto free_prog;
250
Alexei Starovoitov2695fb52014-07-24 16:38:21 -0700251 /* Convert 'sock_filter' insns to 'bpf_insn' insns */
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100252 ret = sk_convert_filter(fp, fprog->len, NULL, &new_len);
253 if (ret)
254 goto free_prog;
255
256 /* Allocate a new seccomp_filter */
Kees Cook0acf07d2014-04-16 10:54:34 -0700257 ret = -ENOMEM;
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700258 filter = kzalloc(sizeof(struct seccomp_filter),
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100259 GFP_KERNEL|__GFP_NOWARN);
260 if (!filter)
261 goto free_prog;
262
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700263 filter->prog = kzalloc(sk_filter_size(new_len),
264 GFP_KERNEL|__GFP_NOWARN);
265 if (!filter->prog)
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100266 goto free_filter;
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700267
268 ret = sk_convert_filter(fp, fprog->len, filter->prog->insnsi, &new_len);
269 if (ret)
270 goto free_filter_prog;
Kees Cook0acf07d2014-04-16 10:54:34 -0700271 kfree(fp);
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100272
273 atomic_set(&filter->usage, 1);
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700274 filter->prog->len = new_len;
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700275
Alexei Starovoitov5fe821a2014-05-19 14:56:14 -0700276 sk_filter_select_runtime(filter->prog);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500277
278 /*
279 * If there is an existing filter, make it the prev and don't drop its
280 * task reference.
281 */
282 filter->prev = current->seccomp.filter;
283 current->seccomp.filter = filter;
284 return 0;
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100285
Alexei Starovoitov8f577ca2014-05-13 19:50:47 -0700286free_filter_prog:
287 kfree(filter->prog);
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100288free_filter:
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500289 kfree(filter);
Alexei Starovoitovbd4cf0e2014-03-28 18:58:25 +0100290free_prog:
291 kfree(fp);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500292 return ret;
293}
294
295/**
296 * seccomp_attach_user_filter - attaches a user-supplied sock_fprog
297 * @user_filter: pointer to the user data containing a sock_fprog.
298 *
299 * Returns 0 on success and non-zero otherwise.
300 */
Rashika Kheria864f32a2014-02-27 17:50:19 +0530301static long seccomp_attach_user_filter(char __user *user_filter)
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500302{
303 struct sock_fprog fprog;
304 long ret = -EFAULT;
305
306#ifdef CONFIG_COMPAT
307 if (is_compat_task()) {
308 struct compat_sock_fprog fprog32;
309 if (copy_from_user(&fprog32, user_filter, sizeof(fprog32)))
310 goto out;
311 fprog.len = fprog32.len;
312 fprog.filter = compat_ptr(fprog32.filter);
313 } else /* falls through to the if below. */
314#endif
315 if (copy_from_user(&fprog, user_filter, sizeof(fprog)))
316 goto out;
317 ret = seccomp_attach_filter(&fprog);
318out:
319 return ret;
320}
321
322/* get_seccomp_filter - increments the reference count of the filter on @tsk */
323void get_seccomp_filter(struct task_struct *tsk)
324{
325 struct seccomp_filter *orig = tsk->seccomp.filter;
326 if (!orig)
327 return;
328 /* Reference count is bounded by the number of total processes. */
329 atomic_inc(&orig->usage);
330}
331
332/* put_seccomp_filter - decrements the ref count of tsk->seccomp.filter */
333void put_seccomp_filter(struct task_struct *tsk)
334{
335 struct seccomp_filter *orig = tsk->seccomp.filter;
336 /* Clean up single-reference branches iteratively. */
337 while (orig && atomic_dec_and_test(&orig->usage)) {
338 struct seccomp_filter *freeme = orig;
339 orig = orig->prev;
Alexei Starovoitov5fe821a2014-05-19 14:56:14 -0700340 sk_filter_free(freeme->prog);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500341 kfree(freeme);
342 }
343}
Will Drewrybb6ea432012-04-12 16:48:01 -0500344
345/**
346 * seccomp_send_sigsys - signals the task to allow in-process syscall emulation
347 * @syscall: syscall number to send to userland
348 * @reason: filter-supplied reason code to send to userland (via si_errno)
349 *
350 * Forces a SIGSYS with a code of SYS_SECCOMP and related sigsys info.
351 */
352static void seccomp_send_sigsys(int syscall, int reason)
353{
354 struct siginfo info;
355 memset(&info, 0, sizeof(info));
356 info.si_signo = SIGSYS;
357 info.si_code = SYS_SECCOMP;
358 info.si_call_addr = (void __user *)KSTK_EIP(current);
359 info.si_errno = reason;
Eric Paris5e937a92014-03-11 12:48:43 -0400360 info.si_arch = syscall_get_arch();
Will Drewrybb6ea432012-04-12 16:48:01 -0500361 info.si_syscall = syscall;
362 force_sig_info(SIGSYS, &info, current);
363}
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500364#endif /* CONFIG_SECCOMP_FILTER */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
366/*
367 * Secure computing mode 1 allows only read/write/exit/sigreturn.
368 * To be fully secure this must be combined with rlimit
369 * to limit the stack allocations too.
370 */
371static int mode1_syscalls[] = {
372 __NR_seccomp_read, __NR_seccomp_write, __NR_seccomp_exit, __NR_seccomp_sigreturn,
373 0, /* null terminated */
374};
375
Roland McGrath5b101742009-02-27 23:25:54 -0800376#ifdef CONFIG_COMPAT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377static int mode1_syscalls_32[] = {
378 __NR_seccomp_read_32, __NR_seccomp_write_32, __NR_seccomp_exit_32, __NR_seccomp_sigreturn_32,
379 0, /* null terminated */
380};
381#endif
382
Will Drewryacf3b2c2012-04-12 16:47:59 -0500383int __secure_computing(int this_syscall)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384{
385 int mode = current->seccomp.mode;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500386 int exit_sig = 0;
387 int *syscall;
Will Drewry8156b452012-04-17 14:48:58 -0500388 u32 ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389
390 switch (mode) {
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500391 case SECCOMP_MODE_STRICT:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392 syscall = mode1_syscalls;
Roland McGrath5b101742009-02-27 23:25:54 -0800393#ifdef CONFIG_COMPAT
394 if (is_compat_task())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395 syscall = mode1_syscalls_32;
396#endif
397 do {
398 if (*syscall == this_syscall)
Will Drewryacf3b2c2012-04-12 16:47:59 -0500399 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 } while (*++syscall);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500401 exit_sig = SIGKILL;
Will Drewry8156b452012-04-17 14:48:58 -0500402 ret = SECCOMP_RET_KILL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403 break;
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500404#ifdef CONFIG_SECCOMP_FILTER
Will Drewry8156b452012-04-17 14:48:58 -0500405 case SECCOMP_MODE_FILTER: {
406 int data;
Andy Lutomirski87b526d2012-10-01 11:40:45 -0700407 struct pt_regs *regs = task_pt_regs(current);
Will Drewryacf3b2c2012-04-12 16:47:59 -0500408 ret = seccomp_run_filters(this_syscall);
409 data = ret & SECCOMP_RET_DATA;
Will Drewry8156b452012-04-17 14:48:58 -0500410 ret &= SECCOMP_RET_ACTION;
411 switch (ret) {
Will Drewryacf3b2c2012-04-12 16:47:59 -0500412 case SECCOMP_RET_ERRNO:
413 /* Set the low-order 16-bits as a errno. */
Andy Lutomirski87b526d2012-10-01 11:40:45 -0700414 syscall_set_return_value(current, regs,
Will Drewryacf3b2c2012-04-12 16:47:59 -0500415 -data, 0);
416 goto skip;
Will Drewrybb6ea432012-04-12 16:48:01 -0500417 case SECCOMP_RET_TRAP:
418 /* Show the handler the original registers. */
Andy Lutomirski87b526d2012-10-01 11:40:45 -0700419 syscall_rollback(current, regs);
Will Drewrybb6ea432012-04-12 16:48:01 -0500420 /* Let the filter pass back 16 bits of data. */
421 seccomp_send_sigsys(this_syscall, data);
422 goto skip;
Will Drewryfb0fadf2012-04-12 16:48:02 -0500423 case SECCOMP_RET_TRACE:
424 /* Skip these calls if there is no tracer. */
Andy Lutomirski87b526d2012-10-01 11:40:45 -0700425 if (!ptrace_event_enabled(current, PTRACE_EVENT_SECCOMP)) {
426 syscall_set_return_value(current, regs,
427 -ENOSYS, 0);
Will Drewryfb0fadf2012-04-12 16:48:02 -0500428 goto skip;
Andy Lutomirski87b526d2012-10-01 11:40:45 -0700429 }
Will Drewryfb0fadf2012-04-12 16:48:02 -0500430 /* Allow the BPF to provide the event message */
431 ptrace_event(PTRACE_EVENT_SECCOMP, data);
432 /*
433 * The delivery of a fatal signal during event
434 * notification may silently skip tracer notification.
435 * Terminating the task now avoids executing a system
436 * call that may not be intended.
437 */
438 if (fatal_signal_pending(current))
439 break;
Andy Lutomirski87b526d2012-10-01 11:40:45 -0700440 if (syscall_get_nr(current, regs) < 0)
441 goto skip; /* Explicit request to skip. */
442
Will Drewryfb0fadf2012-04-12 16:48:02 -0500443 return 0;
Will Drewryacf3b2c2012-04-12 16:47:59 -0500444 case SECCOMP_RET_ALLOW:
445 return 0;
446 case SECCOMP_RET_KILL:
447 default:
448 break;
449 }
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500450 exit_sig = SIGSYS;
451 break;
Will Drewry8156b452012-04-17 14:48:58 -0500452 }
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500453#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 default:
455 BUG();
456 }
457
458#ifdef SECCOMP_DEBUG
459 dump_stack();
460#endif
Will Drewryacf3b2c2012-04-12 16:47:59 -0500461 audit_seccomp(this_syscall, exit_sig, ret);
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500462 do_exit(exit_sig);
Will Drewry8156b452012-04-17 14:48:58 -0500463#ifdef CONFIG_SECCOMP_FILTER
Will Drewryacf3b2c2012-04-12 16:47:59 -0500464skip:
465 audit_seccomp(this_syscall, exit_sig, ret);
Will Drewry8156b452012-04-17 14:48:58 -0500466#endif
Will Drewryacf3b2c2012-04-12 16:47:59 -0500467 return -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468}
Andrea Arcangeli1d9d02f2007-07-15 23:41:32 -0700469
470long prctl_get_seccomp(void)
471{
472 return current->seccomp.mode;
473}
474
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500475/**
476 * prctl_set_seccomp: configures current->seccomp.mode
477 * @seccomp_mode: requested mode to use
478 * @filter: optional struct sock_fprog for use with SECCOMP_MODE_FILTER
479 *
480 * This function may be called repeatedly with a @seccomp_mode of
481 * SECCOMP_MODE_FILTER to install additional filters. Every filter
482 * successfully installed will be evaluated (in reverse order) for each system
483 * call the task makes.
484 *
485 * Once current->seccomp.mode is non-zero, it may not be changed.
486 *
487 * Returns 0 on success or -EINVAL on failure.
488 */
489long prctl_set_seccomp(unsigned long seccomp_mode, char __user *filter)
Andrea Arcangeli1d9d02f2007-07-15 23:41:32 -0700490{
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500491 long ret = -EINVAL;
Andrea Arcangeli1d9d02f2007-07-15 23:41:32 -0700492
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500493 if (current->seccomp.mode &&
494 current->seccomp.mode != seccomp_mode)
Andrea Arcangeli1d9d02f2007-07-15 23:41:32 -0700495 goto out;
496
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500497 switch (seccomp_mode) {
498 case SECCOMP_MODE_STRICT:
499 ret = 0;
Andrea Arcangelicf99aba2007-07-15 23:41:33 -0700500#ifdef TIF_NOTSC
501 disable_TSC();
502#endif
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500503 break;
504#ifdef CONFIG_SECCOMP_FILTER
505 case SECCOMP_MODE_FILTER:
506 ret = seccomp_attach_user_filter(filter);
507 if (ret)
508 goto out;
509 break;
510#endif
511 default:
512 goto out;
Andrea Arcangeli1d9d02f2007-07-15 23:41:32 -0700513 }
514
Will Drewrye2cfabdf2012-04-12 16:47:57 -0500515 current->seccomp.mode = seccomp_mode;
516 set_thread_flag(TIF_SECCOMP);
517out:
Andrea Arcangeli1d9d02f2007-07-15 23:41:32 -0700518 return ret;
519}