/fs/omfs/ |
D | bitmap.c | 27 int addrlen, int bit, int max) in count_run() argument 33 x = find_next_bit(*addr, nbits, bit); in count_run() 34 count += x - bit; in count_run() 39 bit = 0; in count_run() 49 int nbits, int bit, int count, int set) in set_run() argument 61 for (i = 0; i < count; i++, bit++) { in set_run() 62 if (bit >= nbits) { in set_run() 63 bit = 0; in set_run() 74 set_bit(bit, sbi->s_imap[map]); in set_run() 75 set_bit(bit, (unsigned long *)bh->b_data); in set_run() [all …]
|
/fs/ocfs2/ |
D | heartbeat.c | 30 int bit); 32 int bit); 71 int bit) in __ocfs2_node_map_set_bit() argument 73 set_bit(bit, map->map); in __ocfs2_node_map_set_bit() 78 int bit) in ocfs2_node_map_set_bit() argument 80 if (bit==-1) in ocfs2_node_map_set_bit() 82 BUG_ON(bit >= map->num_nodes); in ocfs2_node_map_set_bit() 84 __ocfs2_node_map_set_bit(map, bit); in ocfs2_node_map_set_bit() 89 int bit) in __ocfs2_node_map_clear_bit() argument 91 clear_bit(bit, map->map); in __ocfs2_node_map_clear_bit() [all …]
|
D | ocfs2.h | 873 static inline void _ocfs2_set_bit(unsigned int bit, unsigned long *bitmap) in _ocfs2_set_bit() argument 875 __set_bit_le(bit, bitmap); in _ocfs2_set_bit() 877 #define ocfs2_set_bit(bit, addr) _ocfs2_set_bit((bit), (unsigned long *)(addr)) argument 879 static inline void _ocfs2_clear_bit(unsigned int bit, unsigned long *bitmap) in _ocfs2_clear_bit() argument 881 __clear_bit_le(bit, bitmap); in _ocfs2_clear_bit() 883 #define ocfs2_clear_bit(bit, addr) _ocfs2_clear_bit((bit), (unsigned long *)(addr)) argument 889 static inline void *correct_addr_and_bit_unaligned(int *bit, void *addr) in correct_addr_and_bit_unaligned() argument 892 *bit += ((unsigned long) addr & 7UL) << 3; in correct_addr_and_bit_unaligned() 895 *bit += ((unsigned long) addr & 3UL) << 3; in correct_addr_and_bit_unaligned() 903 static inline void ocfs2_set_bit_unaligned(int bit, void *bitmap) in ocfs2_set_bit_unaligned() argument [all …]
|
D | heartbeat.h | 23 int bit); 26 int bit); 29 int bit);
|
/fs/udf/ |
D | balloc.c | 139 unsigned long bit; in udf_bitmap_free_blocks() local 161 bit = block % (sb->s_blocksize << 3); in udf_bitmap_free_blocks() 166 if (bit + count > (sb->s_blocksize << 3)) { in udf_bitmap_free_blocks() 167 overflow = bit + count - (sb->s_blocksize << 3); in udf_bitmap_free_blocks() 176 if (udf_set_bit(bit + i, bh->b_data)) { in udf_bitmap_free_blocks() 177 udf_debug("bit %lu already set\n", bit + i); in udf_bitmap_free_blocks() 179 ((__u8 *)bh->b_data)[(bit + i) >> 3]); in udf_bitmap_free_blocks() 201 int bit, block, block_group; in udf_bitmap_prealloc_blocks() local 223 bit = block % (sb->s_blocksize << 3); in udf_bitmap_prealloc_blocks() 225 while (bit < (sb->s_blocksize << 3) && block_count > 0) { in udf_bitmap_prealloc_blocks() [all …]
|
/fs/xfs/libxfs/ |
D | xfs_rtbitmap.c | 102 int bit; /* bit number in the word */ in xfs_rtfind_back() local 129 bit = (int)(start & (XFS_NBWORD - 1)); in xfs_rtfind_back() 135 want = (*b & ((xfs_rtword_t)1 << bit)) ? -1 : 0; in xfs_rtfind_back() 140 if (bit < XFS_NBWORD - 1) { in xfs_rtfind_back() 145 firstbit = XFS_RTMAX((xfs_srtblock_t)(bit - len + 1), 0); in xfs_rtfind_back() 146 mask = (((xfs_rtword_t)1 << (bit - firstbit + 1)) - 1) << in xfs_rtfind_back() 157 i = bit - XFS_RTHIBIT(wdiff); in xfs_rtfind_back() 161 i = bit - firstbit + 1; in xfs_rtfind_back() 277 int bit; /* bit number in the word */ in xfs_rtfind_forw() local 304 bit = (int)(start & (XFS_NBWORD - 1)); in xfs_rtfind_forw() [all …]
|
/fs/ntfs/ |
D | bitmap.c | 42 u8 bit; in __ntfs_bitmap_set_bits_in_run() local 74 bit = start_bit & 7; in __ntfs_bitmap_set_bits_in_run() 77 if (bit) { in __ntfs_bitmap_set_bits_in_run() 79 while ((bit & 7) && cnt) { in __ntfs_bitmap_set_bits_in_run() 82 *byte |= 1 << bit++; in __ntfs_bitmap_set_bits_in_run() 84 *byte &= ~(1 << bit++); in __ntfs_bitmap_set_bits_in_run() 135 bit = cnt; in __ntfs_bitmap_set_bits_in_run() 137 while (bit--) { in __ntfs_bitmap_set_bits_in_run() 139 *byte |= 1 << bit; in __ntfs_bitmap_set_bits_in_run() 141 *byte &= ~(1 << bit); in __ntfs_bitmap_set_bits_in_run()
|
D | bitmap.h | 83 static inline int ntfs_bitmap_set_bit(struct inode *vi, const s64 bit) in ntfs_bitmap_set_bit() argument 85 return ntfs_bitmap_set_run(vi, bit, 1); in ntfs_bitmap_set_bit() 97 static inline int ntfs_bitmap_clear_bit(struct inode *vi, const s64 bit) in ntfs_bitmap_clear_bit() argument 99 return ntfs_bitmap_clear_run(vi, bit, 1); in ntfs_bitmap_clear_bit()
|
D | mft.c | 1129 s64 pass_end, ll, data_pos, pass_start, ofs, bit; in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() local 1195 bit = data_pos & 7; in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1199 (long long)data_pos, (long long)bit); in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1200 for (; bit < size && data_pos + bit < pass_end; in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1201 bit &= ~7ull, bit += 8) { in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1202 byte = buf + (bit >> 3); in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1206 if (b < 8 && b >= (bit & 7)) { in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1207 ll = data_pos + (bit & ~7ull) + b; in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 1225 (long long)data_pos, (long long)bit); in ntfs_mft_bitmap_find_and_alloc_free_rec_nolock() 2241 s64 ll, bit, old_data_initialized, old_data_size; in ntfs_mft_record_alloc() local [all …]
|
/fs/ufs/ |
D | ialloc.c | 64 unsigned ino, cg, bit; in ufs_free_inode() local 82 bit = ufs_inotocgoff (ino); in ufs_free_inode() 96 if (ubh_isclr (UCPI_UBH(ucpi), ucpi->c_iusedoff, bit)) in ufs_free_inode() 99 ubh_clrbit (UCPI_UBH(ucpi), ucpi->c_iusedoff, bit); in ufs_free_inode() 181 unsigned cg, bit, i, j, start; in ufs_new_inode() local 249 bit = ubh_find_next_zero_bit (UCPI_UBH(ucpi), ucpi->c_iusedoff, uspi->s_ipg, start); in ufs_new_inode() 250 if (!(bit < uspi->s_ipg)) { in ufs_new_inode() 251 bit = ubh_find_first_zero_bit (UCPI_UBH(ucpi), ucpi->c_iusedoff, start); in ufs_new_inode() 252 if (!(bit < start)) { in ufs_new_inode() 259 UFSD("start = %u, bit = %u, ipg = %u\n", start, bit, uspi->s_ipg); in ufs_new_inode() [all …]
|
D | util.h | 351 #define ubh_blkmap(ubh,begin,bit) \ argument 352 …((*ubh_get_addr(ubh, (begin) + ((bit) >> 3)) >> ((bit) & 7)) & (0xff >> (UFS_MAXFRAG - uspi->s_fpb… 379 #define ubh_setbit(ubh,begin,bit) \ argument 380 (*ubh_get_addr(ubh, (begin) + ((bit) >> 3)) |= (1 << ((bit) & 7))) 382 #define ubh_clrbit(ubh,begin,bit) \ argument 383 (*ubh_get_addr (ubh, (begin) + ((bit) >> 3)) &= ~(1 << ((bit) & 7))) 385 #define ubh_isset(ubh,begin,bit) \ argument 386 (*ubh_get_addr (ubh, (begin) + ((bit) >> 3)) & (1 << ((bit) & 7))) 388 #define ubh_isclr(ubh,begin,bit) (!ubh_isset(ubh,begin,bit)) argument 419 unsigned bit, i; in find_last_zero_bit() local [all …]
|
D | balloc.c | 45 unsigned cgno, bit, end_bit, bbase, blkmap, i; in ufs_free_fragments() local 60 bit = ufs_dtogd(uspi, fragment); in ufs_free_fragments() 75 end_bit = bit + count; in ufs_free_fragments() 76 bbase = ufs_blknum (bit); in ufs_free_fragments() 79 for (i = bit; i < end_bit; i++) { in ufs_free_fragments() 141 unsigned overflow, cgno, bit, end_bit, i; in ufs_free_blocks() local 162 bit = ufs_dtogd(uspi, fragment); in ufs_free_blocks() 167 end_bit = bit + count; in ufs_free_blocks() 169 overflow = bit + count - uspi->s_fpg; in ufs_free_blocks() 183 for (i = bit; i < end_bit; i += uspi->s_fpb) { in ufs_free_blocks()
|
/fs/affs/ |
D | bitmap.c | 44 u32 blk, bmap, bit, mask, tmp; in affs_free_block() local 54 bit = blk % sbi->s_bmap_bits; in affs_free_block() 69 mask = 1 << (bit & 31); in affs_free_block() 70 data = (__be32 *)bh->b_data + bit / 32 + 1; in affs_free_block() 122 u32 blk, bmap, bit, mask, mask2, tmp; in affs_alloc_block() local 182 bit = blk % sbi->s_bmap_bits; in affs_alloc_block() 183 data = (__be32 *)bh->b_data + bit / 32 + 1; in affs_alloc_block() 185 mask = ~0UL << (bit & 31); in affs_alloc_block() 206 bit = ffs(tmp & mask) - 1; in affs_alloc_block() 207 blk += bit + sbi->s_reserved; in affs_alloc_block() [all …]
|
/fs/xfs/ |
D | xfs_buf_item_recover.c | 444 int bit; in xlog_recover_do_reg_buffer() local 451 bit = 0; in xlog_recover_do_reg_buffer() 454 bit = xfs_next_bit(buf_f->blf_data_map, in xlog_recover_do_reg_buffer() 455 buf_f->blf_map_size, bit); in xlog_recover_do_reg_buffer() 456 if (bit == -1) in xlog_recover_do_reg_buffer() 459 buf_f->blf_map_size, bit); in xlog_recover_do_reg_buffer() 464 ((uint)bit << XFS_BLF_SHIFT) + (nbits << XFS_BLF_SHIFT)); in xlog_recover_do_reg_buffer() 506 (uint)bit << XFS_BLF_SHIFT), /* dest */ in xlog_recover_do_reg_buffer() 511 bit += nbits; in xlog_recover_do_reg_buffer() 585 int bit = 0; in xlog_recover_do_inode_buffer() local [all …]
|
D | xfs_buf_item.c | 783 uint bit; in xfs_buf_item_log_segment() local 811 bit = first_bit & (uint)(NBWORD - 1); in xfs_buf_item_log_segment() 821 if (bit) { in xfs_buf_item_log_segment() 822 end_bit = min(bit + bits_to_set, (uint)NBWORD); in xfs_buf_item_log_segment() 823 mask = ((1U << (end_bit - bit)) - 1) << bit; in xfs_buf_item_log_segment() 826 bits_set = end_bit - bit; in xfs_buf_item_log_segment()
|
/fs/ocfs2/dlm/ |
D | dlmmaster.c | 604 struct dlm_lock_resource *res, int bit) in dlm_lockres_set_refmap_bit() argument 609 res->lockname.name, bit, __builtin_return_address(0)); in dlm_lockres_set_refmap_bit() 611 set_bit(bit, res->refmap); in dlm_lockres_set_refmap_bit() 615 struct dlm_lock_resource *res, int bit) in dlm_lockres_clear_refmap_bit() argument 620 res->lockname.name, bit, __builtin_return_address(0)); in dlm_lockres_clear_refmap_bit() 622 clear_bit(bit, res->refmap); in dlm_lockres_clear_refmap_bit() 716 int bit, wait_on_recovery = 0; in dlm_get_lock_resource() local 866 bit = find_next_bit(dlm->recovery_map, O2NM_MAX_NODES, 0); in dlm_get_lock_resource() 867 if (bit < O2NM_MAX_NODES) { in dlm_get_lock_resource() 870 dlm->name, namelen, (char *)lockid, bit); in dlm_get_lock_resource() [all …]
|
D | dlmcommon.h | 892 struct dlm_lock_resource *res, int bit); 894 struct dlm_lock_resource *res, int bit); 1109 int bit; in dlm_node_iter_next() local 1110 bit = find_next_bit(iter->node_map, O2NM_MAX_NODES, iter->curnode+1); in dlm_node_iter_next() 1111 if (bit >= O2NM_MAX_NODES) { in dlm_node_iter_next() 1115 iter->curnode = bit; in dlm_node_iter_next() 1116 return bit; in dlm_node_iter_next()
|
/fs/minix/ |
D | bitmap.c | 48 unsigned long bit, zone; in minix_free_block() local 55 bit = zone & ((1<<k) - 1); in minix_free_block() 63 if (!minix_test_and_clear_bit(bit, bh->b_data)) in minix_free_block() 189 unsigned long ino, bit; in minix_free_inode() local 196 bit = ino & ((1<<k) - 1); in minix_free_inode() 207 if (!minix_test_and_clear_bit(bit, bh->b_data)) in minix_free_inode() 208 printk("minix_free_inode: bit %lu already cleared\n", bit); in minix_free_inode()
|
/fs/afs/ |
D | dir_edit.c | 27 int bit, n; in afs_find_contig_bits() local 38 bit = 1; in afs_find_contig_bits() 49 bit += n; in afs_find_contig_bits() 52 if (bit > 64 - nr_slots) in afs_find_contig_bits() 54 return bit; in afs_find_contig_bits() 59 bit += n; in afs_find_contig_bits() 69 int bit, unsigned int nr_slots) in afs_set_contig_bits() argument 74 mask <<= bit; in afs_set_contig_bits() 90 int bit, unsigned int nr_slots) in afs_clear_contig_bits() argument 95 mask <<= bit; in afs_clear_contig_bits()
|
/fs/ext4/ |
D | mballoc.c | 384 static inline void *mb_correct_addr_and_bit(int *bit, void *addr) in mb_correct_addr_and_bit() argument 387 *bit += ((unsigned long) addr & 7UL) << 3; in mb_correct_addr_and_bit() 390 *bit += ((unsigned long) addr & 3UL) << 3; in mb_correct_addr_and_bit() 398 static inline int mb_test_bit(int bit, void *addr) in mb_test_bit() argument 404 addr = mb_correct_addr_and_bit(&bit, addr); in mb_test_bit() 405 return ext4_test_bit(bit, addr); in mb_test_bit() 408 static inline void mb_set_bit(int bit, void *addr) in mb_set_bit() argument 410 addr = mb_correct_addr_and_bit(&bit, addr); in mb_set_bit() 411 ext4_set_bit(bit, addr); in mb_set_bit() 414 static inline void mb_clear_bit(int bit, void *addr) in mb_clear_bit() argument [all …]
|
D | ialloc.c | 243 unsigned long bit; in ext4_free_inode() local 286 bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb); in ext4_free_inode() 314 cleared = ext4_test_and_clear_bit(bit, bitmap_bh->b_data); in ext4_free_inode() 759 int bit; in ext4_mark_inode_used() local 766 bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb); in ext4_mark_inode_used() 771 if (ext4_test_bit(bit, inode_bitmap_bh->b_data)) { in ext4_mark_inode_used() 782 ext4_set_bit(bit, inode_bitmap_bh->b_data); in ext4_mark_inode_used() 848 if (bit >= free) in ext4_mark_inode_used() 850 (EXT4_INODES_PER_GROUP(sb) - bit - 1)); in ext4_mark_inode_used() 1373 int bit; in ext4_orphan_get() local [all …]
|
/fs/nilfs2/ |
D | the_nilfs.h | 194 #define THE_NILFS_FNS(bit, name) \ argument 197 set_bit(THE_NILFS_##bit, &(nilfs)->ns_flags); \ 201 clear_bit(THE_NILFS_##bit, &(nilfs)->ns_flags); \ 205 return test_bit(THE_NILFS_##bit, &(nilfs)->ns_flags); \
|
/fs/jffs2/ |
D | compr_rubin.c | 57 static inline int pushbit(struct pushpull *pp, int bit, int use_reserved) in pushbit() argument 62 if (bit) in pushbit() 79 int bit; in pullbit() local 81 bit = (pp->buf[pp->ofs >> 3] >> (7-(pp->ofs & 7))) & 1; in pullbit() 84 return bit; in pullbit()
|
/fs/ |
D | select.c | 468 unsigned long out, unsigned long bit, in wait_key_set() argument 472 if (in & bit) in wait_key_set() 474 if (out & bit) in wait_key_set() 515 unsigned long in, out, ex, all_bits, bit = 1, j; in do_select() local 526 for (j = 0; j < BITS_PER_LONG; ++j, ++i, bit <<= 1) { in do_select() 530 if (!(bit & all_bits)) in do_select() 535 wait_key_set(wait, in, out, bit, in do_select() 541 if ((mask & POLLIN_SET) && (in & bit)) { in do_select() 542 res_in |= bit; in do_select() 546 if ((mask & POLLOUT_SET) && (out & bit)) { in do_select() [all …]
|
/fs/btrfs/tests/ |
D | free-space-tree-tests.c | 28 int prev_bit = 0, bit; in __check_free_space_extents() local 59 bit = free_space_test_bit(cache, path, offset); in __check_free_space_extents() 60 if (prev_bit == 0 && bit == 1) { in __check_free_space_extents() 62 } else if (prev_bit == 1 && bit == 0) { in __check_free_space_extents() 69 prev_bit = bit; in __check_free_space_extents()
|