/* ******************************************************************

   FSE : Finite State Entropy encoder

   Copyright (C) 2013-2015, Yann Collet.

   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)

   Redistribution and use in source and binary forms, with or without

   modification, are permitted provided that the following conditions are

   met:

       * Redistributions of source code must retain the above copyright

   notice, this list of conditions and the following disclaimer.

       * Redistributions in binary form must reproduce the above

   copyright notice, this list of conditions and the following disclaimer

   in the documentation and/or other materials provided with the

   distribution.

   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS

   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT

   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR

   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT

   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,

   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT

   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,

   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY

   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT

   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE

   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

    You can contact the author at :

    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy

    - Public forum : https://groups.google.com/forum/#!forum/lz4c

****************************************************************** */

/* **************************************************************

*  Compiler specifics

****************************************************************/

#ifdef _MSC_VER    /* Visual Studio */

#  define FORCE_INLINE static __forceinline

#  include <intrin.h>                    /* For Visual 2005 */

#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */

#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */

#else

#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */

#    ifdef __GNUC__

#      define FORCE_INLINE static inline __attribute__((always_inline))

#    else

#      define FORCE_INLINE static inline

#    endif

#  else

#    define FORCE_INLINE static

#  endif /* __STDC_VERSION__ */

#endif

/* **************************************************************

*  Includes

****************************************************************/

#include <stdlib.h>     /* malloc, free, qsort */

#include <string.h>     /* memcpy, memset */

#include <stdio.h>      /* printf (debug) */

#include "bitstream.h"

#define FSE_STATIC_LINKING_ONLY

#include "fse.h"

/* **************************************************************

*  Error Management

****************************************************************/

#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */

/* **************************************************************

*  Templates

****************************************************************/

/*

  designed to be included

  for type-specific functions (template emulation in C)

  Objective is to write these functions only once, for improved maintenance

*/

/* safety checks */

#ifndef FSE_FUNCTION_EXTENSION

#  error "FSE_FUNCTION_EXTENSION must be defined"

#endif

#ifndef FSE_FUNCTION_TYPE

#  error "FSE_FUNCTION_TYPE must be defined"

#endif

/* Function names */

#define FSE_CAT(X,Y) X##Y

#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)

#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)

/* Function templates */

{

    U32 const tableSize = 1 << tableLog;

    U32 const tableMask = tableSize - 1;

    void* const ptr = ct;

    U16* const tableU16 = ( (U16*) ptr) + 2;

    void* const FSCT = ((U32*)ptr) + 1 /* header */ + (tableLog ? tableSize>>1 : 1) ;

    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);

    U32 const step = FSE_TABLESTEP(tableSize);

    U32 cumul[FSE_MAX_SYMBOL_VALUE+2];

    U32 highThreshold = tableSize-1;

    /* CTable header */

    tableU16[-2] = (U16) tableLog;

    tableU16[-1] = (U16) maxSymbolValue;

    /* For explanations on how to distribute symbol values over the table :

    *  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */

    /* symbol start positions */

    {   U32 u;

        cumul[0] = 0;

        for (u=1; u<=maxSymbolValue+1; u++) {

            if (normalizedCounter[u-1]==-1) {  /* Low proba symbol */

                cumul[u] = cumul[u-1] + 1;

                tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u-1);

            } else {

                cumul[u] = cumul[u-1] + normalizedCounter[u-1];

        }   }

        cumul[maxSymbolValue+1] = tableSize+1;

    }

    /* Spread symbols */

    {   U32 position = 0;

        U32 symbol;

        for (symbol=0; symbol<=maxSymbolValue; symbol++) {

            int nbOccurences;

            for (nbOccurences=0; nbOccurences<normalizedCounter[symbol]; nbOccurences++) {

                tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;

                position = (position + step) & tableMask;

                while (position > highThreshold) position = (position + step) & tableMask;   /* Low proba area */

        }   }

        if (position!=0) return ERROR(GENERIC);   /* Must have gone through all positions */

    }

    /* Build table */

    {   U32 u; for (u=0; u<tableSize; u++) {

        FSE_FUNCTION_TYPE s = tableSymbol[u];   /* note : static analyzer may not understand tableSymbol is properly initialized */

        tableU16[cumul[s]++] = (U16) (tableSize+u);   /* TableU16 : sorted by symbol order; gives next state value */

    }   }

    /* Build Symbol Transformation Table */

    {   unsigned total = 0;

        unsigned s;

        for (s=0; s<=maxSymbolValue; s++) {

            switch (normalizedCounter[s])

            {

            case  0: break;

            case -1:

            case  1:

                symbolTT[s].deltaNbBits = (tableLog << 16) - (1<<tableLog);

                symbolTT[s].deltaFindState = total - 1;

                total ++;

                break;

            default :

                {

                    U32 const maxBitsOut = tableLog - BIT_highbit32 (normalizedCounter[s]-1);

                    U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;

                    symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;

                    symbolTT[s].deltaFindState = total - normalizedCounter[s];

                    total +=  normalizedCounter[s];

    }   }   }   }

    return 0;

}

