Home
last modified time | relevance | path

Searched refs:fill (Results 1 – 11 of 11) sorted by relevance

/lib/
A Ddecompress_unlz4.c63 if (input && fill) { in unlz4()
68 } else if (!fill) { in unlz4()
83 if (fill) { in unlz4()
84 size = fill(inp, 4); in unlz4()
93 if (!fill) { in unlz4()
107 if (fill) { in unlz4()
108 size = fill(inp, 4); in unlz4()
122 if (!fill) { in unlz4()
139 if (!fill) { in unlz4()
147 size = fill(inp, chunksize); in unlz4()
[all …]
A Ddecompress_unlzo.c98 long (*fill)(void *, unsigned long), in unlzo()
123 if (input && fill) { in unlzo()
128 } else if (!fill) { in unlzo()
143 if (fill) { in unlzo()
151 in_len = fill(in_buf, HEADER_SIZE_MAX); in unlzo()
161 if (fill) { in unlzo()
172 if (fill && in_len < 4) { in unlzo()
198 if (fill && in_len < 8) { in unlzo()
217 if (fill && in_len < src_len) { in unlzo()
252 if (fill) { in unlzo()
[all …]
A Ddecompress_inflate.c43 long (*fill)(void*, unsigned long), in __gunzip()
94 if (!fill) in __gunzip()
95 fill = nofill; in __gunzip()
98 len = fill(zbuf, GZIP_IOBUF_SIZE); in __gunzip()
147 len = fill(zbuf, GZIP_IOBUF_SIZE); in __gunzip()
201 long (*fill)(void*, unsigned long), in gunzip()
207 return __gunzip(buf, len, fill, flush, out_buf, 0, pos, error); in gunzip()
211 long (*fill)(void*, unsigned long), in __decompress()
217 return __gunzip(buf, len, fill, flush, out_buf, out_len, pos, error); in __decompress()
A Dbtree.c412 int fill; in btree_grow() local
430 int fill; in btree_shrink() local
437 BUG_ON(fill > 1); in btree_shrink()
448 int i, pos, fill, err; in btree_insert_level() local
464 if (fill == geo->no_pairs) { in btree_insert_level()
485 if (fill & 1) { in btree_insert_level()
541 if (fill == 0) { in rebalance()
561 child, fill, in rebalance()
571 child, fill, in rebalance()
590 int i, pos, fill; in btree_remove_level() local
[all …]
A Ddecompress_unzstd.c166 long (*fill)(void*, unsigned long), in __unzstd()
191 if (fill == NULL && flush == NULL) in __unzstd()
215 if (fill != NULL) in __unzstd()
216 in_len = fill(in_buf, ZSTD_IOBUF_SIZE); in __unzstd()
293 in_len = fill ? fill(in_buf, ZSTD_IOBUF_SIZE) : -1; in __unzstd()
334 long (*fill)(void*, unsigned long), in unzstd()
340 return __unzstd(buf, len, fill, flush, out_buf, 0, pos, error); in unzstd()
344 long (*fill)(void*, unsigned long), in __decompress()
350 return __unzstd(buf, len, fill, flush, out_buf, out_len, pos, error); in __decompress()
A Ddecompress_unxz.c259 long (*fill)(void *dest, unsigned long size), in unxz()
276 if (fill == NULL && flush == NULL) in unxz()
306 if (fill == NULL && flush == NULL) { in unxz()
310 if (b.in_pos == b.in_size && fill != NULL) { in unxz()
316 in_size = fill(in, XZ_IOBUF_SIZE); in unxz()
406 long (*fill)(void *dest, unsigned long size), in __decompress()
412 return unxz(in, in_size, fill, flush, out, in_used, error); in __decompress()
A Ddecompress_bunzip2.c96 long (*fill)(void*, unsigned long); member
129 bd->inbufCount = bd->fill(bd->inbuf, BZIP2_IOBUF_SIZE); in get_bits()
631 long (*fill)(void*, unsigned long)) in start_bunzip()
650 if (fill != NULL) in start_bunzip()
651 bd->fill = fill; in start_bunzip()
653 bd->fill = nofill; in start_bunzip()
681 long (*fill)(void*, unsigned long), in bunzip2()
707 i = start_bunzip(&bd, inbuf, len, fill); in bunzip2()
749 long (*fill)(void*, unsigned long), in __decompress()
755 return bunzip2(buf, len - 4, fill, flush, outbuf, pos, error); in __decompress()
A Ddecompress_unlzma.c70 long (*fill)(void*, unsigned long); member
95 rc->buffer_size = rc->fill((char *)rc->buffer, LZMA_IOBUF_SIZE); in rc_read()
104 long (*fill)(void*, unsigned long), in rc_init()
107 if (fill) in rc_init()
108 rc->fill = fill; in rc_init()
110 rc->fill = nofill; in rc_init()
540 long (*fill)(void*, unsigned long), in unlzma()
580 rc_init(&rc, fill, inbuf, in_len); in unlzma()
673 long (*fill)(void*, unsigned long), in __decompress()
679 return unlzma(buf, in_len - 4, fill, flush, output, posp, error); in __decompress()
/lib/crypto/
A Dblake2s.c27 const size_t fill = BLAKE2S_BLOCK_SIZE - state->buflen; in blake2s_update() local
31 if (inlen > fill) { in blake2s_update()
32 memcpy(state->buf + state->buflen, in, fill); in blake2s_update()
35 in += fill; in blake2s_update()
36 inlen -= fill; in blake2s_update()
/lib/zlib_inflate/
A Dinftrees.c36 unsigned fill; /* index for replicating entries */ in zlib_inflate_table() local
220 fill = 1U << curr; in zlib_inflate_table()
221 min = fill; /* save offset to next table */ in zlib_inflate_table()
223 fill -= incr; in zlib_inflate_table()
224 next[(huff >> drop) + fill] = this; in zlib_inflate_table()
225 } while (fill != 0); in zlib_inflate_table()
/lib/tests/
A Dstackinit_kunit.c270 static noinline int leaf_ ## name(unsigned long sp, bool fill, \
285 if (fill) { \
458 static int noinline __leaf_switch_none(int path, bool fill) in __leaf_switch_none() argument
470 if (fill) { in __leaf_switch_none()
481 if (fill) { in __leaf_switch_none()
496 static noinline int leaf_switch_1_none(unsigned long sp, bool fill, in leaf_switch_1_none() argument
499 return __leaf_switch_none(1, fill); in leaf_switch_1_none()
502 static noinline int leaf_switch_2_none(unsigned long sp, bool fill, in leaf_switch_2_none() argument
505 return __leaf_switch_none(2, fill); in leaf_switch_2_none()

Completed in 24 milliseconds