Home
last modified time | relevance | path

Searched refs:nr_off (Results 1 – 3 of 3) sorted by relevance

/kernel/bpf/
Dsyscall.c522 return bsearch(&offset, tab->off, tab->nr_off, sizeof(tab->off[0]), bpf_map_kptr_off_cmp); in bpf_map_kptr_off_contains()
532 for (i = 0; i < tab->nr_off; i++) { in bpf_map_free_kptr_off_tab()
548 size = offsetof(struct bpf_map_value_off, off[tab->nr_off]); in bpf_map_copy_kptr_off_tab()
553 for (i = 0; i < tab->nr_off; i++) { in bpf_map_copy_kptr_off_tab()
578 if (tab_a->nr_off != tab_b->nr_off) in bpf_map_equal_kptr_off_tab()
580 size = offsetof(struct bpf_map_value_off, off[tab_a->nr_off]); in bpf_map_equal_kptr_off_tab()
595 for (i = 0; i < tab->nr_off; i++) { in bpf_map_free_kptrs()
975 for (i = 0; i < tab->nr_off; i++) { in bpf_map_alloc_off_arr()
979 off_arr->cnt += tab->nr_off; in bpf_map_alloc_off_arr()
Dbtf.c3440 int ret, i, nr_off; in btf_parse_kptrs() local
3448 nr_off = ret; in btf_parse_kptrs()
3449 tab = kzalloc(offsetof(struct bpf_map_value_off, off[nr_off]), GFP_KERNEL | __GFP_NOWARN); in btf_parse_kptrs()
3453 for (i = 0; i < nr_off; i++) { in btf_parse_kptrs()
3519 tab->nr_off = nr_off; in btf_parse_kptrs()
Dverifier.c4095 for (i = 0; i < tab->nr_off; i++) { in check_map_access()