#ifndef FSE_COMMONDEFS_ONLY

/*-**************************************************************

*  FSE NCount encoding-decoding

****************************************************************/

size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog)

{

    return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND;  /* maxSymbolValue==0 ? use default */

}

static short FSE_abs(short a) { return (short)(a<0 ? -a : a); }

static size_t FSE_writeNCount_generic (void* header, size_t headerBufferSize,

                                       const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,

                                       unsigned writeIsSafe)

{

    BYTE* const ostart = (BYTE*) header;

    BYTE* out = ostart;

    BYTE* const oend = ostart + headerBufferSize;

    int nbBits;

    const int tableSize = 1 << tableLog;

    int remaining;

    int threshold;

    U32 bitStream;

    int bitCount;

    unsigned charnum = 0;

    int previous0 = 0;

    bitStream = 0;

    bitCount  = 0;

    /* Table Size */

    bitStream += (tableLog-FSE_MIN_TABLELOG) << bitCount;

    bitCount  += 4;

    /* Init */

    remaining = tableSize+1;   /* +1 for extra accuracy */

    threshold = tableSize;

    nbBits = tableLog+1;

    while (remaining>1) {  /* stops at 1 */

        if (previous0) {

            unsigned start = charnum;

            while (!normalizedCounter[charnum]) charnum++;

            while (charnum >= start+24) {

                start+=24;

                bitStream += 0xFFFFU << bitCount;

                if ((!writeIsSafe) && (out > oend-2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */

                out[0] = (BYTE) bitStream;

                out[1] = (BYTE)(bitStream>>8);

                out+=2;

                bitStream>>=16;

            }

            while (charnum >= start+3) {

                start+=3;

                bitStream += 3 << bitCount;

                bitCount += 2;

            }

            bitStream += (charnum-start) << bitCount;

            bitCount += 2;

            if (bitCount>16) {

                if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */

                out[0] = (BYTE)bitStream;

                out[1] = (BYTE)(bitStream>>8);

                out += 2;

                bitStream >>= 16;

                bitCount -= 16;

        }   }

        {   short count = normalizedCounter[charnum++];

            const short max = (short)((2*threshold-1)-remaining);

            remaining -= FSE_abs(count);

            if (remaining<1) return ERROR(GENERIC);

            count++;   /* +1 for extra accuracy */

            if (count>=threshold) count += max;   /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */

            bitStream += count << bitCount;

            bitCount  += nbBits;

            bitCount  -= (count<max);

            previous0  = (count==1);

            while (remaining<threshold) nbBits--, threshold>>=1;

        }

        if (bitCount>16) {

            if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */

            out[0] = (BYTE)bitStream;

            out[1] = (BYTE)(bitStream>>8);

            out += 2;

            bitStream >>= 16;

            bitCount -= 16;

    }   }

    /* flush remaining bitStream */

    if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */

    out[0] = (BYTE)bitStream;

    out[1] = (BYTE)(bitStream>>8);

    out+= (bitCount+7) /8;

    if (charnum > maxSymbolValue + 1) return ERROR(GENERIC);

    return (out-ostart);

}

size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)

{

    if (tableLog > FSE_MAX_TABLELOG) return ERROR(GENERIC);   /* Unsupported */

    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */

    if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))

        return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);

    return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);

}

/*-**************************************************************

*  Counting histogram

****************************************************************/

/*! FSE_count_simple

    For this reason, prefer using a table `count` with 256 elements.

    @return : count of most numerous element

*/

