Lines Matching refs:n
155 U32 n; in HUF_writeCTable_wksp() local
177 for (n = 1; n < huffLog + 1; n++) in HUF_writeCTable_wksp()
178 bitsToWeight[n] = (BYTE)(huffLog + 1 - n); in HUF_writeCTable_wksp()
179 for (n = 0; n < maxSymbolValue; n++) in HUF_writeCTable_wksp()
180 huffWeight[n] = bitsToWeight[CTable[n].nbBits]; in HUF_writeCTable_wksp()
198 for (n = 0; n < maxSymbolValue; n += 2) in HUF_writeCTable_wksp()
199 op[(n / 2) + 1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n + 1]); in HUF_writeCTable_wksp()
235 U32 n, nextRankStart = 0; in HUF_readCTable_wksp() local
236 for (n = 1; n <= tableLog; n++) { in HUF_readCTable_wksp()
238 nextRankStart += (rankVal[n] << (n - 1)); in HUF_readCTable_wksp()
239 rankVal[n] = curr; in HUF_readCTable_wksp()
245 U32 n; in HUF_readCTable_wksp() local
246 for (n = 0; n < nbSymbols; n++) { in HUF_readCTable_wksp()
247 const U32 w = huffWeight[n]; in HUF_readCTable_wksp()
248 CTable[n].nbBits = (BYTE)(tableLog + 1 - w); in HUF_readCTable_wksp()
257 U32 n; in HUF_readCTable_wksp() local
258 for (n = 0; n < nbSymbols; n++) in HUF_readCTable_wksp()
259 nbPerRank[CTable[n].nbBits]++; in HUF_readCTable_wksp()
265 U32 n; in HUF_readCTable_wksp() local
266 for (n = tableLog; n > 0; n--) { /* start at n=tablelog <-> w=1 */ in HUF_readCTable_wksp()
267 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable_wksp()
268 min += nbPerRank[n]; in HUF_readCTable_wksp()
274 U32 n; in HUF_readCTable_wksp() local
275 for (n = 0; n <= maxSymbolValue; n++) in HUF_readCTable_wksp()
276 CTable[n].val = valPerRank[CTable[n].nbBits]++; in HUF_readCTable_wksp()
300 U32 n = lastNonNull; in HUF_setMaxHeight() local
302 while (huffNode[n].nbBits > maxNbBits) { in HUF_setMaxHeight()
303 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits)); in HUF_setMaxHeight()
304 huffNode[n].nbBits = (BYTE)maxNbBits; in HUF_setMaxHeight()
305 n--; in HUF_setMaxHeight()
307 while (huffNode[n].nbBits == maxNbBits) in HUF_setMaxHeight()
308 n--; /* n end at index of smallest symbol using < maxNbBits */ in HUF_setMaxHeight()
323 for (pos = n; pos >= 0; pos--) { in HUF_setMaxHeight()
367 while (huffNode[n].nbBits == maxNbBits) in HUF_setMaxHeight()
368 n--; in HUF_setMaxHeight()
369 huffNode[n + 1].nbBits--; in HUF_setMaxHeight()
370 rankLast[1] = n + 1; in HUF_setMaxHeight()
392 U32 n; in HUF_sort() local
395 for (n = 0; n <= maxSymbolValue; n++) { in HUF_sort()
396 U32 r = BIT_highbit32(count[n] + 1); in HUF_sort()
399 for (n = 30; n > 0; n--) in HUF_sort()
400 rank[n - 1].base += rank[n].base; in HUF_sort()
401 for (n = 0; n < 32; n++) in HUF_sort()
402 rank[n].curr = rank[n].base; in HUF_sort()
403 for (n = 0; n <= maxSymbolValue; n++) { in HUF_sort()
404 U32 const c = count[n]; in HUF_sort()
410 huffNode[pos].byte = (BYTE)n; in HUF_sort()
424 U32 n, nonNullRank; in HUF_buildCTable_wksp() local
452 for (n = nodeNb; n <= nodeRoot; n++) in HUF_buildCTable_wksp()
453 huffNode[n].count = (U32)(1U << 30); in HUF_buildCTable_wksp()
467 for (n = nodeRoot - 1; n >= STARTNODE; n--) in HUF_buildCTable_wksp()
468 huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1; in HUF_buildCTable_wksp()
469 for (n = 0; n <= nonNullRank; n++) in HUF_buildCTable_wksp()
470 huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1; in HUF_buildCTable_wksp()
481 for (n = 0; n <= nonNullRank; n++) in HUF_buildCTable_wksp()
482 nbPerRank[huffNode[n].nbBits]++; in HUF_buildCTable_wksp()
486 for (n = maxNbBits; n > 0; n--) { in HUF_buildCTable_wksp()
487 valPerRank[n] = min; /* get starting value within each rank */ in HUF_buildCTable_wksp()
488 min += nbPerRank[n]; in HUF_buildCTable_wksp()
492 for (n = 0; n <= maxSymbolValue; n++) in HUF_buildCTable_wksp()
493 tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */ in HUF_buildCTable_wksp()
494 for (n = 0; n <= maxSymbolValue; n++) in HUF_buildCTable_wksp()
495 tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */ in HUF_buildCTable_wksp()
544 size_t n; in HUF_compress1X_usingCTable() local
556 n = srcSize & ~3; /* join to mod 4 */ in HUF_compress1X_usingCTable()
558 case 3: HUF_encodeSymbol(&bitC, ip[n + 2], CTable); HUF_FLUSHBITS_2(&bitC); in HUF_compress1X_usingCTable()
560 case 2: HUF_encodeSymbol(&bitC, ip[n + 1], CTable); HUF_FLUSHBITS_1(&bitC); in HUF_compress1X_usingCTable()
562 case 1: HUF_encodeSymbol(&bitC, ip[n + 0], CTable); HUF_FLUSHBITS(&bitC); in HUF_compress1X_usingCTable()
568 for (; n > 0; n -= 4) { /* note : n&3==0 at this stage */ in HUF_compress1X_usingCTable()
569 HUF_encodeSymbol(&bitC, ip[n - 1], CTable); in HUF_compress1X_usingCTable()
571 HUF_encodeSymbol(&bitC, ip[n - 2], CTable); in HUF_compress1X_usingCTable()
573 HUF_encodeSymbol(&bitC, ip[n - 3], CTable); in HUF_compress1X_usingCTable()
575 HUF_encodeSymbol(&bitC, ip[n - 4], CTable); in HUF_compress1X_usingCTable()