/lib/ |
D | find_bit.c | 32 unsigned long start, unsigned long invert) in _find_next_bit() argument 36 if (unlikely(start >= nbits)) in _find_next_bit() 39 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit() 41 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit() 45 tmp &= BITMAP_FIRST_WORD_MASK(start); in _find_next_bit() 46 start = round_down(start, BITS_PER_LONG); in _find_next_bit() 49 start += BITS_PER_LONG; in _find_next_bit() 50 if (start >= nbits) in _find_next_bit() 53 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit() 55 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit() [all …]
|
D | pci_iomap.c | 33 resource_size_t start = pci_resource_start(dev, bar); in pci_iomap_range() local 37 if (len <= offset || !start) in pci_iomap_range() 40 start += offset; in pci_iomap_range() 44 return __pci_ioport_map(dev, start, len); in pci_iomap_range() 46 return ioremap(start, len); in pci_iomap_range() 73 resource_size_t start = pci_resource_start(dev, bar); in pci_iomap_wc_range() local 81 if (len <= offset || !start) in pci_iomap_wc_range() 85 start += offset; in pci_iomap_wc_range() 90 return ioremap_wc(start, len); in pci_iomap_wc_range()
|
D | crc32test.c | 553 u32 start; /* random 6 bit offset in buf */ member 681 test[i].start, test[i].length); in crc32c_test() 690 test[i].start, test[i].length)) in crc32c_test() 717 crc_full = __crc32c_le(test[i].crc, test_buf + test[i].start, in crc32c_combine_test() 724 test[i].start, len1); in crc32c_combine_test() 725 crc2 = __crc32c_le(0, test_buf + test[i].start + in crc32c_combine_test() 761 test[i].start, test[i].length); in crc32_test() 764 test[i].start, test[i].length); in crc32_test() 773 test[i].start, test[i].length)) in crc32_test() 777 test[i].start, test[i].length)) in crc32_test() [all …]
|
D | genalloc.c | 84 static int bitmap_set_ll(unsigned long *map, unsigned long start, unsigned long nr) in bitmap_set_ll() argument 86 unsigned long *p = map + BIT_WORD(start); in bitmap_set_ll() 87 const unsigned long size = start + nr; in bitmap_set_ll() 88 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_set_ll() 89 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start); in bitmap_set_ll() 120 bitmap_clear_ll(unsigned long *map, unsigned long start, unsigned long nr) in bitmap_clear_ll() argument 122 unsigned long *p = map + BIT_WORD(start); in bitmap_clear_ll() 123 const unsigned long size = start + nr; in bitmap_clear_ll() 124 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_clear_ll() 125 unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start); in bitmap_clear_ll() [all …]
|
D | test_user_copy.c | 50 size_t start, end, i, zero_start, zero_end; in test_check_nonzero_user() local 62 start = PAGE_SIZE - (size / 2); in test_check_nonzero_user() 64 kmem += start; in test_check_nonzero_user() 65 umem += start; in test_check_nonzero_user() 90 for (start = 0; start <= size; start++) { in test_check_nonzero_user() 91 for (end = start; end <= size; end++) { in test_check_nonzero_user() 92 size_t len = end - start; in test_check_nonzero_user() 93 int retval = check_zeroed_user(umem + start, len); in test_check_nonzero_user() 94 int expected = is_zeroed(kmem + start, len); in test_check_nonzero_user() 98 retval, expected, start, end); in test_check_nonzero_user()
|
D | test_bitmap.c | 374 unsigned int start, nbits; in test_mem_optimisations() local 376 for (start = 0; start < 1024; start += 8) { in test_mem_optimisations() 377 for (nbits = 0; nbits < 1024 - start; nbits += 8) { in test_mem_optimisations() 381 bitmap_set(bmap1, start, nbits); in test_mem_optimisations() 382 __bitmap_set(bmap2, start, nbits); in test_mem_optimisations() 384 printk("set not equal %d %d\n", start, nbits); in test_mem_optimisations() 388 printk("set not __equal %d %d\n", start, nbits); in test_mem_optimisations() 392 bitmap_clear(bmap1, start, nbits); in test_mem_optimisations() 393 __bitmap_clear(bmap2, start, nbits); in test_mem_optimisations() 395 printk("clear not equal %d %d\n", start, nbits); in test_mem_optimisations() [all …]
|
D | bitmap.c | 270 void __bitmap_set(unsigned long *map, unsigned int start, int len) in __bitmap_set() argument 272 unsigned long *p = map + BIT_WORD(start); in __bitmap_set() 273 const unsigned int size = start + len; in __bitmap_set() 274 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in __bitmap_set() 275 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start); in __bitmap_set() 291 void __bitmap_clear(unsigned long *map, unsigned int start, int len) in __bitmap_clear() argument 293 unsigned long *p = map + BIT_WORD(start); in __bitmap_clear() 294 const unsigned int size = start + len; in __bitmap_clear() 295 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in __bitmap_clear() 296 unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start); in __bitmap_clear() [all …]
|
D | interval_tree_test.c | 30 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search() argument 35 for (node = interval_tree_iter_first(root, start, last); node; in search() 36 node = interval_tree_iter_next(node, start, last)) in search() 49 nodes[i].start = a; in init() 109 unsigned long start = search_all ? 0 : queries[j]; in interval_tree_test_init() local 112 results += search(&root, start, last); in interval_tree_test_init()
|
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() 22 start = ALIGN(shift + index, boundary_size) - shift; in iommu_area_alloc()
|
D | string.c | 1034 static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes) in check_bytes8() argument 1037 if (*start != value) in check_bytes8() 1038 return (void *)start; in check_bytes8() 1039 start++; in check_bytes8() 1054 void *memchr_inv(const void *start, int c, size_t bytes) in memchr_inv() argument 1061 return check_bytes8(start, value, bytes); in memchr_inv() 1075 prefix = (unsigned long)start % 8; in memchr_inv() 1080 r = check_bytes8(start, value, prefix); in memchr_inv() 1083 start += prefix; in memchr_inv() 1090 if (*(u64 *)start != value64) in memchr_inv() [all …]
|
D | extable.c | 64 void sort_extable(struct exception_table_entry *start, in sort_extable() argument 67 sort(start, finish - start, sizeof(struct exception_table_entry), in sort_extable()
|
D | idr.c | 79 int idr_alloc(struct idr *idr, void *ptr, int start, int end, gfp_t gfp) in idr_alloc() argument 81 u32 id = start; in idr_alloc() 84 if (WARN_ON_ONCE(start < 0)) in idr_alloc() 117 int idr_alloc_cyclic(struct idr *idr, void *ptr, int start, int end, gfp_t gfp) in idr_alloc_cyclic() argument 122 if ((int)id < start) in idr_alloc_cyclic() 123 id = start; in idr_alloc_cyclic() 126 if ((err == -ENOSPC) && (id > start)) { in idr_alloc_cyclic() 127 id = start; in idr_alloc_cyclic()
|
D | cpumask.c | 77 int cpumask_next_wrap(int n, const struct cpumask *mask, int start, bool wrap) in cpumask_next_wrap() argument 84 if (wrap && n < start && next >= start) { in cpumask_next_wrap()
|
D | radix-tree.c | 1490 unsigned long maxindex, start = iter->next_index; in idr_get_free() local 1496 start = max(start, maxindex + 1); in idr_get_free() 1497 if (start > max) in idr_get_free() 1500 if (start > maxindex) { in idr_get_free() 1501 int error = radix_tree_extend(root, gfp, start, shift); in idr_get_free() 1507 if (start == 0 && shift == 0) in idr_get_free() 1526 offset = radix_tree_descend(node, &child, start); in idr_get_free() 1530 start = next_index(start, node, offset); in idr_get_free() 1531 if (start > max || start == 0) in idr_get_free() 1545 iter->index = start; in idr_get_free() [all …]
|
D | error-inject.c | 57 static void populate_error_injection_list(struct error_injection_entry *start, in populate_error_injection_list() argument 66 for (iter = start; iter < end; iter++) { in populate_error_injection_list() 198 .start = ei_seq_start,
|
D | ioremap.c | 214 unsigned long start; in ioremap_page_range() local 221 start = addr; in ioremap_page_range() 230 flush_cache_vmap(start, end); in ioremap_page_range()
|
D | iov_iter.c | 1228 size_t *start) in __pipe_get_pages() argument 1231 ssize_t n = push_pipe(i, maxsize, &idx, start); in __pipe_get_pages() 1236 n += *start; in __pipe_get_pages() 1248 size_t *start) in pipe_get_pages() argument 1260 data_start(i, &idx, start); in pipe_get_pages() 1263 capacity = min(npages,maxpages) * PAGE_SIZE - *start; in pipe_get_pages() 1265 return __pipe_get_pages(i, min(maxsize, capacity), pages, idx, start); in pipe_get_pages() 1270 size_t *start) in iov_iter_get_pages() argument 1276 return pipe_get_pages(i, pages, maxsize, maxpages, start); in iov_iter_get_pages() 1282 size_t len = v.iov_len + (*start = addr & (PAGE_SIZE - 1)); in iov_iter_get_pages() [all …]
|
/lib/zstd/ |
D | bitstream.h | 107 const char *start; member 247 bitD->start = (const char *)srcBuffer; in BIT_initDStream() 257 bitD->start = (const char *)srcBuffer; in BIT_initDStream() 258 bitD->ptr = bitD->start; in BIT_initDStream() 259 bitD->bitContainer = *(const BYTE *)(bitD->start); in BIT_initDStream() 286 …TIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start) { return bitContainer >> start; } in BIT_getUpperBits() argument 288 …IT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits) { return (bitContainer >>… in BIT_getMiddleBits() argument 346 if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) { in BIT_reloadDStream() 352 if (bitD->ptr == bitD->start) { in BIT_reloadDStream() 360 if (bitD->ptr - nbBytes < bitD->start) { in BIT_reloadDStream() [all …]
|
/lib/dim/ |
D | dim.c | 57 bool dim_calc_stats(struct dim_sample *start, struct dim_sample *end, in dim_calc_stats() argument 61 u32 delta_us = ktime_us_delta(end->time, start->time); in dim_calc_stats() 62 u32 npkts = BIT_GAP(BITS_PER_TYPE(u32), end->pkt_ctr, start->pkt_ctr); in dim_calc_stats() 64 start->byte_ctr); in dim_calc_stats() 66 start->comp_ctr); in dim_calc_stats()
|
/lib/raid6/ |
D | avx512.c | 101 static void raid6_avx5121_xor_syndrome(int disks, int start, int stop, in raid6_avx5121_xor_syndrome() argument 124 for (z = z0-1 ; z >= start ; z--) { in raid6_avx5121_xor_syndrome() 138 for (z = start-1 ; z >= 0 ; z--) { in raid6_avx5121_xor_syndrome() 233 static void raid6_avx5122_xor_syndrome(int disks, int start, int stop, in raid6_avx5122_xor_syndrome() argument 260 for (z = z0-1 ; z >= start ; z--) { in raid6_avx5122_xor_syndrome() 283 for (z = start-1 ; z >= 0 ; z--) { in raid6_avx5122_xor_syndrome() 423 static void raid6_avx5124_xor_syndrome(int disks, int start, int stop, in raid6_avx5124_xor_syndrome() argument 458 for (z = z0-1 ; z >= start ; z--) { in raid6_avx5124_xor_syndrome() 507 for (z = start-1 ; z >= 0 ; z--) { in raid6_avx5124_xor_syndrome()
|
D | avx2.c | 84 static void raid6_avx21_xor_syndrome(int disks, int start, int stop, in raid6_avx21_xor_syndrome() argument 104 for (z = z0-1 ; z >= start ; z--) { in raid6_avx21_xor_syndrome() 115 for (z = start-1 ; z >= 0 ; z--) { in raid6_avx21_xor_syndrome() 194 static void raid6_avx22_xor_syndrome(int disks, int start, int stop, in raid6_avx22_xor_syndrome() argument 217 for (z = z0-1 ; z >= start ; z--) { in raid6_avx22_xor_syndrome() 237 for (z = start-1 ; z >= 0 ; z--) { in raid6_avx22_xor_syndrome() 355 static void raid6_avx24_xor_syndrome(int disks, int start, int stop, in raid6_avx24_xor_syndrome() argument 384 for (z = z0-1 ; z >= start ; z--) { in raid6_avx24_xor_syndrome() 426 for (z = start-1 ; z >= 0 ; z--) { in raid6_avx24_xor_syndrome()
|
D | sse2.c | 87 static void raid6_sse21_xor_syndrome(int disks, int start, int stop, in raid6_sse21_xor_syndrome() argument 107 for ( z = z0-1 ; z >= start ; z-- ) { in raid6_sse21_xor_syndrome() 118 for ( z = start-1 ; z >= 0 ; z-- ) { in raid6_sse21_xor_syndrome() 198 static void raid6_sse22_xor_syndrome(int disks, int start, int stop, in raid6_sse22_xor_syndrome() argument 221 for ( z = z0-1 ; z >= start ; z-- ) { in raid6_sse22_xor_syndrome() 240 for ( z = start-1 ; z >= 0 ; z-- ) { in raid6_sse22_xor_syndrome() 364 static void raid6_sse24_xor_syndrome(int disks, int start, int stop, in raid6_sse24_xor_syndrome() argument 393 for ( z = z0-1 ; z >= start ; z-- ) { in raid6_sse24_xor_syndrome() 432 for ( z = start-1 ; z >= 0 ; z-- ) { in raid6_sse24_xor_syndrome()
|
D | neon.c | 41 int start, int stop, \ 48 start, stop, (unsigned long)bytes, ptrs); \
|
/lib/zlib_inflate/ |
D | inffast.h | 11 void inflate_fast (z_streamp strm, unsigned start);
|
/lib/math/ |
D | prime_numbers.c | 92 unsigned long start, in clear_multiples() argument 98 if (m < start) in clear_multiples() 99 m = roundup(start, x); in clear_multiples()
|