xref: /dflybsd-src/contrib/zstd/lib/compress/hist.h (revision a28cd43d19e8b720a6c852a4bbc5ae147a26165a)
1*a28cd43dSSascha Wildner /* ******************************************************************
2*a28cd43dSSascha Wildner  * hist : Histogram functions
3*a28cd43dSSascha Wildner  * part of Finite State Entropy project
4*a28cd43dSSascha Wildner  * Copyright (c) 2013-2020, Yann Collet, Facebook, Inc.
5*a28cd43dSSascha Wildner  *
6*a28cd43dSSascha Wildner  *  You can contact the author at :
7*a28cd43dSSascha Wildner  *  - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
8*a28cd43dSSascha Wildner  *  - Public forum : https://groups.google.com/forum/#!forum/lz4c
9*a28cd43dSSascha Wildner  *
10*a28cd43dSSascha Wildner  * This source code is licensed under both the BSD-style license (found in the
11*a28cd43dSSascha Wildner  * LICENSE file in the root directory of this source tree) and the GPLv2 (found
12*a28cd43dSSascha Wildner  * in the COPYING file in the root directory of this source tree).
13*a28cd43dSSascha Wildner  * You may select, at your option, one of the above-listed licenses.
14*a28cd43dSSascha Wildner ****************************************************************** */
15*a28cd43dSSascha Wildner 
16*a28cd43dSSascha Wildner /* --- dependencies --- */
17*a28cd43dSSascha Wildner #include "../common/zstd_deps.h"   /* size_t */
18*a28cd43dSSascha Wildner 
19*a28cd43dSSascha Wildner 
20*a28cd43dSSascha Wildner /* --- simple histogram functions --- */
21*a28cd43dSSascha Wildner 
22*a28cd43dSSascha Wildner /*! HIST_count():
23*a28cd43dSSascha Wildner  *  Provides the precise count of each byte within a table 'count'.
24*a28cd43dSSascha Wildner  * 'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
25*a28cd43dSSascha Wildner  *  Updates *maxSymbolValuePtr with actual largest symbol value detected.
26*a28cd43dSSascha Wildner  * @return : count of the most frequent symbol (which isn't identified).
27*a28cd43dSSascha Wildner  *           or an error code, which can be tested using HIST_isError().
28*a28cd43dSSascha Wildner  *           note : if return == srcSize, there is only one symbol.
29*a28cd43dSSascha Wildner  */
30*a28cd43dSSascha Wildner size_t HIST_count(unsigned* count, unsigned* maxSymbolValuePtr,
31*a28cd43dSSascha Wildner                   const void* src, size_t srcSize);
32*a28cd43dSSascha Wildner 
33*a28cd43dSSascha Wildner unsigned HIST_isError(size_t code);  /**< tells if a return value is an error code */
34*a28cd43dSSascha Wildner 
35*a28cd43dSSascha Wildner 
36*a28cd43dSSascha Wildner /* --- advanced histogram functions --- */
37*a28cd43dSSascha Wildner 
38*a28cd43dSSascha Wildner #define HIST_WKSP_SIZE_U32 1024
39*a28cd43dSSascha Wildner #define HIST_WKSP_SIZE    (HIST_WKSP_SIZE_U32 * sizeof(unsigned))
40*a28cd43dSSascha Wildner /** HIST_count_wksp() :
41*a28cd43dSSascha Wildner  *  Same as HIST_count(), but using an externally provided scratch buffer.
42*a28cd43dSSascha Wildner  *  Benefit is this function will use very little stack space.
43*a28cd43dSSascha Wildner  * `workSpace` is a writable buffer which must be 4-bytes aligned,
44*a28cd43dSSascha Wildner  * `workSpaceSize` must be >= HIST_WKSP_SIZE
45*a28cd43dSSascha Wildner  */
46*a28cd43dSSascha Wildner size_t HIST_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
47*a28cd43dSSascha Wildner                        const void* src, size_t srcSize,
48*a28cd43dSSascha Wildner                        void* workSpace, size_t workSpaceSize);
49*a28cd43dSSascha Wildner 
50*a28cd43dSSascha Wildner /** HIST_countFast() :
51*a28cd43dSSascha Wildner  *  same as HIST_count(), but blindly trusts that all byte values within src are <= *maxSymbolValuePtr.
52*a28cd43dSSascha Wildner  *  This function is unsafe, and will segfault if any value within `src` is `> *maxSymbolValuePtr`
53*a28cd43dSSascha Wildner  */
54*a28cd43dSSascha Wildner size_t HIST_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
55*a28cd43dSSascha Wildner                       const void* src, size_t srcSize);
56*a28cd43dSSascha Wildner 
57*a28cd43dSSascha Wildner /** HIST_countFast_wksp() :
58*a28cd43dSSascha Wildner  *  Same as HIST_countFast(), but using an externally provided scratch buffer.
59*a28cd43dSSascha Wildner  * `workSpace` is a writable buffer which must be 4-bytes aligned,
60*a28cd43dSSascha Wildner  * `workSpaceSize` must be >= HIST_WKSP_SIZE
61*a28cd43dSSascha Wildner  */
62*a28cd43dSSascha Wildner size_t HIST_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
63*a28cd43dSSascha Wildner                            const void* src, size_t srcSize,
64*a28cd43dSSascha Wildner                            void* workSpace, size_t workSpaceSize);
65*a28cd43dSSascha Wildner 
66*a28cd43dSSascha Wildner /*! HIST_count_simple() :
67*a28cd43dSSascha Wildner  *  Same as HIST_countFast(), this function is unsafe,
68*a28cd43dSSascha Wildner  *  and will segfault if any value within `src` is `> *maxSymbolValuePtr`.
69*a28cd43dSSascha Wildner  *  It is also a bit slower for large inputs.
70*a28cd43dSSascha Wildner  *  However, it does not need any additional memory (not even on stack).
71*a28cd43dSSascha Wildner  * @return : count of the most frequent symbol.
72*a28cd43dSSascha Wildner  *  Note this function doesn't produce any error (i.e. it must succeed).
73*a28cd43dSSascha Wildner  */
74*a28cd43dSSascha Wildner unsigned HIST_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
75*a28cd43dSSascha Wildner                            const void* src, size_t srcSize);
76