Coverage Report

Created: 2025-08-24 07:05

/src/zstd/lib/legacy/zstd_v01.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright (c) Yann Collet, Meta Platforms, Inc. and affiliates.
3
 * All rights reserved.
4
 *
5
 * This source code is licensed under both the BSD-style license (found in the
6
 * LICENSE file in the root directory of this source tree) and the GPLv2 (found
7
 * in the COPYING file in the root directory of this source tree).
8
 * You may select, at your option, one of the above-listed licenses.
9
 */
10
11
12
/******************************************
13
*  Includes
14
******************************************/
15
#include <stddef.h>    /* size_t, ptrdiff_t */
16
#include "zstd_v01.h"
17
#include "../common/compiler.h"
18
#include "../common/error_private.h"
19
20
21
/******************************************
22
*  Static allocation
23
******************************************/
24
/* You can statically allocate FSE CTable/DTable as a table of unsigned using below macro */
25
#define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<<maxTableLog))
26
27
/* You can statically allocate Huff0 DTable as a table of unsigned short using below macro */
28
#define HUF_DTABLE_SIZE_U16(maxTableLog)   (1 + (1<<maxTableLog))
29
#define HUF_CREATE_STATIC_DTABLE(DTable, maxTableLog) \
30
3.65k
        unsigned short DTable[HUF_DTABLE_SIZE_U16(maxTableLog)] = { maxTableLog }
31
32
33
/******************************************
34
*  Error Management
35
******************************************/
36
#define FSE_LIST_ERRORS(ITEM) \
37
        ITEM(FSE_OK_NoError) ITEM(FSE_ERROR_GENERIC) \
38
        ITEM(FSE_ERROR_tableLog_tooLarge) ITEM(FSE_ERROR_maxSymbolValue_tooLarge) ITEM(FSE_ERROR_maxSymbolValue_tooSmall) \
39
        ITEM(FSE_ERROR_dstSize_tooSmall) ITEM(FSE_ERROR_srcSize_wrong)\
40
        ITEM(FSE_ERROR_corruptionDetected) \
41
        ITEM(FSE_ERROR_maxCode)
42
43
#define FSE_GENERATE_ENUM(ENUM) ENUM,
44
typedef enum { FSE_LIST_ERRORS(FSE_GENERATE_ENUM) } FSE_errorCodes;  /* enum is exposed, to detect & handle specific errors; compare function result to -enum value */
45
46
47
/******************************************
48
*  FSE symbol compression API
49
******************************************/
50
/*
51
   This API consists of small unitary functions, which highly benefit from being inlined.
52
   You will want to enable link-time-optimization to ensure these functions are properly inlined in your binary.
53
   Visual seems to do it automatically.
54
   For gcc or clang, you'll need to add -flto flag at compilation and linking stages.
55
   If none of these solutions is applicable, include "fse.c" directly.
56
*/
57
58
typedef unsigned FSE_CTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
59
typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
60
61
typedef struct
62
{
63
    size_t bitContainer;
64
    int    bitPos;
65
    char*  startPtr;
66
    char*  ptr;
67
    char*  endPtr;
68
} FSE_CStream_t;
69
70
typedef struct
71
{
72
    ptrdiff_t   value;
73
    const void* stateTable;
74
    const void* symbolTT;
75
    unsigned    stateLog;
76
} FSE_CState_t;
77
78
typedef struct
79
{
80
    size_t   bitContainer;
81
    unsigned bitsConsumed;
82
    const char* ptr;
83
    const char* start;
84
} FSE_DStream_t;
85
86
typedef struct
87
{
88
    size_t      state;
89
    const void* table;   /* precise table may vary, depending on U16 */
90
} FSE_DState_t;
91
92
typedef enum { FSE_DStream_unfinished = 0,
93
               FSE_DStream_endOfBuffer = 1,
94
               FSE_DStream_completed = 2,
95
               FSE_DStream_tooFar = 3 } FSE_DStream_status;  /* result of FSE_reloadDStream() */
96
               /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... ?! */
97
98
99
/****************************************************************
100
*  Tuning parameters
101
****************************************************************/
102
/* MEMORY_USAGE :
103
*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
104
*  Increasing memory usage improves compression ratio
105
*  Reduced memory usage can improve speed, due to cache effect
106
*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
107
9.34k
#define FSE_MAX_MEMORY_USAGE 14
108
#define FSE_DEFAULT_MEMORY_USAGE 13
109
110
/* FSE_MAX_SYMBOL_VALUE :
111
*  Maximum symbol value authorized.
112
*  Required for proper stack allocation */
113
4.22k
#define FSE_MAX_SYMBOL_VALUE 255
114
115
116
/****************************************************************
117
*  template functions type & suffix
118
****************************************************************/
119
374k
#define FSE_FUNCTION_TYPE BYTE
120
#define FSE_FUNCTION_EXTENSION
121
122
123
/****************************************************************
124
*  Byte symbol type
125
****************************************************************/
126
typedef struct
127
{
128
    unsigned short newState;
129
    unsigned char  symbol;
130
    unsigned char  nbBits;
131
} FSE_decode_t;   /* size == U32 */
132
133
134
135
/****************************************************************
136
*  Compiler specifics
137
****************************************************************/
138
#ifdef _MSC_VER    /* Visual Studio */
139
#  define FORCE_INLINE static __forceinline
140
#  include <intrin.h>                    /* For Visual 2005 */
141
#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
142
#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
143
#else
144
#  define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
145
#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
146
#    ifdef __GNUC__
147
#      define FORCE_INLINE static inline __attribute__((always_inline))
148
#    else
149
#      define FORCE_INLINE static inline
150
#    endif
151
#  else
152
#    define FORCE_INLINE static
153
#  endif /* __STDC_VERSION__ */
154
#endif
155
156
157
/****************************************************************
158
*  Includes
159
****************************************************************/
160
#include <stdlib.h>     /* malloc, free, qsort */
161
#include <string.h>     /* memcpy, memset */
162
#include <stdio.h>      /* printf (debug) */
163
164
165
#ifndef MEM_ACCESS_MODULE
166
#define MEM_ACCESS_MODULE
167
/****************************************************************
168
*  Basic Types
169
*****************************************************************/
170
#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
171
# include <stdint.h>
172
typedef  uint8_t BYTE;
173
typedef uint16_t U16;
174
typedef  int16_t S16;
175
typedef uint32_t U32;
176
typedef  int32_t S32;
177
typedef uint64_t U64;
178
typedef  int64_t S64;
179
#else
180
typedef unsigned char       BYTE;
181
typedef unsigned short      U16;
182
typedef   signed short      S16;
183
typedef unsigned int        U32;
184
typedef   signed int        S32;
185
typedef unsigned long long  U64;
186
typedef   signed long long  S64;
187
#endif
188
189
#endif   /* MEM_ACCESS_MODULE */
190
191
/****************************************************************
192
*  Memory I/O
193
*****************************************************************/
194
195
static unsigned FSE_32bits(void)
196
3.93M
{
197
3.93M
    return sizeof(void*)==4;
198
3.93M
}
199
200
static unsigned FSE_isLittleEndian(void)
201
2.09M
{
202
2.09M
    const union { U32 i; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
203
2.09M
    return one.c[0];
204
2.09M
}
205
206
static U16 FSE_read16(const void* memPtr)
207
10.0k
{
208
10.0k
    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
209
10.0k
}
210
211
static U32 FSE_read32(const void* memPtr)
212
37.2k
{
213
37.2k
    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
214
37.2k
}
215
216
static U64 FSE_read64(const void* memPtr)
217
2.05M
{
218
2.05M
    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
219
2.05M
}
220
221
static U16 FSE_readLE16(const void* memPtr)
222
10.0k
{
223
10.0k
    if (FSE_isLittleEndian())
224
10.0k
        return FSE_read16(memPtr);
225
0
    else
226
0
    {
227
0
        const BYTE* p = (const BYTE*)memPtr;
228
0
        return (U16)(p[0] + (p[1]<<8));
229
0
    }
230
10.0k
}
231
232
static U32 FSE_readLE32(const void* memPtr)
233
37.2k
{
234
37.2k
    if (FSE_isLittleEndian())
235
37.2k
        return FSE_read32(memPtr);
236
0
    else
237
0
    {
238
0
        const BYTE* p = (const BYTE*)memPtr;
239
0
        return (U32)((U32)p[0] + ((U32)p[1]<<8) + ((U32)p[2]<<16) + ((U32)p[3]<<24));
240
0
    }
241
37.2k
}
242
243
244
static U64 FSE_readLE64(const void* memPtr)
245
2.05M
{
246
2.05M
    if (FSE_isLittleEndian())
247
2.05M
        return FSE_read64(memPtr);
248
0
    else
249
0
    {
250
0
        const BYTE* p = (const BYTE*)memPtr;
251
0
        return (U64)((U64)p[0] + ((U64)p[1]<<8) + ((U64)p[2]<<16) + ((U64)p[3]<<24)
252
0
                     + ((U64)p[4]<<32) + ((U64)p[5]<<40) + ((U64)p[6]<<48) + ((U64)p[7]<<56));
253
0
    }
254
2.05M
}
255
256
static size_t FSE_readLEST(const void* memPtr)
257
2.05M
{
258
2.05M
    if (FSE_32bits())
259
0
        return (size_t)FSE_readLE32(memPtr);
260
2.05M
    else
261
2.05M
        return (size_t)FSE_readLE64(memPtr);
262
2.05M
}
263
264
265
266
/****************************************************************
267
*  Constants
268
*****************************************************************/
269
9.34k
#define FSE_MAX_TABLELOG  (FSE_MAX_MEMORY_USAGE-2)
270
#define FSE_MAX_TABLESIZE (1U<<FSE_MAX_TABLELOG)
271
#define FSE_MAXTABLESIZE_MASK (FSE_MAX_TABLESIZE-1)
272
#define FSE_DEFAULT_TABLELOG (FSE_DEFAULT_MEMORY_USAGE-2)
273
3.78k
#define FSE_MIN_TABLELOG 5
274
275
3.78k
#define FSE_TABLELOG_ABSOLUTE_MAX 15
276
#if FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX
277
#error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
278
#endif
279
280
281
/****************************************************************
282
*  Error Management
283
****************************************************************/
284
3.65k
#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
285
286
287
/****************************************************************
288
*  Complex types
289
****************************************************************/
290
typedef struct
291
{
292
    int deltaFindState;
293
    U32 deltaNbBits;
294
} FSE_symbolCompressionTransform; /* total 8 bytes */
295
296
typedef U32 DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
297
298
/****************************************************************
299
*  Internal functions
300
****************************************************************/
301
FORCE_INLINE unsigned FSE_highbit32 (U32 val)
302
405k
{
303
#   if defined(_MSC_VER)   /* Visual */
304
    unsigned long r;
305
    return _BitScanReverse(&r, val) ? (unsigned)r : 0;
306
#   elif defined(__GNUC__) && (GCC_VERSION >= 304)   /* GCC Intrinsic */
307
    return __builtin_clz (val) ^ 31;
308
#   else   /* Software version */
309
    static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
310
    U32 v = val;
311
    unsigned r;
312
    v |= v >> 1;
313
    v |= v >> 2;
314
    v |= v >> 4;
315
    v |= v >> 8;
316
    v |= v >> 16;
317
    r = DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
318
    return r;
319
#   endif
320
405k
}
321
322
323
/****************************************************************
324
*  Templates
325
****************************************************************/
326
/*
327
  designed to be included
328
  for type-specific functions (template emulation in C)
329
  Objective is to write these functions only once, for improved maintenance
330
*/
331
332
/* safety checks */
333
#ifndef FSE_FUNCTION_EXTENSION
334
#  error "FSE_FUNCTION_EXTENSION must be defined"
335
#endif
336
#ifndef FSE_FUNCTION_TYPE
337
#  error "FSE_FUNCTION_TYPE must be defined"
338
#endif
339
340
/* Function names */
341
#define FSE_CAT(X,Y) X##Y
342
#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
343
#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
344
345
346
347
3.69k
static U32 FSE_tableStep(U32 tableSize) { return (tableSize>>1) + (tableSize>>3) + 3; }
348
349
3.69k
#define FSE_DECODE_TYPE FSE_decode_t
350
351
352
typedef struct {
353
    U16 tableLog;
354
    U16 fastMode;
355
} FSE_DTableHeader;   /* sizeof U32 */
356
357
static size_t FSE_buildDTable
358
(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
359
3.69k
{
360
3.69k
    void* ptr = dt;
361
3.69k
    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
362
3.69k
    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*)(ptr) + 1;   /* because dt is unsigned, 32-bits aligned on 32-bits */
363
3.69k
    const U32 tableSize = 1 << tableLog;
364
3.69k
    const U32 tableMask = tableSize-1;
365
3.69k
    const U32 step = FSE_tableStep(tableSize);
366
3.69k
    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
367
3.69k
    U32 position = 0;
368
3.69k
    U32 highThreshold = tableSize-1;
369
3.69k
    const S16 largeLimit= (S16)(1 << (tableLog-1));
370
3.69k
    U32 noLarge = 1;
371
3.69k
    U32 s;
372
373
    /* Sanity Checks */
374
3.69k
    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return (size_t)-FSE_ERROR_maxSymbolValue_tooLarge;
375
3.69k
    if (tableLog > FSE_MAX_TABLELOG) return (size_t)-FSE_ERROR_tableLog_tooLarge;
376
377
    /* Init, lay down lowprob symbols */
378
3.69k
    DTableH[0].tableLog = (U16)tableLog;
379
35.8k
    for (s=0; s<=maxSymbolValue; s++)
380
32.1k
    {
381
32.1k
        if (normalizedCounter[s]==-1)
382
12.2k
        {
383
12.2k
            tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
384
12.2k
            symbolNext[s] = 1;
385
12.2k
        }
386
19.9k
        else
387
19.9k
        {
388
19.9k
            if (normalizedCounter[s] >= largeLimit) noLarge=0;
389
19.9k
            symbolNext[s] = normalizedCounter[s];
390
19.9k
        }
391
32.1k
    }
392
393
    /* Spread symbols */
394
35.8k
    for (s=0; s<=maxSymbolValue; s++)
395
32.1k
    {
396
32.1k
        int i;
397
394k
        for (i=0; i<normalizedCounter[s]; i++)
398
361k
        {
399
361k
            tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
400
361k
            position = (position + step) & tableMask;
401
373k
            while (position > highThreshold) position = (position + step) & tableMask;   /* lowprob area */
402
361k
        }
403
32.1k
    }
404
405
3.69k
    if (position!=0) return (size_t)-FSE_ERROR_GENERIC;   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
406
407
    /* Build Decoding table */
408
3.69k
    {
409
3.69k
        U32 i;
410
377k
        for (i=0; i<tableSize; i++)
411
374k
        {
412
374k
            FSE_FUNCTION_TYPE symbol = (FSE_FUNCTION_TYPE)(tableDecode[i].symbol);
413
374k
            U16 nextState = symbolNext[symbol]++;
414
374k
            tableDecode[i].nbBits = (BYTE) (tableLog - FSE_highbit32 ((U32)nextState) );
415
374k
            tableDecode[i].newState = (U16) ( (nextState << tableDecode[i].nbBits) - tableSize);
416
374k
        }
417
3.69k
    }
418
419
3.69k
    DTableH->fastMode = (U16)noLarge;
420
3.69k
    return 0;
421
3.69k
}
422
423
424
/******************************************
425
*  FSE byte symbol
426
******************************************/
427
#ifndef FSE_COMMONDEFS_ONLY
428
429
33.4k
static unsigned FSE_isError(size_t code) { return (code > (size_t)(-FSE_ERROR_maxCode)); }
430
431
static short FSE_abs(short a)
432
29.2k
{
433
29.2k
    return a<0? -a : a;
434
29.2k
}
435
436
437
/****************************************************************
438
*  Header bitstream management
439
****************************************************************/
440
static size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,
441
                 const void* headerBuffer, size_t hbSize)
