1*01826a49SYabin Cui /*
2*01826a49SYabin Cui * Copyright (c) Meta Platforms, Inc. and affiliates.
3*01826a49SYabin Cui * All rights reserved.
4*01826a49SYabin Cui *
5*01826a49SYabin Cui * This source code is licensed under both the BSD-style license (found in the
6*01826a49SYabin Cui * LICENSE file in the root directory of this source tree) and the GPLv2 (found
7*01826a49SYabin Cui * in the COPYING file in the root directory of this source tree).
8*01826a49SYabin Cui * You may select, at your option, one of the above-listed licenses.
9*01826a49SYabin Cui */
10*01826a49SYabin Cui
11*01826a49SYabin Cui /*-*************************************
12*01826a49SYabin Cui * Dependencies
13*01826a49SYabin Cui ***************************************/
14*01826a49SYabin Cui #include <stdio.h> /* fprintf */
15*01826a49SYabin Cui #include <stdlib.h> /* malloc, free, qsort */
16*01826a49SYabin Cui #include <string.h> /* memset */
17*01826a49SYabin Cui #include <time.h> /* clock */
18*01826a49SYabin Cui
19*01826a49SYabin Cui #ifndef ZDICT_STATIC_LINKING_ONLY
20*01826a49SYabin Cui # define ZDICT_STATIC_LINKING_ONLY
21*01826a49SYabin Cui #endif
22*01826a49SYabin Cui
23*01826a49SYabin Cui #include "../common/mem.h" /* read */
24*01826a49SYabin Cui #include "../common/pool.h"
25*01826a49SYabin Cui #include "../common/threading.h"
26*01826a49SYabin Cui #include "../common/zstd_internal.h" /* includes zstd.h */
27*01826a49SYabin Cui #include "../compress/zstd_compress_internal.h" /* ZSTD_hash*() */
28*01826a49SYabin Cui #include "../zdict.h"
29*01826a49SYabin Cui #include "cover.h"
30*01826a49SYabin Cui
31*01826a49SYabin Cui
32*01826a49SYabin Cui /*-*************************************
33*01826a49SYabin Cui * Constants
34*01826a49SYabin Cui ***************************************/
35*01826a49SYabin Cui /**
36*01826a49SYabin Cui * There are 32bit indexes used to ref samples, so limit samples size to 4GB
37*01826a49SYabin Cui * on 64bit builds.
38*01826a49SYabin Cui * For 32bit builds we choose 1 GB.
39*01826a49SYabin Cui * Most 32bit platforms have 2GB user-mode addressable space and we allocate a large
40*01826a49SYabin Cui * contiguous buffer, so 1GB is already a high limit.
41*01826a49SYabin Cui */
42*01826a49SYabin Cui #define FASTCOVER_MAX_SAMPLES_SIZE (sizeof(size_t) == 8 ? ((unsigned)-1) : ((unsigned)1 GB))
43*01826a49SYabin Cui #define FASTCOVER_MAX_F 31
44*01826a49SYabin Cui #define FASTCOVER_MAX_ACCEL 10
45*01826a49SYabin Cui #define FASTCOVER_DEFAULT_SPLITPOINT 0.75
46*01826a49SYabin Cui #define DEFAULT_F 20
47*01826a49SYabin Cui #define DEFAULT_ACCEL 1
48*01826a49SYabin Cui
49*01826a49SYabin Cui
50*01826a49SYabin Cui /*-*************************************
51*01826a49SYabin Cui * Console display
52*01826a49SYabin Cui ***************************************/
53*01826a49SYabin Cui #ifndef LOCALDISPLAYLEVEL
54*01826a49SYabin Cui static int g_displayLevel = 0;
55*01826a49SYabin Cui #endif
56*01826a49SYabin Cui #undef DISPLAY
57*01826a49SYabin Cui #define DISPLAY(...) \
58*01826a49SYabin Cui { \
59*01826a49SYabin Cui fprintf(stderr, __VA_ARGS__); \
60*01826a49SYabin Cui fflush(stderr); \
61*01826a49SYabin Cui }
62*01826a49SYabin Cui #undef LOCALDISPLAYLEVEL
63*01826a49SYabin Cui #define LOCALDISPLAYLEVEL(displayLevel, l, ...) \
64*01826a49SYabin Cui if (displayLevel >= l) { \
65*01826a49SYabin Cui DISPLAY(__VA_ARGS__); \
66*01826a49SYabin Cui } /* 0 : no display; 1: errors; 2: default; 3: details; 4: debug */
67*01826a49SYabin Cui #undef DISPLAYLEVEL
68*01826a49SYabin Cui #define DISPLAYLEVEL(l, ...) LOCALDISPLAYLEVEL(g_displayLevel, l, __VA_ARGS__)
69*01826a49SYabin Cui
70*01826a49SYabin Cui #ifndef LOCALDISPLAYUPDATE
71*01826a49SYabin Cui static const clock_t g_refreshRate = CLOCKS_PER_SEC * 15 / 100;
72*01826a49SYabin Cui static clock_t g_time = 0;
73*01826a49SYabin Cui #endif
74*01826a49SYabin Cui #undef LOCALDISPLAYUPDATE
75*01826a49SYabin Cui #define LOCALDISPLAYUPDATE(displayLevel, l, ...) \
76*01826a49SYabin Cui if (displayLevel >= l) { \
77*01826a49SYabin Cui if ((clock() - g_time > g_refreshRate) || (displayLevel >= 4)) { \
78*01826a49SYabin Cui g_time = clock(); \
79*01826a49SYabin Cui DISPLAY(__VA_ARGS__); \
80*01826a49SYabin Cui } \
81*01826a49SYabin Cui }
82*01826a49SYabin Cui #undef DISPLAYUPDATE
83*01826a49SYabin Cui #define DISPLAYUPDATE(l, ...) LOCALDISPLAYUPDATE(g_displayLevel, l, __VA_ARGS__)
84*01826a49SYabin Cui
85*01826a49SYabin Cui
86*01826a49SYabin Cui /*-*************************************
87*01826a49SYabin Cui * Hash Functions
88*01826a49SYabin Cui ***************************************/
89*01826a49SYabin Cui /**
90*01826a49SYabin Cui * Hash the d-byte value pointed to by p and mod 2^f into the frequency vector
91*01826a49SYabin Cui */
FASTCOVER_hashPtrToIndex(const void * p,U32 f,unsigned d)92*01826a49SYabin Cui static size_t FASTCOVER_hashPtrToIndex(const void* p, U32 f, unsigned d) {
93*01826a49SYabin Cui if (d == 6) {
94*01826a49SYabin Cui return ZSTD_hash6Ptr(p, f);
95*01826a49SYabin Cui }
96*01826a49SYabin Cui return ZSTD_hash8Ptr(p, f);
97*01826a49SYabin Cui }
98*01826a49SYabin Cui
99*01826a49SYabin Cui
100*01826a49SYabin Cui /*-*************************************
101*01826a49SYabin Cui * Acceleration
102*01826a49SYabin Cui ***************************************/
103*01826a49SYabin Cui typedef struct {
104*01826a49SYabin Cui unsigned finalize; /* Percentage of training samples used for ZDICT_finalizeDictionary */
105*01826a49SYabin Cui unsigned skip; /* Number of dmer skipped between each dmer counted in computeFrequency */
106*01826a49SYabin Cui } FASTCOVER_accel_t;
107*01826a49SYabin Cui
108*01826a49SYabin Cui
109*01826a49SYabin Cui static const FASTCOVER_accel_t FASTCOVER_defaultAccelParameters[FASTCOVER_MAX_ACCEL+1] = {
110*01826a49SYabin Cui { 100, 0 }, /* accel = 0, should not happen because accel = 0 defaults to accel = 1 */
111*01826a49SYabin Cui { 100, 0 }, /* accel = 1 */
112*01826a49SYabin Cui { 50, 1 }, /* accel = 2 */
113*01826a49SYabin Cui { 34, 2 }, /* accel = 3 */
114*01826a49SYabin Cui { 25, 3 }, /* accel = 4 */
115*01826a49SYabin Cui { 20, 4 }, /* accel = 5 */
116*01826a49SYabin Cui { 17, 5 }, /* accel = 6 */
117*01826a49SYabin Cui { 14, 6 }, /* accel = 7 */
118*01826a49SYabin Cui { 13, 7 }, /* accel = 8 */
119*01826a49SYabin Cui { 11, 8 }, /* accel = 9 */
120*01826a49SYabin Cui { 10, 9 }, /* accel = 10 */
121*01826a49SYabin Cui };
122*01826a49SYabin Cui
123*01826a49SYabin Cui
124*01826a49SYabin Cui /*-*************************************
125*01826a49SYabin Cui * Context
126*01826a49SYabin Cui ***************************************/
127*01826a49SYabin Cui typedef struct {
128*01826a49SYabin Cui const BYTE *samples;
129*01826a49SYabin Cui size_t *offsets;
130*01826a49SYabin Cui const size_t *samplesSizes;
131*01826a49SYabin Cui size_t nbSamples;
132*01826a49SYabin Cui size_t nbTrainSamples;
133*01826a49SYabin Cui size_t nbTestSamples;
134*01826a49SYabin Cui size_t nbDmers;
135*01826a49SYabin Cui U32 *freqs;
136*01826a49SYabin Cui unsigned d;
137*01826a49SYabin Cui unsigned f;
138*01826a49SYabin Cui FASTCOVER_accel_t accelParams;
139*01826a49SYabin Cui } FASTCOVER_ctx_t;
140*01826a49SYabin Cui
141*01826a49SYabin Cui
142*01826a49SYabin Cui /*-*************************************
143*01826a49SYabin Cui * Helper functions
144*01826a49SYabin Cui ***************************************/
145*01826a49SYabin Cui /**
146*01826a49SYabin Cui * Selects the best segment in an epoch.
147*01826a49SYabin Cui * Segments of are scored according to the function:
148*01826a49SYabin Cui *
149*01826a49SYabin Cui * Let F(d) be the frequency of all dmers with hash value d.
150*01826a49SYabin Cui * Let S_i be hash value of the dmer at position i of segment S which has length k.
151*01826a49SYabin Cui *
152*01826a49SYabin Cui * Score(S) = F(S_1) + F(S_2) + ... + F(S_{k-d+1})
153*01826a49SYabin Cui *
154*01826a49SYabin Cui * Once the dmer with hash value d is in the dictionary we set F(d) = 0.
155*01826a49SYabin Cui */
FASTCOVER_selectSegment(const FASTCOVER_ctx_t * ctx,U32 * freqs,U32 begin,U32 end,ZDICT_cover_params_t parameters,U16 * segmentFreqs)156*01826a49SYabin Cui static COVER_segment_t FASTCOVER_selectSegment(const FASTCOVER_ctx_t *ctx,
157*01826a49SYabin Cui U32 *freqs, U32 begin, U32 end,
158*01826a49SYabin Cui ZDICT_cover_params_t parameters,
159*01826a49SYabin Cui U16* segmentFreqs) {
160*01826a49SYabin Cui /* Constants */
161*01826a49SYabin Cui const U32 k = parameters.k;
162*01826a49SYabin Cui const U32 d = parameters.d;
163*01826a49SYabin Cui const U32 f = ctx->f;
164*01826a49SYabin Cui const U32 dmersInK = k - d + 1;
165*01826a49SYabin Cui
166*01826a49SYabin Cui /* Try each segment (activeSegment) and save the best (bestSegment) */
167*01826a49SYabin Cui COVER_segment_t bestSegment = {0, 0, 0};
168*01826a49SYabin Cui COVER_segment_t activeSegment;
169*01826a49SYabin Cui
170*01826a49SYabin Cui /* Reset the activeDmers in the segment */
171*01826a49SYabin Cui /* The activeSegment starts at the beginning of the epoch. */
172*01826a49SYabin Cui activeSegment.begin = begin;
173*01826a49SYabin Cui activeSegment.end = begin;
174*01826a49SYabin Cui activeSegment.score = 0;
175*01826a49SYabin Cui
176*01826a49SYabin Cui /* Slide the activeSegment through the whole epoch.
177*01826a49SYabin Cui * Save the best segment in bestSegment.
178*01826a49SYabin Cui */
179*01826a49SYabin Cui while (activeSegment.end < end) {
180*01826a49SYabin Cui /* Get hash value of current dmer */
181*01826a49SYabin Cui const size_t idx = FASTCOVER_hashPtrToIndex(ctx->samples + activeSegment.end, f, d);
182*01826a49SYabin Cui
183*01826a49SYabin Cui /* Add frequency of this index to score if this is the first occurrence of index in active segment */
184*01826a49SYabin Cui if (segmentFreqs[idx] == 0) {
185*01826a49SYabin Cui activeSegment.score += freqs[idx];
186*01826a49SYabin Cui }
187*01826a49SYabin Cui /* Increment end of segment and segmentFreqs*/
188*01826a49SYabin Cui activeSegment.end += 1;
189*01826a49SYabin Cui segmentFreqs[idx] += 1;
190*01826a49SYabin Cui /* If the window is now too large, drop the first position */
191*01826a49SYabin Cui if (activeSegment.end - activeSegment.begin == dmersInK + 1) {
192*01826a49SYabin Cui /* Get hash value of the dmer to be eliminated from active segment */
193*01826a49SYabin Cui const size_t delIndex = FASTCOVER_hashPtrToIndex(ctx->samples + activeSegment.begin, f, d);
194*01826a49SYabin Cui segmentFreqs[delIndex] -= 1;
195*01826a49SYabin Cui /* Subtract frequency of this index from score if this is the last occurrence of this index in active segment */
196*01826a49SYabin Cui if (segmentFreqs[delIndex] == 0) {
197*01826a49SYabin Cui activeSegment.score -= freqs[delIndex];
198*01826a49SYabin Cui }
199*01826a49SYabin Cui /* Increment start of segment */
200*01826a49SYabin Cui activeSegment.begin += 1;
201*01826a49SYabin Cui }
202*01826a49SYabin Cui
203*01826a49SYabin Cui /* If this segment is the best so far save it */
204*01826a49SYabin Cui if (activeSegment.score > bestSegment.score) {
205*01826a49SYabin Cui bestSegment = activeSegment;
206*01826a49SYabin Cui }
207*01826a49SYabin Cui }
208*01826a49SYabin Cui
209*01826a49SYabin Cui /* Zero out rest of segmentFreqs array */
210*01826a49SYabin Cui while (activeSegment.begin < end) {
211*01826a49SYabin Cui const size_t delIndex = FASTCOVER_hashPtrToIndex(ctx->samples + activeSegment.begin, f, d);
212*01826a49SYabin Cui segmentFreqs[delIndex] -= 1;
213*01826a49SYabin Cui activeSegment.begin += 1;
214*01826a49SYabin Cui }
215*01826a49SYabin Cui
216*01826a49SYabin Cui {
217*01826a49SYabin Cui /* Zero the frequency of hash value of each dmer covered by the chosen segment. */
218*01826a49SYabin Cui U32 pos;
219*01826a49SYabin Cui for (pos = bestSegment.begin; pos != bestSegment.end; ++pos) {
220*01826a49SYabin Cui const size_t i = FASTCOVER_hashPtrToIndex(ctx->samples + pos, f, d);
221*01826a49SYabin Cui freqs[i] = 0;
222*01826a49SYabin Cui }
223*01826a49SYabin Cui }
224*01826a49SYabin Cui
225*01826a49SYabin Cui return bestSegment;
226*01826a49SYabin Cui }
227*01826a49SYabin Cui
228*01826a49SYabin Cui
FASTCOVER_checkParameters(ZDICT_cover_params_t parameters,size_t maxDictSize,unsigned f,unsigned accel)229*01826a49SYabin Cui static int FASTCOVER_checkParameters(ZDICT_cover_params_t parameters,
230*01826a49SYabin Cui size_t maxDictSize, unsigned f,
231*01826a49SYabin Cui unsigned accel) {
232*01826a49SYabin Cui /* k, d, and f are required parameters */
233*01826a49SYabin Cui if (parameters.d == 0 || parameters.k == 0) {
234*01826a49SYabin Cui return 0;
235*01826a49SYabin Cui }
236*01826a49SYabin Cui /* d has to be 6 or 8 */
237*01826a49SYabin Cui if (parameters.d != 6 && parameters.d != 8) {
238*01826a49SYabin Cui return 0;
239*01826a49SYabin Cui }
240*01826a49SYabin Cui /* k <= maxDictSize */
241*01826a49SYabin Cui if (parameters.k > maxDictSize) {
242*01826a49SYabin Cui return 0;
243*01826a49SYabin Cui }
244*01826a49SYabin Cui /* d <= k */
245*01826a49SYabin Cui if (parameters.d > parameters.k) {
246*01826a49SYabin Cui return 0;
247*01826a49SYabin Cui }
248*01826a49SYabin Cui /* 0 < f <= FASTCOVER_MAX_F*/
249*01826a49SYabin Cui if (f > FASTCOVER_MAX_F || f == 0) {
250*01826a49SYabin Cui return 0;
251*01826a49SYabin Cui }
252*01826a49SYabin Cui /* 0 < splitPoint <= 1 */
253*01826a49SYabin Cui if (parameters.splitPoint <= 0 || parameters.splitPoint > 1) {
254*01826a49SYabin Cui return 0;
255*01826a49SYabin Cui }
256*01826a49SYabin Cui /* 0 < accel <= 10 */
257*01826a49SYabin Cui if (accel > 10 || accel == 0) {
258*01826a49SYabin Cui return 0;
259*01826a49SYabin Cui }
260*01826a49SYabin Cui return 1;
261*01826a49SYabin Cui }
262*01826a49SYabin Cui
263*01826a49SYabin Cui
264*01826a49SYabin Cui /**
265*01826a49SYabin Cui * Clean up a context initialized with `FASTCOVER_ctx_init()`.
266*01826a49SYabin Cui */
267*01826a49SYabin Cui static void
FASTCOVER_ctx_destroy(FASTCOVER_ctx_t * ctx)268*01826a49SYabin Cui FASTCOVER_ctx_destroy(FASTCOVER_ctx_t* ctx)
269*01826a49SYabin Cui {
270*01826a49SYabin Cui if (!ctx) return;
271*01826a49SYabin Cui
272*01826a49SYabin Cui free(ctx->freqs);
273*01826a49SYabin Cui ctx->freqs = NULL;
274*01826a49SYabin Cui
275*01826a49SYabin Cui free(ctx->offsets);
276*01826a49SYabin Cui ctx->offsets = NULL;
277*01826a49SYabin Cui }
278*01826a49SYabin Cui
279*01826a49SYabin Cui
280*01826a49SYabin Cui /**
281*01826a49SYabin Cui * Calculate for frequency of hash value of each dmer in ctx->samples
282*01826a49SYabin Cui */
283*01826a49SYabin Cui static void
FASTCOVER_computeFrequency(U32 * freqs,const FASTCOVER_ctx_t * ctx)284*01826a49SYabin Cui FASTCOVER_computeFrequency(U32* freqs, const FASTCOVER_ctx_t* ctx)
285*01826a49SYabin Cui {
286*01826a49SYabin Cui const unsigned f = ctx->f;
287*01826a49SYabin Cui const unsigned d = ctx->d;
288*01826a49SYabin Cui const unsigned skip = ctx->accelParams.skip;
289*01826a49SYabin Cui const unsigned readLength = MAX(d, 8);
290*01826a49SYabin Cui size_t i;
291*01826a49SYabin Cui assert(ctx->nbTrainSamples >= 5);
292*01826a49SYabin Cui assert(ctx->nbTrainSamples <= ctx->nbSamples);
293*01826a49SYabin Cui for (i = 0; i < ctx->nbTrainSamples; i++) {
294*01826a49SYabin Cui size_t start = ctx->offsets[i]; /* start of current dmer */
295*01826a49SYabin Cui size_t const currSampleEnd = ctx->offsets[i+1];
296*01826a49SYabin Cui while (start + readLength <= currSampleEnd) {
297*01826a49SYabin Cui const size_t dmerIndex = FASTCOVER_hashPtrToIndex(ctx->samples + start, f, d);
298*01826a49SYabin Cui freqs[dmerIndex]++;
299*01826a49SYabin Cui start = start + skip + 1;
300*01826a49SYabin Cui }
301*01826a49SYabin Cui }
302*01826a49SYabin Cui }
303*01826a49SYabin Cui
304*01826a49SYabin Cui
305*01826a49SYabin Cui /**
306*01826a49SYabin Cui * Prepare a context for dictionary building.
307*01826a49SYabin Cui * The context is only dependent on the parameter `d` and can be used multiple
308*01826a49SYabin Cui * times.
309*01826a49SYabin Cui * Returns 0 on success or error code on error.
310*01826a49SYabin Cui * The context must be destroyed with `FASTCOVER_ctx_destroy()`.
311*01826a49SYabin Cui */
312*01826a49SYabin Cui static size_t
FASTCOVER_ctx_init(FASTCOVER_ctx_t * ctx,const void * samplesBuffer,const size_t * samplesSizes,unsigned nbSamples,unsigned d,double splitPoint,unsigned f,FASTCOVER_accel_t accelParams)313*01826a49SYabin Cui FASTCOVER_ctx_init(FASTCOVER_ctx_t* ctx,
314*01826a49SYabin Cui const void* samplesBuffer,
315*01826a49SYabin Cui const size_t* samplesSizes, unsigned nbSamples,
316*01826a49SYabin Cui unsigned d, double splitPoint, unsigned f,
317*01826a49SYabin Cui FASTCOVER_accel_t accelParams)
318*01826a49SYabin Cui {
319*01826a49SYabin Cui const BYTE* const samples = (const BYTE*)samplesBuffer;
320*01826a49SYabin Cui const size_t totalSamplesSize = COVER_sum(samplesSizes, nbSamples);
321*01826a49SYabin Cui /* Split samples into testing and training sets */
322*01826a49SYabin Cui const unsigned nbTrainSamples = splitPoint < 1.0 ? (unsigned)((double)nbSamples * splitPoint) : nbSamples;
323*01826a49SYabin Cui const unsigned nbTestSamples = splitPoint < 1.0 ? nbSamples - nbTrainSamples : nbSamples;
324*01826a49SYabin Cui const size_t trainingSamplesSize = splitPoint < 1.0 ? COVER_sum(samplesSizes, nbTrainSamples) : totalSamplesSize;
325*01826a49SYabin Cui const size_t testSamplesSize = splitPoint < 1.0 ? COVER_sum(samplesSizes + nbTrainSamples, nbTestSamples) : totalSamplesSize;
326*01826a49SYabin Cui
327*01826a49SYabin Cui /* Checks */
328*01826a49SYabin Cui if (totalSamplesSize < MAX(d, sizeof(U64)) ||
329*01826a49SYabin Cui totalSamplesSize >= (size_t)FASTCOVER_MAX_SAMPLES_SIZE) {
330*01826a49SYabin Cui DISPLAYLEVEL(1, "Total samples size is too large (%u MB), maximum size is %u MB\n",
331*01826a49SYabin Cui (unsigned)(totalSamplesSize >> 20), (FASTCOVER_MAX_SAMPLES_SIZE >> 20));
332*01826a49SYabin Cui return ERROR(srcSize_wrong);
333*01826a49SYabin Cui }
334*01826a49SYabin Cui
335*01826a49SYabin Cui /* Check if there are at least 5 training samples */
336*01826a49SYabin Cui if (nbTrainSamples < 5) {
337*01826a49SYabin Cui DISPLAYLEVEL(1, "Total number of training samples is %u and is invalid\n", nbTrainSamples);
338*01826a49SYabin Cui return ERROR(srcSize_wrong);
339*01826a49SYabin Cui }
340*01826a49SYabin Cui
341*01826a49SYabin Cui /* Check if there's testing sample */
342*01826a49SYabin Cui if (nbTestSamples < 1) {
343*01826a49SYabin Cui DISPLAYLEVEL(1, "Total number of testing samples is %u and is invalid.\n", nbTestSamples);
344*01826a49SYabin Cui return ERROR(srcSize_wrong);
345*01826a49SYabin Cui }
346*01826a49SYabin Cui
347*01826a49SYabin Cui /* Zero the context */
348*01826a49SYabin Cui memset(ctx, 0, sizeof(*ctx));
349*01826a49SYabin Cui DISPLAYLEVEL(2, "Training on %u samples of total size %u\n", nbTrainSamples,
350*01826a49SYabin Cui (unsigned)trainingSamplesSize);
351*01826a49SYabin Cui DISPLAYLEVEL(2, "Testing on %u samples of total size %u\n", nbTestSamples,
352*01826a49SYabin Cui (unsigned)testSamplesSize);
353*01826a49SYabin Cui
354*01826a49SYabin Cui ctx->samples = samples;
355*01826a49SYabin Cui ctx->samplesSizes = samplesSizes;
356*01826a49SYabin Cui ctx->nbSamples = nbSamples;
357*01826a49SYabin Cui ctx->nbTrainSamples = nbTrainSamples;
358*01826a49SYabin Cui ctx->nbTestSamples = nbTestSamples;
359*01826a49SYabin Cui ctx->nbDmers = trainingSamplesSize - MAX(d, sizeof(U64)) + 1;
360*01826a49SYabin Cui ctx->d = d;
361*01826a49SYabin Cui ctx->f = f;
362*01826a49SYabin Cui ctx->accelParams = accelParams;
363*01826a49SYabin Cui
364*01826a49SYabin Cui /* The offsets of each file */
365*01826a49SYabin Cui ctx->offsets = (size_t*)calloc((nbSamples + 1), sizeof(size_t));
366*01826a49SYabin Cui if (ctx->offsets == NULL) {
367*01826a49SYabin Cui DISPLAYLEVEL(1, "Failed to allocate scratch buffers \n");
368*01826a49SYabin Cui FASTCOVER_ctx_destroy(ctx);
369*01826a49SYabin Cui return ERROR(memory_allocation);
370*01826a49SYabin Cui }
371*01826a49SYabin Cui
372*01826a49SYabin Cui /* Fill offsets from the samplesSizes */
373*01826a49SYabin Cui { U32 i;
374*01826a49SYabin Cui ctx->offsets[0] = 0;
375*01826a49SYabin Cui assert(nbSamples >= 5);
376*01826a49SYabin Cui for (i = 1; i <= nbSamples; ++i) {
377*01826a49SYabin Cui ctx->offsets[i] = ctx->offsets[i - 1] + samplesSizes[i - 1];
378*01826a49SYabin Cui }
379*01826a49SYabin Cui }
380*01826a49SYabin Cui
381*01826a49SYabin Cui /* Initialize frequency array of size 2^f */
382*01826a49SYabin Cui ctx->freqs = (U32*)calloc(((U64)1 << f), sizeof(U32));
383*01826a49SYabin Cui if (ctx->freqs == NULL) {
384*01826a49SYabin Cui DISPLAYLEVEL(1, "Failed to allocate frequency table \n");
385*01826a49SYabin Cui FASTCOVER_ctx_destroy(ctx);
386*01826a49SYabin Cui return ERROR(memory_allocation);
387*01826a49SYabin Cui }
388*01826a49SYabin Cui
389*01826a49SYabin Cui DISPLAYLEVEL(2, "Computing frequencies\n");
390*01826a49SYabin Cui FASTCOVER_computeFrequency(ctx->freqs, ctx);
391*01826a49SYabin Cui
392*01826a49SYabin Cui return 0;
393*01826a49SYabin Cui }
394*01826a49SYabin Cui
395*01826a49SYabin Cui
396*01826a49SYabin Cui /**
397*01826a49SYabin Cui * Given the prepared context build the dictionary.
398*01826a49SYabin Cui */
399*01826a49SYabin Cui static size_t
FASTCOVER_buildDictionary(const FASTCOVER_ctx_t * ctx,U32 * freqs,void * dictBuffer,size_t dictBufferCapacity,ZDICT_cover_params_t parameters,U16 * segmentFreqs)400*01826a49SYabin Cui FASTCOVER_buildDictionary(const FASTCOVER_ctx_t* ctx,
401*01826a49SYabin Cui U32* freqs,
402*01826a49SYabin Cui void* dictBuffer, size_t dictBufferCapacity,
403*01826a49SYabin Cui ZDICT_cover_params_t parameters,
404*01826a49SYabin Cui U16* segmentFreqs)
405*01826a49SYabin Cui {
406*01826a49SYabin Cui BYTE *const dict = (BYTE *)dictBuffer;
407*01826a49SYabin Cui size_t tail = dictBufferCapacity;
408*01826a49SYabin Cui /* Divide the data into epochs. We will select one segment from each epoch. */
409*01826a49SYabin Cui const COVER_epoch_info_t epochs = COVER_computeEpochs(
410*01826a49SYabin Cui (U32)dictBufferCapacity, (U32)ctx->nbDmers, parameters.k, 1);
411*01826a49SYabin Cui const size_t maxZeroScoreRun = 10;
412*01826a49SYabin Cui size_t zeroScoreRun = 0;
413*01826a49SYabin Cui size_t epoch;
414*01826a49SYabin Cui DISPLAYLEVEL(2, "Breaking content into %u epochs of size %u\n",
415*01826a49SYabin Cui (U32)epochs.num, (U32)epochs.size);
416*01826a49SYabin Cui /* Loop through the epochs until there are no more segments or the dictionary
417*01826a49SYabin Cui * is full.
418*01826a49SYabin Cui */
419*01826a49SYabin Cui for (epoch = 0; tail > 0; epoch = (epoch + 1) % epochs.num) {
420*01826a49SYabin Cui const U32 epochBegin = (U32)(epoch * epochs.size);
421*01826a49SYabin Cui const U32 epochEnd = epochBegin + epochs.size;
422*01826a49SYabin Cui size_t segmentSize;
423*01826a49SYabin Cui /* Select a segment */
424*01826a49SYabin Cui COVER_segment_t segment = FASTCOVER_selectSegment(
425*01826a49SYabin Cui ctx, freqs, epochBegin, epochEnd, parameters, segmentFreqs);
426*01826a49SYabin Cui
427*01826a49SYabin Cui /* If the segment covers no dmers, then we are out of content.
428*01826a49SYabin Cui * There may be new content in other epochs, for continue for some time.
429*01826a49SYabin Cui */
430*01826a49SYabin Cui if (segment.score == 0) {
431*01826a49SYabin Cui if (++zeroScoreRun >= maxZeroScoreRun) {
432*01826a49SYabin Cui break;
433*01826a49SYabin Cui }
434*01826a49SYabin Cui continue;
435*01826a49SYabin Cui }
436*01826a49SYabin Cui zeroScoreRun = 0;
437*01826a49SYabin Cui
438*01826a49SYabin Cui /* Trim the segment if necessary and if it is too small then we are done */
439*01826a49SYabin Cui segmentSize = MIN(segment.end - segment.begin + parameters.d - 1, tail);
440*01826a49SYabin Cui if (segmentSize < parameters.d) {
441*01826a49SYabin Cui break;
442*01826a49SYabin Cui }
443*01826a49SYabin Cui
444*01826a49SYabin Cui /* We fill the dictionary from the back to allow the best segments to be
445*01826a49SYabin Cui * referenced with the smallest offsets.
446*01826a49SYabin Cui */
447*01826a49SYabin Cui tail -= segmentSize;
448*01826a49SYabin Cui memcpy(dict + tail, ctx->samples + segment.begin, segmentSize);
449*01826a49SYabin Cui DISPLAYUPDATE(
450*01826a49SYabin Cui 2, "\r%u%% ",
451*01826a49SYabin Cui (unsigned)(((dictBufferCapacity - tail) * 100) / dictBufferCapacity));
452*01826a49SYabin Cui }
453*01826a49SYabin Cui DISPLAYLEVEL(2, "\r%79s\r", "");
454*01826a49SYabin Cui return tail;
455*01826a49SYabin Cui }
456*01826a49SYabin Cui
457*01826a49SYabin Cui /**
458*01826a49SYabin Cui * Parameters for FASTCOVER_tryParameters().
459*01826a49SYabin Cui */
460*01826a49SYabin Cui typedef struct FASTCOVER_tryParameters_data_s {
461*01826a49SYabin Cui const FASTCOVER_ctx_t* ctx;
462*01826a49SYabin Cui COVER_best_t* best;
463*01826a49SYabin Cui size_t dictBufferCapacity;
464*01826a49SYabin Cui ZDICT_cover_params_t parameters;
465*01826a49SYabin Cui } FASTCOVER_tryParameters_data_t;
466*01826a49SYabin Cui
467*01826a49SYabin Cui
468*01826a49SYabin Cui /**
469*01826a49SYabin Cui * Tries a set of parameters and updates the COVER_best_t with the results.
470*01826a49SYabin Cui * This function is thread safe if zstd is compiled with multithreaded support.
471*01826a49SYabin Cui * It takes its parameters as an *OWNING* opaque pointer to support threading.
472*01826a49SYabin Cui */
FASTCOVER_tryParameters(void * opaque)473*01826a49SYabin Cui static void FASTCOVER_tryParameters(void* opaque)
474*01826a49SYabin Cui {
475*01826a49SYabin Cui /* Save parameters as local variables */
476*01826a49SYabin Cui FASTCOVER_tryParameters_data_t *const data = (FASTCOVER_tryParameters_data_t*)opaque;
477*01826a49SYabin Cui const FASTCOVER_ctx_t *const ctx = data->ctx;
478*01826a49SYabin Cui const ZDICT_cover_params_t parameters = data->parameters;
479*01826a49SYabin Cui size_t dictBufferCapacity = data->dictBufferCapacity;
480*01826a49SYabin Cui size_t totalCompressedSize = ERROR(GENERIC);
481*01826a49SYabin Cui /* Initialize array to keep track of frequency of dmer within activeSegment */
482*01826a49SYabin Cui U16* segmentFreqs = (U16*)calloc(((U64)1 << ctx->f), sizeof(U16));
483*01826a49SYabin Cui /* Allocate space for hash table, dict, and freqs */
484*01826a49SYabin Cui BYTE *const dict = (BYTE*)malloc(dictBufferCapacity);
485*01826a49SYabin Cui COVER_dictSelection_t selection = COVER_dictSelectionError(ERROR(GENERIC));
486*01826a49SYabin Cui U32* freqs = (U32*) malloc(((U64)1 << ctx->f) * sizeof(U32));
487*01826a49SYabin Cui if (!segmentFreqs || !dict || !freqs) {
488*01826a49SYabin Cui DISPLAYLEVEL(1, "Failed to allocate buffers: out of memory\n");
489*01826a49SYabin Cui goto _cleanup;
490*01826a49SYabin Cui }
491*01826a49SYabin Cui /* Copy the frequencies because we need to modify them */
492*01826a49SYabin Cui memcpy(freqs, ctx->freqs, ((U64)1 << ctx->f) * sizeof(U32));
493*01826a49SYabin Cui /* Build the dictionary */
494*01826a49SYabin Cui { const size_t tail = FASTCOVER_buildDictionary(ctx, freqs, dict, dictBufferCapacity,
495*01826a49SYabin Cui parameters, segmentFreqs);
496*01826a49SYabin Cui
497*01826a49SYabin Cui const unsigned nbFinalizeSamples = (unsigned)(ctx->nbTrainSamples * ctx->accelParams.finalize / 100);
498*01826a49SYabin Cui selection = COVER_selectDict(dict + tail, dictBufferCapacity, dictBufferCapacity - tail,
499*01826a49SYabin Cui ctx->samples, ctx->samplesSizes, nbFinalizeSamples, ctx->nbTrainSamples, ctx->nbSamples, parameters, ctx->offsets,
500*01826a49SYabin Cui totalCompressedSize);
501*01826a49SYabin Cui
502*01826a49SYabin Cui if (COVER_dictSelectionIsError(selection)) {
503*01826a49SYabin Cui DISPLAYLEVEL(1, "Failed to select dictionary\n");
504*01826a49SYabin Cui goto _cleanup;
505*01826a49SYabin Cui }
506*01826a49SYabin Cui }
507*01826a49SYabin Cui _cleanup:
508*01826a49SYabin Cui free(dict);
509*01826a49SYabin Cui COVER_best_finish(data->best, parameters, selection);
510*01826a49SYabin Cui free(data);
511*01826a49SYabin Cui free(segmentFreqs);
512*01826a49SYabin Cui COVER_dictSelectionFree(selection);
513*01826a49SYabin Cui free(freqs);
514*01826a49SYabin Cui }
515*01826a49SYabin Cui
516*01826a49SYabin Cui
517*01826a49SYabin Cui static void
FASTCOVER_convertToCoverParams(ZDICT_fastCover_params_t fastCoverParams,ZDICT_cover_params_t * coverParams)518*01826a49SYabin Cui FASTCOVER_convertToCoverParams(ZDICT_fastCover_params_t fastCoverParams,
519*01826a49SYabin Cui ZDICT_cover_params_t* coverParams)
520*01826a49SYabin Cui {
521*01826a49SYabin Cui coverParams->k = fastCoverParams.k;
522*01826a49SYabin Cui coverParams->d = fastCoverParams.d;
523*01826a49SYabin Cui coverParams->steps = fastCoverParams.steps;
524*01826a49SYabin Cui coverParams->nbThreads = fastCoverParams.nbThreads;
525*01826a49SYabin Cui coverParams->splitPoint = fastCoverParams.splitPoint;
526*01826a49SYabin Cui coverParams->zParams = fastCoverParams.zParams;
527*01826a49SYabin Cui coverParams->shrinkDict = fastCoverParams.shrinkDict;
528*01826a49SYabin Cui }
529*01826a49SYabin Cui
530*01826a49SYabin Cui
531*01826a49SYabin Cui static void
FASTCOVER_convertToFastCoverParams(ZDICT_cover_params_t coverParams,ZDICT_fastCover_params_t * fastCoverParams,unsigned f,unsigned accel)532*01826a49SYabin Cui FASTCOVER_convertToFastCoverParams(ZDICT_cover_params_t coverParams,
533*01826a49SYabin Cui ZDICT_fastCover_params_t* fastCoverParams,
534*01826a49SYabin Cui unsigned f, unsigned accel)
535*01826a49SYabin Cui {
536*01826a49SYabin Cui fastCoverParams->k = coverParams.k;
537*01826a49SYabin Cui fastCoverParams->d = coverParams.d;
538*01826a49SYabin Cui fastCoverParams->steps = coverParams.steps;
539*01826a49SYabin Cui fastCoverParams->nbThreads = coverParams.nbThreads;
540*01826a49SYabin Cui fastCoverParams->splitPoint = coverParams.splitPoint;
541*01826a49SYabin Cui fastCoverParams->f = f;
542*01826a49SYabin Cui fastCoverParams->accel = accel;
543*01826a49SYabin Cui fastCoverParams->zParams = coverParams.zParams;
544*01826a49SYabin Cui fastCoverParams->shrinkDict = coverParams.shrinkDict;
545*01826a49SYabin Cui }
546*01826a49SYabin Cui
547*01826a49SYabin Cui
548*01826a49SYabin Cui ZDICTLIB_STATIC_API size_t
ZDICT_trainFromBuffer_fastCover(void * dictBuffer,size_t dictBufferCapacity,const void * samplesBuffer,const size_t * samplesSizes,unsigned nbSamples,ZDICT_fastCover_params_t parameters)549*01826a49SYabin Cui ZDICT_trainFromBuffer_fastCover(void* dictBuffer, size_t dictBufferCapacity,
550*01826a49SYabin Cui const void* samplesBuffer,
551*01826a49SYabin Cui const size_t* samplesSizes, unsigned nbSamples,
552*01826a49SYabin Cui ZDICT_fastCover_params_t parameters)
553*01826a49SYabin Cui {
554*01826a49SYabin Cui BYTE* const dict = (BYTE*)dictBuffer;
555*01826a49SYabin Cui FASTCOVER_ctx_t ctx;
556*01826a49SYabin Cui ZDICT_cover_params_t coverParams;
557*01826a49SYabin Cui FASTCOVER_accel_t accelParams;
558*01826a49SYabin Cui /* Initialize global data */
559*01826a49SYabin Cui g_displayLevel = (int)parameters.zParams.notificationLevel;
560*01826a49SYabin Cui /* Assign splitPoint and f if not provided */
561*01826a49SYabin Cui parameters.splitPoint = 1.0;
562*01826a49SYabin Cui parameters.f = parameters.f == 0 ? DEFAULT_F : parameters.f;
563*01826a49SYabin Cui parameters.accel = parameters.accel == 0 ? DEFAULT_ACCEL : parameters.accel;
564*01826a49SYabin Cui /* Convert to cover parameter */
565*01826a49SYabin Cui memset(&coverParams, 0 , sizeof(coverParams));
566*01826a49SYabin Cui FASTCOVER_convertToCoverParams(parameters, &coverParams);
567*01826a49SYabin Cui /* Checks */
568*01826a49SYabin Cui if (!FASTCOVER_checkParameters(coverParams, dictBufferCapacity, parameters.f,
569*01826a49SYabin Cui parameters.accel)) {
570*01826a49SYabin Cui DISPLAYLEVEL(1, "FASTCOVER parameters incorrect\n");
571*01826a49SYabin Cui return ERROR(parameter_outOfBound);
572*01826a49SYabin Cui }
573*01826a49SYabin Cui if (nbSamples == 0) {
574*01826a49SYabin Cui DISPLAYLEVEL(1, "FASTCOVER must have at least one input file\n");
575*01826a49SYabin Cui return ERROR(srcSize_wrong);
576*01826a49SYabin Cui }
577*01826a49SYabin Cui if (dictBufferCapacity < ZDICT_DICTSIZE_MIN) {
578*01826a49SYabin Cui DISPLAYLEVEL(1, "dictBufferCapacity must be at least %u\n",
579*01826a49SYabin Cui ZDICT_DICTSIZE_MIN);
580*01826a49SYabin Cui return ERROR(dstSize_tooSmall);
581*01826a49SYabin Cui }
582*01826a49SYabin Cui /* Assign corresponding FASTCOVER_accel_t to accelParams*/
583*01826a49SYabin Cui accelParams = FASTCOVER_defaultAccelParameters[parameters.accel];
584*01826a49SYabin Cui /* Initialize context */
585*01826a49SYabin Cui {
586*01826a49SYabin Cui size_t const initVal = FASTCOVER_ctx_init(&ctx, samplesBuffer, samplesSizes, nbSamples,
587*01826a49SYabin Cui coverParams.d, parameters.splitPoint, parameters.f,
588*01826a49SYabin Cui accelParams);
589*01826a49SYabin Cui if (ZSTD_isError(initVal)) {
590*01826a49SYabin Cui DISPLAYLEVEL(1, "Failed to initialize context\n");
591*01826a49SYabin Cui return initVal;
592*01826a49SYabin Cui }
593*01826a49SYabin Cui }
594*01826a49SYabin Cui COVER_warnOnSmallCorpus(dictBufferCapacity, ctx.nbDmers, g_displayLevel);
595*01826a49SYabin Cui /* Build the dictionary */
596*01826a49SYabin Cui DISPLAYLEVEL(2, "Building dictionary\n");
597*01826a49SYabin Cui {
598*01826a49SYabin Cui /* Initialize array to keep track of frequency of dmer within activeSegment */
599*01826a49SYabin Cui U16* segmentFreqs = (U16 *)calloc(((U64)1 << parameters.f), sizeof(U16));
600*01826a49SYabin Cui const size_t tail = FASTCOVER_buildDictionary(&ctx, ctx.freqs, dictBuffer,
601*01826a49SYabin Cui dictBufferCapacity, coverParams, segmentFreqs);
602*01826a49SYabin Cui const unsigned nbFinalizeSamples = (unsigned)(ctx.nbTrainSamples * ctx.accelParams.finalize / 100);
603*01826a49SYabin Cui const size_t dictionarySize = ZDICT_finalizeDictionary(
604*01826a49SYabin Cui dict, dictBufferCapacity, dict + tail, dictBufferCapacity - tail,
605*01826a49SYabin Cui samplesBuffer, samplesSizes, nbFinalizeSamples, coverParams.zParams);
606*01826a49SYabin Cui if (!ZSTD_isError(dictionarySize)) {
607*01826a49SYabin Cui DISPLAYLEVEL(2, "Constructed dictionary of size %u\n",
608*01826a49SYabin Cui (unsigned)dictionarySize);
609*01826a49SYabin Cui }
610*01826a49SYabin Cui FASTCOVER_ctx_destroy(&ctx);
611*01826a49SYabin Cui free(segmentFreqs);
612*01826a49SYabin Cui return dictionarySize;
613*01826a49SYabin Cui }
614*01826a49SYabin Cui }
615*01826a49SYabin Cui
616*01826a49SYabin Cui
617*01826a49SYabin Cui ZDICTLIB_STATIC_API size_t
ZDICT_optimizeTrainFromBuffer_fastCover(void * dictBuffer,size_t dictBufferCapacity,const void * samplesBuffer,const size_t * samplesSizes,unsigned nbSamples,ZDICT_fastCover_params_t * parameters)618*01826a49SYabin Cui ZDICT_optimizeTrainFromBuffer_fastCover(
619*01826a49SYabin Cui void* dictBuffer, size_t dictBufferCapacity,
620*01826a49SYabin Cui const void* samplesBuffer,
621*01826a49SYabin Cui const size_t* samplesSizes, unsigned nbSamples,
622*01826a49SYabin Cui ZDICT_fastCover_params_t* parameters)
623*01826a49SYabin Cui {
624*01826a49SYabin Cui ZDICT_cover_params_t coverParams;
625*01826a49SYabin Cui FASTCOVER_accel_t accelParams;
626*01826a49SYabin Cui /* constants */
627*01826a49SYabin Cui const unsigned nbThreads = parameters->nbThreads;
628*01826a49SYabin Cui const double splitPoint =
629*01826a49SYabin Cui parameters->splitPoint <= 0.0 ? FASTCOVER_DEFAULT_SPLITPOINT : parameters->splitPoint;
630*01826a49SYabin Cui const unsigned kMinD = parameters->d == 0 ? 6 : parameters->d;
631*01826a49SYabin Cui const unsigned kMaxD = parameters->d == 0 ? 8 : parameters->d;
632*01826a49SYabin Cui const unsigned kMinK = parameters->k == 0 ? 50 : parameters->k;
633*01826a49SYabin Cui const unsigned kMaxK = parameters->k == 0 ? 2000 : parameters->k;
634*01826a49SYabin Cui const unsigned kSteps = parameters->steps == 0 ? 40 : parameters->steps;
635*01826a49SYabin Cui const unsigned kStepSize = MAX((kMaxK - kMinK) / kSteps, 1);
636*01826a49SYabin Cui const unsigned kIterations =
637*01826a49SYabin Cui (1 + (kMaxD - kMinD) / 2) * (1 + (kMaxK - kMinK) / kStepSize);
638*01826a49SYabin Cui const unsigned f = parameters->f == 0 ? DEFAULT_F : parameters->f;
639*01826a49SYabin Cui const unsigned accel = parameters->accel == 0 ? DEFAULT_ACCEL : parameters->accel;
640*01826a49SYabin Cui const unsigned shrinkDict = 0;
641*01826a49SYabin Cui /* Local variables */
642*01826a49SYabin Cui const int displayLevel = (int)parameters->zParams.notificationLevel;
643*01826a49SYabin Cui unsigned iteration = 1;
644*01826a49SYabin Cui unsigned d;
645*01826a49SYabin Cui unsigned k;
646*01826a49SYabin Cui COVER_best_t best;
647*01826a49SYabin Cui POOL_ctx *pool = NULL;
648*01826a49SYabin Cui int warned = 0;
649*01826a49SYabin Cui /* Checks */
650*01826a49SYabin Cui if (splitPoint <= 0 || splitPoint > 1) {
651*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "Incorrect splitPoint\n");
652*01826a49SYabin Cui return ERROR(parameter_outOfBound);
653*01826a49SYabin Cui }
654*01826a49SYabin Cui if (accel == 0 || accel > FASTCOVER_MAX_ACCEL) {
655*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "Incorrect accel\n");
656*01826a49SYabin Cui return ERROR(parameter_outOfBound);
657*01826a49SYabin Cui }
658*01826a49SYabin Cui if (kMinK < kMaxD || kMaxK < kMinK) {
659*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "Incorrect k\n");
660*01826a49SYabin Cui return ERROR(parameter_outOfBound);
661*01826a49SYabin Cui }
662*01826a49SYabin Cui if (nbSamples == 0) {
663*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "FASTCOVER must have at least one input file\n");
664*01826a49SYabin Cui return ERROR(srcSize_wrong);
665*01826a49SYabin Cui }
666*01826a49SYabin Cui if (dictBufferCapacity < ZDICT_DICTSIZE_MIN) {
667*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "dictBufferCapacity must be at least %u\n",
668*01826a49SYabin Cui ZDICT_DICTSIZE_MIN);
669*01826a49SYabin Cui return ERROR(dstSize_tooSmall);
670*01826a49SYabin Cui }
671*01826a49SYabin Cui if (nbThreads > 1) {
672*01826a49SYabin Cui pool = POOL_create(nbThreads, 1);
673*01826a49SYabin Cui if (!pool) {
674*01826a49SYabin Cui return ERROR(memory_allocation);
675*01826a49SYabin Cui }
676*01826a49SYabin Cui }
677*01826a49SYabin Cui /* Initialization */
678*01826a49SYabin Cui COVER_best_init(&best);
679*01826a49SYabin Cui memset(&coverParams, 0 , sizeof(coverParams));
680*01826a49SYabin Cui FASTCOVER_convertToCoverParams(*parameters, &coverParams);
681*01826a49SYabin Cui accelParams = FASTCOVER_defaultAccelParameters[accel];
682*01826a49SYabin Cui /* Turn down global display level to clean up display at level 2 and below */
683*01826a49SYabin Cui g_displayLevel = displayLevel == 0 ? 0 : displayLevel - 1;
684*01826a49SYabin Cui /* Loop through d first because each new value needs a new context */
685*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 2, "Trying %u different sets of parameters\n",
686*01826a49SYabin Cui kIterations);
687*01826a49SYabin Cui for (d = kMinD; d <= kMaxD; d += 2) {
688*01826a49SYabin Cui /* Initialize the context for this value of d */
689*01826a49SYabin Cui FASTCOVER_ctx_t ctx;
690*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 3, "d=%u\n", d);
691*01826a49SYabin Cui {
692*01826a49SYabin Cui size_t const initVal = FASTCOVER_ctx_init(&ctx, samplesBuffer, samplesSizes, nbSamples, d, splitPoint, f, accelParams);
693*01826a49SYabin Cui if (ZSTD_isError(initVal)) {
694*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "Failed to initialize context\n");
695*01826a49SYabin Cui COVER_best_destroy(&best);
696*01826a49SYabin Cui POOL_free(pool);
697*01826a49SYabin Cui return initVal;
698*01826a49SYabin Cui }
699*01826a49SYabin Cui }
700*01826a49SYabin Cui if (!warned) {
701*01826a49SYabin Cui COVER_warnOnSmallCorpus(dictBufferCapacity, ctx.nbDmers, displayLevel);
702*01826a49SYabin Cui warned = 1;
703*01826a49SYabin Cui }
704*01826a49SYabin Cui /* Loop through k reusing the same context */
705*01826a49SYabin Cui for (k = kMinK; k <= kMaxK; k += kStepSize) {
706*01826a49SYabin Cui /* Prepare the arguments */
707*01826a49SYabin Cui FASTCOVER_tryParameters_data_t *data = (FASTCOVER_tryParameters_data_t *)malloc(
708*01826a49SYabin Cui sizeof(FASTCOVER_tryParameters_data_t));
709*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 3, "k=%u\n", k);
710*01826a49SYabin Cui if (!data) {
711*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 1, "Failed to allocate parameters\n");
712*01826a49SYabin Cui COVER_best_destroy(&best);
713*01826a49SYabin Cui FASTCOVER_ctx_destroy(&ctx);
714*01826a49SYabin Cui POOL_free(pool);
715*01826a49SYabin Cui return ERROR(memory_allocation);
716*01826a49SYabin Cui }
717*01826a49SYabin Cui data->ctx = &ctx;
718*01826a49SYabin Cui data->best = &best;
719*01826a49SYabin Cui data->dictBufferCapacity = dictBufferCapacity;
720*01826a49SYabin Cui data->parameters = coverParams;
721*01826a49SYabin Cui data->parameters.k = k;
722*01826a49SYabin Cui data->parameters.d = d;
723*01826a49SYabin Cui data->parameters.splitPoint = splitPoint;
724*01826a49SYabin Cui data->parameters.steps = kSteps;
725*01826a49SYabin Cui data->parameters.shrinkDict = shrinkDict;
726*01826a49SYabin Cui data->parameters.zParams.notificationLevel = (unsigned)g_displayLevel;
727*01826a49SYabin Cui /* Check the parameters */
728*01826a49SYabin Cui if (!FASTCOVER_checkParameters(data->parameters, dictBufferCapacity,
729*01826a49SYabin Cui data->ctx->f, accel)) {
730*01826a49SYabin Cui DISPLAYLEVEL(1, "FASTCOVER parameters incorrect\n");
731*01826a49SYabin Cui free(data);
732*01826a49SYabin Cui continue;
733*01826a49SYabin Cui }
734*01826a49SYabin Cui /* Call the function and pass ownership of data to it */
735*01826a49SYabin Cui COVER_best_start(&best);
736*01826a49SYabin Cui if (pool) {
737*01826a49SYabin Cui POOL_add(pool, &FASTCOVER_tryParameters, data);
738*01826a49SYabin Cui } else {
739*01826a49SYabin Cui FASTCOVER_tryParameters(data);
740*01826a49SYabin Cui }
741*01826a49SYabin Cui /* Print status */
742*01826a49SYabin Cui LOCALDISPLAYUPDATE(displayLevel, 2, "\r%u%% ",
743*01826a49SYabin Cui (unsigned)((iteration * 100) / kIterations));
744*01826a49SYabin Cui ++iteration;
745*01826a49SYabin Cui }
746*01826a49SYabin Cui COVER_best_wait(&best);
747*01826a49SYabin Cui FASTCOVER_ctx_destroy(&ctx);
748*01826a49SYabin Cui }
749*01826a49SYabin Cui LOCALDISPLAYLEVEL(displayLevel, 2, "\r%79s\r", "");
750*01826a49SYabin Cui /* Fill the output buffer and parameters with output of the best parameters */
751*01826a49SYabin Cui {
752*01826a49SYabin Cui const size_t dictSize = best.dictSize;
753*01826a49SYabin Cui if (ZSTD_isError(best.compressedSize)) {
754*01826a49SYabin Cui const size_t compressedSize = best.compressedSize;
755*01826a49SYabin Cui COVER_best_destroy(&best);
756*01826a49SYabin Cui POOL_free(pool);
757*01826a49SYabin Cui return compressedSize;
758*01826a49SYabin Cui }
759*01826a49SYabin Cui FASTCOVER_convertToFastCoverParams(best.parameters, parameters, f, accel);
760*01826a49SYabin Cui memcpy(dictBuffer, best.dict, dictSize);
761*01826a49SYabin Cui COVER_best_destroy(&best);
762*01826a49SYabin Cui POOL_free(pool);
763*01826a49SYabin Cui return dictSize;
764*01826a49SYabin Cui }
765*01826a49SYabin Cui
766*01826a49SYabin Cui }
767