rankLast          316 lib/zstd/huf_compress.c 			U32 rankLast[HUF_TABLELOG_MAX + 2];
rankLast          320 lib/zstd/huf_compress.c 			memset(rankLast, 0xF0, sizeof(rankLast));
rankLast          327 lib/zstd/huf_compress.c 					rankLast[maxNbBits - currNbBits] = pos;
rankLast          334 lib/zstd/huf_compress.c 					U32 highPos = rankLast[nBitsToDecrease];
rankLast          335 lib/zstd/huf_compress.c 					U32 lowPos = rankLast[nBitsToDecrease - 1];
rankLast          349 lib/zstd/huf_compress.c 				while ((nBitsToDecrease <= HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))
rankLast          352 lib/zstd/huf_compress.c 				if (rankLast[nBitsToDecrease - 1] == noSymbol)
rankLast          353 lib/zstd/huf_compress.c 					rankLast[nBitsToDecrease - 1] = rankLast[nBitsToDecrease]; /* this rank is no longer empty */
rankLast          354 lib/zstd/huf_compress.c 				huffNode[rankLast[nBitsToDecrease]].nbBits++;
rankLast          355 lib/zstd/huf_compress.c 				if (rankLast[nBitsToDecrease] == 0) /* special case, reached largest symbol */
rankLast          356 lib/zstd/huf_compress.c 					rankLast[nBitsToDecrease] = noSymbol;
rankLast          358 lib/zstd/huf_compress.c 					rankLast[nBitsToDecrease]--;
rankLast          359 lib/zstd/huf_compress.c 					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
rankLast          360 lib/zstd/huf_compress.c 						rankLast[nBitsToDecrease] = noSymbol; /* this rank is now empty */
rankLast          365 lib/zstd/huf_compress.c 				if (rankLast[1] == noSymbol) { /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0
rankLast          370 lib/zstd/huf_compress.c 					rankLast[1] = n + 1;
rankLast          374 lib/zstd/huf_compress.c 				huffNode[rankLast[1] + 1].nbBits--;
rankLast          375 lib/zstd/huf_compress.c 				rankLast[1]++;