442
3.81k
{
443
3.81k
    const BYTE* const istart = (const BYTE*) headerBuffer;
444
3.81k
    const BYTE* const iend = istart + hbSize;
445
3.81k
    const BYTE* ip = istart;
446
3.81k
    int nbBits;
447
3.81k
    int remaining;
448
3.81k
    int threshold;
449
3.81k
    U32 bitStream;
450
3.81k
    int bitCount;
451
3.81k
    unsigned charnum = 0;
452
3.81k
    int previous0 = 0;
453
454
3.81k
    if (hbSize < 4) return (size_t)-FSE_ERROR_srcSize_wrong;
455
3.78k
    bitStream = FSE_readLE32(ip);
456
3.78k
    nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
457
3.78k
    if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return (size_t)-FSE_ERROR_tableLog_tooLarge;
458
3.77k
    bitStream >>= 4;
459
3.77k
    bitCount = 4;
460
3.77k
    *tableLogPtr = nbBits;
461
3.77k
    remaining = (1<<nbBits)+1;
462
3.77k
    threshold = 1<<nbBits;
463
3.77k
    nbBits++;
464
465
33.0k
    while ((remaining>1) && (charnum<=*maxSVPtr))
466
29.2k
    {
467
29.2k
        if (previous0)
468
4.38k
        {
469
4.38k
            unsigned n0 = charnum;
470
5.39k
            while ((bitStream & 0xFFFF) == 0xFFFF)
471
1.00k
            {
472
1.00k
                n0+=24;
473
1.00k
                if (ip < iend-5)
474
959
                {
475
959
                    ip+=2;
476
959
                    bitStream = FSE_readLE32(ip) >> bitCount;
477
959
                }
478
49
                else
479
49
                {
480
49
                    bitStream >>= 16;
481
49
                    bitCount+=16;
482
49
                }
483
1.00k
            }
484
5.30k
            while ((bitStream & 3) == 3)
485
916
            {
486
916
                n0+=3;
487
916
                bitStream>>=2;
488
916
                bitCount+=2;
489
916
            }
490
4.38k
            n0 += bitStream & 3;
491
4.38k
            bitCount += 2;
492
4.38k
            if (n0 > *maxSVPtr) return (size_t)-FSE_ERROR_maxSymbolValue_tooSmall;
493
13.1k
            while (charnum < n0) normalizedCounter[charnum++] = 0;
494
4.36k
            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))
495
3.22k
            {
496
3.22k
                ip += bitCount>>3;
497
3.22k
                bitCount &= 7;
498
3.22k
                bitStream = FSE_readLE32(ip) >> bitCount;
499
3.22k
            }
500
1.13k
            else
501
1.13k
                bitStream >>= 2;
502
4.36k
        }
503
29.2k
        {
504
29.2k
            const short max = (short)((2*threshold-1)-remaining);
505
29.2k
            short count;
506
507
29.2k
            if ((bitStream & (threshold-1)) < (U32)max)
508
17.7k
            {
509
17.7k
                count = (short)(bitStream & (threshold-1));
510
17.7k
                bitCount   += nbBits-1;
511
17.7k
            }
512
11.5k
            else
513
11.5k
            {
514
11.5k
                count = (short)(bitStream & (2*threshold-1));
515
11.5k
                if (count >= threshold) count -= max;
516
11.5k
                bitCount   += nbBits;
517
11.5k
            }
518
519
29.2k
            count--;   /* extra accuracy */
520
29.2k
            remaining -= FSE_abs(count);
521
29.2k
            normalizedCounter[charnum++] = count;
522
29.2k
            previous0 = !count;
523
50.2k
            while (remaining < threshold)
524
21.0k
            {
525
21.0k
                nbBits--;
526
21.0k
                threshold >>= 1;
527
21.0k
            }
528
529
29.2k
            {
530
29.2k
                if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))
531
24.2k
                {
532
24.2k
                    ip += bitCount>>3;
533
24.2k
                    bitCount &= 7;
534
24.2k
                }
535
4.98k
                else
536
4.98k
                {
537
4.98k
                    bitCount -= (int)(8 * (iend - 4 - ip));
538
4.98k
                    ip = iend - 4;
539
4.98k
                }
540
29.2k
                bitStream = FSE_readLE32(ip) >> (bitCount & 31);
541
29.2k
            }
542
29.2k
        }
543
29.2k
    }
544
3.75k
    if (remaining != 1) return (size_t)-FSE_ERROR_GENERIC;
545
3.74k
    *maxSVPtr = charnum-1;
546
547
3.74k
    ip += (bitCount+7)>>3;
548
3.74k
    if ((size_t)(ip-istart) > hbSize) return (size_t)-FSE_ERROR_srcSize_wrong;
549
3.71k
    return ip-istart;
550
3.74k
}
551
552
553
/*********************************************************
554
*  Decompression (Byte symbols)
555
*********************************************************/
556
static size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)
557
7.92k
{
558
7.92k
    void* ptr = dt;
559
7.92k
    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
560
7.92k
    FSE_decode_t* const cell = (FSE_decode_t*)(ptr) + 1;   /* because dt is unsigned */
561
562
7.92k
    DTableH->tableLog = 0;
563
7.92k
    DTableH->fastMode = 0;
564
565
7.92k
    cell->newState = 0;
566
7.92k
    cell->symbol = symbolValue;
567
7.92k
    cell->nbBits = 0;
568
569
7.92k
    return 0;
570
7.92k
}
571
572
573
static size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
574
11.6k
{
575
11.6k
    void* ptr = dt;
576
11.6k
    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
577
11.6k
    FSE_decode_t* const dinfo = (FSE_decode_t*)(ptr) + 1;   /* because dt is unsigned */
578
11.6k
    const unsigned tableSize = 1 << nbBits;
579
11.6k
    const unsigned tableMask = tableSize - 1;
580
11.6k
    const unsigned maxSymbolValue = tableMask;
581
11.6k
    unsigned s;
582
583
    /* Sanity checks */
584
11.6k
    if (nbBits < 1) return (size_t)-FSE_ERROR_GENERIC;             /* min size */
585
586
    /* Build Decoding Table */
587
11.6k
    DTableH->tableLog = (U16)nbBits;
588
11.6k
    DTableH->fastMode = 1;
589
1.04M
    for (s=0; s<=maxSymbolValue; s++)
590
1.02M
    {
591
1.02M
        dinfo[s].newState = 0;
592
1.02M
        dinfo[s].symbol = (BYTE)s;
593
1.02M
        dinfo[s].nbBits = (BYTE)nbBits;
594
1.02M
    }
595
596
11.6k
    return 0;
597
11.6k
}
598
599
600
/* FSE_initDStream
601
 * Initialize a FSE_DStream_t.
602
 * srcBuffer must point at the beginning of an FSE block.
603
 * The function result is the size of the FSE_block (== srcSize).
604
 * If srcSize is too small, the function will return an errorCode;
605
 */
