Home
last modified time | relevance | path

Searched refs:filter_count (Results 1 – 3 of 3) sorted by relevance

/dragonfly/contrib/libarchive/tar/
H A Dcreation_set.c45 int filter_count; member
146 cset->filters[cset->filter_count].program = program; in _cset_add_filter()
148 cset->filter_count++; in _cset_add_filter()
168 for (i = 0; i < cset->filter_count; i++) { in cset_read_support_filter_program()
184 for (i = 0; i < cset->filter_count; i++) { in cset_write_add_filters()
234 _cleanup_filters(cset->filters, cset->filter_count); in cset_free()
261 old_filter_count = cset->filter_count; in cset_auto_compress()
263 cset->filter_count = 0; in cset_auto_compress()
303 v = malloc(sizeof(*v) * cset->filter_count); in cset_auto_compress()
307 for (i = 0, r = cset->filter_count; r > 0; ) in cset_auto_compress()
[all …]
/dragonfly/contrib/xz/src/liblzma/common/
H A Dblock_header_encoder.c111 size_t filter_count = 0; in lzma_block_header_encode() local
114 if (filter_count == LZMA_FILTERS_MAX) in lzma_block_header_encode()
118 block->filters + filter_count, in lzma_block_header_encode()
121 } while (block->filters[++filter_count].id != LZMA_VLI_UNKNOWN); in lzma_block_header_encode()
123 out[1] |= filter_count - 1; in lzma_block_header_encode()
H A Dblock_header_decoder.c101 const size_t filter_count = (in[1] & 3U) + 1; in lzma_block_header_decode() local
102 for (size_t i = 0; i < filter_count; ++i) { in lzma_block_header_decode()