Searched refs:num_entries (Results 1 – 2 of 2) sorted by relevance
| /kernel/kcsan/ |
| D | report.c | 277 static int get_stack_skipnr(const unsigned long stack_entries[], int num_entries) in get_stack_skipnr() argument
283 for (skip = 0; skip < num_entries; ++skip) { in get_stack_skipnr()
315 replace_stack_entry(unsigned long stack_entries[], int num_entries, unsigned long ip, in replace_stack_entry() argument
327 for (skip = 0; skip < num_entries; ++skip) { in replace_stack_entry()
344 return get_stack_skipnr(stack_entries, num_entries); in replace_stack_entry()
348 sanitize_stack_entries(unsigned long stack_entries[], int num_entries, unsigned long ip, in sanitize_stack_entries() argument
351 return ip ? replace_stack_entry(stack_entries, num_entries, ip, replaced) : in sanitize_stack_entries()
352 get_stack_skipnr(stack_entries, num_entries); in sanitize_stack_entries()
368 print_stack_trace(unsigned long stack_entries[], int num_entries, unsigned long reordered_to) in print_stack_trace() argument
370 stack_trace_print(stack_entries, num_entries, 0); in print_stack_trace()
|
| /kernel/bpf/ |
| D | hashtab.c | 225 u32 num_entries = htab->map.max_entries; in htab_free_prealloced_timers() local
231 num_entries += num_possible_cpus(); in htab_free_prealloced_timers()
233 for (i = 0; i < num_entries; i++) { in htab_free_prealloced_timers()
246 u32 num_entries = htab->map.max_entries; in htab_free_prealloced_kptrs() local
252 num_entries += num_possible_cpus(); in htab_free_prealloced_kptrs()
254 for (i = 0; i < num_entries; i++) { in htab_free_prealloced_kptrs()
310 u32 num_entries = htab->map.max_entries; in prealloc_init() local
314 num_entries += num_possible_cpus(); in prealloc_init()
316 htab->elems = bpf_map_area_alloc((u64)htab->elem_size * num_entries, in prealloc_init()
324 for (i = 0; i < num_entries; i++) { in prealloc_init()
[all …]
|