606
static size_t FSE_initDStream(FSE_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
607
21.3k
{
608
21.3k
    if (srcSize < 1) return (size_t)-FSE_ERROR_srcSize_wrong;
609
610
21.2k
    if (srcSize >=  sizeof(size_t))
611
8.96k
    {
612
8.96k
        U32 contain32;
613
8.96k
        bitD->start = (const char*)srcBuffer;
614
8.96k
        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(size_t);
615
8.96k
        bitD->bitContainer = FSE_readLEST(bitD->ptr);
616
8.96k
        contain32 = ((const BYTE*)srcBuffer)[srcSize-1];
617
8.96k
        if (contain32 == 0) return (size_t)-FSE_ERROR_GENERIC;   /* stop bit not present */
618
8.93k
        bitD->bitsConsumed = 8 - FSE_highbit32(contain32);
619
8.93k
    }
620
12.3k
    else
621
12.3k
    {
622
12.3k
        U32 contain32;
623
12.3k
        bitD->start = (const char*)srcBuffer;
624
12.3k
        bitD->ptr   = bitD->start;
625
12.3k
        bitD->bitContainer = *(const BYTE*)(bitD->start);
626
12.3k
        switch(srcSize)
627
12.3k
        {
628
534
            case 7: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[6]) << (sizeof(size_t)*8 - 16);
629
                    /* fallthrough */
630
1.65k
            case 6: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[5]) << (sizeof(size_t)*8 - 24);
631
                    /* fallthrough */
632
3.28k
            case 5: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[4]) << (sizeof(size_t)*8 - 32);
633
                    /* fallthrough */
634
3.52k
            case 4: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[3]) << 24;
635
                    /* fallthrough */
636
6.25k
            case 3: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[2]) << 16;
637
                    /* fallthrough */
638
8.45k
            case 2: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[1]) <<  8;
639
                    /* fallthrough */
640
12.3k
            default:;
641
12.3k
        }
642
12.3k
        contain32 = ((const BYTE*)srcBuffer)[srcSize-1];
643
12.3k
        if (contain32 == 0) return (size_t)-FSE_ERROR_GENERIC;   /* stop bit not present */
644
12.2k
        bitD->bitsConsumed = 8 - FSE_highbit32(contain32);
645
12.2k
        bitD->bitsConsumed += (U32)(sizeof(size_t) - srcSize)*8;
646
12.2k
    }
647
648
21.1k
    return srcSize;
649
21.2k
}
650
651
652
/*!FSE_lookBits
653
 * Provides next n bits from the bitContainer.
654
 * bitContainer is not modified (bits are still present for next read/look)
655
 * On 32-bits, maxNbBits==25
656
 * On 64-bits, maxNbBits==57
657
 * return : value extracted.
658
 */
659
static size_t FSE_lookBits(FSE_DStream_t* bitD, U32 nbBits)
660
359k
{
661
359k
    const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;
662
359k
    return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
663
359k
}
664
665
static size_t FSE_lookBitsFast(FSE_DStream_t* bitD, U32 nbBits)   /* only if nbBits >= 1 !! */
666
3.98M
{
667
3.98M
    const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;
668
3.98M
    return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
669
3.98M
}
670
671
static void FSE_skipBits(FSE_DStream_t* bitD, U32 nbBits)
672
4.34M
{
673
4.34M
    bitD->bitsConsumed += nbBits;
674
4.34M
}
675
676
677
/*!FSE_readBits
678
 * Read next n bits from the bitContainer.
679
 * On 32-bits, don't read more than maxNbBits==25
680
 * On 64-bits, don't read more than maxNbBits==57
681
 * Use the fast variant *only* if n >= 1.
682
 * return : value extracted.
683
 */
684
static size_t FSE_readBits(FSE_DStream_t* bitD, U32 nbBits)
685
359k
{
686
359k
    size_t value = FSE_lookBits(bitD, nbBits);
687
359k
    FSE_skipBits(bitD, nbBits);
688
359k
    return value;
689
359k
}
690
691
static size_t FSE_readBitsFast(FSE_DStream_t* bitD, U32 nbBits)   /* only if nbBits >= 1 !! */
692
4.89k
{
693
4.89k
    size_t value = FSE_lookBitsFast(bitD, nbBits);
694
4.89k
    FSE_skipBits(bitD, nbBits);
695
4.89k
    return value;
696
4.89k
}
697
698
static unsigned FSE_reloadDStream(FSE_DStream_t* bitD)
699
2.26M
{
700
2.26M
    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
701
71.0k
        return FSE_DStream_tooFar;
702
703
2.19M
    if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))
704
2.01M
    {
705
2.01M
        bitD->ptr -= bitD->bitsConsumed >> 3;
706
2.01M
        bitD->bitsConsumed &= 7;
707
2.01M
        bitD->bitContainer = FSE_readLEST(bitD->ptr);
708
2.01M
        return FSE_DStream_unfinished;
709
2.01M
    }
710
181k
    if (bitD->ptr == bitD->start)
711
155k
    {
712
155k
        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return FSE_DStream_endOfBuffer;
713
29.9k
        return FSE_DStream_completed;
714
155k
    }
715
25.7k
    {
716
25.7k
        U32 nbBytes = bitD->bitsConsumed >> 3;
717
25.7k
        U32 result = FSE_DStream_unfinished;
718
25.7k
        if (bitD->ptr - nbBytes < bitD->start)
719
2.31k
        {
720
2.31k
            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
721
2.31k
            result = FSE_DStream_endOfBuffer;
722
2.31k
        }
723
25.7k
        bitD->ptr -= nbBytes;
724
25.7k
        bitD->bitsConsumed -= nbBytes*8;
725
25.7k
        bitD->bitContainer = FSE_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
726
25.7k
        return result;
727
181k
    }
728
181k
}
729
730
731
static void FSE_initDState(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD, const FSE_DTable* dt)
732
23.4k
{
733
23.4k
    const void* ptr = dt;
734
23.4k
    const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
735
23.4k
    DStatePtr->state = FSE_readBits(bitD, DTableH->tableLog);
736
23.4k
    FSE_reloadDStream(bitD);
737
23.4k
    DStatePtr->table = dt + 1;
738
23.4k
}
739
740
static BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD)
741
267k
{
742
267k
    const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
743
267k
    const U32  nbBits = DInfo.nbBits;
744
267k
    BYTE symbol = DInfo.symbol;
745
267k
    size_t lowBits = FSE_readBits(bitD, nbBits);
746
747
267k
    DStatePtr->state = DInfo.newState + lowBits;
748
267k
    return symbol;
749
267k
}
750
751
static BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD)
752
4.89k
{
753
4.89k
    const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
754
4.89k
    const U32 nbBits = DInfo.nbBits;
755
4.89k
    BYTE symbol = DInfo.symbol;
756
4.89k
    size_t lowBits = FSE_readBitsFast(bitD, nbBits);
757
758
4.89k
    DStatePtr->state = DInfo.newState + lowBits;
759
4.89k
    return symbol;
760
4.89k
}
761
762
/* FSE_endOfDStream
763
   Tells if bitD has reached end of bitStream or not */
764
765
static unsigned FSE_endOfDStream(const FSE_DStream_t* bitD)
766
70.6k
{
767
70.6k
    return ((bitD->ptr == bitD->start) && (bitD->bitsConsumed == sizeof(bitD->bitContainer)*8));
768
70.6k
}
769
770
static unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
771
8.23k
{
772
8.23k
    return DStatePtr->state == 0;
773
8.23k
}
774
775
776
FORCE_INLINE size_t FSE_decompress_usingDTable_generic(
777
          void* dst, size_t maxDstSize,
778
    const void* cSrc, size_t cSrcSize,
779
    const FSE_DTable* dt, const unsigned fast)
780
479
{
781
479
    BYTE* const ostart = (BYTE*) dst;
782
479
    BYTE* op = ostart;
783
479
    BYTE* const omax = op + maxDstSize;
784
479
    BYTE* const olimit = omax-3;
785
786
479
    FSE_DStream_t bitD;
787
479
    FSE_DState_t state1;
788
479
    FSE_DState_t state2;
789
479
    size_t errorCode;
790
791
    /* Init */
792
479
    errorCode = FSE_initDStream(&bitD, cSrc, cSrcSize);   /* replaced last arg by maxCompressed Size */
793
479
    if (FSE_isError(errorCode)) return errorCode;
794
795
468
    FSE_initDState(&state1, &bitD, dt);
796
468
    FSE_initDState(&state2, &bitD, dt);
797
798
67.0k
#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
799
800
    /* 4 symbols per loop */
801
2.34k
    for ( ; (FSE_reloadDStream(&bitD)==FSE_DStream_unfinished) && (op<olimit) ; op+=4)
802
1.88k
    {
803
1.88k
        op[0] = FSE_GETSYMBOL(&state1);
804
805
1.88k
        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
806
0
            FSE_reloadDStream(&bitD);
807
808
1.88k
        op[1] = FSE_GETSYMBOL(&state2);
809
810
1.88k
        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
811
0
            { if (FSE_reloadDStream(&bitD) > FSE_DStream_unfinished) { op+=2; break; } }
812
813
1.88k
        op[2] = FSE_GETSYMBOL(&state1);
814
815
1.88k
        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
816
0
            FSE_reloadDStream(&bitD);
817
818
1.88k
        op[3] = FSE_GETSYMBOL(&state2);
819
1.88k
    }
820
821
    /* tail */
822
    /* note : FSE_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly FSE_DStream_completed */
823
30.1k
    while (1)
824
30.1k
    {
825
30.1k
        if ( (FSE_reloadDStream(&bitD)>FSE_DStream_completed) || (op==omax) || (FSE_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state1))) )
826
273
            break;
827
828
29.8k
        *op++ = FSE_GETSYMBOL(&state1);
829
830
29.8k
        if ( (FSE_reloadDStream(&bitD)>FSE_DStream_completed) || (op==omax) || (FSE_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state2))) )
831
195
            break;
832
833
29.6k
        *op++ = FSE_GETSYMBOL(&state2);
834
29.6k
    }
835
836
    /* end ? */
837
468
    if (FSE_endOfDStream(&bitD) && FSE_endOfDState(&state1) && FSE_endOfDState(&state2))
838
313
        return op-ostart;
839
840
155
    if (op==omax) return (size_t)-FSE_ERROR_dstSize_tooSmall;   /* dst buffer is full, but cSrc unfinished */
841
842
114
    return (size_t)-FSE_ERROR_corruptionDetected;
843
155
}
844
845
846
static size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
847
                            const void* cSrc, size_t cSrcSize,
848
                            const FSE_DTable* dt)
