Optimize BPF tail calls for direct jumps
Subsystems (8)
Daniel Borkmann
maintainerv2 cover Optimize BPF tail calls for direct jumps
This gets rid of indirect jumps for BPF tail calls whenever possible. The series adds emission for *direct* jumps for tail call maps in order to avoid the retpoline overhead from a493a87f38cf ("bpf, x64: implement retpoline for tail call") for situations that allow for it, meaning, for known constant keys at verification time which are used as index into the tail call map. See patch 7/8 for more general details.
Thanks!
v1 -> v2:
- added more test cases
- u8 ip_stable -> bool (Andrii)
- removed bpf_map_poke_{un,}lock and simplified the code (Andrii)
- added break into prog_array_map_poke_untrack since there's just one prog (Andrii)
- fixed typo: for for in commit msg (Andrii)
- reworked __bpf_arch_text_poke (Andrii)
- added subtests, and comment on tests themselves, NULL-NULL transistion (Andrii)
- in constant map key tracking I've moved the map_poke_track callback to once we've finished creating the poke tab as otherwise concurrent access from tail call map would blow up (since we realloc the table)
rfc -> v1:
- Applied Alexei's and Andrii's feeback from
https://lore.kernel.org/bpf/[email protected]/T/#t
Daniel Borkmann (8):
bpf, x86: generalize and extend bpf_arch_text_poke for direct jumps
bpf: move bpf_free_used_maps into sleepable section
bpf: move owner type,jited info into array auxiliary data
bpf: add initial poke descriptor table for jit images
bpf: add poke dependency tracking for prog array maps
bpf: constant map key tracking for prog array pokes
bpf, x86: emit patchable direct jump as tail call
bpf, testing: add various tail call test cases
arch/x86/net/bpf_jit_comp.c | 264 +++++++--- include/linux/bpf.h | 60 ++- include/linux/bpf_verifier.h | 3 +- include/linux/filter.h | 10 + kernel/bpf/arraymap.c | 215 +++++++- kernel/bpf/core.c | 73 ++- kernel/bpf/map_in_map.c | 5 +- kernel/bpf/syscall.c | 56 +- kernel/bpf/verifier.c | 120 ++++- .../selftests/bpf/prog_tests/tailcalls.c | 487 ++++++++++++++++++ tools/testing/selftests/bpf/progs/tailcall1.c | 48 ++ tools/testing/selftests/bpf/progs/tailcall2.c | 59 +++ tools/testing/selftests/bpf/progs/tailcall3.c | 31 ++ tools/testing/selftests/bpf/progs/tailcall4.c | 33 ++ tools/testing/selftests/bpf/progs/tailcall5.c | 40 ++ 15 files changed, 1364 insertions(+), 140 deletions(-) create mode 100644 tools/testing/selftests/bpf/prog_tests/tailcalls.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall1.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall2.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall3.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall4.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall5.c
Signature · 1 line
2.21.0
Daniel Borkmann
maintainerPATCH v2 1/8 bpf, x86: generalize and extend bpf_arch_text_poke for direct jumps
Add BPF_MOD_{NOP_TO_JUMP,JUMP_TO_JUMP,JUMP_TO_NOP} patching for x86 JIT in order to be able to patch direct jumps or nop them out. We need this facility in order to patch tail call jumps and in later work also BPF static keys.
--- arch/x86/net/bpf_jit_comp.c | 64 ++++++++++++++++++++++++++----------- include/linux/bpf.h | 6 ++++ 2 files changed, 52 insertions(+), 18 deletions(-)
arch/x86/net/bpf_jit_comp.c +46 -18
@@ -203,8 +203,9 @@ struct jit_context {/* Maximum number of bytes emitted while JITing one eBPF insn */ #define BPF_MAX_INSN_SIZE 128#define BPF_INSN_SAFETY 64 -/* number of bytes emit_call() needs to generate call instruction */ -#define X86_CALL_SIZE 5 + +/* Number of bytes emit_patch() needs to generate instructions */ +#define X86_PATCH_SIZE 5#define PROLOGUE_SIZE 25
@@ -215,7 +216,7 @@ struct jit_context {static void emit_prologue (u8 **pprog,u32 stack_depth,bool ebpf_from_cbpf) {u8 *prog = *pprog; -int cnt =X86_CALL_SIZE ; +int cnt =X86_PATCH_SIZE ;/* BPF trampoline can be made to work without these nops, * but let's waste 5 bytes for now and optimize later
@@ -480,64 +481,91 @@ static void emit_stx(u8 **pprog, u32 size, u32 dst_reg, u32 src_reg, int off) *pprog = prog; } -static int emit_call (u8 **pprog,void *func,void *ip) +static int emit_patch (u8 **pprog,void *func,void *ip,u8 opcode) {u8 *prog = *pprog;int cnt =0 ;s64 offset; - offset = func - (ip +X86_CALL_SIZE ); + offset = func - (ip +X86_PATCH_SIZE );if (!is_simm32 (offset)) {pr_err ("Target call %p is out of range\n" , func);return -EINVAL ; } -EMIT1_off32 (0xE8 , offset); +EMIT1_off32 (opcode, offset); *pprog = prog;return 0 ; } +static int emit_call (u8 **pprog,void *func,void *ip) +{ +return emit_patch (pprog, func, ip,0xE8 ); +} + +static int emit_jump (u8 **pprog,void *func,void *ip) +{ +return emit_patch (pprog, func, ip,0xE9 ); +} +int bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t,void *old_addr,void *new_addr) { -u8 old_insn[X86_CALL_SIZE ] = {}; -u8 new_insn[X86_CALL_SIZE ] = {}; +int (*emit_patch_fn)(u8 **pprog,void *func,void *ip); +u8 old_insn[X86_PATCH_SIZE ] = {}; +u8 new_insn[X86_PATCH_SIZE ] = {};u8 *prog;int ret;if (!is_kernel_text ((long )ip) && !is_bpf_text_address ((long )ip)) -/* BPF trampoline in modules is not supported */ +/* BPF poking in modules is not supported */ return -EINVAL ; +switch (t) { + case BPF_MOD_NOP_TO_CALL ... BPF_MOD_CALL_TO_NOP: + emit_patch_fn = emit_call; +break ; + case BPF_MOD_NOP_TO_JUMP ... BPF_MOD_JUMP_TO_NOP: + emit_patch_fn = emit_jump; +break ; +default : +return -ENOTSUPP ; + } +if (old_addr) { prog = old_insn; - ret =emit_call (&prog, old_addr, (void *)ip); + ret =emit_patch_fn (&prog, old_addr, (void *)ip);if (ret)return ret; }if (new_addr) { prog = new_insn; - ret =emit_call (&prog, new_addr, (void *)ip); + ret =emit_patch_fn (&prog, new_addr, (void *)ip);if (ret)return ret; } + ret = -EBUSY ;mutex_lock (&text_mutex);switch (t) {case BPF_MOD_NOP_TO_CALL : -if (memcmp (ip, ideal_nops[NOP_ATOMIC5 ],X86_CALL_SIZE )) +case BPF_MOD_NOP_TO_JUMP : +if (memcmp (ip, ideal_nops[NOP_ATOMIC5 ],X86_PATCH_SIZE )) goto out; -text_poke_bp (ip, new_insn,X86_CALL_SIZE ,NULL ); +text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL );break ;case BPF_MOD_CALL_TO_CALL : -if (memcmp (ip, old_insn,X86_CALL_SIZE )) +case BPF_MOD_JUMP_TO_JUMP : +if (memcmp (ip, old_insn,X86_PATCH_SIZE )) goto out; -text_poke_bp (ip, new_insn,X86_CALL_SIZE ,NULL ); +text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL );break ;case BPF_MOD_CALL_TO_NOP : -if (memcmp (ip, old_insn,X86_CALL_SIZE )) +case BPF_MOD_JUMP_TO_NOP : +if (memcmp (ip, old_insn,X86_PATCH_SIZE )) goto out; -text_poke_bp (ip, ideal_nops[NOP_ATOMIC5 ],X86_CALL_SIZE ,NULL ); +text_poke_bp (ip, ideal_nops[NOP_ATOMIC5 ],X86_PATCH_SIZE , +NULL );break ; } ret =0 ;
@@ -1394,7 +1422,7 @@ int arch_prepare_bpf_trampoline(void *image, struct btf_func_model *m, u32 flags/* skip patched call instruction and point orig_call to actual * body of the kernel function. */ - orig_call +=X86_CALL_SIZE ; + orig_call +=X86_PATCH_SIZE ; prog = image;
include/linux/bpf.h +6 -0
@@ -1284,10 +1284,16 @@ static inline u32 bpf_xdp_sock_convert_ctx_access(enum bpf_access_type type,#endif /* CONFIG_INET */ enum bpf_text_poke_type { +/* All call-related pokes. */ BPF_MOD_NOP_TO_CALL ,BPF_MOD_CALL_TO_CALL ,BPF_MOD_CALL_TO_NOP , +/* All jump-related pokes. */ +BPF_MOD_NOP_TO_JUMP , +BPF_MOD_JUMP_TO_JUMP , +BPF_MOD_JUMP_TO_NOP , }; +int bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t,void *addr1,void *addr2);
Signature · 1 line
2.21.0
Daniel Borkmann
maintainerPATCH v2 2/8 bpf: move bpf_free_used_maps into sleepable section
In reply to Daniel BorkmannWe later on are going to need a sleepable context as opposed to plain RCU callback in order to untrack programs we need to poke at runtime and tracking as well as image update is performed under mutex.
--- include/linux/bpf.h | 4 ++++ kernel/bpf/core.c | 23 +++++++++++++++++++++++ kernel/bpf/syscall.c | 20 -------------------- 3 files changed, 27 insertions(+), 20 deletions(-)
include/linux/bpf.h +4 -0
@@ -1031,6 +1031,10 @@ static inline int bpf_prog_test_run_flow_dissector(struct bpf_prog *prog, {return -ENOTSUPP ; } + +static inline void bpf_map_put (struct bpf_map *map) +{ +}#endif /* CONFIG_BPF_SYSCALL */ static inline struct bpf_prog *bpf_prog_get_type(u32 ufd,
kernel/bpf/core.c +23 -0
@@ -2003,12 +2003,35 @@ int bpf_prog_array_copy_info(struct bpf_prog_array *array, : 0; } +static void bpf_free_cgroup_storage (struct bpf_prog_aux *aux) +{ +enum bpf_cgroup_storage_type stype; + +for_each_cgroup_storage_type (stype) { +if (!aux->cgroup_storage[stype]) +continue ; +bpf_cgroup_storage_release (aux->prog, + aux->cgroup_storage[stype]); + } +} + +static void bpf_free_used_maps (struct bpf_prog_aux *aux) +{ +int i; + +bpf_free_cgroup_storage (aux); +for (i =0 ; i < aux->used_map_cnt; i++) +bpf_map_put (aux->used_maps[i]); +kfree (aux->used_maps); +} +static void bpf_prog_free_deferred (struct work_struct *work) {struct bpf_prog_aux *aux;int i; aux = container_of(work, struct bpf_prog_aux, work); +bpf_free_used_maps (aux);if (bpf_prog_is_dev_bound (aux))bpf_prog_offload_destroy (aux->prog);#ifdef CONFIG_PERF_EVENTS
kernel/bpf/syscall.c +0 -20
@@ -1303,25 +1303,6 @@ static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)return 0 ; } -/* drop refcnt on maps used by eBPF program and free auxilary data */ -static void free_used_maps (struct bpf_prog_aux *aux) -{ -enum bpf_cgroup_storage_type stype; -int i; - -for_each_cgroup_storage_type (stype) { -if (!aux->cgroup_storage[stype]) -continue ; -bpf_cgroup_storage_release (aux->prog, - aux->cgroup_storage[stype]); - } - -for (i =0 ; i < aux->used_map_cnt; i++) -bpf_map_put (aux->used_maps[i]); - -kfree (aux->used_maps); -} -enum bpf_event {BPF_EVENT_LOAD ,BPF_EVENT_UNLOAD ,
@@ -1444,7 +1425,6 @@ static void __bpf_prog_put_rcu(struct rcu_head *rcu)kvfree (aux->func_info);kfree (aux->func_info_aux); -free_used_maps (aux);bpf_prog_uncharge_memlock (aux->prog);security_bpf_prog_free (aux);bpf_prog_free (aux->prog);
Signature · 1 line
2.21.0
Daniel Borkmann
maintainerPATCH v2 3/8 bpf: move owner type,jited info into array auxiliary data
In reply to Daniel BorkmannWe're going to extend this with further information which is only relevant for prog array at this point. Given this info is not used in critical path, move it into its own structure such that the main array map structure can be kept on diet.
--- include/linux/bpf.h | 18 +++++++++++------- kernel/bpf/arraymap.c | 32 ++++++++++++++++++++++++++++++-- kernel/bpf/core.c | 11 +++++------ kernel/bpf/map_in_map.c | 5 ++--- kernel/bpf/syscall.c | 16 ++++++---------- 5 files changed, 54 insertions(+), 28 deletions(-)
include/linux/bpf.h +11 -7
@@ -560,17 +560,21 @@ struct bpf_prog_aux { }; }; +struct bpf_array_aux { +/* 'Ownership' of prog array is claimed by the first program that +* is going to use this map or by the first program which FD is +* stored in the map to make sure that all callers and callees have +* the same prog type and JITed flag. +*/ +enum bpf_prog_type type; +bool jited; +}; +struct bpf_array {struct bpf_map map;u32 elem_size;u32 index_mask; -/* 'ownership' of prog_array is claimed by the first program that -* is going to use this map or by the first program which FD is stored -* in the map to make sure that all callers and callees have the same -* prog_type and JITed flag -*/ -enum bpf_prog_type owner_prog_type; -bool owner_jited; +struct bpf_array_aux *aux;union {char value[0 ]__aligned(8) ;void *ptrs[0 ]__aligned(8) ;
kernel/bpf/arraymap.c +30 -2
@@ -671,10 +671,38 @@ static void prog_array_map_seq_show_elem(struct bpf_map *map, void *key,rcu_read_unlock (); } +static struct bpf_map *prog_array_map_alloc (union bpf_attr *attr) +{ +struct bpf_array_aux *aux; +struct bpf_map *map; + + aux =kzalloc (sizeof (*aux),GFP_KERNEL ); +if (!aux) +return ERR_PTR (-ENOMEM ); + + map =array_map_alloc (attr); +if (IS_ERR (map)) { +kfree (aux); +return map; + } + + container_of(map, struct bpf_array, map)->aux = aux; +return map; +} + +static void prog_array_map_free (struct bpf_map *map) +{ +struct bpf_array_aux *aux; + + aux = container_of(map, struct bpf_array, map)->aux; +kfree (aux); +fd_array_map_free (map); +} +const struct bpf_map_ops prog_array_map_ops = { .map_alloc_check = fd_array_map_alloc_check, - .map_alloc = array_map_alloc, - .map_free = fd_array_map_free, + .map_alloc = prog_array_map_alloc, + .map_free = prog_array_map_free, .map_get_next_key = array_map_get_next_key, .map_lookup_elem = fd_array_map_lookup_elem, .map_delete_elem = fd_array_map_delete_elem,
kernel/bpf/core.c +5 -6
@@ -1691,18 +1691,17 @@ bool bpf_prog_array_compatible(struct bpf_array *array,if (fp->kprobe_override)return false; -if (!array->owner_prog_type) { +if (!array->aux->type) {/* There's no owner yet where we could check for * compatibility. */ - array->owner_prog_type = fp->type; - array->owner_jited = fp->jited; - + array->aux->type = fp->type; + array->aux->jited = fp->jited;return true; } -return array->owner_prog_type == fp->type && - array->owner_jited == fp->jited; +return array->aux->type == fp->type && + array->aux->jited == fp->jited; }static int bpf_check_tail_call (const struct bpf_prog *fp)
kernel/bpf/map_in_map.c +2 -3
@@ -17,9 +17,8 @@ struct bpf_map *bpf_map_meta_alloc(int inner_map_ufd)if (IS_ERR (inner_map))return inner_map; -/* prog_array->owner_prog_type and owner_jited -* is a runtime binding. Doing static check alone -* in the verifier is not enough. +/* prog_array->aux->{type,jited} is a runtime binding. +* Doing static check alone in the verifier is not enough. */ if (inner_map->map_type == BPF_MAP_TYPE_PROG_ARRAY || inner_map->map_type == BPF_MAP_TYPE_CGROUP_STORAGE ||
kernel/bpf/syscall.c +6 -10
@@ -390,13 +390,12 @@ static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp) {const struct bpf_map *map = filp->private_data;const struct bpf_array *array; -u32 owner_prog_type =0 ; -u32 owner_jited =0 ; +u32 type =0 , jited =0 ;if (map->map_type ==BPF_MAP_TYPE_PROG_ARRAY ) { array = container_of(map, struct bpf_array, map); - owner_prog_type = array->owner_prog_type; - owner_jited = array->owner_jited; + type = array->aux->type; + jited = array->aux->jited; } seq_printf(m,
@@ -416,12 +415,9 @@ static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp) map->memory.pages *1ULL <<PAGE_SHIFT , map->id, READ_ONCE(map->frozen)); - -if (owner_prog_type) { -seq_printf (m,"owner_prog_type:\t%u\n" , - owner_prog_type); -seq_printf (m,"owner_jited:\t%u\n" , - owner_jited); +if (type) { +seq_printf (m,"owner_prog_type:\t%u\n" , type); +seq_printf (m,"owner_jited:\t%u\n" , jited); } }#endif
Signature · 1 line
2.21.0
Daniel Borkmann
maintainerPATCH v2 4/8 bpf: add initial poke descriptor table for jit images
In reply to Daniel BorkmannAdd initial poke table data structures and management to the BPF prog that can later be used by JITs. Also add an instance of poke specific data for tail call maps; plan for later work is to extend this also for BPF static keys.
--- include/linux/bpf.h | 20 ++++++++++++++++++++ include/linux/filter.h | 10 ++++++++++ kernel/bpf/core.c | 34 ++++++++++++++++++++++++++++++++++ 3 files changed, 64 insertions(+)
include/linux/bpf.h +20 -0
@@ -488,6 +488,24 @@ struct bpf_func_info_aux {bool unreliable; }; +enum bpf_jit_poke_reason { +BPF_POKE_REASON_TAIL_CALL , +}; + +/* Descriptor of pokes pointing /into/ the JITed image. */ +struct bpf_jit_poke_descriptor { +void *ip; +union { +struct { +struct bpf_map *map; +u32 key; + } tail_call; + }; +bool ip_stable; +u8 adj_off; +u16 reason; +}; +struct bpf_prog_aux {atomic64_t refcnt;u32 used_map_cnt;
@@ -513,6 +531,8 @@ struct bpf_prog_aux {const char *attach_func_name;struct bpf_prog **func;void *jit_data;/* JIT specific data. arch dependent */ +struct bpf_jit_poke_descriptor *poke_tab; +u32 size_poke_tab;struct latch_tree_node ksym_tnode;struct list_head ksym_lnode;const struct bpf_prog_ops *ops;
include/linux/filter.h +10 -0
@@ -952,6 +952,9 @@ void *bpf_jit_alloc_exec(unsigned long size);void bpf_jit_free_exec (void *addr);void bpf_jit_free (struct bpf_prog *fp); +int bpf_jit_add_poke_descriptor (struct bpf_prog *prog, +struct bpf_jit_poke_descriptor *poke); +int bpf_jit_get_func_addr (const struct bpf_prog *prog,const struct bpf_insn *insn,bool extra_pass,u64 *func_addr,bool *func_addr_fixed);
@@ -1055,6 +1058,13 @@ static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)return false; } +static inline int +bpf_jit_add_poke_descriptor (struct bpf_prog *prog, +struct bpf_jit_poke_descriptor *poke) +{ +return -ENOTSUPP ; +} +static inline void bpf_jit_free (struct bpf_prog *fp) {bpf_prog_unlock_free (fp);
kernel/bpf/core.c +34 -0
@@ -256,6 +256,7 @@ void __bpf_prog_free(struct bpf_prog *fp) {if (fp->aux) {free_percpu (fp->aux->stats); +kfree (fp->aux->poke_tab);kfree (fp->aux); }vfree (fp);
@@ -756,6 +757,39 @@ int bpf_get_kallsym(unsigned int symnum, unsigned long *value, char *type,return ret; } +int bpf_jit_add_poke_descriptor (struct bpf_prog *prog, +struct bpf_jit_poke_descriptor *poke) +{ +struct bpf_jit_poke_descriptor *tab = prog->aux->poke_tab; +static const u32 poke_tab_max =1024 ; +u32 slot = prog->aux->size_poke_tab; +u32 size = slot +1 ; + +if (size > poke_tab_max) +return -ENOSPC ; +if (poke->ip || poke->ip_stable || poke->adj_off) +return -EINVAL ; + +switch (poke->reason) { +case BPF_POKE_REASON_TAIL_CALL : +if (!poke->tail_call.map) +return -EINVAL ; +break ; +default : +return -EINVAL ; + } + + tab =krealloc (tab, size *sizeof (*poke),GFP_KERNEL ); +if (!tab) +return -ENOMEM ; + +memcpy (&tab[slot], poke,sizeof (*poke)); + prog->aux->size_poke_tab = size; + prog->aux->poke_tab = tab; + +return slot; +} +static atomic_long_t bpf_jit_current;/* Can be overridden by an arch's JIT compiler if it has a custom,
Signature · 1 line
2.21.0
Daniel Borkmann
maintainerPATCH v2 5/8 bpf: add poke dependency tracking for prog array maps
In reply to Daniel BorkmannThis work adds program tracking to prog array maps. This is needed such that upon prog array updates/deletions we can fix up all programs which make use of this tail call map. We add ops->map_poke_{un,}track() helpers to maps to maintain the list of programs and ops->map_poke_run() for triggering the actual update.
bpf_array_aux is extended to contain the list head and poke_mutex in order to serialize program patching during updates/deletions. bpf_free_used_maps() will untrack the program shortly before dropping the reference to the map. For clearing out the prog array once all urefs are dropped we need to use schedule_work() to have a sleepable context.
The prog_array_map_poke_run() is triggered during updates/deletions and walks the maintained prog list. It checks in their poke_tabs whether the map and key is matching and runs the actual bpf_arch_text_poke() for patching in the nop or new jmp location. Depending on the type of update, we use one of BPF_MOD_{NOP_TO_JUMP,JUMP_TO_NOP,JUMP_TO_JUMP}.
--- include/linux/bpf.h | 12 +++ kernel/bpf/arraymap.c | 183 +++++++++++++++++++++++++++++++++++++++++- kernel/bpf/core.c | 9 ++- kernel/bpf/syscall.c | 20 +++-- 4 files changed, 212 insertions(+), 12 deletions(-)
include/linux/bpf.h +12 -0
@@ -22,6 +22,7 @@ struct bpf_verifier_env;struct bpf_verifier_log ;struct perf_event ;struct bpf_prog ; +struct bpf_prog_aux ;struct bpf_map ;struct sock ;struct seq_file ;
@@ -64,6 +65,12 @@ struct bpf_map_ops {const struct btf_type *key_type, const struct btf_type *value_type); +/* Prog poke tracking helpers. */ +int (*map_poke_track)(struct bpf_map *map,struct bpf_prog_aux *aux); +void (*map_poke_untrack)(struct bpf_map *map,struct bpf_prog_aux *aux); +void (*map_poke_run)(struct bpf_map *map,u32 key,struct bpf_prog *old, +struct bpf_prog *new); +/* Direct value access helpers. */ int (*map_direct_value_addr)(const struct bpf_map *map,u64 *imm,u32 off);
@@ -588,6 +595,11 @@ struct bpf_array_aux {*/ enum bpf_prog_type type;bool jited; +/* Programs with direct jumps into programs part of this array. */ +struct list_head poke_progs; +struct bpf_map *map; +struct mutex poke_mutex; +struct work_struct work; };struct bpf_array {
kernel/bpf/arraymap.c +179 -4
235 lines not on this page · raw message
kernel/bpf/core.c +7 -2
@@ -2050,11 +2050,16 @@ static void bpf_free_cgroup_storage(struct bpf_prog_aux *aux)static void bpf_free_used_maps (struct bpf_prog_aux *aux) { +struct bpf_map *map;int i;bpf_free_cgroup_storage (aux); -for (i =0 ; i < aux->used_map_cnt; i++) -bpf_map_put (aux->used_maps[i]); +for (i =0 ; i < aux->used_map_cnt; i++) { + map = aux->used_maps[i]; +if (map->ops->map_poke_untrack) + map->ops->map_poke_untrack (map, aux); +bpf_map_put (map); + }kfree (aux->used_maps); }
kernel/bpf/syscall.c +14 -6
@@ -26,12 +26,13 @@#include <linux/audit.h> #include <uapi/linux/btf.h> -#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_PROG_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)#define IS_FD_HASH (map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) -#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_HASH(map)) +#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \ + IS_FD_HASH(map))#define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
@@ -878,7 +879,7 @@ static int map_lookup_elem(union bpf_attr *attr) err =bpf_percpu_cgroup_storage_copy (map, key, value); }else if (map->map_type ==BPF_MAP_TYPE_STACK_TRACE ) { err =bpf_stackmap_copy (map, key, value); - }else if (IS_FD_ARRAY (map)) { + }else if (IS_FD_ARRAY (map) ||IS_FD_PROG_ARRAY (map)) { err =bpf_fd_array_map_lookup_elem (map, key, value); }else if (IS_FD_HASH (map)) { err =bpf_fd_htab_map_lookup_elem (map, key, value);
@@ -1005,6 +1006,10 @@ static int map_update_elem(union bpf_attr *attr) map->map_type == BPF_MAP_TYPE_SOCKMAP) { err = map->ops->map_update_elem (map, key, value, attr->flags); goto out; + } else if (IS_FD_PROG_ARRAY(map)) { + err =bpf_fd_array_map_update_elem (map, f.file, key, value, + attr->flags); + goto out; }/* must increment bpf_prog_active to avoid kprobe+bpf triggering from
@@ -1087,6 +1092,9 @@ static int map_delete_elem(union bpf_attr *attr)if (bpf_map_is_dev_bound (map)) { err =bpf_map_offload_delete_elem (map, key); goto out; + }else if (IS_FD_PROG_ARRAY (map)) { + err = map->ops->map_delete_elem (map, key); + goto out; }preempt_disable ();
Signature · 1 line
2.21.0
Re: [PATCH bpf-next v2 5/8] bpf: add poke dependency tracking for prog array maps
Quoted 27 lines · Daniel Borkmann
This work adds program tracking to prog array maps. This is needed such that upon prog array updates/deletions we can fix up all programs which make use of this tail call map. We add ops->map_poke_{un,}track() helpers to maps to maintain the list of programs and
ops->map_poke_run()for triggering the actual update.
bpf_array_auxis extended to contain the list head andpoke_mutexin order to serialize program patching during updates/deletions.bpf_free_used_maps()will untrack the program shortly before dropping the reference to the map. For clearing out the prog array once all urefs are dropped we need to useschedule_work()to have a sleepable context.The
prog_array_map_poke_run()is triggered during updates/deletions and walks the maintained prog list. It checks in theirpoke_tabswhether the map and key is matching and runs the actualbpf_arch_text_poke()for patching in the nop or new jmp location. Depending on the type of update, we use one of BPF_MOD_{NOP_TO_JUMP,JUMP_TO_NOP,JUMP_TO_JUMP}.Signed-off-by Daniel Borkmann <[email protected]>--- include/linux/bpf.h | 12 +++ kernel/bpf/arraymap.c | 183 +++++++++++++++++++++++++++++++++++++++++- kernel/bpf/core.c | 9 ++- kernel/bpf/syscall.c | 20 +++-- 4 files changed, 212 insertions(+), 12 deletions(-)
[...]
Quoted 24 lines
kernel/bpf/syscall.c +6
-5@@ -26,12 +26,13 @@#include <linux/audit.h> #include <uapi/linux/btf.h> -#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_PROG_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)#define IS_FD_HASH (map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) -#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_HASH(map)) +#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \ + IS_FD_HASH(map))#define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
kernel/bpf/syscall.c static int map_lookup_elem(union bpf_attr *attr) · line 882
Quoted 5 lines
kernel/bpf/syscall.c +1
-1@@ -878,7 +879,7 @@ static int map_lookup_elem(union bpf_attr *attr) err =bpf_percpu_cgroup_storage_copy (map, key, value); }else if (map->map_type ==BPF_MAP_TYPE_STACK_TRACE ) { err =bpf_stackmap_copy (map, key, value); - }else if (IS_FD_ARRAY (map)) { + }else if (IS_FD_ARRAY (map) ||IS_FD_PROG_ARRAY (map)) {
Why BPF_MAP_TYPE_PROG_ARRAY couldn't still stay as "IS_FD_ARRAY"? Seems like it's still handled the same here and is technically an array containing FDs, no? You can still have more precise IS_FD_PROG_ARRAY, for cases like in map_update_elem(), where you need to special-handle just that map type.
Quoted 15 lines
kernel/bpf/syscall.c +4
-0err =bpf_fd_array_map_lookup_elem (map, key, value); }else if (IS_FD_HASH (map)) { err =bpf_fd_htab_map_lookup_elem (map, key, value);@@ -1005,6 +1006,10 @@ static int map_update_elem(union bpf_attr *attr) map->map_type == BPF_MAP_TYPE_SOCKMAP) { err = map->ops->map_update_elem (map, key, value, attr->flags); goto out; + } else if (IS_FD_PROG_ARRAY(map)) { + err =bpf_fd_array_map_update_elem (map, f.file, key, value, + attr->flags); + goto out; }/* must increment bpf_prog_active to avoid kprobe+bpf triggering from
kernel/bpf/syscall.c static int map_delete_elem(union bpf_attr *attr) · line 1096
Quoted 5 lines
kernel/bpf/syscall.c +2
-0@@ -1087,6 +1092,9 @@ static int map_delete_elem(union bpf_attr *attr)if (bpf_map_is_dev_bound (map)) { err =bpf_map_offload_delete_elem (map, key); goto out; + }else if (IS_FD_PROG_ARRAY (map)) { + err = map->ops->map_delete_elem (map, key);
map->ops->map_delete_elem would be called below anyways, except under rcu_read_lock() with preempt_disable() (maybe_wait_bpf_programs() is no-op for prog_array). So if there is specific reason we want to avoid preempt_disable and rcu_read_lock(), would be nice to have a comment explaining that.
Quoted 7 lines
kernel/bpf/syscall.c +1
-1+ goto out; }preempt_disable (); --2.21.0
Daniel Borkmann
maintainerRe: [PATCH bpf-next v2 5/8] bpf: add poke dependency tracking for prog array maps
Quoted 54 lines · Andrii Nakryiko
Quoted 27 lines · Daniel Borkmann
This work adds program tracking to prog array maps. This is needed such that upon prog array updates/deletions we can fix up all programs which make use of this tail call map. We add ops->map_poke_{un,}track() helpers to maps to maintain the list of programs and
ops->map_poke_run()for triggering the actual update.
bpf_array_auxis extended to contain the list head andpoke_mutexin order to serialize program patching during updates/deletions.bpf_free_used_maps()will untrack the program shortly before dropping the reference to the map. For clearing out the prog array once all urefs are dropped we need to useschedule_work()to have a sleepable context.The
prog_array_map_poke_run()is triggered during updates/deletions and walks the maintained prog list. It checks in theirpoke_tabswhether the map and key is matching and runs the actualbpf_arch_text_poke()for patching in the nop or new jmp location. Depending on the type of update, we use one of BPF_MOD_{NOP_TO_JUMP,JUMP_TO_NOP,JUMP_TO_JUMP}.Signed-off-by Daniel Borkmann <[email protected]>--- include/linux/bpf.h | 12 +++ kernel/bpf/arraymap.c | 183 +++++++++++++++++++++++++++++++++++++++++- kernel/bpf/core.c | 9 ++- kernel/bpf/syscall.c | 20 +++-- 4 files changed, 212 insertions(+), 12 deletions(-)[...]
Quoted 23 lines
kernel/bpf/syscall.c +6
-5@@ -26,12 +26,13 @@#include <linux/audit.h> #include <uapi/linux/btf.h> -#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_PROG_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)#define IS_FD_HASH (map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) -#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_HASH(map)) +#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \ + IS_FD_HASH(map))#define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
Quoted 10 lines
kernel/bpf/syscall.c static int map_lookup_elem(union bpf_attr *attr) · line 882
Quoted 6 lines
kernel/bpf/syscall.c +1
-1@@ -878,7 +879,7 @@ static int map_lookup_elem(union bpf_attr *attr) err =bpf_percpu_cgroup_storage_copy (map, key, value); }else if (map->map_type ==BPF_MAP_TYPE_STACK_TRACE ) { err =bpf_stackmap_copy (map, key, value); - }else if (IS_FD_ARRAY (map)) { + }else if (IS_FD_ARRAY (map) ||IS_FD_PROG_ARRAY (map)) {Why
BPF_MAP_TYPE_PROG_ARRAYcouldn't still stay as "IS_FD_ARRAY"? Seems like it's still handled the same here and is technically an array containing FDs, no? You can still have more precise
For the update and delete method we need to hold the mutex in prog array which is why we cannot be under RCU there. For the lookup itself it can stay as-is since it's not a modification hence the or above.
Quoted 16 lines
IS_FD_PROG_ARRAY, for cases like inmap_update_elem(), where you need to special-handle just that map type.Quoted 13 lines
kernel/bpf/syscall.c +4
-0err =bpf_fd_array_map_lookup_elem (map, key, value); }else if (IS_FD_HASH (map)) { err =bpf_fd_htab_map_lookup_elem (map, key, value);@@ -1005,6 +1006,10 @@ static int map_update_elem(union bpf_attr *attr) map->map_type == BPF_MAP_TYPE_SOCKMAP) { err = map->ops->map_update_elem (map, key, value, attr->flags); goto out; + } else if (IS_FD_PROG_ARRAY(map)) { + err =bpf_fd_array_map_update_elem (map, f.file, key, value, + attr->flags); + goto out; }
Quoted 13 lines
kernel/bpf/syscall.c static int map_delete_elem(union bpf_attr *attr) · line 1096
Quoted 7 lines
kernel/bpf/syscall.c +2
-0/* must increment bpf_prog_active to avoid kprobe+bpf triggering from @@ -1087,6 +1092,9 @@ static int map_delete_elem(union bpf_attr *attr)if (bpf_map_is_dev_bound (map)) { err =bpf_map_offload_delete_elem (map, key); goto out; + }else if (IS_FD_PROG_ARRAY (map)) { + err = map->ops->map_delete_elem (map, key);
map->ops->map_delete_elemwould be called below anyways, except underrcu_read_lock()withpreempt_disable()(maybe_wait_bpf_programs()is no-op forprog_array). So if there is specific reason we want to avoidpreempt_disableandrcu_read_lock(), would be nice to have a comment explaining that.
See answer above. I didn't add an explicit comment there since it's not done for all the others either, but seems obvious when looking at the map implementation and prog_array_map_poke_run() / bpf_arch_text_poke().
Thanks,
Daniel
Andrii Nakryiko
Acked-byRe: [PATCH bpf-next v2 5/8] bpf: add poke dependency tracking for prog array maps
Quoted 101 lines · Daniel Borkmann
Quoted 54 lines · Andrii Nakryiko
Quoted 27 lines · Daniel Borkmann
This work adds program tracking to prog array maps. This is needed such that upon prog array updates/deletions we can fix up all programs which make use of this tail call map. We add ops->map_poke_{un,}track() helpers to maps to maintain the list of programs and
ops->map_poke_run()for triggering the actual update.
bpf_array_auxis extended to contain the list head andpoke_mutexin order to serialize program patching during updates/deletions.bpf_free_used_maps()will untrack the program shortly before dropping the reference to the map. For clearing out the prog array once all urefs are dropped we need to useschedule_work()to have a sleepable context.The
prog_array_map_poke_run()is triggered during updates/deletions and walks the maintained prog list. It checks in theirpoke_tabswhether the map and key is matching and runs the actualbpf_arch_text_poke()for patching in the nop or new jmp location. Depending on the type of update, we use one of BPF_MOD_{NOP_TO_JUMP,JUMP_TO_NOP,JUMP_TO_JUMP}.Signed-off-by Daniel Borkmann <[email protected]>--- include/linux/bpf.h | 12 +++ kernel/bpf/arraymap.c | 183 +++++++++++++++++++++++++++++++++++++++++- kernel/bpf/core.c | 9 ++- kernel/bpf/syscall.c | 20 +++-- 4 files changed, 212 insertions(+), 12 deletions(-)[...]
Quoted 23 lines
kernel/bpf/syscall.c +6
-5@@ -26,12 +26,13 @@#include <linux/audit.h> #include <uapi/linux/btf.h> -#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ - (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \ + (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) +#define IS_FD_PROG_ARRAY (map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)#define IS_FD_HASH (map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) -#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_HASH(map)) +#define IS_FD_MAP (map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \ + IS_FD_HASH(map))#define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)Quoted 10 lines
kernel/bpf/syscall.c static int map_lookup_elem(union bpf_attr *attr) · line 882
Quoted 6 lines
kernel/bpf/syscall.c +1
-1@@ -878,7 +879,7 @@ static int map_lookup_elem(union bpf_attr *attr) err =bpf_percpu_cgroup_storage_copy (map, key, value); }else if (map->map_type ==BPF_MAP_TYPE_STACK_TRACE ) { err =bpf_stackmap_copy (map, key, value); - }else if (IS_FD_ARRAY (map)) { + }else if (IS_FD_ARRAY (map) ||IS_FD_PROG_ARRAY (map)) {Why
BPF_MAP_TYPE_PROG_ARRAYcouldn't still stay as "IS_FD_ARRAY"? Seems like it's still handled the same here and is technically an array containing FDs, no? You can still have more preciseFor the update and delete method we need to hold the mutex in prog array which is why we cannot be under RCU there. For the lookup itself it can stay as-is since it's not a modification hence the or above.
Quoted 16 lines
IS_FD_PROG_ARRAY, for cases like inmap_update_elem(), where you need to special-handle just that map type.Quoted 13 lines
kernel/bpf/syscall.c +4
-0err =bpf_fd_array_map_lookup_elem (map, key, value); }else if (IS_FD_HASH (map)) { err =bpf_fd_htab_map_lookup_elem (map, key, value);@@ -1005,6 +1006,10 @@ static int map_update_elem(union bpf_attr *attr) map->map_type == BPF_MAP_TYPE_SOCKMAP) { err = map->ops->map_update_elem (map, key, value, attr->flags); goto out; + } else if (IS_FD_PROG_ARRAY(map)) { + err =bpf_fd_array_map_update_elem (map, f.file, key, value, + attr->flags); + goto out; }Quoted 13 lines
kernel/bpf/syscall.c static int map_delete_elem(union bpf_attr *attr) · line 1096
Quoted 7 lines
kernel/bpf/syscall.c +2
-0/* must increment bpf_prog_active to avoid kprobe+bpf triggering from @@ -1087,6 +1092,9 @@ static int map_delete_elem(union bpf_attr *attr)if (bpf_map_is_dev_bound (map)) { err =bpf_map_offload_delete_elem (map, key); goto out; + }else if (IS_FD_PROG_ARRAY (map)) { + err = map->ops->map_delete_elem (map, key);
map->ops->map_delete_elemwould be called below anyways, except underrcu_read_lock()withpreempt_disable()(maybe_wait_bpf_programs()is no-op forprog_array). So if there is specific reason we want to avoidpreempt_disableandrcu_read_lock(), would be nice to have a comment explaining that.
Quoted 3 lines
See answer above. I didn't add an explicit comment there since it's not done for all the others either, but seems obvious when looking at the map implementation and
prog_array_map_poke_run()/bpf_arch_text_poke().
Ok, fair enough. I was a bit lazy in trying to figure this out :)
Quoted 3 lines
Thanks,
Daniel
Daniel Borkmann
maintainerPATCH v2 6/8 bpf: constant map key tracking for prog array pokes
In reply to Daniel BorkmannAdd tracking of constant keys into tail call maps. The signature of bpf_tail_call_proto is that arg1 is ctx, arg2 map pointer and arg3 is a index key. The direct call approach for tail calls can be enabled if the verifier asserted that for all branches leading to the tail call helper invocation, the map pointer and index key were both constant and the same.
Tracking of map pointers we already do from prior work via c93552c443eb ("bpf: properly enforce index mask to prevent out-of-bounds speculation") and 09772d92cd5a ("bpf: avoid retpoline for lookup/update/ delete calls on maps").
Given the tail call map index key is not on stack but directly in the register, we can add similar tracking approach and later in fixup_bpf_calls() add a poke descriptor to the progs poke_tab with the relevant information for the JITing phase.
We internally reuse insn->imm for the rewritten BPF_JMP | BPF_TAIL_CALL instruction in order to point into the prog's poke_tab, and keep insn->imm as 0 as indicator that current indirect tail call emission must be used. Note that publishing to the tracker must happen at the end of fixup_bpf_calls() since adding elements to the poke_tab reallocates its memory, so we need to wait until its in final state.
Future work can generalize and add similar approach to optimize plain array map lookups. Difference there is that we need to look into the key value that sits on stack. For clarity in bpf_insn_aux_data, map_state has been renamed into map_ptr_state, so we get map_{ptr,key}_state as trackers.
--- include/linux/bpf_verifier.h | 3 +- kernel/bpf/verifier.c | 120 ++++++++++++++++++++++++++++++++--- 2 files changed, 113 insertions(+), 10 deletions(-)
include/linux/bpf_verifier.h +2 -1
@@ -293,7 +293,7 @@ struct bpf_verifier_state_list { struct bpf_insn_aux_data { union { enum bpf_reg_type ptr_type; /* pointer type for load/store insns */ - unsigned long map_state; /* pointer/poison value for maps */ + unsigned long map_ptr_state; /* pointer/poison value for maps */ s32 call_imm; /* saved imm field of call insn */ u32 alu_limit; /* limit for add/sub register with pointer */ struct {
@@ -301,6 +301,7 @@ struct bpf_insn_aux_data {u32 map_off;/* offset from value base address */ }; }; +u64 map_key_state;/* constant (32 bit) key tracking for maps */ int ctx_field_size;/* the ctx field size for load insn, maybe 0 */ int sanitize_stack_off;/* stack slot to be cleared */ bool seen;/* this insn was processed by the verifier */
kernel/bpf/verifier.c +111 -9
197 lines not on this page · raw message
Signature · 1 line
2.21.0
Re: [PATCH bpf-next v2 6/8] bpf: constant map key tracking for prog array pokes
Quoted 25 lines · Daniel Borkmann
Add tracking of constant keys into tail call maps. The signature of
bpf_tail_call_protois that arg1 is ctx, arg2 map pointer and arg3 is a index key. The direct call approach for tail calls can be enabled if the verifier asserted that for all branches leading to the tail call helper invocation, the map pointer and index key were both constant and the same.Tracking of map pointers we already do from prior work via
c93552c443eb("bpf: properly enforce index mask to prevent out-of-bounds speculation") and09772d92cd5a("bpf: avoid retpoline for lookup/update/ delete calls on maps").Given the tail call map index key is not on stack but directly in the register, we can add similar tracking approach and later in
fixup_bpf_calls()add a poke descriptor to the progspoke_tabwith the relevant information for the JITing phase.We internally reuse
insn->immfor the rewrittenBPF_JMP|BPF_TAIL_CALLinstruction in order to point into the prog'spoke_tab, and keepinsn->immas 0 as indicator that current indirect tail call emission must be used. Note that publishing to the tracker must happen at the end offixup_bpf_calls()since adding elements to thepoke_tabreallocates its memory, so we need to wait until its in final state.
Quoted 8 lines
Future work can generalize and add similar approach to optimize plain array map lookups. Difference there is that we need to look into the key value that sits on stack. For clarity in
bpf_insn_aux_data,map_statehas been renamed intomap_ptr_state, so we get map_{ptr,key}_state as trackers.Signed-off-by Daniel Borkmann <[email protected]>---
Quoted 4 lines
include/linux/bpf_verifier.h | 3 +- kernel/bpf/verifier.c | 120 ++++++++++++++++++++++++++++++++--- 2 files changed, 113 insertions(+), 10 deletions(-)
[...]
Re: [PATCH bpf-next v2 6/8] bpf: constant map key tracking for prog array pokes
In reply to Daniel BorkmannOn Fri, Nov 22, 2019 at 09:07 PM CET, Daniel Borkmann wrote:
[...]
kernel/bpf/verifier.c static int fixup_call_args(struct bpf_verifier_env *env) · line 9116
Quoted 8 lines
kernel/bpf/verifier.c +1
-0@@ -9046,6 +9110,7 @@ static int fixup_call_args(struct bpf_verifier_env *env)static int fixup_bpf_calls (struct bpf_verifier_env *env) {struct bpf_prog *prog = env->prog; +bool expect_blinding =bpf_jit_blinding_enabled (prog);struct bpf_insn *insn = prog->insnsi;const struct bpf_func_proto *fn;const int insn_cnt = prog->len;
I noticed this is breaking the build if CONFIG_BPF_JIT is not set:
kernel/bpf/verifier.c: In function ‘fixup_bpf_calls’:kernel/bpf/verifier.c:9134:25: error: implicit declaration of function ‘bpf_jit_blinding_enabled’; did you mean ‘bpf_jit_kallsyms_enabled’? [-Werror=implicit-function-declaration]
bool expect_blinding = bpf_jit_blinding_enabled(prog);
^~~~~~~~~~~~~~~~~~~~~~~~
bpf_jit_kallsyms_enabledDaniel Borkmann
maintainerPATCH v2 7/8 bpf, x86: emit patchable direct jump as tail call
In reply to Daniel BorkmannAdd initial code emission for *direct* jumps for tail call maps in order to avoid the retpoline overhead from a493a87f38cf ("bpf, x64:
implement retpoline for tail call") for situations that allow for it, meaning, for known constant keys at verification time which are used as index into the tail call map. In case of Cilium which makes heavy use of tail calls, constant keys are used in the vast majority, only for a single occurrence we use a dynamic key.
High level outline is that if the target prog is NULL in the map, we emit a 5-byte nop for the fall-through case and if not, we emit a 5-byte direct relative jmp to the target bpf_func + skipped prologue offset. Later during runtime, we patch these 5-byte nop/jmps upon tail call map update or deletions dynamically. Note that on x86-64 the direct jmp works as we reuse the same stack frame and skip prologue (as opposed to some other JIT implementations).
One of the issues is that the tail call map slots can change at any given time even during JITing. Therefore, we have two passes: i) emit nops for all patchable locations during main JITing phase until we declare prog->jited = 1 eventually. At this point the image is stable, not public yet and with all jmps disabled. While JITing, we collect additional info like poke->ip in order to remember the patch location for later modifications. In ii) bpf_tail_call_direct_fixup() walks over the progs poke_tab, locks the tail call maps poke_mutex to prevent from parallel updates and patches in the right locations via __bpf_arch_text_poke(). Note, the main bpf_arch_text_poke() cannot be used at this point since we're not yet exposed to kallsyms. For the update we use plain memcpy() since the image is not public and still in read-write mode. After patching, we activate that poke entry through poke->ip_stable. Meaning, at this point any tail call map updates/deletions are not going to ignore that poke entry anymore. Then, bpf_arch_text_poke() might still occur on the read-write image until we finally locked it as read-only. Both modifications on the given image are under text_mutex to avoid interference with each other when update requests come in in parallel for different tail call maps (current one we have locked in JIT and different one where poke->ip_stable was already set).
Example prog:
# ./bpftool p d x i 1655 0: (b7) r3 = 0 1: (18) r2 = map[id:526] 3: (85) call bpf_tail_call#12 4: (b7) r0 = 1 5: (95) exit
Before:
# ./bpftool p d j i 1655 0xffffffffc076e55c: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 _ 19: xor %edx,%edx |_ index (arg 3) 1b: movabs $0xffff88d95cc82600,%rsi |_ map (arg 2) 25: mov %edx,%edx | index >= array->map.max_entries 27: cmp %edx,0x24(%rsi) | 2a: jbe 0x0000000000000066 |_ 2c: mov -0x224(%rbp),%eax | tail call limit check 32: cmp $0x20,%eax | 35: ja 0x0000000000000066 | 37: add $0x1,%eax | 3a: mov %eax,-0x224(%rbp) |_ 40: mov 0xd0(%rsi,%rdx,8),%rax |_ prog = array->ptrs[index] 48: test %rax,%rax | prog == NULL check 4b: je 0x0000000000000066 |_ 4d: mov 0x30(%rax),%rax | goto *(prog->bpf_func + prologue_size) 51: add $0x19,%rax | 55: callq 0x0000000000000061 | retpoline for indirect jump 5a: pause | 5c: lfence | 5f: jmp 0x000000000000005a | 61: mov %rax,(%rsp) | 65: retq |_ 66: mov $0x1,%eax 6b: pop %rbx 6c: pop %r15 6e: pop %r14 70: pop %r13 72: pop %rbx 73: leaveq 74: retq
After; state after JIT:
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 _ 19: xor %edx,%edx |_ index (arg 3) 1b: movabs $0xffff9d8afd74c000,%rsi |_ map (arg 2) 25: mov -0x224(%rbp),%eax | tail call limit check 2b: cmp $0x20,%eax | 2e: ja 0x000000000000003e | 30: add $0x1,%eax | 33: mov %eax,-0x224(%rbp) |_ 39: jmpq 0xfffffffffffd1785 |_ [direct] goto *(prog->bpf_func + prologue_size) 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retq
After; state after map update (target prog):
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 19: xor %edx,%edx 1b: movabs $0xffff9d8afd74c000,%rsi 25: mov -0x224(%rbp),%eax 2b: cmp $0x20,%eax . 2e: ja 0x000000000000003e . 30: add $0x1,%eax . 33: mov %eax,-0x224(%rbp) |_ 39: jmpq 0xffffffffffb09f55 |_ goto *(prog->bpf_func + prologue_size) 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retq
After; state after map update (no prog):
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 19: xor %edx,%edx 1b: movabs $0xffff9d8afd74c000,%rsi 25: mov -0x224(%rbp),%eax 2b: cmp $0x20,%eax . 2e: ja 0x000000000000003e . 30: add $0x1,%eax . 33: mov %eax,-0x224(%rbp) |_ 39: nopl 0x0(%rax,%rax,1) |_ fall-through nop 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retq
Nice bonus is that this also shrinks the code emission quite a bit for every tail call invocation.
--- arch/x86/net/bpf_jit_comp.c | 282 ++++++++++++++++++++++++------------ 1 file changed, 187 insertions(+), 95 deletions(-)
arch/x86/net/bpf_jit_comp.c +187 -95
@@ -239,6 +239,123 @@ static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) *pprog = prog; } +static int emit_patch (u8 **pprog,void *func,void *ip,u8 opcode) +{ +u8 *prog = *pprog; +int cnt =0 ; +s64 offset; + + offset = func - (ip +X86_PATCH_SIZE ); +if (!is_simm32 (offset)) { +pr_err ("Target call %p is out of range\n" , func); +return -ERANGE ; + } +EMIT1_off32 (opcode, offset); + *pprog = prog; +return 0 ; +} + +static int emit_call (u8 **pprog,void *func,void *ip) +{ +return emit_patch (pprog, func, ip,0xE8 ); +} + +static int emit_jump (u8 **pprog,void *func,void *ip) +{ +return emit_patch (pprog, func, ip,0xE9 ); +} + +static int __bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t, +void *old_addr,void *new_addr, +const bool text_live) +{ +int (*emit_patch_fn)(u8 **pprog,void *func,void *ip); +const u8 *nop_insn = ideal_nops[NOP_ATOMIC5 ]; +u8 old_insn[X86_PATCH_SIZE ] = {}; +u8 new_insn[X86_PATCH_SIZE ] = {}; +u8 *prog; +int ret; + +switch (t) { + case BPF_MOD_NOP_TO_CALL ... BPF_MOD_CALL_TO_NOP: + emit_patch_fn = emit_call; +break ; + case BPF_MOD_NOP_TO_JUMP ... BPF_MOD_JUMP_TO_NOP: + emit_patch_fn = emit_jump; +break ; +default : +return -ENOTSUPP ; + } + +switch (t) { +case BPF_MOD_NOP_TO_CALL : +case BPF_MOD_NOP_TO_JUMP : +if (!old_addr && new_addr) { +memcpy (old_insn, nop_insn,X86_PATCH_SIZE ); + + prog = new_insn; + ret =emit_patch_fn (&prog, new_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +case BPF_MOD_CALL_TO_CALL : +case BPF_MOD_JUMP_TO_JUMP : +if (old_addr && new_addr) { + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; + + prog = new_insn; + ret =emit_patch_fn (&prog, new_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) { +memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default : +return -ENOTSUPP ; + } + + ret = -EBUSY ; +mutex_lock (&text_mutex); +if (memcmp (ip, old_insn,X86_PATCH_SIZE )) + goto out; +if (text_live) +text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL ); +else +memcpy (ip, new_insn,X86_PATCH_SIZE ); + ret =0 ; +out: +mutex_unlock (&text_mutex); +return ret; +} + +int bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t, +void *old_addr,void *new_addr) +{ +if (!is_kernel_text ((long )ip) && + !is_bpf_text_address ((long )ip)) +/* BPF poking in modules is not supported */ +return -EINVAL ; + +return __bpf_arch_text_poke (ip, t, old_addr, new_addr, true); +} +/* * Generate the following code: *
@@ -253,7 +370,7 @@ static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf)* goto *(prog->bpf_func + prologue_size); * out: */ -static void emit_bpf_tail_call (u8 **pprog) +static void emit_bpf_tail_call_indirect (u8 **pprog) {u8 *prog = *pprog;int label1, label2, label3;
@@ -320,6 +437,69 @@ static void emit_bpf_tail_call(u8 **pprog) *pprog = prog; } +static void emit_bpf_tail_call_direct (struct bpf_jit_poke_descriptor *poke, +u8 **pprog,int addr,u8 *image) +{ +u8 *prog = *pprog; +int cnt =0 ; + +/* +* if (tail_call_cnt > MAX_TAIL_CALL_CNT) +* goto out; +*/ +EMIT2_off32 (0x8B ,0x85 ,-36 -MAX_BPF_STACK );/* mov eax, dword ptr [rbp - 548] */ +EMIT3 (0x83 ,0xF8 ,MAX_TAIL_CALL_CNT );/* cmp eax, MAX_TAIL_CALL_CNT */ +EMIT2 (X86_JA ,14 );/* ja out */ +EMIT3 (0x83 ,0xC0 ,0x01 );/* add eax, 1 */ +EMIT2_off32 (0x89 ,0x85 ,-36 -MAX_BPF_STACK );/* mov dword ptr [rbp -548], eax */ + + poke->ip = image + (addr -X86_PATCH_SIZE ); + poke->adj_off =PROLOGUE_SIZE ; + +memcpy (prog, ideal_nops[NOP_ATOMIC5 ],X86_PATCH_SIZE ); + prog +=X86_PATCH_SIZE ; +/* out: */ + + *pprog = prog; +} + +static void bpf_tail_call_direct_fixup (struct bpf_prog *prog) +{ +static const enum bpf_text_poke_type type =BPF_MOD_NOP_TO_JUMP ; +struct bpf_jit_poke_descriptor *poke; +struct bpf_array *array; +struct bpf_prog *target; +int i, ret; + +for (i =0 ; i < prog->aux->size_poke_tab; i++) { + poke = &prog->aux->poke_tab[i]; +WARN_ON_ONCE (READ_ONCE (poke->ip_stable)); + +if (poke->reason !=BPF_POKE_REASON_TAIL_CALL ) +continue ; + + array = container_of(poke->tail_call.map, struct bpf_array, map); +mutex_lock (&array->aux->poke_mutex); + target = array->ptrs[poke->tail_call.key]; +if (target) { +/* Plain memcpy is used when image is not live yet +* and still not locked as read-only. Once poke +* location is active (poke->ip_stable), any parallel +* bpf_arch_text_poke() might occur still on the +* read-write image until we finally locked it as +* read-only. Both modifications on the given image +* are under text_mutex to avoid interference. +*/ + ret =__bpf_arch_text_poke (poke->ip, type,NULL , + (u8 *)target->bpf_func + + poke->adj_off, false); +BUG_ON (ret <0 ); + } +WRITE_ONCE (poke->ip_stable, true); +mutex_unlock (&array->aux->poke_mutex); + } +} +static void emit_mov_imm32 (u8 **pprog,bool sign_propagate,u32 dst_reg,const u32 imm32) {
@@ -481,99 +661,6 @@ static void emit_stx(u8 **pprog, u32 size, u32 dst_reg, u32 src_reg, int off) *pprog = prog; } -static int emit_patch (u8 **pprog,void *func,void *ip,u8 opcode) -{ -u8 *prog = *pprog; -int cnt =0 ; -s64 offset; - - offset = func - (ip +X86_PATCH_SIZE ); -if (!is_simm32 (offset)) { -pr_err ("Target call %p is out of range\n" , func); -return -EINVAL ; - } -EMIT1_off32 (opcode, offset); - *pprog = prog; -return 0 ; -} - -static int emit_call (u8 **pprog,void *func,void *ip) -{ -return emit_patch (pprog, func, ip,0xE8 ); -} - -static int emit_jump (u8 **pprog,void *func,void *ip) -{ -return emit_patch (pprog, func, ip,0xE9 ); -} - -int bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t, -void *old_addr,void *new_addr) -{ -int (*emit_patch_fn)(u8 **pprog,void *func,void *ip); -u8 old_insn[X86_PATCH_SIZE ] = {}; -u8 new_insn[X86_PATCH_SIZE ] = {}; -u8 *prog; -int ret; - -if (!is_kernel_text ((long )ip) && - !is_bpf_text_address ((long )ip)) -/* BPF poking in modules is not supported */ -return -EINVAL ; - -switch (t) { - case BPF_MOD_NOP_TO_CALL ... BPF_MOD_CALL_TO_NOP: - emit_patch_fn = emit_call; -break ; - case BPF_MOD_NOP_TO_JUMP ... BPF_MOD_JUMP_TO_NOP: - emit_patch_fn = emit_jump; -break ; -default : -return -ENOTSUPP ; - } - -if (old_addr) { - prog = old_insn; - ret =emit_patch_fn (&prog, old_addr, (void *)ip); -if (ret) -return ret; - } -if (new_addr) { - prog = new_insn; - ret =emit_patch_fn (&prog, new_addr, (void *)ip); -if (ret) -return ret; - } - - ret = -EBUSY ; -mutex_lock (&text_mutex); -switch (t) { -case BPF_MOD_NOP_TO_CALL : -case BPF_MOD_NOP_TO_JUMP : -if (memcmp (ip, ideal_nops[NOP_ATOMIC5 ],X86_PATCH_SIZE )) - goto out; -text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL ); -break ; -case BPF_MOD_CALL_TO_CALL : -case BPF_MOD_JUMP_TO_JUMP : -if (memcmp (ip, old_insn,X86_PATCH_SIZE )) - goto out; -text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL ); -break ; -case BPF_MOD_CALL_TO_NOP : -case BPF_MOD_JUMP_TO_NOP : -if (memcmp (ip, old_insn,X86_PATCH_SIZE )) - goto out; -text_poke_bp (ip, ideal_nops[NOP_ATOMIC5 ],X86_PATCH_SIZE , -NULL ); -break ; - } - ret =0 ; -out: -mutex_unlock (&text_mutex); -return ret; -} -static bool ex_handler_bpf (const struct exception_table_entry *x,struct pt_regs *regs,int trapnr,unsigned long error_code,unsigned long fault_addr)
@@ -1041,7 +1128,11 @@ xadd: if (is_imm8(insn->off))break ;case BPF_JMP |BPF_TAIL_CALL : -emit_bpf_tail_call (&prog); +if (imm32) +emit_bpf_tail_call_direct (&bpf_prog->aux->poke_tab[imm32 -1 ], + &prog, addrs[i], image); +else +emit_bpf_tail_call_indirect (&prog);break ;/* cond jump */
@@ -1599,6 +1690,7 @@ struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog)if (image) {if (!prog->is_func || extra_pass) { +bpf_tail_call_direct_fixup (prog);bpf_jit_binary_lock_ro (header); }else { jit_data->addrs = addrs;
Signature · 1 line
2.21.0
Re: [PATCH bpf-next v2 7/8] bpf, x86: emit patchable direct jump as tail call
Quoted 189 lines · Daniel Borkmann
Add initial code emission for *direct* jumps for tail call maps in order to avoid the retpoline overhead from
a493a87f38cf("bpf, x64:
implement retpoline for tail call") for situations that allow for it, meaning, for known constant keys at verification time which are used as index into the tail call map. In case of Cilium which makes heavy use of tail calls, constant keys are used in the vast majority, only for a single occurrence we use a dynamic key.High level outline is that if the target prog is NULL in the map, we emit a 5-byte nop for the fall-through case and if not, we emit a 5-byte direct relative jmp to the target
bpf_func+ skipped prologue offset. Later during runtime, we patch these 5-byte nop/jmps upon tail call map update or deletions dynamically. Note that on x86-64 the direct jmp works as we reuse the same stack frame and skip prologue (as opposed to some other JIT implementations).One of the issues is that the tail call map slots can change at any given time even during JITing. Therefore, we have two passes: i) emit nops for all patchable locations during main JITing phase until we declare
prog->jited= 1 eventually. At this point the image is stable, not public yet and with all jmps disabled. While JITing, we collect additional info likepoke->ipin order to remember the patch location for later modifications. In ii)bpf_tail_call_direct_fixup()walks over the progspoke_tab, locks the tail call mapspoke_mutexto prevent from parallel updates and patches in the right locations via__bpf_arch_text_poke(). Note, the mainbpf_arch_text_poke()cannot be used at this point since we're not yet exposed to kallsyms. For the update we use plainmemcpy()since the image is not public and still in read-write mode. After patching, we activate that poke entry throughpoke->ip_stable. Meaning, at this point any tail call map updates/deletions are not going to ignore that poke entry anymore. Then,bpf_arch_text_poke()might still occur on the read-write image until we finally locked it as read-only. Both modifications on the given image are undertext_mutexto avoid interference with each other when update requests come in in parallel for different tail call maps (current one we have locked in JIT and different one wherepoke->ip_stablewas already set).Example prog:
# ./bpftool p d x i 1655 0: (b7) r3 = 0 1: (18) r2 = map[id:526] 3: (85) call bpf_tail_call#12 4: (b7) r0 = 1 5: (95) exitBefore:
# ./bpftool p d j i 1655 0xffffffffc076e55c: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 _ 19: xor %edx,%edx |_ index (arg 3) 1b: movabs $0xffff88d95cc82600,%rsi |_ map (arg 2) 25: mov %edx,%edx | index >= array->map.max_entries 27: cmp %edx,0x24(%rsi) | 2a: jbe 0x0000000000000066 |_ 2c: mov -0x224(%rbp),%eax | tail call limit check 32: cmp $0x20,%eax | 35: ja 0x0000000000000066 | 37: add $0x1,%eax | 3a: mov %eax,-0x224(%rbp) |_ 40: mov 0xd0(%rsi,%rdx,8),%rax |_ prog = array->ptrs[index] 48: test %rax,%rax | prog == NULL check 4b: je 0x0000000000000066 |_ 4d: mov 0x30(%rax),%rax | goto *(prog->bpf_func + prologue_size) 51: add $0x19,%rax | 55: callq 0x0000000000000061 | retpoline for indirect jump 5a: pause | 5c: lfence | 5f: jmp 0x000000000000005a | 61: mov %rax,(%rsp) | 65: retq |_ 66: mov $0x1,%eax 6b: pop %rbx 6c: pop %r15 6e: pop %r14 70: pop %r13 72: pop %rbx 73: leaveq 74: retqAfter; state after JIT:
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 _ 19: xor %edx,%edx |_ index (arg 3) 1b: movabs $0xffff9d8afd74c000,%rsi |_ map (arg 2) 25: mov -0x224(%rbp),%eax | tail call limit check 2b: cmp $0x20,%eax | 2e: ja 0x000000000000003e | 30: add $0x1,%eax | 33: mov %eax,-0x224(%rbp) |_ 39: jmpq 0xfffffffffffd1785 |_ [direct] goto *(prog->bpf_func + prologue_size) 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retqAfter; state after map update (target prog):
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 19: xor %edx,%edx 1b: movabs $0xffff9d8afd74c000,%rsi 25: mov -0x224(%rbp),%eax 2b: cmp $0x20,%eax . 2e: ja 0x000000000000003e . 30: add $0x1,%eax . 33: mov %eax,-0x224(%rbp) |_ 39: jmpq 0xffffffffffb09f55 |_ goto *(prog->bpf_func + prologue_size) 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retqAfter; state after map update (no prog):
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 19: xor %edx,%edx 1b: movabs $0xffff9d8afd74c000,%rsi 25: mov -0x224(%rbp),%eax 2b: cmp $0x20,%eax . 2e: ja 0x000000000000003e . 30: add $0x1,%eax . 33: mov %eax,-0x224(%rbp) |_ 39: nopl 0x0(%rax,%rax,1) |_ fall-through nop 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retqNice bonus is that this also shrinks the code emission quite a bit for every tail call invocation.
Signed-off-by Daniel Borkmann <[email protected]>--- arch/x86/net/bpf_jit_comp.c | 282 ++++++++++++++++++++++++------------ 1 file changed, 187 insertions(+), 95 deletions(-)
[...]
Quoted 53 lines
arch/x86/net/bpf_jit_comp.c +53
-0+static int __bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t, +void *old_addr,void *new_addr, +const bool text_live) +{ +int (*emit_patch_fn)(u8 **pprog,void *func,void *ip); +const u8 *nop_insn = ideal_nops[NOP_ATOMIC5 ]; +u8 old_insn[X86_PATCH_SIZE ] = {}; +u8 new_insn[X86_PATCH_SIZE ] = {}; +u8 *prog; +int ret; + +switch (t) { + case BPF_MOD_NOP_TO_CALL ... BPF_MOD_CALL_TO_NOP: + emit_patch_fn = emit_call; +break ; + case BPF_MOD_NOP_TO_JUMP ... BPF_MOD_JUMP_TO_NOP: + emit_patch_fn = emit_jump; +break ; +default : +return -ENOTSUPP ; + } + +switch (t) { +case BPF_MOD_NOP_TO_CALL : +case BPF_MOD_NOP_TO_JUMP : +if (!old_addr && new_addr) { +memcpy (old_insn, nop_insn,X86_PATCH_SIZE ); + + prog = new_insn; + ret =emit_patch_fn (&prog, new_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +case BPF_MOD_CALL_TO_CALL : +case BPF_MOD_JUMP_TO_JUMP : +if (old_addr && new_addr) { + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; + + prog = new_insn; + ret =emit_patch_fn (&prog, new_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) {
arch/x86/net/bpf_jit_comp.c static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) · line 330
Quoted 10 lines
arch/x86/net/bpf_jit_comp.c +10
-0+memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default :
There is this redundancy between BPF_MOD_xxx enums and old_addr+new_addr (both encode what kind of transition it is), which leads to this cumbersome logic. Would it be simpler to have old_addr/new_addr determine whether it's X-to-NOP, NOP-to-Y, or X-to-Y transition, while separate bool or simple BPF_MOD_CALL/BPF_MOD_JUMP enum determining whether it's a call or a jump that we want to update. Seems like that should be a simpler interface overall and cleaner implementation?
Quoted 17 lines
arch/x86/net/bpf_jit_comp.c +17
-0+return -ENOTSUPP ; + } + + ret = -EBUSY ; +mutex_lock (&text_mutex); +if (memcmp (ip, old_insn,X86_PATCH_SIZE )) + goto out; +if (text_live) +text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL ); +else +memcpy (ip, new_insn,X86_PATCH_SIZE ); + ret =0 ; +out: +mutex_unlock (&text_mutex); +return ret; +} +
[...]
Daniel Borkmann
maintainerRe: [PATCH bpf-next v2 7/8] bpf, x86: emit patchable direct jump as tail call
Quoted 257 lines · Andrii Nakryiko
Quoted 189 lines · Daniel Borkmann
Add initial code emission for *direct* jumps for tail call maps in order to avoid the retpoline overhead from
a493a87f38cf("bpf, x64:
implement retpoline for tail call") for situations that allow for it, meaning, for known constant keys at verification time which are used as index into the tail call map. In case of Cilium which makes heavy use of tail calls, constant keys are used in the vast majority, only for a single occurrence we use a dynamic key.High level outline is that if the target prog is NULL in the map, we emit a 5-byte nop for the fall-through case and if not, we emit a 5-byte direct relative jmp to the target
bpf_func+ skipped prologue offset. Later during runtime, we patch these 5-byte nop/jmps upon tail call map update or deletions dynamically. Note that on x86-64 the direct jmp works as we reuse the same stack frame and skip prologue (as opposed to some other JIT implementations).One of the issues is that the tail call map slots can change at any given time even during JITing. Therefore, we have two passes: i) emit nops for all patchable locations during main JITing phase until we declare
prog->jited= 1 eventually. At this point the image is stable, not public yet and with all jmps disabled. While JITing, we collect additional info likepoke->ipin order to remember the patch location for later modifications. In ii)bpf_tail_call_direct_fixup()walks over the progspoke_tab, locks the tail call mapspoke_mutexto prevent from parallel updates and patches in the right locations via__bpf_arch_text_poke(). Note, the mainbpf_arch_text_poke()cannot be used at this point since we're not yet exposed to kallsyms. For the update we use plainmemcpy()since the image is not public and still in read-write mode. After patching, we activate that poke entry throughpoke->ip_stable. Meaning, at this point any tail call map updates/deletions are not going to ignore that poke entry anymore. Then,bpf_arch_text_poke()might still occur on the read-write image until we finally locked it as read-only. Both modifications on the given image are undertext_mutexto avoid interference with each other when update requests come in in parallel for different tail call maps (current one we have locked in JIT and different one wherepoke->ip_stablewas already set).Example prog:
# ./bpftool p d x i 1655 0: (b7) r3 = 0 1: (18) r2 = map[id:526] 3: (85) call bpf_tail_call#12 4: (b7) r0 = 1 5: (95) exitBefore:
# ./bpftool p d j i 1655 0xffffffffc076e55c: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 _ 19: xor %edx,%edx |_ index (arg 3) 1b: movabs $0xffff88d95cc82600,%rsi |_ map (arg 2) 25: mov %edx,%edx | index >= array->map.max_entries 27: cmp %edx,0x24(%rsi) | 2a: jbe 0x0000000000000066 |_ 2c: mov -0x224(%rbp),%eax | tail call limit check 32: cmp $0x20,%eax | 35: ja 0x0000000000000066 | 37: add $0x1,%eax | 3a: mov %eax,-0x224(%rbp) |_ 40: mov 0xd0(%rsi,%rdx,8),%rax |_ prog = array->ptrs[index] 48: test %rax,%rax | prog == NULL check 4b: je 0x0000000000000066 |_ 4d: mov 0x30(%rax),%rax | goto *(prog->bpf_func + prologue_size) 51: add $0x19,%rax | 55: callq 0x0000000000000061 | retpoline for indirect jump 5a: pause | 5c: lfence | 5f: jmp 0x000000000000005a | 61: mov %rax,(%rsp) | 65: retq |_ 66: mov $0x1,%eax 6b: pop %rbx 6c: pop %r15 6e: pop %r14 70: pop %r13 72: pop %rbx 73: leaveq 74: retqAfter; state after JIT:
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 _ 19: xor %edx,%edx |_ index (arg 3) 1b: movabs $0xffff9d8afd74c000,%rsi |_ map (arg 2) 25: mov -0x224(%rbp),%eax | tail call limit check 2b: cmp $0x20,%eax | 2e: ja 0x000000000000003e | 30: add $0x1,%eax | 33: mov %eax,-0x224(%rbp) |_ 39: jmpq 0xfffffffffffd1785 |_ [direct] goto *(prog->bpf_func + prologue_size) 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retqAfter; state after map update (target prog):
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 19: xor %edx,%edx 1b: movabs $0xffff9d8afd74c000,%rsi 25: mov -0x224(%rbp),%eax 2b: cmp $0x20,%eax . 2e: ja 0x000000000000003e . 30: add $0x1,%eax . 33: mov %eax,-0x224(%rbp) |_ 39: jmpq 0xffffffffffb09f55 |_ goto *(prog->bpf_func + prologue_size) 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retqAfter; state after map update (no prog):
# ./bpftool p d j i 1655 0xffffffffc08e8930: 0: nopl 0x0(%rax,%rax,1) 5: push %rbp 6: mov %rsp,%rbp 9: sub $0x200,%rsp 10: push %rbx 11: push %r13 13: push %r14 15: push %r15 17: pushq $0x0 19: xor %edx,%edx 1b: movabs $0xffff9d8afd74c000,%rsi 25: mov -0x224(%rbp),%eax 2b: cmp $0x20,%eax . 2e: ja 0x000000000000003e . 30: add $0x1,%eax . 33: mov %eax,-0x224(%rbp) |_ 39: nopl 0x0(%rax,%rax,1) |_ fall-through nop 3e: mov $0x1,%eax 43: pop %rbx 44: pop %r15 46: pop %r14 48: pop %r13 4a: pop %rbx 4b: leaveq 4c: retqNice bonus is that this also shrinks the code emission quite a bit for every tail call invocation.
Signed-off-by Daniel Borkmann <[email protected]>--- arch/x86/net/bpf_jit_comp.c | 282 ++++++++++++++++++++++++------------ 1 file changed, 187 insertions(+), 95 deletions(-)[...]
Quoted 53 lines
arch/x86/net/bpf_jit_comp.c +53
-0+static int __bpf_arch_text_poke (void *ip,enum bpf_text_poke_type t, +void *old_addr,void *new_addr, +const bool text_live) +{ +int (*emit_patch_fn)(u8 **pprog,void *func,void *ip); +const u8 *nop_insn = ideal_nops[NOP_ATOMIC5 ]; +u8 old_insn[X86_PATCH_SIZE ] = {}; +u8 new_insn[X86_PATCH_SIZE ] = {}; +u8 *prog; +int ret; + +switch (t) { + case BPF_MOD_NOP_TO_CALL ... BPF_MOD_CALL_TO_NOP: + emit_patch_fn = emit_call; +break ; + case BPF_MOD_NOP_TO_JUMP ... BPF_MOD_JUMP_TO_NOP: + emit_patch_fn = emit_jump; +break ; +default : +return -ENOTSUPP ; + } + +switch (t) { +case BPF_MOD_NOP_TO_CALL : +case BPF_MOD_NOP_TO_JUMP : +if (!old_addr && new_addr) { +memcpy (old_insn, nop_insn,X86_PATCH_SIZE ); + + prog = new_insn; + ret =emit_patch_fn (&prog, new_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +case BPF_MOD_CALL_TO_CALL : +case BPF_MOD_JUMP_TO_JUMP : +if (old_addr && new_addr) { + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; + + prog = new_insn; + ret =emit_patch_fn (&prog, new_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) {arch/x86/net/bpf_jit_comp.c static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) · line 330
Quoted 10 lines
arch/x86/net/bpf_jit_comp.c +10
-0+memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default :
Quoted 8 lines
There is this redundancy between
BPF_MOD_xxxenums and old_addr+new_addr (both encode what kind of transition it is), which leads to this cumbersome logic. Would it be simpler to have old_addr/new_addr determine whether it's X-to-NOP, NOP-to-Y, or X-to-Y transition, while separate bool or simple BPF_MOD_CALL/BPF_MOD_JUMP enum determining whether it's a call or a jump that we want to update. Seems like that should be a simpler interface overall and cleaner implementation?
Right we can probably simplify it further, I kept preserving the original switch from Alexei's code where my assumption was that having the transition explicitly spelled out was preferred in here and then based on that doing the sanity checks to make sure we don't get bad input from any call-site since we're modifying kernel text, e.g. in the bpf_trampoline_update() as one example the BPF_MOD_* is a fixed constant input there.
Quoted 20 lines
Quoted 17 lines
arch/x86/net/bpf_jit_comp.c +17
-0+return -ENOTSUPP ; + } + + ret = -EBUSY ; +mutex_lock (&text_mutex); +if (memcmp (ip, old_insn,X86_PATCH_SIZE )) + goto out; +if (text_live) +text_poke_bp (ip, new_insn,X86_PATCH_SIZE ,NULL ); +else +memcpy (ip, new_insn,X86_PATCH_SIZE ); + ret =0 ; +out: +mutex_unlock (&text_mutex); +return ret; +} +[...]
Re: [PATCH bpf-next v2 7/8] bpf, x86: emit patchable direct jump as tail call
Quoted 23 lines · Daniel Borkmann
Quoted 14 lines
arch/x86/net/bpf_jit_comp.c static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) · line 330
Quoted 13 lines
arch/x86/net/bpf_jit_comp.c +13
-0+case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) { +memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default :Quoted 8 lines
There is this redundancy between
BPF_MOD_xxxenums and old_addr+new_addr (both encode what kind of transition it is), which leads to this cumbersome logic. Would it be simpler to have old_addr/new_addr determine whether it's X-to-NOP, NOP-to-Y, or X-to-Y transition, while separate bool or simple BPF_MOD_CALL/BPF_MOD_JUMP enum determining whether it's a call or a jump that we want to update. Seems like that should be a simpler interface overall and cleaner implementation?
Quoted 6 lines
Right we can probably simplify it further, I kept preserving the original switch from Alexei's code where my assumption was that having the transition explicitly spelled out was preferred in here and then based on that doing the sanity checks to make sure we don't get bad input from any call-site since we're modifying kernel text, e.g. in the
bpf_trampoline_update()as one example the BPF_MOD_* is a fixed constant input there.
I guess we can try adding one more argument bpf_arch_text_poke(ip, BPF_MOD_NOP, old_addr, BPF_MOD_INTO_CALL, new_addr); Not sure whether it's gonna be any cleaner.
Intuitively doesn't feel so.
Re: [PATCH bpf-next v2 7/8] bpf, x86: emit patchable direct jump as tail call
Quoted 32 lines · Alexei Starovoitov
Quoted 23 lines · Daniel Borkmann
Quoted 14 lines
arch/x86/net/bpf_jit_comp.c static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) · line 330
Quoted 13 lines
arch/x86/net/bpf_jit_comp.c +13
-0+case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) { +memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default :Quoted 8 lines
There is this redundancy between
BPF_MOD_xxxenums and old_addr+new_addr (both encode what kind of transition it is), which leads to this cumbersome logic. Would it be simpler to have old_addr/new_addr determine whether it's X-to-NOP, NOP-to-Y, or X-to-Y transition, while separate bool or simple BPF_MOD_CALL/BPF_MOD_JUMP enum determining whether it's a call or a jump that we want to update. Seems like that should be a simpler interface overall and cleaner implementation?Quoted 6 lines
Right we can probably simplify it further, I kept preserving the original switch from Alexei's code where my assumption was that having the transition explicitly spelled out was preferred in here and then based on that doing the sanity checks to make sure we don't get bad input from any call-site since we're modifying kernel text, e.g. in the
bpf_trampoline_update()as one example the BPF_MOD_* is a fixed constant input there.
Quoted 2 lines
I guess we can try adding one more argument
bpf_arch_text_poke(ip, BPF_MOD_NOP, old_addr, BPF_MOD_INTO_CALL, new_addr);
I was thinking along the lines of:
bpf_arch_text_poke(ip, BPF_MOD_CALL (or BPF_MOD_JMP), old_addr, new_addr);
old_addr/new_addr being possibly NULL determine NOP/not-a-NOP.
Quoted 2 lines
Not sure whether it's gonna be any cleaner.
Intuitively doesn't feel so.
Re: [PATCH bpf-next v2 7/8] bpf, x86: emit patchable direct jump as tail call
Quoted 34 lines · Andrii Nakryiko
Quoted 32 lines · Alexei Starovoitov
Quoted 29 lines · Daniel Borkmann
Quoted 14 lines
arch/x86/net/bpf_jit_comp.c static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) · line 330
Quoted 13 lines
arch/x86/net/bpf_jit_comp.c +13
-0+case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) { +memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default :Quoted 8 lines
There is this redundancy between
BPF_MOD_xxxenums and old_addr+new_addr (both encode what kind of transition it is), which leads to this cumbersome logic. Would it be simpler to have old_addr/new_addr determine whether it's X-to-NOP, NOP-to-Y, or X-to-Y transition, while separate bool or simple BPF_MOD_CALL/BPF_MOD_JUMP enum determining whether it's a call or a jump that we want to update. Seems like that should be a simpler interface overall and cleaner implementation?Right we can probably simplify it further, I kept preserving the original switch from Alexei's code where my assumption was that having the transition explicitly spelled out was preferred in here and then based on that doing the sanity checks to make sure we don't get bad input from any call-site since we're modifying kernel text, e.g. in the
bpf_trampoline_update()as one example the BPF_MOD_* is a fixed constant input there.
Quoted 8 lines
Quoted 2 lines
I guess we can try adding one more argument
bpf_arch_text_poke(ip, BPF_MOD_NOP, old_addr, BPF_MOD_INTO_CALL, new_addr);I was thinking along the lines of:
bpf_arch_text_poke(ip, BPF_MOD_CALL (or BPF_MOD_JMP), old_addr, new_addr);old_addr/new_addr being possibly NULL determine NOP/not-a-NOP.
I see. Something like:
if (BPF_MOD_CALL) {
if (old_addr)
memcmp(ip, old_call_insn);
else
memcmp(ip, nop_insn);
} else if (BPF_MOD_JMP) {
if (old_addr)
memcmp(ip, old_jmp_insn);
else
memcmp(ip, nop_insn);
}I guess that can work.
Daniel Borkmann
maintainerRe: [PATCH bpf-next v2 7/8] bpf, x86: emit patchable direct jump as tail call
Quoted 55 lines · Alexei Starovoitov
Quoted 33 lines · Andrii Nakryiko
Quoted 31 lines · Alexei Starovoitov
Quoted 29 lines · Daniel Borkmann
Quoted 14 lines
arch/x86/net/bpf_jit_comp.c static void emit_prologue(u8 **pprog, u32 stack_depth, bool ebpf_from_cbpf) · line 330
Quoted 13 lines
arch/x86/net/bpf_jit_comp.c +13
-0+case BPF_MOD_CALL_TO_NOP : +case BPF_MOD_JUMP_TO_NOP : +if (old_addr && !new_addr) { +memcpy (new_insn, nop_insn,X86_PATCH_SIZE ); + + prog = old_insn; + ret =emit_patch_fn (&prog, old_addr, ip); +if (ret) +return ret; +break ; + } +return -ENXIO ; +default :Quoted 8 lines
There is this redundancy between
BPF_MOD_xxxenums and old_addr+new_addr (both encode what kind of transition it is), which leads to this cumbersome logic. Would it be simpler to have old_addr/new_addr determine whether it's X-to-NOP, NOP-to-Y, or X-to-Y transition, while separate bool or simple BPF_MOD_CALL/BPF_MOD_JUMP enum determining whether it's a call or a jump that we want to update. Seems like that should be a simpler interface overall and cleaner implementation?Right we can probably simplify it further, I kept preserving the original switch from Alexei's code where my assumption was that having the transition explicitly spelled out was preferred in here and then based on that doing the sanity checks to make sure we don't get bad input from any call-site since we're modifying kernel text, e.g. in the
bpf_trampoline_update()as one example the BPF_MOD_* is a fixed constant input there.Quoted 8 lines
Quoted 2 lines
I guess we can try adding one more argument
bpf_arch_text_poke(ip, BPF_MOD_NOP, old_addr, BPF_MOD_INTO_CALL, new_addr);I was thinking along the lines of:
bpf_arch_text_poke(ip, BPF_MOD_CALL (or BPF_MOD_JMP), old_addr, new_addr);old_addr/new_addr being possibly NULL determine NOP/not-a-NOP.
I see. Something like:
if (BPF_MOD_CALL) { if (old_addr) memcmp(ip, old_call_insn); else memcmp(ip, nop_insn); } else if (BPF_MOD_JMP) { if (old_addr) memcmp(ip, old_jmp_insn); else memcmp(ip, nop_insn); }
Quoted 1 line
I guess that can work.
Ok, will see to come up with a clean simplification in the evening.
Thanks,
Daniel
Daniel Borkmann
maintainerPATCH v2 8/8 bpf, testing: add various tail call test cases
In reply to Daniel BorkmannAdd several BPF kselftest cases for tail calls which test the various patch directions, and that multiple locations are patched in same and different programs.
# ./test_progs -n 45 #45/1 tailcall_1:OK #45/2 tailcall_2:OK #45/3 tailcall_3:OK #45/4 tailcall_4:OK #45/5 tailcall_5:OK #45 tailcalls:OK Summary: 1/5 PASSED, 0 SKIPPED, 0 FAILED
I've also verified the JITed dump after each of the rewrite cases that it matches expectations.
Also regular test_verifier suite passes fine which contains further tail call tests:
# ./test_verifier [...] Summary: 1563 PASSED, 0 SKIPPED, 0 FAILED
Checked under JIT, interpreter and JIT + hardening.
--- .../selftests/bpf/prog_tests/tailcalls.c | 487 ++++++++++++++++++ tools/testing/selftests/bpf/progs/tailcall1.c | 48 ++ tools/testing/selftests/bpf/progs/tailcall2.c | 59 +++ tools/testing/selftests/bpf/progs/tailcall3.c | 31 ++ tools/testing/selftests/bpf/progs/tailcall4.c | 33 ++ tools/testing/selftests/bpf/progs/tailcall5.c | 40 ++ 6 files changed, 698 insertions(+) create mode 100644 tools/testing/selftests/bpf/prog_tests/tailcalls.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall1.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall2.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall3.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall4.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall5.c
tools/testing/selftests/bpf/prog_tests/tailcalls.c new file +487 -0
@@ -0,0 +1,487 @@ +// SPDX-License-Identifier: GPL-2.0 +#include <test_progs.h> + +/* test_tailcall_1 checks basic functionality by patching multiple locations +* in a single program for a single tail call slot with nop->jmp, jmp->nop +* and jmp->jmp rewrites. Also checks for nop->nop. +*/ +static void test_tailcall_1 (void ) +{ +int err, map_fd, prog_fd, main_fd, i, j; +struct bpf_map *prog_array; +struct bpf_program *prog; +struct bpf_object *obj; +__u32 retval, duration; +char prog_name[32 ]; +char buff[128 ] = {}; + + err =bpf_prog_load ("tailcall1.o" ,BPF_PROG_TYPE_SCHED_CLS , &obj, + &prog_fd); +if (CHECK_FAIL (err)) +return ; + + prog =bpf_object__find_program_by_title (obj,"classifier" ); +if (CHECK_FAIL (!prog)) + goto out; + + main_fd =bpf_program__fd (prog); +if (CHECK_FAIL (main_fd <0 )) + goto out; + + prog_array =bpf_object__find_map_by_name (obj,"jmp_table" ); +if (CHECK_FAIL (!prog_array)) + goto out; + + map_fd =bpf_map__fd (prog_array); +if (CHECK_FAIL (map_fd <0 )) + goto out; + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { +snprintf (prog_name,sizeof (prog_name),"classifier/%i" , i); + + prog =bpf_object__find_program_by_title (obj, prog_name); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + } + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval != i,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + } + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=3 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { +snprintf (prog_name,sizeof (prog_name),"classifier/%i" , i); + + prog =bpf_object__find_program_by_title (obj, prog_name); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + } + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=0 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + j =bpf_map__def (prog_array)->max_entries -1 - i; +snprintf (prog_name,sizeof (prog_name),"classifier/%i" , j); + + prog =bpf_object__find_program_by_title (obj, prog_name); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + } + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + j =bpf_map__def (prog_array)->max_entries -1 - i; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval != j,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + } + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=3 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err >=0 || errno !=ENOENT )) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=3 ,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + } + +out: +bpf_object__close (obj); +} + +/* test_tailcall_2 checks that patching multiple programs for a single +* tail call slot works. It also jumps through several programs and tests +* the tail call limit counter. +*/ +static void test_tailcall_2 (void ) +{ +int err, map_fd, prog_fd, main_fd, i; +struct bpf_map *prog_array; +struct bpf_program *prog; +struct bpf_object *obj; +__u32 retval, duration; +char prog_name[32 ]; +char buff[128 ] = {}; + + err =bpf_prog_load ("tailcall2.o" ,BPF_PROG_TYPE_SCHED_CLS , &obj, + &prog_fd); +if (CHECK_FAIL (err)) +return ; + + prog =bpf_object__find_program_by_title (obj,"classifier" ); +if (CHECK_FAIL (!prog)) + goto out; + + main_fd =bpf_program__fd (prog); +if (CHECK_FAIL (main_fd <0 )) + goto out; + + prog_array =bpf_object__find_map_by_name (obj,"jmp_table" ); +if (CHECK_FAIL (!prog_array)) + goto out; + + map_fd =bpf_map__fd (prog_array); +if (CHECK_FAIL (map_fd <0 )) + goto out; + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { +snprintf (prog_name,sizeof (prog_name),"classifier/%i" , i); + + prog =bpf_object__find_program_by_title (obj, prog_name); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + } + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=2 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); + + i =2 ; + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=1 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); + + i =0 ; + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=3 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); +out: +bpf_object__close (obj); +} + +/* test_tailcall_3 checks that the count value of the tail call limit +* enforcement matches with expectations. +*/ +static void test_tailcall_3 (void ) +{ +int err, map_fd, prog_fd, main_fd, data_fd, i, val; +struct bpf_map *prog_array, *data_map; +struct bpf_program *prog; +struct bpf_object *obj; +__u32 retval, duration; +char buff[128 ] = {}; + + err =bpf_prog_load ("tailcall3.o" ,BPF_PROG_TYPE_SCHED_CLS , &obj, + &prog_fd); +if (CHECK_FAIL (err)) +return ; + + prog =bpf_object__find_program_by_title (obj,"classifier" ); +if (CHECK_FAIL (!prog)) + goto out; + + main_fd =bpf_program__fd (prog); +if (CHECK_FAIL (main_fd <0 )) + goto out; + + prog_array =bpf_object__find_map_by_name (obj,"jmp_table" ); +if (CHECK_FAIL (!prog_array)) + goto out; + + map_fd =bpf_map__fd (prog_array); +if (CHECK_FAIL (map_fd <0 )) + goto out; + + prog =bpf_object__find_program_by_title (obj,"classifier/0" ); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + i =0 ; + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=1 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); + + data_map =bpf_object__find_map_by_name (obj,"tailcall.bss" ); +if (CHECK_FAIL (!data_map || !bpf_map__is_internal (data_map))) +return ; + + data_fd =bpf_map__fd (data_map); +if (CHECK_FAIL (map_fd <0 )) +return ; + + i =0 ; + err =bpf_map_lookup_elem (data_fd, &i, &val); +CHECK (err || val !=33 ,"tailcall count" ,"err %d errno %d count %d\n" , + err, errno, val); + + i =0 ; + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=0 ,"tailcall" ,"err %d errno %d retval %d\n" , + err, errno, retval); +out: +bpf_object__close (obj); +} + +/* test_tailcall_4 checks that the kernel properly selects indirect jump +* for the case where the key is not known. Latter is passed via global +* data to select different targets we can compare return value of. +*/ +static void test_tailcall_4 (void ) +{ +int err, map_fd, prog_fd, main_fd, data_fd, i; +struct bpf_map *prog_array, *data_map; +struct bpf_program *prog; +struct bpf_object *obj; +__u32 retval, duration; +static const int zero =0 ; +char buff[128 ] = {}; +char prog_name[32 ]; + + err =bpf_prog_load ("tailcall4.o" ,BPF_PROG_TYPE_SCHED_CLS , &obj, + &prog_fd); +if (CHECK_FAIL (err)) +return ; + + prog =bpf_object__find_program_by_title (obj,"classifier" ); +if (CHECK_FAIL (!prog)) + goto out; + + main_fd =bpf_program__fd (prog); +if (CHECK_FAIL (main_fd <0 )) + goto out; + + prog_array =bpf_object__find_map_by_name (obj,"jmp_table" ); +if (CHECK_FAIL (!prog_array)) + goto out; + + map_fd =bpf_map__fd (prog_array); +if (CHECK_FAIL (map_fd <0 )) + goto out; + + data_map =bpf_object__find_map_by_name (obj,"tailcall.bss" ); +if (CHECK_FAIL (!data_map || !bpf_map__is_internal (data_map))) +return ; + + data_fd =bpf_map__fd (data_map); +if (CHECK_FAIL (map_fd <0 )) +return ; + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { +snprintf (prog_name,sizeof (prog_name),"classifier/%i" , i); + + prog =bpf_object__find_program_by_title (obj, prog_name); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + } + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + err =bpf_map_update_elem (data_fd, &zero, &i,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval != i,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + } + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + err =bpf_map_update_elem (data_fd, &zero, &i,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=3 ,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + } +out: +bpf_object__close (obj); +} + +/* test_tailcall_5 probes similarly to test_tailcall_4 that the kernel generates +* an indirect jump when the keys are const but different from different branches. +*/ +static void test_tailcall_5 (void ) +{ +int err, map_fd, prog_fd, main_fd, data_fd, i, key[] = {1111 ,1234 ,5678 }; +struct bpf_map *prog_array, *data_map; +struct bpf_program *prog; +struct bpf_object *obj; +__u32 retval, duration; +static const int zero =0 ; +char buff[128 ] = {}; +char prog_name[32 ]; + + err =bpf_prog_load ("tailcall5.o" ,BPF_PROG_TYPE_SCHED_CLS , &obj, + &prog_fd); +if (CHECK_FAIL (err)) +return ; + + prog =bpf_object__find_program_by_title (obj,"classifier" ); +if (CHECK_FAIL (!prog)) + goto out; + + main_fd =bpf_program__fd (prog); +if (CHECK_FAIL (main_fd <0 )) + goto out; + + prog_array =bpf_object__find_map_by_name (obj,"jmp_table" ); +if (CHECK_FAIL (!prog_array)) + goto out; + + map_fd =bpf_map__fd (prog_array); +if (CHECK_FAIL (map_fd <0 )) + goto out; + + data_map =bpf_object__find_map_by_name (obj,"tailcall.bss" ); +if (CHECK_FAIL (!data_map || !bpf_map__is_internal (data_map))) +return ; + + data_fd =bpf_map__fd (data_map); +if (CHECK_FAIL (map_fd <0 )) +return ; + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { +snprintf (prog_name,sizeof (prog_name),"classifier/%i" , i); + + prog =bpf_object__find_program_by_title (obj, prog_name); +if (CHECK_FAIL (!prog)) + goto out; + + prog_fd =bpf_program__fd (prog); +if (CHECK_FAIL (prog_fd <0 )) + goto out; + + err =bpf_map_update_elem (map_fd, &i, &prog_fd,BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + } + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + err =bpf_map_update_elem (data_fd, &zero, &key[i],BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval != i,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + } + +for (i =0 ; i <bpf_map__def (prog_array)->max_entries; i++) { + err =bpf_map_update_elem (data_fd, &zero, &key[i],BPF_ANY ); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_map_delete_elem (map_fd, &i); +if (CHECK_FAIL (err)) + goto out; + + err =bpf_prog_test_run (main_fd,1 , buff,sizeof (buff),0 , + &duration, &retval,NULL ); +CHECK (err || retval !=3 ,"tailcall" , +"err %d errno %d retval %d\n" , err, errno, retval); + } +out: +bpf_object__close (obj); +} + +void test_tailcalls (void ) +{ +if (test__start_subtest ("tailcall_1" )) +test_tailcall_1 (); +if (test__start_subtest ("tailcall_2" )) +test_tailcall_2 (); +if (test__start_subtest ("tailcall_3" )) +test_tailcall_3 (); +if (test__start_subtest ("tailcall_4" )) +test_tailcall_4 (); +if (test__start_subtest ("tailcall_5" )) +test_tailcall_5 (); +}
tools/testing/selftests/bpf/progs/tailcall1.c new file +48 -0
48 lines not on this page · raw message
tools/testing/selftests/bpf/progs/tailcall2.c new file +59 -0
59 lines not on this page · raw message
tools/testing/selftests/bpf/progs/tailcall3.c new file +31 -0
@@ -0,0 +1,31 @@ +// SPDX-License-Identifier: GPL-2.0 +#include <linux/bpf.h> + +#include "bpf_helpers.h" + +struct { + __uint(type, BPF_MAP_TYPE_PROG_ARRAY); + __uint(max_entries, 1); + __uint(key_size, sizeof(__u32)); + __uint(value_size, sizeof(__u32)); +} jmp_table SEC(".maps"); + +static volatile int count; + +SEC("classifier/0") +int bpf_func_0 (struct __sk_buff *skb) +{ + count++; +bpf_tail_call (skb, &jmp_table,0 ); +return 1 ; +} + +SEC("classifier") +int entry (struct __sk_buff *skb) +{ +bpf_tail_call (skb, &jmp_table,0 ); +return 0 ; +} + +char __license[] SEC("license") = "GPL"; +int _version SEC("version") = 1;
tools/testing/selftests/bpf/progs/tailcall4.c new file +33 -0
@@ -0,0 +1,33 @@ +// SPDX-License-Identifier: GPL-2.0 +#include <linux/bpf.h> + +#include "bpf_helpers.h" + +struct { + __uint(type, BPF_MAP_TYPE_PROG_ARRAY); + __uint(max_entries, 3); + __uint(key_size, sizeof(__u32)); + __uint(value_size, sizeof(__u32)); +} jmp_table SEC(".maps"); + +static volatile int selector; + +#define TAIL_FUNC (x) \ + SEC("classifier/" #x) \ + int bpf_func_##x(struct __sk_buff *skb) \ + { \ + return x; \ + } +TAIL_FUNC(0) +TAIL_FUNC(1) +TAIL_FUNC(2) + +SEC("classifier") +int entry (struct __sk_buff *skb) +{ +bpf_tail_call (skb, &jmp_table, selector); +return 3 ; +} + +char __license[] SEC("license") = "GPL"; +int _version SEC("version") = 1;
tools/testing/selftests/bpf/progs/tailcall5.c new file +40 -0
@@ -0,0 +1,40 @@ +// SPDX-License-Identifier: GPL-2.0 +#include <linux/bpf.h> + +#include "bpf_helpers.h" + +struct { + __uint(type, BPF_MAP_TYPE_PROG_ARRAY); + __uint(max_entries, 3); + __uint(key_size, sizeof(__u32)); + __uint(value_size, sizeof(__u32)); +} jmp_table SEC(".maps"); + +static volatile int selector; + +#define TAIL_FUNC (x) \ + SEC("classifier/" #x) \ + int bpf_func_##x(struct __sk_buff *skb) \ + { \ + return x; \ + } +TAIL_FUNC(0) +TAIL_FUNC(1) +TAIL_FUNC(2) + +SEC("classifier") +int entry (struct __sk_buff *skb) +{ +int idx =0 ; + +if (selector ==1234 ) + idx =1 ; +else if (selector ==5678 ) + idx =2 ; + +bpf_tail_call (skb, &jmp_table, idx); +return 3 ; +} + +char __license[] SEC("license") = "GPL"; +int _version SEC("version") = 1;
Signature · 1 line
2.21.0
Re: [PATCH bpf-next v2 8/8] bpf, testing: add various tail call test cases
Quoted 20 lines · Daniel Borkmann
Add several BPF kselftest cases for tail calls which test the various patch directions, and that multiple locations are patched in same and different programs.
# ./test_progs -n 45 #45/1 tailcall_1:OK #45/2 tailcall_2:OK #45/3 tailcall_3:OK #45/4 tailcall_4:OK #45/5 tailcall_5:OK #45 tailcalls:OK Summary: 1/5 PASSED, 0 SKIPPED, 0 FAILEDI've also verified the JITed dump after each of the rewrite cases that it matches expectations.
Also regular
test_verifiersuite passes fine which contains further tail call tests:
Quoted 8 lines
# ./test_verifier [...] Summary: 1563 PASSED, 0 SKIPPED, 0 FAILEDChecked under JIT, interpreter and JIT + hardening.
Signed-off-by Daniel Borkmann <[email protected]>---
LGTM. Thanks for adding more tests!
Quoted 14 lines
.../selftests/bpf/prog_tests/tailcalls.c | 487 ++++++++++++++++++ tools/testing/selftests/bpf/progs/tailcall1.c | 48 ++ tools/testing/selftests/bpf/progs/tailcall2.c | 59 +++ tools/testing/selftests/bpf/progs/tailcall3.c | 31 ++ tools/testing/selftests/bpf/progs/tailcall4.c | 33 ++ tools/testing/selftests/bpf/progs/tailcall5.c | 40 ++ 6 files changed, 698 insertions(+) create mode 100644 tools/testing/selftests/bpf/prog_tests/tailcalls.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall1.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall2.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall3.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall4.c create mode 100644 tools/testing/selftests/bpf/progs/tailcall5.c
[...]
Alexei Starovoitov
AppliedQuoted 25 lines · Daniel Borkmann
This gets rid of indirect jumps for BPF tail calls whenever possible. The series adds emission for *direct* jumps for tail call maps in order to avoid the retpoline overhead from
a493a87f38cf("bpf, x64: implement retpoline for tail call") for situations that allow for it, meaning, for known constant keys at verification time which are used as index into the tail call map. See patch 7/8 for more general details.Thanks!
v1 -> v2:
- added more test cases
- u8ip_stable-> bool (Andrii)
- removed bpf_map_poke_{un,}lock and simplified the code (Andrii)
- added break intoprog_array_map_poke_untracksince there's just one prog (Andrii)
- fixed typo: for for in commit msg (Andrii)
- reworked__bpf_arch_text_poke(Andrii)
- added subtests, and comment on tests themselves, NULL-NULL transistion (Andrii)
- in constant map key tracking I've moved themap_poke_trackcallback to once we've finished creating the poke tab as otherwise concurrent access from tail call map would blow up (since we realloc the table)
rfc -> v1:
- Applied Alexei's and Andrii's feeback from
Quoted 1 line
https://lore.kernel.org/bpf/[email protected]/T/#t
Applied. Thanks!