blob: 47d606d744cc672ac6f680e6dc79ec6ace77b65c [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
Roman Gushchinde9cbba2018-08-02 14:27:18 -070078struct bpf_cgroup_storage_key {
79 __u64 cgroup_inode_id; /* cgroup inode id */
80 __u32 attach_type; /* program attach type */
81};
82
Daniel Borkmannb2197752015-10-29 14:58:09 +010083/* BPF syscall commands, see bpf(2) man-page for details. */
Alexei Starovoitov99c55f72014-09-26 00:16:57 -070084enum bpf_cmd {
Alexei Starovoitov99c55f72014-09-26 00:16:57 -070085 BPF_MAP_CREATE,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070086 BPF_MAP_LOOKUP_ELEM,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070087 BPF_MAP_UPDATE_ELEM,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070088 BPF_MAP_DELETE_ELEM,
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -070089 BPF_MAP_GET_NEXT_KEY,
Alexei Starovoitov09756af2014-09-26 00:17:00 -070090 BPF_PROG_LOAD,
Daniel Borkmannb2197752015-10-29 14:58:09 +010091 BPF_OBJ_PIN,
92 BPF_OBJ_GET,
Daniel Mackf4324552016-11-23 16:52:27 +010093 BPF_PROG_ATTACH,
94 BPF_PROG_DETACH,
Alexei Starovoitov1cf1cae2017-03-30 21:45:38 -070095 BPF_PROG_TEST_RUN,
Martin KaFai Lau34ad5582017-06-05 12:15:48 -070096 BPF_PROG_GET_NEXT_ID,
97 BPF_MAP_GET_NEXT_ID,
Martin KaFai Laub16d9aa2017-06-05 12:15:49 -070098 BPF_PROG_GET_FD_BY_ID,
Martin KaFai Laubd5f5f4e2017-06-05 12:15:50 -070099 BPF_MAP_GET_FD_BY_ID,
Martin KaFai Lau1e270972017-06-05 12:15:52 -0700100 BPF_OBJ_GET_INFO_BY_FD,
Alexei Starovoitov468e2f62017-10-02 22:50:22 -0700101 BPF_PROG_QUERY,
Alexei Starovoitovc4f66992018-03-28 12:05:37 -0700102 BPF_RAW_TRACEPOINT_OPEN,
Martin KaFai Lauf56a6532018-04-18 15:56:01 -0700103 BPF_BTF_LOAD,
Martin KaFai Lau78958fc2018-05-04 14:49:51 -0700104 BPF_BTF_GET_FD_BY_ID,
Yonghong Song41bdc4b2018-05-24 11:21:09 -0700105 BPF_TASK_FD_QUERY,
Mauricio Vasquez Bbd513cd2018-10-18 15:16:30 +0200106 BPF_MAP_LOOKUP_AND_DELETE_ELEM,
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700107};
108
109enum bpf_map_type {
110 BPF_MAP_TYPE_UNSPEC,
Alexei Starovoitov0f8e4bd2014-11-13 17:36:45 -0800111 BPF_MAP_TYPE_HASH,
Alexei Starovoitov28fbcfa2014-11-13 17:36:46 -0800112 BPF_MAP_TYPE_ARRAY,
Alexei Starovoitov04fd61ab2015-05-19 16:59:03 -0700113 BPF_MAP_TYPE_PROG_ARRAY,
Kaixu Xiaea317b22015-08-06 07:02:34 +0000114 BPF_MAP_TYPE_PERF_EVENT_ARRAY,
Alexei Starovoitov824bd0c2016-02-01 22:39:53 -0800115 BPF_MAP_TYPE_PERCPU_HASH,
Alexei Starovoitova10423b2016-02-01 22:39:54 -0800116 BPF_MAP_TYPE_PERCPU_ARRAY,
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -0800117 BPF_MAP_TYPE_STACK_TRACE,
Martin KaFai Lau4ed8ec52016-06-30 10:28:43 -0700118 BPF_MAP_TYPE_CGROUP_ARRAY,
Martin KaFai Lau29ba7322016-11-11 10:55:09 -0800119 BPF_MAP_TYPE_LRU_HASH,
Martin KaFai Lau8f844932016-11-11 10:55:10 -0800120 BPF_MAP_TYPE_LRU_PERCPU_HASH,
Daniel Mackb95a5c42017-01-21 17:26:11 +0100121 BPF_MAP_TYPE_LPM_TRIE,
Martin KaFai Lau56f668d2017-03-22 10:00:33 -0700122 BPF_MAP_TYPE_ARRAY_OF_MAPS,
Martin KaFai Laubcc6b1b2017-03-22 10:00:34 -0700123 BPF_MAP_TYPE_HASH_OF_MAPS,
John Fastabend546ac1f2017-07-17 09:28:56 -0700124 BPF_MAP_TYPE_DEVMAP,
John Fastabend174a79f2017-08-15 22:32:47 -0700125 BPF_MAP_TYPE_SOCKMAP,
Jesper Dangaard Brouer6710e112017-10-16 12:19:28 +0200126 BPF_MAP_TYPE_CPUMAP,
Björn Töpelfbfc504a2018-05-02 13:01:28 +0200127 BPF_MAP_TYPE_XSKMAP,
John Fastabend81110382018-05-14 10:00:17 -0700128 BPF_MAP_TYPE_SOCKHASH,
Roman Gushchinde9cbba2018-08-02 14:27:18 -0700129 BPF_MAP_TYPE_CGROUP_STORAGE,
Martin KaFai Lau5dc4c4b2018-08-08 01:01:24 -0700130 BPF_MAP_TYPE_REUSEPORT_SOCKARRAY,
Roman Gushchinb741f162018-09-28 14:45:43 +0000131 BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE,
Mauricio Vasquez Bf1a2e442018-10-18 15:16:25 +0200132 BPF_MAP_TYPE_QUEUE,
133 BPF_MAP_TYPE_STACK,
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700134};
135
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700136enum bpf_prog_type {
137 BPF_PROG_TYPE_UNSPEC,
Alexei Starovoitovddd872b2014-12-01 15:06:34 -0800138 BPF_PROG_TYPE_SOCKET_FILTER,
Alexei Starovoitov25415172015-03-25 12:49:20 -0700139 BPF_PROG_TYPE_KPROBE,
Daniel Borkmann96be4322015-03-01 12:31:46 +0100140 BPF_PROG_TYPE_SCHED_CLS,
Daniel Borkmann94caee8c2015-03-20 15:11:11 +0100141 BPF_PROG_TYPE_SCHED_ACT,
Alexei Starovoitov98b5c2c2016-04-06 18:43:25 -0700142 BPF_PROG_TYPE_TRACEPOINT,
Brenden Blanco6a773a12016-07-19 12:16:47 -0700143 BPF_PROG_TYPE_XDP,
Alexei Starovoitov0515e592016-09-01 18:37:22 -0700144 BPF_PROG_TYPE_PERF_EVENT,
Daniel Mack0e336612016-11-23 16:52:25 +0100145 BPF_PROG_TYPE_CGROUP_SKB,
David Ahern610236582016-12-01 08:48:04 -0800146 BPF_PROG_TYPE_CGROUP_SOCK,
Thomas Graf3a0af8f2016-11-30 17:10:10 +0100147 BPF_PROG_TYPE_LWT_IN,
148 BPF_PROG_TYPE_LWT_OUT,
149 BPF_PROG_TYPE_LWT_XMIT,
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700150 BPF_PROG_TYPE_SOCK_OPS,
John Fastabendb005fd12017-08-15 22:31:58 -0700151 BPF_PROG_TYPE_SK_SKB,
Roman Gushchinebc614f2017-11-05 08:15:32 -0500152 BPF_PROG_TYPE_CGROUP_DEVICE,
John Fastabend4f738ad2018-03-18 12:57:10 -0700153 BPF_PROG_TYPE_SK_MSG,
Alexei Starovoitovc4f66992018-03-28 12:05:37 -0700154 BPF_PROG_TYPE_RAW_TRACEPOINT,
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700155 BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
Mathieu Xhonneux004d4b22018-05-20 14:58:16 +0100156 BPF_PROG_TYPE_LWT_SEG6LOCAL,
Sean Youngf4364dc2018-05-27 12:24:09 +0100157 BPF_PROG_TYPE_LIRC_MODE2,
Martin KaFai Lau2dbb9b92018-08-08 01:01:25 -0700158 BPF_PROG_TYPE_SK_REUSEPORT,
Petar Penkovd58e4682018-09-14 07:46:18 -0700159 BPF_PROG_TYPE_FLOW_DISSECTOR,
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700160};
161
Daniel Mack0e336612016-11-23 16:52:25 +0100162enum bpf_attach_type {
163 BPF_CGROUP_INET_INGRESS,
164 BPF_CGROUP_INET_EGRESS,
David Ahern610236582016-12-01 08:48:04 -0800165 BPF_CGROUP_INET_SOCK_CREATE,
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700166 BPF_CGROUP_SOCK_OPS,
John Fastabend464bc0f2017-08-28 07:10:04 -0700167 BPF_SK_SKB_STREAM_PARSER,
168 BPF_SK_SKB_STREAM_VERDICT,
Roman Gushchinebc614f2017-11-05 08:15:32 -0500169 BPF_CGROUP_DEVICE,
John Fastabend4f738ad2018-03-18 12:57:10 -0700170 BPF_SK_MSG_VERDICT,
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700171 BPF_CGROUP_INET4_BIND,
172 BPF_CGROUP_INET6_BIND,
Andrey Ignatovd74bad42018-03-30 15:08:05 -0700173 BPF_CGROUP_INET4_CONNECT,
174 BPF_CGROUP_INET6_CONNECT,
Andrey Ignatovaac3fc32018-03-30 15:08:07 -0700175 BPF_CGROUP_INET4_POST_BIND,
176 BPF_CGROUP_INET6_POST_BIND,
Andrey Ignatov1cedee12018-05-25 08:55:23 -0700177 BPF_CGROUP_UDP4_SENDMSG,
178 BPF_CGROUP_UDP6_SENDMSG,
Sean Youngf4364dc2018-05-27 12:24:09 +0100179 BPF_LIRC_MODE2,
Petar Penkovd58e4682018-09-14 07:46:18 -0700180 BPF_FLOW_DISSECTOR,
Daniel Mack0e336612016-11-23 16:52:25 +0100181 __MAX_BPF_ATTACH_TYPE
182};
183
184#define MAX_BPF_ATTACH_TYPE __MAX_BPF_ATTACH_TYPE
185
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700186/* cgroup-bpf attach flags used in BPF_PROG_ATTACH command
187 *
188 * NONE(default): No further bpf programs allowed in the subtree.
189 *
190 * BPF_F_ALLOW_OVERRIDE: If a sub-cgroup installs some bpf program,
191 * the program in this cgroup yields to sub-cgroup program.
192 *
193 * BPF_F_ALLOW_MULTI: If a sub-cgroup installs some bpf program,
194 * that cgroup program gets run in addition to the program in this cgroup.
195 *
196 * Only one program is allowed to be attached to a cgroup with
197 * NONE or BPF_F_ALLOW_OVERRIDE flag.
198 * Attaching another program on top of NONE or BPF_F_ALLOW_OVERRIDE will
199 * release old program and attach the new one. Attach flags has to match.
200 *
201 * Multiple programs are allowed to be attached to a cgroup with
202 * BPF_F_ALLOW_MULTI flag. They are executed in FIFO order
203 * (those that were attached first, run first)
204 * The programs of sub-cgroup are executed first, then programs of
205 * this cgroup and then programs of parent cgroup.
206 * When children program makes decision (like picking TCP CA or sock bind)
207 * parent program has a chance to override it.
208 *
209 * A cgroup with MULTI or OVERRIDE flag allows any attach flags in sub-cgroups.
210 * A cgroup with NONE doesn't allow any programs in sub-cgroups.
211 * Ex1:
212 * cgrp1 (MULTI progs A, B) ->
213 * cgrp2 (OVERRIDE prog C) ->
214 * cgrp3 (MULTI prog D) ->
215 * cgrp4 (OVERRIDE prog E) ->
216 * cgrp5 (NONE prog F)
217 * the event in cgrp5 triggers execution of F,D,A,B in that order.
218 * if prog F is detached, the execution is E,D,A,B
219 * if prog F and D are detached, the execution is E,A,B
220 * if prog F, E and D are detached, the execution is C,A,B
221 *
222 * All eligible programs are executed regardless of return code from
223 * earlier programs.
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800224 */
225#define BPF_F_ALLOW_OVERRIDE (1U << 0)
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700226#define BPF_F_ALLOW_MULTI (1U << 1)
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800227
David S. Millere07b98d2017-05-10 11:38:07 -0700228/* If BPF_F_STRICT_ALIGNMENT is used in BPF_PROG_LOAD command, the
229 * verifier will perform strict alignment checking as if the kernel
230 * has been built with CONFIG_EFFICIENT_UNALIGNED_ACCESS not set,
231 * and NET_IP_ALIGN defined to 2.
232 */
233#define BPF_F_STRICT_ALIGNMENT (1U << 0)
234
Alexei Starovoitovcc8b0b92017-12-14 17:55:05 -0800235/* when bpf_ldimm64->src_reg == BPF_PSEUDO_MAP_FD, bpf_ldimm64->imm == fd */
Daniel Borkmannf1a66f82015-03-01 12:31:43 +0100236#define BPF_PSEUDO_MAP_FD 1
237
Alexei Starovoitovcc8b0b92017-12-14 17:55:05 -0800238/* when bpf_call->src_reg == BPF_PSEUDO_CALL, bpf_call->imm == pc-relative
239 * offset to another bpf function
240 */
241#define BPF_PSEUDO_CALL 1
242
Alexei Starovoitov3274f522014-11-13 17:36:44 -0800243/* flags for BPF_MAP_UPDATE_ELEM command */
244#define BPF_ANY 0 /* create new element or update existing */
245#define BPF_NOEXIST 1 /* create new element if it didn't exist */
246#define BPF_EXIST 2 /* update existing element */
247
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700248/* flags for BPF_MAP_CREATE command */
Alexei Starovoitov6c905982016-03-07 21:57:15 -0800249#define BPF_F_NO_PREALLOC (1U << 0)
Martin KaFai Lau29ba7322016-11-11 10:55:09 -0800250/* Instead of having one common LRU list in the
Martin KaFai Lau8f844932016-11-11 10:55:10 -0800251 * BPF_MAP_TYPE_LRU_[PERCPU_]HASH map, use a percpu LRU list
Martin KaFai Lau29ba7322016-11-11 10:55:09 -0800252 * which can scale and perform better.
253 * Note, the LRU nodes (including free nodes) cannot be moved
254 * across different LRU lists.
255 */
256#define BPF_F_NO_COMMON_LRU (1U << 1)
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700257/* Specify numa node during map creation */
258#define BPF_F_NUMA_NODE (1U << 2)
Alexei Starovoitov6c905982016-03-07 21:57:15 -0800259
Alexei Starovoitov468e2f62017-10-02 22:50:22 -0700260/* flags for BPF_PROG_QUERY */
261#define BPF_F_QUERY_EFFECTIVE (1U << 0)
262
Martin KaFai Laucb4d2b32017-09-27 14:37:52 -0700263#define BPF_OBJ_NAME_LEN 16U
264
Chenbo Feng6e71b042017-10-18 13:00:22 -0700265/* Flags for accessing BPF object */
266#define BPF_F_RDONLY (1U << 3)
267#define BPF_F_WRONLY (1U << 4)
268
Song Liu615755a2018-03-14 10:23:21 -0700269/* Flag for stack_map, store build_id+offset instead of pointer */
270#define BPF_F_STACK_BUILD_ID (1U << 5)
271
272enum bpf_stack_build_id_status {
273 /* user space need an empty entry to identify end of a trace */
274 BPF_STACK_BUILD_ID_EMPTY = 0,
275 /* with valid build_id and offset */
276 BPF_STACK_BUILD_ID_VALID = 1,
277 /* couldn't get build_id, fallback to ip */
278 BPF_STACK_BUILD_ID_IP = 2,
279};
280
281#define BPF_BUILD_ID_SIZE 20
282struct bpf_stack_build_id {
283 __s32 status;
284 unsigned char build_id[BPF_BUILD_ID_SIZE];
285 union {
286 __u64 offset;
287 __u64 ip;
288 };
289};
290
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700291union bpf_attr {
292 struct { /* anonymous struct used by BPF_MAP_CREATE command */
293 __u32 map_type; /* one of enum bpf_map_type */
294 __u32 key_size; /* size of key in bytes */
295 __u32 value_size; /* size of value in bytes */
296 __u32 max_entries; /* max number of entries in a map */
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700297 __u32 map_flags; /* BPF_MAP_CREATE related
298 * flags defined above.
299 */
Martin KaFai Lau56f668d2017-03-22 10:00:33 -0700300 __u32 inner_map_fd; /* fd pointing to the inner map */
Martin KaFai Lau96eabe72017-08-18 11:28:00 -0700301 __u32 numa_node; /* numa node (effective only if
302 * BPF_F_NUMA_NODE is set).
303 */
Martin KaFai Lau067cae42017-10-05 21:52:12 -0700304 char map_name[BPF_OBJ_NAME_LEN];
Jakub Kicinskia3884572018-01-11 20:29:09 -0800305 __u32 map_ifindex; /* ifindex of netdev to create on */
Martin KaFai Laua26ca7c2018-04-18 15:56:03 -0700306 __u32 btf_fd; /* fd pointing to a BTF type data */
Martin KaFai Lau9b2cf322018-05-22 14:57:21 -0700307 __u32 btf_key_type_id; /* BTF type_id of the key */
308 __u32 btf_value_type_id; /* BTF type_id of the value */
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700309 };
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -0700310
311 struct { /* anonymous struct used by BPF_MAP_*_ELEM commands */
312 __u32 map_fd;
313 __aligned_u64 key;
314 union {
315 __aligned_u64 value;
316 __aligned_u64 next_key;
317 };
Alexei Starovoitov3274f522014-11-13 17:36:44 -0800318 __u64 flags;
Alexei Starovoitovdb20fd22014-09-26 00:16:59 -0700319 };
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700320
321 struct { /* anonymous struct used by BPF_PROG_LOAD command */
322 __u32 prog_type; /* one of enum bpf_prog_type */
323 __u32 insn_cnt;
324 __aligned_u64 insns;
325 __aligned_u64 license;
Alexei Starovoitovcbd35702014-09-26 00:17:03 -0700326 __u32 log_level; /* verbosity level of verifier */
327 __u32 log_size; /* size of user buffer */
328 __aligned_u64 log_buf; /* user supplied buffer */
Alexei Starovoitov25415172015-03-25 12:49:20 -0700329 __u32 kern_version; /* checked when prog_type=kprobe */
David S. Millere07b98d2017-05-10 11:38:07 -0700330 __u32 prog_flags;
Martin KaFai Lau067cae42017-10-05 21:52:12 -0700331 char prog_name[BPF_OBJ_NAME_LEN];
Jakub Kicinski1f6f4cb2017-11-20 15:21:53 -0800332 __u32 prog_ifindex; /* ifindex of netdev to prep for */
Andrey Ignatov5e43f892018-03-30 15:08:00 -0700333 /* For some prog types expected attach type must be known at
334 * load time to verify attach type specific parts of prog
335 * (context accesses, allowed helpers, etc).
336 */
337 __u32 expected_attach_type;
Alexei Starovoitov09756af2014-09-26 00:17:00 -0700338 };
Daniel Borkmannb2197752015-10-29 14:58:09 +0100339
340 struct { /* anonymous struct used by BPF_OBJ_* commands */
341 __aligned_u64 pathname;
342 __u32 bpf_fd;
Chenbo Feng6e71b042017-10-18 13:00:22 -0700343 __u32 file_flags;
Daniel Borkmannb2197752015-10-29 14:58:09 +0100344 };
Daniel Mackf4324552016-11-23 16:52:27 +0100345
346 struct { /* anonymous struct used by BPF_PROG_ATTACH/DETACH commands */
347 __u32 target_fd; /* container object to attach to */
348 __u32 attach_bpf_fd; /* eBPF program to attach */
349 __u32 attach_type;
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800350 __u32 attach_flags;
Daniel Mackf4324552016-11-23 16:52:27 +0100351 };
Alexei Starovoitov1cf1cae2017-03-30 21:45:38 -0700352
353 struct { /* anonymous struct used by BPF_PROG_TEST_RUN command */
354 __u32 prog_fd;
355 __u32 retval;
356 __u32 data_size_in;
357 __u32 data_size_out;
358 __aligned_u64 data_in;
359 __aligned_u64 data_out;
360 __u32 repeat;
361 __u32 duration;
362 } test;
Martin KaFai Lau34ad5582017-06-05 12:15:48 -0700363
Martin KaFai Laub16d9aa2017-06-05 12:15:49 -0700364 struct { /* anonymous struct used by BPF_*_GET_*_ID */
365 union {
366 __u32 start_id;
367 __u32 prog_id;
Martin KaFai Laubd5f5f4e2017-06-05 12:15:50 -0700368 __u32 map_id;
Martin KaFai Lau78958fc2018-05-04 14:49:51 -0700369 __u32 btf_id;
Martin KaFai Laub16d9aa2017-06-05 12:15:49 -0700370 };
Martin KaFai Lau34ad5582017-06-05 12:15:48 -0700371 __u32 next_id;
Chenbo Feng6e71b042017-10-18 13:00:22 -0700372 __u32 open_flags;
Martin KaFai Lau34ad5582017-06-05 12:15:48 -0700373 };
Martin KaFai Lau1e270972017-06-05 12:15:52 -0700374
375 struct { /* anonymous struct used by BPF_OBJ_GET_INFO_BY_FD */
376 __u32 bpf_fd;
377 __u32 info_len;
378 __aligned_u64 info;
379 } info;
Alexei Starovoitov468e2f62017-10-02 22:50:22 -0700380
381 struct { /* anonymous struct used by BPF_PROG_QUERY command */
382 __u32 target_fd; /* container object to query */
383 __u32 attach_type;
384 __u32 query_flags;
385 __u32 attach_flags;
386 __aligned_u64 prog_ids;
387 __u32 prog_cnt;
388 } query;
Alexei Starovoitovc4f66992018-03-28 12:05:37 -0700389
390 struct {
391 __u64 name;
392 __u32 prog_fd;
393 } raw_tracepoint;
Martin KaFai Lauf56a6532018-04-18 15:56:01 -0700394
395 struct { /* anonymous struct for BPF_BTF_LOAD */
396 __aligned_u64 btf;
397 __aligned_u64 btf_log_buf;
398 __u32 btf_size;
399 __u32 btf_log_size;
400 __u32 btf_log_level;
401 };
Yonghong Song41bdc4b2018-05-24 11:21:09 -0700402
403 struct {
404 __u32 pid; /* input: pid */
405 __u32 fd; /* input: fd */
406 __u32 flags; /* input: flags */
407 __u32 buf_len; /* input/output: buf len */
408 __aligned_u64 buf; /* input/output:
409 * tp_name for tracepoint
410 * symbol for kprobe
411 * filename for uprobe
412 */
413 __u32 prog_id; /* output: prod_id */
414 __u32 fd_type; /* output: BPF_FD_TYPE_* */
415 __u64 probe_offset; /* output: probe_offset */
416 __u64 probe_addr; /* output: probe_addr */
417 } task_fd_query;
Alexei Starovoitov99c55f72014-09-26 00:16:57 -0700418} __attribute__((aligned(8)));
419
Quentin Monnet56a092c2018-04-25 18:16:52 +0100420/* The description below is an attempt at providing documentation to eBPF
421 * developers about the multiple available eBPF helper functions. It can be
422 * parsed and used to produce a manual page. The workflow is the following,
423 * and requires the rst2man utility:
Thomas Grafebb676d2016-10-27 11:23:51 +0200424 *
Quentin Monnet56a092c2018-04-25 18:16:52 +0100425 * $ ./scripts/bpf_helpers_doc.py \
426 * --filename include/uapi/linux/bpf.h > /tmp/bpf-helpers.rst
427 * $ rst2man /tmp/bpf-helpers.rst > /tmp/bpf-helpers.7
428 * $ man /tmp/bpf-helpers.7
Thomas Grafebb676d2016-10-27 11:23:51 +0200429 *
Quentin Monnet56a092c2018-04-25 18:16:52 +0100430 * Note that in order to produce this external documentation, some RST
431 * formatting is used in the descriptions to get "bold" and "italics" in
432 * manual pages. Also note that the few trailing white spaces are
433 * intentional, removing them would break paragraphs for rst2man.
Thomas Grafebb676d2016-10-27 11:23:51 +0200434 *
Quentin Monnet56a092c2018-04-25 18:16:52 +0100435 * Start of BPF helper function descriptions:
Quentin Monnetad4a5222018-04-25 18:16:53 +0100436 *
437 * void *bpf_map_lookup_elem(struct bpf_map *map, const void *key)
438 * Description
439 * Perform a lookup in *map* for an entry associated to *key*.
440 * Return
441 * Map value associated to *key*, or **NULL** if no entry was
442 * found.
443 *
444 * int bpf_map_update_elem(struct bpf_map *map, const void *key, const void *value, u64 flags)
445 * Description
446 * Add or update the value of the entry associated to *key* in
447 * *map* with *value*. *flags* is one of:
448 *
449 * **BPF_NOEXIST**
450 * The entry for *key* must not exist in the map.
451 * **BPF_EXIST**
452 * The entry for *key* must already exist in the map.
453 * **BPF_ANY**
454 * No condition on the existence of the entry for *key*.
455 *
456 * Flag value **BPF_NOEXIST** cannot be used for maps of types
457 * **BPF_MAP_TYPE_ARRAY** or **BPF_MAP_TYPE_PERCPU_ARRAY** (all
458 * elements always exist), the helper would return an error.
459 * Return
460 * 0 on success, or a negative error in case of failure.
461 *
462 * int bpf_map_delete_elem(struct bpf_map *map, const void *key)
463 * Description
464 * Delete entry with *key* from *map*.
465 * Return
466 * 0 on success, or a negative error in case of failure.
467 *
Mauricio Vasquez Bf1a2e442018-10-18 15:16:25 +0200468 * int bpf_map_push_elem(struct bpf_map *map, const void *value, u64 flags)
469 * Description
470 * Push an element *value* in *map*. *flags* is one of:
471 *
472 * **BPF_EXIST**
473 * If the queue/stack is full, the oldest element is removed to
474 * make room for this.
475 * Return
476 * 0 on success, or a negative error in case of failure.
477 *
478 * int bpf_map_pop_elem(struct bpf_map *map, void *value)
479 * Description
480 * Pop an element from *map*.
481 * Return
482 * 0 on success, or a negative error in case of failure.
483 *
484 * int bpf_map_peek_elem(struct bpf_map *map, void *value)
485 * Description
486 * Get an element from *map* without removing it.
487 * Return
488 * 0 on success, or a negative error in case of failure.
489 *
Quentin Monnetad4a5222018-04-25 18:16:53 +0100490 * int bpf_probe_read(void *dst, u32 size, const void *src)
491 * Description
492 * For tracing programs, safely attempt to read *size* bytes from
493 * address *src* and store the data in *dst*.
494 * Return
495 * 0 on success, or a negative error in case of failure.
496 *
497 * u64 bpf_ktime_get_ns(void)
498 * Description
499 * Return the time elapsed since system boot, in nanoseconds.
500 * Return
501 * Current *ktime*.
502 *
503 * int bpf_trace_printk(const char *fmt, u32 fmt_size, ...)
504 * Description
505 * This helper is a "printk()-like" facility for debugging. It
506 * prints a message defined by format *fmt* (of size *fmt_size*)
507 * to file *\/sys/kernel/debug/tracing/trace* from DebugFS, if
508 * available. It can take up to three additional **u64**
509 * arguments (as an eBPF helpers, the total number of arguments is
510 * limited to five).
511 *
512 * Each time the helper is called, it appends a line to the trace.
513 * The format of the trace is customizable, and the exact output
514 * one will get depends on the options set in
515 * *\/sys/kernel/debug/tracing/trace_options* (see also the
516 * *README* file under the same directory). However, it usually
517 * defaults to something like:
518 *
519 * ::
520 *
521 * telnet-470 [001] .N.. 419421.045894: 0x00000001: <formatted msg>
522 *
523 * In the above:
524 *
525 * * ``telnet`` is the name of the current task.
526 * * ``470`` is the PID of the current task.
527 * * ``001`` is the CPU number on which the task is
528 * running.
529 * * In ``.N..``, each character refers to a set of
530 * options (whether irqs are enabled, scheduling
531 * options, whether hard/softirqs are running, level of
532 * preempt_disabled respectively). **N** means that
533 * **TIF_NEED_RESCHED** and **PREEMPT_NEED_RESCHED**
534 * are set.
535 * * ``419421.045894`` is a timestamp.
536 * * ``0x00000001`` is a fake value used by BPF for the
537 * instruction pointer register.
538 * * ``<formatted msg>`` is the message formatted with
539 * *fmt*.
540 *
541 * The conversion specifiers supported by *fmt* are similar, but
542 * more limited than for printk(). They are **%d**, **%i**,
543 * **%u**, **%x**, **%ld**, **%li**, **%lu**, **%lx**, **%lld**,
544 * **%lli**, **%llu**, **%llx**, **%p**, **%s**. No modifier (size
545 * of field, padding with zeroes, etc.) is available, and the
546 * helper will return **-EINVAL** (but print nothing) if it
547 * encounters an unknown specifier.
548 *
549 * Also, note that **bpf_trace_printk**\ () is slow, and should
550 * only be used for debugging purposes. For this reason, a notice
551 * bloc (spanning several lines) is printed to kernel logs and
552 * states that the helper should not be used "for production use"
553 * the first time this helper is used (or more precisely, when
554 * **trace_printk**\ () buffers are allocated). For passing values
555 * to user space, perf events should be preferred.
556 * Return
557 * The number of bytes written to the buffer, or a negative error
558 * in case of failure.
559 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100560 * u32 bpf_get_prandom_u32(void)
561 * Description
562 * Get a pseudo-random number.
563 *
564 * From a security point of view, this helper uses its own
565 * pseudo-random internal state, and cannot be used to infer the
566 * seed of other random functions in the kernel. However, it is
567 * essential to note that the generator used by the helper is not
568 * cryptographically secure.
569 * Return
570 * A random 32-bit unsigned value.
571 *
572 * u32 bpf_get_smp_processor_id(void)
573 * Description
574 * Get the SMP (symmetric multiprocessing) processor id. Note that
575 * all programs run with preemption disabled, which means that the
576 * SMP processor id is stable during all the execution of the
577 * program.
578 * Return
579 * The SMP id of the processor running the program.
580 *
Quentin Monnetad4a5222018-04-25 18:16:53 +0100581 * int bpf_skb_store_bytes(struct sk_buff *skb, u32 offset, const void *from, u32 len, u64 flags)
582 * Description
583 * Store *len* bytes from address *from* into the packet
584 * associated to *skb*, at *offset*. *flags* are a combination of
585 * **BPF_F_RECOMPUTE_CSUM** (automatically recompute the
586 * checksum for the packet after storing the bytes) and
587 * **BPF_F_INVALIDATE_HASH** (set *skb*\ **->hash**, *skb*\
588 * **->swhash** and *skb*\ **->l4hash** to 0).
589 *
590 * A call to this helper is susceptible to change the underlaying
591 * packet buffer. Therefore, at load time, all checks on pointers
592 * previously done by the verifier are invalidated and must be
593 * performed again, if the helper is used in combination with
594 * direct packet access.
595 * Return
596 * 0 on success, or a negative error in case of failure.
597 *
598 * int bpf_l3_csum_replace(struct sk_buff *skb, u32 offset, u64 from, u64 to, u64 size)
599 * Description
600 * Recompute the layer 3 (e.g. IP) checksum for the packet
601 * associated to *skb*. Computation is incremental, so the helper
602 * must know the former value of the header field that was
603 * modified (*from*), the new value of this field (*to*), and the
604 * number of bytes (2 or 4) for this field, stored in *size*.
605 * Alternatively, it is possible to store the difference between
606 * the previous and the new values of the header field in *to*, by
607 * setting *from* and *size* to 0. For both methods, *offset*
608 * indicates the location of the IP checksum within the packet.
609 *
610 * This helper works in combination with **bpf_csum_diff**\ (),
611 * which does not update the checksum in-place, but offers more
612 * flexibility and can handle sizes larger than 2 or 4 for the
613 * checksum to update.
614 *
615 * A call to this helper is susceptible to change the underlaying
616 * packet buffer. Therefore, at load time, all checks on pointers
617 * previously done by the verifier are invalidated and must be
618 * performed again, if the helper is used in combination with
619 * direct packet access.
620 * Return
621 * 0 on success, or a negative error in case of failure.
622 *
623 * int bpf_l4_csum_replace(struct sk_buff *skb, u32 offset, u64 from, u64 to, u64 flags)
624 * Description
625 * Recompute the layer 4 (e.g. TCP, UDP or ICMP) checksum for the
626 * packet associated to *skb*. Computation is incremental, so the
627 * helper must know the former value of the header field that was
628 * modified (*from*), the new value of this field (*to*), and the
629 * number of bytes (2 or 4) for this field, stored on the lowest
630 * four bits of *flags*. Alternatively, it is possible to store
631 * the difference between the previous and the new values of the
632 * header field in *to*, by setting *from* and the four lowest
633 * bits of *flags* to 0. For both methods, *offset* indicates the
634 * location of the IP checksum within the packet. In addition to
635 * the size of the field, *flags* can be added (bitwise OR) actual
636 * flags. With **BPF_F_MARK_MANGLED_0**, a null checksum is left
637 * untouched (unless **BPF_F_MARK_ENFORCE** is added as well), and
638 * for updates resulting in a null checksum the value is set to
639 * **CSUM_MANGLED_0** instead. Flag **BPF_F_PSEUDO_HDR** indicates
640 * the checksum is to be computed against a pseudo-header.
641 *
642 * This helper works in combination with **bpf_csum_diff**\ (),
643 * which does not update the checksum in-place, but offers more
644 * flexibility and can handle sizes larger than 2 or 4 for the
645 * checksum to update.
646 *
647 * A call to this helper is susceptible to change the underlaying
648 * packet buffer. Therefore, at load time, all checks on pointers
649 * previously done by the verifier are invalidated and must be
650 * performed again, if the helper is used in combination with
651 * direct packet access.
652 * Return
653 * 0 on success, or a negative error in case of failure.
654 *
655 * int bpf_tail_call(void *ctx, struct bpf_map *prog_array_map, u32 index)
656 * Description
657 * This special helper is used to trigger a "tail call", or in
658 * other words, to jump into another eBPF program. The same stack
659 * frame is used (but values on stack and in registers for the
660 * caller are not accessible to the callee). This mechanism allows
661 * for program chaining, either for raising the maximum number of
662 * available eBPF instructions, or to execute given programs in
663 * conditional blocks. For security reasons, there is an upper
664 * limit to the number of successive tail calls that can be
665 * performed.
666 *
667 * Upon call of this helper, the program attempts to jump into a
668 * program referenced at index *index* in *prog_array_map*, a
669 * special map of type **BPF_MAP_TYPE_PROG_ARRAY**, and passes
670 * *ctx*, a pointer to the context.
671 *
672 * If the call succeeds, the kernel immediately runs the first
673 * instruction of the new program. This is not a function call,
674 * and it never returns to the previous program. If the call
675 * fails, then the helper has no effect, and the caller continues
676 * to run its subsequent instructions. A call can fail if the
677 * destination program for the jump does not exist (i.e. *index*
678 * is superior to the number of entries in *prog_array_map*), or
679 * if the maximum number of tail calls has been reached for this
680 * chain of programs. This limit is defined in the kernel by the
681 * macro **MAX_TAIL_CALL_CNT** (not accessible to user space),
682 * which is currently set to 32.
683 * Return
684 * 0 on success, or a negative error in case of failure.
685 *
686 * int bpf_clone_redirect(struct sk_buff *skb, u32 ifindex, u64 flags)
687 * Description
688 * Clone and redirect the packet associated to *skb* to another
689 * net device of index *ifindex*. Both ingress and egress
690 * interfaces can be used for redirection. The **BPF_F_INGRESS**
691 * value in *flags* is used to make the distinction (ingress path
692 * is selected if the flag is present, egress path otherwise).
693 * This is the only flag supported for now.
694 *
695 * In comparison with **bpf_redirect**\ () helper,
696 * **bpf_clone_redirect**\ () has the associated cost of
697 * duplicating the packet buffer, but this can be executed out of
698 * the eBPF program. Conversely, **bpf_redirect**\ () is more
699 * efficient, but it is handled through an action code where the
700 * redirection happens only after the eBPF program has returned.
701 *
702 * A call to this helper is susceptible to change the underlaying
703 * packet buffer. Therefore, at load time, all checks on pointers
704 * previously done by the verifier are invalidated and must be
705 * performed again, if the helper is used in combination with
706 * direct packet access.
707 * Return
708 * 0 on success, or a negative error in case of failure.
Quentin Monnetc456dec2018-04-25 18:16:54 +0100709 *
710 * u64 bpf_get_current_pid_tgid(void)
711 * Return
712 * A 64-bit integer containing the current tgid and pid, and
713 * created as such:
714 * *current_task*\ **->tgid << 32 \|**
715 * *current_task*\ **->pid**.
716 *
717 * u64 bpf_get_current_uid_gid(void)
718 * Return
719 * A 64-bit integer containing the current GID and UID, and
720 * created as such: *current_gid* **<< 32 \|** *current_uid*.
721 *
722 * int bpf_get_current_comm(char *buf, u32 size_of_buf)
723 * Description
724 * Copy the **comm** attribute of the current task into *buf* of
725 * *size_of_buf*. The **comm** attribute contains the name of
726 * the executable (excluding the path) for the current task. The
727 * *size_of_buf* must be strictly positive. On success, the
728 * helper makes sure that the *buf* is NUL-terminated. On failure,
729 * it is filled with zeroes.
730 * Return
731 * 0 on success, or a negative error in case of failure.
732 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100733 * u32 bpf_get_cgroup_classid(struct sk_buff *skb)
734 * Description
735 * Retrieve the classid for the current task, i.e. for the net_cls
736 * cgroup to which *skb* belongs.
737 *
738 * This helper can be used on TC egress path, but not on ingress.
739 *
740 * The net_cls cgroup provides an interface to tag network packets
741 * based on a user-provided identifier for all traffic coming from
742 * the tasks belonging to the related cgroup. See also the related
743 * kernel documentation, available from the Linux sources in file
744 * *Documentation/cgroup-v1/net_cls.txt*.
745 *
746 * The Linux kernel has two versions for cgroups: there are
747 * cgroups v1 and cgroups v2. Both are available to users, who can
748 * use a mixture of them, but note that the net_cls cgroup is for
749 * cgroup v1 only. This makes it incompatible with BPF programs
750 * run on cgroups, which is a cgroup-v2-only feature (a socket can
751 * only hold data for one version of cgroups at a time).
752 *
753 * This helper is only available is the kernel was compiled with
754 * the **CONFIG_CGROUP_NET_CLASSID** configuration option set to
755 * "**y**" or to "**m**".
756 * Return
757 * The classid, or 0 for the default unconfigured classid.
758 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100759 * int bpf_skb_vlan_push(struct sk_buff *skb, __be16 vlan_proto, u16 vlan_tci)
760 * Description
761 * Push a *vlan_tci* (VLAN tag control information) of protocol
762 * *vlan_proto* to the packet associated to *skb*, then update
763 * the checksum. Note that if *vlan_proto* is different from
764 * **ETH_P_8021Q** and **ETH_P_8021AD**, it is considered to
765 * be **ETH_P_8021Q**.
766 *
767 * A call to this helper is susceptible to change the underlaying
768 * packet buffer. Therefore, at load time, all checks on pointers
769 * previously done by the verifier are invalidated and must be
770 * performed again, if the helper is used in combination with
771 * direct packet access.
772 * Return
773 * 0 on success, or a negative error in case of failure.
774 *
775 * int bpf_skb_vlan_pop(struct sk_buff *skb)
776 * Description
777 * Pop a VLAN header from the packet associated to *skb*.
778 *
779 * A call to this helper is susceptible to change the underlaying
780 * packet buffer. Therefore, at load time, all checks on pointers
781 * previously done by the verifier are invalidated and must be
782 * performed again, if the helper is used in combination with
783 * direct packet access.
784 * Return
785 * 0 on success, or a negative error in case of failure.
786 *
787 * int bpf_skb_get_tunnel_key(struct sk_buff *skb, struct bpf_tunnel_key *key, u32 size, u64 flags)
788 * Description
789 * Get tunnel metadata. This helper takes a pointer *key* to an
790 * empty **struct bpf_tunnel_key** of **size**, that will be
791 * filled with tunnel metadata for the packet associated to *skb*.
792 * The *flags* can be set to **BPF_F_TUNINFO_IPV6**, which
793 * indicates that the tunnel is based on IPv6 protocol instead of
794 * IPv4.
795 *
796 * The **struct bpf_tunnel_key** is an object that generalizes the
797 * principal parameters used by various tunneling protocols into a
798 * single struct. This way, it can be used to easily make a
799 * decision based on the contents of the encapsulation header,
800 * "summarized" in this struct. In particular, it holds the IP
801 * address of the remote end (IPv4 or IPv6, depending on the case)
802 * in *key*\ **->remote_ipv4** or *key*\ **->remote_ipv6**. Also,
803 * this struct exposes the *key*\ **->tunnel_id**, which is
804 * generally mapped to a VNI (Virtual Network Identifier), making
805 * it programmable together with the **bpf_skb_set_tunnel_key**\
806 * () helper.
807 *
808 * Let's imagine that the following code is part of a program
809 * attached to the TC ingress interface, on one end of a GRE
810 * tunnel, and is supposed to filter out all messages coming from
811 * remote ends with IPv4 address other than 10.0.0.1:
812 *
813 * ::
814 *
815 * int ret;
816 * struct bpf_tunnel_key key = {};
817 *
818 * ret = bpf_skb_get_tunnel_key(skb, &key, sizeof(key), 0);
819 * if (ret < 0)
820 * return TC_ACT_SHOT; // drop packet
821 *
822 * if (key.remote_ipv4 != 0x0a000001)
823 * return TC_ACT_SHOT; // drop packet
824 *
825 * return TC_ACT_OK; // accept packet
826 *
827 * This interface can also be used with all encapsulation devices
828 * that can operate in "collect metadata" mode: instead of having
829 * one network device per specific configuration, the "collect
830 * metadata" mode only requires a single device where the
831 * configuration can be extracted from this helper.
832 *
833 * This can be used together with various tunnels such as VXLan,
834 * Geneve, GRE or IP in IP (IPIP).
835 * Return
836 * 0 on success, or a negative error in case of failure.
837 *
838 * int bpf_skb_set_tunnel_key(struct sk_buff *skb, struct bpf_tunnel_key *key, u32 size, u64 flags)
839 * Description
840 * Populate tunnel metadata for packet associated to *skb.* The
841 * tunnel metadata is set to the contents of *key*, of *size*. The
842 * *flags* can be set to a combination of the following values:
843 *
844 * **BPF_F_TUNINFO_IPV6**
845 * Indicate that the tunnel is based on IPv6 protocol
846 * instead of IPv4.
847 * **BPF_F_ZERO_CSUM_TX**
848 * For IPv4 packets, add a flag to tunnel metadata
849 * indicating that checksum computation should be skipped
850 * and checksum set to zeroes.
851 * **BPF_F_DONT_FRAGMENT**
852 * Add a flag to tunnel metadata indicating that the
853 * packet should not be fragmented.
854 * **BPF_F_SEQ_NUMBER**
855 * Add a flag to tunnel metadata indicating that a
856 * sequence number should be added to tunnel header before
857 * sending the packet. This flag was added for GRE
858 * encapsulation, but might be used with other protocols
859 * as well in the future.
860 *
861 * Here is a typical usage on the transmit path:
862 *
863 * ::
864 *
865 * struct bpf_tunnel_key key;
866 * populate key ...
867 * bpf_skb_set_tunnel_key(skb, &key, sizeof(key), 0);
868 * bpf_clone_redirect(skb, vxlan_dev_ifindex, 0);
869 *
870 * See also the description of the **bpf_skb_get_tunnel_key**\ ()
871 * helper for additional information.
872 * Return
873 * 0 on success, or a negative error in case of failure.
874 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +0100875 * u64 bpf_perf_event_read(struct bpf_map *map, u64 flags)
876 * Description
877 * Read the value of a perf event counter. This helper relies on a
878 * *map* of type **BPF_MAP_TYPE_PERF_EVENT_ARRAY**. The nature of
879 * the perf event counter is selected when *map* is updated with
880 * perf event file descriptors. The *map* is an array whose size
881 * is the number of available CPUs, and each cell contains a value
882 * relative to one CPU. The value to retrieve is indicated by
883 * *flags*, that contains the index of the CPU to look up, masked
884 * with **BPF_F_INDEX_MASK**. Alternatively, *flags* can be set to
885 * **BPF_F_CURRENT_CPU** to indicate that the value for the
886 * current CPU should be retrieved.
887 *
888 * Note that before Linux 4.13, only hardware perf event can be
889 * retrieved.
890 *
891 * Also, be aware that the newer helper
892 * **bpf_perf_event_read_value**\ () is recommended over
Quentin Monnet3bd5a092018-04-30 11:39:03 +0100893 * **bpf_perf_event_read**\ () in general. The latter has some ABI
Quentin Monnetc6b5fb82018-04-25 18:16:57 +0100894 * quirks where error and counter value are used as a return code
895 * (which is wrong to do since ranges may overlap). This issue is
Quentin Monnet3bd5a092018-04-30 11:39:03 +0100896 * fixed with **bpf_perf_event_read_value**\ (), which at the same
897 * time provides more features over the **bpf_perf_event_read**\
898 * () interface. Please refer to the description of
Quentin Monnetc6b5fb82018-04-25 18:16:57 +0100899 * **bpf_perf_event_read_value**\ () for details.
900 * Return
901 * The value of the perf event counter read from the map, or a
902 * negative error code in case of failure.
903 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100904 * int bpf_redirect(u32 ifindex, u64 flags)
905 * Description
906 * Redirect the packet to another net device of index *ifindex*.
907 * This helper is somewhat similar to **bpf_clone_redirect**\
908 * (), except that the packet is not cloned, which provides
909 * increased performance.
910 *
911 * Except for XDP, both ingress and egress interfaces can be used
912 * for redirection. The **BPF_F_INGRESS** value in *flags* is used
913 * to make the distinction (ingress path is selected if the flag
914 * is present, egress path otherwise). Currently, XDP only
915 * supports redirection to the egress interface, and accepts no
916 * flag at all.
917 *
918 * The same effect can be attained with the more generic
919 * **bpf_redirect_map**\ (), which requires specific maps to be
920 * used but offers better performance.
921 * Return
922 * For XDP, the helper returns **XDP_REDIRECT** on success or
923 * **XDP_ABORTED** on error. For other program types, the values
924 * are **TC_ACT_REDIRECT** on success or **TC_ACT_SHOT** on
925 * error.
926 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100927 * u32 bpf_get_route_realm(struct sk_buff *skb)
928 * Description
929 * Retrieve the realm or the route, that is to say the
930 * **tclassid** field of the destination for the *skb*. The
931 * indentifier retrieved is a user-provided tag, similar to the
932 * one used with the net_cls cgroup (see description for
933 * **bpf_get_cgroup_classid**\ () helper), but here this tag is
934 * held by a route (a destination entry), not by a task.
935 *
936 * Retrieving this identifier works with the clsact TC egress hook
937 * (see also **tc-bpf(8)**), or alternatively on conventional
938 * classful egress qdiscs, but not on TC ingress path. In case of
939 * clsact TC egress hook, this has the advantage that, internally,
940 * the destination entry has not been dropped yet in the transmit
941 * path. Therefore, the destination entry does not need to be
942 * artificially held via **netif_keep_dst**\ () for a classful
943 * qdisc until the *skb* is freed.
944 *
945 * This helper is available only if the kernel was compiled with
946 * **CONFIG_IP_ROUTE_CLASSID** configuration option.
947 * Return
948 * The realm of the route for the packet associated to *skb*, or 0
949 * if none was found.
950 *
Quentin Monnetc456dec2018-04-25 18:16:54 +0100951 * int bpf_perf_event_output(struct pt_reg *ctx, struct bpf_map *map, u64 flags, void *data, u64 size)
952 * Description
953 * Write raw *data* blob into a special BPF perf event held by
954 * *map* of type **BPF_MAP_TYPE_PERF_EVENT_ARRAY**. This perf
955 * event must have the following attributes: **PERF_SAMPLE_RAW**
956 * as **sample_type**, **PERF_TYPE_SOFTWARE** as **type**, and
957 * **PERF_COUNT_SW_BPF_OUTPUT** as **config**.
958 *
959 * The *flags* are used to indicate the index in *map* for which
960 * the value must be put, masked with **BPF_F_INDEX_MASK**.
961 * Alternatively, *flags* can be set to **BPF_F_CURRENT_CPU**
962 * to indicate that the index of the current CPU core should be
963 * used.
964 *
965 * The value to write, of *size*, is passed through eBPF stack and
966 * pointed by *data*.
967 *
968 * The context of the program *ctx* needs also be passed to the
969 * helper.
970 *
971 * On user space, a program willing to read the values needs to
972 * call **perf_event_open**\ () on the perf event (either for
973 * one or for all CPUs) and to store the file descriptor into the
974 * *map*. This must be done before the eBPF program can send data
975 * into it. An example is available in file
976 * *samples/bpf/trace_output_user.c* in the Linux kernel source
977 * tree (the eBPF program counterpart is in
978 * *samples/bpf/trace_output_kern.c*).
979 *
980 * **bpf_perf_event_output**\ () achieves better performance
981 * than **bpf_trace_printk**\ () for sharing data with user
982 * space, and is much better suitable for streaming data from eBPF
983 * programs.
984 *
985 * Note that this helper is not restricted to tracing use cases
986 * and can be used with programs attached to TC or XDP as well,
987 * where it allows for passing data to user space listeners. Data
988 * can be:
989 *
990 * * Only custom structs,
991 * * Only the packet payload, or
992 * * A combination of both.
993 * Return
994 * 0 on success, or a negative error in case of failure.
995 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +0100996 * int bpf_skb_load_bytes(const struct sk_buff *skb, u32 offset, void *to, u32 len)
997 * Description
998 * This helper was provided as an easy way to load data from a
999 * packet. It can be used to load *len* bytes from *offset* from
1000 * the packet associated to *skb*, into the buffer pointed by
1001 * *to*.
1002 *
1003 * Since Linux 4.7, usage of this helper has mostly been replaced
1004 * by "direct packet access", enabling packet data to be
1005 * manipulated with *skb*\ **->data** and *skb*\ **->data_end**
1006 * pointing respectively to the first byte of packet data and to
1007 * the byte after the last byte of packet data. However, it
1008 * remains useful if one wishes to read large quantities of data
1009 * at once from a packet into the eBPF stack.
1010 * Return
1011 * 0 on success, or a negative error in case of failure.
1012 *
Quentin Monnetc456dec2018-04-25 18:16:54 +01001013 * int bpf_get_stackid(struct pt_reg *ctx, struct bpf_map *map, u64 flags)
1014 * Description
1015 * Walk a user or a kernel stack and return its id. To achieve
1016 * this, the helper needs *ctx*, which is a pointer to the context
1017 * on which the tracing program is executed, and a pointer to a
1018 * *map* of type **BPF_MAP_TYPE_STACK_TRACE**.
1019 *
1020 * The last argument, *flags*, holds the number of stack frames to
1021 * skip (from 0 to 255), masked with
1022 * **BPF_F_SKIP_FIELD_MASK**. The next bits can be used to set
1023 * a combination of the following flags:
1024 *
1025 * **BPF_F_USER_STACK**
1026 * Collect a user space stack instead of a kernel stack.
1027 * **BPF_F_FAST_STACK_CMP**
1028 * Compare stacks by hash only.
1029 * **BPF_F_REUSE_STACKID**
1030 * If two different stacks hash into the same *stackid*,
1031 * discard the old one.
1032 *
1033 * The stack id retrieved is a 32 bit long integer handle which
1034 * can be further combined with other data (including other stack
1035 * ids) and used as a key into maps. This can be useful for
1036 * generating a variety of graphs (such as flame graphs or off-cpu
1037 * graphs).
1038 *
1039 * For walking a stack, this helper is an improvement over
1040 * **bpf_probe_read**\ (), which can be used with unrolled loops
1041 * but is not efficient and consumes a lot of eBPF instructions.
1042 * Instead, **bpf_get_stackid**\ () can collect up to
1043 * **PERF_MAX_STACK_DEPTH** both kernel and user frames. Note that
1044 * this limit can be controlled with the **sysctl** program, and
1045 * that it should be manually increased in order to profile long
1046 * user stacks (such as stacks for Java programs). To do so, use:
1047 *
1048 * ::
1049 *
1050 * # sysctl kernel.perf_event_max_stack=<new value>
Quentin Monnetc456dec2018-04-25 18:16:54 +01001051 * Return
1052 * The positive or null stack id on success, or a negative error
1053 * in case of failure.
1054 *
Quentin Monnet1fdd08b2018-04-25 18:16:55 +01001055 * s64 bpf_csum_diff(__be32 *from, u32 from_size, __be32 *to, u32 to_size, __wsum seed)
1056 * Description
1057 * Compute a checksum difference, from the raw buffer pointed by
1058 * *from*, of length *from_size* (that must be a multiple of 4),
1059 * towards the raw buffer pointed by *to*, of size *to_size*
1060 * (same remark). An optional *seed* can be added to the value
1061 * (this can be cascaded, the seed may come from a previous call
1062 * to the helper).
1063 *
1064 * This is flexible enough to be used in several ways:
1065 *
1066 * * With *from_size* == 0, *to_size* > 0 and *seed* set to
1067 * checksum, it can be used when pushing new data.
1068 * * With *from_size* > 0, *to_size* == 0 and *seed* set to
1069 * checksum, it can be used when removing data from a packet.
1070 * * With *from_size* > 0, *to_size* > 0 and *seed* set to 0, it
1071 * can be used to compute a diff. Note that *from_size* and
1072 * *to_size* do not need to be equal.
1073 *
1074 * This helper can be used in combination with
1075 * **bpf_l3_csum_replace**\ () and **bpf_l4_csum_replace**\ (), to
1076 * which one can feed in the difference computed with
1077 * **bpf_csum_diff**\ ().
1078 * Return
1079 * The checksum result, or a negative error code in case of
1080 * failure.
1081 *
1082 * int bpf_skb_get_tunnel_opt(struct sk_buff *skb, u8 *opt, u32 size)
1083 * Description
1084 * Retrieve tunnel options metadata for the packet associated to
1085 * *skb*, and store the raw tunnel option data to the buffer *opt*
1086 * of *size*.
1087 *
1088 * This helper can be used with encapsulation devices that can
1089 * operate in "collect metadata" mode (please refer to the related
1090 * note in the description of **bpf_skb_get_tunnel_key**\ () for
1091 * more details). A particular example where this can be used is
1092 * in combination with the Geneve encapsulation protocol, where it
1093 * allows for pushing (with **bpf_skb_get_tunnel_opt**\ () helper)
1094 * and retrieving arbitrary TLVs (Type-Length-Value headers) from
1095 * the eBPF program. This allows for full customization of these
1096 * headers.
1097 * Return
1098 * The size of the option data retrieved.
1099 *
1100 * int bpf_skb_set_tunnel_opt(struct sk_buff *skb, u8 *opt, u32 size)
1101 * Description
1102 * Set tunnel options metadata for the packet associated to *skb*
1103 * to the option data contained in the raw buffer *opt* of *size*.
1104 *
1105 * See also the description of the **bpf_skb_get_tunnel_opt**\ ()
1106 * helper for additional information.
1107 * Return
1108 * 0 on success, or a negative error in case of failure.
1109 *
1110 * int bpf_skb_change_proto(struct sk_buff *skb, __be16 proto, u64 flags)
1111 * Description
1112 * Change the protocol of the *skb* to *proto*. Currently
1113 * supported are transition from IPv4 to IPv6, and from IPv6 to
1114 * IPv4. The helper takes care of the groundwork for the
1115 * transition, including resizing the socket buffer. The eBPF
1116 * program is expected to fill the new headers, if any, via
1117 * **skb_store_bytes**\ () and to recompute the checksums with
1118 * **bpf_l3_csum_replace**\ () and **bpf_l4_csum_replace**\
1119 * (). The main case for this helper is to perform NAT64
1120 * operations out of an eBPF program.
1121 *
1122 * Internally, the GSO type is marked as dodgy so that headers are
1123 * checked and segments are recalculated by the GSO/GRO engine.
1124 * The size for GSO target is adapted as well.
1125 *
1126 * All values for *flags* are reserved for future usage, and must
1127 * be left at zero.
1128 *
1129 * A call to this helper is susceptible to change the underlaying
1130 * packet buffer. Therefore, at load time, all checks on pointers
1131 * previously done by the verifier are invalidated and must be
1132 * performed again, if the helper is used in combination with
1133 * direct packet access.
1134 * Return
1135 * 0 on success, or a negative error in case of failure.
1136 *
1137 * int bpf_skb_change_type(struct sk_buff *skb, u32 type)
1138 * Description
1139 * Change the packet type for the packet associated to *skb*. This
1140 * comes down to setting *skb*\ **->pkt_type** to *type*, except
1141 * the eBPF program does not have a write access to *skb*\
1142 * **->pkt_type** beside this helper. Using a helper here allows
1143 * for graceful handling of errors.
1144 *
1145 * The major use case is to change incoming *skb*s to
1146 * **PACKET_HOST** in a programmatic way instead of having to
1147 * recirculate via **redirect**\ (..., **BPF_F_INGRESS**), for
1148 * example.
1149 *
1150 * Note that *type* only allows certain values. At this time, they
1151 * are:
1152 *
1153 * **PACKET_HOST**
1154 * Packet is for us.
1155 * **PACKET_BROADCAST**
1156 * Send packet to all.
1157 * **PACKET_MULTICAST**
1158 * Send packet to group.
1159 * **PACKET_OTHERHOST**
1160 * Send packet to someone else.
1161 * Return
1162 * 0 on success, or a negative error in case of failure.
1163 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001164 * int bpf_skb_under_cgroup(struct sk_buff *skb, struct bpf_map *map, u32 index)
1165 * Description
1166 * Check whether *skb* is a descendant of the cgroup2 held by
1167 * *map* of type **BPF_MAP_TYPE_CGROUP_ARRAY**, at *index*.
1168 * Return
1169 * The return value depends on the result of the test, and can be:
1170 *
1171 * * 0, if the *skb* failed the cgroup2 descendant test.
1172 * * 1, if the *skb* succeeded the cgroup2 descendant test.
1173 * * A negative error code, if an error occurred.
1174 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001175 * u32 bpf_get_hash_recalc(struct sk_buff *skb)
1176 * Description
1177 * Retrieve the hash of the packet, *skb*\ **->hash**. If it is
1178 * not set, in particular if the hash was cleared due to mangling,
1179 * recompute this hash. Later accesses to the hash can be done
1180 * directly with *skb*\ **->hash**.
1181 *
1182 * Calling **bpf_set_hash_invalid**\ (), changing a packet
1183 * prototype with **bpf_skb_change_proto**\ (), or calling
1184 * **bpf_skb_store_bytes**\ () with the
1185 * **BPF_F_INVALIDATE_HASH** are actions susceptible to clear
1186 * the hash and to trigger a new computation for the next call to
1187 * **bpf_get_hash_recalc**\ ().
1188 * Return
1189 * The 32-bit hash.
1190 *
Quentin Monnetc456dec2018-04-25 18:16:54 +01001191 * u64 bpf_get_current_task(void)
1192 * Return
1193 * A pointer to the current task struct.
Quentin Monnetfa156012018-04-25 18:16:56 +01001194 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001195 * int bpf_probe_write_user(void *dst, const void *src, u32 len)
1196 * Description
1197 * Attempt in a safe way to write *len* bytes from the buffer
1198 * *src* to *dst* in memory. It only works for threads that are in
1199 * user context, and *dst* must be a valid user space address.
1200 *
1201 * This helper should not be used to implement any kind of
1202 * security mechanism because of TOC-TOU attacks, but rather to
1203 * debug, divert, and manipulate execution of semi-cooperative
1204 * processes.
1205 *
1206 * Keep in mind that this feature is meant for experiments, and it
1207 * has a risk of crashing the system and running programs.
1208 * Therefore, when an eBPF program using this helper is attached,
1209 * a warning including PID and process name is printed to kernel
1210 * logs.
1211 * Return
1212 * 0 on success, or a negative error in case of failure.
1213 *
1214 * int bpf_current_task_under_cgroup(struct bpf_map *map, u32 index)
1215 * Description
1216 * Check whether the probe is being run is the context of a given
1217 * subset of the cgroup2 hierarchy. The cgroup2 to test is held by
1218 * *map* of type **BPF_MAP_TYPE_CGROUP_ARRAY**, at *index*.
1219 * Return
1220 * The return value depends on the result of the test, and can be:
1221 *
1222 * * 0, if the *skb* task belongs to the cgroup2.
1223 * * 1, if the *skb* task does not belong to the cgroup2.
1224 * * A negative error code, if an error occurred.
1225 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001226 * int bpf_skb_change_tail(struct sk_buff *skb, u32 len, u64 flags)
1227 * Description
1228 * Resize (trim or grow) the packet associated to *skb* to the
1229 * new *len*. The *flags* are reserved for future usage, and must
1230 * be left at zero.
1231 *
1232 * The basic idea is that the helper performs the needed work to
1233 * change the size of the packet, then the eBPF program rewrites
1234 * the rest via helpers like **bpf_skb_store_bytes**\ (),
1235 * **bpf_l3_csum_replace**\ (), **bpf_l3_csum_replace**\ ()
1236 * and others. This helper is a slow path utility intended for
1237 * replies with control messages. And because it is targeted for
1238 * slow path, the helper itself can afford to be slow: it
1239 * implicitly linearizes, unclones and drops offloads from the
1240 * *skb*.
1241 *
1242 * A call to this helper is susceptible to change the underlaying
1243 * packet buffer. Therefore, at load time, all checks on pointers
1244 * previously done by the verifier are invalidated and must be
1245 * performed again, if the helper is used in combination with
1246 * direct packet access.
1247 * Return
1248 * 0 on success, or a negative error in case of failure.
1249 *
1250 * int bpf_skb_pull_data(struct sk_buff *skb, u32 len)
1251 * Description
1252 * Pull in non-linear data in case the *skb* is non-linear and not
1253 * all of *len* are part of the linear section. Make *len* bytes
1254 * from *skb* readable and writable. If a zero value is passed for
1255 * *len*, then the whole length of the *skb* is pulled.
1256 *
1257 * This helper is only needed for reading and writing with direct
1258 * packet access.
1259 *
1260 * For direct packet access, testing that offsets to access
1261 * are within packet boundaries (test on *skb*\ **->data_end**) is
1262 * susceptible to fail if offsets are invalid, or if the requested
1263 * data is in non-linear parts of the *skb*. On failure the
1264 * program can just bail out, or in the case of a non-linear
1265 * buffer, use a helper to make the data available. The
1266 * **bpf_skb_load_bytes**\ () helper is a first solution to access
1267 * the data. Another one consists in using **bpf_skb_pull_data**
1268 * to pull in once the non-linear parts, then retesting and
1269 * eventually access the data.
1270 *
1271 * At the same time, this also makes sure the *skb* is uncloned,
1272 * which is a necessary condition for direct write. As this needs
1273 * to be an invariant for the write part only, the verifier
1274 * detects writes and adds a prologue that is calling
1275 * **bpf_skb_pull_data()** to effectively unclone the *skb* from
1276 * the very beginning in case it is indeed cloned.
1277 *
1278 * A call to this helper is susceptible to change the underlaying
1279 * packet buffer. Therefore, at load time, all checks on pointers
1280 * previously done by the verifier are invalidated and must be
1281 * performed again, if the helper is used in combination with
1282 * direct packet access.
1283 * Return
1284 * 0 on success, or a negative error in case of failure.
1285 *
1286 * s64 bpf_csum_update(struct sk_buff *skb, __wsum csum)
1287 * Description
1288 * Add the checksum *csum* into *skb*\ **->csum** in case the
1289 * driver has supplied a checksum for the entire packet into that
1290 * field. Return an error otherwise. This helper is intended to be
1291 * used in combination with **bpf_csum_diff**\ (), in particular
1292 * when the checksum needs to be updated after data has been
1293 * written into the packet through direct packet access.
1294 * Return
1295 * The checksum on success, or a negative error code in case of
1296 * failure.
1297 *
1298 * void bpf_set_hash_invalid(struct sk_buff *skb)
1299 * Description
1300 * Invalidate the current *skb*\ **->hash**. It can be used after
1301 * mangling on headers through direct packet access, in order to
1302 * indicate that the hash is outdated and to trigger a
1303 * recalculation the next time the kernel tries to access this
1304 * hash or when the **bpf_get_hash_recalc**\ () helper is called.
1305 *
1306 * int bpf_get_numa_node_id(void)
1307 * Description
1308 * Return the id of the current NUMA node. The primary use case
1309 * for this helper is the selection of sockets for the local NUMA
1310 * node, when the program is attached to sockets using the
1311 * **SO_ATTACH_REUSEPORT_EBPF** option (see also **socket(7)**),
1312 * but the helper is also available to other eBPF program types,
1313 * similarly to **bpf_get_smp_processor_id**\ ().
1314 * Return
1315 * The id of current NUMA node.
1316 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001317 * int bpf_skb_change_head(struct sk_buff *skb, u32 len, u64 flags)
1318 * Description
1319 * Grows headroom of packet associated to *skb* and adjusts the
1320 * offset of the MAC header accordingly, adding *len* bytes of
1321 * space. It automatically extends and reallocates memory as
1322 * required.
1323 *
1324 * This helper can be used on a layer 3 *skb* to push a MAC header
1325 * for redirection into a layer 2 device.
1326 *
1327 * All values for *flags* are reserved for future usage, and must
1328 * be left at zero.
1329 *
1330 * A call to this helper is susceptible to change the underlaying
1331 * packet buffer. Therefore, at load time, all checks on pointers
1332 * previously done by the verifier are invalidated and must be
1333 * performed again, if the helper is used in combination with
1334 * direct packet access.
1335 * Return
1336 * 0 on success, or a negative error in case of failure.
1337 *
1338 * int bpf_xdp_adjust_head(struct xdp_buff *xdp_md, int delta)
1339 * Description
1340 * Adjust (move) *xdp_md*\ **->data** by *delta* bytes. Note that
1341 * it is possible to use a negative value for *delta*. This helper
1342 * can be used to prepare the packet for pushing or popping
1343 * headers.
1344 *
1345 * A call to this helper is susceptible to change the underlaying
1346 * packet buffer. Therefore, at load time, all checks on pointers
1347 * previously done by the verifier are invalidated and must be
1348 * performed again, if the helper is used in combination with
1349 * direct packet access.
1350 * Return
1351 * 0 on success, or a negative error in case of failure.
1352 *
1353 * int bpf_probe_read_str(void *dst, int size, const void *unsafe_ptr)
1354 * Description
1355 * Copy a NUL terminated string from an unsafe address
1356 * *unsafe_ptr* to *dst*. The *size* should include the
1357 * terminating NUL byte. In case the string length is smaller than
1358 * *size*, the target is not padded with further NUL bytes. If the
1359 * string length is larger than *size*, just *size*-1 bytes are
1360 * copied and the last byte is set to NUL.
1361 *
1362 * On success, the length of the copied string is returned. This
1363 * makes this helper useful in tracing programs for reading
1364 * strings, and more importantly to get its length at runtime. See
1365 * the following snippet:
1366 *
1367 * ::
1368 *
1369 * SEC("kprobe/sys_open")
1370 * void bpf_sys_open(struct pt_regs *ctx)
1371 * {
1372 * char buf[PATHLEN]; // PATHLEN is defined to 256
1373 * int res = bpf_probe_read_str(buf, sizeof(buf),
1374 * ctx->di);
1375 *
1376 * // Consume buf, for example push it to
1377 * // userspace via bpf_perf_event_output(); we
1378 * // can use res (the string length) as event
1379 * // size, after checking its boundaries.
1380 * }
1381 *
1382 * In comparison, using **bpf_probe_read()** helper here instead
1383 * to read the string would require to estimate the length at
1384 * compile time, and would often result in copying more memory
1385 * than necessary.
1386 *
1387 * Another useful use case is when parsing individual process
1388 * arguments or individual environment variables navigating
1389 * *current*\ **->mm->arg_start** and *current*\
1390 * **->mm->env_start**: using this helper and the return value,
1391 * one can quickly iterate at the right offset of the memory area.
1392 * Return
1393 * On success, the strictly positive length of the string,
1394 * including the trailing NUL character. On error, a negative
1395 * value.
1396 *
1397 * u64 bpf_get_socket_cookie(struct sk_buff *skb)
1398 * Description
1399 * If the **struct sk_buff** pointed by *skb* has a known socket,
1400 * retrieve the cookie (generated by the kernel) of this socket.
1401 * If no cookie has been set yet, generate a new cookie. Once
1402 * generated, the socket cookie remains stable for the life of the
1403 * socket. This helper can be useful for monitoring per socket
1404 * networking traffic statistics as it provides a unique socket
1405 * identifier per namespace.
1406 * Return
1407 * A 8-byte long non-decreasing number on success, or 0 if the
1408 * socket field is missing inside *skb*.
1409 *
Andrey Ignatovd692f112018-07-30 17:42:28 -07001410 * u64 bpf_get_socket_cookie(struct bpf_sock_addr *ctx)
1411 * Description
1412 * Equivalent to bpf_get_socket_cookie() helper that accepts
1413 * *skb*, but gets socket from **struct bpf_sock_addr** contex.
1414 * Return
1415 * A 8-byte long non-decreasing number.
1416 *
1417 * u64 bpf_get_socket_cookie(struct bpf_sock_ops *ctx)
1418 * Description
1419 * Equivalent to bpf_get_socket_cookie() helper that accepts
1420 * *skb*, but gets socket from **struct bpf_sock_ops** contex.
1421 * Return
1422 * A 8-byte long non-decreasing number.
1423 *
Quentin Monnetc6b5fb82018-04-25 18:16:57 +01001424 * u32 bpf_get_socket_uid(struct sk_buff *skb)
1425 * Return
1426 * The owner UID of the socket associated to *skb*. If the socket
1427 * is **NULL**, or if it is not a full socket (i.e. if it is a
1428 * time-wait or a request socket instead), **overflowuid** value
1429 * is returned (note that **overflowuid** might also be the actual
1430 * UID value for the socket).
1431 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001432 * u32 bpf_set_hash(struct sk_buff *skb, u32 hash)
1433 * Description
1434 * Set the full hash for *skb* (set the field *skb*\ **->hash**)
1435 * to value *hash*.
1436 * Return
1437 * 0
1438 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001439 * int bpf_setsockopt(struct bpf_sock_ops *bpf_socket, int level, int optname, char *optval, int optlen)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001440 * Description
1441 * Emulate a call to **setsockopt()** on the socket associated to
1442 * *bpf_socket*, which must be a full socket. The *level* at
1443 * which the option resides and the name *optname* of the option
1444 * must be specified, see **setsockopt(2)** for more information.
1445 * The option value of length *optlen* is pointed by *optval*.
1446 *
1447 * This helper actually implements a subset of **setsockopt()**.
1448 * It supports the following *level*\ s:
1449 *
1450 * * **SOL_SOCKET**, which supports the following *optname*\ s:
1451 * **SO_RCVBUF**, **SO_SNDBUF**, **SO_MAX_PACING_RATE**,
1452 * **SO_PRIORITY**, **SO_RCVLOWAT**, **SO_MARK**.
1453 * * **IPPROTO_TCP**, which supports the following *optname*\ s:
1454 * **TCP_CONGESTION**, **TCP_BPF_IW**,
1455 * **TCP_BPF_SNDCWND_CLAMP**.
1456 * * **IPPROTO_IP**, which supports *optname* **IP_TOS**.
1457 * * **IPPROTO_IPV6**, which supports *optname* **IPV6_TCLASS**.
1458 * Return
1459 * 0 on success, or a negative error in case of failure.
1460 *
Nicolas Dichtelb55cbc82018-10-17 16:24:48 +02001461 * int bpf_skb_adjust_room(struct sk_buff *skb, s32 len_diff, u32 mode, u64 flags)
Quentin Monnetfa156012018-04-25 18:16:56 +01001462 * Description
1463 * Grow or shrink the room for data in the packet associated to
1464 * *skb* by *len_diff*, and according to the selected *mode*.
1465 *
1466 * There is a single supported mode at this time:
1467 *
1468 * * **BPF_ADJ_ROOM_NET**: Adjust room at the network layer
1469 * (room space is added or removed below the layer 3 header).
1470 *
1471 * All values for *flags* are reserved for future usage, and must
1472 * be left at zero.
1473 *
1474 * A call to this helper is susceptible to change the underlaying
1475 * packet buffer. Therefore, at load time, all checks on pointers
1476 * previously done by the verifier are invalidated and must be
1477 * performed again, if the helper is used in combination with
1478 * direct packet access.
1479 * Return
1480 * 0 on success, or a negative error in case of failure.
1481 *
Quentin Monnetab127042018-04-25 18:16:59 +01001482 * int bpf_redirect_map(struct bpf_map *map, u32 key, u64 flags)
1483 * Description
1484 * Redirect the packet to the endpoint referenced by *map* at
1485 * index *key*. Depending on its type, this *map* can contain
1486 * references to net devices (for forwarding packets through other
1487 * ports), or to CPUs (for redirecting XDP frames to another CPU;
1488 * but this is only implemented for native XDP (with driver
1489 * support) as of this writing).
1490 *
1491 * All values for *flags* are reserved for future usage, and must
1492 * be left at zero.
1493 *
1494 * When used to redirect packets to net devices, this helper
1495 * provides a high performance increase over **bpf_redirect**\ ().
1496 * This is due to various implementation details of the underlying
1497 * mechanisms, one of which is the fact that **bpf_redirect_map**\
1498 * () tries to send packet as a "bulk" to the device.
1499 * Return
1500 * **XDP_REDIRECT** on success, or **XDP_ABORTED** on error.
1501 *
1502 * int bpf_sk_redirect_map(struct bpf_map *map, u32 key, u64 flags)
1503 * Description
1504 * Redirect the packet to the socket referenced by *map* (of type
1505 * **BPF_MAP_TYPE_SOCKMAP**) at index *key*. Both ingress and
1506 * egress interfaces can be used for redirection. The
1507 * **BPF_F_INGRESS** value in *flags* is used to make the
1508 * distinction (ingress path is selected if the flag is present,
1509 * egress path otherwise). This is the only flag supported for now.
1510 * Return
1511 * **SK_PASS** on success, or **SK_DROP** on error.
1512 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001513 * 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 +01001514 * Description
1515 * Add an entry to, or update a *map* referencing sockets. The
1516 * *skops* is used as a new value for the entry associated to
1517 * *key*. *flags* is one of:
1518 *
1519 * **BPF_NOEXIST**
1520 * The entry for *key* must not exist in the map.
1521 * **BPF_EXIST**
1522 * The entry for *key* must already exist in the map.
1523 * **BPF_ANY**
1524 * No condition on the existence of the entry for *key*.
1525 *
1526 * If the *map* has eBPF programs (parser and verdict), those will
1527 * be inherited by the socket being added. If the socket is
1528 * already attached to eBPF programs, this results in an error.
1529 * Return
1530 * 0 on success, or a negative error in case of failure.
1531 *
Quentin Monnetfa156012018-04-25 18:16:56 +01001532 * int bpf_xdp_adjust_meta(struct xdp_buff *xdp_md, int delta)
1533 * Description
1534 * Adjust the address pointed by *xdp_md*\ **->data_meta** by
1535 * *delta* (which can be positive or negative). Note that this
1536 * operation modifies the address stored in *xdp_md*\ **->data**,
1537 * so the latter must be loaded only after the helper has been
1538 * called.
1539 *
1540 * The use of *xdp_md*\ **->data_meta** is optional and programs
1541 * are not required to use it. The rationale is that when the
1542 * packet is processed with XDP (e.g. as DoS filter), it is
1543 * possible to push further meta data along with it before passing
1544 * to the stack, and to give the guarantee that an ingress eBPF
1545 * program attached as a TC classifier on the same device can pick
1546 * this up for further post-processing. Since TC works with socket
1547 * buffers, it remains possible to set from XDP the **mark** or
1548 * **priority** pointers, or other pointers for the socket buffer.
1549 * Having this scratch space generic and programmable allows for
1550 * more flexibility as the user is free to store whatever meta
1551 * data they need.
1552 *
1553 * A call to this helper is susceptible to change the underlaying
1554 * packet buffer. Therefore, at load time, all checks on pointers
1555 * previously done by the verifier are invalidated and must be
1556 * performed again, if the helper is used in combination with
1557 * direct packet access.
1558 * Return
1559 * 0 on success, or a negative error in case of failure.
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001560 *
1561 * int bpf_perf_event_read_value(struct bpf_map *map, u64 flags, struct bpf_perf_event_value *buf, u32 buf_size)
1562 * Description
1563 * Read the value of a perf event counter, and store it into *buf*
1564 * of size *buf_size*. This helper relies on a *map* of type
1565 * **BPF_MAP_TYPE_PERF_EVENT_ARRAY**. The nature of the perf event
1566 * counter is selected when *map* is updated with perf event file
1567 * descriptors. The *map* is an array whose size is the number of
1568 * available CPUs, and each cell contains a value relative to one
1569 * CPU. The value to retrieve is indicated by *flags*, that
1570 * contains the index of the CPU to look up, masked with
1571 * **BPF_F_INDEX_MASK**. Alternatively, *flags* can be set to
1572 * **BPF_F_CURRENT_CPU** to indicate that the value for the
1573 * current CPU should be retrieved.
1574 *
1575 * This helper behaves in a way close to
1576 * **bpf_perf_event_read**\ () helper, save that instead of
1577 * just returning the value observed, it fills the *buf*
1578 * structure. This allows for additional data to be retrieved: in
1579 * particular, the enabled and running times (in *buf*\
1580 * **->enabled** and *buf*\ **->running**, respectively) are
1581 * copied. In general, **bpf_perf_event_read_value**\ () is
1582 * recommended over **bpf_perf_event_read**\ (), which has some
1583 * ABI issues and provides fewer functionalities.
1584 *
1585 * These values are interesting, because hardware PMU (Performance
1586 * Monitoring Unit) counters are limited resources. When there are
1587 * more PMU based perf events opened than available counters,
1588 * kernel will multiplex these events so each event gets certain
1589 * percentage (but not all) of the PMU time. In case that
1590 * multiplexing happens, the number of samples or counter value
1591 * will not reflect the case compared to when no multiplexing
1592 * occurs. This makes comparison between different runs difficult.
1593 * Typically, the counter value should be normalized before
1594 * comparing to other experiments. The usual normalization is done
1595 * as follows.
1596 *
1597 * ::
1598 *
1599 * normalized_counter = counter * t_enabled / t_running
1600 *
1601 * Where t_enabled is the time enabled for event and t_running is
1602 * the time running for event since last normalization. The
1603 * enabled and running times are accumulated since the perf event
1604 * open. To achieve scaling factor between two invocations of an
1605 * eBPF program, users can can use CPU id as the key (which is
1606 * typical for perf array usage model) to remember the previous
1607 * value and do the calculation inside the eBPF program.
1608 * Return
1609 * 0 on success, or a negative error in case of failure.
1610 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001611 * 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 +01001612 * Description
1613 * For en eBPF program attached to a perf event, retrieve the
1614 * value of the event counter associated to *ctx* and store it in
1615 * the structure pointed by *buf* and of size *buf_size*. Enabled
1616 * and running times are also stored in the structure (see
1617 * description of helper **bpf_perf_event_read_value**\ () for
1618 * more details).
1619 * Return
1620 * 0 on success, or a negative error in case of failure.
1621 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001622 * int bpf_getsockopt(struct bpf_sock_ops *bpf_socket, int level, int optname, char *optval, int optlen)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001623 * Description
1624 * Emulate a call to **getsockopt()** on the socket associated to
1625 * *bpf_socket*, which must be a full socket. The *level* at
1626 * which the option resides and the name *optname* of the option
1627 * must be specified, see **getsockopt(2)** for more information.
1628 * The retrieved value is stored in the structure pointed by
1629 * *opval* and of length *optlen*.
1630 *
1631 * This helper actually implements a subset of **getsockopt()**.
1632 * It supports the following *level*\ s:
1633 *
1634 * * **IPPROTO_TCP**, which supports *optname*
1635 * **TCP_CONGESTION**.
1636 * * **IPPROTO_IP**, which supports *optname* **IP_TOS**.
1637 * * **IPPROTO_IPV6**, which supports *optname* **IPV6_TCLASS**.
1638 * Return
1639 * 0 on success, or a negative error in case of failure.
1640 *
1641 * int bpf_override_return(struct pt_reg *regs, u64 rc)
1642 * Description
1643 * Used for error injection, this helper uses kprobes to override
1644 * the return value of the probed function, and to set it to *rc*.
1645 * The first argument is the context *regs* on which the kprobe
1646 * works.
1647 *
1648 * This helper works by setting setting the PC (program counter)
1649 * to an override function which is run in place of the original
1650 * probed function. This means the probed function is not run at
1651 * all. The replacement function just returns with the required
1652 * value.
1653 *
1654 * This helper has security implications, and thus is subject to
1655 * restrictions. It is only available if the kernel was compiled
1656 * with the **CONFIG_BPF_KPROBE_OVERRIDE** configuration
1657 * option, and in this case it only works on functions tagged with
1658 * **ALLOW_ERROR_INJECTION** in the kernel code.
1659 *
1660 * Also, the helper is only available for the architectures having
1661 * the CONFIG_FUNCTION_ERROR_INJECTION option. As of this writing,
1662 * x86 architecture is the only one to support this feature.
1663 * Return
1664 * 0
1665 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001666 * int bpf_sock_ops_cb_flags_set(struct bpf_sock_ops *bpf_sock, int argval)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001667 * Description
1668 * Attempt to set the value of the **bpf_sock_ops_cb_flags** field
1669 * for the full TCP socket associated to *bpf_sock_ops* to
1670 * *argval*.
1671 *
1672 * The primary use of this field is to determine if there should
1673 * be calls to eBPF programs of type
1674 * **BPF_PROG_TYPE_SOCK_OPS** at various points in the TCP
1675 * code. A program of the same type can change its value, per
1676 * connection and as necessary, when the connection is
1677 * established. This field is directly accessible for reading, but
1678 * this helper must be used for updates in order to return an
1679 * error if an eBPF program tries to set a callback that is not
1680 * supported in the current kernel.
1681 *
1682 * The supported callback values that *argval* can combine are:
1683 *
1684 * * **BPF_SOCK_OPS_RTO_CB_FLAG** (retransmission time out)
1685 * * **BPF_SOCK_OPS_RETRANS_CB_FLAG** (retransmission)
1686 * * **BPF_SOCK_OPS_STATE_CB_FLAG** (TCP state change)
1687 *
1688 * Here are some examples of where one could call such eBPF
1689 * program:
1690 *
1691 * * When RTO fires.
1692 * * When a packet is retransmitted.
1693 * * When the connection terminates.
1694 * * When a packet is sent.
1695 * * When a packet is received.
1696 * Return
1697 * Code **-EINVAL** if the socket is not a full TCP socket;
1698 * otherwise, a positive number containing the bits that could not
1699 * be set is returned (which comes down to 0 if all bits were set
1700 * as required).
1701 *
Quentin Monnetab127042018-04-25 18:16:59 +01001702 * int bpf_msg_redirect_map(struct sk_msg_buff *msg, struct bpf_map *map, u32 key, u64 flags)
1703 * Description
1704 * This helper is used in programs implementing policies at the
1705 * socket level. If the message *msg* is allowed to pass (i.e. if
1706 * the verdict eBPF program returns **SK_PASS**), redirect it to
1707 * the socket referenced by *map* (of type
1708 * **BPF_MAP_TYPE_SOCKMAP**) at index *key*. Both ingress and
1709 * egress interfaces can be used for redirection. The
1710 * **BPF_F_INGRESS** value in *flags* is used to make the
1711 * distinction (ingress path is selected if the flag is present,
1712 * egress path otherwise). This is the only flag supported for now.
1713 * Return
1714 * **SK_PASS** on success, or **SK_DROP** on error.
1715 *
1716 * int bpf_msg_apply_bytes(struct sk_msg_buff *msg, u32 bytes)
1717 * Description
1718 * For socket policies, apply the verdict of the eBPF program to
1719 * the next *bytes* (number of bytes) of message *msg*.
1720 *
1721 * For example, this helper can be used in the following cases:
1722 *
1723 * * A single **sendmsg**\ () or **sendfile**\ () system call
1724 * contains multiple logical messages that the eBPF program is
1725 * supposed to read and for which it should apply a verdict.
1726 * * An eBPF program only cares to read the first *bytes* of a
1727 * *msg*. If the message has a large payload, then setting up
1728 * and calling the eBPF program repeatedly for all bytes, even
1729 * though the verdict is already known, would create unnecessary
1730 * overhead.
1731 *
1732 * When called from within an eBPF program, the helper sets a
1733 * counter internal to the BPF infrastructure, that is used to
1734 * apply the last verdict to the next *bytes*. If *bytes* is
1735 * smaller than the current data being processed from a
1736 * **sendmsg**\ () or **sendfile**\ () system call, the first
1737 * *bytes* will be sent and the eBPF program will be re-run with
1738 * the pointer for start of data pointing to byte number *bytes*
1739 * **+ 1**. If *bytes* is larger than the current data being
1740 * processed, then the eBPF verdict will be applied to multiple
1741 * **sendmsg**\ () or **sendfile**\ () calls until *bytes* are
1742 * consumed.
1743 *
1744 * Note that if a socket closes with the internal counter holding
1745 * a non-zero value, this is not a problem because data is not
1746 * being buffered for *bytes* and is sent as it is received.
1747 * Return
1748 * 0
1749 *
1750 * int bpf_msg_cork_bytes(struct sk_msg_buff *msg, u32 bytes)
1751 * Description
1752 * For socket policies, prevent the execution of the verdict eBPF
1753 * program for message *msg* until *bytes* (byte number) have been
1754 * accumulated.
1755 *
1756 * This can be used when one needs a specific number of bytes
1757 * before a verdict can be assigned, even if the data spans
1758 * multiple **sendmsg**\ () or **sendfile**\ () calls. The extreme
1759 * case would be a user calling **sendmsg**\ () repeatedly with
1760 * 1-byte long message segments. Obviously, this is bad for
1761 * performance, but it is still valid. If the eBPF program needs
1762 * *bytes* bytes to validate a header, this helper can be used to
1763 * prevent the eBPF program to be called again until *bytes* have
1764 * been accumulated.
1765 * Return
1766 * 0
1767 *
1768 * int bpf_msg_pull_data(struct sk_msg_buff *msg, u32 start, u32 end, u64 flags)
1769 * Description
1770 * For socket policies, pull in non-linear data from user space
1771 * for *msg* and set pointers *msg*\ **->data** and *msg*\
1772 * **->data_end** to *start* and *end* bytes offsets into *msg*,
1773 * respectively.
1774 *
1775 * If a program of type **BPF_PROG_TYPE_SK_MSG** is run on a
1776 * *msg* it can only parse data that the (**data**, **data_end**)
1777 * pointers have already consumed. For **sendmsg**\ () hooks this
1778 * is likely the first scatterlist element. But for calls relying
1779 * on the **sendpage** handler (e.g. **sendfile**\ ()) this will
1780 * be the range (**0**, **0**) because the data is shared with
1781 * user space and by default the objective is to avoid allowing
1782 * user space to modify data while (or after) eBPF verdict is
1783 * being decided. This helper can be used to pull in data and to
1784 * set the start and end pointer to given values. Data will be
1785 * copied if necessary (i.e. if data was not linear and if start
1786 * and end pointers do not point to the same chunk).
1787 *
1788 * A call to this helper is susceptible to change the underlaying
1789 * packet buffer. Therefore, at load time, all checks on pointers
1790 * previously done by the verifier are invalidated and must be
1791 * performed again, if the helper is used in combination with
1792 * direct packet access.
1793 *
1794 * All values for *flags* are reserved for future usage, and must
1795 * be left at zero.
1796 * Return
1797 * 0 on success, or a negative error in case of failure.
1798 *
Andrey Ignatova3ef8e92018-04-28 16:06:19 -07001799 * int bpf_bind(struct bpf_sock_addr *ctx, struct sockaddr *addr, int addr_len)
Quentin Monnet7aa79a82018-04-25 18:16:58 +01001800 * Description
1801 * Bind the socket associated to *ctx* to the address pointed by
1802 * *addr*, of length *addr_len*. This allows for making outgoing
1803 * connection from the desired IP address, which can be useful for
1804 * example when all processes inside a cgroup should use one
1805 * single IP address on a host that has multiple IP configured.
1806 *
1807 * This helper works for IPv4 and IPv6, TCP and UDP sockets. The
1808 * domain (*addr*\ **->sa_family**) must be **AF_INET** (or
1809 * **AF_INET6**). Looking for a free port to bind to can be
1810 * expensive, therefore binding to port is not permitted by the
1811 * helper: *addr*\ **->sin_port** (or **sin6_port**, respectively)
1812 * must be set to zero.
1813 * Return
1814 * 0 on success, or a negative error in case of failure.
Quentin Monnet2d020dd2018-04-25 18:17:00 +01001815 *
1816 * int bpf_xdp_adjust_tail(struct xdp_buff *xdp_md, int delta)
1817 * Description
1818 * Adjust (move) *xdp_md*\ **->data_end** by *delta* bytes. It is
1819 * only possible to shrink the packet as of this writing,
1820 * therefore *delta* must be a negative integer.
1821 *
1822 * A call to this helper is susceptible to change the underlaying
1823 * packet buffer. Therefore, at load time, all checks on pointers
1824 * previously done by the verifier are invalidated and must be
1825 * performed again, if the helper is used in combination with
1826 * direct packet access.
1827 * Return
1828 * 0 on success, or a negative error in case of failure.
1829 *
1830 * int bpf_skb_get_xfrm_state(struct sk_buff *skb, u32 index, struct bpf_xfrm_state *xfrm_state, u32 size, u64 flags)
1831 * Description
1832 * Retrieve the XFRM state (IP transform framework, see also
1833 * **ip-xfrm(8)**) at *index* in XFRM "security path" for *skb*.
1834 *
1835 * The retrieved value is stored in the **struct bpf_xfrm_state**
1836 * pointed by *xfrm_state* and of length *size*.
1837 *
1838 * All values for *flags* are reserved for future usage, and must
1839 * be left at zero.
1840 *
1841 * This helper is available only if the kernel was compiled with
1842 * **CONFIG_XFRM** configuration option.
1843 * Return
1844 * 0 on success, or a negative error in case of failure.
Yonghong Songc195651e2018-04-28 22:28:08 -07001845 *
1846 * int bpf_get_stack(struct pt_regs *regs, void *buf, u32 size, u64 flags)
1847 * Description
Quentin Monnet79552fb2018-04-30 11:39:04 +01001848 * Return a user or a kernel stack in bpf program provided buffer.
1849 * To achieve this, the helper needs *ctx*, which is a pointer
1850 * to the context on which the tracing program is executed.
1851 * To store the stacktrace, the bpf program provides *buf* with
1852 * a nonnegative *size*.
Yonghong Songc195651e2018-04-28 22:28:08 -07001853 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001854 * The last argument, *flags*, holds the number of stack frames to
1855 * skip (from 0 to 255), masked with
1856 * **BPF_F_SKIP_FIELD_MASK**. The next bits can be used to set
1857 * the following flags:
Yonghong Songc195651e2018-04-28 22:28:08 -07001858 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001859 * **BPF_F_USER_STACK**
1860 * Collect a user space stack instead of a kernel stack.
1861 * **BPF_F_USER_BUILD_ID**
1862 * Collect buildid+offset instead of ips for user stack,
1863 * only valid if **BPF_F_USER_STACK** is also specified.
Yonghong Songc195651e2018-04-28 22:28:08 -07001864 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001865 * **bpf_get_stack**\ () can collect up to
1866 * **PERF_MAX_STACK_DEPTH** both kernel and user frames, subject
1867 * to sufficient large buffer size. Note that
1868 * this limit can be controlled with the **sysctl** program, and
1869 * that it should be manually increased in order to profile long
1870 * user stacks (such as stacks for Java programs). To do so, use:
Yonghong Songc195651e2018-04-28 22:28:08 -07001871 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001872 * ::
Yonghong Songc195651e2018-04-28 22:28:08 -07001873 *
Quentin Monnet79552fb2018-04-30 11:39:04 +01001874 * # sysctl kernel.perf_event_max_stack=<new value>
Yonghong Songc195651e2018-04-28 22:28:08 -07001875 * Return
Quentin Monnet7a279e92018-05-29 12:27:44 +01001876 * A non-negative value equal to or less than *size* on success,
1877 * or a negative error in case of failure.
Daniel Borkmann4e1ec562018-05-04 01:08:15 +02001878 *
Quentin Monnet2bae79d2018-07-12 12:52:22 +01001879 * int bpf_skb_load_bytes_relative(const struct sk_buff *skb, u32 offset, void *to, u32 len, u32 start_header)
Daniel Borkmann4e1ec562018-05-04 01:08:15 +02001880 * Description
1881 * This helper is similar to **bpf_skb_load_bytes**\ () in that
1882 * it provides an easy way to load *len* bytes from *offset*
1883 * from the packet associated to *skb*, into the buffer pointed
1884 * by *to*. The difference to **bpf_skb_load_bytes**\ () is that
1885 * a fifth argument *start_header* exists in order to select a
1886 * base offset to start from. *start_header* can be one of:
1887 *
1888 * **BPF_HDR_START_MAC**
1889 * Base offset to load data from is *skb*'s mac header.
1890 * **BPF_HDR_START_NET**
1891 * Base offset to load data from is *skb*'s network header.
1892 *
1893 * In general, "direct packet access" is the preferred method to
1894 * access packet data, however, this helper is in particular useful
1895 * in socket filters where *skb*\ **->data** does not always point
1896 * to the start of the mac header and where "direct packet access"
1897 * is not available.
Daniel Borkmann4e1ec562018-05-04 01:08:15 +02001898 * Return
1899 * 0 on success, or a negative error in case of failure.
1900 *
David Ahern87f5fc72018-05-09 20:34:26 -07001901 * int bpf_fib_lookup(void *ctx, struct bpf_fib_lookup *params, int plen, u32 flags)
1902 * Description
1903 * Do FIB lookup in kernel tables using parameters in *params*.
1904 * If lookup is successful and result shows packet is to be
1905 * forwarded, the neighbor tables are searched for the nexthop.
1906 * If successful (ie., FIB lookup shows forwarding and nexthop
David Ahernfa898d72018-05-29 10:58:07 -07001907 * is resolved), the nexthop address is returned in ipv4_dst
1908 * or ipv6_dst based on family, smac is set to mac address of
1909 * egress device, dmac is set to nexthop mac address, rt_metric
David Ahern4c795792018-06-26 16:21:18 -07001910 * is set to metric from route (IPv4/IPv6 only), and ifindex
1911 * is set to the device index of the nexthop from the FIB lookup.
David Ahern87f5fc72018-05-09 20:34:26 -07001912 *
1913 * *plen* argument is the size of the passed in struct.
Quentin Monnet7a279e92018-05-29 12:27:44 +01001914 * *flags* argument can be a combination of one or more of the
1915 * following values:
David Ahern87f5fc72018-05-09 20:34:26 -07001916 *
Quentin Monnet7a279e92018-05-29 12:27:44 +01001917 * **BPF_FIB_LOOKUP_DIRECT**
1918 * Do a direct table lookup vs full lookup using FIB
1919 * rules.
1920 * **BPF_FIB_LOOKUP_OUTPUT**
1921 * Perform lookup from an egress perspective (default is
1922 * ingress).
David Ahern87f5fc72018-05-09 20:34:26 -07001923 *
1924 * *ctx* is either **struct xdp_md** for XDP programs or
1925 * **struct sk_buff** tc cls_act programs.
David Ahern87f5fc72018-05-09 20:34:26 -07001926 * Return
David Ahern4c795792018-06-26 16:21:18 -07001927 * * < 0 if any input argument is invalid
1928 * * 0 on success (packet is forwarded, nexthop neighbor exists)
1929 * * > 0 one of **BPF_FIB_LKUP_RET_** codes explaining why the
Quentin Monnet2bae79d2018-07-12 12:52:22 +01001930 * packet is not forwarded or needs assist from full stack
John Fastabend81110382018-05-14 10:00:17 -07001931 *
1932 * int bpf_sock_hash_update(struct bpf_sock_ops_kern *skops, struct bpf_map *map, void *key, u64 flags)
1933 * Description
1934 * Add an entry to, or update a sockhash *map* referencing sockets.
1935 * The *skops* is used as a new value for the entry associated to
1936 * *key*. *flags* is one of:
1937 *
1938 * **BPF_NOEXIST**
1939 * The entry for *key* must not exist in the map.
1940 * **BPF_EXIST**
1941 * The entry for *key* must already exist in the map.
1942 * **BPF_ANY**
1943 * No condition on the existence of the entry for *key*.
1944 *
1945 * If the *map* has eBPF programs (parser and verdict), those will
1946 * be inherited by the socket being added. If the socket is
1947 * already attached to eBPF programs, this results in an error.
1948 * Return
1949 * 0 on success, or a negative error in case of failure.
1950 *
1951 * int bpf_msg_redirect_hash(struct sk_msg_buff *msg, struct bpf_map *map, void *key, u64 flags)
1952 * Description
1953 * This helper is used in programs implementing policies at the
1954 * socket level. If the message *msg* is allowed to pass (i.e. if
1955 * the verdict eBPF program returns **SK_PASS**), redirect it to
1956 * the socket referenced by *map* (of type
1957 * **BPF_MAP_TYPE_SOCKHASH**) using hash *key*. Both ingress and
1958 * egress interfaces can be used for redirection. The
1959 * **BPF_F_INGRESS** value in *flags* is used to make the
1960 * distinction (ingress path is selected if the flag is present,
1961 * egress path otherwise). This is the only flag supported for now.
1962 * Return
1963 * **SK_PASS** on success, or **SK_DROP** on error.
1964 *
1965 * int bpf_sk_redirect_hash(struct sk_buff *skb, struct bpf_map *map, void *key, u64 flags)
1966 * Description
1967 * This helper is used in programs implementing policies at the
1968 * skb socket level. If the sk_buff *skb* is allowed to pass (i.e.
1969 * if the verdeict eBPF program returns **SK_PASS**), redirect it
1970 * to the socket referenced by *map* (of type
1971 * **BPF_MAP_TYPE_SOCKHASH**) using hash *key*. Both ingress and
1972 * egress interfaces can be used for redirection. The
1973 * **BPF_F_INGRESS** value in *flags* is used to make the
1974 * distinction (ingress path is selected if the flag is present,
1975 * egress otherwise). This is the only flag supported for now.
1976 * Return
1977 * **SK_PASS** on success, or **SK_DROP** on error.
Mathieu Xhonneuxfe94cc22018-05-20 14:58:14 +01001978 *
1979 * int bpf_lwt_push_encap(struct sk_buff *skb, u32 type, void *hdr, u32 len)
1980 * Description
1981 * Encapsulate the packet associated to *skb* within a Layer 3
1982 * protocol header. This header is provided in the buffer at
1983 * address *hdr*, with *len* its size in bytes. *type* indicates
1984 * the protocol of the header and can be one of:
1985 *
1986 * **BPF_LWT_ENCAP_SEG6**
1987 * IPv6 encapsulation with Segment Routing Header
1988 * (**struct ipv6_sr_hdr**). *hdr* only contains the SRH,
1989 * the IPv6 header is computed by the kernel.
1990 * **BPF_LWT_ENCAP_SEG6_INLINE**
1991 * Only works if *skb* contains an IPv6 packet. Insert a
1992 * Segment Routing Header (**struct ipv6_sr_hdr**) inside
1993 * the IPv6 header.
1994 *
1995 * A call to this helper is susceptible to change the underlaying
1996 * packet buffer. Therefore, at load time, all checks on pointers
1997 * previously done by the verifier are invalidated and must be
1998 * performed again, if the helper is used in combination with
1999 * direct packet access.
2000 * Return
2001 * 0 on success, or a negative error in case of failure.
2002 *
2003 * int bpf_lwt_seg6_store_bytes(struct sk_buff *skb, u32 offset, const void *from, u32 len)
2004 * Description
2005 * Store *len* bytes from address *from* into the packet
2006 * associated to *skb*, at *offset*. Only the flags, tag and TLVs
2007 * inside the outermost IPv6 Segment Routing Header can be
2008 * modified through this helper.
2009 *
2010 * A call to this helper is susceptible to change the underlaying
2011 * packet buffer. Therefore, at load time, all checks on pointers
2012 * previously done by the verifier are invalidated and must be
2013 * performed again, if the helper is used in combination with
2014 * direct packet access.
2015 * Return
2016 * 0 on success, or a negative error in case of failure.
2017 *
2018 * int bpf_lwt_seg6_adjust_srh(struct sk_buff *skb, u32 offset, s32 delta)
2019 * Description
2020 * Adjust the size allocated to TLVs in the outermost IPv6
2021 * Segment Routing Header contained in the packet associated to
2022 * *skb*, at position *offset* by *delta* bytes. Only offsets
2023 * after the segments are accepted. *delta* can be as well
2024 * positive (growing) as negative (shrinking).
2025 *
2026 * A call to this helper is susceptible to change the underlaying
2027 * packet buffer. Therefore, at load time, all checks on pointers
2028 * previously done by the verifier are invalidated and must be
2029 * performed again, if the helper is used in combination with
2030 * direct packet access.
2031 * Return
2032 * 0 on success, or a negative error in case of failure.
2033 *
2034 * int bpf_lwt_seg6_action(struct sk_buff *skb, u32 action, void *param, u32 param_len)
2035 * Description
2036 * Apply an IPv6 Segment Routing action of type *action* to the
2037 * packet associated to *skb*. Each action takes a parameter
2038 * contained at address *param*, and of length *param_len* bytes.
2039 * *action* can be one of:
2040 *
2041 * **SEG6_LOCAL_ACTION_END_X**
2042 * End.X action: Endpoint with Layer-3 cross-connect.
2043 * Type of *param*: **struct in6_addr**.
2044 * **SEG6_LOCAL_ACTION_END_T**
2045 * End.T action: Endpoint with specific IPv6 table lookup.
2046 * Type of *param*: **int**.
2047 * **SEG6_LOCAL_ACTION_END_B6**
2048 * End.B6 action: Endpoint bound to an SRv6 policy.
2049 * Type of param: **struct ipv6_sr_hdr**.
2050 * **SEG6_LOCAL_ACTION_END_B6_ENCAP**
2051 * End.B6.Encap action: Endpoint bound to an SRv6
2052 * encapsulation policy.
2053 * Type of param: **struct ipv6_sr_hdr**.
2054 *
2055 * A call to this helper is susceptible to change the underlaying
2056 * packet buffer. Therefore, at load time, all checks on pointers
2057 * previously done by the verifier are invalidated and must be
2058 * performed again, if the helper is used in combination with
2059 * direct packet access.
2060 * Return
2061 * 0 on success, or a negative error in case of failure.
Sean Youngf4364dc2018-05-27 12:24:09 +01002062 *
2063 * int bpf_rc_keydown(void *ctx, u32 protocol, u64 scancode, u32 toggle)
2064 * Description
2065 * This helper is used in programs implementing IR decoding, to
2066 * report a successfully decoded key press with *scancode*,
2067 * *toggle* value in the given *protocol*. The scancode will be
2068 * translated to a keycode using the rc keymap, and reported as
2069 * an input key down event. After a period a key up event is
2070 * generated. This period can be extended by calling either
2071 * **bpf_rc_keydown** () again with the same values, or calling
2072 * **bpf_rc_repeat** ().
2073 *
2074 * Some protocols include a toggle bit, in case the button was
2075 * released and pressed again between consecutive scancodes.
2076 *
2077 * The *ctx* should point to the lirc sample as passed into
2078 * the program.
2079 *
2080 * The *protocol* is the decoded protocol number (see
2081 * **enum rc_proto** for some predefined values).
2082 *
2083 * This helper is only available is the kernel was compiled with
2084 * the **CONFIG_BPF_LIRC_MODE2** configuration option set to
2085 * "**y**".
Sean Youngf4364dc2018-05-27 12:24:09 +01002086 * Return
2087 * 0
2088 *
2089 * int bpf_rc_repeat(void *ctx)
2090 * Description
2091 * This helper is used in programs implementing IR decoding, to
2092 * report a successfully decoded repeat key message. This delays
2093 * the generation of a key up event for previously generated
2094 * key down event.
2095 *
2096 * Some IR protocols like NEC have a special IR message for
2097 * repeating last button, for when a button is held down.
2098 *
2099 * The *ctx* should point to the lirc sample as passed into
2100 * the program.
2101 *
2102 * This helper is only available is the kernel was compiled with
2103 * the **CONFIG_BPF_LIRC_MODE2** configuration option set to
2104 * "**y**".
Sean Youngf4364dc2018-05-27 12:24:09 +01002105 * Return
2106 * 0
Daniel Borkmanncb20b082018-06-02 23:06:36 +02002107 *
2108 * uint64_t bpf_skb_cgroup_id(struct sk_buff *skb)
2109 * Description
2110 * Return the cgroup v2 id of the socket associated with the *skb*.
2111 * This is roughly similar to the **bpf_get_cgroup_classid**\ ()
2112 * helper for cgroup v1 by providing a tag resp. identifier that
2113 * can be matched on or used for map lookups e.g. to implement
2114 * policy. The cgroup v2 id of a given path in the hierarchy is
2115 * exposed in user space through the f_handle API in order to get
2116 * to the same 64-bit id.
2117 *
2118 * This helper can be used on TC egress path, but not on ingress,
2119 * and is available only if the kernel was compiled with the
2120 * **CONFIG_SOCK_CGROUP_DATA** configuration option.
2121 * Return
2122 * The id is returned or 0 in case the id could not be retrieved.
Yonghong Songbf6fa2c2018-06-03 15:59:41 -07002123 *
Andrey Ignatov77236282018-08-12 10:49:27 -07002124 * u64 bpf_skb_ancestor_cgroup_id(struct sk_buff *skb, int ancestor_level)
2125 * Description
2126 * Return id of cgroup v2 that is ancestor of cgroup associated
2127 * with the *skb* at the *ancestor_level*. The root cgroup is at
2128 * *ancestor_level* zero and each step down the hierarchy
2129 * increments the level. If *ancestor_level* == level of cgroup
2130 * associated with *skb*, then return value will be same as that
2131 * of **bpf_skb_cgroup_id**\ ().
2132 *
2133 * The helper is useful to implement policies based on cgroups
2134 * that are upper in hierarchy than immediate cgroup associated
2135 * with *skb*.
2136 *
2137 * The format of returned id and helper limitations are same as in
2138 * **bpf_skb_cgroup_id**\ ().
2139 * Return
2140 * The id is returned or 0 in case the id could not be retrieved.
2141 *
Yonghong Songbf6fa2c2018-06-03 15:59:41 -07002142 * u64 bpf_get_current_cgroup_id(void)
2143 * Return
2144 * A 64-bit integer containing the current cgroup id based
2145 * on the cgroup within which the current task is running.
Roman Gushchincd339432018-08-02 14:27:24 -07002146 *
2147 * void* get_local_storage(void *map, u64 flags)
2148 * Description
2149 * Get the pointer to the local storage area.
2150 * The type and the size of the local storage is defined
2151 * by the *map* argument.
2152 * The *flags* meaning is specific for each map type,
2153 * and has to be 0 for cgroup local storage.
2154 *
2155 * Depending on the bpf program type, a local storage area
2156 * can be shared between multiple instances of the bpf program,
2157 * running simultaneously.
2158 *
2159 * A user should care about the synchronization by himself.
2160 * For example, by using the BPF_STX_XADD instruction to alter
2161 * the shared data.
2162 * Return
2163 * Pointer to the local storage area.
Martin KaFai Lau2dbb9b92018-08-08 01:01:25 -07002164 *
2165 * int bpf_sk_select_reuseport(struct sk_reuseport_md *reuse, struct bpf_map *map, void *key, u64 flags)
2166 * Description
2167 * Select a SO_REUSEPORT sk from a BPF_MAP_TYPE_REUSEPORT_ARRAY map
2168 * It checks the selected sk is matching the incoming
2169 * request in the skb.
2170 * Return
2171 * 0 on success, or a negative error in case of failure.
Joe Stringer6acc9b42018-10-02 13:35:36 -07002172 *
2173 * struct bpf_sock *bpf_sk_lookup_tcp(void *ctx, struct bpf_sock_tuple *tuple, u32 tuple_size, u32 netns, u64 flags)
2174 * Description
2175 * Look for TCP socket matching *tuple*, optionally in a child
2176 * network namespace *netns*. The return value must be checked,
2177 * and if non-NULL, released via **bpf_sk_release**\ ().
2178 *
2179 * The *ctx* should point to the context of the program, such as
2180 * the skb or socket (depending on the hook in use). This is used
2181 * to determine the base network namespace for the lookup.
2182 *
2183 * *tuple_size* must be one of:
2184 *
2185 * **sizeof**\ (*tuple*\ **->ipv4**)
2186 * Look for an IPv4 socket.
2187 * **sizeof**\ (*tuple*\ **->ipv6**)
2188 * Look for an IPv6 socket.
2189 *
2190 * If the *netns* is zero, then the socket lookup table in the
2191 * netns associated with the *ctx* will be used. For the TC hooks,
2192 * this in the netns of the device in the skb. For socket hooks,
2193 * this in the netns of the socket. If *netns* is non-zero, then
2194 * it specifies the ID of the netns relative to the netns
2195 * associated with the *ctx*.
2196 *
2197 * All values for *flags* are reserved for future usage, and must
2198 * be left at zero.
2199 *
2200 * This helper is available only if the kernel was compiled with
2201 * **CONFIG_NET** configuration option.
2202 * Return
2203 * Pointer to *struct bpf_sock*, or NULL in case of failure.
Nitin Handec8123ea2018-10-28 21:02:45 -07002204 * For sockets with reuseport option, *struct bpf_sock*
2205 * return is from reuse->socks[] using hash of the packet.
Joe Stringer6acc9b42018-10-02 13:35:36 -07002206 *
2207 * struct bpf_sock *bpf_sk_lookup_udp(void *ctx, struct bpf_sock_tuple *tuple, u32 tuple_size, u32 netns, u64 flags)
2208 * Description
2209 * Look for UDP socket matching *tuple*, optionally in a child
2210 * network namespace *netns*. The return value must be checked,
2211 * and if non-NULL, released via **bpf_sk_release**\ ().
2212 *
2213 * The *ctx* should point to the context of the program, such as
2214 * the skb or socket (depending on the hook in use). This is used
2215 * to determine the base network namespace for the lookup.
2216 *
2217 * *tuple_size* must be one of:
2218 *
2219 * **sizeof**\ (*tuple*\ **->ipv4**)
2220 * Look for an IPv4 socket.
2221 * **sizeof**\ (*tuple*\ **->ipv6**)
2222 * Look for an IPv6 socket.
2223 *
2224 * If the *netns* is zero, then the socket lookup table in the
2225 * netns associated with the *ctx* will be used. For the TC hooks,
2226 * this in the netns of the device in the skb. For socket hooks,
2227 * this in the netns of the socket. If *netns* is non-zero, then
2228 * it specifies the ID of the netns relative to the netns
2229 * associated with the *ctx*.
2230 *
2231 * All values for *flags* are reserved for future usage, and must
2232 * be left at zero.
2233 *
2234 * This helper is available only if the kernel was compiled with
2235 * **CONFIG_NET** configuration option.
2236 * Return
2237 * Pointer to *struct bpf_sock*, or NULL in case of failure.
Nitin Handec8123ea2018-10-28 21:02:45 -07002238 * For sockets with reuseport option, *struct bpf_sock*
2239 * return is from reuse->socks[] using hash of the packet.
Joe Stringer6acc9b42018-10-02 13:35:36 -07002240 *
2241 * int bpf_sk_release(struct bpf_sock *sk)
2242 * Description
2243 * Release the reference held by *sock*. *sock* must be a non-NULL
2244 * pointer that was returned from bpf_sk_lookup_xxx\ ().
2245 * Return
2246 * 0 on success, or a negative error in case of failure.
John Fastabend6fff6072018-10-19 19:56:49 -07002247 *
2248 * int bpf_msg_push_data(struct sk_buff *skb, u32 start, u32 len, u64 flags)
2249 * Description
2250 * For socket policies, insert *len* bytes into msg at offset
2251 * *start*.
2252 *
2253 * If a program of type **BPF_PROG_TYPE_SK_MSG** is run on a
2254 * *msg* it may want to insert metadata or options into the msg.
2255 * This can later be read and used by any of the lower layer BPF
2256 * hooks.
2257 *
2258 * This helper may fail if under memory pressure (a malloc
2259 * fails) in these cases BPF programs will get an appropriate
2260 * error and BPF programs will need to handle them.
2261 *
2262 * Return
2263 * 0 on success, or a negative error in case of failure.
Thomas Grafebb676d2016-10-27 11:23:51 +02002264 */
2265#define __BPF_FUNC_MAPPER(FN) \
2266 FN(unspec), \
2267 FN(map_lookup_elem), \
2268 FN(map_update_elem), \
2269 FN(map_delete_elem), \
2270 FN(probe_read), \
2271 FN(ktime_get_ns), \
2272 FN(trace_printk), \
2273 FN(get_prandom_u32), \
2274 FN(get_smp_processor_id), \
2275 FN(skb_store_bytes), \
2276 FN(l3_csum_replace), \
2277 FN(l4_csum_replace), \
2278 FN(tail_call), \
2279 FN(clone_redirect), \
2280 FN(get_current_pid_tgid), \
2281 FN(get_current_uid_gid), \
2282 FN(get_current_comm), \
2283 FN(get_cgroup_classid), \
2284 FN(skb_vlan_push), \
2285 FN(skb_vlan_pop), \
2286 FN(skb_get_tunnel_key), \
2287 FN(skb_set_tunnel_key), \
2288 FN(perf_event_read), \
2289 FN(redirect), \
2290 FN(get_route_realm), \
2291 FN(perf_event_output), \
2292 FN(skb_load_bytes), \
2293 FN(get_stackid), \
2294 FN(csum_diff), \
2295 FN(skb_get_tunnel_opt), \
2296 FN(skb_set_tunnel_opt), \
2297 FN(skb_change_proto), \
2298 FN(skb_change_type), \
2299 FN(skb_under_cgroup), \
2300 FN(get_hash_recalc), \
2301 FN(get_current_task), \
2302 FN(probe_write_user), \
2303 FN(current_task_under_cgroup), \
2304 FN(skb_change_tail), \
2305 FN(skb_pull_data), \
2306 FN(csum_update), \
2307 FN(set_hash_invalid), \
Thomas Graf3a0af8f2016-11-30 17:10:10 +01002308 FN(get_numa_node_id), \
Martin KaFai Lau17bedab2016-12-07 15:53:11 -08002309 FN(skb_change_head), \
Gianluca Borelloa5e8c072017-01-18 17:55:49 +00002310 FN(xdp_adjust_head), \
Chenbo Feng91b82702017-03-22 17:27:34 -07002311 FN(probe_read_str), \
Chenbo Feng6acc5c22017-03-22 17:27:35 -07002312 FN(get_socket_cookie), \
Daniel Borkmannded092c2017-06-11 00:50:47 +02002313 FN(get_socket_uid), \
Lawrence Brakmo8c4b4c72017-06-30 20:02:46 -07002314 FN(set_hash), \
Daniel Borkmann2be7e212017-07-02 02:13:26 +02002315 FN(setsockopt), \
John Fastabend97f91a72017-07-17 09:29:18 -07002316 FN(skb_adjust_room), \
John Fastabend174a79f2017-08-15 22:32:47 -07002317 FN(redirect_map), \
2318 FN(sk_redirect_map), \
2319 FN(sock_map_update), \
Yonghong Song908432c2017-10-05 09:19:20 -07002320 FN(xdp_adjust_meta), \
Yonghong Song4bebdc72017-10-05 09:19:22 -07002321 FN(perf_event_read_value), \
Lawrence Brakmocd86d1f2017-10-20 11:05:40 -07002322 FN(perf_prog_read_value), \
Josef Bacik9802d862017-12-11 11:36:48 -05002323 FN(getsockopt), \
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002324 FN(override_return), \
John Fastabend4f738ad2018-03-18 12:57:10 -07002325 FN(sock_ops_cb_flags_set), \
John Fastabend2a100312018-03-18 12:57:15 -07002326 FN(msg_redirect_map), \
John Fastabend91843d52018-03-18 12:57:20 -07002327 FN(msg_apply_bytes), \
John Fastabend015632b2018-03-18 12:57:25 -07002328 FN(msg_cork_bytes), \
Andrey Ignatovd74bad42018-03-30 15:08:05 -07002329 FN(msg_pull_data), \
Nikita V. Shirokovb32cc5b2018-04-17 21:42:13 -07002330 FN(bind), \
Eyal Birger12bed762018-04-24 17:50:29 +03002331 FN(xdp_adjust_tail), \
Yonghong Songc195651e2018-04-28 22:28:08 -07002332 FN(skb_get_xfrm_state), \
Daniel Borkmann4e1ec562018-05-04 01:08:15 +02002333 FN(get_stack), \
David Ahern87f5fc72018-05-09 20:34:26 -07002334 FN(skb_load_bytes_relative), \
John Fastabend81110382018-05-14 10:00:17 -07002335 FN(fib_lookup), \
2336 FN(sock_hash_update), \
2337 FN(msg_redirect_hash), \
Mathieu Xhonneuxfe94cc22018-05-20 14:58:14 +01002338 FN(sk_redirect_hash), \
2339 FN(lwt_push_encap), \
2340 FN(lwt_seg6_store_bytes), \
2341 FN(lwt_seg6_adjust_srh), \
Sean Youngf4364dc2018-05-27 12:24:09 +01002342 FN(lwt_seg6_action), \
2343 FN(rc_repeat), \
Daniel Borkmanncb20b082018-06-02 23:06:36 +02002344 FN(rc_keydown), \
Yonghong Songbf6fa2c2018-06-03 15:59:41 -07002345 FN(skb_cgroup_id), \
Roman Gushchincd339432018-08-02 14:27:24 -07002346 FN(get_current_cgroup_id), \
Martin KaFai Lau2dbb9b92018-08-08 01:01:25 -07002347 FN(get_local_storage), \
Andrey Ignatov77236282018-08-12 10:49:27 -07002348 FN(sk_select_reuseport), \
Joe Stringer6acc9b42018-10-02 13:35:36 -07002349 FN(skb_ancestor_cgroup_id), \
2350 FN(sk_lookup_tcp), \
2351 FN(sk_lookup_udp), \
Mauricio Vasquez Bf1a2e442018-10-18 15:16:25 +02002352 FN(sk_release), \
2353 FN(map_push_elem), \
2354 FN(map_pop_elem), \
John Fastabend6fff6072018-10-19 19:56:49 -07002355 FN(map_peek_elem), \
2356 FN(msg_push_data),
Thomas Grafebb676d2016-10-27 11:23:51 +02002357
Alexei Starovoitov09756af2014-09-26 00:17:00 -07002358/* integer value in 'imm' field of BPF_CALL instruction selects which helper
2359 * function eBPF program intends to call
2360 */
Thomas Grafebb676d2016-10-27 11:23:51 +02002361#define __BPF_ENUM_FN(x) BPF_FUNC_ ## x
Alexei Starovoitov09756af2014-09-26 00:17:00 -07002362enum bpf_func_id {
Thomas Grafebb676d2016-10-27 11:23:51 +02002363 __BPF_FUNC_MAPPER(__BPF_ENUM_FN)
Alexei Starovoitov09756af2014-09-26 00:17:00 -07002364 __BPF_FUNC_MAX_ID,
2365};
Thomas Grafebb676d2016-10-27 11:23:51 +02002366#undef __BPF_ENUM_FN
Alexei Starovoitov09756af2014-09-26 00:17:00 -07002367
Daniel Borkmann781c53b2016-01-11 01:16:38 +01002368/* All flags used by eBPF helper functions, placed here. */
2369
2370/* BPF_FUNC_skb_store_bytes flags. */
2371#define BPF_F_RECOMPUTE_CSUM (1ULL << 0)
Daniel Borkmann8afd54c2016-03-04 15:15:03 +01002372#define BPF_F_INVALIDATE_HASH (1ULL << 1)
Daniel Borkmann781c53b2016-01-11 01:16:38 +01002373
2374/* BPF_FUNC_l3_csum_replace and BPF_FUNC_l4_csum_replace flags.
2375 * First 4 bits are for passing the header field size.
2376 */
2377#define BPF_F_HDR_FIELD_MASK 0xfULL
2378
2379/* BPF_FUNC_l4_csum_replace flags. */
2380#define BPF_F_PSEUDO_HDR (1ULL << 4)
Daniel Borkmann2f729592016-02-19 23:05:26 +01002381#define BPF_F_MARK_MANGLED_0 (1ULL << 5)
Daniel Borkmannd1b662a2017-01-24 01:06:28 +01002382#define BPF_F_MARK_ENFORCE (1ULL << 6)
Daniel Borkmann781c53b2016-01-11 01:16:38 +01002383
2384/* BPF_FUNC_clone_redirect and BPF_FUNC_redirect flags. */
2385#define BPF_F_INGRESS (1ULL << 0)
2386
Daniel Borkmannc6c33452016-01-11 01:16:39 +01002387/* BPF_FUNC_skb_set_tunnel_key and BPF_FUNC_skb_get_tunnel_key flags. */
2388#define BPF_F_TUNINFO_IPV6 (1ULL << 0)
2389
Yonghong Songc195651e2018-04-28 22:28:08 -07002390/* flags for both BPF_FUNC_get_stackid and BPF_FUNC_get_stack. */
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -08002391#define BPF_F_SKIP_FIELD_MASK 0xffULL
2392#define BPF_F_USER_STACK (1ULL << 8)
Yonghong Songc195651e2018-04-28 22:28:08 -07002393/* flags used by BPF_FUNC_get_stackid only. */
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -08002394#define BPF_F_FAST_STACK_CMP (1ULL << 9)
2395#define BPF_F_REUSE_STACKID (1ULL << 10)
Yonghong Songc195651e2018-04-28 22:28:08 -07002396/* flags used by BPF_FUNC_get_stack only. */
2397#define BPF_F_USER_BUILD_ID (1ULL << 11)
Alexei Starovoitovd5a3b1f2016-02-17 19:58:58 -08002398
Daniel Borkmann2da897e2016-02-23 02:05:26 +01002399/* BPF_FUNC_skb_set_tunnel_key flags. */
2400#define BPF_F_ZERO_CSUM_TX (1ULL << 1)
Daniel Borkmann22080872016-03-04 15:15:05 +01002401#define BPF_F_DONT_FRAGMENT (1ULL << 2)
William Tu77a51962018-03-01 13:49:57 -08002402#define BPF_F_SEQ_NUMBER (1ULL << 3)
Daniel Borkmann2da897e2016-02-23 02:05:26 +01002403
Yonghong Song908432c2017-10-05 09:19:20 -07002404/* BPF_FUNC_perf_event_output, BPF_FUNC_perf_event_read and
2405 * BPF_FUNC_perf_event_read_value flags.
2406 */
Daniel Borkmann1e337592016-04-18 21:01:23 +02002407#define BPF_F_INDEX_MASK 0xffffffffULL
2408#define BPF_F_CURRENT_CPU BPF_F_INDEX_MASK
Daniel Borkmann555c8a82016-07-14 18:08:05 +02002409/* BPF_FUNC_perf_event_output for sk_buff input context. */
2410#define BPF_F_CTXLEN_MASK (0xfffffULL << 32)
Daniel Borkmann1e337592016-04-18 21:01:23 +02002411
Daniel Borkmann2be7e212017-07-02 02:13:26 +02002412/* Mode for BPF_FUNC_skb_adjust_room helper. */
2413enum bpf_adj_room_mode {
2414 BPF_ADJ_ROOM_NET,
2415};
2416
Daniel Borkmann4e1ec562018-05-04 01:08:15 +02002417/* Mode for BPF_FUNC_skb_load_bytes_relative helper. */
2418enum bpf_hdr_start_off {
2419 BPF_HDR_START_MAC,
2420 BPF_HDR_START_NET,
2421};
2422
Mathieu Xhonneuxfe94cc22018-05-20 14:58:14 +01002423/* Encapsulation type for BPF_FUNC_lwt_push_encap helper. */
2424enum bpf_lwt_encap_mode {
2425 BPF_LWT_ENCAP_SEG6,
2426 BPF_LWT_ENCAP_SEG6_INLINE
2427};
2428
Alexei Starovoitov9bac3d62015-03-13 11:57:42 -07002429/* user accessible mirror of in-kernel sk_buff.
2430 * new fields can only be added to the end of this structure
2431 */
2432struct __sk_buff {
2433 __u32 len;
2434 __u32 pkt_type;
2435 __u32 mark;
2436 __u32 queue_mapping;
Alexei Starovoitovc2497392015-03-16 18:06:02 -07002437 __u32 protocol;
2438 __u32 vlan_present;
2439 __u32 vlan_tci;
Michal Sekletar27cd5452015-03-24 14:48:41 +01002440 __u32 vlan_proto;
Daniel Borkmannbcad5712015-04-03 20:52:24 +02002441 __u32 priority;
Alexei Starovoitov37e82c22015-05-27 15:30:39 -07002442 __u32 ingress_ifindex;
2443 __u32 ifindex;
Alexei Starovoitovd691f9e2015-06-04 10:11:54 -07002444 __u32 tc_index;
2445 __u32 cb[5];
Daniel Borkmannba7591d2015-08-01 00:46:29 +02002446 __u32 hash;
Daniel Borkmann045efa82015-09-15 23:05:42 -07002447 __u32 tc_classid;
Alexei Starovoitov969bf052016-05-05 19:49:10 -07002448 __u32 data;
2449 __u32 data_end;
Daniel Borkmannb1d9fc42017-04-19 23:01:17 +02002450 __u32 napi_id;
John Fastabend8a31db52017-08-15 22:33:09 -07002451
Daniel Borkmannde8f3a82017-09-25 02:25:51 +02002452 /* Accessed by BPF_PROG_TYPE_sk_skb types from here to ... */
John Fastabend8a31db52017-08-15 22:33:09 -07002453 __u32 family;
2454 __u32 remote_ip4; /* Stored in network byte order */
2455 __u32 local_ip4; /* Stored in network byte order */
2456 __u32 remote_ip6[4]; /* Stored in network byte order */
2457 __u32 local_ip6[4]; /* Stored in network byte order */
2458 __u32 remote_port; /* Stored in network byte order */
2459 __u32 local_port; /* stored in host byte order */
Daniel Borkmannde8f3a82017-09-25 02:25:51 +02002460 /* ... here. */
2461
2462 __u32 data_meta;
Petar Penkovd58e4682018-09-14 07:46:18 -07002463 struct bpf_flow_keys *flow_keys;
Alexei Starovoitov9bac3d62015-03-13 11:57:42 -07002464};
2465
Alexei Starovoitovd3aa45c2015-07-30 15:36:57 -07002466struct bpf_tunnel_key {
2467 __u32 tunnel_id;
Daniel Borkmannc6c33452016-01-11 01:16:39 +01002468 union {
2469 __u32 remote_ipv4;
2470 __u32 remote_ipv6[4];
2471 };
2472 __u8 tunnel_tos;
2473 __u8 tunnel_ttl;
Daniel Borkmann1fbc2e02018-06-02 23:06:37 +02002474 __u16 tunnel_ext; /* Padding, future use. */
Daniel Borkmann4018ab12016-03-09 03:00:05 +01002475 __u32 tunnel_label;
Alexei Starovoitovd3aa45c2015-07-30 15:36:57 -07002476};
2477
Eyal Birger12bed762018-04-24 17:50:29 +03002478/* user accessible mirror of in-kernel xfrm_state.
2479 * new fields can only be added to the end of this structure
2480 */
2481struct bpf_xfrm_state {
2482 __u32 reqid;
2483 __u32 spi; /* Stored in network byte order */
2484 __u16 family;
Daniel Borkmann1fbc2e02018-06-02 23:06:37 +02002485 __u16 ext; /* Padding, future use. */
Eyal Birger12bed762018-04-24 17:50:29 +03002486 union {
2487 __u32 remote_ipv4; /* Stored in network byte order */
2488 __u32 remote_ipv6[4]; /* Stored in network byte order */
2489 };
2490};
2491
Thomas Graf3a0af8f2016-11-30 17:10:10 +01002492/* Generic BPF return codes which all BPF program types may support.
2493 * The values are binary compatible with their TC_ACT_* counter-part to
2494 * provide backwards compatibility with existing SCHED_CLS and SCHED_ACT
2495 * programs.
2496 *
2497 * XDP is handled seprately, see XDP_*.
2498 */
2499enum bpf_ret_code {
2500 BPF_OK = 0,
2501 /* 1 reserved */
2502 BPF_DROP = 2,
2503 /* 3-6 reserved */
2504 BPF_REDIRECT = 7,
2505 /* >127 are reserved for prog type specific return codes */
2506};
2507
David Ahern610236582016-12-01 08:48:04 -08002508struct bpf_sock {
2509 __u32 bound_dev_if;
David Ahernaa4c1032016-12-01 08:48:06 -08002510 __u32 family;
2511 __u32 type;
2512 __u32 protocol;
David Ahern482dca92017-08-31 15:05:44 -07002513 __u32 mark;
2514 __u32 priority;
Andrey Ignatovaac3fc32018-03-30 15:08:07 -07002515 __u32 src_ip4; /* Allows 1,2,4-byte read.
2516 * Stored in network byte order.
2517 */
2518 __u32 src_ip6[4]; /* Allows 1,2,4-byte read.
2519 * Stored in network byte order.
2520 */
2521 __u32 src_port; /* Allows 4-byte read.
2522 * Stored in host byte order
2523 */
David Ahern610236582016-12-01 08:48:04 -08002524};
2525
Joe Stringer6acc9b42018-10-02 13:35:36 -07002526struct bpf_sock_tuple {
2527 union {
2528 struct {
2529 __be32 saddr;
2530 __be32 daddr;
2531 __be16 sport;
2532 __be16 dport;
2533 } ipv4;
2534 struct {
2535 __be32 saddr[4];
2536 __be32 daddr[4];
2537 __be16 sport;
2538 __be16 dport;
2539 } ipv6;
2540 };
2541};
2542
Martin KaFai Lau17bedab2016-12-07 15:53:11 -08002543#define XDP_PACKET_HEADROOM 256
2544
Brenden Blanco6a773a12016-07-19 12:16:47 -07002545/* User return codes for XDP prog type.
2546 * A valid XDP program must return one of these defined values. All other
Daniel Borkmann9beb8be2017-09-09 01:40:35 +02002547 * return codes are reserved for future use. Unknown return codes will
2548 * result in packet drops and a warning via bpf_warn_invalid_xdp_action().
Brenden Blanco6a773a12016-07-19 12:16:47 -07002549 */
2550enum xdp_action {
2551 XDP_ABORTED = 0,
2552 XDP_DROP,
2553 XDP_PASS,
Brenden Blanco6ce96ca2016-07-19 12:16:53 -07002554 XDP_TX,
John Fastabend814abfa2017-07-17 09:27:07 -07002555 XDP_REDIRECT,
Brenden Blanco6a773a12016-07-19 12:16:47 -07002556};
2557
2558/* user accessible metadata for XDP packet hook
2559 * new fields must be added to the end of this structure
2560 */
2561struct xdp_md {
2562 __u32 data;
2563 __u32 data_end;
Daniel Borkmannde8f3a82017-09-25 02:25:51 +02002564 __u32 data_meta;
Jesper Dangaard Brouerdaaf24c2018-01-11 17:39:09 +01002565 /* Below access go through struct xdp_rxq_info */
Jesper Dangaard Brouer02dd3292018-01-03 11:26:14 +01002566 __u32 ingress_ifindex; /* rxq->dev->ifindex */
2567 __u32 rx_queue_index; /* rxq->queue_index */
Brenden Blanco6a773a12016-07-19 12:16:47 -07002568};
2569
John Fastabend174a79f2017-08-15 22:32:47 -07002570enum sk_action {
John Fastabendbfa640752017-10-27 09:45:53 -07002571 SK_DROP = 0,
2572 SK_PASS,
John Fastabend174a79f2017-08-15 22:32:47 -07002573};
2574
John Fastabend4f738ad2018-03-18 12:57:10 -07002575/* user accessible metadata for SK_MSG packet hook, new fields must
2576 * be added to the end of this structure
2577 */
2578struct sk_msg_md {
2579 void *data;
2580 void *data_end;
John Fastabend303def32018-05-17 14:16:58 -07002581
2582 __u32 family;
2583 __u32 remote_ip4; /* Stored in network byte order */
2584 __u32 local_ip4; /* Stored in network byte order */
2585 __u32 remote_ip6[4]; /* Stored in network byte order */
2586 __u32 local_ip6[4]; /* Stored in network byte order */
2587 __u32 remote_port; /* Stored in network byte order */
2588 __u32 local_port; /* stored in host byte order */
John Fastabend4f738ad2018-03-18 12:57:10 -07002589};
2590
Martin KaFai Lau2dbb9b92018-08-08 01:01:25 -07002591struct sk_reuseport_md {
2592 /*
2593 * Start of directly accessible data. It begins from
2594 * the tcp/udp header.
2595 */
2596 void *data;
2597 void *data_end; /* End of directly accessible data */
2598 /*
2599 * Total length of packet (starting from the tcp/udp header).
2600 * Note that the directly accessible bytes (data_end - data)
2601 * could be less than this "len". Those bytes could be
2602 * indirectly read by a helper "bpf_skb_load_bytes()".
2603 */
2604 __u32 len;
2605 /*
2606 * Eth protocol in the mac header (network byte order). e.g.
2607 * ETH_P_IP(0x0800) and ETH_P_IPV6(0x86DD)
2608 */
2609 __u32 eth_protocol;
2610 __u32 ip_protocol; /* IP protocol. e.g. IPPROTO_TCP, IPPROTO_UDP */
2611 __u32 bind_inany; /* Is sock bound to an INANY address? */
2612 __u32 hash; /* A hash of the packet 4 tuples */
2613};
2614
Martin KaFai Lau1e270972017-06-05 12:15:52 -07002615#define BPF_TAG_SIZE 8
2616
2617struct bpf_prog_info {
2618 __u32 type;
2619 __u32 id;
2620 __u8 tag[BPF_TAG_SIZE];
2621 __u32 jited_prog_len;
2622 __u32 xlated_prog_len;
2623 __aligned_u64 jited_prog_insns;
2624 __aligned_u64 xlated_prog_insns;
Martin KaFai Laucb4d2b32017-09-27 14:37:52 -07002625 __u64 load_time; /* ns since boottime */
2626 __u32 created_by_uid;
2627 __u32 nr_map_ids;
2628 __aligned_u64 map_ids;
Martin KaFai Lau067cae42017-10-05 21:52:12 -07002629 char name[BPF_OBJ_NAME_LEN];
Jakub Kicinski675fc272017-12-27 18:39:09 -08002630 __u32 ifindex;
Jiri Olsab85fab02018-04-25 19:41:06 +02002631 __u32 gpl_compatible:1;
Jakub Kicinski675fc272017-12-27 18:39:09 -08002632 __u64 netns_dev;
2633 __u64 netns_ino;
Sandipan Dasdbecd732018-05-24 12:26:48 +05302634 __u32 nr_jited_ksyms;
Sandipan Das815581c2018-05-24 12:26:52 +05302635 __u32 nr_jited_func_lens;
Sandipan Dasdbecd732018-05-24 12:26:48 +05302636 __aligned_u64 jited_ksyms;
Sandipan Das815581c2018-05-24 12:26:52 +05302637 __aligned_u64 jited_func_lens;
Martin KaFai Lau1e270972017-06-05 12:15:52 -07002638} __attribute__((aligned(8)));
2639
2640struct bpf_map_info {
2641 __u32 type;
2642 __u32 id;
2643 __u32 key_size;
2644 __u32 value_size;
2645 __u32 max_entries;
2646 __u32 map_flags;
Martin KaFai Lau067cae42017-10-05 21:52:12 -07002647 char name[BPF_OBJ_NAME_LEN];
Jakub Kicinski52775b32018-01-17 19:13:28 -08002648 __u32 ifindex;
Daniel Borkmann36f98142018-06-02 05:21:59 +02002649 __u32 :32;
Jakub Kicinski52775b32018-01-17 19:13:28 -08002650 __u64 netns_dev;
2651 __u64 netns_ino;
Martin KaFai Lau78958fc2018-05-04 14:49:51 -07002652 __u32 btf_id;
Martin KaFai Lau9b2cf322018-05-22 14:57:21 -07002653 __u32 btf_key_type_id;
2654 __u32 btf_value_type_id;
Martin KaFai Lau1e270972017-06-05 12:15:52 -07002655} __attribute__((aligned(8)));
2656
Martin KaFai Lau62dab842018-05-04 14:49:52 -07002657struct bpf_btf_info {
2658 __aligned_u64 btf;
2659 __u32 btf_size;
2660 __u32 id;
2661} __attribute__((aligned(8)));
2662
Andrey Ignatov4fbac772018-03-30 15:08:02 -07002663/* User bpf_sock_addr struct to access socket fields and sockaddr struct passed
2664 * by user and intended to be used by socket (e.g. to bind to, depends on
2665 * attach attach type).
2666 */
2667struct bpf_sock_addr {
2668 __u32 user_family; /* Allows 4-byte read, but no write. */
2669 __u32 user_ip4; /* Allows 1,2,4-byte read and 4-byte write.
2670 * Stored in network byte order.
2671 */
2672 __u32 user_ip6[4]; /* Allows 1,2,4-byte read an 4-byte write.
2673 * Stored in network byte order.
2674 */
2675 __u32 user_port; /* Allows 4-byte read and write.
2676 * Stored in network byte order
2677 */
2678 __u32 family; /* Allows 4-byte read, but no write */
2679 __u32 type; /* Allows 4-byte read, but no write */
2680 __u32 protocol; /* Allows 4-byte read, but no write */
Andrey Ignatov1cedee12018-05-25 08:55:23 -07002681 __u32 msg_src_ip4; /* Allows 1,2,4-byte read an 4-byte write.
2682 * Stored in network byte order.
2683 */
2684 __u32 msg_src_ip6[4]; /* Allows 1,2,4-byte read an 4-byte write.
2685 * Stored in network byte order.
2686 */
Andrey Ignatov4fbac772018-03-30 15:08:02 -07002687};
2688
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002689/* User bpf_sock_ops struct to access socket values and specify request ops
2690 * and their replies.
2691 * Some of this fields are in network (bigendian) byte order and may need
2692 * to be converted before use (bpf_ntohl() defined in samples/bpf/bpf_endian.h).
2693 * New fields can only be added at the end of this structure
2694 */
2695struct bpf_sock_ops {
2696 __u32 op;
2697 union {
Lawrence Brakmode525be2018-01-25 16:14:09 -08002698 __u32 args[4]; /* Optionally passed to bpf program */
2699 __u32 reply; /* Returned by bpf program */
2700 __u32 replylong[4]; /* Optionally returned by bpf prog */
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002701 };
2702 __u32 family;
2703 __u32 remote_ip4; /* Stored in network byte order */
2704 __u32 local_ip4; /* Stored in network byte order */
2705 __u32 remote_ip6[4]; /* Stored in network byte order */
2706 __u32 local_ip6[4]; /* Stored in network byte order */
2707 __u32 remote_port; /* Stored in network byte order */
2708 __u32 local_port; /* stored in host byte order */
Lawrence Brakmof19397a2017-12-01 10:15:04 -08002709 __u32 is_fullsock; /* Some TCP fields are only valid if
2710 * there is a full socket. If not, the
2711 * fields read as zero.
2712 */
2713 __u32 snd_cwnd;
2714 __u32 srtt_us; /* Averaged RTT << 3 in usecs */
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002715 __u32 bpf_sock_ops_cb_flags; /* flags defined in uapi/linux/tcp.h */
Lawrence Brakmo44f0e432018-01-25 16:14:12 -08002716 __u32 state;
2717 __u32 rtt_min;
2718 __u32 snd_ssthresh;
2719 __u32 rcv_nxt;
2720 __u32 snd_nxt;
2721 __u32 snd_una;
2722 __u32 mss_cache;
2723 __u32 ecn_flags;
2724 __u32 rate_delivered;
2725 __u32 rate_interval_us;
2726 __u32 packets_out;
2727 __u32 retrans_out;
2728 __u32 total_retrans;
2729 __u32 segs_in;
2730 __u32 data_segs_in;
2731 __u32 segs_out;
2732 __u32 data_segs_out;
2733 __u32 lost_out;
2734 __u32 sacked_out;
2735 __u32 sk_txhash;
2736 __u64 bytes_received;
2737 __u64 bytes_acked;
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002738};
2739
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002740/* Definitions for bpf_sock_ops_cb_flags */
Lawrence Brakmof89013f2018-01-25 16:14:11 -08002741#define BPF_SOCK_OPS_RTO_CB_FLAG (1<<0)
Lawrence Brakmoa31ad292018-01-25 16:14:14 -08002742#define BPF_SOCK_OPS_RETRANS_CB_FLAG (1<<1)
Lawrence Brakmod4487492018-01-25 16:14:15 -08002743#define BPF_SOCK_OPS_STATE_CB_FLAG (1<<2)
2744#define BPF_SOCK_OPS_ALL_CB_FLAGS 0x7 /* Mask of all currently
Lawrence Brakmob13d8802018-01-25 16:14:10 -08002745 * supported cb flags
2746 */
2747
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002748/* List of known BPF sock_ops operators.
2749 * New entries can only be added at the end
2750 */
2751enum {
2752 BPF_SOCK_OPS_VOID,
Lawrence Brakmo8550f322017-06-30 20:02:42 -07002753 BPF_SOCK_OPS_TIMEOUT_INIT, /* Should return SYN-RTO value to use or
2754 * -1 if default value should be used
2755 */
Lawrence Brakmo13d3b1e2017-06-30 20:02:44 -07002756 BPF_SOCK_OPS_RWND_INIT, /* Should return initial advertized
2757 * window (in packets) or -1 if default
2758 * value should be used
2759 */
Lawrence Brakmo9872a4b2017-06-30 20:02:47 -07002760 BPF_SOCK_OPS_TCP_CONNECT_CB, /* Calls BPF program right before an
2761 * active connection is initialized
2762 */
2763 BPF_SOCK_OPS_ACTIVE_ESTABLISHED_CB, /* Calls BPF program when an
2764 * active connection is
2765 * established
2766 */
2767 BPF_SOCK_OPS_PASSIVE_ESTABLISHED_CB, /* Calls BPF program when a
2768 * passive connection is
2769 * established
2770 */
Lawrence Brakmo91b5b212017-06-30 20:02:49 -07002771 BPF_SOCK_OPS_NEEDS_ECN, /* If connection's congestion control
2772 * needs ECN
2773 */
Lawrence Brakmoe6546ef2017-10-20 11:05:39 -07002774 BPF_SOCK_OPS_BASE_RTT, /* Get base RTT. The correct value is
2775 * based on the path and may be
2776 * dependent on the congestion control
2777 * algorithm. In general it indicates
2778 * a congestion threshold. RTTs above
2779 * this indicate congestion
2780 */
Lawrence Brakmof89013f2018-01-25 16:14:11 -08002781 BPF_SOCK_OPS_RTO_CB, /* Called when an RTO has triggered.
2782 * Arg1: value of icsk_retransmits
2783 * Arg2: value of icsk_rto
2784 * Arg3: whether RTO has expired
2785 */
Lawrence Brakmoa31ad292018-01-25 16:14:14 -08002786 BPF_SOCK_OPS_RETRANS_CB, /* Called when skb is retransmitted.
2787 * Arg1: sequence number of 1st byte
2788 * Arg2: # segments
2789 * Arg3: return value of
2790 * tcp_transmit_skb (0 => success)
2791 */
Lawrence Brakmod4487492018-01-25 16:14:15 -08002792 BPF_SOCK_OPS_STATE_CB, /* Called when TCP changes state.
2793 * Arg1: old_state
2794 * Arg2: new_state
2795 */
Andrey Ignatovf333ee02018-07-11 17:33:32 -07002796 BPF_SOCK_OPS_TCP_LISTEN_CB, /* Called on listen(2), right after
2797 * socket transition to LISTEN state.
2798 */
Lawrence Brakmod4487492018-01-25 16:14:15 -08002799};
2800
2801/* List of TCP states. There is a build check in net/ipv4/tcp.c to detect
2802 * changes between the TCP and BPF versions. Ideally this should never happen.
2803 * If it does, we need to add code to convert them before calling
2804 * the BPF sock_ops function.
2805 */
2806enum {
2807 BPF_TCP_ESTABLISHED = 1,
2808 BPF_TCP_SYN_SENT,
2809 BPF_TCP_SYN_RECV,
2810 BPF_TCP_FIN_WAIT1,
2811 BPF_TCP_FIN_WAIT2,
2812 BPF_TCP_TIME_WAIT,
2813 BPF_TCP_CLOSE,
2814 BPF_TCP_CLOSE_WAIT,
2815 BPF_TCP_LAST_ACK,
2816 BPF_TCP_LISTEN,
2817 BPF_TCP_CLOSING, /* Now a valid state */
2818 BPF_TCP_NEW_SYN_RECV,
2819
2820 BPF_TCP_MAX_STATES /* Leave at the end! */
Lawrence Brakmo40304b22017-06-30 20:02:40 -07002821};
2822
Lawrence Brakmofc747812017-06-30 20:02:51 -07002823#define TCP_BPF_IW 1001 /* Set TCP initial congestion window */
Lawrence Brakmo13bf9642017-06-30 20:02:53 -07002824#define TCP_BPF_SNDCWND_CLAMP 1002 /* Set sndcwnd_clamp */
Lawrence Brakmofc747812017-06-30 20:02:51 -07002825
Yonghong Song908432c2017-10-05 09:19:20 -07002826struct bpf_perf_event_value {
2827 __u64 counter;
2828 __u64 enabled;
2829 __u64 running;
2830};
2831
Roman Gushchinebc614f2017-11-05 08:15:32 -05002832#define BPF_DEVCG_ACC_MKNOD (1ULL << 0)
2833#define BPF_DEVCG_ACC_READ (1ULL << 1)
2834#define BPF_DEVCG_ACC_WRITE (1ULL << 2)
2835
2836#define BPF_DEVCG_DEV_BLOCK (1ULL << 0)
2837#define BPF_DEVCG_DEV_CHAR (1ULL << 1)
2838
2839struct bpf_cgroup_dev_ctx {
Yonghong Song06ef0cc2017-12-18 10:13:44 -08002840 /* access_type encoded as (BPF_DEVCG_ACC_* << 16) | BPF_DEVCG_DEV_* */
2841 __u32 access_type;
Roman Gushchinebc614f2017-11-05 08:15:32 -05002842 __u32 major;
2843 __u32 minor;
2844};
2845
Alexei Starovoitovc4f66992018-03-28 12:05:37 -07002846struct bpf_raw_tracepoint_args {
2847 __u64 args[0];
2848};
2849
David Ahern87f5fc72018-05-09 20:34:26 -07002850/* DIRECT: Skip the FIB rules and go to FIB table associated with device
2851 * OUTPUT: Do lookup from egress perspective; default is ingress
2852 */
2853#define BPF_FIB_LOOKUP_DIRECT BIT(0)
2854#define BPF_FIB_LOOKUP_OUTPUT BIT(1)
2855
David Ahern4c795792018-06-26 16:21:18 -07002856enum {
2857 BPF_FIB_LKUP_RET_SUCCESS, /* lookup successful */
2858 BPF_FIB_LKUP_RET_BLACKHOLE, /* dest is blackholed; can be dropped */
2859 BPF_FIB_LKUP_RET_UNREACHABLE, /* dest is unreachable; can be dropped */
2860 BPF_FIB_LKUP_RET_PROHIBIT, /* dest not allowed; can be dropped */
2861 BPF_FIB_LKUP_RET_NOT_FWDED, /* packet is not forwarded */
2862 BPF_FIB_LKUP_RET_FWD_DISABLED, /* fwding is not enabled on ingress */
2863 BPF_FIB_LKUP_RET_UNSUPP_LWT, /* fwd requires encapsulation */
2864 BPF_FIB_LKUP_RET_NO_NEIGH, /* no neighbor entry for nh */
2865 BPF_FIB_LKUP_RET_FRAG_NEEDED, /* fragmentation required to fwd */
2866};
2867
David Ahern87f5fc72018-05-09 20:34:26 -07002868struct bpf_fib_lookup {
David Ahernfa898d72018-05-29 10:58:07 -07002869 /* input: network family for lookup (AF_INET, AF_INET6)
2870 * output: network family of egress nexthop
2871 */
2872 __u8 family;
David Ahern87f5fc72018-05-09 20:34:26 -07002873
2874 /* set if lookup is to consider L4 data - e.g., FIB rules */
2875 __u8 l4_protocol;
2876 __be16 sport;
2877 __be16 dport;
2878
2879 /* total length of packet from network header - used for MTU check */
2880 __u16 tot_len;
David Ahern4c795792018-06-26 16:21:18 -07002881
2882 /* input: L3 device index for lookup
2883 * output: device index from FIB lookup
2884 */
2885 __u32 ifindex;
David Ahern87f5fc72018-05-09 20:34:26 -07002886
2887 union {
2888 /* inputs to lookup */
2889 __u8 tos; /* AF_INET */
David Ahernbd3a08a2018-06-03 08:15:19 -07002890 __be32 flowinfo; /* AF_INET6, flow_label + priority */
David Ahern87f5fc72018-05-09 20:34:26 -07002891
David Ahernfa898d72018-05-29 10:58:07 -07002892 /* output: metric of fib result (IPv4/IPv6 only) */
2893 __u32 rt_metric;
David Ahern87f5fc72018-05-09 20:34:26 -07002894 };
2895
2896 union {
David Ahern87f5fc72018-05-09 20:34:26 -07002897 __be32 ipv4_src;
2898 __u32 ipv6_src[4]; /* in6_addr; network order */
2899 };
2900
David Ahernfa898d72018-05-29 10:58:07 -07002901 /* input to bpf_fib_lookup, ipv{4,6}_dst is destination address in
2902 * network header. output: bpf_fib_lookup sets to gateway address
2903 * if FIB lookup returns gateway route
David Ahern87f5fc72018-05-09 20:34:26 -07002904 */
2905 union {
David Ahern87f5fc72018-05-09 20:34:26 -07002906 __be32 ipv4_dst;
2907 __u32 ipv6_dst[4]; /* in6_addr; network order */
2908 };
2909
2910 /* output */
2911 __be16 h_vlan_proto;
2912 __be16 h_vlan_TCI;
2913 __u8 smac[6]; /* ETH_ALEN */
2914 __u8 dmac[6]; /* ETH_ALEN */
2915};
2916
Yonghong Song41bdc4b2018-05-24 11:21:09 -07002917enum bpf_task_fd_type {
2918 BPF_FD_TYPE_RAW_TRACEPOINT, /* tp name */
2919 BPF_FD_TYPE_TRACEPOINT, /* tp name */
2920 BPF_FD_TYPE_KPROBE, /* (symbol + offset) or addr */
2921 BPF_FD_TYPE_KRETPROBE, /* (symbol + offset) or addr */
2922 BPF_FD_TYPE_UPROBE, /* filename + offset */
2923 BPF_FD_TYPE_URETPROBE, /* filename + offset */
2924};
2925
Petar Penkovd58e4682018-09-14 07:46:18 -07002926struct bpf_flow_keys {
2927 __u16 nhoff;
2928 __u16 thoff;
2929 __u16 addr_proto; /* ETH_P_* of valid addrs */
2930 __u8 is_frag;
2931 __u8 is_first_frag;
2932 __u8 is_encap;
2933 __u8 ip_proto;
2934 __be16 n_proto;
2935 __be16 sport;
2936 __be16 dport;
2937 union {
2938 struct {
2939 __be32 ipv4_src;
2940 __be32 ipv4_dst;
2941 };
2942 struct {
2943 __u32 ipv6_src[4]; /* in6_addr; network order */
2944 __u32 ipv6_dst[4]; /* in6_addr; network order */
2945 };
2946 };
2947};
2948
Alexei Starovoitovdaedfb22014-09-04 22:17:18 -07002949#endif /* _UAPI__LINUX_BPF_H__ */