849
479
{
850
479
    FSE_DTableHeader DTableH;
851
479
    memcpy(&DTableH, dt, sizeof(DTableH));   /* memcpy() into local variable, to avoid strict aliasing warning */
852
853
    /* select fast mode (static) */
854
479
    if (DTableH.fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
855
405
    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
856
479
}
857
858
859
static size_t FSE_decompress(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize)
860
527
{
861
527
    const BYTE* const istart = (const BYTE*)cSrc;
862
527
    const BYTE* ip = istart;
863
527
    short counting[FSE_MAX_SYMBOL_VALUE+1];
864
527
    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
865
527
    unsigned tableLog;
866
527
    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
867
527
    size_t errorCode;
868
869
527
    if (cSrcSize<2) return (size_t)-FSE_ERROR_srcSize_wrong;   /* too small input size */
870
871
    /* normal FSE decoding mode */
872
523
    errorCode = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
873
523
    if (FSE_isError(errorCode)) return errorCode;
874
483
    if (errorCode >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;   /* too small input size */
875
480
    ip += errorCode;
876
480
    cSrcSize -= errorCode;
877
878
480
    errorCode = FSE_buildDTable (dt, counting, maxSymbolValue, tableLog);
879
480
    if (FSE_isError(errorCode)) return errorCode;
880
881
    /* always return, even if it is an error code */
882
479
    return FSE_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, dt);
883
480
}
884
885
886
887
/* *******************************************************
888
*  Huff0 : Huffman block compression
889
*********************************************************/
890
527
#define HUF_MAX_SYMBOL_VALUE 255
891
#define HUF_DEFAULT_TABLELOG  12       /* used by default, when not specified */
892
0
#define HUF_MAX_TABLELOG  12           /* max possible tableLog; for allocation purpose; can be modified */
893
426k
#define HUF_ABSOLUTEMAX_TABLELOG  16   /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
894
#if (HUF_MAX_TABLELOG > HUF_ABSOLUTEMAX_TABLELOG)
895
#  error "HUF_MAX_TABLELOG is too large !"
896
#endif
897
898
typedef struct HUF_CElt_s {
899
  U16  val;
900
  BYTE nbBits;
901
} HUF_CElt ;
902
903
typedef struct nodeElt_s {
904
    U32 count;
905
    U16 parent;
906
    BYTE byte;
907
    BYTE nbBits;
908
} nodeElt;
909
910
911
/* *******************************************************
912
*  Huff0 : Huffman block decompression
913
*********************************************************/
914
typedef struct {
915
    BYTE byte;
916
    BYTE nbBits;
917
} HUF_DElt;
918
919
static size_t HUF_readDTable (U16* DTable, const void* src, size_t srcSize)
920
3.65k
{
921
3.65k
    BYTE huffWeight[HUF_MAX_SYMBOL_VALUE + 1];
922
3.65k
    U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];  /* large enough for values from 0 to 16 */
923
3.65k
    U32 weightTotal;
924
3.65k
    U32 maxBits;
925
3.65k
    const BYTE* ip = (const BYTE*) src;
926
3.65k
    size_t iSize;
927
3.65k
    size_t oSize;
928
3.65k
    U32 n;
929
3.65k
    U32 nextRankStart;
930
3.65k
    void* ptr = DTable+1;
931
3.65k
    HUF_DElt* const dt = (HUF_DElt*)ptr;
932
933
3.65k
    if (!srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
934
3.65k
    iSize = ip[0];
935
936
3.65k
    FSE_STATIC_ASSERT(sizeof(HUF_DElt) == sizeof(U16));   /* if compilation fails here, assertion is false */
937
    //memset(huffWeight, 0, sizeof(huffWeight));   /* should not be necessary, but some analyzer complain ... */
938
3.65k
    if (iSize >= 128)  /* special header */
939
3.11k
    {
940
3.11k
        if (iSize >= (242))   /* RLE */
941
3.07k
        {
942
3.07k
            static int l[14] = { 1, 2, 3, 4, 7, 8, 15, 16, 31, 32, 63, 64, 127, 128 };
943
3.07k
            oSize = l[iSize-242];
944
3.07k
            memset(huffWeight, 1, sizeof(huffWeight));
945
3.07k
            iSize = 0;
946
3.07k
        }
947
41
        else   /* Incompressible */
948
41
        {
949
41
            oSize = iSize - 127;
950
41
            iSize = ((oSize+1)/2);
951
41
            if (iSize+1 > srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
952
36
            ip += 1;
953
414
            for (n=0; n<oSize; n+=2)
954
378
            {
955
378
                huffWeight[n]   = ip[n/2] >> 4;
956
378
                huffWeight[n+1] = ip[n/2] & 15;
957
378
            }
958
36
        }
959
3.11k
    }
960
533
    else  /* header compressed with FSE (normal case) */
961
533
    {
962
533
        if (iSize+1 > srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
963
527
        oSize = FSE_decompress(huffWeight, HUF_MAX_SYMBOL_VALUE, ip+1, iSize);   /* max 255 values decoded, last one is implied */
964
527
        if (FSE_isError(oSize)) return oSize;
965
527
    }
966
967
    /* collect weight stats */
968
3.42k
    memset(rankVal, 0, sizeof(rankVal));
969
3.42k
    weightTotal = 0;
970
430k
    for (n=0; n<oSize; n++)
971
426k
    {
972
426k
        if (huffWeight[n] >= HUF_ABSOLUTEMAX_TABLELOG) return (size_t)-FSE_ERROR_corruptionDetected;
973
426k
        rankVal[huffWeight[n]]++;
974
426k
        weightTotal += (1 << huffWeight[n]) >> 1;
975
426k
    }
976
3.42k
    if (weightTotal == 0) return (size_t)-FSE_ERROR_corruptionDetected;
977
978
    /* get last non-null symbol weight (implied, total must be 2^n) */
979
3.42k
    maxBits = FSE_highbit32(weightTotal) + 1;
980
3.42k
    if (maxBits > DTable[0]) return (size_t)-FSE_ERROR_tableLog_tooLarge;   /* DTable is too small */
981
3.40k
    DTable[0] = (U16)maxBits;
982
3.40k
    {
983
3.40k
        U32 total = 1 << maxBits;
984
3.40k
        U32 rest = total - weightTotal;
985
3.40k
        U32 verif = 1 << FSE_highbit32(rest);
986
3.40k
        U32 lastWeight = FSE_highbit32(rest) + 1;
987
3.40k
        if (verif != rest) return (size_t)-FSE_ERROR_corruptionDetected;    /* last value must be a clean power of 2 */
988
3.39k
        huffWeight[oSize] = (BYTE)lastWeight;
989
3.39k
        rankVal[lastWeight]++;
990
3.39k
    }
991
992
    /* check tree construction validity */
993
3.39k
    if ((rankVal[1] < 2) || (rankVal[1] & 1)) return (size_t)-FSE_ERROR_corruptionDetected;   /* by construction : at least 2 elts of rank 1, must be even */
994
995
    /* Prepare ranks */
996
3.39k
    nextRankStart = 0;
997
28.5k
    for (n=1; n<=maxBits; n++)
998
25.1k
    {
999
25.1k
        U32 current = nextRankStart;
1000
25.1k
        nextRankStart += (rankVal[n] << (n-1));
1001
25.1k
        rankVal[n] = current;
1002
25.1k
    }
1003
1004
    /* fill DTable */
1005
432k
    for (n=0; n<=oSize; n++)
1006
429k
    {
1007
429k
        const U32 w = huffWeight[n];
1008
429k
        const U32 length = (1 << w) >> 1;
1009
429k
        U32 i;
1010
429k
        HUF_DElt D;
1011
429k
        D.byte = (BYTE)n; D.nbBits = (BYTE)(maxBits + 1 - w);
1012
1.18M
        for (i = rankVal[w]; i < rankVal[w] + length; i++)
1013
756k
            dt[i] = D;
1014
429k
        rankVal[w] += length;
1015
429k
    }
1016
1017
3.39k
    return iSize+1;
1018
3.39k
}
1019
1020
1021
static BYTE HUF_decodeSymbol(FSE_DStream_t* Dstream, const HUF_DElt* dt, const U32 dtLog)
1022
3.98M
{
1023
3.98M
        const size_t val = FSE_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
1024
3.98M
        const BYTE c = dt[val].byte;
1025
3.98M
        FSE_skipBits(Dstream, dt[val].nbBits);
1026
3.98M
        return c;
1027
3.98M
}
1028
1029
static size_t HUF_decompress_usingDTable(   /* -3% slower when non static */
1030
          void* dst, size_t maxDstSize,
1031
    const void* cSrc, size_t cSrcSize,
1032
    const U16* DTable)
1033
3.38k
{
1034
3.38k
    if (cSrcSize < 6) return (size_t)-FSE_ERROR_srcSize_wrong;
1035
3.36k
    {
1036
3.36k
        BYTE* const ostart = (BYTE*) dst;
1037
3.36k
        BYTE* op = ostart;
1038
3.36k
        BYTE* const omax = op + maxDstSize;
1039
3.36k
        BYTE* const olimit = maxDstSize < 15 ? op : omax-15;
1040
1041
3.36k
        const void* ptr = DTable;
1042
3.36k
        const HUF_DElt* const dt = (const HUF_DElt*)(ptr)+1;
1043
3.36k
        const U32 dtLog = DTable[0];
1044
3.36k
        size_t errorCode;
1045
3.36k
        U32 reloadStatus;
1046
1047
        /* Init */
1048
1049
3.36k
        const U16* jumpTable = (const U16*)cSrc;
1050
3.36k
        const size_t length1 = FSE_readLE16(jumpTable);
1051
3.36k
        const size_t length2 = FSE_readLE16(jumpTable+1);
1052
3.36k
        const size_t length3 = FSE_readLE16(jumpTable+2);
1053
3.36k
        const size_t length4 = cSrcSize - 6 - length1 - length2 - length3;   /* check coherency !! */
1054
3.36k
        const char* const start1 = (const char*)(cSrc) + 6;
1055
3.36k
        const char* const start2 = start1 + length1;
1056
3.36k
        const char* const start3 = start2 + length2;
1057
3.36k
        const char* const start4 = start3 + length3;
1058
3.36k
        FSE_DStream_t bitD1, bitD2, bitD3, bitD4;
1059
1060
3.36k
        if (length1+length2+length3+6 >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
1061
1062
3.33k
        errorCode = FSE_initDStream(&bitD1, start1, length1);
1063
3.33k
        if (FSE_isError(errorCode)) return errorCode;
1064
3.33k
        errorCode = FSE_initDStream(&bitD2, start2, length2);
1065
3.33k
        if (FSE_isError(errorCode)) return errorCode;
1066
3.31k
        errorCode = FSE_initDStream(&bitD3, start3, length3);
1067
3.31k
        if (FSE_isError(errorCode)) return errorCode;
1068
3.29k
        errorCode = FSE_initDStream(&bitD4, start4, length4);
1069
3.29k
        if (FSE_isError(errorCode)) return errorCode;
1070
1071
3.27k
        reloadStatus=FSE_reloadDStream(&bitD2);
1072
1073
        /* 16 symbols per loop */
1074
160k
        for ( ; (reloadStatus<FSE_DStream_completed) && (op<olimit);  /* D2-3-4 are supposed to be synchronized and finish together */
1075
156k
            op+=16, reloadStatus = FSE_reloadDStream(&bitD2) | FSE_reloadDStream(&bitD3) | FSE_reloadDStream(&bitD4), FSE_reloadDStream(&bitD1))
1076
156k
        {
1077
156k
    #define HUF_DECODE_SYMBOL_0(n, Dstream) \
1078
2.10M
            op[n] = HUF_decodeSymbol(&Dstream, dt, dtLog);
1079
1080
156k
    #define HUF_DECODE_SYMBOL_1(n, Dstream) \
1081
1.25M
            op[n] = HUF_decodeSymbol(&Dstream, dt, dtLog); \
1082
1.25M
            if (FSE_32bits() && (HUF_MAX_TABLELOG>12)) FSE_reloadDStream(&Dstream)
1083
1084
156k
    #define HUF_DECODE_SYMBOL_2(n, Dstream) \
1085
627k
            op[n] = HUF_decodeSymbol(&Dstream, dt, dtLog); \
1086
627k
            if (FSE_32bits()) FSE_reloadDStream(&Dstream)
1087
1088
156k
            HUF_DECODE_SYMBOL_1( 0, bitD1);
1089
156k
            HUF_DECODE_SYMBOL_1( 1, bitD2);
1090
156k
            HUF_DECODE_SYMBOL_1( 2, bitD3);
1091
156k
            HUF_DECODE_SYMBOL_1( 3, bitD4);
1092
156k
            HUF_DECODE_SYMBOL_2( 4, bitD1);
1093
156k
            HUF_DECODE_SYMBOL_2( 5, bitD2);
1094
156k
            HUF_DECODE_SYMBOL_2( 6, bitD3);
1095
156k
            HUF_DECODE_SYMBOL_2( 7, bitD4);
1096
156k
            HUF_DECODE_SYMBOL_1( 8, bitD1);
1097
156k
            HUF_DECODE_SYMBOL_1( 9, bitD2);
1098
156k
            HUF_DECODE_SYMBOL_1(10, bitD3);
1099
156k
            HUF_DECODE_SYMBOL_1(11, bitD4);
1100
156k
            HUF_DECODE_SYMBOL_0(12, bitD1);
1101
156k
            HUF_DECODE_SYMBOL_0(13, bitD2);
1102
156k
            HUF_DECODE_SYMBOL_0(14, bitD3);
1103
156k
            HUF_DECODE_SYMBOL_0(15, bitD4);
1104
156k
        }
1105
1106
3.27k
        if (reloadStatus!=FSE_DStream_completed)   /* not complete : some bitStream might be FSE_DStream_unfinished */
1107
184
            return (size_t)-FSE_ERROR_corruptionDetected;
1108
1109
        /* tail */
1110
3.08k
        {
1111
            /* bitTail = bitD1; */   /* *much* slower : -20% !??! */
1112
3.08k
            FSE_DStream_t bitTail;
1113
3.08k
            bitTail.ptr = bitD1.ptr;
1114
3.08k
            bitTail.bitsConsumed = bitD1.bitsConsumed;
1115
3.08k
            bitTail.bitContainer = bitD1.bitContainer;   /* required in case of FSE_DStream_endOfBuffer */
1116
3.08k
            bitTail.start = start1;
1117
1.47M
            for ( ; (FSE_reloadDStream(&bitTail) < FSE_DStream_completed) && (op<omax) ; op++)
1118
1.47M
            {
1119
1.47M
                HUF_DECODE_SYMBOL_0(0, bitTail);
1120
1.47M
            }
1121
1122
3.08k
            if (FSE_endOfDStream(&bitTail))
1123
3.05k
                return op-ostart;
1124
3.08k
        }
1125
1126
32
        if (op==omax) return (size_t)-FSE_ERROR_dstSize_tooSmall;   /* dst buffer is full, but cSrc unfinished */
1127
1128
16
        return (size_t)-FSE_ERROR_corruptionDetected;
1129
32
    }
1130
32
}
1131
1132
1133
static size_t HUF_decompress (void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize)
1134
3.65k
{
1135
3.65k
    HUF_CREATE_STATIC_DTABLE(DTable, HUF_MAX_TABLELOG);
1136
3.65k
    const BYTE* ip = (const BYTE*) cSrc;
1137
3.65k
    size_t errorCode;
1138
1139
3.65k
    errorCode = HUF_readDTable (DTable, cSrc, cSrcSize);
1140
3.65k
    if (FSE_isError(errorCode)) return errorCode;
1141
3.39k
    if (errorCode >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
1142
3.38k
    ip += errorCode;
1143
3.38k
    cSrcSize -= errorCode;
1144
1145
3.38k
    return HUF_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, DTable);
1146
3.39k
}
1147
1148
1149
#endif   /* FSE_COMMONDEFS_ONLY */
1150
1151
/*
1152
    zstd - standard compression library
1153
    Copyright (C) 2014-2015, Yann Collet.
1154
1155
    BSD 2-Clause License (https://opensource.org/licenses/bsd-license.php)
1156
1157
    Redistribution and use in source and binary forms, with or without
1158
    modification, are permitted provided that the following conditions are
1159
    met:
1160
    * Redistributions of source code must retain the above copyright
1161
    notice, this list of conditions and the following disclaimer.
1162
    * Redistributions in binary form must reproduce the above
1163
    copyright notice, this list of conditions and the following disclaimer
1164
    in the documentation and/or other materials provided with the
1165
    distribution.
1166
    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1167
    "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1168
    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1169
    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
1170
    OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
1171
    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
1172
    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
1173
    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
1174
    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1175
    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1176
    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1177
1178
    You can contact the author at :
1179
    - zstd source repository : https://github.com/Cyan4973/zstd
1180
    - ztsd public forum : https://groups.google.com/forum/#!forum/lz4c
1181
*/
1182
1183
/****************************************************************
1184
*  Tuning parameters
1185
*****************************************************************/
1186
/* MEMORY_USAGE :
1187
*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
1188
*  Increasing memory usage improves compression ratio
1189
*  Reduced memory usage can improve speed, due to cache effect */
1190
#define ZSTD_MEMORY_USAGE 17
1191
1192
1193
/**************************************
1194
   CPU Feature Detection
1195
**************************************/
1196
/*
1197
 * Automated efficient unaligned memory access detection
1198
 * Based on known hardware architectures
1199
 * This list will be updated thanks to feedbacks
1200
 */
1201
#if defined(CPU_HAS_EFFICIENT_UNALIGNED_MEMORY_ACCESS) \
1202
    || defined(__ARM_FEATURE_UNALIGNED) \
1203
    || defined(__i386__) || defined(__x86_64__) \
1204
    || defined(_M_IX86) || defined(_M_X64) \
1205
    || defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_8__) \
1206
    || (defined(_M_ARM) && (_M_ARM >= 7))
1207
#  define ZSTD_UNALIGNED_ACCESS 1
1208
#else
1209
#  define ZSTD_UNALIGNED_ACCESS 0
1210
#endif
1211
1212
1213
/********************************************************
1214
*  Includes
1215
*********************************************************/
1216
#include <stdlib.h>      /* calloc */
1217
#include <string.h>      /* memcpy, memmove */
1218
#include <stdio.h>       /* debug : printf */
1219
1220
1221
/********************************************************
1222
*  Compiler specifics
1223
*********************************************************/
1224
#ifdef __AVX2__
1225
#  include <immintrin.h>   /* AVX2 intrinsics */
1226
#endif
1227
1228
#ifdef _MSC_VER    /* Visual Studio */
1229
#  include <intrin.h>                    /* For Visual 2005 */
1230
#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
1231
#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
1232
#endif
1233
1234
1235
#ifndef MEM_ACCESS_MODULE
1236
#define MEM_ACCESS_MODULE
1237
/********************************************************
1238
*  Basic Types
1239
*********************************************************/
1240
#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
1241
# if defined(_AIX)
1242
#  include <inttypes.h>
1243
# else
1244
#  include <stdint.h> /* intptr_t */
1245
# endif
1246
typedef  uint8_t BYTE;
1247
typedef uint16_t U16;
1248
typedef  int16_t S16;
1249
typedef uint32_t U32;
1250
typedef  int32_t S32;
1251
typedef uint64_t U64;
1252
#else
1253
typedef unsigned char       BYTE;
1254
typedef unsigned short      U16;
1255
typedef   signed short      S16;
1256
typedef unsigned int        U32;
1257
typedef   signed int        S32;
1258
typedef unsigned long long  U64;
1259
#endif
1260
1261
#endif   /* MEM_ACCESS_MODULE */
1262
1263
1264
/********************************************************
1265
*  Constants
1266
*********************************************************/
1267
static const U32 ZSTD_magicNumber = 0xFD2FB51E;   /* 3rd version : seqNb header */
1268
1269
#define HASH_LOG (ZSTD_MEMORY_USAGE - 2)
1270
#define HASH_TABLESIZE (1 << HASH_LOG)
1271
#define HASH_MASK (HASH_TABLESIZE - 1)
1272
1273
#define KNUTH 2654435761
1274
1275
#define BIT7 128
1276
#define BIT6  64
1277
#define BIT5  32
1278
#define BIT4  16
1279
1280
2.64k
#define KB *(1 <<10)
1281
#define MB *(1 <<20)
1282
#define GB *(1U<<30)
1283
1284
2.64k
#define BLOCKSIZE (128 KB)                 /* define, for static allocation */
1285
1286
#define WORKPLACESIZE (BLOCKSIZE*3)
1287
136k
#define MINMATCH 4
1288
81.1k
#define MLbits   7
1289
75.9k
#define LLbits   6
1290
6.44k
#define Offbits  5
1291
69.6k
#define MaxML  ((1<<MLbits )-1)
1292
69.6k
#define MaxLL  ((1<<LLbits )-1)
1293
1.17k
#define MaxOff ((1<<Offbits)-1)
1294
#define LitFSELog  11
1295
1.03k
#define MLFSELog   10
1296
1.05k
#define LLFSELog   10
1297
1.14k
#define OffFSELog   9
1298
#define MAX(a,b) ((a)<(b)?(b):(a))
1299
#define MaxSeq MAX(MaxLL, MaxML)
1300
1301
#define LITERAL_NOENTROPY 63
1302
#define COMMAND_NOENTROPY 7   /* to remove */
1303
1304
82
#define ZSTD_CONTENTSIZE_ERROR   (0ULL - 2)
1305
1306
static const size_t ZSTD_blockHeaderSize = 3;
1307
static const size_t ZSTD_frameHeaderSize = 4;
1308
1309
1310
/********************************************************
1311
*  Memory operations
1312
*********************************************************/
1313
137k
static unsigned ZSTD_32bits(void) { return sizeof(void*)==4; }
1314
1315
static unsigned ZSTD_isLittleEndian(void)
1316
7.94k
{
1317
7.94k
    const union { U32 i; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
1318
7.94k
    return one.c[0];
1319
7.94k
}
1320
1321
7.94k
static U16    ZSTD_read16(const void* p) { U16 r; memcpy(&r, p, sizeof(r)); return r; }
1322
1323
56.1k
static void   ZSTD_copy4(void* dst, const void* src) { memcpy(dst, src, 4); }
1324
1325
3.66M
static void   ZSTD_copy8(void* dst, const void* src) { memcpy(dst, src, 8); }
1326
1327
3.65M
#define COPY8(d,s)    { ZSTD_copy8(d,s); d+=8; s+=8; }
1328
1329
static void ZSTD_wildcopy(void* dst, const void* src, ptrdiff_t length)
1330
68.1k
{
1331
68.1k
    const BYTE* ip = (const BYTE*)src;
1332
68.1k
    BYTE* op = (BYTE*)dst;
1333
68.1k
    BYTE* const oend = op + length;
1334
3.72M
    while (op < oend) COPY8(op, ip);
1335
68.1k
}
1336
1337
static U16 ZSTD_readLE16(const void* memPtr)
1338
7.94k
{
1339
7.94k
    if (ZSTD_isLittleEndian()) return ZSTD_read16(memPtr);
1340
0
    else
1341
0
    {
1342
0
        const BYTE* p = (const BYTE*)memPtr;
1343
0
        return (U16)((U16)p[0] + ((U16)p[1]<<8));
1344
0
    }
1345
7.94k
}
1346
1347
static U32 ZSTD_readLE24(const void* memPtr)
1348
250
{
1349
250
    return ZSTD_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);
1350
250
}
1351
1352
static U32 ZSTD_readBE32(const void* memPtr)
1353
5.36k
{
1354
5.36k
    const BYTE* p = (const BYTE*)memPtr;
1355
5.36k
    return (U32)(((U32)p[0]<<24) + ((U32)p[1]<<16) + ((U32)p[2]<<8) + ((U32)p[3]<<0));
1356
5.36k
}
1357
1358
1359
/**************************************
1360
*  Local structures
1361
***************************************/
1362
typedef struct ZSTD_Cctx_s ZSTD_Cctx;
1363
1364
typedef enum { bt_compressed, bt_raw, bt_rle, bt_end } blockType_t;
1365
1366
typedef struct
1367
{
1368
    blockType_t blockType;
1369
    U32 origSize;
1370
} blockProperties_t;
1371
1372
typedef struct {
1373
    void* buffer;
1374
    U32*  offsetStart;
1375
    U32*  offset;
1376
    BYTE* offCodeStart;
1377
    BYTE* offCode;
1378
    BYTE* litStart;
1379
    BYTE* lit;
1380
    BYTE* litLengthStart;
1381
    BYTE* litLength;
1382
    BYTE* matchLengthStart;
1383
    BYTE* matchLength;
1384
    BYTE* dumpsStart;
1385
    BYTE* dumps;
1386
} SeqStore_t;
1387
1388
1389
typedef struct ZSTD_Cctx_s
1390
{
1391
    const BYTE* base;
1392
    U32 current;
1393
    U32 nextUpdate;
1394
    SeqStore_t seqStore;
1395
#ifdef __AVX2__
1396
    __m256i hashTable[HASH_TABLESIZE>>3];
1397
#else
1398
    U32 hashTable[HASH_TABLESIZE];
1399
#endif
1400
    BYTE buffer[WORKPLACESIZE];
1401
} cctxi_t;
1402
1403
1404
1405
1406
/**************************************
1407
*  Error Management
1408
**************************************/
1409
/* published entry point */
1410
128k
unsigned ZSTDv01_isError(size_t code) { return ERR_isError(code); }
1411
1412
1413
/**************************************
1414
*  Tool functions
1415
**************************************/
1416
#define ZSTD_VERSION_MAJOR    0    /* for breaking interface changes  */
1417
#define ZSTD_VERSION_MINOR    1    /* for new (non-breaking) interface capabilities */
1418
#define ZSTD_VERSION_RELEASE  3    /* for tweaks, bug-fixes, or development */
1419
#define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
1420
1421
/**************************************************************
1422
*   Decompression code
1423
**************************************************************/
1424
1425
static size_t ZSTDv01_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bpPtr)
1426
31.2k
{
1427
31.2k
    const BYTE* const in = (const BYTE* const)src;
1428
31.2k
    BYTE headerFlags;
1429
31.2k
    U32 cSize;
1430
1431
31.2k
    if (srcSize < 3) return ERROR(srcSize_wrong);
1432
1433
30.8k
    headerFlags = *in;
1434
30.8k
    cSize = in[2] + (in[1]<<8) + ((in[0] & 7)<<16);
1435
1436
30.8k
    bpPtr->blockType = (blockType_t)(headerFlags >> 6);
1437
30.8k
    bpPtr->origSize = (bpPtr->blockType == bt_rle) ? cSize : 0;
1438
1439
30.8k
    if (bpPtr->blockType == bt_end) return 0;
1440
28.4k
    if (bpPtr->blockType == bt_rle) return 1;
1441
26.3k
    return cSize;
1442
28.4k
}
1443
1444
1445
static size_t ZSTD_copyUncompressedBlock(void* dst, size_t maxDstSize, const void* src, size_t srcSize)
1446
616
{
1447
616
    if (srcSize > maxDstSize) return ERROR(dstSize_tooSmall);
1448
594
    if (srcSize > 0) {
1449
370
        memcpy(dst, src, srcSize);
1450
370
    }
1451
594
    return srcSize;
1452
616
}
1453
1454
1455
static size_t ZSTD_decompressLiterals(void* ctx,
1456
                                      void* dst, size_t maxDstSize,
1457
                                const void* src, size_t srcSize)
1458
3.66k
{
1459
3.66k
    BYTE* op = (BYTE*)dst;
1460
3.66k
    BYTE* const oend = op + maxDstSize;
1461
3.66k
    const BYTE* ip = (const BYTE*)src;
1462
3.66k
    size_t errorCode;
1463
3.66k
    size_t litSize;
1464
1465
    /* check : minimum 2, for litSize, +1, for content */
1466
3.66k
    if (srcSize <= 3) return ERROR(corruption_detected);
1467
1468
3.66k
    litSize = ip[1] + (ip[0]<<8);
1469
3.66k
    litSize += ((ip[-3] >> 3) & 7) << 16;   /* mmmmh.... */
1470
3.66k
    op = oend - litSize;
1471
1472
3.66k
    (void)ctx;
1473
3.66k
    if (litSize > maxDstSize) return ERROR(dstSize_tooSmall);
1474
3.65k
    errorCode = HUF_decompress(op, litSize, ip+2, srcSize-2);
1475
3.65k
    if (FSE_isError(errorCode)) return ERROR(GENERIC);
1476
3.05k
    return litSize;
1477
3.65k
}
1478
1479
1480
static size_t ZSTDv01_decodeLiteralsBlock(void* ctx,
1481
                                void* dst, size_t maxDstSize,
1482
                          const BYTE** litStart, size_t* litSize,
1483
                          const void* src, size_t srcSize)
1484
8.79k
{
1485
8.79k
    const BYTE* const istart = (const BYTE* const)src;
1486
8.79k
    const BYTE* ip = istart;
1487
8.79k
    BYTE* const ostart = (BYTE* const)dst;
1488
8.79k
    BYTE* const oend = ostart + maxDstSize;
1489
8.79k
    blockProperties_t litbp;
1490
1491
8.79k
    size_t litcSize = ZSTDv01_getcBlockSize(src, srcSize, &litbp);
1492
8.79k
    if (ZSTDv01_isError(litcSize)) return litcSize;
1493
8.43k
    if (litcSize > srcSize - ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
1494
8.38k
    ip += ZSTD_blockHeaderSize;
1495
1496
8.38k
    switch(litbp.blockType)
1497
8.38k
    {
1498
3.09k
    case bt_raw:
1499
3.09k
        *litStart = ip;
1500
3.09k
        ip += litcSize;
1501
3.09k
        *litSize = litcSize;
1502
3.09k
        break;
1503
1.62k
    case bt_rle:
1504
1.62k
        {
1505
1.62k
            size_t rleSize = litbp.origSize;
1506
1.62k
            if (rleSize>maxDstSize) return ERROR(dstSize_tooSmall);
1507
1.59k
            if (!srcSize) return ERROR(srcSize_wrong);
1508
1.59k
            if (rleSize > 0) {
1509
678
                memset(oend - rleSize, *ip, rleSize);
1510
678
            }
1511
1.59k
            *litStart = oend - rleSize;
1512
1.59k
            *litSize = rleSize;
1513
1.59k
            ip++;
1514
1.59k
            break;
1515
1.59k
        }
1516
3.66k
    case bt_compressed:
1517
3.66k
        {
1518
3.66k
            size_t decodedLitSize = ZSTD_decompressLiterals(ctx, dst, maxDstSize, ip, litcSize);
1519
3.66k
            if (ZSTDv01_isError(decodedLitSize)) return decodedLitSize;
1520
3.05k
            *litStart = oend - decodedLitSize;
1521
3.05k
            *litSize = decodedLitSize;
1522
3.05k
            ip += litcSize;
1523
3.05k
            break;
1524
3.66k
        }
1525
8
    case bt_end:
1526
8
    default:
1527
8
        return ERROR(GENERIC);
1528
8.38k
    }
1529
1530
7.74k
    return ip-istart;
1531
8.38k
}
1532
1533
1534
static size_t ZSTDv01_decodeSeqHeaders(int* nbSeq, const BYTE** dumpsPtr, size_t* dumpsLengthPtr,
1535
                         FSE_DTable* DTableLL, FSE_DTable* DTableML, FSE_DTable* DTableOffb,
1536
                         const void* src, size_t srcSize)
1537
7.74k
{
1538
7.74k
    const BYTE* const istart = (const BYTE* const)src;
1539
7.74k
    const BYTE* ip = istart;
1540
7.74k
    const BYTE* const iend = istart + srcSize;
1541
7.74k
    U32 LLtype, Offtype, MLtype;
1542
7.74k
    U32 LLlog, Offlog, MLlog;
1543
7.74k
    size_t dumpsLength;
1544
1545
    /* check */
1546
7.74k
    if (srcSize < 5) return ERROR(srcSize_wrong);
1547
1548
    /* SeqHead */
1549
7.69k
    *nbSeq = ZSTD_readLE16(ip); ip+=2;
1550
7.69k
    LLtype  = *ip >> 6;
1551
7.69k
    Offtype = (*ip >> 4) & 3;
1552
7.69k
    MLtype  = (*ip >> 2) & 3;
1553
7.69k
    if (*ip & 2)
1554
320
    {
1555
320
        dumpsLength  = ip[2];
1556
320
        dumpsLength += ip[1] << 8;
1557
320
        ip += 3;
1558
320
    }
1559
7.37k
    else
1560
7.37k
    {
1561
7.37k
        dumpsLength  = ip[1];
1562
7.37k
        dumpsLength += (ip[0] & 1) << 8;
1563
7.37k
        ip += 2;
1564
7.37k
    }
1565
7.69k
    *dumpsPtr = ip;
1566
7.69k
    ip += dumpsLength;
1567
7.69k
    *dumpsLengthPtr = dumpsLength;
1568
1569
    /* check */
1570
7.69k
    if (ip > iend-3) return ERROR(srcSize_wrong); /* min : all 3 are "raw", hence no header, but at least xxLog bits per type */
1571
1572
    /* sequences */
1573
7.63k
    {
1574
7.63k
        S16 norm[MaxML+1];    /* assumption : MaxML >= MaxLL and MaxOff */
1575
7.63k
        size_t headerSize;
1576
1577
        /* Build DTables */
1578
7.63k
        switch(LLtype)
1579
7.63k
        {
1580
3.38k
        case bt_rle :
1581
3.38k
            LLlog = 0;
1582
3.38k
            FSE_buildDTable_rle(DTableLL, *ip++); break;
1583
3.18k
        case bt_raw :
1584
3.18k
            LLlog = LLbits;
1585
3.18k
            FSE_buildDTable_raw(DTableLL, LLbits); break;
1586
1.06k
        default :
1587
1.06k
            {   U32 max = MaxLL;
1588
1.06k
                headerSize = FSE_readNCount(norm, &max, &LLlog, ip, iend-ip);
1589
1.06k
                if (FSE_isError(headerSize)) return ERROR(GENERIC);
1590
1.05k
                if (LLlog > LLFSELog) return ERROR(corruption_detected);
1591
1.04k
                ip += headerSize;
1592
1.04k
                FSE_buildDTable(DTableLL, norm, max, LLlog);
1593
1.04k
        }   }
1594
1595
7.61k
        switch(Offtype)
1596
7.61k
        {
1597
3.81k
        case bt_rle :
1598
3.81k
            Offlog = 0;
1599
3.81k
            if (ip > iend-2) return ERROR(srcSize_wrong); /* min : "raw", hence no header, but at least xxLog bits */
1600
3.80k
            FSE_buildDTable_rle(DTableOffb, *ip++); break;
1601
2.63k
        case bt_raw :
1602
2.63k
            Offlog = Offbits;
1603
2.63k
            FSE_buildDTable_raw(DTableOffb, Offbits); break;
1604
1.17k
        default :
1605
1.17k
            {   U32 max = MaxOff;
1606
1.17k
                headerSize = FSE_readNCount(norm, &max, &Offlog, ip, iend-ip);
1607
1.17k
                if (FSE_isError(headerSize)) return ERROR(GENERIC);
1608
1.14k
                if (Offlog > OffFSELog) return ERROR(corruption_detected);
1609
1.13k
                ip += headerSize;
1610
1.13k
                FSE_buildDTable(DTableOffb, norm, max, Offlog);
1611
1.13k
        }   }
1612
1613
7.57k
        switch(MLtype)
1614
7.57k
        {
1615
732
        case bt_rle :
1616
732
            MLlog = 0;
1617
732
            if (ip > iend-2) return ERROR(srcSize_wrong); /* min : "raw", hence no header, but at least xxLog bits */
1618
730
            FSE_buildDTable_rle(DTableML, *ip++); break;
1619
5.78k
        case bt_raw :
1620
5.78k
            MLlog = MLbits;
1621
5.78k
            FSE_buildDTable_raw(DTableML, MLbits); break;
1622
1.06k
        default :
1623
1.06k
            {   U32 max = MaxML;
1624
1.06k
                headerSize = FSE_readNCount(norm, &max, &MLlog, ip, iend-ip);
1625
1.06k
                if (FSE_isError(headerSize)) return ERROR(GENERIC);
1626
1.03k
                if (MLlog > MLFSELog) return ERROR(corruption_detected);
1627
1.03k
                ip += headerSize;
1628
1.03k
                FSE_buildDTable(DTableML, norm, max, MLlog);
1629
1.03k
    }   }   }
1630
1631
7.55k
    return ip-istart;
1632
7.57k
}
1633
1634
1635
typedef struct {
1636
    size_t litLength;
1637
    size_t offset;
1638
    size_t matchLength;
1639
} seq_t;
1640
1641
typedef struct {
1642
    FSE_DStream_t DStream;
1643
    FSE_DState_t stateLL;
1644
    FSE_DState_t stateOffb;
1645
    FSE_DState_t stateML;
1646
    size_t prevOffset;
1647
    const BYTE* dumps;
1648
    const BYTE* dumpsEnd;
1649
} seqState_t;
1650
1651
1652
static void ZSTD_decodeSequence(seq_t* seq, seqState_t* seqState)
1653
68.5k
{
1654
68.5k
    size_t litLength;
1655
68.5k
    size_t prevOffset;
1656
68.5k
    size_t offset;
1657
68.5k
    size_t matchLength;
1658
68.5k
    const BYTE* dumps = seqState->dumps;
1659
68.5k
    const BYTE* const de = seqState->dumpsEnd;
1660
1661
    /* Literal length */
1662
68.5k
    litLength = FSE_decodeSymbol(&(seqState->stateLL), &(seqState->DStream));
1663
68.5k
    prevOffset = litLength ? seq->offset : seqState->prevOffset;
1664
68.5k
    seqState->prevOffset = seq->offset;
1665
68.5k
    if (litLength == MaxLL)
1666
2.06k
    {
1667
2.06k
        const U32 add = dumps<de ? *dumps++ : 0;
1668
2.06k
        if (add < 255) litLength += add;
1669
148
        else
1670
148
        {
1671
148
            if (dumps<=(de-3))
1672
138
            {
1673
138
                litLength = ZSTD_readLE24(dumps);
1674
138
                dumps += 3;
1675
138
            }
1676
148
        }
1677
2.06k
    }
1678
1679
    /* Offset */
1680
68.5k
    {
1681
68.5k
        U32 offsetCode, nbBits;
1682
68.5k
        offsetCode = FSE_decodeSymbol(&(seqState->stateOffb), &(seqState->DStream));
1683
68.5k
        if (ZSTD_32bits()) FSE_reloadDStream(&(seqState->DStream));
1684
68.5k
        nbBits = offsetCode - 1;
1685
68.5k
        if (offsetCode==0) nbBits = 0;   /* cmove */
1686
68.5k
        offset = ((size_t)1 << (nbBits & ((sizeof(offset)*8)-1))) + FSE_readBits(&(seqState->DStream), nbBits);
1687
68.5k
        if (ZSTD_32bits()) FSE_reloadDStream(&(seqState->DStream));
1688
68.5k
        if (offsetCode==0) offset = prevOffset;
1689
68.5k
    }
1690
1691
    /* MatchLength */
1692
68.5k
    matchLength = FSE_decodeSymbol(&(seqState->stateML), &(seqState->DStream));
1693
68.5k
    if (matchLength == MaxML)
1694
6.02k
    {
1695
6.02k
        const U32 add = dumps<de ? *dumps++ : 0;
1696
6.02k
        if (add < 255) matchLength += add;
1697
130
        else
1698
130
        {
1699
130
            if (dumps<=(de-3))
1700
112
            {
1701
112
                matchLength = ZSTD_readLE24(dumps);
1702
112
                dumps += 3;
1703
112
            }
1704
130
        }
1705
6.02k
    }
1706
68.5k
    matchLength += MINMATCH;
1707
1708
    /* save result */
1709
68.5k
    seq->litLength = litLength;
1710
68.5k
    seq->offset = offset;
1711
68.5k
    seq->matchLength = matchLength;
1712
68.5k
    seqState->dumps = dumps;
1713
68.5k
}
1714
1715
1716
static size_t ZSTD_execSequence(BYTE* op,
1717
                                seq_t sequence,
1718
                                const BYTE** litPtr, const BYTE* const litLimit,
1719
                                BYTE* const base, BYTE* const oend)
1720
68.5k
{
1721
68.5k
    static const int dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4};   /* added */
1722
68.5k
    static const int dec64table[] = {8, 8, 8, 7, 8, 9,10,11};   /* subtracted */
1723
68.5k
    const BYTE* const ostart = op;
1724
68.5k
    BYTE* const oLitEnd = op + sequence.litLength;
1725
68.5k
    const size_t litLength = sequence.litLength;
1726
68.5k
    BYTE* const endMatch = op + litLength + sequence.matchLength;    /* risk : address space overflow (32-bits) */
1727
68.5k
    const BYTE* const litEnd = *litPtr + litLength;
1728
1729
    /* checks */
1730
68.5k
    size_t const seqLength = sequence.litLength + sequence.matchLength;
1731
1732
68.5k
    if (seqLength > (size_t)(oend - op)) return ERROR(dstSize_tooSmall);
1733
68.4k
    if (sequence.litLength > (size_t)(litLimit - *litPtr)) return ERROR(corruption_detected);
1734
    /* Now we know there are no overflow in literal nor match lengths, can use pointer checks */
1735
68.3k
    if (sequence.offset > (U32)(oLitEnd - base)) return ERROR(corruption_detected);
1736
1737
68.2k
    if (endMatch > oend) return ERROR(dstSize_tooSmall);   /* overwrite beyond dst buffer */
1738
68.2k
    if (litEnd > litLimit) return ERROR(corruption_detected);   /* overRead beyond lit buffer */
1739
68.2k
    if (sequence.matchLength > (size_t)(*litPtr-op)) return ERROR(dstSize_tooSmall);  /* overwrite literal segment */
1740
1741
    /* copy Literals */
1742
68.2k
    ZSTD_memmove(op, *litPtr, sequence.litLength);   /* note : v0.1 seems to allow scenarios where output or input are close to end of buffer */
1743
1744
68.2k
    op += litLength;
1745
68.2k
    *litPtr = litEnd;   /* update for next sequence */
1746
1747
    /* check : last match must be at a minimum distance of 8 from end of dest buffer */
1748
68.2k
    if (oend-op < 8) return ERROR(dstSize_tooSmall);
1749
1750
    /* copy Match */
1751
68.1k
    {
1752
68.1k
        const U32 overlapRisk = (((size_t)(litEnd - endMatch)) < 12);
1753
68.1k
        const BYTE* match = op - sequence.offset;            /* possible underflow at op - offset ? */
1754
68.1k
        size_t qutt = 12;
1755
68.1k
        U64 saved[2];
1756
1757
        /* check */
1758
68.1k
        if (match < base) return ERROR(corruption_detected);
1759
68.1k
        if (sequence.offset > (size_t)base) return ERROR(corruption_detected);
1760
1761
        /* save beginning of literal sequence, in case of write overlap */
1762
68.1k
        if (overlapRisk)
1763
107
        {
1764
107
            if ((endMatch + qutt) > oend) qutt = oend-endMatch;
1765
107
            memcpy(saved, endMatch, qutt);
1766
107
        }
1767
1768
68.1k
        if (sequence.offset < 8)
1769
56.1k
        {
1770
56.1k
            const int dec64 = dec64table[sequence.offset];
1771
56.1k
            op[0] = match[0];
1772
56.1k
            op[1] = match[1];
1773
56.1k
            op[2] = match[2];
1774
56.1k
            op[3] = match[3];
1775
56.1k
            match += dec32table[sequence.offset];
1776
56.1k
            ZSTD_copy4(op+4, match);
1777
56.1k
            match -= dec64;
1778
56.1k
        } else { ZSTD_copy8(op, match); }
1779
68.1k
        op += 8; match += 8;
1780
1781
68.1k
        if (endMatch > oend-(16-MINMATCH))
1782
75
        {
1783
75
            if (op < oend-8)
1784
31
            {
1785
31
                ZSTD_wildcopy(op, match, (oend-8) - op);
1786
31
                match += (oend-8) - op;
1787
31
                op = oend-8;
1788
31
            }
1789
166
            while (op<endMatch) *op++ = *match++;
1790
75
        }
1791
68.1k
        else
1792
68.1k
            ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
1793
1794
        /* restore, in case of overlap */
1795
68.1k
        if (overlapRisk) memcpy(endMatch, saved, qutt);
1796
68.1k
    }
1797
1798
0
    return endMatch-ostart;
1799
68.1k
}
1800
1801
typedef struct ZSTDv01_Dctx_s
1802
{
1803
    U32 LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
1804
    U32 OffTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
1805
    U32 MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
1806
    void* previousDstEnd;
1807
    void* base;
1808
    size_t expected;
1809
    blockType_t bType;
1810
    U32 phase;
1811
} dctx_t;
1812
1813
1814
static size_t ZSTD_decompressSequences(
1815
                               void* ctx,
1816
                               void* dst, size_t maxDstSize,
1817
                         const void* seqStart, size_t seqSize,
1818
                         const BYTE* litStart, size_t litSize)
1819
7.74k
{
1820
7.74k
    dctx_t* dctx = (dctx_t*)ctx;
1821
7.74k
    const BYTE* ip = (const BYTE*)seqStart;
1822
7.74k
    const BYTE* const iend = ip + seqSize;
1823
7.74k
    BYTE* const ostart = (BYTE* const)dst;
1824
7.74k
    BYTE* op = ostart;
1825
7.74k
    BYTE* const oend = ostart + maxDstSize;
1826
7.74k
    size_t errorCode, dumpsLength;
1827
7.74k
    const BYTE* litPtr = litStart;
1828
7.74k
    const BYTE* const litEnd = litStart + litSize;
1829
7.74k
    int nbSeq;
1830
7.74k
    const BYTE* dumps;
1831
7.74k
    U32* DTableLL = dctx->LLTable;
1832
7.74k
    U32* DTableML = dctx->MLTable;
1833
7.74k
    U32* DTableOffb = dctx->OffTable;
1834
7.74k
    BYTE* const base = (BYTE*) (dctx->base);
1835
1836
    /* Build Decoding Tables */
1837
7.74k
    errorCode = ZSTDv01_decodeSeqHeaders(&nbSeq, &dumps, &dumpsLength,
1838
7.74k
                                      DTableLL, DTableML, DTableOffb,
1839
7.74k
                                      ip, iend-ip);
1840
7.74k
    if (ZSTDv01_isError(errorCode)) return errorCode;
1841
7.55k
    ip += errorCode;
1842
1843
    /* Regen sequences */
1844
7.55k
    {
1845
7.55k
        seq_t sequence;
1846
7.55k
        seqState_t seqState;
1847
1848
7.55k
        memset(&sequence, 0, sizeof(sequence));
1849
7.55k
        seqState.dumps = dumps;
1850
7.55k
        seqState.dumpsEnd = dumps + dumpsLength;
1851
7.55k
        seqState.prevOffset = 1;
1852
7.55k
        errorCode = FSE_initDStream(&(seqState.DStream), ip, iend-ip);
1853
7.55k
        if (FSE_isError(errorCode)) return ERROR(corruption_detected);
1854
7.50k
        FSE_initDState(&(seqState.stateLL), &(seqState.DStream), DTableLL);
1855
7.50k
        FSE_initDState(&(seqState.stateOffb), &(seqState.DStream), DTableOffb);
1856
7.50k
        FSE_initDState(&(seqState.stateML), &(seqState.DStream), DTableML);
1857
1858
75.6k
        for ( ; (FSE_reloadDStream(&(seqState.DStream)) <= FSE_DStream_completed) && (nbSeq>0) ; )
1859
68.5k
        {
1860
68.5k
            size_t oneSeqSize;
1861
68.5k
            nbSeq--;
1862
68.5k
            ZSTD_decodeSequence(&sequence, &seqState);
1863
68.5k
            oneSeqSize = ZSTD_execSequence(op, sequence, &litPtr, litEnd, base, oend);
1864
68.5k
            if (ZSTDv01_isError(oneSeqSize)) return oneSeqSize;
1865
68.1k
            op += oneSeqSize;
1866
68.1k
        }
1867
1868
        /* check if reached exact end */
1869
7.14k
        if ( !FSE_endOfDStream(&(seqState.DStream)) ) return ERROR(corruption_detected);   /* requested too much : data is corrupted */
1870
7.05k
        if (nbSeq<0) return ERROR(corruption_detected);   /* requested too many sequences : data is corrupted */
1871
1872
        /* last literal segment */
1873
7.05k
        {
1874
7.05k
            size_t lastLLSize = litEnd - litPtr;
1875
7.05k
            if (op+lastLLSize > oend) return ERROR(dstSize_tooSmall);
1876
7.05k
            if (lastLLSize > 0) {
1877
3.44k
                if (op != litPtr) memmove(op, litPtr, lastLLSize);
1878
3.44k
                op += lastLLSize;
1879
3.44k
            }
1880
7.05k
        }
1881
7.05k
    }
1882
1883
0
    return op-ostart;
1884
7.05k
}
1885
1886
1887
static size_t ZSTD_decompressBlock(
1888
                            void* ctx,
1889
                            void* dst, size_t maxDstSize,
1890
                      const void* src, size_t srcSize)
1891
8.79k
{
1892
    /* blockType == blockCompressed, srcSize is trusted */
1893
8.79k
    const BYTE* ip = (const BYTE*)src;
1894
8.79k
    const BYTE* litPtr = NULL;
1895
8.79k
    size_t litSize = 0;
1896
8.79k
    size_t errorCode;
1897
1898
    /* Decode literals sub-block */
1899
8.79k
    errorCode = ZSTDv01_decodeLiteralsBlock(ctx, dst, maxDstSize, &litPtr, &litSize, src, srcSize);
1900
8.79k
    if (ZSTDv01_isError(errorCode)) return errorCode;
1901
7.74k
    ip += errorCode;
1902
7.74k
    srcSize -= errorCode;
1903
1904
7.74k
    return ZSTD_decompressSequences(ctx, dst, maxDstSize, ip, srcSize, litPtr, litSize);
1905
8.79k
}
1906
1907
1908
size_t ZSTDv01_decompressDCtx(void* ctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)
1909
2.64k
{
1910
2.64k
    const BYTE* ip = (const BYTE*)src;
1911
2.64k
    const BYTE* iend = ip + srcSize;
1912
2.64k
    BYTE* const ostart = (BYTE* const)dst;
1913
2.64k
    BYTE* op = ostart;
1914
2.64k
    BYTE* const oend = ostart + maxDstSize;
1915
2.64k
    size_t remainingSize = srcSize;
1916
2.64k
    U32 magicNumber;
1917
2.64k
    size_t errorCode=0;
1918
2.64k
    blockProperties_t blockProperties;
1919
1920
    /* Frame Header */
1921
2.64k
    if (srcSize < ZSTD_frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
1922
2.64k
    magicNumber = ZSTD_readBE32(src);
1923
2.64k
    if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);
1924
2.64k
    ip += ZSTD_frameHeaderSize; remainingSize -= ZSTD_frameHeaderSize;
1925
1926
    /* Loop on each block */
1927
10.0k
    while (1)
1928
10.0k
    {
1929
10.0k
        size_t blockSize = ZSTDv01_getcBlockSize(ip, iend-ip, &blockProperties);
1930
10.0k
        if (ZSTDv01_isError(blockSize)) return blockSize;
1931
1932
10.0k
        ip += ZSTD_blockHeaderSize;
1933
10.0k
        remainingSize -= ZSTD_blockHeaderSize;
1934
10.0k
        if (blockSize > remainingSize) return ERROR(srcSize_wrong);
1935
1936
10.0k
        switch(blockProperties.blockType)
1937
10.0k
        {
1938
8.79k
        case bt_compressed:
1939
8.79k
            errorCode = ZSTD_decompressBlock(ctx, op, oend-op, ip, blockSize);
1940
8.79k
            break;
1941
616
        case bt_raw :
1942
616
            errorCode = ZSTD_copyUncompressedBlock(op, oend-op, ip, blockSize);
1943
616
            break;
1944
2
        case bt_rle :
1945
2
            return ERROR(GENERIC);   /* not yet supported */
1946
0
            break;
1947
655
        case bt_end :
1948
            /* end of frame */
1949
655
            if (remainingSize) return ERROR(srcSize_wrong);
1950
655
            break;
1951
655
        default:
1952
0
            return ERROR(GENERIC);
1953
10.0k
        }
1954
10.0k
        if (blockSize == 0) break;   /* bt_end */
1955
1956
8.82k
        if (ZSTDv01_isError(errorCode)) return errorCode;
1957
7.42k
        op += errorCode;
1958
7.42k
        ip += blockSize;
1959
7.42k
        remainingSize -= blockSize;
1960
7.42k
    }
1961
1962
1.24k
    return op-ostart;
1963
2.64k
}
1964
1965
size_t ZSTDv01_decompress(void* dst, size_t maxDstSize, const void* src, size_t srcSize)
1966
2.64k
{
1967
2.64k
    dctx_t ctx;
1968
2.64k
    ctx.base = dst;
1969
2.64k
    return ZSTDv01_decompressDCtx(&ctx, dst, maxDstSize, src, srcSize);
1970
2.64k
}
1971
1972
/* ZSTD_errorFrameSizeInfoLegacy() :
1973
   assumes `cSize` and `dBound` are _not_ NULL */
1974
static void ZSTD_errorFrameSizeInfoLegacy(size_t* cSize, unsigned long long* dBound, size_t ret)
1975
82
{
1976
82
    *cSize = ret;
1977
82
    *dBound = ZSTD_CONTENTSIZE_ERROR;
1978
82
}
1979
1980
void ZSTDv01_findFrameSizeInfoLegacy(const void *src, size_t srcSize, size_t* cSize, unsigned long long* dBound)
1981
2.73k
{
1982
2.73k
    const BYTE* ip = (const BYTE*)src;
1983
2.73k
    size_t remainingSize = srcSize;
1984
2.73k
    size_t nbBlocks = 0;
1985
2.73k
    U32 magicNumber;
1986
2.73k
    blockProperties_t blockProperties;
1987
1988
    /* Frame Header */
1989
2.73k
    if (srcSize < ZSTD_frameHeaderSize+ZSTD_blockHeaderSize) {
1990
10
        ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, ERROR(srcSize_wrong));
1991
10
        return;
1992
10
    }
1993
2.72k
    magicNumber = ZSTD_readBE32(src);
1994
2.72k
    if (magicNumber != ZSTD_magicNumber) {
1995
0
        ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, ERROR(prefix_unknown));
1996
0
        return;
1997
0
    }
1998
2.72k
    ip += ZSTD_frameHeaderSize; remainingSize -= ZSTD_frameHeaderSize;
1999
2000
    /* Loop on each block */
2001
12.3k
    while (1)
2002
12.3k
    {
2003
12.3k
        size_t blockSize = ZSTDv01_getcBlockSize(ip, remainingSize, &blockProperties);
2004
12.3k
        if (ZSTDv01_isError(blockSize)) {
2005
23
            ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, blockSize);
2006
23
            return;
2007
23
        }
2008
2009
12.3k
        ip += ZSTD_blockHeaderSize;
2010
12.3k
        remainingSize -= ZSTD_blockHeaderSize;
2011
12.3k
        if (blockSize > remainingSize) {
2012
49
            ZSTD_errorFrameSizeInfoLegacy(cSize, dBound, ERROR(srcSize_wrong));
2013
49
            return;
2014
49
        }
2015
2016
12.2k
        if (blockSize == 0) break;   /* bt_end */
2017
2018
9.63k
        ip += blockSize;
2019
9.63k
        remainingSize -= blockSize;
2020
9.63k
        nbBlocks++;
2021
9.63k
    }
