Home
last modified time | relevance | path

Searched refs:nrbits (Results 1 – 4 of 4) sorted by relevance

/fs/ubifs/
A Dlpt.c231 ubifs_assert(c, (val >> nrbits) == 0 || nrbits == 32); in pack_bits()
234 nrbits += b; in pack_bits()
235 if (nrbits > 8) { in pack_bits()
237 if (nrbits > 16) { in pack_bits()
248 if (nrbits > 8) { in pack_bits()
252 if (nrbits > 24) in pack_bits()
257 b = nrbits & 7; in pack_bits()
304 nrbits += b; in ubifs_unpack_bits()
326 b = nrbits & 7; in ubifs_unpack_bits()
327 p += nrbits >> 3; in ubifs_unpack_bits()
[all …]
A Dubifs.h1976 uint32_t ubifs_unpack_bits(const struct ubifs_info *c, uint8_t **addr, int *pos, int nrbits);
/fs/nfs/
A Dinternal.h771 unsigned char nrbits; in nfs_block_bits() local
773 for (nrbits = 31; nrbits && !(bsize & (1UL << nrbits)); nrbits--) in nfs_block_bits()
775 bsize = 1UL << nrbits; in nfs_block_bits()
777 *nrbitsp = nrbits; in nfs_block_bits()
/fs/btrfs/
A Dfree-space-tree.c357 unsigned long nrbits, start_bit, end_bit; in btrfs_convert_free_space_to_extents() local
445 nrbits = block_group->length >> fs_info->sectorsize_bits; in btrfs_convert_free_space_to_extents()
446 start_bit = find_next_bit_le(bitmap, nrbits, 0); in btrfs_convert_free_space_to_extents()
448 while (start_bit < nrbits) { in btrfs_convert_free_space_to_extents()
449 end_bit = find_next_zero_bit_le(bitmap, nrbits, start_bit); in btrfs_convert_free_space_to_extents()
465 start_bit = find_next_bit_le(bitmap, nrbits, end_bit); in btrfs_convert_free_space_to_extents()

Completed in 50 milliseconds