selftests/bpf/bpf_experimental.h

16  *	The 'local_type_id' parameter must be a known constant.
17  *	The 'meta' parameter is rewritten by the verifier, no need for BPF
32  *	The 'meta' parameter is rewritten by the verifier, no need for BPF
44  *	non-owning reference input into an owning reference in the process.
46  *	The 'meta' parameter is rewritten by the verifier, no need for BPF
63  *	-EINVAL if the node wasn't added because it's already in a list
79  *	-EINVAL if the node wasn't added because it's already in a list
111  *	Add 'node' to rbtree with root 'root' using comparator 'less'
117  *	-EINVAL if the node wasn't added because it's already in a tree
120 			       bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
124 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0)  argument
139  *	The 'local_type_id' parameter must be a known constant.
140  *	The 'meta' parameter is rewritten by the verifier, no need for BPF
155  *	The 'meta' parameter is rewritten by the verifier, no need for BPF
175  *	execution and unwinding the stack. The supplied 'cookie' parameter
179  *	on the main program, the 'cookie' parameter will be the callback's only
253 	_Static_assert(sizeof(LHS) == 8, "Only 8-byte integers are supported\n");			 \
287 #define __is_signed_type(type) (((type)(-1)) < (type)1)
301  * Make sure BPF program is compiled with -Wsign-compare then
314 				/* "i" will truncate 64-bit constant into s32,			\
386 		      .long ((%l[l_break] - 1b - 8) / 8) & 0xffff;	\
399 		      .long ((%l[l_break] - 1b - 8) / 8) & 0xffff;	\
412 		      .long (((%l[l_break] - 1b - 8) / 8) & 0xffff) << 16;	\
425 		      .long (((%l[l_break] - 1b - 8) / 8) & 0xffff) << 16;	\