zstd/decompress/huf_decompress.c

306         /* Increase the weight for all non-zero probability symbols by scale. */
328         BYTE symbols[HUF_SYMBOLVALUE_MAX + 1];
368     /* Compute symbols and rankStart given rankVal:
372      * symbols contains the symbols ordered by weight. First are the rankVal[0]
373      * weight 0 symbols, followed by the rankVal[1] weight 1 symbols, and so on.
374      * symbols[0] is filled (but unused) to avoid a branch.
394                 wksp->symbols[wksp->rankStart[w]++] = (BYTE)(n+u);
399             wksp->symbols[wksp->rankStart[w]++] = (BYTE)n;
424                     D.byte = wksp->symbols[symbol + s];
433                     D.byte = wksp->symbols[symbol + s];
442                     U64 const D4 = HUF_DEltX1_set4(wksp->symbols[symbol + s], nbBits);
449                     U64 const D4 = HUF_DEltX1_set4(wksp->symbols[symbol + s], nbBits);
457                     U64 const D4 = HUF_DEltX1_set4(wksp->symbols[symbol + s], nbBits);
501     /* up to 4 symbols at a time */
513     /* [0-3] symbols remaining */
596         /* up to 16 symbols per loop (4 symbols per stream) in 64-bit mode */
812 /* double-symbols decoding */
815 typedef struct { U16 sequence; BYTE nbBits; BYTE length; } HUF_DEltX2;  /* double-symbols decoding */
861  * Fills the DTable rank with all the symbols from [begin, end) that are each
969     /* Fill each of the second level symbols by weight. */
1011              * These symbols get at least 1 second symbol.
1089         rankStart[0] = nextRankStart;   /* put all 0w symbols at the end of sorted list*/
1093     /* sort symbols by weight */
1100         rankStart[0] = 0;   /* forget 0w symbols; this is beginning of weight(1) */
1178     /* up to 8 symbols at a time */
1181             /* up to 10 symbols at a time */
1190             /* up to 8 symbols at a time */
1202     /* closer to end : up to 2 symbols at a time */
1290         /* 16-32 symbols per loop (4-8 symbols per stream) */