Home
last modified time | relevance | path

Searched refs:nr (Results 1 – 9 of 9) 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.c81 static int bitmap_set_ll(unsigned long *map, int start, int nr) in bitmap_set_ll() argument
84 const int size = start + nr; in bitmap_set_ll()
88 while (nr - bits_to_set >= 0) { in bitmap_set_ll()
90 return nr; in bitmap_set_ll()
91 nr -= bits_to_set; in bitmap_set_ll()
96 if (nr) { in bitmap_set_ll()
99 return nr; in bitmap_set_ll()
116 static int bitmap_clear_ll(unsigned long *map, int start, int nr) in bitmap_clear_ll() argument
119 const int size = start + nr; in bitmap_clear_ll()
123 while (nr - bits_to_clear >= 0) { in bitmap_clear_ll()
[all …]
Dlocking-selftest.c998 #define DO_TESTCASE_1(desc, name, nr) \ argument
999 print_testname(desc"/"#nr); \
1000 dotest(name##_##nr, SUCCESS, LOCKTYPE_RWLOCK); \
1003 #define DO_TESTCASE_1B(desc, name, nr) \ argument
1004 print_testname(desc"/"#nr); \
1005 dotest(name##_##nr, FAILURE, LOCKTYPE_RWLOCK); \
1008 #define DO_TESTCASE_3(desc, name, nr) \ argument
1009 print_testname(desc"/"#nr); \
1010 dotest(name##_spin_##nr, FAILURE, LOCKTYPE_SPIN); \
1011 dotest(name##_wlock_##nr, FAILURE, LOCKTYPE_RWLOCK); \
[all …]
Dbitmap.c188 int nr = BITS_TO_LONGS(bits); in __bitmap_and() local
191 for (k = 0; k < nr; k++) in __bitmap_and()
201 int nr = BITS_TO_LONGS(bits); in __bitmap_or() local
203 for (k = 0; k < nr; k++) in __bitmap_or()
212 int nr = BITS_TO_LONGS(bits); in __bitmap_xor() local
214 for (k = 0; k < nr; k++) in __bitmap_xor()
223 int nr = BITS_TO_LONGS(bits); in __bitmap_andnot() local
226 for (k = 0; k < nr; k++) in __bitmap_andnot()
276 void bitmap_set(unsigned long *map, int start, int nr) in bitmap_set() argument
279 const int size = start + nr; in bitmap_set()
[all …]
Dradix-tree.c92 int nr; member
219 if (rtp->nr) { in radix_tree_node_alloc()
220 ret = rtp->nodes[rtp->nr - 1]; in radix_tree_node_alloc()
221 rtp->nodes[rtp->nr - 1] = NULL; in radix_tree_node_alloc()
222 rtp->nr--; in radix_tree_node_alloc()
275 while (rtp->nr < ARRAY_SIZE(rtp->nodes)) { in radix_tree_preload()
282 if (rtp->nr < ARRAY_SIZE(rtp->nodes)) in radix_tree_preload()
283 rtp->nodes[rtp->nr++] = node; in radix_tree_preload()
1437 while (rtp->nr) { in radix_tree_callback()
1439 rtp->nodes[rtp->nr-1]); in radix_tree_callback()
[all …]
Dpercpu_counter.c156 int nr = num_online_cpus(); in compute_batch_value() local
158 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.c196 unsigned int nr) in devm_ioport_map() argument
204 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