Home
last modified time | relevance | path

Searched refs:elem_sz (Results 1 - 3 of 3) sorted by relevance

/third_party/libbpf/src/
H A Dlibbpf_internal.h312 void *libbpf_add_mem(void **data, size_t *cap_cnt, size_t elem_sz,
314 int libbpf_ensure_mem(void **data, size_t *cap_cnt, size_t elem_sz, size_t need_cnt);
H A Dbtf.c136 * capacity of *cap_cnt* elements each taking *elem_sz* bytes has enough
145 void *libbpf_add_mem(void **data, size_t *cap_cnt, size_t elem_sz, in libbpf_add_mem() argument
152 return *data + cur_cnt * elem_sz; in libbpf_add_mem()
167 new_data = libbpf_reallocarray(*data, new_cnt, elem_sz); in libbpf_add_mem()
172 memset(new_data + (*cap_cnt) * elem_sz, 0, (new_cnt - *cap_cnt) * elem_sz); in libbpf_add_mem()
176 return new_data + cur_cnt * elem_sz; in libbpf_add_mem()
180 * to accommodate *need_cnt* elements of size *elem_sz* bytes each
182 int libbpf_ensure_mem(void **data, size_t *cap_cnt, size_t elem_sz, size_t need_cnt) in libbpf_ensure_mem() argument
189 p = libbpf_add_mem(data, cap_cnt, elem_sz, *cap_cn in libbpf_ensure_mem()
[all...]
H A Dlibbpf.c10284 size_t elem_sz = roundup(map->def.value_size, 8); local
10286 if (value_sz != num_cpu * elem_sz) {
10288 map->name, value_sz, num_cpu, elem_sz, num_cpu * elem_sz);

Completed in 21 milliseconds