Home
last modified time | relevance | path

Searched refs:nr (Results 1 – 10 of 10) sorted by relevance

/lib/
Diommu-helper.c9 int iommu_is_span_boundary(unsigned int index, unsigned int nr, in iommu_is_span_boundary() argument
16 return shift + nr > boundary_size; in iommu_is_span_boundary()
20 unsigned long start, unsigned int nr, in iommu_area_alloc() argument
29 index = bitmap_find_next_zero_area(map, size, start, nr, align_mask); in iommu_area_alloc()
31 if (iommu_is_span_boundary(index, nr, shift, boundary_size)) { in iommu_area_alloc()
36 bitmap_set(map, index, nr); in iommu_area_alloc()
Dgenalloc.c86 static int bitmap_set_ll(unsigned long *map, int start, int nr) in bitmap_set_ll() argument
89 const int size = start + nr; in bitmap_set_ll()
93 while (nr - bits_to_set >= 0) { in bitmap_set_ll()
95 return nr; in bitmap_set_ll()
96 nr -= bits_to_set; in bitmap_set_ll()
101 if (nr) { in bitmap_set_ll()
104 return nr; in bitmap_set_ll()
121 static int bitmap_clear_ll(unsigned long *map, int start, int nr) in bitmap_clear_ll() argument
124 const int size = start + nr; in bitmap_clear_ll()
128 while (nr - bits_to_clear >= 0) { in bitmap_clear_ll()
[all …]
Dlocking-selftest.c1021 #define DO_TESTCASE_1(desc, name, nr) \ argument
1022 print_testname(desc"/"#nr); \
1023 dotest(name##_##nr, SUCCESS, LOCKTYPE_RWLOCK); \
1026 #define DO_TESTCASE_1B(desc, name, nr) \ argument
1027 print_testname(desc"/"#nr); \
1028 dotest(name##_##nr, FAILURE, LOCKTYPE_RWLOCK); \
1031 #define DO_TESTCASE_3(desc, name, nr) \ argument
1032 print_testname(desc"/"#nr); \
1033 dotest(name##_spin_##nr, FAILURE, LOCKTYPE_SPIN); \
1034 dotest(name##_wlock_##nr, FAILURE, LOCKTYPE_RWLOCK); \
[all …]
Dradix-tree.c67 int nr; member
199 if (rtp->nr) { in radix_tree_node_alloc()
200 ret = rtp->nodes[rtp->nr - 1]; in radix_tree_node_alloc()
201 rtp->nodes[rtp->nr - 1] = NULL; in radix_tree_node_alloc()
202 rtp->nr--; in radix_tree_node_alloc()
260 while (rtp->nr < ARRAY_SIZE(rtp->nodes)) { in __radix_tree_preload()
267 if (rtp->nr < ARRAY_SIZE(rtp->nodes)) in __radix_tree_preload()
268 rtp->nodes[rtp->nr++] = node; in __radix_tree_preload()
1478 while (rtp->nr) { in radix_tree_callback()
1480 rtp->nodes[rtp->nr-1]); in radix_tree_callback()
[all …]
Dpercpu_ida.c47 unsigned nr) in move_tags() argument
49 *src_nr -= nr; in move_tags()
50 memcpy(dst + *dst_nr, src + *src_nr, sizeof(unsigned) * nr); in move_tags()
51 *dst_nr += nr; in move_tags()
Dbitmap.c208 unsigned int nr = BITS_TO_LONGS(bits); in __bitmap_or() local
210 for (k = 0; k < nr; k++) in __bitmap_or()
219 unsigned int nr = BITS_TO_LONGS(bits); in __bitmap_xor() local
221 for (k = 0; k < nr; k++) in __bitmap_xor()
345 unsigned int nr, in bitmap_find_next_zero_area_off() argument
356 end = index + nr; in bitmap_find_next_zero_area_off()
Dpercpu_counter.c163 int nr = num_online_cpus(); in compute_batch_value() local
165 percpu_counter_batch = max(32, nr*2); in compute_batch_value()
Dfind_next_bit.c17 #define BITOP_WORD(nr) ((nr) / BITS_PER_LONG) argument
Ddevres.c168 unsigned int nr) in devm_ioport_map() argument
176 addr = ioport_map(port, nr); in devm_ioport_map()
Diomap.c229 void __iomem *ioport_map(unsigned long port, unsigned int nr) in ioport_map() argument