Searched refs:nr_entries (Results 26 - 50 of 174) sorted by relevance

1234567

/linux-master/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); local
67 BUG_ON(shift > nr_entries);
71 (nr_entries - shift) * sizeof(__le64));
74 (nr_entries - shift) * value_size);
76 BUG_ON(nr_entries + shift > le32_to_cpu(n->header.max_entries));
79 nr_entries * sizeof(__le64));
82 nr_entries * value_size);
88 uint32_t nr_left = le32_to_cpu(left->header.nr_entries);
131 unsigned int nr_entries = le32_to_cpu(n->header.nr_entries); local
[all...]
H A Ddm-array.c27 __le32 nr_entries; member in struct:array_block
114 unsigned int nr_entries = le32_to_cpu(ab->nr_entries); local
116 fn(info->value_type.context, element_at(info, ab, 0), nr_entries);
164 (*ab)->nr_entries = cpu_to_le32(0);
178 uint32_t nr_entries, delta, i; local
182 BUG_ON(new_nr < le32_to_cpu(ab->nr_entries));
184 nr_entries = le32_to_cpu(ab->nr_entries);
185 delta = new_nr - nr_entries;
201 uint32_t nr_entries, delta; local
872 unsigned int nr_entries, max_entries; local
[all...]
/linux-master/tools/testing/selftests/bpf/progs/
H A Dbpf_hashmap_lookup.c21 u64 nr_entries; variable
47 return bpf_loop(nr_entries, lookup_callback, NULL, 0) ? 0 : 1;
/linux-master/include/linux/
H A Dstackdepot.h131 * @nr_entries: Number of frames in the stack
135 * Saves a stack trace from @entries array of size @nr_entries.
158 unsigned int nr_entries,
166 * @nr_entries: Number of frames in the stack
178 unsigned int nr_entries, gfp_t gfp_flags);
/linux-master/tools/perf/tests/
H A Dhists_filter.c167 hists->nr_entries == 9);
174 hists->nr_entries == hists->nr_non_filtered_entries);
192 hists->nr_entries == 9);
221 hists->nr_entries == 9);
256 hists->nr_entries == 9);
285 hists->nr_entries == 9);
316 hists->nr_entries == 9);
H A Dparse-events.c89 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
102 TEST_ASSERT_VAL("wrong number of entries", evlist->core.nr_entries > 1);
122 TEST_ASSERT_VAL("wrong number of entries", 0 != evlist->core.nr_entries);
159 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
185 TEST_ASSERT_VAL("wrong number of entries", 0 != evlist->core.nr_entries);
201 TEST_ASSERT_VAL("wrong number of entries", 0 != evlist->core.nr_entries);
223 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
233 TEST_ASSERT_VAL("wrong number of entries", 0 != evlist->core.nr_entries);
246 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
260 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
[all...]
/linux-master/tools/perf/arch/x86/tests/
H A Dhybrid.c29 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
41 TEST_ASSERT_VAL("wrong number of entries", 2 == evlist->core.nr_entries);
60 TEST_ASSERT_VAL("wrong number of entries", 2 == evlist->core.nr_entries);
77 TEST_ASSERT_VAL("wrong number of entries", 2 == evlist->core.nr_entries);
94 TEST_ASSERT_VAL("wrong number of entries", 2 == evlist->core.nr_entries);
130 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
140 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
151 TEST_ASSERT_VAL("wrong number of entries", 1 == evlist->core.nr_entries);
171 TEST_ASSERT_VAL("wrong number of entries", 2 == evlist->core.nr_entries);
/linux-master/arch/x86/kernel/
H A Dldt.c81 set_ldt(ldt_slot_va(ldt->slot), ldt->nr_entries);
83 set_ldt(ldt->entries, ldt->nr_entries);
183 new_ldt->nr_entries = num_entries;
309 nr_pages = DIV_ROUND_UP(ldt->nr_entries * LDT_ENTRY_SIZE, PAGE_SIZE);
361 nr_pages = DIV_ROUND_UP(ldt->nr_entries * LDT_ENTRY_SIZE, PAGE_SIZE);
418 paravirt_alloc_ldt(ldt->entries, ldt->nr_entries);
439 paravirt_free_ldt(ldt->entries, ldt->nr_entries);
440 if (ldt->nr_entries * LDT_ENTRY_SIZE > PAGE_SIZE)
463 new_ldt = alloc_ldt_struct(old_mm->context.ldt->nr_entries);
470 new_ldt->nr_entries * LDT_ENTRY_SIZ
[all...]
/linux-master/tools/perf/util/
H A Drb_resort.h31 * helpers are available to get the rb_root and the nr_entries:
104 int nr_entries) \
107 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
144 __ilist->rblist.nr_entries)
H A Dbpf_counter_cgroup.c62 skel->rodata->num_events = evlist->core.nr_entries / nr_cgroups;
64 BUG_ON(evlist->core.nr_entries % nr_cgroups != 0);
67 map_size = total_cpus * evlist->core.nr_entries / nr_cgroups;
71 map_size = evlist->core.nr_entries / nr_cgroups;
74 map_size = evlist->core.nr_entries;
H A Dsideband_evlist.c25 evsel = evsel__new_idx(attr, evlist->core.nr_entries);
107 if (evlist->core.nr_entries > 1) {
/linux-master/tools/objtool/
H A Dorc_dump.c15 int fd, nr_entries, i, *orc_ip = NULL, orc_size = 0; local
109 nr_entries = orc_size / sizeof(*orc);
110 for (i = 0; i < nr_entries; i++) {
H A Dspecial.c144 unsigned int nr_entries; local
161 nr_entries = sec->sh.sh_size / entry->size;
163 for (idx = 0; idx < nr_entries; idx++) {
/linux-master/kernel/printk/
H A Dindex.c23 unsigned int nr_entries; local
28 nr_entries = mod->printk_index_size;
34 nr_entries = __stop_printk_index - __start_printk_index;
37 if (pos >= nr_entries)
/linux-master/arch/arc/kernel/
H A Dstacktrace.c193 trace->entries[trace->nr_entries++] = address;
195 if (trace->nr_entries >= trace->max_entries)
211 trace->entries[trace->nr_entries++] = address;
213 if (trace->nr_entries >= trace->max_entries)
/linux-master/fs/tracefs/
H A Dinternal.h45 * @nr_entries: The number of items in @entries
62 unsigned int nr_entries:30; member in struct:eventfs_inode
/linux-master/drivers/net/ethernet/mellanox/mlxsw/
H A Dspectrum1_kvdl.c122 unsigned int entry_index, nr_entries; local
124 nr_entries = (info->end_index - info->start_index + 1) /
126 entry_index = find_first_zero_bit(part->usage, nr_entries);
127 if (entry_index == nr_entries)
215 unsigned int nr_entries; local
226 nr_entries = div_u64(resource_size, info->alloc_size);
227 part = kzalloc(struct_size(part, usage, BITS_TO_LONGS(nr_entries)),
280 unsigned int nr_entries; local
284 nr_entries = (info->end_index -
287 while ((bit = find_next_bit(part->usage, nr_entries, bi
[all...]
/linux-master/tools/testing/selftests/bpf/benchs/
H A Dbench_bloom_filter_map.c39 __u32 nr_entries; member in struct:__anon5763
43 .nr_entries = 1000,
55 { "nr_entries", ARG_NR_ENTRIES, "NR_ENTRIES", 0,
72 fprintf(stderr, "Invalid nr_entries count.");
75 args.nr_entries = ret;
145 if (i > args.nr_entries)
246 if (args.nr_entries > nr_unique_entries) {
248 "Not enough unique values for the nr_entries requested\n");
272 bpf_map__set_max_entries(skel->maps.hashmap, args.nr_entries);
274 bpf_map__set_max_entries(skel->maps.array_map, args.nr_entries);
[all...]
/linux-master/lib/
H A Dref_tracker.c191 unsigned int nr_entries; local
209 nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 1);
210 tracker->alloc_stack_handle = stack_depot_save(entries, nr_entries, gfp);
225 unsigned int nr_entries; local
239 nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 1);
240 stack_handle = stack_depot_save(entries, nr_entries,
/linux-master/tools/perf/arch/x86/util/
H A Diostat.c71 int nr_entries; member in struct:iio_root_ports_list
103 for (idx = 0; idx < list->nr_entries; idx++)
117 for (idx = 0; idx < list->nr_entries; idx++) {
132 rp->idx = list->nr_entries++;
134 list->nr_entries * sizeof(*list->rps));
283 if (tmp_list->nr_entries == 0) {
316 for (idx = 0; idx < list->nr_entries; idx++) {
328 list->nr_entries = 0;
337 if (evlist->core.nr_entries > 0) {
/linux-master/tools/perf/ui/
H A Dbrowser.c108 if (browser->nr_entries == 0)
316 if (browser->nr_entries > 1) {
318 (browser->nr_entries - 1));
348 if (browser->nr_entries == 0 && browser->no_samples_msg)
363 * Here we're updating nr_entries _after_ we started browsing, i.e. we have to
368 void ui_browser__update_nr_entries(struct ui_browser *browser, u32 nr_entries) argument
370 off_t offset = nr_entries - browser->nr_entries;
372 browser->nr_entries = nr_entries;
[all...]
H A Dbrowser.h32 u32 nr_entries; member in struct:ui_browser
62 void ui_browser__update_nr_entries(struct ui_browser *browser, u32 nr_entries);
/linux-master/drivers/dma/dw-edma/
H A Ddw-hdma-v0-debugfs.c61 int nr_entries, struct dentry *dent)
66 entries = devm_kcalloc(dw->chip->dev, nr_entries, sizeof(*entries),
71 for (i = 0; i < nr_entries; i++) {
111 int nr_entries = ARRAY_SIZE(debugfs_regs); local
113 dw_hdma_debugfs_create_x32(dw, debugfs_regs, nr_entries, dent);
59 dw_hdma_debugfs_create_x32(struct dw_edma *dw, const struct dw_hdma_debugfs_entry ini[], int nr_entries, struct dentry *dent) argument
/linux-master/arch/x86/xen/
H A Dsetup.c167 for (i = 0; i < xen_e820_table.nr_entries; i++, entry++) {
430 for (i = 0; i < xen_e820_table.nr_entries; i++, entry++) {
432 if (entry->type == E820_TYPE_RAM || i == xen_e820_table.nr_entries - 1) {
565 for (i = 0; i < xen_e820_table.nr_entries; i++, entry++) {
583 for (mapcnt = 0; mapcnt < xen_e820_table.nr_entries; mapcnt++) {
608 for (mapcnt = 0; mapcnt < xen_e820_table.nr_entries; mapcnt++, entry++) {
702 memmap.nr_entries = ARRAY_SIZE(xen_e820_table.entries);
715 memmap.nr_entries = 1;
724 BUG_ON(memmap.nr_entries == 0);
725 xen_e820_table.nr_entries
[all...]
/linux-master/tools/perf/trace/beauty/
H A Dpkey_alloc.c23 for (i = 1; i < sa->nr_entries; ++i) {

Completed in 206 milliseconds

1234567