Home
last modified time | relevance | path

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

/fs/jffs2/
A Dmini_inflate.c37 stream->codes.bits = 8; in init_stream()
45 stream->lengths.bits = 16; in init_stream()
53 stream->distance.bits = 16; in init_stream()
67 const unsigned int bits) in pull_bits() argument
73 for (i = 0; i < bits; i++) { in pull_bits()
123 int bits = 0; in read_symbol() local
125 while (!(set->count[bits] && code < set->first[bits] + in read_symbol()
126 set->count[bits])) { in read_symbol()
128 if (++bits > set->bits) { in read_symbol()
134 return set->symbols[set->pos[bits] + code - set->first[bits]]; in read_symbol()
[all …]
A Dcompr_rubin.c45 void rubin_do_decompress(unsigned char *bits, unsigned char *in, in rubin_do_decompress() argument
91 i0 = (bits[i] * p) >> 8; in rubin_do_decompress()
114 unsigned char bits[8]; in dynrubin_decompress() local
118 bits[c] = (256 - data_in[c]); in dynrubin_decompress()
120 rubin_do_decompress(bits, data_in+8, cpage_out, dstlen); in dynrubin_decompress()
/fs/btrfs/
A Dextent-io.c114 int bits) in insert_state() argument
119 state->state |= bits; in insert_state()
153 struct extent_state *state, int bits) in clear_state_bit() argument
155 int ret = state->state & bits; in clear_state_bit()
157 state->state &= ~bits; in clear_state_bit()
358 state->state |= bits; in set_extent_bits()
388 state->state |= bits; in set_extent_bits()
413 bits); in set_extent_bits()
430 state->state |= bits; in set_extent_bits()
485 int bits, int filled) in test_range_bit() argument
[all …]
A Dextent-io.h98 int set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits);
99 int clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits);
101 u64 *start_ret, u64 *end_ret, int bits);
103 int bits, int filled);
A Dctree.h181 return le##bits##_to_cpu(h->member); \
184 u##bits val) \
187 h->member = cpu_to_le##bits(val); \
190 #define BTRFS_SETGET_FUNCS(name, type, member, bits) \ argument
196 return get_unaligned_le##bits(&p->member); \
199 type *s, u##bits val) \
203 put_unaligned_le##bits(val, &p->member); \
207 static inline u##bits btrfs_##name(const type *s) \
209 return le##bits##_to_cpu(s->member); \
211 static inline void btrfs_set_##name(type *s, u##bits val) \
[all …]
/fs/ubifs/
A Dlpt.c57 int i, n, bits, per_leb_wastage, max_pnode_cnt; in do_calc_lpt_geom() local
89 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS + in do_calc_lpt_geom()
92 c->pnode_sz = (bits + 7) / 8; in do_calc_lpt_geom()
94 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS + in do_calc_lpt_geom()
97 c->nnode_sz = (bits + 7) / 8; in do_calc_lpt_geom()
99 bits = UBIFS_LPT_CRC_BITS + UBIFS_LPT_TYPE_BITS + in do_calc_lpt_geom()
101 c->ltab_sz = (bits + 7) / 8; in do_calc_lpt_geom()
105 c->lsave_sz = (bits + 7) / 8; in do_calc_lpt_geom()
531 int num, bits; in calc_nnode_num() local
535 bits = (col & (UBIFS_LPT_FANOUT - 1)); in calc_nnode_num()
[all …]
/fs/erofs/
A Dinternal.h224 unsigned int bits) in erofs_bitrange() argument
226 return (value >> bit) & ((1 << bits) - 1); in erofs_bitrange()

Completed in 15 milliseconds