Home
last modified time | relevance | path

Searched refs:nbits (Results 1 – 11 of 11) sorted by relevance

/lib/
A Dtest_bitmap.c82 nbits, exp_bmap, nbits, bmap); in __check_eq_bitmap()
403 const int nbits; member
653 for (nbits = 0; nbits < EXP1_IN_BITS; ++nbits) { in test_bitmap_arr32()
659 round_up(nbits, BITS_PER_LONG), nbits); in test_bitmap_arr32()
681 for (nbits = 0; nbits < EXP1_IN_BITS; ++nbits) { in test_bitmap_arr64()
697 nbits, arr[(nbits - 1) / 64], in test_bitmap_arr64()
714 for (nbits = 0; nbits < 1024 - start; nbits += 8) { in test_mem_optimisations()
737 nbits); in test_mem_optimisations()
1309 for (nbits = BITS_PER_LONG; nbits >= 1; nbits--) { in test_bitmap_write_helper()
1385 for (nbits = 1; nbits <= BITS_PER_LONG; nbits++) { in test_bitmap_read_perf()
[all …]
A Dbitmap.c93 unsigned shift, unsigned nbits) in __bitmap_shift_right() argument
95 unsigned k, lim = BITS_TO_LONGS(nbits); in __bitmap_shift_right()
499 unsigned int nbits) in bitmap_remap() argument
505 bitmap_zero(dst, nbits); in bitmap_remap()
507 w = bitmap_weight(new, nbits); in bitmap_remap()
710 bitmap_zero(dst, nbits); in bitmap_fold()
800 if (nbits % BITS_PER_LONG) in bitmap_from_arr32()
823 if (nbits % BITS_PER_LONG) in bitmap_to_arr32()
840 for (n = nbits; n > 0; n -= 64) { in bitmap_from_arr64()
855 if (nbits % BITS_PER_LONG) in bitmap_from_arr64()
[all …]
A Dfind_bit.c155 unsigned long _find_next_bit(const unsigned long *addr, unsigned long nbits, unsigned long start) in _find_next_bit() argument
157 return FIND_NEXT_BIT(addr[idx], /* nop */, nbits, start); in _find_next_bit()
193 unsigned long nbits, unsigned long start) in _find_next_and_bit() argument
195 return FIND_NEXT_BIT(addr1[idx] & addr2[idx], /* nop */, nbits, start); in _find_next_and_bit()
202 unsigned long nbits, unsigned long start) in _find_next_andnot_bit() argument
204 return FIND_NEXT_BIT(addr1[idx] & ~addr2[idx], /* nop */, nbits, start); in _find_next_andnot_bit()
211 unsigned long nbits, unsigned long start) in _find_next_or_bit() argument
213 return FIND_NEXT_BIT(addr1[idx] | addr2[idx], /* nop */, nbits, start); in _find_next_or_bit()
219 unsigned long _find_next_zero_bit(const unsigned long *addr, unsigned long nbits, in _find_next_zero_bit() argument
222 return FIND_NEXT_BIT(~addr[idx], /* nop */, nbits, start); in _find_next_zero_bit()
A Dgenalloc.c188 unsigned long nbits = size >> pool->min_alloc_order; in gen_pool_add_owner() local
190 BITS_TO_LONGS(nbits) * sizeof(long); in gen_pool_add_owner()
283 unsigned long nbits, start_bit, end_bit, remain; in gen_pool_alloc_algo_owner() local
295 nbits = (size + (1UL << order) - 1) >> order; in gen_pool_alloc_algo_owner()
305 nbits, data, pool, chunk->start_addr); in gen_pool_alloc_algo_owner()
308 remain = bitmap_set_ll(chunk->bits, start_bit, nbits); in gen_pool_alloc_algo_owner()
311 nbits - remain); in gen_pool_alloc_algo_owner()
317 size = nbits << order; in gen_pool_alloc_algo_owner()
492 unsigned long start_bit, nbits, remain; in gen_pool_free_owner() local
501 nbits = (size + (1UL << order) - 1) >> order; in gen_pool_free_owner()
[all …]
A Dbitmap-str.c217 unsigned int nbits; member
233 if (r->end >= r->nbits) in bitmap_check_region()
297 unsigned int lastbit = r->nbits - 1; in bitmap_parse_region()
379 r.nbits = nmaskbits; in bitmap_parselist()
380 bitmap_zero(maskp, r.nbits); in bitmap_parselist()
A Dfind_bit_benchmark.c151 unsigned long nbits = BITMAP_LEN / SPARSE; in find_bit_test() local
176 while (nbits--) { in find_bit_test()
A Dbch.c1014 unsigned int nbits; in bch_decode() local
1057 nbits = (len*8)+bch->ecc_bits; in bch_decode()
1059 if (errloc[i] >= nbits) { in bch_decode()
1063 errloc[i] = nbits-1-errloc[i]; in bch_decode()
1194 unsigned int i, j, nbits, r, word, *roots; in compute_generator_polynomial() local
1236 nbits = (n > 32) ? 32 : n; in compute_generator_polynomial()
1237 for (j = 0, word = 0; j < nbits; j++) { in compute_generator_polynomial()
1242 n -= nbits; in compute_generator_polynomial()
/lib/crypto/mpi/
A Dmpicoder.c40 unsigned nbits, nlimbs; in mpi_read_raw_data() local
49 nbits = nbytes * 8; in mpi_read_raw_data()
50 if (nbits > MAX_EXTERN_MPI_BITS) { in mpi_read_raw_data()
61 val->nbits = nbits; in mpi_read_raw_data()
85 unsigned int nbits, nbytes; in mpi_read_from_buffer() local
90 nbits = buffer[0] << 8 | buffer[1]; in mpi_read_from_buffer()
92 if (nbits > MAX_EXTERN_MPI_BITS) { in mpi_read_from_buffer()
97 nbytes = DIV_ROUND_UP(nbits, 8); in mpi_read_from_buffer()
334 unsigned int nbits, nlimbs; in mpi_read_raw_from_sgl() local
370 nbits = nbytes * 8; in mpi_read_raw_from_sgl()
[all …]
A Dmpi-bit.c110 unsigned int nbits = (n%BITS_PER_MPI_LIMB); in mpi_rshift() local
126 if (x->nlimbs && nbits) in mpi_rshift()
127 mpihelp_rshift(x->d, x->d, x->nlimbs, nbits); in mpi_rshift()
150 if (x->nlimbs && nbits) in mpi_rshift()
151 mpihelp_rshift(x->d, x->d, x->nlimbs, nbits); in mpi_rshift()
162 if (nbits) in mpi_rshift()
163 mpihelp_rshift(x->d, a->d, x->nlimbs, nbits); in mpi_rshift()
A Dmpiutil.c54 a->nbits = 0; in mpi_alloc()
/lib/tests/
A Dprintf_kunit.c535 const int nbits = 1 << 16; in large_bitmap() local
536 unsigned long *bits = bitmap_zalloc(nbits, GFP_KERNEL); in large_bitmap()
542 test("1-20,60000-60014", "%*pbl", nbits, bits); in large_bitmap()

Completed in 34 milliseconds