Home
last modified time | relevance | path

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

/oneTBB/examples/graph/fgbzip2/
H A Dhuffman.cpp111 void BZ2_hbMakeCodeLengths(UChar *len, Int32 *freq, Int32 alphaSize, Int32 maxLen) { in BZ2_hbMakeCodeLengths() argument
123 for (i = 0; i < alphaSize; i++) in BZ2_hbMakeCodeLengths()
127 nNodes = alphaSize; in BZ2_hbMakeCodeLengths()
134 for (i = 1; i <= alphaSize; i++) { in BZ2_hbMakeCodeLengths()
164 for (i = 1; i <= alphaSize; i++) { in BZ2_hbMakeCodeLengths()
196 for (i = 1; i <= alphaSize; i++) { in BZ2_hbMakeCodeLengths()
205 void BZ2_hbAssignCodes(Int32 *code, UChar *length, Int32 minLen, Int32 maxLen, Int32 alphaSize) { in BZ2_hbAssignCodes() argument
210 for (i = 0; i < alphaSize; i++) in BZ2_hbAssignCodes()
226 Int32 alphaSize) { in BZ2_hbCreateDecodeTables() argument
231 for (j = 0; j < alphaSize; j++) in BZ2_hbCreateDecodeTables()
[all …]
H A Dcompress.cpp278 Int32 nSelectors, alphaSize, minLen, maxLen, selCtr; in sendMTFValues() local
303 alphaSize = s->nInUse + 2; in sendMTFValues()
305 for (j = 0; j < alphaSize; j++) in sendMTFValues()
332 while (aFreq < tFreq && ge < alphaSize - 1) { in sendMTFValues()
351 for (i = 0; i < alphaSize; i++) in sendMTFValues()
371 for (j = 0; j < alphaSize; j++) in sendMTFValues()
379 for (i = 0; i < alphaSize; i++) { in sendMTFValues()
583 BZ2_hbMakeCodeLengths(&(s->len[i][0]), &(s->rfreq[i][0]), alphaSize, 17 /*20*/); in sendMTFValues()
613 for (i = 0; i < alphaSize; i++) { in sendMTFValues()
621 BZ2_hbAssignCodes(&(s->code[j][0]), &(s->len[j][0]), minLen, maxLen, alphaSize); in sendMTFValues()
[all …]
H A Ddecompress.cpp157 Int32 alphaSize; in BZ2_decompress() local
211 alphaSize = s->save_alphaSize; in BZ2_decompress()
338 alphaSize = s->nInUse + 2; in BZ2_decompress()
381 for (i = 0; i < alphaSize; i++) { in BZ2_decompress()
402 for (i = 0; i < alphaSize; i++) { in BZ2_decompress()
414 alphaSize); in BZ2_decompress()
705 s->save_alphaSize = alphaSize; in BZ2_decompress()