2022
2023
2.64k
    *cSize = ip - (const BYTE*)src;
2024
2.64k
    *dBound = nbBlocks * BLOCKSIZE;
2025
2.64k
}
2026
2027
/*******************************
2028
*  Streaming Decompression API
2029
*******************************/
2030
2031
size_t ZSTDv01_resetDCtx(ZSTDv01_Dctx* dctx)
2032
0
{
2033
0
    dctx->expected = ZSTD_frameHeaderSize;
2034
0
    dctx->phase = 0;
2035
0
    dctx->previousDstEnd = NULL;
2036
0
    dctx->base = NULL;
2037
0
    return 0;
2038
0
}
2039
2040
ZSTDv01_Dctx* ZSTDv01_createDCtx(void)
2041
0
{
2042
0
    ZSTDv01_Dctx* dctx = (ZSTDv01_Dctx*)malloc(sizeof(ZSTDv01_Dctx));
2043
0
    if (dctx==NULL) return NULL;
2044
0
    ZSTDv01_resetDCtx(dctx);
2045
0
    return dctx;
2046
0
}
2047
2048
size_t ZSTDv01_freeDCtx(ZSTDv01_Dctx* dctx)
2049
0
{
2050
0
    free(dctx);
2051
0
    return 0;
2052
0
}
2053
2054
size_t ZSTDv01_nextSrcSizeToDecompress(ZSTDv01_Dctx* dctx)
2055
0
{
2056
0
    return ((dctx_t*)dctx)->expected;
2057
0
}
2058
2059
size_t ZSTDv01_decompressContinue(ZSTDv01_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)
2060
0
{
2061
0
    dctx_t* ctx = (dctx_t*)dctx;
2062
2063
    /* Sanity check */
2064
0
    if (srcSize != ctx->expected) return ERROR(srcSize_wrong);
2065
0
    if (dst != ctx->previousDstEnd)  /* not contiguous */
2066
0
        ctx->base = dst;
2067
2068
    /* Decompress : frame header */
2069
0
    if (ctx->phase == 0)
2070
0
    {
2071
        /* Check frame magic header */
2072
0
        U32 magicNumber = ZSTD_readBE32(src);
2073
0
        if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);
2074
0
        ctx->phase = 1;
2075
0
        ctx->expected = ZSTD_blockHeaderSize;
2076
0
        return 0;
2077
0
    }
