/lib/ |
D | memcat_p.c | 13 int nr; in __memcat_p() local 16 for (nr = 0, p = a; *p; nr++, p++) in __memcat_p() 18 for (p = b; *p; nr++, p++) in __memcat_p() 21 nr++; in __memcat_p() 23 new = kmalloc_array(nr, sizeof(void *), GFP_KERNEL); in __memcat_p() 28 for (nr--; nr >= 0; nr--, p = p == b ? &a[nr] : p - 1) in __memcat_p() 29 new[nr] = *p; in __memcat_p()
|
D | sbitmap.c | 111 int nr; in __sbitmap_get_word() local 114 nr = find_next_zero_bit(word, depth, hint); in __sbitmap_get_word() 115 if (unlikely(nr >= depth)) { in __sbitmap_get_word() 128 if (!test_and_set_bit_lock(nr, word)) in __sbitmap_get_word() 131 hint = nr + 1; in __sbitmap_get_word() 136 return nr; in __sbitmap_get_word() 142 int nr; in sbitmap_find_bit_in_index() local 145 nr = __sbitmap_get_word(&sb->map[index].word, in sbitmap_find_bit_in_index() 148 if (nr != -1) in sbitmap_find_bit_in_index() 154 return nr; in sbitmap_find_bit_in_index() [all …]
|
D | genalloc.c | 84 static int bitmap_set_ll(unsigned long *map, int start, int nr) in bitmap_set_ll() argument 87 const int size = start + nr; in bitmap_set_ll() 91 while (nr - bits_to_set >= 0) { in bitmap_set_ll() 93 return nr; in bitmap_set_ll() 94 nr -= bits_to_set; in bitmap_set_ll() 99 if (nr) { in bitmap_set_ll() 102 return nr; in bitmap_set_ll() 119 static int bitmap_clear_ll(unsigned long *map, int start, int nr) in bitmap_clear_ll() argument 122 const int size = start + nr; in bitmap_clear_ll() 126 while (nr - bits_to_clear >= 0) { in bitmap_clear_ll() [all …]
|
D | iommu-helper.c | 10 unsigned long start, unsigned int nr, in iommu_area_alloc() argument 19 index = bitmap_find_next_zero_area(map, size, start, nr, align_mask); in iommu_area_alloc() 21 if (iommu_is_span_boundary(index, nr, shift, boundary_size)) { in iommu_area_alloc() 25 bitmap_set(map, index, nr); in iommu_area_alloc()
|
D | syscall.c | 15 info->data.nr = -1; in collect_syscall() 28 info->data.nr = syscall_get_nr(target, regs); in collect_syscall() 29 if (info->data.nr != -1L) in collect_syscall()
|
D | locking-selftest.c | 1192 #define DO_TESTCASE_1(desc, name, nr) \ argument 1193 print_testname(desc"/"#nr); \ 1194 dotest(name##_##nr, SUCCESS, LOCKTYPE_RWLOCK); \ 1197 #define DO_TESTCASE_1B(desc, name, nr) \ argument 1198 print_testname(desc"/"#nr); \ 1199 dotest(name##_##nr, FAILURE, LOCKTYPE_RWLOCK); \ 1202 #define DO_TESTCASE_3(desc, name, nr) \ argument 1203 print_testname(desc"/"#nr); \ 1204 dotest(name##_spin_##nr, FAILURE, LOCKTYPE_SPIN); \ 1205 dotest(name##_wlock_##nr, FAILURE, LOCKTYPE_RWLOCK); \ [all …]
|
D | radix-tree.c | 70 unsigned nr; member 273 if (rtp->nr) { in radix_tree_node_alloc() 276 rtp->nr--; in radix_tree_node_alloc() 331 static __must_check int __radix_tree_preload(gfp_t gfp_mask, unsigned nr) in __radix_tree_preload() argument 345 while (rtp->nr < nr) { in __radix_tree_preload() 352 if (rtp->nr < nr) { in __radix_tree_preload() 355 rtp->nr++; in __radix_tree_preload() 1594 while (rtp->nr) { in radix_tree_cpu_dead() 1598 rtp->nr--; in radix_tree_cpu_dead()
|
D | bitmap.c | 191 unsigned int nr = BITS_TO_LONGS(bits); in __bitmap_or() local 193 for (k = 0; k < nr; k++) in __bitmap_or() 202 unsigned int nr = BITS_TO_LONGS(bits); in __bitmap_xor() local 204 for (k = 0; k < nr; k++) in __bitmap_xor() 328 unsigned int nr, in bitmap_find_next_zero_area_off() argument 339 end = index + nr; in bitmap_find_next_zero_area_off()
|
D | percpu_counter.c | 170 int nr = num_online_cpus(); in compute_batch_value() local 172 percpu_counter_batch = max(32, nr*2); in compute_batch_value()
|
D | devres.c | 225 unsigned int nr) in devm_ioport_map() argument 233 addr = ioport_map(port, nr); in devm_ioport_map()
|
D | test_xarray.c | 1316 unsigned long nr = 1UL << order; in check_create_range_2() local 1318 for (i = 0; i < nr * nr; i += nr) in check_create_range_2() 1320 for (i = 0; i < nr * nr; i++) in check_create_range_2()
|
D | iomap.c | 362 void __iomem *ioport_map(unsigned long port, unsigned int nr) in ioport_map() argument
|