Lines Matching refs:n
252 U32 n; in HUF_writeCTable_wksp() local
266 for (n=1; n<huffLog+1; n++) in HUF_writeCTable_wksp()
267 wksp->bitsToWeight[n] = (BYTE)(huffLog + 1 - n); in HUF_writeCTable_wksp()
268 for (n=0; n<maxSymbolValue; n++) in HUF_writeCTable_wksp()
269 wksp->huffWeight[n] = wksp->bitsToWeight[HUF_getNbBits(ct[n])]; in HUF_writeCTable_wksp()
284 for (n=0; n<maxSymbolValue; n+=2) in HUF_writeCTable_wksp()
285 op[(n/2)+1] = (BYTE)((wksp->huffWeight[n] << 4) + wksp->huffWeight[n+1]); in HUF_writeCTable_wksp()
311 { U32 n, nextRankStart = 0; in HUF_readCTable() local
312 for (n=1; n<=tableLog; n++) { in HUF_readCTable()
314 nextRankStart += (rankVal[n] << (n-1)); in HUF_readCTable()
315 rankVal[n] = curr; in HUF_readCTable()
319 { U32 n; for (n=0; n<nbSymbols; n++) { in HUF_readCTable() local
320 const U32 w = huffWeight[n]; in HUF_readCTable()
321 HUF_setNbBits(ct + n, (BYTE)(tableLog + 1 - w) & -(w != 0)); in HUF_readCTable()
327 { U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[HUF_getNbBits(ct[n])]++; } in HUF_readCTable() local
331 U32 n; for (n=tableLog; n>0; n--) { /* start at n=tablelog <-> w=1 */ in HUF_readCTable() local
332 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable()
333 min += nbPerRank[n]; in HUF_readCTable()
337 … { U32 n; for (n=0; n<nbSymbols; n++) HUF_setValue(ct + n, valPerRank[HUF_getNbBits(ct[n])]++); } in HUF_readCTable() local
385 int n = (int)lastNonNull; in HUF_setMaxHeight() local
391 while (huffNode[n].nbBits > targetNbBits) { in HUF_setMaxHeight()
392 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits)); in HUF_setMaxHeight()
393 huffNode[n].nbBits = (BYTE)targetNbBits; in HUF_setMaxHeight()
394 n--; in HUF_setMaxHeight()
397 assert(huffNode[n].nbBits <= targetNbBits); in HUF_setMaxHeight()
399 while (huffNode[n].nbBits == targetNbBits) --n; in HUF_setMaxHeight()
415 for (pos=n ; pos >= 0; pos--) { in HUF_setMaxHeight()
481 while (huffNode[n].nbBits == targetNbBits) n--; in HUF_setMaxHeight()
482 huffNode[n+1].nbBits--; in HUF_setMaxHeight()
483 assert(n >= 0); in HUF_setMaxHeight()
484 rankLast[1] = (U32)(n+1); in HUF_setMaxHeight()
619 U32 n; in HUF_sort() local
629 for (n = 0; n < maxSymbolValue1; ++n) { in HUF_sort()
630 U32 lowerRank = HUF_getIndex(count[n]); in HUF_sort()
637 for (n = RANK_POSITION_TABLE_SIZE - 1; n > 0; --n) { in HUF_sort()
638 rankPosition[n-1].base += rankPosition[n].base; in HUF_sort()
639 rankPosition[n-1].curr = rankPosition[n-1].base; in HUF_sort()
643 for (n = 0; n < maxSymbolValue1; ++n) { in HUF_sort()
644 U32 const c = count[n]; in HUF_sort()
649 huffNode[pos].byte = (BYTE)n; in HUF_sort()
653 for (n = RANK_POSITION_DISTINCT_COUNT_CUTOFF; n < RANK_POSITION_TABLE_SIZE - 1; ++n) { in HUF_sort()
654 int const bucketSize = rankPosition[n].curr - rankPosition[n].base; in HUF_sort()
655 U32 const bucketStartIdx = rankPosition[n].base; in HUF_sort()
685 int n, nodeRoot; in HUF_buildTree() local
694 for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30); in HUF_buildTree()
708 for (n=nodeRoot-1; n>=STARTNODE; n--) in HUF_buildTree()
709 huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1; in HUF_buildTree()
710 for (n=0; n<=nonNullRank; n++) in HUF_buildTree()
711 huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1; in HUF_buildTree()
732 int n; in HUF_buildCTableFromTree() local
736 for (n=0; n<=nonNullRank; n++) in HUF_buildCTableFromTree()
737 nbPerRank[huffNode[n].nbBits]++; in HUF_buildCTableFromTree()
740 for (n=(int)maxNbBits; n>0; n--) { in HUF_buildCTableFromTree()
741 valPerRank[n] = min; /* get starting value within each rank */ in HUF_buildCTableFromTree()
742 min += nbPerRank[n]; in HUF_buildCTableFromTree()
745 for (n=0; n<alphabetSize; n++) in HUF_buildCTableFromTree()
746 …HUF_setNbBits(ct + huffNode[n].byte, huffNode[n].nbBits); /* push nbBits per symbol, symbol orde… in HUF_buildCTableFromTree()
747 for (n=0; n<alphabetSize; n++) in HUF_buildCTableFromTree()
748 …HUF_setValue(ct + n, valPerRank[HUF_getNbBits(ct[n])]++); /* assign value within rank, symbol or… in HUF_buildCTableFromTree()
995 int n = (int)srcSize; in HUF_compress1X_usingCTable_internal_body_loop() local
996 int rem = n % kUnroll; in HUF_compress1X_usingCTable_internal_body_loop()
999 HUF_encodeSymbol(bitC, ip[--n], ct, 0, /* fast */ 0); in HUF_compress1X_usingCTable_internal_body_loop()
1003 assert(n % kUnroll == 0); in HUF_compress1X_usingCTable_internal_body_loop()
1006 if (n % (2 * kUnroll)) { in HUF_compress1X_usingCTable_internal_body_loop()
1009 HUF_encodeSymbol(bitC, ip[n - u], ct, 0, 1); in HUF_compress1X_usingCTable_internal_body_loop()
1011 HUF_encodeSymbol(bitC, ip[n - kUnroll], ct, 0, kLastFast); in HUF_compress1X_usingCTable_internal_body_loop()
1013 n -= kUnroll; in HUF_compress1X_usingCTable_internal_body_loop()
1015 assert(n % (2 * kUnroll) == 0); in HUF_compress1X_usingCTable_internal_body_loop()
1017 for (; n>0; n-= 2 * kUnroll) { in HUF_compress1X_usingCTable_internal_body_loop()
1021 HUF_encodeSymbol(bitC, ip[n - u], ct, /* idx */ 0, /* fast */ 1); in HUF_compress1X_usingCTable_internal_body_loop()
1023 HUF_encodeSymbol(bitC, ip[n - kUnroll], ct, /* idx */ 0, /* fast */ kLastFast); in HUF_compress1X_usingCTable_internal_body_loop()
1031 HUF_encodeSymbol(bitC, ip[n - kUnroll - u], ct, /* idx */ 1, /* fast */ 1); in HUF_compress1X_usingCTable_internal_body_loop()
1033 HUF_encodeSymbol(bitC, ip[n - kUnroll - kUnroll], ct, /* idx */ 1, /* fast */ kLastFast); in HUF_compress1X_usingCTable_internal_body_loop()
1038 assert(n == 0); in HUF_compress1X_usingCTable_internal_body_loop()