Home
last modified time | relevance | path

Searched refs:nr_entries (Results 1 – 25 of 156) sorted by relevance

1234567

/linux/fs/xfs/libxfs/
H A Dxfs_iext_tree.c461 int *nr_entries) in xfs_iext_split_node() argument
473 *nr_entries = 0; in xfs_iext_split_node()
489 *nr_entries = nr_move; in xfs_iext_split_node()
491 *nr_entries = nr_keep; in xfs_iext_split_node()
507 int i, pos, nr_entries; in xfs_iext_insert_node() local
516 nr_entries = xfs_iext_node_nr_entries(node, pos); in xfs_iext_insert_node()
518 ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0); in xfs_iext_insert_node()
519 ASSERT(nr_entries <= KEYS_PER_NODE); in xfs_iext_insert_node()
521 if (nr_entries == KEYS_PER_NODE) in xfs_iext_insert_node()
522 new = xfs_iext_split_node(&node, &pos, &nr_entries); in xfs_iext_insert_node()
549 xfs_iext_split_leaf(struct xfs_iext_cursor * cur,int * nr_entries) xfs_iext_split_leaf() argument
640 int nr_entries, i; xfs_iext_insert_raw() local
693 xfs_iext_rebalance_node(struct xfs_iext_node * parent,int * pos,struct xfs_iext_node * node,int nr_entries) xfs_iext_rebalance_node() argument
746 int level = 2, pos, nr_entries, i; xfs_iext_remove_node() local
810 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
887 int i, nr_entries; xfs_iext_remove() local
[all...]
/linux/lib/
H A Dstackdepot.c418 static inline size_t depot_stack_record_size(struct stack_record *s, unsigned int nr_entries) in depot_stack_record_size() argument
420 const size_t used = flex_array_size(s, entries, nr_entries); in depot_stack_record_size()
430 depot_alloc_stack(unsigned long *entries, unsigned int nr_entries, u32 hash, depot_flags_t flags, void **prealloc) in depot_alloc_stack() argument
438 if (WARN_ON_ONCE(!nr_entries)) in depot_alloc_stack()
442 if (nr_entries > CONFIG_STACKDEPOT_MAX_FRAMES) in depot_alloc_stack()
443 nr_entries = CONFIG_STACKDEPOT_MAX_FRAMES; in depot_alloc_stack()
453 record_size = depot_stack_record_size(stack, nr_entries); in depot_alloc_stack()
464 stack->size = nr_entries; in depot_alloc_stack()
466 memcpy(stack->entries, entries, flex_array_size(stack, entries, nr_entries)); in depot_alloc_stack()
634 unsigned int nr_entries, in stack_depot_save_flags() argument
736 stack_depot_save(unsigned long * entries,unsigned int nr_entries,gfp_t alloc_flags) stack_depot_save() argument
803 unsigned int nr_entries; stack_depot_print() local
815 unsigned int nr_entries; stack_depot_snprint() local
[all...]
/linux/drivers/dma/dw-edma/
H A Ddw-edma-v0-debugfs.c101 int nr_entries, struct dentry *dent) in dw_edma_debugfs_create_x32() argument
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()
241 int nr_entries, i; dw_edma_debugfs_regs_rd() local
271 int nr_entries; dw_edma_debugfs_regs() local
[all...]
/linux/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() argument
55 for (i = 0; i < nr_entries && size; i++) { in stack_trace_snprint()
278 return trace.nr_entries; in stack_trace_save()
303 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()
392 filter_irq_stacks(unsigned long * entries,unsigned int nr_entries) filter_irq_stacks() argument
[all...]
H A Dbacktracetest.c44 unsigned int nr_entries; in backtrace_test_saved() local
49 nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 0); in backtrace_test_saved()
50 stack_trace_print(entries, nr_entries, 0); in backtrace_test_saved()
/linux/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-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 insert_at() local
94 if (index > nr_entries || in insert_at()
96 nr_entries >= max_entries) { in insert_at()
104 array_insert(node->keys, sizeof(*node->keys), nr_entries, inde in insert_at()
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...]
/linux/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()
206 for (i = 0; i < e820_table->nr_entries; i++) { in e820__print_table()
226 * e820_entry' which on entry has elements in the range [0, *nr_entries)
231 * The integer pointed to by nr_entries must be valid on entry (the
233 * sanitizing succeeds the *nr_entries will be updated with the new
331 if (table->nr_entries < 2) in e820__update_table()
334 BUG_ON(table->nr_entries > max_nr_entrie in e820__update_table()
421 __append_e820_table(struct boot_e820_entry * entries,u32 nr_entries) __append_e820_table() argument
452 append_e820_table(struct boot_e820_entry * entries,u32 nr_entries) append_e820_table() argument
[all...]
H A Dldt.c81 set_ldt(ldt_slot_va(ldt->slot), ldt->nr_entries); in load_mm_ldt()
83 set_ldt(ldt->entries, ldt->nr_entries); in load_mm_ldt()
183 new_ldt->nr_entries = num_entries; in alloc_ldt_struct()
309 nr_pages = DIV_ROUND_UP(ldt->nr_entries * LDT_ENTRY_SIZE, PAGE_SIZE); in map_ldt_struct()
361 nr_pages = DIV_ROUND_UP(ldt->nr_entries * LDT_ENTRY_SIZE, PAGE_SIZE); in unmap_ldt_struct()
418 paravirt_alloc_ldt(ldt->entries, ldt->nr_entries); in finalize_ldt_struct()
439 paravirt_free_ldt(ldt->entries, ldt->nr_entries); in free_ldt_struct()
440 if (ldt->nr_entries * LDT_ENTRY_SIZE > PAGE_SIZE) in free_ldt_struct()
463 new_ldt = alloc_ldt_struct(old_mm->context.ldt->nr_entries); in ldt_dup_context()
470 new_ldt->nr_entries * LDT_ENTRY_SIZ in ldt_dup_context()
[all...]
/linux/tools/perf/ui/browsers/
H A Dannotate-data.c28 int nr_entries; /* # of visible entries: self + descendents */ member
130 bracket->nr_entries = 1; in add_child_entries()
138 entry->nr_entries = 1; in add_child_entries()
148 nr += entry->nr_entries; in count_visible_entries()
165 browser->b.nr_entries = count_visible_entries(browser); in annotated_data_browser__collect_entries()
268 if (uib->nr_entries == 0) in browser__seek()
461 entry->nr_entries = 1; in annotated_data_browser__fold()
470 int nr_entries; in annotated_data_browser__unfold() local
477 nr_entries = 1; /* for self */ in annotated_data_browser__unfold()
482 nr_entries in annotated_data_browser__unfold()
[all...]
/linux/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...]
/linux/arch/mips/kernel/
H A Dstacktrace.c30 trace->entries[trace->nr_entries++] = addr; in save_raw_context_stack()
31 if (trace->nr_entries >= trace->max_entries) in save_raw_context_stack()
58 trace->entries[trace->nr_entries++] = pc; in save_context_stack()
59 if (trace->nr_entries >= trace->max_entries) in save_context_stack()
83 WARN_ON(trace->nr_entries || !trace->max_entries); in save_stack_trace_tsk()
/linux/arch/x86/xen/
H A Dsetup.c166 for (i = 0; i < xen_e820_table.nr_entries; i++, entry++) { in xen_find_pfn_range()
428 for (i = 0; i < xen_e820_table.nr_entries; i++, entry++) { in xen_foreach_remap_area()
430 if (entry->type == E820_TYPE_RAM || i == xen_e820_table.nr_entries - 1) { in xen_foreach_remap_area()
564 for (i = 0; i < xen_e820_table.nr_entries; i++, entry++) { in xen_ignore_unusable()
582 for (mapcnt = 0; mapcnt < xen_e820_table.nr_entries; mapcnt++) { in xen_is_e820_reserved()
607 for (mapcnt = 0; mapcnt < xen_e820_table.nr_entries; mapcnt++, entry++) { in xen_find_free_area()
643 for (mapcnt = 0; mapcnt < xen_e820_table.nr_entries; mapcnt++) { in xen_e820_swap_entry_with_ram()
652 xen_e820_table.nr_entries; in xen_e820_swap_entry_with_ram()
653 xen_e820_table.nr_entries++; in xen_e820_swap_entry_with_ram()
700 for (mapcnt = 0; mapcnt < xen_e820_table.nr_entries; mapcn in xen_e820_resolve_conflicts()
[all...]
/linux/tools/perf/trace/beauty/
H A Dioctl.c41 if (nr < strarray__ioctl_tty_cmd.nr_entries && strarray__ioctl_tty_cmd.entries[nr] != NULL) in ioctl__scnprintf_tty_cmd()
52 if (nr < strarray__drm_ioctl_cmds.nr_entries && strarray__drm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_drm_cmd()
63 if (nr < strarray__sndrv_pcm_ioctl_cmds.nr_entries && strarray__sndrv_pcm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_sndrv_pcm_cmd()
74 if (nr < strarray__sndrv_ctl_ioctl_cmds.nr_entries && strarray__sndrv_ctl_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_sndrv_ctl_cmd()
85 if (nr < strarray__kvm_ioctl_cmds.nr_entries && strarray__kvm_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_kvm_cmd()
98 if (nr < s->nr_entries && s->entries[nr] != NULL) in ioctl__scnprintf_vhost_virtio_cmd()
109 if (nr < strarray__perf_ioctl_cmds.nr_entries && strarray__perf_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_perf_cmd()
120 if (nr < strarray__usbdevfs_ioctl_cmds.nr_entries && strarray__usbdevfs_ioctl_cmds.entries[nr] != NULL) in ioctl__scnprintf_usbdevfs_cmd()
/linux/drivers/md/
H A Ddm-cache-policy-internal.h117 static inline size_t bitset_size_in_bytes(unsigned int nr_entries) in bitset_size_in_bytes() argument
119 return sizeof(unsigned long) * dm_div_up(nr_entries, BITS_PER_LONG); in bitset_size_in_bytes()
122 static inline unsigned long *alloc_bitset(unsigned int nr_entries) in alloc_bitset() argument
124 size_t s = bitset_size_in_bytes(nr_entries); in alloc_bitset()
129 static inline void clear_bitset(void *bitset, unsigned int nr_entries) in clear_bitset() argument
131 size_t s = bitset_size_in_bytes(nr_entries); in clear_bitset()
/linux/arch/sh/kernel/
H A Dstacktrace.c33 if (trace->nr_entries < trace->max_entries) in save_stack_address()
34 trace->entries[trace->nr_entries++] = addr; in save_stack_address()
65 if (trace->nr_entries < trace->max_entries) in save_stack_address_nosched()
66 trace->entries[trace->nr_entries++] = addr; in save_stack_address_nosched()
/linux/tools/perf/ui/
H A Dbrowser.c108 if (browser->nr_entries == 0) in ui_browser__list_head_seek()
326 if (browser->nr_entries > 1) { in ui_browser__scrollbar_set()
328 (browser->nr_entries - 1)); in ui_browser__scrollbar_set()
358 if (browser->nr_entries == 0 && browser->no_samples_msg) in __ui_browser__refresh()
373 * Here we're updating nr_entries _after_ we started browsing, i.e. we have to
378 void ui_browser__update_nr_entries(struct ui_browser *browser, u32 nr_entries) in ui_browser__update_nr_entries() argument
380 off_t offset = nr_entries - browser->nr_entries; in ui_browser__update_nr_entries()
382 browser->nr_entries = nr_entries; in ui_browser__update_nr_entries()
[all...]
/linux/arch/openrisc/kernel/
H A Dstacktrace.c38 if (trace->nr_entries < trace->max_entries) in save_stack_address()
39 trace->entries[trace->nr_entries++] = addr; in save_stack_address()
64 if (trace->nr_entries < trace->max_entries) in save_stack_address_nosched()
65 trace->entries[trace->nr_entries++] = addr; in save_stack_address_nosched()
/linux/include/linux/
H A Dstacktrace.h66 void stack_trace_print(const unsigned long *trace, unsigned int nr_entries,
69 unsigned int nr_entries, int spaces);
78 unsigned int filter_irq_stacks(unsigned long *entries, unsigned int nr_entries);
83 unsigned int nr_entries, max_entries; member
/linux/drivers/net/ethernet/mellanox/mlxsw/
H A Dspectrum1_kvdl.c122 unsigned int entry_index, nr_entries; in mlxsw_sp1_kvdl_part_alloc() local
124 nr_entries = (info->end_index - info->start_index + 1) / in mlxsw_sp1_kvdl_part_alloc()
126 entry_index = find_first_zero_bit(part->usage, nr_entries); in mlxsw_sp1_kvdl_part_alloc()
127 if (entry_index == nr_entries) in mlxsw_sp1_kvdl_part_alloc()
215 unsigned int nr_entries; in mlxsw_sp1_kvdl_part_init() local
226 nr_entries = div_u64(resource_size, info->alloc_size); in mlxsw_sp1_kvdl_part_init()
227 part = kzalloc(struct_size(part, usage, BITS_TO_LONGS(nr_entries)), in mlxsw_sp1_kvdl_part_init()
280 unsigned int nr_entries; in mlxsw_sp1_kvdl_part_occ() local
284 nr_entries = (info->end_index - in mlxsw_sp1_kvdl_part_occ()
287 while ((bit = find_next_bit(part->usage, nr_entries, bi in mlxsw_sp1_kvdl_part_occ()
[all...]
/linux/arch/sparc/kernel/
H A Dstacktrace.c58 trace->entries[trace->nr_entries++] = pc; in __save_stack_trace()
66 if (trace->nr_entries < in __save_stack_trace()
68 trace->entries[trace->nr_entries++] = pc; in __save_stack_trace()
74 } while (trace->nr_entries < trace->max_entries); in __save_stack_trace()
/linux/tools/perf/util/
H A Drblist.h24 unsigned int nr_entries; member
42 return rblist->nr_entries == 0; in rblist__empty()
47 return rblist->nr_entries; in rblist__nr_entries()
/linux/arch/x86/entry/vdso/
H A Dextable.c17 unsigned int nr_entries, i; in fixup_vdso_exception() local
32 nr_entries = image->extable_len / (sizeof(*extable)); in fixup_vdso_exception()
35 for (i = 0; i < nr_entries; i++) { in fixup_vdso_exception()
/linux/tools/perf/arch/x86/util/
H A Diostat.c71 int nr_entries; member
103 for (idx = 0; idx < list->nr_entries; idx++) in iio_root_ports_list_free()
117 for (idx = 0; idx < list->nr_entries; idx++) { in iio_root_port_find_by_notation()
132 rp->idx = list->nr_entries++; in iio_root_ports_list_insert()
134 list->nr_entries * sizeof(*list->rps)); in iio_root_ports_list_insert()
283 if (tmp_list->nr_entries == 0) { in iio_root_ports_list_filter()
316 for (idx = 0; idx < list->nr_entries; idx++) { in iostat_event_group()
328 list->nr_entries = 0; in iostat_event_group()
337 if (evlist->core.nr_entries > 0) { in iostat_prepare()
/linux/tools/perf/tests/
H A Dhists_filter.c167 hists->nr_entries == 9); in test__hists_filter()
174 hists->nr_entries == hists->nr_non_filtered_entries); in test__hists_filter()
192 hists->nr_entries == 9); in test__hists_filter()
221 hists->nr_entries == 9); in test__hists_filter()
256 hists->nr_entries == 9); in test__hists_filter()
285 hists->nr_entries == 9); in test__hists_filter()
316 hists->nr_entries == 9); in test__hists_filter()

1234567