Home
last modified time | relevance | path

Searched refs:nr_entries (Results 1 - 25 of 326) sorted by relevance

12345678910>>...14

/kernel/linux/linux-5.10/drivers/lightnvm/
H A Dpblk-rb.c48 static unsigned int pblk_rb_calculate_size(unsigned int nr_entries, in pblk_rb_calculate_size() argument
52 unsigned int max_sz = max(thr_sz, nr_entries); in pblk_rb_calculate_size()
81 unsigned int nr_entries; in pblk_rb_init() local
83 nr_entries = pblk_rb_calculate_size(size, threshold); in pblk_rb_init()
84 entries = vzalloc(array_size(nr_entries, sizeof(struct pblk_rb_entry))); in pblk_rb_init()
88 power_size = get_count_order(nr_entries); in pblk_rb_init()
94 rb->nr_entries = (1 << power_size); in pblk_rb_init()
165 pblk_rl_init(&pblk->rl, rb->nr_entries, threshold); in pblk_rb_init()
197 return pblk_rb_ring_space(rb, mem, sync, rb->nr_entries); in pblk_rb_space()
201 unsigned int nr_entries) in pblk_rb_ptr_wrap()
200 pblk_rb_ptr_wrap(struct pblk_rb *rb, unsigned int p, unsigned int nr_entries) pblk_rb_ptr_wrap() argument
226 pblk_rb_read_commit(struct pblk_rb *rb, unsigned int nr_entries) pblk_rb_read_commit() argument
279 pblk_rb_update_l2p(struct pblk_rb *rb, unsigned int nr_entries, unsigned int mem, unsigned int sync) pblk_rb_update_l2p() argument
418 __pblk_rb_may_write(struct pblk_rb *rb, unsigned int nr_entries, unsigned int *pos) __pblk_rb_may_write() argument
441 pblk_rb_may_write(struct pblk_rb *rb, unsigned int nr_entries, unsigned int *pos) pblk_rb_may_write() argument
463 pblk_rb_may_write_flush(struct pblk_rb *rb, unsigned int nr_entries, unsigned int *pos, struct bio *bio, int *io_ret) pblk_rb_may_write_flush() argument
494 pblk_rb_may_write_user(struct pblk_rb *rb, struct bio *bio, unsigned int nr_entries, unsigned int *pos) pblk_rb_may_write_user() argument
521 pblk_rb_may_write_gc(struct pblk_rb *rb, unsigned int nr_entries, unsigned int *pos) pblk_rb_may_write_gc() argument
550 pblk_rb_read_to_bio(struct pblk_rb *rb, struct nvm_rq *rqd, unsigned int pos, unsigned int nr_entries, unsigned int count) pblk_rb_read_to_bio() argument
713 pblk_rb_sync_advance(struct pblk_rb *rb, unsigned int nr_entries) pblk_rb_sync_advance() argument
[all...]
H A Dpblk-cache.c28 int nr_entries = pblk_get_secs(bio); in pblk_write_to_cache() local
38 ret = pblk_rb_may_write_user(&pblk->rwb, bio, nr_entries, &bpos); in pblk_write_to_cache()
59 for (i = 0; i < nr_entries; i++) { in pblk_write_to_cache()
70 atomic64_add(nr_entries, &pblk->user_wa); in pblk_write_to_cache()
73 atomic_long_add(nr_entries, &pblk->inflight_writes); in pblk_write_to_cache()
74 atomic_long_add(nr_entries, &pblk->req_writes); in pblk_write_to_cache()
77 pblk_rl_inserted(&pblk->rl, nr_entries); in pblk_write_to_cache()
H A Dpblk-rl.c36 int pblk_rl_user_may_insert(struct pblk_rl *rl, int nr_entries) in pblk_rl_user_may_insert() argument
41 if (unlikely(rb_space >= 0) && (rb_space - nr_entries < 0)) in pblk_rl_user_may_insert()
50 void pblk_rl_inserted(struct pblk_rl *rl, int nr_entries) in pblk_rl_inserted() argument
55 atomic_sub(nr_entries, &rl->rb_space); in pblk_rl_inserted()
58 int pblk_rl_gc_may_insert(struct pblk_rl *rl, int nr_entries) in pblk_rl_gc_may_insert() argument
68 void pblk_rl_user_in(struct pblk_rl *rl, int nr_entries) in pblk_rl_user_in() argument
70 atomic_add(nr_entries, &rl->rb_user_cnt); in pblk_rl_user_in()
87 void pblk_rl_gc_in(struct pblk_rl *rl, int nr_entries) in pblk_rl_gc_in() argument
89 atomic_add(nr_entries, &rl->rb_gc_cnt); in pblk_rl_gc_in()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_iext_tree.c454 int *nr_entries) in xfs_iext_split_node()
466 *nr_entries = 0; in xfs_iext_split_node()
482 *nr_entries = nr_move; in xfs_iext_split_node()
484 *nr_entries = nr_keep; in xfs_iext_split_node()
500 int i, pos, nr_entries; in xfs_iext_insert_node() local
509 nr_entries = xfs_iext_node_nr_entries(node, pos); in xfs_iext_insert_node()
511 ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0); in xfs_iext_insert_node()
512 ASSERT(nr_entries <= KEYS_PER_NODE); in xfs_iext_insert_node()
514 if (nr_entries == KEYS_PER_NODE) in xfs_iext_insert_node()
515 new = xfs_iext_split_node(&node, &pos, &nr_entries); in xfs_iext_insert_node()
451 xfs_iext_split_node( struct xfs_iext_node **nodep, int *pos, int *nr_entries) xfs_iext_split_node() argument
540 xfs_iext_split_leaf( struct xfs_iext_cursor *cur, int *nr_entries) xfs_iext_split_leaf() argument
634 int nr_entries, i; xfs_iext_insert() local
672 xfs_iext_rebalance_node( struct xfs_iext_node *parent, int *pos, struct xfs_iext_node *node, int nr_entries) xfs_iext_rebalance_node() argument
729 int level = 2, pos, nr_entries, i; xfs_iext_remove_node() local
788 xfs_iext_rebalance_leaf( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_iext_leaf *leaf, xfs_fileoff_t offset, int nr_entries) xfs_iext_rebalance_leaf() argument
870 int i, nr_entries; xfs_iext_remove() local
[all...]
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_iext_tree.c454 int *nr_entries) in xfs_iext_split_node()
466 *nr_entries = 0; in xfs_iext_split_node()
482 *nr_entries = nr_move; in xfs_iext_split_node()
484 *nr_entries = nr_keep; in xfs_iext_split_node()
500 int i, pos, nr_entries; in xfs_iext_insert_node() local
509 nr_entries = xfs_iext_node_nr_entries(node, pos); in xfs_iext_insert_node()
511 ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0); in xfs_iext_insert_node()
512 ASSERT(nr_entries <= KEYS_PER_NODE); in xfs_iext_insert_node()
514 if (nr_entries == KEYS_PER_NODE) in xfs_iext_insert_node()
515 new = xfs_iext_split_node(&node, &pos, &nr_entries); in xfs_iext_insert_node()
451 xfs_iext_split_node( struct xfs_iext_node **nodep, int *pos, int *nr_entries) xfs_iext_split_node() argument
540 xfs_iext_split_leaf( struct xfs_iext_cursor *cur, int *nr_entries) xfs_iext_split_leaf() argument
634 int nr_entries, i; xfs_iext_insert() local
672 xfs_iext_rebalance_node( struct xfs_iext_node *parent, int *pos, struct xfs_iext_node *node, int nr_entries) xfs_iext_rebalance_node() argument
729 int level = 2, pos, nr_entries, i; xfs_iext_remove_node() local
788 xfs_iext_rebalance_leaf( struct xfs_ifork *ifp, struct xfs_iext_cursor *cur, struct xfs_iext_leaf *leaf, xfs_fileoff_t offset, int nr_entries) xfs_iext_rebalance_leaf() argument
870 int i, nr_entries; xfs_iext_remove() local
[all...]
/kernel/linux/linux-5.10/arch/loongarch/kernel/
H A Dstacktrace.c23 if (trace->nr_entries >= trace->max_entries) in consume_entry()
31 trace->entries[trace->nr_entries++] = addr; in consume_entry()
32 return trace->nr_entries < trace->max_entries; in consume_entry()
80 WARN_ON(trace->nr_entries || !trace->max_entries); in save_stack_trace()
92 WARN_ON(trace->nr_entries || !trace->max_entries); in save_stack_trace_regs()
103 WARN_ON(trace->nr_entries || !trace->max_entries); in save_stack_trace_tsk()
205 if (trace->nr_entries < trace->max_entries) in __save_stack_trace_user()
206 trace->entries[trace->nr_entries++] = regs->csr_era; in __save_stack_trace_user()
208 while (trace->nr_entries < trace->max_entries && fp && !((unsigned long)fp & 0xf)) { in __save_stack_trace_user()
217 trace->entries[trace->nr_entries in __save_stack_trace_user()
[all...]
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-remove.c19 * (MIN_ENTRIES <= nr_entries <= MAX_ENTRIES).
58 uint32_t nr_entries = le32_to_cpu(n->header.nr_entries); in node_shift() local
63 BUG_ON(shift > nr_entries); in node_shift()
67 (nr_entries - shift) * sizeof(__le64)); in node_shift()
70 (nr_entries - shift) * value_size); in node_shift()
72 BUG_ON(nr_entries + shift > le32_to_cpu(n->header.max_entries)); in node_shift()
75 nr_entries * sizeof(__le64)); in node_shift()
78 nr_entries * value_size); in node_shift()
84 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in node_copy()
113 unsigned nr_entries = le32_to_cpu(n->header.nr_entries); delete_at() local
[all...]
H A Ddm-btree.c43 int lo = -1, hi = le32_to_cpu(n->header.nr_entries); in bsearch()
75 uint32_t nr_entries = le32_to_cpu(n->header.nr_entries); in inc_children() local
78 for (i = 0; i < nr_entries; i++) in inc_children()
81 for (i = 0; i < nr_entries; i++) in inc_children()
89 uint32_t nr_entries = le32_to_cpu(node->header.nr_entries); in __dm_written_to_disk() local
93 if (index > nr_entries || in __dm_written_to_disk()
95 nr_entries >= max_entries) { in __dm_written_to_disk()
103 array_insert(node->keys, sizeof(*node->keys), nr_entries, inde in __dm_written_to_disk()
104 array_insert(value_base(node), value_size, nr_entries, index, value); __dm_written_to_disk() local
351 uint32_t flags, nr_entries; btree_lookup_raw() local
426 uint32_t flags, nr_entries; dm_btree_lookup_next_single() local
[all...]
H A Ddm-array.c26 __le32 nr_entries; member
113 unsigned i, nr_entries = le32_to_cpu(ab->nr_entries); in on_entries() local
115 for (i = 0; i < nr_entries; i++) in on_entries()
164 (*ab)->nr_entries = cpu_to_le32(0); in alloc_ablock()
179 uint32_t nr_entries; in fill_ablock() local
183 BUG_ON(new_nr < le32_to_cpu(ab->nr_entries)); in fill_ablock()
185 nr_entries = le32_to_cpu(ab->nr_entries); in fill_ablock()
186 for (i = nr_entries; in fill_ablock()
203 uint32_t nr_entries; trim_ablock() local
862 unsigned nr_entries, max_entries; walk_ablock() local
[all...]
/kernel/linux/linux-5.10/drivers/dma/dw-edma/
H A Ddw-edma-v0-debugfs.c98 int nr_entries, struct dentry *dir) in dw_edma_debugfs_create_x32()
102 for (i = 0; i < nr_entries; i++) { in dw_edma_debugfs_create_x32()
112 int nr_entries; in dw_edma_debugfs_regs_ch() local
125 nr_entries = ARRAY_SIZE(debugfs_regs); in dw_edma_debugfs_regs_ch()
126 dw_edma_debugfs_create_x32(debugfs_regs, nr_entries, dir); in dw_edma_debugfs_regs_ch()
167 int nr_entries, i; in dw_edma_debugfs_regs_wr() local
174 nr_entries = ARRAY_SIZE(debugfs_regs); in dw_edma_debugfs_regs_wr()
175 dw_edma_debugfs_create_x32(debugfs_regs, nr_entries, regs_dir); in dw_edma_debugfs_regs_wr()
178 nr_entries = ARRAY_SIZE(debugfs_unroll_regs); in dw_edma_debugfs_regs_wr()
179 dw_edma_debugfs_create_x32(debugfs_unroll_regs, nr_entries, in dw_edma_debugfs_regs_wr()
97 dw_edma_debugfs_create_x32(const struct debugfs_entries entries[], int nr_entries, struct dentry *dir) dw_edma_debugfs_create_x32() argument
236 int nr_entries, i; dw_edma_debugfs_regs_rd() local
273 int nr_entries; dw_edma_debugfs_regs() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dstackdepot.c359 unsigned int nr_entries, in __stack_depot_save()
377 nr_entries = filter_irq_stacks(entries, nr_entries); in __stack_depot_save()
379 if (unlikely(nr_entries == 0) || stack_depot_disabled) in __stack_depot_save()
382 hash = hash_stack(entries, nr_entries); in __stack_depot_save()
390 found = find_stack(smp_load_acquire(bucket), entries, nr_entries, hash); in __stack_depot_save()
417 found = find_stack(*bucket, entries, nr_entries, hash); in __stack_depot_save()
420 depot_alloc_stack(entries, nr_entries, hash, &prealloc); in __stack_depot_save()
453 unsigned int nr_entries, in stack_depot_save()
456 return __stack_depot_save(entries, nr_entries, alloc_flag in stack_depot_save()
358 __stack_depot_save(unsigned long *entries, unsigned int nr_entries, gfp_t alloc_flags, bool can_alloc) __stack_depot_save() argument
452 stack_depot_save(unsigned long *entries, unsigned int nr_entries, gfp_t alloc_flags) stack_depot_save() argument
501 unsigned int nr_entries; stack_depot_print() local
513 unsigned int nr_entries; stack_depot_snprint() local
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/
H A De820.c82 for (i = 0; i < table->nr_entries; i++) { in _e820__mapped_any()
117 for (i = 0; i < e820_table->nr_entries; i++) { in __e820__mapped_all()
168 int x = table->nr_entries; in __e820__range_add()
179 table->nr_entries++; in __e820__range_add()
207 for (i = 0; i < e820_table->nr_entries; i++) { in e820__print_table()
227 * e820_entry' which on entry has elements in the range [0, *nr_entries)
232 * The integer pointed to by nr_entries must be valid on entry (the
234 * sanitizing succeeds the *nr_entries will be updated with the new
332 if (table->nr_entries < 2) in e820__update_table()
335 BUG_ON(table->nr_entries > max_nr_entrie in e820__update_table()
422 __append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) __append_e820_table() argument
453 append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) append_e820_table() argument
[all...]
/kernel/linux/linux-6.6/arch/x86/kernel/
H A De820.c82 for (i = 0; i < table->nr_entries; i++) { in _e820__mapped_any()
117 for (i = 0; i < e820_table->nr_entries; i++) { in __e820__mapped_all()
168 int x = table->nr_entries; in __e820__range_add()
179 table->nr_entries++; in __e820__range_add()
207 for (i = 0; i < e820_table->nr_entries; i++) { in e820__print_table()
227 * e820_entry' which on entry has elements in the range [0, *nr_entries)
232 * The integer pointed to by nr_entries must be valid on entry (the
234 * sanitizing succeeds the *nr_entries will be updated with the new
332 if (table->nr_entries < 2) in e820__update_table()
335 BUG_ON(table->nr_entries > max_nr_entrie in e820__update_table()
422 __append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) __append_e820_table() argument
453 append_e820_table(struct boot_e820_entry *entries, u32 nr_entries) append_e820_table() argument
[all...]
/kernel/linux/linux-6.6/kernel/
H A Dstacktrace.c21 * @nr_entries: Number of entries in the storage array
24 void stack_trace_print(const unsigned long *entries, unsigned int nr_entries, in stack_trace_print() argument
32 for (i = 0; i < nr_entries; i++) in stack_trace_print()
42 * @nr_entries: Number of entries in the storage array
48 unsigned int nr_entries, int spaces) in stack_trace_snprint()
55 for (i = 0; i < nr_entries && size; i++) { in stack_trace_snprint()
277 return trace.nr_entries; in stack_trace_save()
302 return trace.nr_entries; in stack_trace_save_tsk()
324 return trace.nr_entries; in stack_trace_save_regs()
349 return ret ? ret : trace.nr_entries; in stack_trace_save_tsk_reliable()
47 stack_trace_snprint(char *buf, size_t size, const unsigned long *entries, unsigned int nr_entries, int spaces) stack_trace_snprint() argument
390 filter_irq_stacks(unsigned long *entries, unsigned int nr_entries) filter_irq_stacks() argument
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-remove.c23 * (MIN_ENTRIES <= nr_entries <= MAX_ENTRIES).
62 uint32_t nr_entries = le32_to_cpu(n->header.nr_entries); in node_shift() local
67 BUG_ON(shift > nr_entries); in node_shift()
71 (nr_entries - shift) * sizeof(__le64)); in node_shift()
74 (nr_entries - shift) * value_size); in node_shift()
76 BUG_ON(nr_entries + shift > le32_to_cpu(n->header.max_entries)); in node_shift()
79 nr_entries * sizeof(__le64)); in node_shift()
82 nr_entries * value_size); in node_shift()
88 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in node_copy()
131 unsigned int nr_entries = le32_to_cpu(n->header.nr_entries); delete_at() local
[all...]
H A Ddm-array.c27 __le32 nr_entries; member
114 unsigned int nr_entries = le32_to_cpu(ab->nr_entries); in on_entries() local
116 fn(info->value_type.context, element_at(info, ab, 0), nr_entries); in on_entries()
164 (*ab)->nr_entries = cpu_to_le32(0); in alloc_ablock()
178 uint32_t nr_entries, delta, i; in fill_ablock() local
182 BUG_ON(new_nr < le32_to_cpu(ab->nr_entries)); in fill_ablock()
184 nr_entries = le32_to_cpu(ab->nr_entries); in fill_ablock()
185 delta = new_nr - nr_entries; in fill_ablock()
201 uint32_t nr_entries, delta; trim_ablock() local
872 unsigned int nr_entries, max_entries; walk_ablock() local
[all...]
H A Ddm-btree.c46 int lo = -1, hi = le32_to_cpu(n->header.nr_entries); in bsearch()
77 uint32_t nr_entries = le32_to_cpu(n->header.nr_entries); in inc_children() local
80 dm_tm_with_runs(tm, value_ptr(n, 0), nr_entries, dm_tm_inc_range); in inc_children()
83 vt->inc(vt->context, value_ptr(n, 0), nr_entries); in inc_children()
90 uint32_t nr_entries = le32_to_cpu(node->header.nr_entries); in __dm_written_to_disk() local
94 if (index > nr_entries || in __dm_written_to_disk()
96 nr_entries >= max_entries) { in __dm_written_to_disk()
104 array_insert(node->keys, sizeof(*node->keys), nr_entries, inde in __dm_written_to_disk()
105 array_insert(value_base(node), value_size, nr_entries, index, value); __dm_written_to_disk() local
348 uint32_t flags, nr_entries; btree_lookup_raw() local
423 uint32_t flags, nr_entries; dm_btree_lookup_next_single() local
976 unsigned int nr_entries; get_node_free_space() local
[all...]
/kernel/linux/linux-6.6/drivers/dma/dw-edma/
H A Ddw-edma-v0-debugfs.c101 int nr_entries, struct dentry *dent) in dw_edma_debugfs_create_x32()
106 entries = devm_kcalloc(dw->chip->dev, nr_entries, sizeof(*entries), in dw_edma_debugfs_create_x32()
111 for (i = 0; i < nr_entries; i++) { in dw_edma_debugfs_create_x32()
133 int nr_entries; in dw_edma_debugfs_regs_ch() local
135 nr_entries = ARRAY_SIZE(debugfs_regs); in dw_edma_debugfs_regs_ch()
136 dw_edma_debugfs_create_x32(dw, debugfs_regs, nr_entries, dent); in dw_edma_debugfs_regs_ch()
178 int nr_entries, i; in dw_edma_debugfs_regs_wr() local
183 nr_entries = ARRAY_SIZE(debugfs_regs); in dw_edma_debugfs_regs_wr()
184 dw_edma_debugfs_create_x32(dw, debugfs_regs, nr_entries, regs_dent); in dw_edma_debugfs_regs_wr()
187 nr_entries in dw_edma_debugfs_regs_wr()
99 dw_edma_debugfs_create_x32(struct dw_edma *dw, const struct dw_edma_debugfs_entry ini[], int nr_entries, struct dentry *dent) dw_edma_debugfs_create_x32() argument
241 int nr_entries, i; dw_edma_debugfs_regs_rd() local
271 int nr_entries; dw_edma_debugfs_regs() local
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dsyscalltbl.c65 int nr_entries = 0, i, j; in syscalltbl__init_native() local
70 ++nr_entries; in syscalltbl__init_native()
72 entries = tbl->syscalls.entries = malloc(sizeof(struct syscall) * nr_entries); in syscalltbl__init_native()
84 qsort(tbl->syscalls.entries, nr_entries, sizeof(struct syscall), syscallcmp); in syscalltbl__init_native()
85 tbl->syscalls.nr_entries = nr_entries; in syscalltbl__init_native()
116 tbl->syscalls.nr_entries, sizeof(*sc), in syscalltbl__id()
127 for (i = *idx + 1; i < tbl->syscalls.nr_entries; ++i) { in syscalltbl__strglobmatch_next()
/kernel/linux/linux-6.6/tools/perf/util/
H A Dsyscalltbl.c69 int nr_entries = 0, i, j; in syscalltbl__init_native() local
74 ++nr_entries; in syscalltbl__init_native()
76 entries = tbl->syscalls.entries = malloc(sizeof(struct syscall) * nr_entries); in syscalltbl__init_native()
88 qsort(tbl->syscalls.entries, nr_entries, sizeof(struct syscall), syscallcmp); in syscalltbl__init_native()
89 tbl->syscalls.nr_entries = nr_entries; in syscalltbl__init_native()
120 tbl->syscalls.nr_entries, sizeof(*sc), in syscalltbl__id()
131 for (i = *idx + 1; i < tbl->syscalls.nr_entries; ++i) { in syscalltbl__strglobmatch_next()
/kernel/linux/linux-6.6/mm/kmsan/
H A Dreport.c87 unsigned int nr_entries, chained_nr_entries, skipnr; in kmsan_print_origin() local
98 nr_entries = stack_depot_fetch(origin, &entries); in kmsan_print_origin()
100 magic = nr_entries ? entries[0] : 0; in kmsan_print_origin()
101 if ((nr_entries == 4) && (magic == KMSAN_ALLOCA_MAGIC_ORIGIN)) { in kmsan_print_origin()
113 if ((nr_entries == 3) && (magic == KMSAN_CHAIN_MAGIC_ORIGIN)) { in kmsan_print_origin()
137 if (nr_entries) { in kmsan_print_origin()
138 skipnr = get_stack_skipnr(entries, nr_entries); in kmsan_print_origin()
139 stack_trace_print(entries + skipnr, nr_entries - skipnr, in kmsan_print_origin()
/kernel/linux/linux-5.10/mm/
H A Dpage_owner.c63 unsigned int nr_entries; in create_dummy_stack() local
65 nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 0); in create_dummy_stack()
66 return stack_depot_save(entries, nr_entries, GFP_KERNEL); in create_dummy_stack()
108 unsigned int nr_entries, in check_recursive_alloc()
113 for (i = 0; i < nr_entries; i++) { in check_recursive_alloc()
124 unsigned int nr_entries; in save_stack() local
126 nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 2); in save_stack()
136 if (check_recursive_alloc(entries, nr_entries, _RET_IP_)) in save_stack()
139 handle = stack_depot_save(entries, nr_entries, flags); in save_stack()
354 unsigned int nr_entries; in print_page_owner() local
107 check_recursive_alloc(unsigned long *entries, unsigned int nr_entries, unsigned long ip) check_recursive_alloc() argument
419 unsigned int nr_entries; __dump_page_owner() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Dstackdepot.c230 * @nr_entries: Size of the storage array
236 unsigned int nr_entries, in stack_depot_save()
246 if (unlikely(nr_entries == 0)) in stack_depot_save()
249 hash = hash_stack(entries, nr_entries); in stack_depot_save()
258 nr_entries, hash); in stack_depot_save()
286 found = find_stack(*bucket, entries, nr_entries, hash); in stack_depot_save()
289 depot_alloc_stack(entries, nr_entries, in stack_depot_save()
330 unsigned int nr_entries) in filter_irq_stacks()
334 for (i = 0; i < nr_entries; i++) { in filter_irq_stacks()
340 return nr_entries; in filter_irq_stacks()
235 stack_depot_save(unsigned long *entries, unsigned int nr_entries, gfp_t alloc_flags) stack_depot_save() argument
329 filter_irq_stacks(unsigned long *entries, unsigned int nr_entries) filter_irq_stacks() argument
[all...]
/kernel/linux/linux-5.10/kernel/
H A Dstacktrace.c20 * @nr_entries: Number of entries in the storage array
23 void stack_trace_print(const unsigned long *entries, unsigned int nr_entries, in stack_trace_print() argument
31 for (i = 0; i < nr_entries; i++) in stack_trace_print()
41 * @nr_entries: Number of entries in the storage array
47 unsigned int nr_entries, int spaces) in stack_trace_snprint()
54 for (i = 0; i < nr_entries && size; i++) { in stack_trace_snprint()
279 return trace.nr_entries; in stack_trace_save()
304 return trace.nr_entries; in stack_trace_save_tsk()
326 return trace.nr_entries; in stack_trace_save_regs()
351 return ret ? ret : trace.nr_entries; in stack_trace_save_tsk_reliable()
46 stack_trace_snprint(char *buf, size_t size, const unsigned long *entries, unsigned int nr_entries, int spaces) stack_trace_snprint() argument
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/benchs/
H A Dbench_bpf_hashmap_lookup.c24 __u32 nr_entries; member
30 .nr_entries = 500,
49 { "nr_entries", ARG_NR_ENTRIES, "NR_ENTRIES", 0,
88 fprintf(stderr, "invalid nr_entries"); in parse_arg()
91 args.nr_entries = ret; in parse_arg()
121 if (args.nr_entries > args.max_entries) { in validate()
122 fprintf(stderr, "args.nr_entries is too big! (max %u, got %u)\n", in validate()
123 args.max_entries, args.nr_entries); in validate()
171 ctx.skel->bss->nr_entries = args.nr_entries; in setup()
[all...]

Completed in 19 milliseconds

12345678910>>...14