Home
last modified time | relevance | path

Searched refs:bits (Results 1 – 25 of 55) sorted by relevance

123

/fs/jffs2/
A Dcompr_rubin.c44 int bits[8]; member
98 rs->bits[c] = bits[c]; in init_rubin()
168 int c, bits = 0; in __do_decode() local
176 bits++; in __do_decode()
196 } while (--bits); in __do_decode()
255 rs->bits[i]) << i; in in_byte()
303 int bits[8]; in jffs2_dynrubin_compress() local
339 bits[i] = (bits[i] * 256) / mysrclen; in jffs2_dynrubin_compress()
340 if (!bits[i]) bits[i] = 1; in jffs2_dynrubin_compress()
341 if (bits[i] > 255) bits[i] = 255; in jffs2_dynrubin_compress()
[all …]
/fs/btrfs/
A Daccessors.c51 #define DEFINE_BTRFS_SETGET_BITS(bits) \ argument
52 u##bits btrfs_get_##bits(const struct extent_buffer *eb, \
61 u8 lebytes[sizeof(u##bits)]; \
68 likely(sizeof(u##bits) <= part)) \
69 return get_unaligned_le##bits(kaddr); \
71 if (sizeof(u##bits) == 2) { \
78 part, sizeof(u##bits)); \
83 unsigned long off, u##bits val) \
91 u8 lebytes[sizeof(u##bits)]; \
99 put_unaligned_le##bits(val, kaddr); \
[all …]
A Dextent-io-tree.c194 if (set && (state->state & bits) == bits) in add_extent_changeset()
422 u32 bits, in insert_state() argument
631 bits |= ~EXTENT_CTLBITS; in btrfs_clear_extent_bit_changeset()
634 bits |= EXTENT_NORESERVE; in btrfs_clear_extent_bit_changeset()
864 u64 start, u32 bits) in find_first_extent_bit_state() argument
874 if (state->state & bits) in find_first_extent_bit_state()
1165 if ((state->state & bits) == bits) { in set_extent_bit()
1722 if (state->end >= cur_start && (state->state & bits) == bits) { in btrfs_count_range_bits()
1791 *bits = 0; in btrfs_get_range_bits()
1803 *bits |= state->state; in btrfs_get_range_bits()
[all …]
A Dextent-io-tree.h147 u32 bits, struct extent_state **cached);
166 u64 max_bytes, u32 bits, int contig,
176 u32 bits, struct extent_changeset *changeset);
178 u32 bits, struct extent_state **cached,
182 u64 end, u32 bits, in btrfs_clear_extent_bit() argument
196 u32 bits, struct extent_changeset *changeset);
198 u32 bits, struct extent_state **cached_state);
209 u32 bits, u32 clear_bits,
213 u64 *start_ret, u64 *end_ret, u32 bits,
216 u64 *start_ret, u64 *end_ret, u32 bits);
[all …]
A Daccessors.h50 #define DECLARE_BTRFS_SETGET_BITS(bits) \ argument
51 u##bits btrfs_get_##bits(const struct extent_buffer *eb, \
54 unsigned long off, u##bits val);
61 #define BTRFS_SETGET_FUNCS(name, type, member, bits) \ argument
69 u##bits val) \
80 return get_unaligned_le##bits(&p->member); \
83 u##bits val) \
86 put_unaligned_le##bits(val, &p->member); \
90 static inline u##bits btrfs_##name(const type *s) \
92 return get_unaligned_le##bits(&s->member); \
[all …]
/fs/bcachefs/
A Dbkey.c162 if (bits >= state->bits) { in get_inc_field()
164 bits -= state->bits; in get_inc_field()
174 state->bits -= bits; in get_inc_field()
184 if (bits) { in __set_inc_field()
185 if (bits > state->bits) { in __set_inc_field()
186 bits -= state->bits; in __set_inc_field()
196 state->bits -= bits; in __set_inc_field()
576 bits = min(bits, unpacked_bits); in set_format_field()
606 bits += b; in bch2_bkey_format_done()
612 bits = ret.key_u64s * 64 - bits; in bch2_bkey_format_done()
[all …]
A Dbuckets_waiting_for_journal.c12 return t->d + hash_64(dev_bucket ^ t->hash_seeds[hash_seed_idx], t->bits); in bucket_hash()
15 static void bucket_table_init(struct buckets_waiting_for_journal_table *t, size_t bits) in bucket_table_init() argument
19 t->bits = bits; in bucket_table_init()
22 memset(t->d, 0, sizeof(t->d[0]) << t->bits); in bucket_table_init()
103 size = 1UL << t->bits; in bch2_set_bucket_needs_journal_commit()
132 for (i = 0; i < 1UL << t->bits; i++) { in bch2_set_bucket_needs_journal_commit()
145 nr_rehashes, nr_elements, 1UL << b->t->bits); in bch2_set_bucket_needs_journal_commit()
A Dvarint.c23 unsigned bits = fls64(v|1); in bch2_varint_encode() local
24 unsigned bytes = DIV_ROUND_UP(bits, 7); in bch2_varint_encode()
84 unsigned bits = fls64(v|1); in bch2_varint_encode_fast() local
85 unsigned bytes = DIV_ROUND_UP(bits, 7); in bch2_varint_encode_fast()
A Dbuckets_waiting_for_journal_types.h13 unsigned bits; member
/fs/ocfs2/cluster/
A Dmasklog.h118 #define __mlog_test_u64(mask, bits) \ argument
120 ((u64)(mask) >> 32) & bits.words[1] )
121 #define __mlog_set_u64(mask, bits) do { \ argument
122 bits.words[0] |= (u32)(mask & 0xffffffff); \
123 bits.words[1] |= (u64)(mask) >> 32; \
125 #define __mlog_clear_u64(mask, bits) do { \ argument
138 #define __mlog_test_u64(mask, bits) ((mask) & bits.words[0]) argument
139 #define __mlog_set_u64(mask, bits) do { \ argument
140 bits.words[0] |= (mask); \
142 #define __mlog_clear_u64(mask, bits) do { \ argument
[all …]
A Dheartbeat.h62 unsigned int bits);
/fs/crypto/
A Dfname.c188 int bits = 0; in fscrypt_base64url_encode() local
194 bits += 8; in fscrypt_base64url_encode()
196 bits -= 6; in fscrypt_base64url_encode()
198 } while (bits >= 6); in fscrypt_base64url_encode()
200 if (bits) in fscrypt_base64url_encode()
223 int bits = 0; in fscrypt_base64url_decode() local
233 bits += 6; in fscrypt_base64url_decode()
234 if (bits >= 8) { in fscrypt_base64url_decode()
235 bits -= 8; in fscrypt_base64url_decode()
236 *bp++ = (u8)(ac >> bits); in fscrypt_base64url_decode()
[all …]
/fs/ntfs3/
A Dbitmap.c719 for (; iw < wnd->nwnd && bits; iw++, bit += op, bits -= op, wbit = 0) { in wnd_set_free()
761 for (; iw < wnd->nwnd && bits; iw++, bit += op, bits -= op, wbit = 0) { in wnd_set_used()
806 for (i = 0; i < bits; i++) { in wnd_set_used_safe()
841 for (; iw < wnd->nwnd && bits; iw++, bits -= op, wbit = 0) { in wnd_is_free_hlp()
917 end = bit + bits; in wnd_is_used()
927 for (; iw < wnd->nwnd && bits; iw++, bits -= op, wbit = 0) { in wnd_is_used()
1314 size_t bits, iw, new_wnd; in wnd_extend() local
1340 bits = new_bits - old_bits; in wnd_extend()
1352 op = b0 + bits > wbits ? wbits - b0 : bits; in wnd_extend()
1376 bits -= op; in wnd_extend()
[all …]
A DKconfig18 bool "64 bits per NTFS clusters"
21 Windows implementation of ntfs.sys uses 32 bits per clusters.
22 If activated 64 bits per clusters you will be able to use 4k cluster
A Dntfs_fs.h840 int wnd_set_free(struct wnd_bitmap *wnd, size_t bit, size_t bits);
841 int wnd_set_used(struct wnd_bitmap *wnd, size_t bit, size_t bits);
842 int wnd_set_used_safe(struct wnd_bitmap *wnd, size_t bit, size_t bits,
844 bool wnd_is_free(struct wnd_bitmap *wnd, size_t bit, size_t bits);
845 bool wnd_is_used(struct wnd_bitmap *wnd, size_t bit, size_t bits);
858 unsigned int ntfs_bitmap_weight_le(const void *bitmap, int bits);
956 static inline size_t ntfs3_bitmap_size(size_t bits) in ntfs3_bitmap_size() argument
958 return BITS_TO_U64(bits) * sizeof(u64); in ntfs3_bitmap_size()
1047 static inline void ni_set_ext_compress_bits(struct ntfs_inode *ni, u8 bits) in ni_set_ext_compress_bits() argument
1049 ni->ni_flags |= (bits - 0xb) & NI_FLAG_COMPRESSED_MASK; in ni_set_ext_compress_bits()
/fs/ceph/
A Dcrypto.c30 int bits = 0; in ceph_base64_encode() local
36 bits += 8; in ceph_base64_encode()
38 bits -= 6; in ceph_base64_encode()
40 } while (bits >= 6); in ceph_base64_encode()
42 if (bits) in ceph_base64_encode()
50 int bits = 0; in ceph_base64_decode() local
60 bits += 6; in ceph_base64_decode()
61 if (bits >= 8) { in ceph_base64_decode()
62 bits -= 8; in ceph_base64_decode()
63 *bp++ = (u8)(ac >> bits); in ceph_base64_decode()
[all …]
/fs/
A Dselect.c625 void *bits; in core_sys_select() local
650 bits = stack_fds; in core_sys_select()
659 if (!bits) in core_sys_select()
662 fds.in = bits; in core_sys_select()
694 if (bits != stack_fds) in core_sys_select()
695 kvfree(bits); in core_sys_select()
1193 void *bits; in compat_core_sys_select() local
1215 bits = stack_fds; in compat_core_sys_select()
1219 if (!bits) in compat_core_sys_select()
1253 if (bits != stack_fds) in compat_core_sys_select()
[all …]
/fs/minix/
A Dbitmap.c100 u32 bits = sbi->s_nzones - sbi->s_firstdatazone + 1; in minix_count_free_blocks() local
102 return (count_free(sbi->s_zmap, sb->s_blocksize, bits) in minix_count_free_blocks()
266 u32 bits = sbi->s_ninodes + 1; in minix_count_free_inodes() local
268 return count_free(sbi->s_imap, sb->s_blocksize, bits); in minix_count_free_inodes()
A Dminix.h92 static inline unsigned minix_blocks_needed(unsigned bits, unsigned blocksize) in minix_blocks_needed() argument
94 return DIV_ROUND_UP(bits, blocksize * 8); in minix_blocks_needed()
/fs/nilfs2/
A Dpage.c103 unsigned long bits; in nilfs_copy_buffer() local
118 bits = sbh->b_state & (BIT(BH_Uptodate) | BIT(BH_Mapped)); in nilfs_copy_buffer()
121 bits &= bh->b_state; in nilfs_copy_buffer()
124 if (bits & BIT(BH_Uptodate)) in nilfs_copy_buffer()
128 if (bits & BIT(BH_Mapped)) in nilfs_copy_buffer()
/fs/ocfs2/
A Dlocalalloc.c243 int ocfs2_alloc_should_use_local(struct ocfs2_super *osb, u64 bits) in ocfs2_alloc_should_use_local() argument
258 if (bits > (la_bits / 2)) in ocfs2_alloc_should_use_local()
264 (unsigned long long)bits, osb->local_alloc_state, la_bits, ret); in ocfs2_alloc_should_use_local()
1038 unsigned int bits; in ocfs2_recalc_la_window() local
1057 bits = osb->local_alloc_bits >> 1; in ocfs2_recalc_la_window()
1058 if (bits > ocfs2_megabytes_to_clusters(osb->sb, 1)) { in ocfs2_recalc_la_window()
1067 osb->local_alloc_bits = bits; in ocfs2_recalc_la_window()
A Dreservations.c43 unsigned int bits; in ocfs2_resv_window_bits() local
47 bits = 4 << osb->osb_resv_level; in ocfs2_resv_window_bits()
49 bits = 4 << osb->osb_dir_resv_level; in ocfs2_resv_window_bits()
51 return bits; in ocfs2_resv_window_bits()
/fs/ntfs3/lib/
A Ddecompress_common.h128 u32 bits = bitstream_peek_bits(is, num_bits); in bitstream_pop_bits() local
131 return bits; in bitstream_pop_bits()
/fs/ubifs/
A Dlpt.c48 int i, n, bits, per_leb_wastage, max_pnode_cnt; in do_calc_lpt_geom() local
80 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS + in do_calc_lpt_geom()
83 c->pnode_sz = (bits + 7) / 8; in do_calc_lpt_geom()
85 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS + in do_calc_lpt_geom()
88 c->nnode_sz = (bits + 7) / 8; in do_calc_lpt_geom()
90 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS + in do_calc_lpt_geom()
92 c->ltab_sz = (bits + 7) / 8; in do_calc_lpt_geom()
96 c->lsave_sz = (bits + 7) / 8; in do_calc_lpt_geom()
524 int num, bits; in calc_nnode_num() local
528 bits = (col & (UBIFS_LPT_FANOUT - 1)); in calc_nnode_num()
[all …]
/fs/hpfs/
A Dsuper.c137 unsigned long *bits; in hpfs_count_one_bitmap() local
140 bits = hpfs_map_4sectors(s, secno, &qbh, 0); in hpfs_count_one_bitmap()
141 if (!bits) in hpfs_count_one_bitmap()
143 count = bitmap_weight(bits, 2048 * BITS_PER_BYTE); in hpfs_count_one_bitmap()

Completed in 60 milliseconds

123