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 08:07:57 -06:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2015-08-28 22:21:55 -06:00
|
|
|
/*
|
|
|
|
|
* Linux Socket Filter Data Structures
|
|
|
|
|
*/
|
|
|
|
|
#ifndef __TOOLS_LINUX_FILTER_H
|
|
|
|
|
#define __TOOLS_LINUX_FILTER_H
|
|
|
|
|
|
|
|
|
|
#include <linux/bpf.h>
|
|
|
|
|
|
|
|
|
|
/* ArgX, context and stack frame pointer register positions. Note,
|
|
|
|
|
* Arg1, Arg2, Arg3, etc are used as argument mappings of function
|
|
|
|
|
* calls in BPF_CALL instruction.
|
|
|
|
|
*/
|
|
|
|
|
#define BPF_REG_ARG1 BPF_REG_1
|
|
|
|
|
#define BPF_REG_ARG2 BPF_REG_2
|
|
|
|
|
#define BPF_REG_ARG3 BPF_REG_3
|
|
|
|
|
#define BPF_REG_ARG4 BPF_REG_4
|
|
|
|
|
#define BPF_REG_ARG5 BPF_REG_5
|
|
|
|
|
#define BPF_REG_CTX BPF_REG_6
|
|
|
|
|
#define BPF_REG_FP BPF_REG_10
|
|
|
|
|
|
|
|
|
|
/* Additional register mappings for converted user programs. */
|
|
|
|
|
#define BPF_REG_A BPF_REG_0
|
|
|
|
|
#define BPF_REG_X BPF_REG_7
|
|
|
|
|
#define BPF_REG_TMP BPF_REG_8
|
|
|
|
|
|
|
|
|
|
/* BPF program can access up to 512 bytes of stack space. */
|
|
|
|
|
#define MAX_BPF_STACK 512
|
|
|
|
|
|
|
|
|
|
/* Helper macros for filter block array initializers. */
|
|
|
|
|
|
|
|
|
|
/* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */
|
|
|
|
|
|
|
|
|
|
#define BPF_ALU64_REG(OP, DST, SRC) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
|
|
|
|
#define BPF_ALU32_REG(OP, DST, SRC) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU | BPF_OP(OP) | BPF_X, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
|
|
|
|
/* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */
|
|
|
|
|
|
|
|
|
|
#define BPF_ALU64_IMM(OP, DST, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
#define BPF_ALU32_IMM(OP, DST, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU | BPF_OP(OP) | BPF_K, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
/* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */
|
|
|
|
|
|
|
|
|
|
#define BPF_ENDIAN(TYPE, DST, LEN) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = LEN })
|
|
|
|
|
|
|
|
|
|
/* Short form of mov, dst_reg = src_reg */
|
|
|
|
|
|
|
|
|
|
#define BPF_MOV64_REG(DST, SRC) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU64 | BPF_MOV | BPF_X, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
|
|
|
|
#define BPF_MOV32_REG(DST, SRC) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU | BPF_MOV | BPF_X, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
|
|
|
|
/* Short form of mov, dst_reg = imm32 */
|
|
|
|
|
|
|
|
|
|
#define BPF_MOV64_IMM(DST, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU64 | BPF_MOV | BPF_K, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
#define BPF_MOV32_IMM(DST, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU | BPF_MOV | BPF_K, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
/* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
|
|
|
|
|
|
|
|
|
|
#define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
#define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
/* Direct packet access, R0 = *(uint *) (skb->data + imm32) */
|
|
|
|
|
|
|
|
|
|
#define BPF_LD_ABS(SIZE, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
/* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */
|
|
|
|
|
|
|
|
|
|
#define BPF_LD_IND(SIZE, SRC, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
/* Memory load, dst_reg = *(uint *) (src_reg + off16) */
|
|
|
|
|
|
|
|
|
|
#define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
|
|
|
|
/* Memory store, *(uint *) (dst_reg + off16) = src_reg */
|
|
|
|
|
|
|
|
|
|
#define BPF_STX_MEM(SIZE, DST, SRC, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
2017-03-30 18:24:04 -06:00
|
|
|
/* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */
|
|
|
|
|
|
|
|
|
|
#define BPF_STX_XADD(SIZE, DST, SRC, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
2015-08-28 22:21:55 -06:00
|
|
|
/* Memory store, *(uint *) (dst_reg + off16) = imm32 */
|
|
|
|
|
|
|
|
|
|
#define BPF_ST_MEM(SIZE, DST, OFF, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
|
|
|
|
/* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */
|
|
|
|
|
|
|
|
|
|
#define BPF_JMP_REG(OP, DST, SRC, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP | BPF_OP(OP) | BPF_X, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
2019-01-26 10:26:05 -07:00
|
|
|
/* Like BPF_JMP_REG, but with 32-bit wide operands for comparison. */
|
|
|
|
|
|
|
|
|
|
#define BPF_JMP32_REG(OP, DST, SRC, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP32 | BPF_OP(OP) | BPF_X, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
2015-08-28 22:21:55 -06:00
|
|
|
/* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */
|
|
|
|
|
|
|
|
|
|
#define BPF_JMP_IMM(OP, DST, IMM, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP | BPF_OP(OP) | BPF_K, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
2019-01-26 10:26:05 -07:00
|
|
|
/* Like BPF_JMP_IMM, but with 32-bit wide operands for comparison. */
|
|
|
|
|
|
|
|
|
|
#define BPF_JMP32_IMM(OP, DST, IMM, OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP32 | BPF_OP(OP) | BPF_K, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
2017-05-24 17:05:09 -06:00
|
|
|
/* Unconditional jumps, goto pc + off16 */
|
|
|
|
|
|
|
|
|
|
#define BPF_JMP_A(OFF) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP | BPF_JA, \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
2015-08-28 22:21:55 -06:00
|
|
|
/* Function call */
|
|
|
|
|
|
|
|
|
|
#define BPF_EMIT_CALL(FUNC) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP | BPF_CALL, \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = ((FUNC) - BPF_FUNC_unspec) })
|
|
|
|
|
|
|
|
|
|
/* Raw code statement block */
|
|
|
|
|
|
|
|
|
|
#define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = CODE, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF, \
|
|
|
|
|
.imm = IMM })
|
|
|
|
|
|
2016-10-17 06:28:36 -06:00
|
|
|
/* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */
|
|
|
|
|
|
|
|
|
|
#define BPF_LD_IMM64(DST, IMM) \
|
|
|
|
|
BPF_LD_IMM64_RAW(DST, 0, IMM)
|
|
|
|
|
|
|
|
|
|
#define BPF_LD_IMM64_RAW(DST, SRC, IMM) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_LD | BPF_DW | BPF_IMM, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = (__u32) (IMM) }), \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = 0, /* zero is reserved opcode */ \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = ((__u64) (IMM)) >> 32 })
|
|
|
|
|
|
bpf, selftest: test {rd, wr}only flags and direct value access
Extend test_verifier with various test cases around the two kernel
extensions, that is, {rd,wr}only map support as well as direct map
value access. All passing, one skipped due to xskmap not present
on test machine:
# ./test_verifier
[...]
#948/p XDP pkt read, pkt_meta' <= pkt_data, bad access 1 OK
#949/p XDP pkt read, pkt_meta' <= pkt_data, bad access 2 OK
#950/p XDP pkt read, pkt_data <= pkt_meta', good access OK
#951/p XDP pkt read, pkt_data <= pkt_meta', bad access 1 OK
#952/p XDP pkt read, pkt_data <= pkt_meta', bad access 2 OK
Summary: 1410 PASSED, 1 SKIPPED, 0 FAILED
Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Acked-by: Martin KaFai Lau <kafai@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
2019-04-09 15:20:16 -06:00
|
|
|
#define BPF_LD_IMM64_RAW_FULL(DST, SRC, OFF1, OFF2, IMM1, IMM2) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_LD | BPF_DW | BPF_IMM, \
|
|
|
|
|
.dst_reg = DST, \
|
|
|
|
|
.src_reg = SRC, \
|
|
|
|
|
.off = OFF1, \
|
|
|
|
|
.imm = IMM1 }), \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = 0, /* zero is reserved opcode */ \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = OFF2, \
|
|
|
|
|
.imm = IMM2 })
|
|
|
|
|
|
2016-10-17 06:28:36 -06:00
|
|
|
/* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */
|
|
|
|
|
|
|
|
|
|
#define BPF_LD_MAP_FD(DST, MAP_FD) \
|
bpf, selftest: test {rd, wr}only flags and direct value access
Extend test_verifier with various test cases around the two kernel
extensions, that is, {rd,wr}only map support as well as direct map
value access. All passing, one skipped due to xskmap not present
on test machine:
# ./test_verifier
[...]
#948/p XDP pkt read, pkt_meta' <= pkt_data, bad access 1 OK
#949/p XDP pkt read, pkt_meta' <= pkt_data, bad access 2 OK
#950/p XDP pkt read, pkt_data <= pkt_meta', good access OK
#951/p XDP pkt read, pkt_data <= pkt_meta', bad access 1 OK
#952/p XDP pkt read, pkt_data <= pkt_meta', bad access 2 OK
Summary: 1410 PASSED, 1 SKIPPED, 0 FAILED
Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Acked-by: Martin KaFai Lau <kafai@fb.com>
Signed-off-by: Alexei Starovoitov <ast@kernel.org>
2019-04-09 15:20:16 -06:00
|
|
|
BPF_LD_IMM64_RAW_FULL(DST, BPF_PSEUDO_MAP_FD, 0, 0, \
|
|
|
|
|
MAP_FD, 0)
|
|
|
|
|
|
|
|
|
|
#define BPF_LD_MAP_VALUE(DST, MAP_FD, VALUE_OFF) \
|
|
|
|
|
BPF_LD_IMM64_RAW_FULL(DST, BPF_PSEUDO_MAP_VALUE, 0, 0, \
|
|
|
|
|
MAP_FD, VALUE_OFF)
|
2016-10-17 06:28:36 -06:00
|
|
|
|
2018-06-02 15:06:31 -06:00
|
|
|
/* Relative call */
|
|
|
|
|
|
|
|
|
|
#define BPF_CALL_REL(TGT) \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP | BPF_CALL, \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = BPF_PSEUDO_CALL, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = TGT })
|
|
|
|
|
|
2015-08-28 22:21:55 -06:00
|
|
|
/* Program exit */
|
|
|
|
|
|
|
|
|
|
#define BPF_EXIT_INSN() \
|
|
|
|
|
((struct bpf_insn) { \
|
|
|
|
|
.code = BPF_JMP | BPF_EXIT, \
|
|
|
|
|
.dst_reg = 0, \
|
|
|
|
|
.src_reg = 0, \
|
|
|
|
|
.off = 0, \
|
|
|
|
|
.imm = 0 })
|
|
|
|
|
|
|
|
|
|
#endif /* __TOOLS_LINUX_FILTER_H */
|