{

    const BYTE* ip = (const BYTE*)src;

    const BYTE* const end = ip + srcSize;

    unsigned maxSymbolValue = *maxSymbolValuePtr;

    unsigned max=0;

    memset(count, 0, (maxSymbolValue+1)*sizeof(*count));

    if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; }

    while (ip<end) count[*ip++]++;

    while (!count[maxSymbolValue]) maxSymbolValue--;

    *maxSymbolValuePtr = maxSymbolValue;

    { U32 s; for (s=0; s<=maxSymbolValue; s++) if (count[s] > max) max = count[s]; }

    return (size_t)max;

}

                                const void* source, size_t sourceSize,

{

    const BYTE* ip = (const BYTE*)source;

    const BYTE* const iend = ip+sourceSize;

    unsigned maxSymbolValue = *maxSymbolValuePtr;

    unsigned max=0;

    /* safety checks */

    if (!sourceSize) {

        memset(count, 0, maxSymbolValue + 1);

        *maxSymbolValuePtr = 0;

        return 0;

    }

    if (!maxSymbolValue) maxSymbolValue = 255;            /* 0 == default */

    /* by stripes of 16 bytes */

    {   U32 cached = MEM_read32(ip); ip += 4;

        while (ip < iend-15) {

            U32 c = cached; cached = MEM_read32(ip); ip += 4;

            Counting1[(BYTE) c     ]++;

            Counting2[(BYTE)(c>>8) ]++;

            Counting3[(BYTE)(c>>16)]++;

            Counting4[       c>>24 ]++;

            c = cached; cached = MEM_read32(ip); ip += 4;

            Counting1[(BYTE) c     ]++;

            Counting2[(BYTE)(c>>8) ]++;

            Counting3[(BYTE)(c>>16)]++;

            Counting4[       c>>24 ]++;

            c = cached; cached = MEM_read32(ip); ip += 4;

            Counting1[(BYTE) c     ]++;

            Counting2[(BYTE)(c>>8) ]++;

            Counting3[(BYTE)(c>>16)]++;

            Counting4[       c>>24 ]++;

            c = cached; cached = MEM_read32(ip); ip += 4;

            Counting1[(BYTE) c     ]++;

            Counting2[(BYTE)(c>>8) ]++;

            Counting3[(BYTE)(c>>16)]++;

            Counting4[       c>>24 ]++;

        }

        ip-=4;

    }

    /* finish last symbols */

    while (ip<iend) Counting1[*ip++]++;

    if (checkMax) {   /* verify stats will fit into destination table */

        U32 s; for (s=255; s>maxSymbolValue; s--) {

            Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];

            if (Counting1[s]) return ERROR(maxSymbolValue_tooSmall);

    }   }

    while (!count[maxSymbolValue]) maxSymbolValue--;

    *maxSymbolValuePtr = maxSymbolValue;

    return (size_t)max;

}

/* fast variant (unsafe : won't check if src contains values beyond count[] limit) */

size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr,

                     const void* source, size_t sourceSize)

{

}

size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr,

{

}

/*-**************************************************************

*  FSE Compression Code

****************************************************************/

/*! FSE_sizeof_CTable() :

    FSE_CTable is a variable size structure which contains :

    `U16 tableLog;`

    `U16 maxSymbolValue;`

    `U16 nextStateNumber[1 << tableLog];`                         // This size is variable

    `FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable

Allocation is manual (C standard does not support variable-size structures).

*/

size_t FSE_sizeof_CTable (unsigned maxSymbolValue, unsigned tableLog)

{

}

FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog)

{

    size_t size;

    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;

    size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);

    return (FSE_CTable*)malloc(size);

}

void FSE_freeCTable (FSE_CTable* ct) { free(ct); }

/* provides the minimum logSize to safely represent a distribution */

static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)

{

	U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;

	U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;

	U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;

	return minBits;

}

unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)

{

	U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;

    U32 tableLog = maxTableLog;

	U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);

    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;

	if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */

	if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */

    if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;

    if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;

    return tableLog;

}

unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)

{

    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);

}

/* Secondary normalization method.

   To be used when primary method fails. */

static size_t FSE_normalizeM2(short* norm, U32 tableLog, const unsigned* count, size_t total, U32 maxSymbolValue)

{

    U32 s;

    U32 distributed = 0;

    U32 ToDistribute;

    /* Init */

    U32 lowOne = (U32)((total * 3) >> (tableLog + 1));

    for (s=0; s<=maxSymbolValue; s++) {

        if (count[s] == 0) {

            norm[s]=0;