License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 22:07:57 +08:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2012-04-13 05:48:04 +08:00
|
|
|
/*
|
|
|
|
|
* Example wrapper around BPF macros.
|
|
|
|
|
*
|
|
|
|
|
* Copyright (c) 2012 The Chromium OS Authors <chromium-os-dev@chromium.org>
|
|
|
|
|
* Author: Will Drewry <wad@chromium.org>
|
|
|
|
|
*
|
|
|
|
|
* The code may be used by anyone for any purpose,
|
|
|
|
|
* and can serve as a starting point for developing
|
|
|
|
|
* applications using prctl(PR_SET_SECCOMP, 2, ...).
|
|
|
|
|
*
|
|
|
|
|
* No guarantees are provided with respect to the correctness
|
|
|
|
|
* or functionality of this code.
|
|
|
|
|
*/
|
|
|
|
|
#ifndef __BPF_HELPER_H__
|
|
|
|
|
#define __BPF_HELPER_H__
|
|
|
|
|
|
|
|
|
|
#include <asm/bitsperlong.h> /* for __BITS_PER_LONG */
|
|
|
|
|
#include <endian.h>
|
|
|
|
|
#include <linux/filter.h>
|
|
|
|
|
#include <linux/seccomp.h> /* for seccomp_data */
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
|
#include <linux/unistd.h>
|
|
|
|
|
#include <stddef.h>
|
|
|
|
|
|
|
|
|
|
#define BPF_LABELS_MAX 256
|
|
|
|
|
struct bpf_labels {
|
|
|
|
|
int count;
|
|
|
|
|
struct __bpf_label {
|
|
|
|
|
const char *label;
|
|
|
|
|
__u32 location;
|
|
|
|
|
} labels[BPF_LABELS_MAX];
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
int bpf_resolve_jumps(struct bpf_labels *labels,
|
|
|
|
|
struct sock_filter *filter, size_t count);
|
|
|
|
|
__u32 seccomp_bpf_label(struct bpf_labels *labels, const char *label);
|
|
|
|
|
void seccomp_bpf_print(struct sock_filter *filter, size_t count);
|
|
|
|
|
|
|
|
|
|
#define JUMP_JT 0xff
|
|
|
|
|
#define JUMP_JF 0xff
|
|
|
|
|
#define LABEL_JT 0xfe
|
|
|
|
|
#define LABEL_JF 0xfe
|
|
|
|
|
|
|
|
|
|
#define ALLOW \
|
|
|
|
|
BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_ALLOW)
|
|
|
|
|
#define DENY \
|
|
|
|
|
BPF_STMT(BPF_RET+BPF_K, SECCOMP_RET_KILL)
|
|
|
|
|
#define JUMP(labels, label) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JA, FIND_LABEL((labels), (label)), \
|
|
|
|
|
JUMP_JT, JUMP_JF)
|
|
|
|
|
#define LABEL(labels, label) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JA, FIND_LABEL((labels), (label)), \
|
|
|
|
|
LABEL_JT, LABEL_JF)
|
|
|
|
|
#define SYSCALL(nr, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (nr), 0, 1), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
/* Lame, but just an example */
|
|
|
|
|
#define FIND_LABEL(labels, label) seccomp_bpf_label((labels), #label)
|
|
|
|
|
|
|
|
|
|
#define EXPAND(...) __VA_ARGS__
|
2012-07-31 22:15:36 +08:00
|
|
|
|
|
|
|
|
/* Ensure that we load the logically correct offset. */
|
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
|
#define LO_ARG(idx) offsetof(struct seccomp_data, args[(idx)])
|
|
|
|
|
#elif __BYTE_ORDER == __BIG_ENDIAN
|
|
|
|
|
#define LO_ARG(idx) offsetof(struct seccomp_data, args[(idx)]) + sizeof(__u32)
|
|
|
|
|
#else
|
|
|
|
|
#error "Unknown endianness"
|
|
|
|
|
#endif
|
|
|
|
|
|
2012-04-13 05:48:04 +08:00
|
|
|
/* Map all width-sensitive operations */
|
|
|
|
|
#if __BITS_PER_LONG == 32
|
|
|
|
|
|
|
|
|
|
#define JEQ(x, jt) JEQ32(x, EXPAND(jt))
|
|
|
|
|
#define JNE(x, jt) JNE32(x, EXPAND(jt))
|
|
|
|
|
#define JGT(x, jt) JGT32(x, EXPAND(jt))
|
|
|
|
|
#define JLT(x, jt) JLT32(x, EXPAND(jt))
|
|
|
|
|
#define JGE(x, jt) JGE32(x, EXPAND(jt))
|
|
|
|
|
#define JLE(x, jt) JLE32(x, EXPAND(jt))
|
|
|
|
|
#define JA(x, jt) JA32(x, EXPAND(jt))
|
|
|
|
|
#define ARG(i) ARG_32(i)
|
|
|
|
|
|
|
|
|
|
#elif __BITS_PER_LONG == 64
|
|
|
|
|
|
|
|
|
|
/* Ensure that we load the logically correct offset. */
|
|
|
|
|
#if __BYTE_ORDER == __LITTLE_ENDIAN
|
|
|
|
|
#define ENDIAN(_lo, _hi) _lo, _hi
|
|
|
|
|
#define HI_ARG(idx) offsetof(struct seccomp_data, args[(idx)]) + sizeof(__u32)
|
|
|
|
|
#elif __BYTE_ORDER == __BIG_ENDIAN
|
|
|
|
|
#define ENDIAN(_lo, _hi) _hi, _lo
|
|
|
|
|
#define HI_ARG(idx) offsetof(struct seccomp_data, args[(idx)])
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
union arg64 {
|
|
|
|
|
struct {
|
|
|
|
|
__u32 ENDIAN(lo32, hi32);
|
|
|
|
|
};
|
|
|
|
|
__u64 u64;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#define JEQ(x, jt) \
|
|
|
|
|
JEQ64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
#define JGT(x, jt) \
|
|
|
|
|
JGT64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
#define JGE(x, jt) \
|
|
|
|
|
JGE64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
#define JNE(x, jt) \
|
|
|
|
|
JNE64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
#define JLT(x, jt) \
|
|
|
|
|
JLT64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
#define JLE(x, jt) \
|
|
|
|
|
JLE64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
|
|
|
|
|
#define JA(x, jt) \
|
|
|
|
|
JA64(((union arg64){.u64 = (x)}).lo32, \
|
|
|
|
|
((union arg64){.u64 = (x)}).hi32, \
|
|
|
|
|
EXPAND(jt))
|
|
|
|
|
#define ARG(i) ARG_64(i)
|
|
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
#error __BITS_PER_LONG value unusable.
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Loads the arg into A */
|
|
|
|
|
#define ARG_32(idx) \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_W+BPF_ABS, LO_ARG(idx))
|
|
|
|
|
|
2017-01-07 05:32:39 +08:00
|
|
|
/* Loads lo into M[0] and hi into M[1] and A */
|
2012-04-13 05:48:04 +08:00
|
|
|
#define ARG_64(idx) \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_W+BPF_ABS, LO_ARG(idx)), \
|
|
|
|
|
BPF_STMT(BPF_ST, 0), /* lo -> M[0] */ \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_W+BPF_ABS, HI_ARG(idx)), \
|
|
|
|
|
BPF_STMT(BPF_ST, 1) /* hi -> M[1] */
|
|
|
|
|
|
|
|
|
|
#define JEQ32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (value), 0, 1), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
#define JNE32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (value), 1, 0), \
|
|
|
|
|
jt
|
|
|
|
|
|
2017-01-07 05:32:39 +08:00
|
|
|
#define JA32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JSET+BPF_K, (value), 0, 1), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
#define JGE32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (value), 0, 1), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
#define JGT32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (value), 0, 1), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
#define JLE32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (value), 1, 0), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
#define JLT32(value, jt) \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (value), 1, 0), \
|
|
|
|
|
jt
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* All the JXX64 checks assume lo is saved in M[0] and hi is saved in both
|
|
|
|
|
* A and M[1]. This invariant is kept by restoring A if necessary.
|
|
|
|
|
*/
|
2012-04-13 05:48:04 +08:00
|
|
|
#define JEQ64(lo, hi, jt) \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi != arg.hi) goto NOMATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), /* swap in lo */ \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (lo != arg.lo) goto NOMATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (lo), 0, 2), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
2012-04-13 05:48:04 +08:00
|
|
|
jt, \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
2012-04-13 05:48:04 +08:00
|
|
|
|
|
|
|
|
#define JNE64(lo, hi, jt) \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi != arg.hi) goto MATCH; */ \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 3), \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), \
|
|
|
|
|
/* if (lo != arg.lo) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (lo), 2, 0), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
2012-04-13 05:48:04 +08:00
|
|
|
jt, \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
2012-04-13 05:48:04 +08:00
|
|
|
|
|
|
|
|
#define JA64(lo, hi, jt) \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi & arg.hi) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JSET+BPF_K, (hi), 3, 0), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), \
|
|
|
|
|
/* if (lo & arg.lo) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JSET+BPF_K, (lo), 0, 2), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
2012-04-13 05:48:04 +08:00
|
|
|
jt, \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
2012-04-13 05:48:04 +08:00
|
|
|
|
|
|
|
|
#define JGE64(lo, hi, jt) \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi > arg.hi) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (hi), 4, 0), \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi != arg.hi) goto NOMATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), \
|
|
|
|
|
/* if (lo >= arg.lo) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (lo), 0, 2), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
2012-04-13 05:48:04 +08:00
|
|
|
jt, \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
2012-04-13 05:48:04 +08:00
|
|
|
|
|
|
|
|
#define JGT64(lo, hi, jt) \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi > arg.hi) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (hi), 4, 0), \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi != arg.hi) goto NOMATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), \
|
|
|
|
|
/* if (lo > arg.lo) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (lo), 0, 2), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
2012-04-13 05:48:04 +08:00
|
|
|
jt, \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
2012-04-13 05:48:04 +08:00
|
|
|
|
|
|
|
|
#define JLE64(lo, hi, jt) \
|
2017-01-07 05:32:39 +08:00
|
|
|
/* if (hi < arg.hi) goto MATCH; */ \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (hi), 0, 4), \
|
|
|
|
|
/* if (hi != arg.hi) goto NOMATCH; */ \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), \
|
|
|
|
|
/* if (lo <= arg.lo) goto MATCH; */ \
|
2012-04-13 05:48:04 +08:00
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGT+BPF_K, (lo), 2, 0), \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
|
|
|
|
jt, \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
|
|
|
|
|
|
|
|
|
#define JLT64(lo, hi, jt) \
|
|
|
|
|
/* if (hi < arg.hi) goto MATCH; */ \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (hi), 0, 4), \
|
|
|
|
|
/* if (hi != arg.hi) goto NOMATCH; */ \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, (hi), 0, 5), \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 0), \
|
|
|
|
|
/* if (lo < arg.lo) goto MATCH; */ \
|
|
|
|
|
BPF_JUMP(BPF_JMP+BPF_JGE+BPF_K, (lo), 2, 0), \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1), \
|
2012-04-13 05:48:04 +08:00
|
|
|
jt, \
|
2017-01-07 05:32:39 +08:00
|
|
|
BPF_STMT(BPF_LD+BPF_MEM, 1)
|
2012-04-13 05:48:04 +08:00
|
|
|
|
|
|
|
|
#define LOAD_SYSCALL_NR \
|
|
|
|
|
BPF_STMT(BPF_LD+BPF_W+BPF_ABS, \
|
|
|
|
|
offsetof(struct seccomp_data, nr))
|
|
|
|
|
|
|
|
|
|
#endif /* __BPF_HELPER_H__ */
|