Searched defs:bits (Results 1 - 25 of 26) sorted by relevance

12

/fs/minix/
H A Dbitmap.c24 * endianness is a mess, but for counting zero bits it really doesn't matter...
99 u32 bits = sbi->s_nzones - sbi->s_firstdatazone + 1; local
101 return (count_free(sbi->s_zmap, sb->s_blocksize, bits)
269 u32 bits = sbi->s_ninodes + 1; local
271 return count_free(sbi->s_imap, sb->s_blocksize, bits);
H A Dminix.h90 static inline unsigned minix_blocks_needed(unsigned bits, unsigned blocksize) argument
92 return DIV_ROUND_UP(bits, blocksize * 8);
/fs/nilfs2/
H A Dpage.c119 unsigned long bits; local
134 bits = sbh->b_state & ((1UL << BH_Uptodate) | (1UL << BH_Mapped));
137 bits &= bh->b_state;
140 if (bits & (1UL << BH_Uptodate))
144 if (bits & (1UL << BH_Mapped))
/fs/jffs2/
H A Dcompr_rubin.c44 int bits[8]; member in struct:rubin_state
93 static void init_rubin(struct rubin_state *rs, int div, int *bits) argument
103 rs->bits[c] = bits[c];
156 static void init_decode(struct rubin_state *rs, int div, int *bits) argument
158 init_rubin(rs, div, bits);
173 int c, bits = 0; local
176 * First, work out how many bits we need from the input stream.
181 bits++;
190 rs->bit_number += bits;
267 rubin_do_compress(int bit_divider, int *bits, unsigned char *data_in, unsigned char *cpage_out, uint32_t *sourcelen, uint32_t *dstlen) argument
313 int bits[8]; local
373 rubin_do_decompress(int bit_divider, int *bits, unsigned char *cdata_in, unsigned char *page_out, uint32_t srclen, uint32_t destlen) argument
402 int bits[8]; local
[all...]
/fs/ocfs2/
H A Dreservations.c56 unsigned int bits; local
60 bits = 4 << osb->osb_resv_level;
62 bits = 4 << osb->osb_dir_resv_level;
64 return bits;
407 * with length search_len for a set of contiguous free bits. We try
408 * to find up to 'wanted' bits, but can sometimes return less.
410 * Returns the length of allocation, 0 if no free bits are found.
497 * whatever window of free bits we want.
505 * will always have free bits when we're called.
528 * the entire tree. If we can find free bits i
[all...]
H A Dlocalalloc.c95 * - Likewise, we don't want to starve other nodes of bits on small
186 /* We can't store more bits than we can in a block. */
258 int ocfs2_alloc_should_use_local(struct ocfs2_super *osb, u64 bits) argument
273 if (bits > (la_bits / 2))
279 (unsigned long long)bits, osb->local_alloc_state, la_bits, ret);
372 * return any unused bits to the bitmap and write out a clean
483 * We want to free the bitmap bits outside of any recovery context as
621 * make sure we've got at least bits_wanted contiguous bits in the
651 * We must double check state and allocator bits because
669 "%u free bits, bu
1058 unsigned int bits; local
[all...]
H A Docfs2.h252 * of bits has been reduced. */
737 int bits = OCFS2_SB(sb)->s_clustersize_bits - sb->s_blocksize_bits; local
741 return (u64)clusters << bits;
850 #error "how many bits you are?!"
/fs/hpfs/
H A Dsuper.c131 unsigned long *bits; local
134 bits = hpfs_map_4sectors(s, secno, &qbh, 0);
135 if (!bits)
137 count = bitmap_weight(bits, 2048 * BITS_PER_BYTE);
/fs/
H A Dseq_file.c549 int seq_bitmap(struct seq_file *m, const unsigned long *bits, argument
554 m->size - m->count, bits, nr_bits);
565 int seq_bitmap_list(struct seq_file *m, const unsigned long *bits, argument
570 m->size - m->count, bits, nr_bits);
H A Dselect.c551 void *bits; local
576 bits = stack_fds;
580 bits = kmalloc(6 * size, GFP_KERNEL);
581 if (!bits)
584 fds.in = bits;
585 fds.out = bits + size;
586 fds.ex = bits + 2*size;
587 fds.res_in = bits + 3*size;
588 fds.res_out = bits + 4*size;
589 fds.res_ex = bits
[all...]
H A Dcompat.c220 * to stuff that into 32 bits */
275 * to stuff that into 32 bits */
1234 void *bits; local
1256 bits = stack_fds;
1258 bits = kmalloc(6 * size, GFP_KERNEL);
1260 if (!bits)
1263 fds.in = (unsigned long *) bits;
1264 fds.out = (unsigned long *) (bits + size);
1265 fds.ex = (unsigned long *) (bits + 2*size);
1266 fds.res_in = (unsigned long *) (bits
[all...]
/fs/cifs/
H A Dcifsacl.c435 bits to set can be: S_IRWXU, S_IRWXG or S_IRWXO ie 00700 or 00070 or 00007
448 control entries do not turn on the bits we are denying */
500 /* bits to use are either S_IRWXU or S_IRWXG or S_IRWXO */
504 is this but we have cleared all the bits sans RWX for
519 const struct cifs_sid *psid, __u64 nmode, umode_t bits)
527 mode_to_access_flags(nmode, bits, &access_req);
788 /* Convert permission bits from mode to equivalent CIFS ACL */
1006 /* Translate the CIFS ACL (simlar to NTFS ACL) for a file into mode bits */
1050 /* Convert mode bits to an ACL so we can update the ACL on the server */
518 fill_ace_for_sid(struct cifs_ace *pntace, const struct cifs_sid *psid, __u64 nmode, umode_t bits) argument
/fs/ext2/
H A Dsuper.c700 static loff_t ext2_max_size(int bits) argument
716 upper_limit >>= (bits - 9);
722 meta_blocks += 1 + (1LL << (bits-2));
724 meta_blocks += 1 + (1LL << (bits-2)) + (1LL << (2*(bits-2)));
727 upper_limit <<= bits; local
729 res += 1LL << (bits-2);
730 res += 1LL << (2*(bits-2));
731 res += 1LL << (3*(bits-2));
732 res <<= bits; local
[all...]
/fs/f2fs/
H A Dsuper.c755 static loff_t max_file_size(unsigned bits) argument
771 result <<= bits; local
/fs/ubifs/
H A Dlpt.c60 int i, n, bits, per_leb_wastage, max_pnode_cnt; local
92 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
95 c->pnode_sz = (bits + 7) / 8;
97 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
100 c->nnode_sz = (bits + 7) / 8;
102 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
104 c->ltab_sz = (bits + 7) / 8;
106 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS +
108 c->lsave_sz = (bits + 7) / 8;
231 * @nrbits: number of bits o
534 int num, bits; local
[all...]
/fs/btrfs/
H A Dfree-space-cache.c1581 unsigned long bits, i; local
1587 bits = bytes_to_bits(*bytes, ctl->unit);
1593 if (extent_bits >= bits) {
1713 * We need to search for bits in this bitmap. We could only cover some
1725 /* We may have found more bits than what we need */
H A Dsuper.c1780 int bits = dentry->d_sb->s_blocksize_bits; local
1819 buf->f_blocks >>= bits;
1820 buf->f_bfree = buf->f_blocks - (div_u64(total_used, factor) >> bits);
1824 buf->f_bfree -= block_rsv->size >> bits;
1835 buf->f_bavail = buf->f_bavail >> bits;
H A Dextent_io.c125 /* tells writepage not to lock the state bits for this range
399 struct extent_state *state, unsigned long *bits)
402 tree->ops->set_bit_hook(tree->mapping->host, state, bits);
406 struct extent_state *state, unsigned long *bits)
409 tree->ops->clear_bit_hook(tree->mapping->host, state, bits);
413 struct extent_state *state, unsigned long *bits);
416 * insert an extent_state struct into the tree. 'bits' are set on the
429 unsigned long *bits)
439 set_state_bits(tree, state, bits);
506 * utility function to clear some bits i
398 set_state_cb(struct extent_io_tree *tree, struct extent_state *state, unsigned long *bits) argument
405 clear_state_cb(struct extent_io_tree *tree, struct extent_state *state, unsigned long *bits) argument
425 insert_state(struct extent_io_tree *tree, struct extent_state *state, u64 start, u64 end, struct rb_node ***p, struct rb_node **parent, unsigned long *bits) argument
512 clear_state_bit(struct extent_io_tree *tree, struct extent_state *state, unsigned long *bits, int wake) argument
572 clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, int wake, int delete, struct extent_state **cached_state, gfp_t mask) argument
739 wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits) argument
785 set_state_bits(struct extent_io_tree *tree, struct extent_state *state, unsigned long *bits) argument
822 __set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, unsigned long exclusive_bits, u64 *failed_start, struct extent_state **cached_state, gfp_t mask) argument
1023 set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, u64 * failed_start, struct extent_state **cached_state, gfp_t mask) argument
1049 convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, unsigned long clear_bits, struct extent_state **cached_state, gfp_t mask) argument
1248 set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, gfp_t mask) argument
1255 clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, gfp_t mask) argument
1310 lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, struct extent_state **cached_state) argument
1420 find_first_extent_bit_state(struct extent_io_tree *tree, u64 start, unsigned long bits) argument
1454 find_first_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, unsigned long bits, struct extent_state **cached_state) argument
1784 count_range_bits(struct extent_io_tree *tree, u64 *start, u64 search_end, u64 max_bytes, unsigned long bits, int contig) argument
1903 test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, unsigned long bits, int filled, struct extent_state *cached) argument
[all...]
H A Dextent-tree.c123 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits) argument
125 return (cache->flags & bits) == bits;
5640 * delalloc bits in the io_tree. We have to do this since we could end up
6523 * allocation bits, or if its not cached.
7171 * space cache bits as well
H A Dinode.c371 * locked (both pages and state bits are locked).
1007 * clear any dirty bits and don't set any writeback bits
1588 struct extent_state *state, unsigned long *bits)
1591 if ((*bits & EXTENT_DEFRAG) && !(*bits & EXTENT_DELALLOC))
1598 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1603 if (*bits & EXTENT_FIRST_DELALLOC) {
1604 *bits &= ~EXTENT_FIRST_DELALLOC;
1615 if (*bits
1587 btrfs_set_bit_hook(struct inode *inode, struct extent_state *state, unsigned long *bits) argument
1627 btrfs_clear_bit_hook(struct inode *inode, struct extent_state *state, unsigned long *bits) argument
[all...]
/fs/ext3/
H A Dsuper.c1615 static loff_t ext3_max_size(int bits) argument
1631 upper_limit >>= (bits - 9);
1637 meta_blocks += 1 + (1LL << (bits-2));
1639 meta_blocks += 1 + (1LL << (bits-2)) + (1LL << (2*(bits-2)));
1642 upper_limit <<= bits; local
1644 res += 1LL << (bits-2);
1645 res += 1LL << (2*(bits-2));
1646 res += 1LL << (3*(bits-2));
1647 res <<= bits; local
[all...]
/fs/reiserfs/
H A Dsuper.c820 * when this value is found, 0 is no bits are to be changed.
825 * when this value is found, 0 is no bits are to be changed.
849 * when this value is found, 0 is no bits are to be changed.
855 * when this value is found, 0 is no bits are to be changed.
880 * possible values for "-o block-allocator=" and bits which are to be set in
1319 static void handle_barrier_mode(struct super_block *s, unsigned long bits) argument
1325 if (bits & all_barrier) {
1327 if (bits & flush) {
1330 } else if (bits & none) {
1436 * the bits w
[all...]
/fs/ext4/
H A Dmballoc.c220 * bits from PA, only from on-disk bitmap
229 * 3) we work on bitmaps and '+' actually means 'set bits'. if on-disk has
286 * mark bits in on-disk bitmap
292 * mark bits in on-disk bitmap
298 * mark bits in on-disk bitmap
381 #error "how many bits you are?!"
600 /* both bits in buddy2 must be 1 */
627 /* check used bits only */
660 * Clear the bits in bitmap which the blocks of the chunk(s) covered,
707 int bits; local
[all...]
H A Dsuper.c2254 * in the vfs. ext4 inode has 48 bits of i_block in fsblock units,
2304 static loff_t ext4_max_bitmap_size(int bits, int has_huge_files) argument
2326 upper_limit >>= (bits - 9);
2342 meta_blocks += 1 + (1LL << (bits-2));
2344 meta_blocks += 1 + (1LL << (bits-2)) + (1LL << (2*(bits-2)));
2347 upper_limit <<= bits; local
2349 res += 1LL << (bits-2);
2350 res += 1LL << (2*(bits-2));
2351 res += 1LL << (3*(bits
2352 res <<= bits; local
[all...]
/fs/ocfs2/cluster/
H A Dheartbeat.c398 unsigned int bits = reg->hr_block_bits; local
416 bio->bi_iter.bi_sector = (reg->hr_start_block + cs) << (bits - 9);
421 vec_start = (cs << bits) % PAGE_CACHE_SIZE;
1430 * heartbeat configfs bits. The heartbeat set is a default set under

Completed in 467 milliseconds

12