2078
2079
    /* Decompress : block header */
2080
0
    if (ctx->phase == 1)
2081
0
    {
2082
0
        blockProperties_t bp;
2083
0
        size_t blockSize = ZSTDv01_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
2084
0
        if (ZSTDv01_isError(blockSize)) return blockSize;
2085
0
        if (bp.blockType == bt_end)
2086
0
        {
2087
0
            ctx->expected = 0;
2088
0
            ctx->phase = 0;
2089
0
        }
2090
0
        else
2091
0
        {
2092
0
            ctx->expected = blockSize;
2093
0
            ctx->bType = bp.blockType;
2094
0
            ctx->phase = 2;
2095
0
        }
2096
2097
0
        return 0;
2098
0
    }
2099
2100
    /* Decompress : block content */
2101
0
    {
2102
0
        size_t rSize;
2103
0
        switch(ctx->bType)
2104
0
        {
2105
0
        case bt_compressed:
2106
0
            rSize = ZSTD_decompressBlock(ctx, dst, maxDstSize, src, srcSize);
2107
0
            break;
2108
0
        case bt_raw :
2109
0
            rSize = ZSTD_copyUncompressedBlock(dst, maxDstSize, src, srcSize);
2110
0
            break;
2111
0
        case bt_rle :
2112
0
            return ERROR(GENERIC);   /* not yet handled */
2113
0
            break;
2114
0
        case bt_end :   /* should never happen (filtered at phase 1) */
2115
0
            rSize = 0;
2116
0
            break;
2117
0
        default:
2118
0
            return ERROR(GENERIC);
2119
0
        }
2120
0
        ctx->phase = 1;
2121
0
        ctx->expected = ZSTD_blockHeaderSize;
2122
0
        if (ZSTDv01_isError(rSize)) return rSize;
2123
0
        ctx->previousDstEnd = (void*)( ((char*)dst) + rSize);
2124
0
        return rSize;
2125
0
    }
2126
2127
0
}