Home
last modified time | relevance | path

Searched refs:nblock (Results 1 – 4 of 4) sorted by relevance

/busybox-1.35.0/archival/libarchive/bz/
Dbzlib.c57 s->nblock = 0; in prepare_new_block()
130 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
133 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
136 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
140 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
141 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
142 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
143 s->block[s->nblock] = (uint8_t)ch; s->nblock++; in add_pair_to_block()
144 s->block[s->nblock] = (uint8_t)(s->state_in_len - 4); in add_pair_to_block()
145 s->nblock++; in add_pair_to_block()
[all …]
Dblocksort.c246 const int32_t nblock = state->nblock; in fallbackSort() local
253 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++; in fallbackSort()
262 for (i = 0; i < nblock; i++) { in fallbackSort()
269 nBhtab = 2 + ((uint32_t)nblock / 32); /* bbox: unsigned div is easier */ in fallbackSort()
281 SET_BH(nblock + 2*i); in fallbackSort()
282 CLEAR_BH(nblock + 2*i + 1); in fallbackSort()
289 for (i = 0; i < nblock; i++) { in fallbackSort()
294 k += nblock; in fallbackSort()
311 if (l >= nblock) in fallbackSort()
320 if (r >= nblock) in fallbackSort()
[all …]
Dcompress.c234 for (i = 0; i < s->nblock; i++) { in generateMTFValues()
241 j += s->nblock; in generateMTFValues()
681 if (s->nblock > 0) { in BZ2_compressBlock()
691 s->zbits = &((uint8_t*)s->arr2)[s->nblock]; in BZ2_compressBlock()
705 if (s->nblock > 0) { in BZ2_compressBlock()
Dbzlib_private.h153 int32_t nblock; member