blob: a3a49505251117bab031d218c6bf99e8da8ca63b [file] [log] [blame]
Greg Kroah-Hartmane2be04c2017-11-01 15:09:13 +01001/* SPDX-License-Identifier: GPL-2.0 WITH Linux-syscall-note */
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -07002/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of version 2 of the GNU General Public
6 * License as published by the Free Software Foundation.
7 */
8#ifndef _UAPI__LINUX_BPF_H__
9#define _UAPI__LINUX_BPF_H__
10
11#include <linux/types.h>
Alexei Starovoitovc15952d2014-10-14 02:08:54 -070012#include <linux/bpf_common.h>
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -070013
14/* Extended instruction set based on top of classic BPF */
15
16/* instruction classes */
17#define BPF_ALU64 0x07 /* alu mode in double word width */
18
19/* ld/ldx fields */
Jesper Dangaard Brouercb5f7332018-01-17 12:05:36 +010020#define BPF_DW 0x18 /* double word (64-bit) */
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -070021#define BPF_XADD 0xc0 /* exclusive add */
22
23/* alu/jmp fields */
24#define BPF_MOV 0xb0 /* mov reg to reg */
25#define BPF_ARSH 0xc0 /* sign extending arithmetic shift right */
26
27/* change endianness of a register */
28#define BPF_END 0xd0 /* flags for endianness conversion: */
29#define BPF_TO_LE 0x00 /* convert to little-endian */
30#define BPF_TO_BE 0x08 /* convert to big-endian */
31#define BPF_FROM_LE BPF_TO_LE
32#define BPF_FROM_BE BPF_TO_BE
33
Daniel Borkmann92b31a92017-08-10 01:39:55 +020034/* jmp encodings */
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -070035#define BPF_JNE 0x50 /* jump != */
Daniel Borkmann92b31a92017-08-10 01:39:55 +020036#define BPF_JLT 0xa0 /* LT is unsigned, '<' */
37#define BPF_JLE 0xb0 /* LE is unsigned, '<=' */
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -070038#define BPF_JSGT 0x60 /* SGT is signed '>', GT in x86 */
39#define BPF_JSGE 0x70 /* SGE is signed '>=', GE in x86 */
Daniel Borkmann92b31a92017-08-10 01:39:55 +020040#define BPF_JSLT 0xc0 /* SLT is signed, '<' */
41#define BPF_JSLE 0xd0 /* SLE is signed, '<=' */
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -070042#define BPF_CALL 0x80 /* function call */
43#define BPF_EXIT 0x90 /* function return */
44
45/* Register numbers */
46enum {
47 BPF_REG_0 = 0,
48 BPF_REG_1,
49 BPF_REG_2,
50 BPF_REG_3,
51 BPF_REG_4,
52 BPF_REG_5,
53 BPF_REG_6,
54 BPF_REG_7,
55 BPF_REG_8,
56 BPF_REG_9,
57 BPF_REG_10,
58 __MAX_BPF_REG,
59};
60
61/* BPF has 10 general purpose 64-bit registers and stack frame. */
62#define MAX_BPF_REG __MAX_BPF_REG
63
64struct bpf_insn {
65 __u8 code; /* opcode */
66 __u8 dst_reg:4; /* dest register */
67 __u8 src_reg:4; /* source register */
68 __s16 off; /* signed offset */
69 __s32 imm; /* signed immediate constant */
70};
71
Daniel Mackb95a5c42017-01-21 17:26:11 +010072/* Key of an a BPF_MAP_TYPE_LPM_TRIE entry */
73struct bpf_lpm_trie_key {
74 __u32 prefixlen; /* up to 32 for AF_INET, 128 for AF_INET6 */
75 __u8 data[0]; /* Arbitrary size */
76};
77
Daniel Borkmannb2197752015-10-29 14:58:09 +010078/* BPF syscall commands, see bpf(2) man-page for details. */
Alexei Starovoitov99c55f72014-09-26 00:16:57 -070079enum bpf_cmd {
Alexei Starovoitov99c55f72014-09-26 00:16:57 -070080 BPF_MAP_CREATE,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070081 BPF_MAP_LOOKUP_ELEM,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070082 BPF_MAP_UPDATE_ELEM,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070083 BPF_MAP_DELETE_ELEM,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070084 BPF_MAP_GET_NEXT_KEY,
Alexei Starovoitov09756af2014-09-26 00:17:00 -070085 BPF_PROG_LOAD,
Daniel Borkmannb2197752015-10-29 14:58:09 +010086 BPF_OBJ_PIN,
87 BPF_OBJ_GET,
Daniel Mackf4324552016-11-23 16:52:27 +010088 BPF_PROG_ATTACH,
89 BPF_PROG_DETACH,
Alexei Starovoitov1cf1cae2017-03-30 21:45:38 -070090 BPF_PROG_TEST_RUN,
Martin KaFai Lau34ad5582017-06-05 12:15:48 -070091 BPF_PROG_GET_NEXT_ID,
92 BPF_MAP_GET_NEXT_ID,
Martin KaFai Laub16d9aa2017-06-05 12:15:49 -070093 BPF_PROG_GET_FD_BY_ID,
Martin KaFai Laubd5f5f4e2017-06-05 12:15:50 -070094 BPF_MAP_GET_FD_BY_ID,
Martin KaFai Lau1e270972017-06-05 12:15:52 -070095 BPF_OBJ_GET_INFO_BY_FD,
Alexei Starovoitov468e2f62017-10-02 22:50:22 -070096 BPF_PROG_QUERY,
Alexei Starovoitovc4f66992018-03-28 12:05:37 -070097 BPF_RAW_TRACEPOINT_OPEN,
Martin KaFai Lauf56a6532018-04-18 15:56:01 -070098 BPF_BTF_LOAD,
Alexei Starovoitov99c55f72014-09-26 00:16:57 -070099};
100
101enum bpf_map_type {
102 BPF_MAP_TYPE_UNSPEC,
Alexei Starovoitov0f8e4bd2014-11-13 17:36:45 -0800103 BPF_MAP_TYPE_HASH,
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800104 BPF_MAP_TYPE_ARRAY,
Alexei Starovoitov04fd61a2015-05-19 16:59:03 -0700105 BPF_MAP_TYPE_PROG_ARRAY,
Kaixu Xiaea317b22015-08-06 07:02:34 +0000106 BPF_MAP_TYPE_PERF_EVENT_ARRAY,
Alexei Starovoitov824bd0c2016-02-01 22:39:53 -0800107 BPF_MAP_TYPE_PERCPU_HASH,
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800108 BPF_MAP_TYPE_PERCPU_ARRAY,
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -0800109 BPF_MAP_TYPE_STACK_TRACE,
Martin KaFai Lau4ed8ec52016-06-30 10:28:43 -0700110 BPF_MAP_TYPE_CGROUP_ARRAY,
Martin KaFai Lau29ba7322016-11-11 10:55:09 -0800111 BPF_MAP_TYPE_LRU_HASH,
Martin KaFai Lau8f844932016-11-11 10:55:10 -0800112 BPF_MAP_TYPE_LRU_PERCPU_HASH,
Daniel Mackb95a5c42017-01-21 17:26:11 +0100113 BPF_MAP_TYPE_LPM_TRIE,
Martin KaFai Lau56f668d2017-03-22 10:00:33 -0700114 BPF_MAP_TYPE_ARRAY_OF_MAPS,
Martin KaFai Laubcc6b1b2017-03-22 10:00:34 -0700115 BPF_MAP_TYPE_HASH_OF_MAPS,
John Fastabend546ac1f2017-07-17 09:28:56 -0700116 BPF_MAP_TYPE_DEVMAP,
John Fastabend174a79f2017-08-15 22:32:47 -0700117 BPF_MAP_TYPE_SOCKMAP,
Jesper Dangaard Brouer6710e112017-10-16 12:19:28 +0200118 BPF_MAP_TYPE_CPUMAP,
Björn Töpelfbfc5042018-05-02 13:01:28 +0200119 BPF_MAP_TYPE_XSKMAP,
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700120};
121
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700122enum bpf_prog_type {
123 BPF_PROG_TYPE_UNSPEC,
Alexei Starovoitovddd872b2014-12-01 15:06:34 -0800124 BPF_PROG_TYPE_SOCKET_FILTER,
Alexei Starovoitov25415172015-03-25 12:49:20 -0700125 BPF_PROG_TYPE_KPROBE,
Daniel Borkmann96be4322015-03-01 12:31:46 +0100126 BPF_PROG_TYPE_SCHED_CLS,
Daniel Borkmann94caee82015-03-20 15:11:11 +0100127 BPF_PROG_TYPE_SCHED_ACT,
Alexei Starovoitov98b5c2c2016-04-06 18:43:25 -0700128 BPF_PROG_TYPE_TRACEPOINT,
Brenden Blanco6a773a12016-07-19 12:16:47 -0700129 BPF_PROG_TYPE_XDP,
Alexei Starovoitov0515e592016-09-01 18:37:22 -0700130 BPF_PROG_TYPE_PERF_EVENT,
Daniel Mack0e336612016-11-23 16:52:25 +0100131 BPF_PROG_TYPE_CGROUP_SKB,
David Ahern610236582016-12-01 08:48:04 -0800132 BPF_PROG_TYPE_CGROUP_SOCK,
Thomas Graf3a0af8f2016-11-30 17:10:10 +0100133 BPF_PROG_TYPE_LWT_IN,
134 BPF_PROG_TYPE_LWT_OUT,
135 BPF_PROG_TYPE_LWT_XMIT,
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700136 BPF_PROG_TYPE_SOCK_OPS,
John Fastabendb005fd12017-08-15 22:31:58 -0700137 BPF_PROG_TYPE_SK_SKB,
Roman Gushchinebc614f2017-11-05 08:15:32 -0500138 BPF_PROG_TYPE_CGROUP_DEVICE,
John Fastabend4f738ad2018-03-18 12:57:10 -0700139 BPF_PROG_TYPE_SK_MSG,
Alexei Starovoitovc4f66992018-03-28 12:05:37 -0700140 BPF_PROG_TYPE_RAW_TRACEPOINT,
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700141 BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700142};
143
Daniel Mack0e336612016-11-23 16:52:25 +0100144enum bpf_attach_type {
145 BPF_CGROUP_INET_INGRESS,
146 BPF_CGROUP_INET_EGRESS,
David Ahern610236582016-12-01 08:48:04 -0800147 BPF_CGROUP_INET_SOCK_CREATE,
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700148 BPF_CGROUP_SOCK_OPS,
John Fastabend464bc0f2017-08-28 07:10:04 -0700149 BPF_SK_SKB_STREAM_PARSER,
150 BPF_SK_SKB_STREAM_VERDICT,
Roman Gushchinebc614f2017-11-05 08:15:32 -0500151 BPF_CGROUP_DEVICE,
John Fastabend4f738ad2018-03-18 12:57:10 -0700152 BPF_SK_MSG_VERDICT,
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700153 BPF_CGROUP_INET4_BIND,
154 BPF_CGROUP_INET6_BIND,
Andrey Ignatovd74bad42018-03-30 15:08:05 -0700155 BPF_CGROUP_INET4_CONNECT,
156 BPF_CGROUP_INET6_CONNECT,
Andrey Ignatovaac3fc32018-03-30 15:08:07 -0700157 BPF_CGROUP_INET4_POST_BIND,
158 BPF_CGROUP_INET6_POST_BIND,
Daniel Mack0e336612016-11-23 16:52:25 +0100159 __MAX_BPF_ATTACH_TYPE
160};
161
162#define MAX_BPF_ATTACH_TYPE __MAX_BPF_ATTACH_TYPE
163
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700164/* cgroup-bpf attach flags used in BPF_PROG_ATTACH command
165 *
166 * NONE(default): No further bpf programs allowed in the subtree.
167 *
168 * BPF_F_ALLOW_OVERRIDE: If a sub-cgroup installs some bpf program,
169 * the program in this cgroup yields to sub-cgroup program.
170 *
171 * BPF_F_ALLOW_MULTI: If a sub-cgroup installs some bpf program,
172 * that cgroup program gets run in addition to the program in this cgroup.
173 *
174 * Only one program is allowed to be attached to a cgroup with
175 * NONE or BPF_F_ALLOW_OVERRIDE flag.
176 * Attaching another program on top of NONE or BPF_F_ALLOW_OVERRIDE will
177 * release old program and attach the new one. Attach flags has to match.
178 *
179 * Multiple programs are allowed to be attached to a cgroup with
180 * BPF_F_ALLOW_MULTI flag. They are executed in FIFO order
181 * (those that were attached first, run first)
182 * The programs of sub-cgroup are executed first, then programs of
183 * this cgroup and then programs of parent cgroup.
184 * When children program makes decision (like picking TCP CA or sock bind)
185 * parent program has a chance to override it.
186 *
187 * A cgroup with MULTI or OVERRIDE flag allows any attach flags in sub-cgroups.
188 * A cgroup with NONE doesn't allow any programs in sub-cgroups.
189 * Ex1:
190 * cgrp1 (MULTI progs A, B) ->
191 * cgrp2 (OVERRIDE prog C) ->
192 * cgrp3 (MULTI prog D) ->
193 * cgrp4 (OVERRIDE prog E) ->
194 * cgrp5 (NONE prog F)
195 * the event in cgrp5 triggers execution of F,D,A,B in that order.
196 * if prog F is detached, the execution is E,D,A,B
197 * if prog F and D are detached, the execution is E,A,B
198 * if prog F, E and D are detached, the execution is C,A,B
199 *
200 * All eligible programs are executed regardless of return code from
201 * earlier programs.
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800202 */
203#define BPF_F_ALLOW_OVERRIDE (1U << 0)
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700204#define BPF_F_ALLOW_MULTI (1U << 1)
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800205
David S. Millere07b98d2017-05-10 11:38:07 -0700206/* If BPF_F_STRICT_ALIGNMENT is used in BPF_PROG_LOAD command, the
207 * verifier will perform strict alignment checking as if the kernel
208 * has been built with CONFIG_EFFICIENT_UNALIGNED_ACCESS not set,
209 * and NET_IP_ALIGN defined to 2.
210 */
211#define BPF_F_STRICT_ALIGNMENT (1U << 0)
212
Alexei Starovoitovcc8b0b92017-12-14 17:55:05 -0800213/* when bpf_ldimm64->src_reg == BPF_PSEUDO_MAP_FD, bpf_ldimm64->imm == fd */
Daniel Borkmannf1a66f82015-03-01 12:31:43 +0100214#define BPF_PSEUDO_MAP_FD 1
215
Alexei Starovoitovcc8b0b92017-12-14 17:55:05 -0800216/* when bpf_call->src_reg == BPF_PSEUDO_CALL, bpf_call->imm == pc-relative
217 * offset to another bpf function
218 */
219#define BPF_PSEUDO_CALL 1
220
Alexei Starovoitov3274f522014-11-13 17:36:44 -0800221/* flags for BPF_MAP_UPDATE_ELEM command */
222#define BPF_ANY 0 /* create new element or update existing */
223#define BPF_NOEXIST 1 /* create new element if it didn't exist */
224#define BPF_EXIST 2 /* update existing element */
225
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700226/* flags for BPF_MAP_CREATE command */
Alexei Starovoitov6c905982016-03-07 21:57:15 -0800227#define BPF_F_NO_PREALLOC (1U << 0)
Martin KaFai Lau29ba7322016-11-11 10:55:09 -0800228/* Instead of having one common LRU list in the
Martin KaFai Lau8f844932016-11-11 10:55:10 -0800229 * BPF_MAP_TYPE_LRU_[PERCPU_]HASH map, use a percpu LRU list
Martin KaFai Lau29ba7322016-11-11 10:55:09 -0800230 * which can scale and perform better.
231 * Note, the LRU nodes (including free nodes) cannot be moved
232 * across different LRU lists.
233 */
234#define BPF_F_NO_COMMON_LRU (1U << 1)
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700235/* Specify numa node during map creation */
236#define BPF_F_NUMA_NODE (1U << 2)
Alexei Starovoitov6c905982016-03-07 21:57:15 -0800237
Alexei Starovoitov468e2f62017-10-02 22:50:22 -0700238/* flags for BPF_PROG_QUERY */
239#define BPF_F_QUERY_EFFECTIVE (1U << 0)
240
Martin KaFai Laucb4d2b32017-09-27 14:37:52 -0700241#define BPF_OBJ_NAME_LEN 16U
242
Chenbo Feng6e71b042017-10-18 13:00:22 -0700243/* Flags for accessing BPF object */
244#define BPF_F_RDONLY (1U << 3)
245#define BPF_F_WRONLY (1U << 4)
246
Song Liu615755a2018-03-14 10:23:21 -0700247/* Flag for stack_map, store build_id+offset instead of pointer */
248#define BPF_F_STACK_BUILD_ID (1U << 5)
249
250enum bpf_stack_build_id_status {
251 /* user space need an empty entry to identify end of a trace */
252 BPF_STACK_BUILD_ID_EMPTY = 0,
253 /* with valid build_id and offset */
254 BPF_STACK_BUILD_ID_VALID = 1,
255 /* couldn't get build_id, fallback to ip */
256 BPF_STACK_BUILD_ID_IP = 2,
257};
258
259#define BPF_BUILD_ID_SIZE 20
260struct bpf_stack_build_id {
261 __s32 status;
262 unsigned char build_id[BPF_BUILD_ID_SIZE];
263 union {
264 __u64 offset;
265 __u64 ip;
266 };
267};
268
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700269union bpf_attr {
270 struct { /* anonymous struct used by BPF_MAP_CREATE command */
271 __u32 map_type; /* one of enum bpf_map_type */
272 __u32 key_size; /* size of key in bytes */
273 __u32 value_size; /* size of value in bytes */
274 __u32 max_entries; /* max number of entries in a map */
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700275 __u32 map_flags; /* BPF_MAP_CREATE related
276 * flags defined above.
277 */
Martin KaFai Lau56f668d2017-03-22 10:00:33 -0700278 __u32 inner_map_fd; /* fd pointing to the inner map */
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700279 __u32 numa_node; /* numa node (effective only if
280 * BPF_F_NUMA_NODE is set).
281 */
Martin KaFai Lau067cae42017-10-05 21:52:12 -0700282 char map_name[BPF_OBJ_NAME_LEN];
Jakub Kicinskia3884572018-01-11 20:29:09 -0800283 __u32 map_ifindex; /* ifindex of netdev to create on */
Martin KaFai Laua26ca7c2018-04-18 15:56:03 -0700284 __u32 btf_fd; /* fd pointing to a BTF type data */
285 __u32 btf_key_id; /* BTF type_id of the key */
286 __u32 btf_value_id; /* BTF type_id of the value */
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700287 };
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -0700288
289 struct { /* anonymous struct used by BPF_MAP_*_ELEM commands */
290 __u32 map_fd;
291 __aligned_u64 key;
292 union {
293 __aligned_u64 value;
294 __aligned_u64 next_key;
295 };
Alexei Starovoitov3274f522014-11-13 17:36:44 -0800296 __u64 flags;
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -0700297 };
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700298
299 struct { /* anonymous struct used by BPF_PROG_LOAD command */
300 __u32 prog_type; /* one of enum bpf_prog_type */
301 __u32 insn_cnt;
302 __aligned_u64 insns;
303 __aligned_u64 license;
Alexei Starovoitovcbd35702014-09-26 00:17:03 -0700304 __u32 log_level; /* verbosity level of verifier */
305 __u32 log_size; /* size of user buffer */
306 __aligned_u64 log_buf; /* user supplied buffer */
Alexei Starovoitov25415172015-03-25 12:49:20 -0700307 __u32 kern_version; /* checked when prog_type=kprobe */
David S. Millere07b98d2017-05-10 11:38:07 -0700308 __u32 prog_flags;
Martin KaFai Lau067cae42017-10-05 21:52:12 -0700309 char prog_name[BPF_OBJ_NAME_LEN];
Jakub Kicinski1f6f4cb2017-11-20 15:21:53 -0800310 __u32 prog_ifindex; /* ifindex of netdev to prep for */
Andrey Ignatov5e43f892018-03-30 15:08:00 -0700311 /* For some prog types expected attach type must be known at
312 * load time to verify attach type specific parts of prog
313 * (context accesses, allowed helpers, etc).
314 */
315 __u32 expected_attach_type;
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700316 };
Daniel Borkmannb2197752015-10-29 14:58:09 +0100317
318 struct { /* anonymous struct used by BPF_OBJ_* commands */
319 __aligned_u64 pathname;
320 __u32 bpf_fd;
Chenbo Feng6e71b042017-10-18 13:00:22 -0700321 __u32 file_flags;
Daniel Borkmannb2197752015-10-29 14:58:09 +0100322 };
Daniel Mackf4324552016-11-23 16:52:27 +0100323
324 struct { /* anonymous struct used by BPF_PROG_ATTACH/DETACH commands */
325 __u32 target_fd; /* container object to attach to */
326 __u32 attach_bpf_fd; /* eBPF program to attach */
327 __u32 attach_type;
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800328 __u32 attach_flags;
Daniel Mackf4324552016-11-23 16:52:27 +0100329 };
Alexei Starovoitov1cf1cae2017-03-30 21:45:38 -0700330
331 struct { /* anonymous struct used by BPF_PROG_TEST_RUN command */
332 __u32 prog_fd;
333 __u32 retval;
334 __u32 data_size_in;
335 __u32 data_size_out;
336 __aligned_u64 data_in;
337 __aligned_u64 data_out;
338 __u32 repeat;
339 __u32 duration;
340 } test;
Martin KaFai Lau34ad5582017-06-05 12:15:48 -0700341
Martin KaFai Laub16d9aa2017-06-05 12:15:49 -0700342 struct { /* anonymous struct used by BPF_*_GET_*_ID */
343 union {
344 __u32 start_id;
345 __u32 prog_id;
Martin KaFai Laubd5f5f4e2017-06-05 12:15:50 -0700346 __u32 map_id;
Martin KaFai Laub16d9aa2017-06-05 12:15:49 -0700347 };
Martin KaFai Lau34ad5582017-06-05 12:15:48 -0700348 __u32 next_id;
Chenbo Feng6e71b042017-10-18 13:00:22 -0700349 __u32 open_flags;
Martin KaFai Lau34ad5582017-06-05 12:15:48 -0700350 };
Martin KaFai Lau1e270972017-06-05 12:15:52 -0700351
352 struct { /* anonymous struct used by BPF_OBJ_GET_INFO_BY_FD */
353 __u32 bpf_fd;
354 __u32 info_len;
355 __aligned_u64 info;
356 } info;
Alexei Starovoitov468e2f62017-10-02 22:50:22 -0700357
358 struct { /* anonymous struct used by BPF_PROG_QUERY command */
359 __u32 target_fd; /* container object to query */
360 __u32 attach_type;
361 __u32 query_flags;
362 __u32 attach_flags;
363 __aligned_u64 prog_ids;
364 __u32 prog_cnt;
365 } query;
Alexei Starovoitovc4f66992018-03-28 12:05:37 -0700366
367 struct {
368 __u64 name;
369 __u32 prog_fd;
370 } raw_tracepoint;
Martin KaFai Lauf56a6532018-04-18 15:56:01 -0700371
372 struct { /* anonymous struct for BPF_BTF_LOAD */
373 __aligned_u64 btf;
374 __aligned_u64 btf_log_buf;
375 __u32 btf_size;
376 __u32 btf_log_size;
377 __u32 btf_log_level;
378 };
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700379} __attribute__((aligned(8)));
380
Quentin Monnet56a092c2018-04-25 18:16:52 +0100381/* The description below is an attempt at providing documentation to eBPF
382 * developers about the multiple available eBPF helper functions. It can be
383 * parsed and used to produce a manual page. The workflow is the following,
384 * and requires the rst2man utility:
Thomas Grafebb676d2016-10-27 11:23:51 +0200385 *
Quentin Monnet56a092c2018-04-25 18:16:52 +0100386 * $ ./scripts/bpf_helpers_doc.py \
387 * --filename include/uapi/linux/bpf.h > /tmp/bpf-helpers.rst
388 * $ rst2man /tmp/bpf-helpers.rst > /tmp/bpf-helpers.7
389 * $ man /tmp/bpf-helpers.7
Thomas Grafebb676d2016-10-27 11:23:51 +0200390 *
Quentin Monnet56a092c2018-04-25 18:16:52 +0100391 * Note that in order to produce this external documentation, some RST
392 * formatting is used in the descriptions to get "bold" and "italics" in
393 * manual pages. Also note that the few trailing white spaces are
394 * intentional, removing them would break paragraphs for rst2man.
Thomas Grafebb676d2016-10-27 11:23:51 +0200395 *
Quentin Monnet56a092c2018-04-25 18:16:52 +0100396 * Start of BPF helper function descriptions:
Quentin Monnetad4a5222018-04-25 18:16:53 +0100397 *
398 * void *bpf_map_lookup_elem(struct bpf_map *map, const void *key)
399 * Description
400 * Perform a lookup in *map* for an entry associated to *key*.
401 * Return
402 * Map value associated to *key*, or **NULL** if no entry was
403 * found.
404 *
405 * int bpf_map_update_elem(struct bpf_map *map, const void *key, const void *value, u64 flags)
406 * Description
407 * Add or update the value of the entry associated to *key* in
408 * *map* with *value*. *flags* is one of:
409 *
410 * **BPF_NOEXIST**
411 * The entry for *key* must not exist in the map.
412 * **BPF_EXIST**
413 * The entry for *key* must already exist in the map.
414 * **BPF_ANY**
415 * No condition on the existence of the entry for *key*.
416 *
417 * Flag value **BPF_NOEXIST** cannot be used for maps of types
418 * **BPF_MAP_TYPE_ARRAY** or **BPF_MAP_TYPE_PERCPU_ARRAY** (all
419 * elements always exist), the helper would return an error.
420 * Return
421 * 0 on success, or a negative error in case of failure.
422 *
423 * int bpf_map_delete_elem(struct bpf_map *map, const void *key)
424 * Description
425 * Delete entry with *key* from *map*.
426 * Return
427 * 0 on success, or a negative error in case of failure.
428 *
429 * int bpf_probe_read(void *dst, u32 size, const void *src)
430 * Description
431 * For tracing programs, safely attempt to read *size* bytes from
432 * address *src* and store the data in *dst*.
433 * Return
434 * 0 on success, or a negative error in case of failure.
435 *
436 * u64 bpf_ktime_get_ns(void)
437 * Description
438 * Return the time elapsed since system boot, in nanoseconds.
439 * Return
440 * Current *ktime*.
441 *
442 * int bpf_trace_printk(const char *fmt, u32 fmt_size, ...)
443 * Description
444 * This helper is a "printk()-like" facility for debugging. It
445 * prints a message defined by format *fmt* (of size *fmt_size*)
446 * to file *\/sys/kernel/debug/tracing/trace* from DebugFS, if
447 * available. It can take up to three additional **u64**
448 * arguments (as an eBPF helpers, the total number of arguments is
449 * limited to five).
450 *
451 * Each time the helper is called, it appends a line to the trace.
452 * The format of the trace is customizable, and the exact output
453 * one will get depends on the options set in
454 * *\/sys/kernel/debug/tracing/trace_options* (see also the
455 * *README* file under the same directory). However, it usually
456 * defaults to something like:
457 *
458 * ::
459 *
460 * telnet-470 [001] .N.. 419421.045894: 0x00000001: <formatted msg>
461 *
462 * In the above:
463 *
464 * * ``telnet`` is the name of the current task.
465 * * ``470`` is the PID of the current task.
466 * * ``001`` is the CPU number on which the task is
467 * running.
468 * * In ``.N..``, each character refers to a set of
469 * options (whether irqs are enabled, scheduling
470 * options, whether hard/softirqs are running, level of
471 * preempt_disabled respectively). **N** means that
472 * **TIF_NEED_RESCHED** and **PREEMPT_NEED_RESCHED**
473 * are set.
474 * * ``419421.045894`` is a timestamp.
475 * * ``0x00000001`` is a fake value used by BPF for the
476 * instruction pointer register.
477 * * ``<formatted msg>`` is the message formatted with
478 * *fmt*.
479 *
480 * The conversion specifiers supported by *fmt* are similar, but
481 * more limited than for printk(). They are **%d**, **%i**,
482 * **%u**, **%x**, **%ld**, **%li**, **%lu**, **%lx**, **%lld**,
483 * **%lli**, **%llu**, **%llx**, **%p**, **%s**. No modifier (size
484 * of field, padding with zeroes, etc.) is available, and the
485 * helper will return **-EINVAL** (but print nothing) if it
486 * encounters an unknown specifier.
487 *
488 * Also, note that **bpf_trace_printk**\ () is slow, and should
489 * only be used for debugging purposes. For this reason, a notice
490 * bloc (spanning several lines) is printed to kernel logs and
491 * states that the helper should not be used "for production use"
492 * the first time this helper is used (or more precisely, when
493 * **trace_printk**\ () buffers are allocated). For passing values
494 * to user space, perf events should be preferred.
495 * Return
496 * The number of bytes written to the buffer, or a negative error
497 * in case of failure.
498 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100499 * u32 bpf_get_prandom_u32(void)
500 * Description
501 * Get a pseudo-random number.
502 *
503 * From a security point of view, this helper uses its own
504 * pseudo-random internal state, and cannot be used to infer the
505 * seed of other random functions in the kernel. However, it is
506 * essential to note that the generator used by the helper is not
507 * cryptographically secure.
508 * Return
509 * A random 32-bit unsigned value.
510 *
511 * u32 bpf_get_smp_processor_id(void)
512 * Description
513 * Get the SMP (symmetric multiprocessing) processor id. Note that
514 * all programs run with preemption disabled, which means that the
515 * SMP processor id is stable during all the execution of the
516 * program.
517 * Return
518 * The SMP id of the processor running the program.
519 *
Quentin Monnetad4a5222018-04-25 18:16:53 +0100520 * int bpf_skb_store_bytes(struct sk_buff *skb, u32 offset, const void *from, u32 len, u64 flags)
521 * Description
522 * Store *len* bytes from address *from* into the packet
523 * associated to *skb*, at *offset*. *flags* are a combination of
524 * **BPF_F_RECOMPUTE_CSUM** (automatically recompute the
525 * checksum for the packet after storing the bytes) and
526 * **BPF_F_INVALIDATE_HASH** (set *skb*\ **->hash**, *skb*\
527 * **->swhash** and *skb*\ **->l4hash** to 0).
528 *
529 * A call to this helper is susceptible to change the underlaying
530 * packet buffer. Therefore, at load time, all checks on pointers
531 * previously done by the verifier are invalidated and must be
532 * performed again, if the helper is used in combination with
533 * direct packet access.
534 * Return
535 * 0 on success, or a negative error in case of failure.
536 *
537 * int bpf_l3_csum_replace(struct sk_buff *skb, u32 offset, u64 from, u64 to, u64 size)
538 * Description
539 * Recompute the layer 3 (e.g. IP) checksum for the packet
540 * associated to *skb*. Computation is incremental, so the helper
541 * must know the former value of the header field that was
542 * modified (*from*), the new value of this field (*to*), and the
543 * number of bytes (2 or 4) for this field, stored in *size*.
544 * Alternatively, it is possible to store the difference between
545 * the previous and the new values of the header field in *to*, by
546 * setting *from* and *size* to 0. For both methods, *offset*
547 * indicates the location of the IP checksum within the packet.
548 *
549 * This helper works in combination with **bpf_csum_diff**\ (),
550 * which does not update the checksum in-place, but offers more
551 * flexibility and can handle sizes larger than 2 or 4 for the
552 * checksum to update.
553 *
554 * A call to this helper is susceptible to change the underlaying
555 * packet buffer. Therefore, at load time, all checks on pointers
556 * previously done by the verifier are invalidated and must be
557 * performed again, if the helper is used in combination with
558 * direct packet access.
559 * Return
560 * 0 on success, or a negative error in case of failure.
561 *
562 * int bpf_l4_csum_replace(struct sk_buff *skb, u32 offset, u64 from, u64 to, u64 flags)
563 * Description
564 * Recompute the layer 4 (e.g. TCP, UDP or ICMP) checksum for the
565 * packet associated to *skb*. Computation is incremental, so the
566 * helper must know the former value of the header field that was
567 * modified (*from*), the new value of this field (*to*), and the
568 * number of bytes (2 or 4) for this field, stored on the lowest
569 * four bits of *flags*. Alternatively, it is possible to store
570 * the difference between the previous and the new values of the
571 * header field in *to*, by setting *from* and the four lowest
572 * bits of *flags* to 0. For both methods, *offset* indicates the
573 * location of the IP checksum within the packet. In addition to
574 * the size of the field, *flags* can be added (bitwise OR) actual
575 * flags. With **BPF_F_MARK_MANGLED_0**, a null checksum is left
576 * untouched (unless **BPF_F_MARK_ENFORCE** is added as well), and
577 * for updates resulting in a null checksum the value is set to
578 * **CSUM_MANGLED_0** instead. Flag **BPF_F_PSEUDO_HDR** indicates
579 * the checksum is to be computed against a pseudo-header.
580 *
581 * This helper works in combination with **bpf_csum_diff**\ (),
582 * which does not update the checksum in-place, but offers more
583 * flexibility and can handle sizes larger than 2 or 4 for the
584 * checksum to update.
585 *
586 * A call to this helper is susceptible to change the underlaying
587 * packet buffer. Therefore, at load time, all checks on pointers
588 * previously done by the verifier are invalidated and must be
589 * performed again, if the helper is used in combination with
590 * direct packet access.
591 * Return
592 * 0 on success, or a negative error in case of failure.
593 *
594 * int bpf_tail_call(void *ctx, struct bpf_map *prog_array_map, u32 index)
595 * Description
596 * This special helper is used to trigger a "tail call", or in
597 * other words, to jump into another eBPF program. The same stack
598 * frame is used (but values on stack and in registers for the
599 * caller are not accessible to the callee). This mechanism allows
600 * for program chaining, either for raising the maximum number of
601 * available eBPF instructions, or to execute given programs in
602 * conditional blocks. For security reasons, there is an upper
603 * limit to the number of successive tail calls that can be
604 * performed.
605 *
606 * Upon call of this helper, the program attempts to jump into a
607 * program referenced at index *index* in *prog_array_map*, a
608 * special map of type **BPF_MAP_TYPE_PROG_ARRAY**, and passes
609 * *ctx*, a pointer to the context.
610 *
611 * If the call succeeds, the kernel immediately runs the first
612 * instruction of the new program. This is not a function call,
613 * and it never returns to the previous program. If the call
614 * fails, then the helper has no effect, and the caller continues
615 * to run its subsequent instructions. A call can fail if the
616 * destination program for the jump does not exist (i.e. *index*
617 * is superior to the number of entries in *prog_array_map*), or
618 * if the maximum number of tail calls has been reached for this
619 * chain of programs. This limit is defined in the kernel by the
620 * macro **MAX_TAIL_CALL_CNT** (not accessible to user space),
621 * which is currently set to 32.
622 * Return
623 * 0 on success, or a negative error in case of failure.
624 *
625 * int bpf_clone_redirect(struct sk_buff *skb, u32 ifindex, u64 flags)
626 * Description
627 * Clone and redirect the packet associated to *skb* to another
628 * net device of index *ifindex*. Both ingress and egress
629 * interfaces can be used for redirection. The **BPF_F_INGRESS**
630 * value in *flags* is used to make the distinction (ingress path
631 * is selected if the flag is present, egress path otherwise).
632 * This is the only flag supported for now.
633 *
634 * In comparison with **bpf_redirect**\ () helper,
635 * **bpf_clone_redirect**\ () has the associated cost of
636 * duplicating the packet buffer, but this can be executed out of
637 * the eBPF program. Conversely, **bpf_redirect**\ () is more
638 * efficient, but it is handled through an action code where the
639 * redirection happens only after the eBPF program has returned.
640 *
641 * A call to this helper is susceptible to change the underlaying
642 * packet buffer. Therefore, at load time, all checks on pointers
643 * previously done by the verifier are invalidated and must be
644 * performed again, if the helper is used in combination with
645 * direct packet access.
646 * Return
647 * 0 on success, or a negative error in case of failure.
Quentin Monnetc456dec2018-04-25 18:16:54 +0100648 *
649 * u64 bpf_get_current_pid_tgid(void)
650 * Return
651 * A 64-bit integer containing the current tgid and pid, and
652 * created as such:
653 * *current_task*\ **->tgid << 32 \|**
654 * *current_task*\ **->pid**.
655 *
656 * u64 bpf_get_current_uid_gid(void)
657 * Return
658 * A 64-bit integer containing the current GID and UID, and
659 * created as such: *current_gid* **<< 32 \|** *current_uid*.
660 *
661 * int bpf_get_current_comm(char *buf, u32 size_of_buf)
662 * Description
663 * Copy the **comm** attribute of the current task into *buf* of
664 * *size_of_buf*. The **comm** attribute contains the name of
665 * the executable (excluding the path) for the current task. The
666 * *size_of_buf* must be strictly positive. On success, the
667 * helper makes sure that the *buf* is NUL-terminated. On failure,
668 * it is filled with zeroes.
669 * Return
670 * 0 on success, or a negative error in case of failure.
671 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100672 * u32 bpf_get_cgroup_classid(struct sk_buff *skb)
673 * Description
674 * Retrieve the classid for the current task, i.e. for the net_cls
675 * cgroup to which *skb* belongs.
676 *
677 * This helper can be used on TC egress path, but not on ingress.
678 *
679 * The net_cls cgroup provides an interface to tag network packets
680 * based on a user-provided identifier for all traffic coming from
681 * the tasks belonging to the related cgroup. See also the related
682 * kernel documentation, available from the Linux sources in file
683 * *Documentation/cgroup-v1/net_cls.txt*.
684 *
685 * The Linux kernel has two versions for cgroups: there are
686 * cgroups v1 and cgroups v2. Both are available to users, who can
687 * use a mixture of them, but note that the net_cls cgroup is for
688 * cgroup v1 only. This makes it incompatible with BPF programs
689 * run on cgroups, which is a cgroup-v2-only feature (a socket can
690 * only hold data for one version of cgroups at a time).
691 *
692 * This helper is only available is the kernel was compiled with
693 * the **CONFIG_CGROUP_NET_CLASSID** configuration option set to
694 * "**y**" or to "**m**".
695 * Return
696 * The classid, or 0 for the default unconfigured classid.
697 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100698 * int bpf_skb_vlan_push(struct sk_buff *skb, __be16 vlan_proto, u16 vlan_tci)
699 * Description
700 * Push a *vlan_tci* (VLAN tag control information) of protocol
701 * *vlan_proto* to the packet associated to *skb*, then update
702 * the checksum. Note that if *vlan_proto* is different from
703 * **ETH_P_8021Q** and **ETH_P_8021AD**, it is considered to
704 * be **ETH_P_8021Q**.
705 *
706 * A call to this helper is susceptible to change the underlaying
707 * packet buffer. Therefore, at load time, all checks on pointers
708 * previously done by the verifier are invalidated and must be
709 * performed again, if the helper is used in combination with
710 * direct packet access.
711 * Return
712 * 0 on success, or a negative error in case of failure.
713 *
714 * int bpf_skb_vlan_pop(struct sk_buff *skb)
715 * Description
716 * Pop a VLAN header from the packet associated to *skb*.
717 *
718 * A call to this helper is susceptible to change the underlaying
719 * packet buffer. Therefore, at load time, all checks on pointers
720 * previously done by the verifier are invalidated and must be
721 * performed again, if the helper is used in combination with
722 * direct packet access.
723 * Return
724 * 0 on success, or a negative error in case of failure.
725 *
726 * int bpf_skb_get_tunnel_key(struct sk_buff *skb, struct bpf_tunnel_key *key, u32 size, u64 flags)
727 * Description
728 * Get tunnel metadata. This helper takes a pointer *key* to an
729 * empty **struct bpf_tunnel_key** of **size**, that will be
730 * filled with tunnel metadata for the packet associated to *skb*.
731 * The *flags* can be set to **BPF_F_TUNINFO_IPV6**, which
732 * indicates that the tunnel is based on IPv6 protocol instead of
733 * IPv4.
734 *
735 * The **struct bpf_tunnel_key** is an object that generalizes the
736 * principal parameters used by various tunneling protocols into a
737 * single struct. This way, it can be used to easily make a
738 * decision based on the contents of the encapsulation header,
739 * "summarized" in this struct. In particular, it holds the IP
740 * address of the remote end (IPv4 or IPv6, depending on the case)
741 * in *key*\ **->remote_ipv4** or *key*\ **->remote_ipv6**. Also,
742 * this struct exposes the *key*\ **->tunnel_id**, which is
743 * generally mapped to a VNI (Virtual Network Identifier), making
744 * it programmable together with the **bpf_skb_set_tunnel_key**\
745 * () helper.
746 *
747 * Let's imagine that the following code is part of a program
748 * attached to the TC ingress interface, on one end of a GRE
749 * tunnel, and is supposed to filter out all messages coming from
750 * remote ends with IPv4 address other than 10.0.0.1:
751 *
752 * ::
753 *
754 * int ret;
755 * struct bpf_tunnel_key key = {};
756 *
757 * ret = bpf_skb_get_tunnel_key(skb, &key, sizeof(key), 0);
758 * if (ret < 0)
759 * return TC_ACT_SHOT; // drop packet
760 *
761 * if (key.remote_ipv4 != 0x0a000001)
762 * return TC_ACT_SHOT; // drop packet
763 *
764 * return TC_ACT_OK; // accept packet
765 *
766 * This interface can also be used with all encapsulation devices
767 * that can operate in "collect metadata" mode: instead of having
768 * one network device per specific configuration, the "collect
769 * metadata" mode only requires a single device where the
770 * configuration can be extracted from this helper.
771 *
772 * This can be used together with various tunnels such as VXLan,
773 * Geneve, GRE or IP in IP (IPIP).
774 * Return
775 * 0 on success, or a negative error in case of failure.
776 *
777 * int bpf_skb_set_tunnel_key(struct sk_buff *skb, struct bpf_tunnel_key *key, u32 size, u64 flags)
778 * Description
779 * Populate tunnel metadata for packet associated to *skb.* The
780 * tunnel metadata is set to the contents of *key*, of *size*. The
781 * *flags* can be set to a combination of the following values:
782 *
783 * **BPF_F_TUNINFO_IPV6**
784 * Indicate that the tunnel is based on IPv6 protocol
785 * instead of IPv4.
786 * **BPF_F_ZERO_CSUM_TX**
787 * For IPv4 packets, add a flag to tunnel metadata
788 * indicating that checksum computation should be skipped
789 * and checksum set to zeroes.
790 * **BPF_F_DONT_FRAGMENT**
791 * Add a flag to tunnel metadata indicating that the
792 * packet should not be fragmented.
793 * **BPF_F_SEQ_NUMBER**
794 * Add a flag to tunnel metadata indicating that a
795 * sequence number should be added to tunnel header before
796 * sending the packet. This flag was added for GRE
797 * encapsulation, but might be used with other protocols
798 * as well in the future.
799 *
800 * Here is a typical usage on the transmit path:
801 *
802 * ::
803 *
804 * struct bpf_tunnel_key key;
805 * populate key ...
806 * bpf_skb_set_tunnel_key(skb, &key, sizeof(key), 0);
807 * bpf_clone_redirect(skb, vxlan_dev_ifindex, 0);
808 *
809 * See also the description of the **bpf_skb_get_tunnel_key**\ ()
810 * helper for additional information.
811 * Return
812 * 0 on success, or a negative error in case of failure.
813 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +0100814 * u64 bpf_perf_event_read(struct bpf_map *map, u64 flags)
815 * Description
816 * Read the value of a perf event counter. This helper relies on a
817 * *map* of type **BPF_MAP_TYPE_PERF_EVENT_ARRAY**. The nature of
818 * the perf event counter is selected when *map* is updated with
819 * perf event file descriptors. The *map* is an array whose size
820 * is the number of available CPUs, and each cell contains a value
821 * relative to one CPU. The value to retrieve is indicated by
822 * *flags*, that contains the index of the CPU to look up, masked
823 * with **BPF_F_INDEX_MASK**. Alternatively, *flags* can be set to
824 * **BPF_F_CURRENT_CPU** to indicate that the value for the
825 * current CPU should be retrieved.
826 *
827 * Note that before Linux 4.13, only hardware perf event can be
828 * retrieved.
829 *
830 * Also, be aware that the newer helper
831 * **bpf_perf_event_read_value**\ () is recommended over
Quentin Monnet3bd5a092018-04-30 11:39:03 +0100832 * **bpf_perf_event_read**\ () in general. The latter has some ABI
Quentin Monnetc6b5fb82018-04-25 18:16:57 +0100833 * quirks where error and counter value are used as a return code
834 * (which is wrong to do since ranges may overlap). This issue is
Quentin Monnet3bd5a092018-04-30 11:39:03 +0100835 * fixed with **bpf_perf_event_read_value**\ (), which at the same
836 * time provides more features over the **bpf_perf_event_read**\
837 * () interface. Please refer to the description of
Quentin Monnetc6b5fb82018-04-25 18:16:57 +0100838 * **bpf_perf_event_read_value**\ () for details.
839 * Return
840 * The value of the perf event counter read from the map, or a
841 * negative error code in case of failure.
842 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100843 * int bpf_redirect(u32 ifindex, u64 flags)
844 * Description
845 * Redirect the packet to another net device of index *ifindex*.
846 * This helper is somewhat similar to **bpf_clone_redirect**\
847 * (), except that the packet is not cloned, which provides
848 * increased performance.
849 *
850 * Except for XDP, both ingress and egress interfaces can be used
851 * for redirection. The **BPF_F_INGRESS** value in *flags* is used
852 * to make the distinction (ingress path is selected if the flag
853 * is present, egress path otherwise). Currently, XDP only
854 * supports redirection to the egress interface, and accepts no
855 * flag at all.
856 *
857 * The same effect can be attained with the more generic
858 * **bpf_redirect_map**\ (), which requires specific maps to be
859 * used but offers better performance.
860 * Return
861 * For XDP, the helper returns **XDP_REDIRECT** on success or
862 * **XDP_ABORTED** on error. For other program types, the values
863 * are **TC_ACT_REDIRECT** on success or **TC_ACT_SHOT** on
864 * error.
865 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100866 * u32 bpf_get_route_realm(struct sk_buff *skb)
867 * Description
868 * Retrieve the realm or the route, that is to say the
869 * **tclassid** field of the destination for the *skb*. The
870 * indentifier retrieved is a user-provided tag, similar to the
871 * one used with the net_cls cgroup (see description for
872 * **bpf_get_cgroup_classid**\ () helper), but here this tag is
873 * held by a route (a destination entry), not by a task.
874 *
875 * Retrieving this identifier works with the clsact TC egress hook
876 * (see also **tc-bpf(8)**), or alternatively on conventional
877 * classful egress qdiscs, but not on TC ingress path. In case of
878 * clsact TC egress hook, this has the advantage that, internally,
879 * the destination entry has not been dropped yet in the transmit
880 * path. Therefore, the destination entry does not need to be
881 * artificially held via **netif_keep_dst**\ () for a classful
882 * qdisc until the *skb* is freed.
883 *
884 * This helper is available only if the kernel was compiled with
885 * **CONFIG_IP_ROUTE_CLASSID** configuration option.
886 * Return
887 * The realm of the route for the packet associated to *skb*, or 0
888 * if none was found.
889 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100890 * int bpf_perf_event_output(struct pt_reg *ctx, struct bpf_map *map, u64 flags, void *data, u64 size)
891 * Description
892 * Write raw *data* blob into a special BPF perf event held by
893 * *map* of type **BPF_MAP_TYPE_PERF_EVENT_ARRAY**. This perf
894 * event must have the following attributes: **PERF_SAMPLE_RAW**
895 * as **sample_type**, **PERF_TYPE_SOFTWARE** as **type**, and
896 * **PERF_COUNT_SW_BPF_OUTPUT** as **config**.
897 *
898 * The *flags* are used to indicate the index in *map* for which
899 * the value must be put, masked with **BPF_F_INDEX_MASK**.
900 * Alternatively, *flags* can be set to **BPF_F_CURRENT_CPU**
901 * to indicate that the index of the current CPU core should be
902 * used.
903 *
904 * The value to write, of *size*, is passed through eBPF stack and
905 * pointed by *data*.
906 *
907 * The context of the program *ctx* needs also be passed to the
908 * helper.
909 *
910 * On user space, a program willing to read the values needs to
911 * call **perf_event_open**\ () on the perf event (either for
912 * one or for all CPUs) and to store the file descriptor into the
913 * *map*. This must be done before the eBPF program can send data
914 * into it. An example is available in file
915 * *samples/bpf/trace_output_user.c* in the Linux kernel source
916 * tree (the eBPF program counterpart is in
917 * *samples/bpf/trace_output_kern.c*).
918 *
919 * **bpf_perf_event_output**\ () achieves better performance
920 * than **bpf_trace_printk**\ () for sharing data with user
921 * space, and is much better suitable for streaming data from eBPF
922 * programs.
923 *
924 * Note that this helper is not restricted to tracing use cases
925 * and can be used with programs attached to TC or XDP as well,
926 * where it allows for passing data to user space listeners. Data
927 * can be:
928 *
929 * * Only custom structs,
930 * * Only the packet payload, or
931 * * A combination of both.
932 * Return
933 * 0 on success, or a negative error in case of failure.
934 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100935 * int bpf_skb_load_bytes(const struct sk_buff *skb, u32 offset, void *to, u32 len)
936 * Description
937 * This helper was provided as an easy way to load data from a
938 * packet. It can be used to load *len* bytes from *offset* from
939 * the packet associated to *skb*, into the buffer pointed by
940 * *to*.
941 *
942 * Since Linux 4.7, usage of this helper has mostly been replaced
943 * by "direct packet access", enabling packet data to be
944 * manipulated with *skb*\ **->data** and *skb*\ **->data_end**
945 * pointing respectively to the first byte of packet data and to
946 * the byte after the last byte of packet data. However, it
947 * remains useful if one wishes to read large quantities of data
948 * at once from a packet into the eBPF stack.
949 * Return
950 * 0 on success, or a negative error in case of failure.
951 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100952 * int bpf_get_stackid(struct pt_reg *ctx, struct bpf_map *map, u64 flags)
953 * Description
954 * Walk a user or a kernel stack and return its id. To achieve
955 * this, the helper needs *ctx*, which is a pointer to the context
956 * on which the tracing program is executed, and a pointer to a
957 * *map* of type **BPF_MAP_TYPE_STACK_TRACE**.
958 *
959 * The last argument, *flags*, holds the number of stack frames to
960 * skip (from 0 to 255), masked with
961 * **BPF_F_SKIP_FIELD_MASK**. The next bits can be used to set
962 * a combination of the following flags:
963 *
964 * **BPF_F_USER_STACK**
965 * Collect a user space stack instead of a kernel stack.
966 * **BPF_F_FAST_STACK_CMP**
967 * Compare stacks by hash only.
968 * **BPF_F_REUSE_STACKID**
969 * If two different stacks hash into the same *stackid*,
970 * discard the old one.
971 *
972 * The stack id retrieved is a 32 bit long integer handle which
973 * can be further combined with other data (including other stack
974 * ids) and used as a key into maps. This can be useful for
975 * generating a variety of graphs (such as flame graphs or off-cpu
976 * graphs).
977 *
978 * For walking a stack, this helper is an improvement over
979 * **bpf_probe_read**\ (), which can be used with unrolled loops
980 * but is not efficient and consumes a lot of eBPF instructions.
981 * Instead, **bpf_get_stackid**\ () can collect up to
982 * **PERF_MAX_STACK_DEPTH** both kernel and user frames. Note that
983 * this limit can be controlled with the **sysctl** program, and
984 * that it should be manually increased in order to profile long
985 * user stacks (such as stacks for Java programs). To do so, use:
986 *
987 * ::
988 *
989 * # sysctl kernel.perf_event_max_stack=<new value>
990 *
991 * Return
992 * The positive or null stack id on success, or a negative error
993 * in case of failure.
994 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100995 * s64 bpf_csum_diff(__be32 *from, u32 from_size, __be32 *to, u32 to_size, __wsum seed)
996 * Description
997 * Compute a checksum difference, from the raw buffer pointed by
998 * *from*, of length *from_size* (that must be a multiple of 4),
999 * towards the raw buffer pointed by *to*, of size *to_size*
1000 * (same remark). An optional *seed* can be added to the value
1001 * (this can be cascaded, the seed may come from a previous call
1002 * to the helper).
1003 *
1004 * This is flexible enough to be used in several ways:
1005 *
1006 * * With *from_size* == 0, *to_size* > 0 and *seed* set to
1007 * checksum, it can be used when pushing new data.
1008 * * With *from_size* > 0, *to_size* == 0 and *seed* set to
1009 * checksum, it can be used when removing data from a packet.
1010 * * With *from_size* > 0, *to_size* > 0 and *seed* set to 0, it
1011 * can be used to compute a diff. Note that *from_size* and
1012 * *to_size* do not need to be equal.
1013 *
1014 * This helper can be used in combination with
1015 * **bpf_l3_csum_replace**\ () and **bpf_l4_csum_replace**\ (), to
1016 * which one can feed in the difference computed with
1017 * **bpf_csum_diff**\ ().
1018 * Return
1019 * The checksum result, or a negative error code in case of
1020 * failure.
1021 *
1022 * int bpf_skb_get_tunnel_opt(struct sk_buff *skb, u8 *opt, u32 size)
1023 * Description
1024 * Retrieve tunnel options metadata for the packet associated to
1025 * *skb*, and store the raw tunnel option data to the buffer *opt*
1026 * of *size*.
1027 *
1028 * This helper can be used with encapsulation devices that can
1029 * operate in "collect metadata" mode (please refer to the related
1030 * note in the description of **bpf_skb_get_tunnel_key**\ () for
1031 * more details). A particular example where this can be used is
1032 * in combination with the Geneve encapsulation protocol, where it
1033 * allows for pushing (with **bpf_skb_get_tunnel_opt**\ () helper)
1034 * and retrieving arbitrary TLVs (Type-Length-Value headers) from
1035 * the eBPF program. This allows for full customization of these
1036 * headers.
1037 * Return
1038 * The size of the option data retrieved.
1039 *
1040 * int bpf_skb_set_tunnel_opt(struct sk_buff *skb, u8 *opt, u32 size)
1041 * Description
1042 * Set tunnel options metadata for the packet associated to *skb*
1043 * to the option data contained in the raw buffer *opt* of *size*.
1044 *
1045 * See also the description of the **bpf_skb_get_tunnel_opt**\ ()
1046 * helper for additional information.
1047 * Return
1048 * 0 on success, or a negative error in case of failure.
1049 *
1050 * int bpf_skb_change_proto(struct sk_buff *skb, __be16 proto, u64 flags)
1051 * Description
1052 * Change the protocol of the *skb* to *proto*. Currently
1053 * supported are transition from IPv4 to IPv6, and from IPv6 to
1054 * IPv4. The helper takes care of the groundwork for the
1055 * transition, including resizing the socket buffer. The eBPF
1056 * program is expected to fill the new headers, if any, via
1057 * **skb_store_bytes**\ () and to recompute the checksums with
1058 * **bpf_l3_csum_replace**\ () and **bpf_l4_csum_replace**\
1059 * (). The main case for this helper is to perform NAT64
1060 * operations out of an eBPF program.
1061 *
1062 * Internally, the GSO type is marked as dodgy so that headers are
1063 * checked and segments are recalculated by the GSO/GRO engine.
1064 * The size for GSO target is adapted as well.
1065 *
1066 * All values for *flags* are reserved for future usage, and must
1067 * be left at zero.
1068 *
1069 * A call to this helper is susceptible to change the underlaying
1070 * packet buffer. Therefore, at load time, all checks on pointers
1071 * previously done by the verifier are invalidated and must be
1072 * performed again, if the helper is used in combination with
1073 * direct packet access.
1074 * Return
1075 * 0 on success, or a negative error in case of failure.
1076 *
1077 * int bpf_skb_change_type(struct sk_buff *skb, u32 type)
1078 * Description
1079 * Change the packet type for the packet associated to *skb*. This
1080 * comes down to setting *skb*\ **->pkt_type** to *type*, except
1081 * the eBPF program does not have a write access to *skb*\
1082 * **->pkt_type** beside this helper. Using a helper here allows
1083 * for graceful handling of errors.
1084 *
1085 * The major use case is to change incoming *skb*s to
1086 * **PACKET_HOST** in a programmatic way instead of having to
1087 * recirculate via **redirect**\ (..., **BPF_F_INGRESS**), for
1088 * example.
1089 *
1090 * Note that *type* only allows certain values. At this time, they
1091 * are:
1092 *
1093 * **PACKET_HOST**
1094 * Packet is for us.
1095 * **PACKET_BROADCAST**
1096 * Send packet to all.
1097 * **PACKET_MULTICAST**
1098 * Send packet to group.
1099 * **PACKET_OTHERHOST**
1100 * Send packet to someone else.
1101 * Return
1102 * 0 on success, or a negative error in case of failure.
1103 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001104 * int bpf_skb_under_cgroup(struct sk_buff *skb, struct bpf_map *map, u32 index)
1105 * Description
1106 * Check whether *skb* is a descendant of the cgroup2 held by
1107 * *map* of type **BPF_MAP_TYPE_CGROUP_ARRAY**, at *index*.
1108 * Return
1109 * The return value depends on the result of the test, and can be:
1110 *
1111 * * 0, if the *skb* failed the cgroup2 descendant test.
1112 * * 1, if the *skb* succeeded the cgroup2 descendant test.
1113 * * A negative error code, if an error occurred.
1114 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001115 * u32 bpf_get_hash_recalc(struct sk_buff *skb)
1116 * Description
1117 * Retrieve the hash of the packet, *skb*\ **->hash**. If it is
1118 * not set, in particular if the hash was cleared due to mangling,
1119 * recompute this hash. Later accesses to the hash can be done
1120 * directly with *skb*\ **->hash**.
1121 *
1122 * Calling **bpf_set_hash_invalid**\ (), changing a packet
1123 * prototype with **bpf_skb_change_proto**\ (), or calling
1124 * **bpf_skb_store_bytes**\ () with the
1125 * **BPF_F_INVALIDATE_HASH** are actions susceptible to clear
1126 * the hash and to trigger a new computation for the next call to
1127 * **bpf_get_hash_recalc**\ ().
1128 * Return
1129 * The 32-bit hash.
1130 *
Quentin Monnetc456dec2018-04-25 18:16:54 +01001131 * u64 bpf_get_current_task(void)
1132 * Return
1133 * A pointer to the current task struct.
Quentin Monnetfa156012018-04-25 18:16:56 +01001134 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001135 * int bpf_probe_write_user(void *dst, const void *src, u32 len)
1136 * Description
1137 * Attempt in a safe way to write *len* bytes from the buffer
1138 * *src* to *dst* in memory. It only works for threads that are in
1139 * user context, and *dst* must be a valid user space address.
1140 *
1141 * This helper should not be used to implement any kind of
1142 * security mechanism because of TOC-TOU attacks, but rather to
1143 * debug, divert, and manipulate execution of semi-cooperative
1144 * processes.
1145 *
1146 * Keep in mind that this feature is meant for experiments, and it
1147 * has a risk of crashing the system and running programs.
1148 * Therefore, when an eBPF program using this helper is attached,
1149 * a warning including PID and process name is printed to kernel
1150 * logs.
1151 * Return
1152 * 0 on success, or a negative error in case of failure.
1153 *
1154 * int bpf_current_task_under_cgroup(struct bpf_map *map, u32 index)
1155 * Description
1156 * Check whether the probe is being run is the context of a given
1157 * subset of the cgroup2 hierarchy. The cgroup2 to test is held by
1158 * *map* of type **BPF_MAP_TYPE_CGROUP_ARRAY**, at *index*.
1159 * Return
1160 * The return value depends on the result of the test, and can be:
1161 *
1162 * * 0, if the *skb* task belongs to the cgroup2.
1163 * * 1, if the *skb* task does not belong to the cgroup2.
1164 * * A negative error code, if an error occurred.
1165 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001166 * int bpf_skb_change_tail(struct sk_buff *skb, u32 len, u64 flags)
1167 * Description
1168 * Resize (trim or grow) the packet associated to *skb* to the
1169 * new *len*. The *flags* are reserved for future usage, and must
1170 * be left at zero.
1171 *
1172 * The basic idea is that the helper performs the needed work to
1173 * change the size of the packet, then the eBPF program rewrites
1174 * the rest via helpers like **bpf_skb_store_bytes**\ (),
1175 * **bpf_l3_csum_replace**\ (), **bpf_l3_csum_replace**\ ()
1176 * and others. This helper is a slow path utility intended for
1177 * replies with control messages. And because it is targeted for
1178 * slow path, the helper itself can afford to be slow: it
1179 * implicitly linearizes, unclones and drops offloads from the
1180 * *skb*.
1181 *
1182 * A call to this helper is susceptible to change the underlaying
1183 * packet buffer. Therefore, at load time, all checks on pointers
1184 * previously done by the verifier are invalidated and must be
1185 * performed again, if the helper is used in combination with
1186 * direct packet access.
1187 * Return
1188 * 0 on success, or a negative error in case of failure.
1189 *
1190 * int bpf_skb_pull_data(struct sk_buff *skb, u32 len)
1191 * Description
1192 * Pull in non-linear data in case the *skb* is non-linear and not
1193 * all of *len* are part of the linear section. Make *len* bytes
1194 * from *skb* readable and writable. If a zero value is passed for
1195 * *len*, then the whole length of the *skb* is pulled.
1196 *
1197 * This helper is only needed for reading and writing with direct
1198 * packet access.
1199 *
1200 * For direct packet access, testing that offsets to access
1201 * are within packet boundaries (test on *skb*\ **->data_end**) is
1202 * susceptible to fail if offsets are invalid, or if the requested
1203 * data is in non-linear parts of the *skb*. On failure the
1204 * program can just bail out, or in the case of a non-linear
1205 * buffer, use a helper to make the data available. The
1206 * **bpf_skb_load_bytes**\ () helper is a first solution to access
1207 * the data. Another one consists in using **bpf_skb_pull_data**
1208 * to pull in once the non-linear parts, then retesting and
1209 * eventually access the data.
1210 *
1211 * At the same time, this also makes sure the *skb* is uncloned,
1212 * which is a necessary condition for direct write. As this needs
1213 * to be an invariant for the write part only, the verifier
1214 * detects writes and adds a prologue that is calling
1215 * **bpf_skb_pull_data()** to effectively unclone the *skb* from
1216 * the very beginning in case it is indeed cloned.
1217 *
1218 * A call to this helper is susceptible to change the underlaying
1219 * packet buffer. Therefore, at load time, all checks on pointers
1220 * previously done by the verifier are invalidated and must be
1221 * performed again, if the helper is used in combination with
1222 * direct packet access.
1223 * Return
1224 * 0 on success, or a negative error in case of failure.
1225 *
1226 * s64 bpf_csum_update(struct sk_buff *skb, __wsum csum)
1227 * Description
1228 * Add the checksum *csum* into *skb*\ **->csum** in case the
1229 * driver has supplied a checksum for the entire packet into that
1230 * field. Return an error otherwise. This helper is intended to be
1231 * used in combination with **bpf_csum_diff**\ (), in particular
1232 * when the checksum needs to be updated after data has been
1233 * written into the packet through direct packet access.
1234 * Return
1235 * The checksum on success, or a negative error code in case of
1236 * failure.
1237 *
1238 * void bpf_set_hash_invalid(struct sk_buff *skb)
1239 * Description
1240 * Invalidate the current *skb*\ **->hash**. It can be used after
1241 * mangling on headers through direct packet access, in order to
1242 * indicate that the hash is outdated and to trigger a
1243 * recalculation the next time the kernel tries to access this
1244 * hash or when the **bpf_get_hash_recalc**\ () helper is called.
1245 *
1246 * int bpf_get_numa_node_id(void)
1247 * Description
1248 * Return the id of the current NUMA node. The primary use case
1249 * for this helper is the selection of sockets for the local NUMA
1250 * node, when the program is attached to sockets using the
1251 * **SO_ATTACH_REUSEPORT_EBPF** option (see also **socket(7)**),
1252 * but the helper is also available to other eBPF program types,
1253 * similarly to **bpf_get_smp_processor_id**\ ().
1254 * Return
1255 * The id of current NUMA node.
1256 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001257 * int bpf_skb_change_head(struct sk_buff *skb, u32 len, u64 flags)
1258 * Description
1259 * Grows headroom of packet associated to *skb* and adjusts the
1260 * offset of the MAC header accordingly, adding *len* bytes of
1261 * space. It automatically extends and reallocates memory as
1262 * required.
1263 *
1264 * This helper can be used on a layer 3 *skb* to push a MAC header
1265 * for redirection into a layer 2 device.
1266 *
1267 * All values for *flags* are reserved for future usage, and must
1268 * be left at zero.
1269 *
1270 * A call to this helper is susceptible to change the underlaying
1271 * packet buffer. Therefore, at load time, all checks on pointers
1272 * previously done by the verifier are invalidated and must be
1273 * performed again, if the helper is used in combination with
1274 * direct packet access.
1275 * Return
1276 * 0 on success, or a negative error in case of failure.
1277 *
1278 * int bpf_xdp_adjust_head(struct xdp_buff *xdp_md, int delta)
1279 * Description
1280 * Adjust (move) *xdp_md*\ **->data** by *delta* bytes. Note that
1281 * it is possible to use a negative value for *delta*. This helper
1282 * can be used to prepare the packet for pushing or popping
1283 * headers.
1284 *
1285 * A call to this helper is susceptible to change the underlaying
1286 * packet buffer. Therefore, at load time, all checks on pointers
1287 * previously done by the verifier are invalidated and must be
1288 * performed again, if the helper is used in combination with
1289 * direct packet access.
1290 * Return
1291 * 0 on success, or a negative error in case of failure.
1292 *
1293 * int bpf_probe_read_str(void *dst, int size, const void *unsafe_ptr)
1294 * Description
1295 * Copy a NUL terminated string from an unsafe address
1296 * *unsafe_ptr* to *dst*. The *size* should include the
1297 * terminating NUL byte. In case the string length is smaller than
1298 * *size*, the target is not padded with further NUL bytes. If the
1299 * string length is larger than *size*, just *size*-1 bytes are
1300 * copied and the last byte is set to NUL.
1301 *
1302 * On success, the length of the copied string is returned. This
1303 * makes this helper useful in tracing programs for reading
1304 * strings, and more importantly to get its length at runtime. See
1305 * the following snippet:
1306 *
1307 * ::
1308 *
1309 * SEC("kprobe/sys_open")
1310 * void bpf_sys_open(struct pt_regs *ctx)
1311 * {
1312 * char buf[PATHLEN]; // PATHLEN is defined to 256
1313 * int res = bpf_probe_read_str(buf, sizeof(buf),
1314 * ctx->di);
1315 *
1316 * // Consume buf, for example push it to
1317 * // userspace via bpf_perf_event_output(); we
1318 * // can use res (the string length) as event
1319 * // size, after checking its boundaries.
1320 * }
1321 *
1322 * In comparison, using **bpf_probe_read()** helper here instead
1323 * to read the string would require to estimate the length at
1324 * compile time, and would often result in copying more memory
1325 * than necessary.
1326 *
1327 * Another useful use case is when parsing individual process
1328 * arguments or individual environment variables navigating
1329 * *current*\ **->mm->arg_start** and *current*\
1330 * **->mm->env_start**: using this helper and the return value,
1331 * one can quickly iterate at the right offset of the memory area.
1332 * Return
1333 * On success, the strictly positive length of the string,
1334 * including the trailing NUL character. On error, a negative
1335 * value.
1336 *
1337 * u64 bpf_get_socket_cookie(struct sk_buff *skb)
1338 * Description
1339 * If the **struct sk_buff** pointed by *skb* has a known socket,
1340 * retrieve the cookie (generated by the kernel) of this socket.
1341 * If no cookie has been set yet, generate a new cookie. Once
1342 * generated, the socket cookie remains stable for the life of the
1343 * socket. This helper can be useful for monitoring per socket
1344 * networking traffic statistics as it provides a unique socket
1345 * identifier per namespace.
1346 * Return
1347 * A 8-byte long non-decreasing number on success, or 0 if the
1348 * socket field is missing inside *skb*.
1349 *
1350 * u32 bpf_get_socket_uid(struct sk_buff *skb)
1351 * Return
1352 * The owner UID of the socket associated to *skb*. If the socket
1353 * is **NULL**, or if it is not a full socket (i.e. if it is a
1354 * time-wait or a request socket instead), **overflowuid** value
1355 * is returned (note that **overflowuid** might also be the actual
1356 * UID value for the socket).
1357 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001358 * u32 bpf_set_hash(struct sk_buff *skb, u32 hash)
1359 * Description
1360 * Set the full hash for *skb* (set the field *skb*\ **->hash**)
1361 * to value *hash*.
1362 * Return
1363 * 0
1364 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001365 * int bpf_setsockopt(struct bpf_sock_ops *bpf_socket, int level, int optname, char *optval, int optlen)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001366 * Description
1367 * Emulate a call to **setsockopt()** on the socket associated to
1368 * *bpf_socket*, which must be a full socket. The *level* at
1369 * which the option resides and the name *optname* of the option
1370 * must be specified, see **setsockopt(2)** for more information.
1371 * The option value of length *optlen* is pointed by *optval*.
1372 *
1373 * This helper actually implements a subset of **setsockopt()**.
1374 * It supports the following *level*\ s:
1375 *
1376 * * **SOL_SOCKET**, which supports the following *optname*\ s:
1377 * **SO_RCVBUF**, **SO_SNDBUF**, **SO_MAX_PACING_RATE**,
1378 * **SO_PRIORITY**, **SO_RCVLOWAT**, **SO_MARK**.
1379 * * **IPPROTO_TCP**, which supports the following *optname*\ s:
1380 * **TCP_CONGESTION**, **TCP_BPF_IW**,
1381 * **TCP_BPF_SNDCWND_CLAMP**.
1382 * * **IPPROTO_IP**, which supports *optname* **IP_TOS**.
1383 * * **IPPROTO_IPV6**, which supports *optname* **IPV6_TCLASS**.
1384 * Return
1385 * 0 on success, or a negative error in case of failure.
1386 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001387 * int bpf_skb_adjust_room(struct sk_buff *skb, u32 len_diff, u32 mode, u64 flags)
1388 * Description
1389 * Grow or shrink the room for data in the packet associated to
1390 * *skb* by *len_diff*, and according to the selected *mode*.
1391 *
1392 * There is a single supported mode at this time:
1393 *
1394 * * **BPF_ADJ_ROOM_NET**: Adjust room at the network layer
1395 * (room space is added or removed below the layer 3 header).
1396 *
1397 * All values for *flags* are reserved for future usage, and must
1398 * be left at zero.
1399 *
1400 * A call to this helper is susceptible to change the underlaying
1401 * packet buffer. Therefore, at load time, all checks on pointers
1402 * previously done by the verifier are invalidated and must be
1403 * performed again, if the helper is used in combination with
1404 * direct packet access.
1405 * Return
1406 * 0 on success, or a negative error in case of failure.
1407 *
Quentin Monnetab127042018-04-25 18:16:59 +01001408 * int bpf_redirect_map(struct bpf_map *map, u32 key, u64 flags)
1409 * Description
1410 * Redirect the packet to the endpoint referenced by *map* at
1411 * index *key*. Depending on its type, this *map* can contain
1412 * references to net devices (for forwarding packets through other
1413 * ports), or to CPUs (for redirecting XDP frames to another CPU;
1414 * but this is only implemented for native XDP (with driver
1415 * support) as of this writing).
1416 *
1417 * All values for *flags* are reserved for future usage, and must
1418 * be left at zero.
1419 *
1420 * When used to redirect packets to net devices, this helper
1421 * provides a high performance increase over **bpf_redirect**\ ().
1422 * This is due to various implementation details of the underlying
1423 * mechanisms, one of which is the fact that **bpf_redirect_map**\
1424 * () tries to send packet as a "bulk" to the device.
1425 * Return
1426 * **XDP_REDIRECT** on success, or **XDP_ABORTED** on error.
1427 *
1428 * int bpf_sk_redirect_map(struct bpf_map *map, u32 key, u64 flags)
1429 * Description
1430 * Redirect the packet to the socket referenced by *map* (of type
1431 * **BPF_MAP_TYPE_SOCKMAP**) at index *key*. Both ingress and
1432 * egress interfaces can be used for redirection. The
1433 * **BPF_F_INGRESS** value in *flags* is used to make the
1434 * distinction (ingress path is selected if the flag is present,
1435 * egress path otherwise). This is the only flag supported for now.
1436 * Return
1437 * **SK_PASS** on success, or **SK_DROP** on error.
1438 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001439 * int bpf_sock_map_update(struct bpf_sock_ops *skops, struct bpf_map *map, void *key, u64 flags)
Quentin Monnetab127042018-04-25 18:16:59 +01001440 * Description
1441 * Add an entry to, or update a *map* referencing sockets. The
1442 * *skops* is used as a new value for the entry associated to
1443 * *key*. *flags* is one of:
1444 *
1445 * **BPF_NOEXIST**
1446 * The entry for *key* must not exist in the map.
1447 * **BPF_EXIST**
1448 * The entry for *key* must already exist in the map.
1449 * **BPF_ANY**
1450 * No condition on the existence of the entry for *key*.
1451 *
1452 * If the *map* has eBPF programs (parser and verdict), those will
1453 * be inherited by the socket being added. If the socket is
1454 * already attached to eBPF programs, this results in an error.
1455 * Return
1456 * 0 on success, or a negative error in case of failure.
1457 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001458 * int bpf_xdp_adjust_meta(struct xdp_buff *xdp_md, int delta)
1459 * Description
1460 * Adjust the address pointed by *xdp_md*\ **->data_meta** by
1461 * *delta* (which can be positive or negative). Note that this
1462 * operation modifies the address stored in *xdp_md*\ **->data**,
1463 * so the latter must be loaded only after the helper has been
1464 * called.
1465 *
1466 * The use of *xdp_md*\ **->data_meta** is optional and programs
1467 * are not required to use it. The rationale is that when the
1468 * packet is processed with XDP (e.g. as DoS filter), it is
1469 * possible to push further meta data along with it before passing
1470 * to the stack, and to give the guarantee that an ingress eBPF
1471 * program attached as a TC classifier on the same device can pick
1472 * this up for further post-processing. Since TC works with socket
1473 * buffers, it remains possible to set from XDP the **mark** or
1474 * **priority** pointers, or other pointers for the socket buffer.
1475 * Having this scratch space generic and programmable allows for
1476 * more flexibility as the user is free to store whatever meta
1477 * data they need.
1478 *
1479 * A call to this helper is susceptible to change the underlaying
1480 * packet buffer. Therefore, at load time, all checks on pointers
1481 * previously done by the verifier are invalidated and must be
1482 * performed again, if the helper is used in combination with
1483 * direct packet access.
1484 * Return
1485 * 0 on success, or a negative error in case of failure.
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001486 *
1487 * int bpf_perf_event_read_value(struct bpf_map *map, u64 flags, struct bpf_perf_event_value *buf, u32 buf_size)
1488 * Description
1489 * Read the value of a perf event counter, and store it into *buf*
1490 * of size *buf_size*. This helper relies on a *map* of type
1491 * **BPF_MAP_TYPE_PERF_EVENT_ARRAY**. The nature of the perf event
1492 * counter is selected when *map* is updated with perf event file
1493 * descriptors. The *map* is an array whose size is the number of
1494 * available CPUs, and each cell contains a value relative to one
1495 * CPU. The value to retrieve is indicated by *flags*, that
1496 * contains the index of the CPU to look up, masked with
1497 * **BPF_F_INDEX_MASK**. Alternatively, *flags* can be set to
1498 * **BPF_F_CURRENT_CPU** to indicate that the value for the
1499 * current CPU should be retrieved.
1500 *
1501 * This helper behaves in a way close to
1502 * **bpf_perf_event_read**\ () helper, save that instead of
1503 * just returning the value observed, it fills the *buf*
1504 * structure. This allows for additional data to be retrieved: in
1505 * particular, the enabled and running times (in *buf*\
1506 * **->enabled** and *buf*\ **->running**, respectively) are
1507 * copied. In general, **bpf_perf_event_read_value**\ () is
1508 * recommended over **bpf_perf_event_read**\ (), which has some
1509 * ABI issues and provides fewer functionalities.
1510 *
1511 * These values are interesting, because hardware PMU (Performance
1512 * Monitoring Unit) counters are limited resources. When there are
1513 * more PMU based perf events opened than available counters,
1514 * kernel will multiplex these events so each event gets certain
1515 * percentage (but not all) of the PMU time. In case that
1516 * multiplexing happens, the number of samples or counter value
1517 * will not reflect the case compared to when no multiplexing
1518 * occurs. This makes comparison between different runs difficult.
1519 * Typically, the counter value should be normalized before
1520 * comparing to other experiments. The usual normalization is done
1521 * as follows.
1522 *
1523 * ::
1524 *
1525 * normalized_counter = counter * t_enabled / t_running
1526 *
1527 * Where t_enabled is the time enabled for event and t_running is
1528 * the time running for event since last normalization. The
1529 * enabled and running times are accumulated since the perf event
1530 * open. To achieve scaling factor between two invocations of an
1531 * eBPF program, users can can use CPU id as the key (which is
1532 * typical for perf array usage model) to remember the previous
1533 * value and do the calculation inside the eBPF program.
1534 * Return
1535 * 0 on success, or a negative error in case of failure.
1536 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001537 * int bpf_perf_prog_read_value(struct bpf_perf_event_data *ctx, struct bpf_perf_event_value *buf, u32 buf_size)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001538 * Description
1539 * For en eBPF program attached to a perf event, retrieve the
1540 * value of the event counter associated to *ctx* and store it in
1541 * the structure pointed by *buf* and of size *buf_size*. Enabled
1542 * and running times are also stored in the structure (see
1543 * description of helper **bpf_perf_event_read_value**\ () for
1544 * more details).
1545 * Return
1546 * 0 on success, or a negative error in case of failure.
1547 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001548 * int bpf_getsockopt(struct bpf_sock_ops *bpf_socket, int level, int optname, char *optval, int optlen)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001549 * Description
1550 * Emulate a call to **getsockopt()** on the socket associated to
1551 * *bpf_socket*, which must be a full socket. The *level* at
1552 * which the option resides and the name *optname* of the option
1553 * must be specified, see **getsockopt(2)** for more information.
1554 * The retrieved value is stored in the structure pointed by
1555 * *opval* and of length *optlen*.
1556 *
1557 * This helper actually implements a subset of **getsockopt()**.
1558 * It supports the following *level*\ s:
1559 *
1560 * * **IPPROTO_TCP**, which supports *optname*
1561 * **TCP_CONGESTION**.
1562 * * **IPPROTO_IP**, which supports *optname* **IP_TOS**.
1563 * * **IPPROTO_IPV6**, which supports *optname* **IPV6_TCLASS**.
1564 * Return
1565 * 0 on success, or a negative error in case of failure.
1566 *
1567 * int bpf_override_return(struct pt_reg *regs, u64 rc)
1568 * Description
1569 * Used for error injection, this helper uses kprobes to override
1570 * the return value of the probed function, and to set it to *rc*.
1571 * The first argument is the context *regs* on which the kprobe
1572 * works.
1573 *
1574 * This helper works by setting setting the PC (program counter)
1575 * to an override function which is run in place of the original
1576 * probed function. This means the probed function is not run at
1577 * all. The replacement function just returns with the required
1578 * value.
1579 *
1580 * This helper has security implications, and thus is subject to
1581 * restrictions. It is only available if the kernel was compiled
1582 * with the **CONFIG_BPF_KPROBE_OVERRIDE** configuration
1583 * option, and in this case it only works on functions tagged with
1584 * **ALLOW_ERROR_INJECTION** in the kernel code.
1585 *
1586 * Also, the helper is only available for the architectures having
1587 * the CONFIG_FUNCTION_ERROR_INJECTION option. As of this writing,
1588 * x86 architecture is the only one to support this feature.
1589 * Return
1590 * 0
1591 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001592 * int bpf_sock_ops_cb_flags_set(struct bpf_sock_ops *bpf_sock, int argval)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001593 * Description
1594 * Attempt to set the value of the **bpf_sock_ops_cb_flags** field
1595 * for the full TCP socket associated to *bpf_sock_ops* to
1596 * *argval*.
1597 *
1598 * The primary use of this field is to determine if there should
1599 * be calls to eBPF programs of type
1600 * **BPF_PROG_TYPE_SOCK_OPS** at various points in the TCP
1601 * code. A program of the same type can change its value, per
1602 * connection and as necessary, when the connection is
1603 * established. This field is directly accessible for reading, but
1604 * this helper must be used for updates in order to return an
1605 * error if an eBPF program tries to set a callback that is not
1606 * supported in the current kernel.
1607 *
1608 * The supported callback values that *argval* can combine are:
1609 *
1610 * * **BPF_SOCK_OPS_RTO_CB_FLAG** (retransmission time out)
1611 * * **BPF_SOCK_OPS_RETRANS_CB_FLAG** (retransmission)
1612 * * **BPF_SOCK_OPS_STATE_CB_FLAG** (TCP state change)
1613 *
1614 * Here are some examples of where one could call such eBPF
1615 * program:
1616 *
1617 * * When RTO fires.
1618 * * When a packet is retransmitted.
1619 * * When the connection terminates.
1620 * * When a packet is sent.
1621 * * When a packet is received.
1622 * Return
1623 * Code **-EINVAL** if the socket is not a full TCP socket;
1624 * otherwise, a positive number containing the bits that could not
1625 * be set is returned (which comes down to 0 if all bits were set
1626 * as required).
1627 *
Quentin Monnetab127042018-04-25 18:16:59 +01001628 * int bpf_msg_redirect_map(struct sk_msg_buff *msg, struct bpf_map *map, u32 key, u64 flags)
1629 * Description
1630 * This helper is used in programs implementing policies at the
1631 * socket level. If the message *msg* is allowed to pass (i.e. if
1632 * the verdict eBPF program returns **SK_PASS**), redirect it to
1633 * the socket referenced by *map* (of type
1634 * **BPF_MAP_TYPE_SOCKMAP**) at index *key*. Both ingress and
1635 * egress interfaces can be used for redirection. The
1636 * **BPF_F_INGRESS** value in *flags* is used to make the
1637 * distinction (ingress path is selected if the flag is present,
1638 * egress path otherwise). This is the only flag supported for now.
1639 * Return
1640 * **SK_PASS** on success, or **SK_DROP** on error.
1641 *
1642 * int bpf_msg_apply_bytes(struct sk_msg_buff *msg, u32 bytes)
1643 * Description
1644 * For socket policies, apply the verdict of the eBPF program to
1645 * the next *bytes* (number of bytes) of message *msg*.
1646 *
1647 * For example, this helper can be used in the following cases:
1648 *
1649 * * A single **sendmsg**\ () or **sendfile**\ () system call
1650 * contains multiple logical messages that the eBPF program is
1651 * supposed to read and for which it should apply a verdict.
1652 * * An eBPF program only cares to read the first *bytes* of a
1653 * *msg*. If the message has a large payload, then setting up
1654 * and calling the eBPF program repeatedly for all bytes, even
1655 * though the verdict is already known, would create unnecessary
1656 * overhead.
1657 *
1658 * When called from within an eBPF program, the helper sets a
1659 * counter internal to the BPF infrastructure, that is used to
1660 * apply the last verdict to the next *bytes*. If *bytes* is
1661 * smaller than the current data being processed from a
1662 * **sendmsg**\ () or **sendfile**\ () system call, the first
1663 * *bytes* will be sent and the eBPF program will be re-run with
1664 * the pointer for start of data pointing to byte number *bytes*
1665 * **+ 1**. If *bytes* is larger than the current data being
1666 * processed, then the eBPF verdict will be applied to multiple
1667 * **sendmsg**\ () or **sendfile**\ () calls until *bytes* are
1668 * consumed.
1669 *
1670 * Note that if a socket closes with the internal counter holding
1671 * a non-zero value, this is not a problem because data is not
1672 * being buffered for *bytes* and is sent as it is received.
1673 * Return
1674 * 0
1675 *
1676 * int bpf_msg_cork_bytes(struct sk_msg_buff *msg, u32 bytes)
1677 * Description
1678 * For socket policies, prevent the execution of the verdict eBPF
1679 * program for message *msg* until *bytes* (byte number) have been
1680 * accumulated.
1681 *
1682 * This can be used when one needs a specific number of bytes
1683 * before a verdict can be assigned, even if the data spans
1684 * multiple **sendmsg**\ () or **sendfile**\ () calls. The extreme
1685 * case would be a user calling **sendmsg**\ () repeatedly with
1686 * 1-byte long message segments. Obviously, this is bad for
1687 * performance, but it is still valid. If the eBPF program needs
1688 * *bytes* bytes to validate a header, this helper can be used to
1689 * prevent the eBPF program to be called again until *bytes* have
1690 * been accumulated.
1691 * Return
1692 * 0
1693 *
1694 * int bpf_msg_pull_data(struct sk_msg_buff *msg, u32 start, u32 end, u64 flags)
1695 * Description
1696 * For socket policies, pull in non-linear data from user space
1697 * for *msg* and set pointers *msg*\ **->data** and *msg*\
1698 * **->data_end** to *start* and *end* bytes offsets into *msg*,
1699 * respectively.
1700 *
1701 * If a program of type **BPF_PROG_TYPE_SK_MSG** is run on a
1702 * *msg* it can only parse data that the (**data**, **data_end**)
1703 * pointers have already consumed. For **sendmsg**\ () hooks this
1704 * is likely the first scatterlist element. But for calls relying
1705 * on the **sendpage** handler (e.g. **sendfile**\ ()) this will
1706 * be the range (**0**, **0**) because the data is shared with
1707 * user space and by default the objective is to avoid allowing
1708 * user space to modify data while (or after) eBPF verdict is
1709 * being decided. This helper can be used to pull in data and to
1710 * set the start and end pointer to given values. Data will be
1711 * copied if necessary (i.e. if data was not linear and if start
1712 * and end pointers do not point to the same chunk).
1713 *
1714 * A call to this helper is susceptible to change the underlaying
1715 * packet buffer. Therefore, at load time, all checks on pointers
1716 * previously done by the verifier are invalidated and must be
1717 * performed again, if the helper is used in combination with
1718 * direct packet access.
1719 *
1720 * All values for *flags* are reserved for future usage, and must
1721 * be left at zero.
1722 * Return
1723 * 0 on success, or a negative error in case of failure.
1724 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001725 * int bpf_bind(struct bpf_sock_addr *ctx, struct sockaddr *addr, int addr_len)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001726 * Description
1727 * Bind the socket associated to *ctx* to the address pointed by
1728 * *addr*, of length *addr_len*. This allows for making outgoing
1729 * connection from the desired IP address, which can be useful for
1730 * example when all processes inside a cgroup should use one
1731 * single IP address on a host that has multiple IP configured.
1732 *
1733 * This helper works for IPv4 and IPv6, TCP and UDP sockets. The
1734 * domain (*addr*\ **->sa_family**) must be **AF_INET** (or
1735 * **AF_INET6**). Looking for a free port to bind to can be
1736 * expensive, therefore binding to port is not permitted by the
1737 * helper: *addr*\ **->sin_port** (or **sin6_port**, respectively)
1738 * must be set to zero.
1739 * Return
1740 * 0 on success, or a negative error in case of failure.
Quentin Monnet2d020dd2018-04-25 18:17:00 +01001741 *
1742 * int bpf_xdp_adjust_tail(struct xdp_buff *xdp_md, int delta)
1743 * Description
1744 * Adjust (move) *xdp_md*\ **->data_end** by *delta* bytes. It is
1745 * only possible to shrink the packet as of this writing,
1746 * therefore *delta* must be a negative integer.
1747 *
1748 * A call to this helper is susceptible to change the underlaying
1749 * packet buffer. Therefore, at load time, all checks on pointers
1750 * previously done by the verifier are invalidated and must be
1751 * performed again, if the helper is used in combination with
1752 * direct packet access.
1753 * Return
1754 * 0 on success, or a negative error in case of failure.
1755 *
1756 * int bpf_skb_get_xfrm_state(struct sk_buff *skb, u32 index, struct bpf_xfrm_state *xfrm_state, u32 size, u64 flags)
1757 * Description
1758 * Retrieve the XFRM state (IP transform framework, see also
1759 * **ip-xfrm(8)**) at *index* in XFRM "security path" for *skb*.
1760 *
1761 * The retrieved value is stored in the **struct bpf_xfrm_state**
1762 * pointed by *xfrm_state* and of length *size*.
1763 *
1764 * All values for *flags* are reserved for future usage, and must
1765 * be left at zero.
1766 *
1767 * This helper is available only if the kernel was compiled with
1768 * **CONFIG_XFRM** configuration option.
1769 * Return
1770 * 0 on success, or a negative error in case of failure.
Yonghong Songc195651e2018-04-28 22:28:08 -07001771 *
1772 * int bpf_get_stack(struct pt_regs *regs, void *buf, u32 size, u64 flags)
1773 * Description
Quentin Monnet79552fb2018-04-30 11:39:04 +01001774 * Return a user or a kernel stack in bpf program provided buffer.
1775 * To achieve this, the helper needs *ctx*, which is a pointer
1776 * to the context on which the tracing program is executed.
1777 * To store the stacktrace, the bpf program provides *buf* with
1778 * a nonnegative *size*.
Yonghong Songc195651e2018-04-28 22:28:08 -07001779 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001780 * The last argument, *flags*, holds the number of stack frames to
1781 * skip (from 0 to 255), masked with
1782 * **BPF_F_SKIP_FIELD_MASK**. The next bits can be used to set
1783 * the following flags:
Yonghong Songc195651e2018-04-28 22:28:08 -07001784 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001785 * **BPF_F_USER_STACK**
1786 * Collect a user space stack instead of a kernel stack.
1787 * **BPF_F_USER_BUILD_ID**
1788 * Collect buildid+offset instead of ips for user stack,
1789 * only valid if **BPF_F_USER_STACK** is also specified.
Yonghong Songc195651e2018-04-28 22:28:08 -07001790 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001791 * **bpf_get_stack**\ () can collect up to
1792 * **PERF_MAX_STACK_DEPTH** both kernel and user frames, subject
1793 * to sufficient large buffer size. Note that
1794 * this limit can be controlled with the **sysctl** program, and
1795 * that it should be manually increased in order to profile long
1796 * user stacks (such as stacks for Java programs). To do so, use:
Yonghong Songc195651e2018-04-28 22:28:08 -07001797 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001798 * ::
Yonghong Songc195651e2018-04-28 22:28:08 -07001799 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001800 * # sysctl kernel.perf_event_max_stack=<new value>
Yonghong Songc195651e2018-04-28 22:28:08 -07001801 *
1802 * Return
1803 * a non-negative value equal to or less than size on success, or
1804 * a negative error in case of failure.
Thomas Grafebb676d2016-10-27 11:23:51 +02001805 */
1806#define __BPF_FUNC_MAPPER(FN) \
1807 FN(unspec), \
1808 FN(map_lookup_elem), \
1809 FN(map_update_elem), \
1810 FN(map_delete_elem), \
1811 FN(probe_read), \
1812 FN(ktime_get_ns), \
1813 FN(trace_printk), \
1814 FN(get_prandom_u32), \
1815 FN(get_smp_processor_id), \
1816 FN(skb_store_bytes), \
1817 FN(l3_csum_replace), \
1818 FN(l4_csum_replace), \
1819 FN(tail_call), \
1820 FN(clone_redirect), \
1821 FN(get_current_pid_tgid), \
1822 FN(get_current_uid_gid), \
1823 FN(get_current_comm), \
1824 FN(get_cgroup_classid), \
1825 FN(skb_vlan_push), \
1826 FN(skb_vlan_pop), \
1827 FN(skb_get_tunnel_key), \
1828 FN(skb_set_tunnel_key), \
1829 FN(perf_event_read), \
1830 FN(redirect), \
1831 FN(get_route_realm), \
1832 FN(perf_event_output), \
1833 FN(skb_load_bytes), \
1834 FN(get_stackid), \
1835 FN(csum_diff), \
1836 FN(skb_get_tunnel_opt), \
1837 FN(skb_set_tunnel_opt), \
1838 FN(skb_change_proto), \
1839 FN(skb_change_type), \
1840 FN(skb_under_cgroup), \
1841 FN(get_hash_recalc), \
1842 FN(get_current_task), \
1843 FN(probe_write_user), \
1844 FN(current_task_under_cgroup), \
1845 FN(skb_change_tail), \
1846 FN(skb_pull_data), \
1847 FN(csum_update), \
1848 FN(set_hash_invalid), \
Thomas Graf3a0af8f2016-11-30 17:10:10 +01001849 FN(get_numa_node_id), \
Martin KaFai Lau17bedab2016-12-07 15:53:11 -08001850 FN(skb_change_head), \
Gianluca Borelloa5e8c072017-01-18 17:55:49 +00001851 FN(xdp_adjust_head), \
Chenbo Feng91b82702017-03-22 17:27:34 -07001852 FN(probe_read_str), \
Chenbo Feng6acc5c22017-03-22 17:27:35 -07001853 FN(get_socket_cookie), \
Daniel Borkmannded092c2017-06-11 00:50:47 +02001854 FN(get_socket_uid), \
Lawrence Brakmo8c4b4c72017-06-30 20:02:46 -07001855 FN(set_hash), \
Daniel Borkmann2be7e212017-07-02 02:13:26 +02001856 FN(setsockopt), \
John Fastabend97f91a72017-07-17 09:29:18 -07001857 FN(skb_adjust_room), \
John Fastabend174a79f2017-08-15 22:32:47 -07001858 FN(redirect_map), \
1859 FN(sk_redirect_map), \
1860 FN(sock_map_update), \
Yonghong Song908432c2017-10-05 09:19:20 -07001861 FN(xdp_adjust_meta), \
Yonghong Song4bebdc72017-10-05 09:19:22 -07001862 FN(perf_event_read_value), \
Lawrence Brakmocd86d1f2017-10-20 11:05:40 -07001863 FN(perf_prog_read_value), \
Josef Bacik9802d862017-12-11 11:36:48 -05001864 FN(getsockopt), \
Lawrence Brakmob13d8802018-01-25 16:14:10 -08001865 FN(override_return), \
John Fastabend4f738ad2018-03-18 12:57:10 -07001866 FN(sock_ops_cb_flags_set), \
John Fastabend2a100312018-03-18 12:57:15 -07001867 FN(msg_redirect_map), \
John Fastabend91843d52018-03-18 12:57:20 -07001868 FN(msg_apply_bytes), \
John Fastabend015632b2018-03-18 12:57:25 -07001869 FN(msg_cork_bytes), \
Andrey Ignatovd74bad42018-03-30 15:08:05 -07001870 FN(msg_pull_data), \
Nikita V. Shirokovb32cc5b2018-04-17 21:42:13 -07001871 FN(bind), \
Eyal Birger12bed762018-04-24 17:50:29 +03001872 FN(xdp_adjust_tail), \
Yonghong Songc195651e2018-04-28 22:28:08 -07001873 FN(skb_get_xfrm_state), \
1874 FN(get_stack),
Thomas Grafebb676d2016-10-27 11:23:51 +02001875
Alexei Starovoitov09756af2014-09-26 00:17:00 -07001876/* integer value in 'imm' field of BPF_CALL instruction selects which helper
1877 * function eBPF program intends to call
1878 */
Thomas Grafebb676d2016-10-27 11:23:51 +02001879#define __BPF_ENUM_FN(x) BPF_FUNC_ ## x
Alexei Starovoitov09756af2014-09-26 00:17:00 -07001880enum bpf_func_id {
Thomas Grafebb676d2016-10-27 11:23:51 +02001881 __BPF_FUNC_MAPPER(__BPF_ENUM_FN)
Alexei Starovoitov09756af2014-09-26 00:17:00 -07001882 __BPF_FUNC_MAX_ID,
1883};
Thomas Grafebb676d2016-10-27 11:23:51 +02001884#undef __BPF_ENUM_FN
Alexei Starovoitov09756af2014-09-26 00:17:00 -07001885
Daniel Borkmann781c53b2016-01-11 01:16:38 +01001886/* All flags used by eBPF helper functions, placed here. */
1887
1888/* BPF_FUNC_skb_store_bytes flags. */
1889#define BPF_F_RECOMPUTE_CSUM (1ULL << 0)
Daniel Borkmann8afd54c2016-03-04 15:15:03 +01001890#define BPF_F_INVALIDATE_HASH (1ULL << 1)
Daniel Borkmann781c53b2016-01-11 01:16:38 +01001891
1892/* BPF_FUNC_l3_csum_replace and BPF_FUNC_l4_csum_replace flags.
1893 * First 4 bits are for passing the header field size.
1894 */
1895#define BPF_F_HDR_FIELD_MASK 0xfULL
1896
1897/* BPF_FUNC_l4_csum_replace flags. */
1898#define BPF_F_PSEUDO_HDR (1ULL << 4)
Daniel Borkmann2f729592016-02-19 23:05:26 +01001899#define BPF_F_MARK_MANGLED_0 (1ULL << 5)
Daniel Borkmannd1b662a2017-01-24 01:06:28 +01001900#define BPF_F_MARK_ENFORCE (1ULL << 6)
Daniel Borkmann781c53b2016-01-11 01:16:38 +01001901
1902/* BPF_FUNC_clone_redirect and BPF_FUNC_redirect flags. */
1903#define BPF_F_INGRESS (1ULL << 0)
1904
Daniel Borkmannc6c33452016-01-11 01:16:39 +01001905/* BPF_FUNC_skb_set_tunnel_key and BPF_FUNC_skb_get_tunnel_key flags. */
1906#define BPF_F_TUNINFO_IPV6 (1ULL << 0)
1907
Yonghong Songc195651e2018-04-28 22:28:08 -07001908/* flags for both BPF_FUNC_get_stackid and BPF_FUNC_get_stack. */
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -08001909#define BPF_F_SKIP_FIELD_MASK 0xffULL
1910#define BPF_F_USER_STACK (1ULL << 8)
Yonghong Songc195651e2018-04-28 22:28:08 -07001911/* flags used by BPF_FUNC_get_stackid only. */
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -08001912#define BPF_F_FAST_STACK_CMP (1ULL << 9)
1913#define BPF_F_REUSE_STACKID (1ULL << 10)
Yonghong Songc195651e2018-04-28 22:28:08 -07001914/* flags used by BPF_FUNC_get_stack only. */
1915#define BPF_F_USER_BUILD_ID (1ULL << 11)
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -08001916
Daniel Borkmann2da897e2016-02-23 02:05:26 +01001917/* BPF_FUNC_skb_set_tunnel_key flags. */
1918#define BPF_F_ZERO_CSUM_TX (1ULL << 1)
Daniel Borkmann22080872016-03-04 15:15:05 +01001919#define BPF_F_DONT_FRAGMENT (1ULL << 2)
William Tu77a51962018-03-01 13:49:57 -08001920#define BPF_F_SEQ_NUMBER (1ULL << 3)
Daniel Borkmann2da897e2016-02-23 02:05:26 +01001921
Yonghong Song908432c2017-10-05 09:19:20 -07001922/* BPF_FUNC_perf_event_output, BPF_FUNC_perf_event_read and
1923 * BPF_FUNC_perf_event_read_value flags.
1924 */
Daniel Borkmann1e337592016-04-18 21:01:23 +02001925#define BPF_F_INDEX_MASK 0xffffffffULL
1926#define BPF_F_CURRENT_CPU BPF_F_INDEX_MASK
Daniel Borkmann555c8a82016-07-14 18:08:05 +02001927/* BPF_FUNC_perf_event_output for sk_buff input context. */
1928#define BPF_F_CTXLEN_MASK (0xfffffULL << 32)
Daniel Borkmann1e337592016-04-18 21:01:23 +02001929
Daniel Borkmann2be7e212017-07-02 02:13:26 +02001930/* Mode for BPF_FUNC_skb_adjust_room helper. */
1931enum bpf_adj_room_mode {
1932 BPF_ADJ_ROOM_NET,
1933};
1934
Alexei Starovoitov9bac3d62015-03-13 11:57:42 -07001935/* user accessible mirror of in-kernel sk_buff.
1936 * new fields can only be added to the end of this structure
1937 */
1938struct __sk_buff {
1939 __u32 len;
1940 __u32 pkt_type;
1941 __u32 mark;
1942 __u32 queue_mapping;
Alexei Starovoitovc2497392015-03-16 18:06:02 -07001943 __u32 protocol;
1944 __u32 vlan_present;
1945 __u32 vlan_tci;
Michal Sekletar27cd5452015-03-24 14:48:41 +01001946 __u32 vlan_proto;
Daniel Borkmannbcad5712015-04-03 20:52:24 +02001947 __u32 priority;
Alexei Starovoitov37e82c22015-05-27 15:30:39 -07001948 __u32 ingress_ifindex;
1949 __u32 ifindex;
Alexei Starovoitovd691f9e2015-06-04 10:11:54 -07001950 __u32 tc_index;
1951 __u32 cb[5];
Daniel Borkmannba7591d2015-08-01 00:46:29 +02001952 __u32 hash;
Daniel Borkmann045efa82015-09-15 23:05:42 -07001953 __u32 tc_classid;
Alexei Starovoitov969bf052016-05-05 19:49:10 -07001954 __u32 data;
1955 __u32 data_end;
Daniel Borkmannb1d9fc42017-04-19 23:01:17 +02001956 __u32 napi_id;
John Fastabend8a31db52017-08-15 22:33:09 -07001957
Daniel Borkmannde8f3a82017-09-25 02:25:51 +02001958 /* Accessed by BPF_PROG_TYPE_sk_skb types from here to ... */
John Fastabend8a31db52017-08-15 22:33:09 -07001959 __u32 family;
1960 __u32 remote_ip4; /* Stored in network byte order */
1961 __u32 local_ip4; /* Stored in network byte order */
1962 __u32 remote_ip6[4]; /* Stored in network byte order */
1963 __u32 local_ip6[4]; /* Stored in network byte order */
1964 __u32 remote_port; /* Stored in network byte order */
1965 __u32 local_port; /* stored in host byte order */
Daniel Borkmannde8f3a82017-09-25 02:25:51 +02001966 /* ... here. */
1967
1968 __u32 data_meta;
Alexei Starovoitov9bac3d62015-03-13 11:57:42 -07001969};
1970
Alexei Starovoitovd3aa45c2015-07-30 15:36:57 -07001971struct bpf_tunnel_key {
1972 __u32 tunnel_id;
Daniel Borkmannc6c33452016-01-11 01:16:39 +01001973 union {
1974 __u32 remote_ipv4;
1975 __u32 remote_ipv6[4];
1976 };
1977 __u8 tunnel_tos;
1978 __u8 tunnel_ttl;
Daniel Borkmannc0e760c2016-03-30 00:02:00 +02001979 __u16 tunnel_ext;
Daniel Borkmann4018ab12016-03-09 03:00:05 +01001980 __u32 tunnel_label;
Alexei Starovoitovd3aa45c2015-07-30 15:36:57 -07001981};
1982
Eyal Birger12bed762018-04-24 17:50:29 +03001983/* user accessible mirror of in-kernel xfrm_state.
1984 * new fields can only be added to the end of this structure
1985 */
1986struct bpf_xfrm_state {
1987 __u32 reqid;
1988 __u32 spi; /* Stored in network byte order */
1989 __u16 family;
1990 union {
1991 __u32 remote_ipv4; /* Stored in network byte order */
1992 __u32 remote_ipv6[4]; /* Stored in network byte order */
1993 };
1994};
1995
Thomas Graf3a0af8f2016-11-30 17:10:10 +01001996/* Generic BPF return codes which all BPF program types may support.
1997 * The values are binary compatible with their TC_ACT_* counter-part to
1998 * provide backwards compatibility with existing SCHED_CLS and SCHED_ACT
1999 * programs.
2000 *
2001 * XDP is handled seprately, see XDP_*.
2002 */
2003enum bpf_ret_code {
2004 BPF_OK = 0,
2005 /* 1 reserved */
2006 BPF_DROP = 2,
2007 /* 3-6 reserved */
2008 BPF_REDIRECT = 7,
2009 /* >127 are reserved for prog type specific return codes */
2010};
2011
David Ahern610236582016-12-01 08:48:04 -08002012struct bpf_sock {
2013 __u32 bound_dev_if;
David Ahernaa4c1032016-12-01 08:48:06 -08002014 __u32 family;
2015 __u32 type;
2016 __u32 protocol;
David Ahern482dca92017-08-31 15:05:44 -07002017 __u32 mark;
2018 __u32 priority;
Andrey Ignatovaac3fc32018-03-30 15:08:07 -07002019 __u32 src_ip4; /* Allows 1,2,4-byte read.
2020 * Stored in network byte order.
2021 */
2022 __u32 src_ip6[4]; /* Allows 1,2,4-byte read.
2023 * Stored in network byte order.
2024 */
2025 __u32 src_port; /* Allows 4-byte read.
2026 * Stored in host byte order
2027 */
David Ahern610236582016-12-01 08:48:04 -08002028};
2029
Martin KaFai Lau17bedab2016-12-07 15:53:11 -08002030#define XDP_PACKET_HEADROOM 256
2031
Brenden Blanco6a773a12016-07-19 12:16:47 -07002032/* User return codes for XDP prog type.
2033 * A valid XDP program must return one of these defined values. All other
Daniel Borkmann9beb8be2017-09-09 01:40:35 +02002034 * return codes are reserved for future use. Unknown return codes will
2035 * result in packet drops and a warning via bpf_warn_invalid_xdp_action().
Brenden Blanco6a773a12016-07-19 12:16:47 -07002036 */
2037enum xdp_action {
2038 XDP_ABORTED = 0,
2039 XDP_DROP,
2040 XDP_PASS,
Brenden Blanco6ce96ca2016-07-19 12:16:53 -07002041 XDP_TX,
John Fastabend814abfa2017-07-17 09:27:07 -07002042 XDP_REDIRECT,
Brenden Blanco6a773a12016-07-19 12:16:47 -07002043};
2044
2045/* user accessible metadata for XDP packet hook
2046 * new fields must be added to the end of this structure
2047 */
2048struct xdp_md {
2049 __u32 data;
2050 __u32 data_end;
Daniel Borkmannde8f3a82017-09-25 02:25:51 +02002051 __u32 data_meta;
Jesper Dangaard Brouerdaaf24c2018-01-11 17:39:09 +01002052 /* Below access go through struct xdp_rxq_info */
Jesper Dangaard Brouer02dd3292018-01-03 11:26:14 +01002053 __u32 ingress_ifindex; /* rxq->dev->ifindex */
2054 __u32 rx_queue_index; /* rxq->queue_index */
Brenden Blanco6a773a12016-07-19 12:16:47 -07002055};
2056
John Fastabend174a79f2017-08-15 22:32:47 -07002057enum sk_action {
John Fastabendbfa640752017-10-27 09:45:53 -07002058 SK_DROP = 0,
2059 SK_PASS,
John Fastabend174a79f2017-08-15 22:32:47 -07002060};
2061
John Fastabend4f738ad2018-03-18 12:57:10 -07002062/* user accessible metadata for SK_MSG packet hook, new fields must
2063 * be added to the end of this structure
2064 */
2065struct sk_msg_md {
2066 void *data;
2067 void *data_end;
2068};
2069
Martin KaFai Lau1e270972017-06-05 12:15:52 -07002070#define BPF_TAG_SIZE 8
2071
2072struct bpf_prog_info {
2073 __u32 type;
2074 __u32 id;
2075 __u8 tag[BPF_TAG_SIZE];
2076 __u32 jited_prog_len;
2077 __u32 xlated_prog_len;
2078 __aligned_u64 jited_prog_insns;
2079 __aligned_u64 xlated_prog_insns;
Martin KaFai Laucb4d2b32017-09-27 14:37:52 -07002080 __u64 load_time; /* ns since boottime */
2081 __u32 created_by_uid;
2082 __u32 nr_map_ids;
2083 __aligned_u64 map_ids;
Martin KaFai Lau067cae42017-10-05 21:52:12 -07002084 char name[BPF_OBJ_NAME_LEN];
Jakub Kicinski675fc272017-12-27 18:39:09 -08002085 __u32 ifindex;
Jiri Olsab85fab02018-04-25 19:41:06 +02002086 __u32 gpl_compatible:1;
Jakub Kicinski675fc272017-12-27 18:39:09 -08002087 __u64 netns_dev;
2088 __u64 netns_ino;
Martin KaFai Lau1e270972017-06-05 12:15:52 -07002089} __attribute__((aligned(8)));
2090
2091struct bpf_map_info {
2092 __u32 type;
2093 __u32 id;
2094 __u32 key_size;
2095 __u32 value_size;
2096 __u32 max_entries;
2097 __u32 map_flags;
Martin KaFai Lau067cae42017-10-05 21:52:12 -07002098 char name[BPF_OBJ_NAME_LEN];
Jakub Kicinski52775b32018-01-17 19:13:28 -08002099 __u32 ifindex;
2100 __u64 netns_dev;
2101 __u64 netns_ino;
Martin KaFai Lau1e270972017-06-05 12:15:52 -07002102} __attribute__((aligned(8)));
2103
Andrey Ignatov4fbac772018-03-30 15:08:02 -07002104/* User bpf_sock_addr struct to access socket fields and sockaddr struct passed
2105 * by user and intended to be used by socket (e.g. to bind to, depends on
2106 * attach attach type).
2107 */
2108struct bpf_sock_addr {
2109 __u32 user_family; /* Allows 4-byte read, but no write. */
2110 __u32 user_ip4; /* Allows 1,2,4-byte read and 4-byte write.
2111 * Stored in network byte order.
2112 */
2113 __u32 user_ip6[4]; /* Allows 1,2,4-byte read an 4-byte write.
2114 * Stored in network byte order.
2115 */
2116 __u32 user_port; /* Allows 4-byte read and write.
2117 * Stored in network byte order
2118 */
2119 __u32 family; /* Allows 4-byte read, but no write */
2120 __u32 type; /* Allows 4-byte read, but no write */
2121 __u32 protocol; /* Allows 4-byte read, but no write */
2122};
2123
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002124/* User bpf_sock_ops struct to access socket values and specify request ops
2125 * and their replies.
2126 * Some of this fields are in network (bigendian) byte order and may need
2127 * to be converted before use (bpf_ntohl() defined in samples/bpf/bpf_endian.h).
2128 * New fields can only be added at the end of this structure
2129 */
2130struct bpf_sock_ops {
2131 __u32 op;
2132 union {
Lawrence Brakmode525be2018-01-25 16:14:09 -08002133 __u32 args[4]; /* Optionally passed to bpf program */
2134 __u32 reply; /* Returned by bpf program */
2135 __u32 replylong[4]; /* Optionally returned by bpf prog */
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002136 };
2137 __u32 family;
2138 __u32 remote_ip4; /* Stored in network byte order */
2139 __u32 local_ip4; /* Stored in network byte order */
2140 __u32 remote_ip6[4]; /* Stored in network byte order */
2141 __u32 local_ip6[4]; /* Stored in network byte order */
2142 __u32 remote_port; /* Stored in network byte order */
2143 __u32 local_port; /* stored in host byte order */
Lawrence Brakmof19397a2017-12-01 10:15:04 -08002144 __u32 is_fullsock; /* Some TCP fields are only valid if
2145 * there is a full socket. If not, the
2146 * fields read as zero.
2147 */
2148 __u32 snd_cwnd;
2149 __u32 srtt_us; /* Averaged RTT << 3 in usecs */
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002150 __u32 bpf_sock_ops_cb_flags; /* flags defined in uapi/linux/tcp.h */
Lawrence Brakmo44f0e432018-01-25 16:14:12 -08002151 __u32 state;
2152 __u32 rtt_min;
2153 __u32 snd_ssthresh;
2154 __u32 rcv_nxt;
2155 __u32 snd_nxt;
2156 __u32 snd_una;
2157 __u32 mss_cache;
2158 __u32 ecn_flags;
2159 __u32 rate_delivered;
2160 __u32 rate_interval_us;
2161 __u32 packets_out;
2162 __u32 retrans_out;
2163 __u32 total_retrans;
2164 __u32 segs_in;
2165 __u32 data_segs_in;
2166 __u32 segs_out;
2167 __u32 data_segs_out;
2168 __u32 lost_out;
2169 __u32 sacked_out;
2170 __u32 sk_txhash;
2171 __u64 bytes_received;
2172 __u64 bytes_acked;
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002173};
2174
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002175/* Definitions for bpf_sock_ops_cb_flags */
Lawrence Brakmof89013f2018-01-25 16:14:11 -08002176#define BPF_SOCK_OPS_RTO_CB_FLAG (1<<0)
Lawrence Brakmoa31ad292018-01-25 16:14:14 -08002177#define BPF_SOCK_OPS_RETRANS_CB_FLAG (1<<1)
Lawrence Brakmod4487492018-01-25 16:14:15 -08002178#define BPF_SOCK_OPS_STATE_CB_FLAG (1<<2)
2179#define BPF_SOCK_OPS_ALL_CB_FLAGS 0x7 /* Mask of all currently
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002180 * supported cb flags
2181 */
2182
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002183/* List of known BPF sock_ops operators.
2184 * New entries can only be added at the end
2185 */
2186enum {
2187 BPF_SOCK_OPS_VOID,
Lawrence Brakmo8550f322017-06-30 20:02:42 -07002188 BPF_SOCK_OPS_TIMEOUT_INIT, /* Should return SYN-RTO value to use or
2189 * -1 if default value should be used
2190 */
Lawrence Brakmo13d3b1e2017-06-30 20:02:44 -07002191 BPF_SOCK_OPS_RWND_INIT, /* Should return initial advertized
2192 * window (in packets) or -1 if default
2193 * value should be used
2194 */
Lawrence Brakmo9872a4b2017-06-30 20:02:47 -07002195 BPF_SOCK_OPS_TCP_CONNECT_CB, /* Calls BPF program right before an
2196 * active connection is initialized
2197 */
2198 BPF_SOCK_OPS_ACTIVE_ESTABLISHED_CB, /* Calls BPF program when an
2199 * active connection is
2200 * established
2201 */
2202 BPF_SOCK_OPS_PASSIVE_ESTABLISHED_CB, /* Calls BPF program when a
2203 * passive connection is
2204 * established
2205 */
Lawrence Brakmo91b5b212017-06-30 20:02:49 -07002206 BPF_SOCK_OPS_NEEDS_ECN, /* If connection's congestion control
2207 * needs ECN
2208 */
Lawrence Brakmoe6546ef2017-10-20 11:05:39 -07002209 BPF_SOCK_OPS_BASE_RTT, /* Get base RTT. The correct value is
2210 * based on the path and may be
2211 * dependent on the congestion control
2212 * algorithm. In general it indicates
2213 * a congestion threshold. RTTs above
2214 * this indicate congestion
2215 */
Lawrence Brakmof89013f2018-01-25 16:14:11 -08002216 BPF_SOCK_OPS_RTO_CB, /* Called when an RTO has triggered.
2217 * Arg1: value of icsk_retransmits
2218 * Arg2: value of icsk_rto
2219 * Arg3: whether RTO has expired
2220 */
Lawrence Brakmoa31ad292018-01-25 16:14:14 -08002221 BPF_SOCK_OPS_RETRANS_CB, /* Called when skb is retransmitted.
2222 * Arg1: sequence number of 1st byte
2223 * Arg2: # segments
2224 * Arg3: return value of
2225 * tcp_transmit_skb (0 => success)
2226 */
Lawrence Brakmod4487492018-01-25 16:14:15 -08002227 BPF_SOCK_OPS_STATE_CB, /* Called when TCP changes state.
2228 * Arg1: old_state
2229 * Arg2: new_state
2230 */
2231};
2232
2233/* List of TCP states. There is a build check in net/ipv4/tcp.c to detect
2234 * changes between the TCP and BPF versions. Ideally this should never happen.
2235 * If it does, we need to add code to convert them before calling
2236 * the BPF sock_ops function.
2237 */
2238enum {
2239 BPF_TCP_ESTABLISHED = 1,
2240 BPF_TCP_SYN_SENT,
2241 BPF_TCP_SYN_RECV,
2242 BPF_TCP_FIN_WAIT1,
2243 BPF_TCP_FIN_WAIT2,
2244 BPF_TCP_TIME_WAIT,
2245 BPF_TCP_CLOSE,
2246 BPF_TCP_CLOSE_WAIT,
2247 BPF_TCP_LAST_ACK,
2248 BPF_TCP_LISTEN,
2249 BPF_TCP_CLOSING, /* Now a valid state */
2250 BPF_TCP_NEW_SYN_RECV,
2251
2252 BPF_TCP_MAX_STATES /* Leave at the end! */
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002253};
2254
Lawrence Brakmofc747812017-06-30 20:02:51 -07002255#define TCP_BPF_IW 1001 /* Set TCP initial congestion window */
Lawrence Brakmo13bf9642017-06-30 20:02:53 -07002256#define TCP_BPF_SNDCWND_CLAMP 1002 /* Set sndcwnd_clamp */
Lawrence Brakmofc747812017-06-30 20:02:51 -07002257
Yonghong Song908432c2017-10-05 09:19:20 -07002258struct bpf_perf_event_value {
2259 __u64 counter;
2260 __u64 enabled;
2261 __u64 running;
2262};
2263
Roman Gushchinebc614f2017-11-05 08:15:32 -05002264#define BPF_DEVCG_ACC_MKNOD (1ULL << 0)
2265#define BPF_DEVCG_ACC_READ (1ULL << 1)
2266#define BPF_DEVCG_ACC_WRITE (1ULL << 2)
2267
2268#define BPF_DEVCG_DEV_BLOCK (1ULL << 0)
2269#define BPF_DEVCG_DEV_CHAR (1ULL << 1)
2270
2271struct bpf_cgroup_dev_ctx {
Yonghong Song06ef0cc2017-12-18 10:13:44 -08002272 /* access_type encoded as (BPF_DEVCG_ACC_* << 16) | BPF_DEVCG_DEV_* */
2273 __u32 access_type;
Roman Gushchinebc614f2017-11-05 08:15:32 -05002274 __u32 major;
2275 __u32 minor;
2276};
2277
Alexei Starovoitovc4f66992018-03-28 12:05:37 -07002278struct bpf_raw_tracepoint_args {
2279 __u64 args[0];
2280};
2281
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -07002282#endif /* _UAPI__LINUX_BPF_H__ */