1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/*
* Copyright (C) 2014-2017 Firejail Authors
*
* This file is part of firejail project
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "fseccomp.h"
#include "../include/seccomp.h"
#include <sys/syscall.h>
static struct sock_filter *filter = NULL;
static int filter_cnt = 0;
static void load_seccomp(const char *fname) {
assert(fname);
// open filter file
int fd = open(fname, O_RDONLY);
if (fd == -1)
goto errexit;
// calculate the number of entries
int size = lseek(fd, 0, SEEK_END);
if (size == -1)
goto errexit;
if (lseek(fd, 0 , SEEK_SET) == -1)
goto errexit;
unsigned short entries = (unsigned short) size / (unsigned short) sizeof(struct sock_filter);
filter_cnt = entries;
// read filter
filter = malloc(size);
if (filter == NULL)
goto errexit;
memset(filter, 0, size);
int rd = 0;
while (rd < size) {
int rv = read(fd, (unsigned char *) filter + rd, size - rd);
if (rv == -1)
goto errexit;
rd += rv;
}
// close file
close(fd);
return;
errexit:
fprintf(stderr, "Error fseccomp: cannot read %s\n", fname);
exit(1);
}
// debug filter
void filter_print(const char *fname) {
assert(fname);
load_seccomp(fname);
// start filter
const struct sock_filter start[] = {
VALIDATE_ARCHITECTURE,
#if defined(__x86_64__)
EXAMINE_SYSCALL,
HANDLE_X32
#else
EXAMINE_SYSCALL
#endif
};
// print sizes
printf("SECCOMP Filter:\n");
// test the start of the filter
if (memcmp(&start[0], filter, sizeof(start)) == 0) {
printf(" VALIDATE_ARCHITECTURE\n");
printf(" EXAMINE_SYSCALL\n");
#if defined(__x86_64__)
printf(" HANDLE_X32\n");
#endif
}
else {
printf("Invalid seccomp filter %s\n", fname);
return;
}
// loop trough blacklists
int i = sizeof(start) / sizeof(struct sock_filter);
while (i < filter_cnt) {
// minimal parsing!
struct sock_filter *s = (struct sock_filter *) &filter[i];
if (s->code == BPF_JMP+BPF_JEQ+BPF_K && (s + 1)->code == BPF_RET+BPF_K && (s + 1)->k == SECCOMP_RET_ALLOW ) {
printf(" WHITELIST %d %s\n", s->k, syscall_find_nr(s->k));
i += 2;
}
else if (s->code == BPF_JMP+BPF_JEQ+BPF_K && (s + 1)->code == BPF_RET+BPF_K && (s + 1)->k == SECCOMP_RET_KILL ) {
printf(" BLACKLIST %d %s\n", s->k, syscall_find_nr(s->k));
i += 2;
}
else if (s->code == BPF_JMP+BPF_JEQ+BPF_K && (s + 1)->code == BPF_RET+BPF_K && ((s + 1)->k & ~SECCOMP_RET_DATA) == SECCOMP_RET_ERRNO) {
printf(" BLACKLIST_ERRNO %d %s %d %s\n", s->k, syscall_find_nr(s->k), (s + 1)->k & SECCOMP_RET_DATA, errno_find_nr((s + 1)->k & SECCOMP_RET_DATA));
i += 2;
}
else if (s->code == BPF_RET+BPF_K && (s->k & ~SECCOMP_RET_DATA) == SECCOMP_RET_ERRNO) {
printf(" RETURN_ERRNO %d %s\n", s->k & SECCOMP_RET_DATA, errno_find_nr(s->k & SECCOMP_RET_DATA));
i++;
}
else if (s->code == BPF_RET+BPF_K && s->k == SECCOMP_RET_KILL) {
printf(" KILL_PROCESS\n");
i++;
}
else if (s->code == BPF_RET+BPF_K && s->k == SECCOMP_RET_ALLOW) {
printf(" RETURN_ALLOW\n");
i++;
}
else {
printf(" UNKNOWN ENTRY %x!\n", s->code);
i++;
}
}
}
|
