aboutsummaryrefslogtreecommitdiffstats
path: root/samples/seccomp
diff options
context:
space:
mode:
authorJonathan Herman <hermanjl@cs.unc.edu>2013-01-17 16:15:55 -0500
committerJonathan Herman <hermanjl@cs.unc.edu>2013-01-17 16:15:55 -0500
commit8dea78da5cee153b8af9c07a2745f6c55057fe12 (patch)
treea8f4d49d63b1ecc92f2fddceba0655b2472c5bd9 /samples/seccomp
parent406089d01562f1e2bf9f089fd7637009ebaad589 (diff)
Patched in Tegra support.
Diffstat (limited to 'samples/seccomp')
-rw-r--r--samples/seccomp/Makefile40
-rw-r--r--samples/seccomp/bpf-direct.c190
-rw-r--r--samples/seccomp/bpf-fancy.c102
-rw-r--r--samples/seccomp/bpf-helper.c89
-rw-r--r--samples/seccomp/bpf-helper.h243
-rw-r--r--samples/seccomp/dropper.c68
6 files changed, 0 insertions, 732 deletions
diff --git a/samples/seccomp/Makefile b/samples/seccomp/Makefile
deleted file mode 100644
index bbbd276659b..00000000000
--- a/samples/seccomp/Makefile
+++ /dev/null
@@ -1,40 +0,0 @@
1# kbuild trick to avoid linker error. Can be omitted if a module is built.
2obj- := dummy.o
3
4hostprogs-$(CONFIG_SECCOMP_FILTER) := bpf-fancy dropper bpf-direct
5
6HOSTCFLAGS_bpf-fancy.o += -I$(objtree)/usr/include
7HOSTCFLAGS_bpf-fancy.o += -idirafter $(objtree)/include
8HOSTCFLAGS_bpf-helper.o += -I$(objtree)/usr/include
9HOSTCFLAGS_bpf-helper.o += -idirafter $(objtree)/include
10bpf-fancy-objs := bpf-fancy.o bpf-helper.o
11
12HOSTCFLAGS_dropper.o += -I$(objtree)/usr/include
13HOSTCFLAGS_dropper.o += -idirafter $(objtree)/include
14dropper-objs := dropper.o
15
16HOSTCFLAGS_bpf-direct.o += -I$(objtree)/usr/include
17HOSTCFLAGS_bpf-direct.o += -idirafter $(objtree)/include
18bpf-direct-objs := bpf-direct.o
19
20# Try to match the kernel target.
21ifndef CONFIG_64BIT
22
23# s390 has -m31 flag to build 31 bit binaries
24ifndef CONFIG_S390
25MFLAG = -m32
26else
27MFLAG = -m31
28endif
29
30HOSTCFLAGS_bpf-direct.o += $(MFLAG)
31HOSTCFLAGS_dropper.o += $(MFLAG)
32HOSTCFLAGS_bpf-helper.o += $(MFLAG)
33HOSTCFLAGS_bpf-fancy.o += $(MFLAG)
34HOSTLOADLIBES_bpf-direct += $(MFLAG)
35HOSTLOADLIBES_bpf-fancy += $(MFLAG)
36HOSTLOADLIBES_dropper += $(MFLAG)
37endif
38
39# Tell kbuild to always build the programs
40always := $(hostprogs-y)
diff --git a/samples/seccomp/bpf-direct.c b/samples/seccomp/bpf-direct.c
deleted file mode 100644
index 151ec3f5218..00000000000
--- a/samples/seccomp/bpf-direct.c
+++ /dev/null
@@ -1,190 +0,0 @@
1/*
2 * Seccomp filter example for x86 (32-bit and 64-bit) with BPF macros
3 *
4 * Copyright (c) 2012 The Chromium OS Authors <chromium-os-dev@chromium.org>
5 * Author: Will Drewry <wad@chromium.org>
6 *
7 * The code may be used by anyone for any purpose,
8 * and can serve as a starting point for developing
9 * applications using prctl(PR_SET_SECCOMP, 2, ...).
10 */
11#if defined(__i386__) || defined(__x86_64__)
12#define SUPPORTED_ARCH 1
13#endif
14
15#if defined(SUPPORTED_ARCH)
16#define __USE_GNU 1
17#define _GNU_SOURCE 1
18
19#include <linux/types.h>
20#include <linux/filter.h>
21#include <linux/seccomp.h>
22#include <linux/unistd.h>
23#include <signal.h>
24#include <stdio.h>
25#include <stddef.h>
26#include <string.h>
27#include <sys/prctl.h>
28#include <unistd.h>
29
30#define syscall_arg(_n) (offsetof(struct seccomp_data, args[_n]))
31#define syscall_nr (offsetof(struct seccomp_data, nr))
32
33#if defined(__i386__)
34#define REG_RESULT REG_EAX
35#define REG_SYSCALL REG_EAX
36#define REG_ARG0 REG_EBX
37#define REG_ARG1 REG_ECX
38#define REG_ARG2 REG_EDX
39#define REG_ARG3 REG_ESI
40#define REG_ARG4 REG_EDI
41#define REG_ARG5 REG_EBP
42#elif defined(__x86_64__)
43#define REG_RESULT REG_RAX
44#define REG_SYSCALL REG_RAX
45#define REG_ARG0 REG_RDI
46#define REG_ARG1 REG_RSI
47#define REG_ARG2 REG_RDX
48#define REG_ARG3 REG_R10
49#define REG_ARG4 REG_R8
50#define REG_ARG5 REG_R9
51#endif
52
53#ifndef PR_SET_NO_NEW_PRIVS
54#define PR_SET_NO_NEW_PRIVS 38
55#endif
56
57#ifndef SYS_SECCOMP
58#define SYS_SECCOMP 1
59#endif
60
61static void emulator(int nr, siginfo_t *info, void *void_context)
62{
63 ucontext_t *ctx = (ucontext_t *)(void_context);
64 int syscall;
65 char *buf;
66 ssize_t bytes;
67 size_t len;
68 if (info->si_code != SYS_SECCOMP)
69 return;
70 if (!ctx)
71 return;
72 syscall = ctx->uc_mcontext.gregs[REG_SYSCALL];
73 buf = (char *) ctx->uc_mcontext.gregs[REG_ARG1];
74 len = (size_t) ctx->uc_mcontext.gregs[REG_ARG2];
75
76 if (syscall != __NR_write)
77 return;
78 if (ctx->uc_mcontext.gregs[REG_ARG0] != STDERR_FILENO)
79 return;
80 /* Redirect stderr messages to stdout. Doesn't handle EINTR, etc */
81 ctx->uc_mcontext.gregs[REG_RESULT] = -1;
82 if (write(STDOUT_FILENO, "[ERR] ", 6) > 0) {
83 bytes = write(STDOUT_FILENO, buf, len);
84 ctx->uc_mcontext.gregs[REG_RESULT] = bytes;
85 }
86 return;
87}
88
89static int install_emulator(void)
90{
91 struct sigaction act;
92 sigset_t mask;
93 memset(&act, 0, sizeof(act));
94 sigemptyset(&mask);
95 sigaddset(&mask, SIGSYS);
96
97 act.sa_sigaction = &emulator;
98 act.sa_flags = SA_SIGINFO;
99 if (sigaction(SIGSYS, &act, NULL) < 0) {
100 perror("sigaction");
101 return -1;
102 }
103 if (sigprocmask(SIG_UNBLOCK, &mask, NULL)) {
104 perror("sigprocmask");
105 return -1;
106 }
107 return 0;
108}
109
110static int install_filter(void)
111{
112 struct sock_filter filter[] = {
113 /* Grab the system call number */
114 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, syscall_nr),
115 /* Jump table for the allowed syscalls */
116 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, __NR_rt_sigreturn, 0, 1),
117 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW),
118#ifdef __NR_sigreturn
119 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, __NR_sigreturn, 0, 1),
120 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW),
121#endif
122 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, __NR_exit_group, 0, 1),
123 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW),
124 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, __NR_exit, 0, 1),
125 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW),
126 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, __NR_read, 1, 0),
127 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, __NR_write, 3, 2),
128
129 /* Check that read is only using stdin. */
130 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, syscall_arg(0)),
131 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, STDIN_FILENO, 4, 0),
132 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_KILL),
133
134 /* Check that write is only using stdout */
135 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, syscall_arg(0)),
136 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, STDOUT_FILENO, 1, 0),
137 /* Trap attempts to write to stderr */
138 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, STDERR_FILENO, 1, 2),
139
140 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW),
141 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_TRAP),
142 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_KILL),
143 };
144 struct sock_fprog prog = {
145 .len = (unsigned short)(sizeof(filter)/sizeof(filter[0])),
146 .filter = filter,
147 };
148
149 if (prctl(PR_SET_NO_NEW_PRIVS, 1, 0, 0, 0)) {
150 perror("prctl(NO_NEW_PRIVS)");
151 return 1;
152 }
153
154
155 if (prctl(PR_SET_SECCOMP, SECCOMP_MODE_FILTER, &prog)) {
156 perror("prctl");
157 return 1;
158 }
159 return 0;
160}
161
162#define payload(_c) (_c), sizeof((_c))
163int main(int argc, char **argv)
164{
165 char buf[4096];
166 ssize_t bytes = 0;
167 if (install_emulator())
168 return 1;
169 if (install_filter())
170 return 1;
171 syscall(__NR_write, STDOUT_FILENO,
172 payload("OHAI! WHAT IS YOUR NAME? "));
173 bytes = syscall(__NR_read, STDIN_FILENO, buf, sizeof(buf));
174 syscall(__NR_write, STDOUT_FILENO, payload("HELLO, "));
175 syscall(__NR_write, STDOUT_FILENO, buf, bytes);
176 syscall(__NR_write, STDERR_FILENO,
177 payload("Error message going to STDERR\n"));
178 return 0;
179}
180#else /* SUPPORTED_ARCH */
181/*
182 * This sample is x86-only. Since kernel samples are compiled with the
183 * host toolchain, a non-x86 host will result in using only the main()
184 * below.
185 */
186int main(void)
187{
188 return 1;
189}
190#endif /* SUPPORTED_ARCH */
diff --git a/samples/seccomp/bpf-fancy.c b/samples/seccomp/bpf-fancy.c
deleted file mode 100644
index 8eb483aaec4..00000000000
--- a/samples/seccomp/bpf-fancy.c
+++ /dev/null
@@ -1,102 +0,0 @@
1/*
2 * Seccomp BPF example using a macro-based generator.
3 *
4 * Copyright (c) 2012 The Chromium OS Authors <chromium-os-dev@chromium.org>
5 * Author: Will Drewry <wad@chromium.org>
6 *
7 * The code may be used by anyone for any purpose,
8 * and can serve as a starting point for developing
9 * applications using prctl(PR_ATTACH_SECCOMP_FILTER).
10 */
11
12#include <linux/filter.h>
13#include <linux/seccomp.h>
14#include <linux/unistd.h>
15#include <stdio.h>
16#include <string.h>
17#include <sys/prctl.h>
18#include <unistd.h>
19
20#include "bpf-helper.h"
21
22#ifndef PR_SET_NO_NEW_PRIVS
23#define PR_SET_NO_NEW_PRIVS 38
24#endif
25
26int main(int argc, char **argv)
27{
28 struct bpf_labels l;
29 static const char msg1[] = "Please type something: ";
30 static const char msg2[] = "You typed: ";
31 char buf[256];
32 struct sock_filter filter[] = {
33 /* TODO: LOAD_SYSCALL_NR(arch) and enforce an arch */
34 LOAD_SYSCALL_NR,
35 SYSCALL(__NR_exit, ALLOW),
36 SYSCALL(__NR_exit_group, ALLOW),
37 SYSCALL(__NR_write, JUMP(&l, write_fd)),
38 SYSCALL(__NR_read, JUMP(&l, read)),
39 DENY, /* Don't passthrough into a label */
40
41 LABEL(&l, read),
42 ARG(0),
43 JNE(STDIN_FILENO, DENY),
44 ARG(1),
45 JNE((unsigned long)buf, DENY),
46 ARG(2),
47 JGE(sizeof(buf), DENY),
48 ALLOW,
49
50 LABEL(&l, write_fd),
51 ARG(0),
52 JEQ(STDOUT_FILENO, JUMP(&l, write_buf)),
53 JEQ(STDERR_FILENO, JUMP(&l, write_buf)),
54 DENY,
55
56 LABEL(&l, write_buf),
57 ARG(1),
58 JEQ((unsigned long)msg1, JUMP(&l, msg1_len)),
59 JEQ((unsigned long)msg2, JUMP(&l, msg2_len)),
60 JEQ((unsigned long)buf, JUMP(&l, buf_len)),
61 DENY,
62
63 LABEL(&l, msg1_len),
64 ARG(2),
65 JLT(sizeof(msg1), ALLOW),
66 DENY,
67
68 LABEL(&l, msg2_len),
69 ARG(2),
70 JLT(sizeof(msg2), ALLOW),
71 DENY,
72
73 LABEL(&l, buf_len),
74 ARG(2),
75 JLT(sizeof(buf), ALLOW),
76 DENY,
77 };
78 struct sock_fprog prog = {
79 .filter = filter,
80 .len = (unsigned short)(sizeof(filter)/sizeof(filter[0])),
81 };
82 ssize_t bytes;
83 bpf_resolve_jumps(&l, filter, sizeof(filter)/sizeof(*filter));
84
85 if (prctl(PR_SET_NO_NEW_PRIVS, 1, 0, 0, 0)) {
86 perror("prctl(NO_NEW_PRIVS)");
87 return 1;
88 }
89
90 if (prctl(PR_SET_SECCOMP, SECCOMP_MODE_FILTER, &prog)) {
91 perror("prctl(SECCOMP)");
92 return 1;
93 }
94 syscall(__NR_write, STDOUT_FILENO, msg1, strlen(msg1));
95 bytes = syscall(__NR_read, STDIN_FILENO, buf, sizeof(buf)-1);
96 bytes = (bytes > 0 ? bytes : 0);
97 syscall(__NR_write, STDERR_FILENO, msg2, strlen(msg2));
98 syscall(__NR_write, STDERR_FILENO, buf, bytes);
99 /* Now get killed */
100 syscall(__NR_write, STDERR_FILENO, msg2, strlen(msg2)+2);
101 return 0;
102}
diff --git a/samples/seccomp/bpf-helper.c b/samples/seccomp/bpf-helper.c
deleted file mode 100644
index 579cfe33188..00000000000
--- a/samples/seccomp/bpf-helper.c
+++ /dev/null
@@ -1,89 +0,0 @@
1/*
2 * Seccomp BPF helper functions
3 *
4 * Copyright (c) 2012 The Chromium OS Authors <chromium-os-dev@chromium.org>
5 * Author: Will Drewry <wad@chromium.org>
6 *
7 * The code may be used by anyone for any purpose,
8 * and can serve as a starting point for developing
9 * applications using prctl(PR_ATTACH_SECCOMP_FILTER).
10 */
11
12#include <stdio.h>
13#include <string.h>
14
15#include "bpf-helper.h"
16
17int bpf_resolve_jumps(struct bpf_labels *labels,
18 struct sock_filter *filter, size_t count)
19{
20 struct sock_filter *begin = filter;
21 __u8 insn = count - 1;
22
23 if (count < 1)
24 return -1;
25 /*
26 * Walk it once, backwards, to build the label table and do fixups.
27 * Since backward jumps are disallowed by BPF, this is easy.
28 */
29 filter += insn;
30 for (; filter >= begin; --insn, --filter) {
31 if (filter->code != (BPF_JMP+BPF_JA))
32 continue;
33 switch ((filter->jt<<8)|filter->jf) {
34 case (JUMP_JT<<8)|JUMP_JF:
35 if (labels->labels[filter->k].location == 0xffffffff) {
36 fprintf(stderr, "Unresolved label: '%s'\n",
37 labels->labels[filter->k].label);
38 return 1;
39 }
40 filter->k = labels->labels[filter->k].location -
41 (insn + 1);
42 filter->jt = 0;
43 filter->jf = 0;
44 continue;
45 case (LABEL_JT<<8)|LABEL_JF:
46 if (labels->labels[filter->k].location != 0xffffffff) {
47 fprintf(stderr, "Duplicate label use: '%s'\n",
48 labels->labels[filter->k].label);
49 return 1;
50 }
51 labels->labels[filter->k].location = insn;
52 filter->k = 0; /* fall through */
53 filter->jt = 0;
54 filter->jf = 0;
55 continue;
56 }
57 }
58 return 0;
59}
60
61/* Simple lookup table for labels. */
62__u32 seccomp_bpf_label(struct bpf_labels *labels, const char *label)
63{
64 struct __bpf_label *begin = labels->labels, *end;
65 int id;
66 if (labels->count == 0) {
67 begin->label = label;
68 begin->location = 0xffffffff;
69 labels->count++;
70 return 0;
71 }
72 end = begin + labels->count;
73 for (id = 0; begin < end; ++begin, ++id) {
74 if (!strcmp(label, begin->label))
75 return id;
76 }
77 begin->label = label;
78 begin->location = 0xffffffff;
79 labels->count++;
80 return id;
81}
82
83void seccomp_bpf_print(struct sock_filter *filter, size_t count)
84{
85 struct sock_filter *end = filter + count;
86 for ( ; filter < end; ++filter)
87 printf("{ code=%u,jt=%u,jf=%u,k=%u },\n",
88 filter->code, filter->jt, filter->jf, filter->k);
89}
diff --git a/samples/seccomp/bpf-helper.h b/samples/seccomp/bpf-helper.h
deleted file mode 100644
index 38ee70f3cd5..00000000000
--- a/samples/seccomp/bpf-helper.h
+++ /dev/null
@@ -1,243 +0,0 @@
1/*
2 * Example wrapper around BPF macros.
3 *
4 * Copyright (c) 2012 The Chromium OS Authors <chromium-os-dev@chromium.org>
5 * Author: Will Drewry <wad@chromium.org>
6 *
7 * The code may be used by anyone for any purpose,
8 * and can serve as a starting point for developing
9 * applications using prctl(PR_SET_SECCOMP, 2, ...).
10 *
11 * No guarantees are provided with respect to the correctness
12 * or functionality of this code.
13 */
14#ifndef __BPF_HELPER_H__
15#define __BPF_HELPER_H__
16
17#include <asm/bitsperlong.h> /* for __BITS_PER_LONG */
18#include <endian.h>
19#include <linux/filter.h>
20#include <linux/seccomp.h> /* for seccomp_data */
21#include <linux/types.h>
22#include <linux/unistd.h>
23#include <stddef.h>
24
25#define BPF_LABELS_MAX 256
26struct bpf_labels {
27 int count;
28 struct __bpf_label {
29 const char *label;
30 __u32 location;
31 } labels[BPF_LABELS_MAX];
32};
33
34int bpf_resolve_jumps(struct bpf_labels *labels,
35 struct sock_filter *filter, size_t count);
36__u32 seccomp_bpf_label(struct bpf_labels *labels, const char *label);
37void seccomp_bpf_print(struct sock_filter *filter, size_t count);
38
39#define JUMP_JT 0xff
40#define JUMP_JF 0xff
41#define LABEL_JT 0xfe
42#define LABEL_JF 0xfe
43
44#define ALLOW \
45 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW)
46#define DENY \
47 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_KILL)
48#define JUMP(labels, label) \
49 BPF_JUMP(BPF_JMP+BPF_JA, FIND_LABEL((labels), (label)), \
50 JUMP_JT, JUMP_JF)
51#define LABEL(labels, label) \
52 BPF_JUMP(BPF_JMP+BPF_JA, FIND_LABEL((labels), (label)), \
53 LABEL_JT, LABEL_JF)
54#define SYSCALL(nr, jt) \
55 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (nr), 0, 1), \
56 jt
57
58/* Lame, but just an example */
59#define FIND_LABEL(labels, label) seccomp_bpf_label((labels), #label)
60
61#define EXPAND(...) __VA_ARGS__
62
63/* Ensure that we load the logically correct offset. */
64#if __BYTE_ORDER == __LITTLE_ENDIAN
65#define LO_ARG(idx) offsetof(struct seccomp_data, args[(idx)])
66#elif __BYTE_ORDER == __BIG_ENDIAN
67#define LO_ARG(idx) offsetof(struct seccomp_data, args[(idx)]) + sizeof(__u32)
68#else
69#error "Unknown endianness"
70#endif
71
72/* Map all width-sensitive operations */
73#if __BITS_PER_LONG == 32
74
75#define JEQ(x, jt) JEQ32(x, EXPAND(jt))
76#define JNE(x, jt) JNE32(x, EXPAND(jt))
77#define JGT(x, jt) JGT32(x, EXPAND(jt))
78#define JLT(x, jt) JLT32(x, EXPAND(jt))
79#define JGE(x, jt) JGE32(x, EXPAND(jt))
80#define JLE(x, jt) JLE32(x, EXPAND(jt))
81#define JA(x, jt) JA32(x, EXPAND(jt))
82#define ARG(i) ARG_32(i)
83
84#elif __BITS_PER_LONG == 64
85
86/* Ensure that we load the logically correct offset. */
87#if __BYTE_ORDER == __LITTLE_ENDIAN
88#define ENDIAN(_lo, _hi) _lo, _hi
89#define HI_ARG(idx) offsetof(struct seccomp_data, args[(idx)]) + sizeof(__u32)
90#elif __BYTE_ORDER == __BIG_ENDIAN
91#define ENDIAN(_lo, _hi) _hi, _lo
92#define HI_ARG(idx) offsetof(struct seccomp_data, args[(idx)])
93#endif
94
95union arg64 {
96 struct {
97 __u32 ENDIAN(lo32, hi32);
98 };
99 __u64 u64;
100};
101
102#define JEQ(x, jt) \
103 JEQ64(((union arg64){.u64 = (x)}).lo32, \
104 ((union arg64){.u64 = (x)}).hi32, \
105 EXPAND(jt))
106#define JGT(x, jt) \
107 JGT64(((union arg64){.u64 = (x)}).lo32, \
108 ((union arg64){.u64 = (x)}).hi32, \
109 EXPAND(jt))
110#define JGE(x, jt) \
111 JGE64(((union arg64){.u64 = (x)}).lo32, \
112 ((union arg64){.u64 = (x)}).hi32, \
113 EXPAND(jt))
114#define JNE(x, jt) \
115 JNE64(((union arg64){.u64 = (x)}).lo32, \
116 ((union arg64){.u64 = (x)}).hi32, \
117 EXPAND(jt))
118#define JLT(x, jt) \
119 JLT64(((union arg64){.u64 = (x)}).lo32, \
120 ((union arg64){.u64 = (x)}).hi32, \
121 EXPAND(jt))
122#define JLE(x, jt) \
123 JLE64(((union arg64){.u64 = (x)}).lo32, \
124 ((union arg64){.u64 = (x)}).hi32, \
125 EXPAND(jt))
126
127#define JA(x, jt) \
128 JA64(((union arg64){.u64 = (x)}).lo32, \
129 ((union arg64){.u64 = (x)}).hi32, \
130 EXPAND(jt))
131#define ARG(i) ARG_64(i)
132
133#else
134#error __BITS_PER_LONG value unusable.
135#endif
136
137/* Loads the arg into A */
138#define ARG_32(idx) \
139 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, LO_ARG(idx))
140
141/* Loads hi into A and lo in X */
142#define ARG_64(idx) \
143 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, LO_ARG(idx)), \
144 BPF_STMT(BPF_ST, 0), /* lo -> M[0] */ \
145 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, HI_ARG(idx)), \
146 BPF_STMT(BPF_ST, 1) /* hi -> M[1] */
147
148#define JEQ32(value, jt) \
149 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (value), 0, 1), \
150 jt
151
152#define JNE32(value, jt) \
153 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (value), 1, 0), \
154 jt
155
156/* Checks the lo, then swaps to check the hi. A=lo,X=hi */
157#define JEQ64(lo, hi, jt) \
158 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
159 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
160 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (lo), 0, 2), \
161 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
162 jt, \
163 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
164
165#define JNE64(lo, hi, jt) \
166 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 5, 0), \
167 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
168 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (lo), 2, 0), \
169 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
170 jt, \
171 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
172
173#define JA32(value, jt) \
174 BPF_JUMP(BPF_JMP+BPF_JSET+BPF_K, (value), 0, 1), \
175 jt
176
177#define JA64(lo, hi, jt) \
178 BPF_JUMP(BPF_JMP+BPF_JSET+BPF_K, (hi), 3, 0), \
179 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
180 BPF_JUMP(BPF_JMP+BPF_JSET+BPF_K, (lo), 0, 2), \
181 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
182 jt, \
183 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
184
185#define JGE32(value, jt) \
186 BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (value), 0, 1), \
187 jt
188
189#define JLT32(value, jt) \
190 BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (value), 1, 0), \
191 jt
192
193/* Shortcut checking if hi > arg.hi. */
194#define JGE64(lo, hi, jt) \
195 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (hi), 4, 0), \
196 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
197 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
198 BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (lo), 0, 2), \
199 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
200 jt, \
201 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
202
203#define JLT64(lo, hi, jt) \
204 BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (hi), 0, 4), \
205 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
206 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
207 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (lo), 2, 0), \
208 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
209 jt, \
210 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
211
212#define JGT32(value, jt) \
213 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (value), 0, 1), \
214 jt
215
216#define JLE32(value, jt) \
217 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (value), 1, 0), \
218 jt
219
220/* Check hi > args.hi first, then do the GE checking */
221#define JGT64(lo, hi, jt) \
222 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (hi), 4, 0), \
223 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
224 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
225 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (lo), 0, 2), \
226 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
227 jt, \
228 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
229
230#define JLE64(lo, hi, jt) \
231 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (hi), 6, 0), \
232 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 3), \
233 BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
234 BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (lo), 2, 0), \
235 BPF_STMT(BPF_LD+BPF_MEM, 1), /* passed: swap hi back in */ \
236 jt, \
237 BPF_STMT(BPF_LD+BPF_MEM, 1) /* failed: swap hi back in */
238
239#define LOAD_SYSCALL_NR \
240 BPF_STMT(BPF_LD+BPF_W+BPF_ABS, \
241 offsetof(struct seccomp_data, nr))
242
243#endif /* __BPF_HELPER_H__ */
diff --git a/samples/seccomp/dropper.c b/samples/seccomp/dropper.c
deleted file mode 100644
index c69c347c701..00000000000
--- a/samples/seccomp/dropper.c
+++ /dev/null
@@ -1,68 +0,0 @@
1/*
2 * Naive system call dropper built on seccomp_filter.
3 *
4 * Copyright (c) 2012 The Chromium OS Authors <chromium-os-dev@chromium.org>
5 * Author: Will Drewry <wad@chromium.org>
6 *
7 * The code may be used by anyone for any purpose,
8 * and can serve as a starting point for developing
9 * applications using prctl(PR_SET_SECCOMP, 2, ...).
10 *
11 * When run, returns the specified errno for the specified
12 * system call number against the given architecture.
13 *
14 * Run this one as root as PR_SET_NO_NEW_PRIVS is not called.
15 */
16
17#include <errno.h>
18#include <linux/audit.h>
19#include <linux/filter.h>
20#include <linux/seccomp.h>
21#include <linux/unistd.h>
22#include <stdio.h>
23#include <stddef.h>
24#include <stdlib.h>
25#include <sys/prctl.h>
26#include <unistd.h>
27
28static int install_filter(int nr, int arch, int error)
29{
30 struct sock_filter filter[] = {
31 BPF_STMT(BPF_LD+BPF_W+BPF_ABS,
32 (offsetof(struct seccomp_data, arch))),
33 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, arch, 0, 3),
34 BPF_STMT(BPF_LD+BPF_W+BPF_ABS,
35 (offsetof(struct seccomp_data, nr))),
36 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, nr, 0, 1),
37 BPF_STMT(BPF_RET+BPF_K,
38 SECCOMP_RET_ERRNO|(error & SECCOMP_RET_DATA)),
39 BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW),
40 };
41 struct sock_fprog prog = {
42 .len = (unsigned short)(sizeof(filter)/sizeof(filter[0])),
43 .filter = filter,
44 };
45 if (prctl(PR_SET_SECCOMP, 2, &prog)) {
46 perror("prctl");
47 return 1;
48 }
49 return 0;
50}
51
52int main(int argc, char **argv)
53{
54 if (argc < 5) {
55 fprintf(stderr, "Usage:\n"
56 "dropper <syscall_nr> <arch> <errno> <prog> [<args>]\n"
57 "Hint: AUDIT_ARCH_I386: 0x%X\n"
58 " AUDIT_ARCH_X86_64: 0x%X\n"
59 "\n", AUDIT_ARCH_I386, AUDIT_ARCH_X86_64);
60 return 1;
61 }
62 if (install_filter(strtol(argv[1], NULL, 0), strtol(argv[2], NULL, 0),
63 strtol(argv[3], NULL, 0)))
64 return 1;
65 execv(argv[4], &argv[4]);
66 printf("Failed to execv\n");
67 return 255;
68}
generated by cgit v1.2.2 (git 2.25.0) at 2025-09-03 18:21:14 -0400