Home
last modified time | relevance | path

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

/oneTBB/examples/graph/fgbzip2/
H A Dblocksort.cpp331 k += nblock; in fallbackSort()
514 k = nblock + 8; in mainGtU()
606 if (i1 >= nblock) in mainGtU()
607 i1 -= nblock; in mainGtU()
608 if (i2 >= nblock) in mainGtU()
609 i2 -= nblock; in mainGtU()
951 i = nblock - 1; in mainSort()
986 i = nblock - 1; in mainSort()
1196 nblock, in mainSort()
1222 Int32 nblock = s->nblock; in BZ2_blockSort() local
[all …]
H A Ddecompress.cpp165 Int32 nblock; in BZ2_decompress() local
219 nblock = s->save_nblock; in BZ2_decompress()
442 nblock = 0; in BZ2_decompress()
475 if (nblock >= nblockMAX) in BZ2_decompress()
478 nblock++; in BZ2_decompress()
486 nblock++; in BZ2_decompress()
493 if (nblock >= nblockMAX) in BZ2_decompress()
557 nblock++; in BZ2_decompress()
609 for (i = 0; i < nblock; i++) { in BZ2_decompress()
641 for (i = 0; i < nblock; i++) { in BZ2_decompress()
[all …]
H A Dbzlib.cpp156 s->nblock = 0; in prepare_new_block()
258 s->nblock++; in add_pair_to_block()
262 s->nblock++; in add_pair_to_block()
264 s->nblock++; in add_pair_to_block()
268 s->nblock++; in add_pair_to_block()
270 s->nblock++; in add_pair_to_block()
272 s->nblock++; in add_pair_to_block()
277 s->nblock++; in add_pair_to_block()
279 s->nblock++; in add_pair_to_block()
281 s->nblock++; in add_pair_to_block()
[all …]
H A Dcompress.cpp189 for (i = 0; i < s->nblock; i++) { in generateMTFValues()
194 j += s->nblock; in generateMTFValues()
299 s->nblock, in sendMTFValues()
781 if (s->nblock > 0) { in BZ2_compressBlock()
794 s->nblock); in BZ2_compressBlock()
799 s->zbits = (UChar*)(&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
810 if (s->nblock > 0) { in BZ2_compressBlock()
H A Dbzlib_private.hpp271 Int32 nblock; member