/src/zstd/lib/compress/hist.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* ****************************************************************** |
2 | | * hist : Histogram functions |
3 | | * part of Finite State Entropy project |
4 | | * Copyright (c) Meta Platforms, Inc. and affiliates. |
5 | | * |
6 | | * You can contact the author at : |
7 | | * - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy |
8 | | * - Public forum : https://groups.google.com/forum/#!forum/lz4c |
9 | | * |
10 | | * This source code is licensed under both the BSD-style license (found in the |
11 | | * LICENSE file in the root directory of this source tree) and the GPLv2 (found |
12 | | * in the COPYING file in the root directory of this source tree). |
13 | | * You may select, at your option, one of the above-listed licenses. |
14 | | ****************************************************************** */ |
15 | | |
16 | | /* --- dependencies --- */ |
17 | | #include "../common/mem.h" /* U32, BYTE, etc. */ |
18 | | #include "../common/debug.h" /* assert, DEBUGLOG */ |
19 | | #include "../common/error_private.h" /* ERROR */ |
20 | | #include "hist.h" |
21 | | |
22 | | #if defined(ZSTD_ARCH_ARM_SVE2) |
23 | | #define HIST_FAST_THRESHOLD 500 |
24 | | #else |
25 | 2.99M | #define HIST_FAST_THRESHOLD 1500 |
26 | | #endif |
27 | | |
28 | | |
29 | | /* --- Error management --- */ |
30 | 0 | unsigned HIST_isError(size_t code) { return ERR_isError(code); } |
31 | | |
32 | | /*-************************************************************** |
33 | | * Histogram functions |
34 | | ****************************************************************/ |
35 | | void HIST_add(unsigned* count, const void* src, size_t srcSize) |
36 | 5.26k | { |
37 | 5.26k | const BYTE* ip = (const BYTE*)src; |
38 | 5.26k | const BYTE* const end = ip + srcSize; |
39 | | |
40 | 2.69M | while (ip<end) { |
41 | 2.69M | count[*ip++]++; |
42 | 2.69M | } |
43 | 5.26k | } |
44 | | |
45 | | unsigned HIST_count_simple(unsigned* count, unsigned* maxSymbolValuePtr, |
46 | | const void* src, size_t srcSize) |
47 | 3.36M | { |
48 | 3.36M | const BYTE* ip = (const BYTE*)src; |
49 | 3.36M | const BYTE* const end = ip + srcSize; |
50 | 3.36M | unsigned maxSymbolValue = *maxSymbolValuePtr; |
51 | 3.36M | unsigned largestCount=0; |
52 | | |
53 | 3.36M | ZSTD_memset(count, 0, (maxSymbolValue+1) * sizeof(*count)); |
54 | 3.36M | if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; } |
55 | | |
56 | 584M | while (ip<end) { |
57 | 581M | assert(*ip <= maxSymbolValue); |
58 | 581M | count[*ip++]++; |
59 | 581M | } |
60 | | |
61 | 65.9M | while (!count[maxSymbolValue]) maxSymbolValue--; |
62 | 3.36M | *maxSymbolValuePtr = maxSymbolValue; |
63 | | |
64 | 3.36M | { U32 s; |
65 | 161M | for (s=0; s<=maxSymbolValue; s++) |
66 | 158M | if (count[s] > largestCount) largestCount = count[s]; |
67 | 3.36M | } |
68 | | |
69 | 3.36M | return largestCount; |
70 | 3.36M | } |
71 | | |
72 | | typedef enum { trustInput, checkMaxSymbolValue } HIST_checkInput_e; |
73 | | |
74 | | #if defined(ZSTD_ARCH_ARM_SVE2) |
75 | | FORCE_INLINE_TEMPLATE size_t min_size(size_t a, size_t b) { return a < b ? a : b; } |
76 | | |
77 | | static |
78 | | svuint16_t HIST_count_6_sve2(const BYTE* const src, size_t size, U32* const dst, |
79 | | const svuint8_t c0, const svuint8_t c1, |
80 | | const svuint8_t c2, const svuint8_t c3, |
81 | | const svuint8_t c4, const svuint8_t c5, |
82 | | const svuint16_t histmax, size_t maxCount) |
83 | | { |
84 | | const svbool_t vl128 = svptrue_pat_b8(SV_VL16); |
85 | | svuint16_t hh0 = svdup_n_u16(0); |
86 | | svuint16_t hh1 = svdup_n_u16(0); |
87 | | svuint16_t hh2 = svdup_n_u16(0); |
88 | | svuint16_t hh3 = svdup_n_u16(0); |
89 | | svuint16_t hh4 = svdup_n_u16(0); |
90 | | svuint16_t hh5 = svdup_n_u16(0); |
91 | | svuint16_t hh6 = svdup_n_u16(0); |
92 | | svuint16_t hh7 = svdup_n_u16(0); |
93 | | svuint16_t hh8 = svdup_n_u16(0); |
94 | | svuint16_t hh9 = svdup_n_u16(0); |
95 | | svuint16_t hha = svdup_n_u16(0); |
96 | | svuint16_t hhb = svdup_n_u16(0); |
97 | | |
98 | | size_t i = 0; |
99 | | while (i < size) { |
100 | | /* We can only accumulate 15 (15 * 16 <= 255) iterations of histogram |
101 | | * in 8-bit accumulators! */ |
102 | | const size_t size240 = min_size(i + 240, size); |
103 | | |
104 | | svbool_t pred = svwhilelt_b8_u64(i, size); |
105 | | svuint8_t c = svld1rq_u8(pred, src + i); |
106 | | svuint8_t h0 = svhistseg_u8(c0, c); |
107 | | svuint8_t h1 = svhistseg_u8(c1, c); |
108 | | svuint8_t h2 = svhistseg_u8(c2, c); |
109 | | svuint8_t h3 = svhistseg_u8(c3, c); |
110 | | svuint8_t h4 = svhistseg_u8(c4, c); |
111 | | svuint8_t h5 = svhistseg_u8(c5, c); |
112 | | |
113 | | for (i += 16; i < size240; i += 16) { |
114 | | pred = svwhilelt_b8_u64(i, size); |
115 | | c = svld1rq_u8(pred, src + i); |
116 | | h0 = svadd_u8_x(vl128, h0, svhistseg_u8(c0, c)); |
117 | | h1 = svadd_u8_x(vl128, h1, svhistseg_u8(c1, c)); |
118 | | h2 = svadd_u8_x(vl128, h2, svhistseg_u8(c2, c)); |
119 | | h3 = svadd_u8_x(vl128, h3, svhistseg_u8(c3, c)); |
120 | | h4 = svadd_u8_x(vl128, h4, svhistseg_u8(c4, c)); |
121 | | h5 = svadd_u8_x(vl128, h5, svhistseg_u8(c5, c)); |
122 | | } |
123 | | |
124 | | hh0 = svaddwb_u16(hh0, h0); |
125 | | hh1 = svaddwt_u16(hh1, h0); |
126 | | hh2 = svaddwb_u16(hh2, h1); |
127 | | hh3 = svaddwt_u16(hh3, h1); |
128 | | hh4 = svaddwb_u16(hh4, h2); |
129 | | hh5 = svaddwt_u16(hh5, h2); |
130 | | hh6 = svaddwb_u16(hh6, h3); |
131 | | hh7 = svaddwt_u16(hh7, h3); |
132 | | hh8 = svaddwb_u16(hh8, h4); |
133 | | hh9 = svaddwt_u16(hh9, h4); |
134 | | hha = svaddwb_u16(hha, h5); |
135 | | hhb = svaddwt_u16(hhb, h5); |
136 | | } |
137 | | |
138 | | svst1_u32(svwhilelt_b32_u64( 0, maxCount), dst + 0, svshllb_n_u32(hh0, 0)); |
139 | | svst1_u32(svwhilelt_b32_u64( 4, maxCount), dst + 4, svshllt_n_u32(hh0, 0)); |
140 | | svst1_u32(svwhilelt_b32_u64( 8, maxCount), dst + 8, svshllb_n_u32(hh1, 0)); |
141 | | svst1_u32(svwhilelt_b32_u64(12, maxCount), dst + 12, svshllt_n_u32(hh1, 0)); |
142 | | svst1_u32(svwhilelt_b32_u64(16, maxCount), dst + 16, svshllb_n_u32(hh2, 0)); |
143 | | svst1_u32(svwhilelt_b32_u64(20, maxCount), dst + 20, svshllt_n_u32(hh2, 0)); |
144 | | svst1_u32(svwhilelt_b32_u64(24, maxCount), dst + 24, svshllb_n_u32(hh3, 0)); |
145 | | svst1_u32(svwhilelt_b32_u64(28, maxCount), dst + 28, svshllt_n_u32(hh3, 0)); |
146 | | svst1_u32(svwhilelt_b32_u64(32, maxCount), dst + 32, svshllb_n_u32(hh4, 0)); |
147 | | svst1_u32(svwhilelt_b32_u64(36, maxCount), dst + 36, svshllt_n_u32(hh4, 0)); |
148 | | svst1_u32(svwhilelt_b32_u64(40, maxCount), dst + 40, svshllb_n_u32(hh5, 0)); |
149 | | svst1_u32(svwhilelt_b32_u64(44, maxCount), dst + 44, svshllt_n_u32(hh5, 0)); |
150 | | svst1_u32(svwhilelt_b32_u64(48, maxCount), dst + 48, svshllb_n_u32(hh6, 0)); |
151 | | svst1_u32(svwhilelt_b32_u64(52, maxCount), dst + 52, svshllt_n_u32(hh6, 0)); |
152 | | svst1_u32(svwhilelt_b32_u64(56, maxCount), dst + 56, svshllb_n_u32(hh7, 0)); |
153 | | svst1_u32(svwhilelt_b32_u64(60, maxCount), dst + 60, svshllt_n_u32(hh7, 0)); |
154 | | svst1_u32(svwhilelt_b32_u64(64, maxCount), dst + 64, svshllb_n_u32(hh8, 0)); |
155 | | svst1_u32(svwhilelt_b32_u64(68, maxCount), dst + 68, svshllt_n_u32(hh8, 0)); |
156 | | svst1_u32(svwhilelt_b32_u64(72, maxCount), dst + 72, svshllb_n_u32(hh9, 0)); |
157 | | svst1_u32(svwhilelt_b32_u64(76, maxCount), dst + 76, svshllt_n_u32(hh9, 0)); |
158 | | svst1_u32(svwhilelt_b32_u64(80, maxCount), dst + 80, svshllb_n_u32(hha, 0)); |
159 | | svst1_u32(svwhilelt_b32_u64(84, maxCount), dst + 84, svshllt_n_u32(hha, 0)); |
160 | | svst1_u32(svwhilelt_b32_u64(88, maxCount), dst + 88, svshllb_n_u32(hhb, 0)); |
161 | | svst1_u32(svwhilelt_b32_u64(92, maxCount), dst + 92, svshllt_n_u32(hhb, 0)); |
162 | | |
163 | | hh0 = svmax_u16_x(vl128, hh0, hh1); |
164 | | hh2 = svmax_u16_x(vl128, hh2, hh3); |
165 | | hh4 = svmax_u16_x(vl128, hh4, hh5); |
166 | | hh6 = svmax_u16_x(vl128, hh6, hh7); |
167 | | hh8 = svmax_u16_x(vl128, hh8, hh9); |
168 | | hha = svmax_u16_x(vl128, hha, hhb); |
169 | | hh0 = svmax_u16_x(vl128, hh0, hh2); |
170 | | hh4 = svmax_u16_x(vl128, hh4, hh6); |
171 | | hh8 = svmax_u16_x(vl128, hh8, hha); |
172 | | hh0 = svmax_u16_x(vl128, hh0, hh4); |
173 | | hh8 = svmax_u16_x(vl128, hh8, histmax); |
174 | | return svmax_u16_x(vl128, hh0, hh8); |
175 | | } |
176 | | |
177 | | static size_t HIST_count_sve2(unsigned* count, unsigned* maxSymbolValuePtr, |
178 | | const void* source, size_t sourceSize, |
179 | | HIST_checkInput_e check) |
180 | | { |
181 | | const BYTE* ip = (const BYTE*)source; |
182 | | const size_t maxCount = *maxSymbolValuePtr + 1; |
183 | | |
184 | | assert(*maxSymbolValuePtr <= 255); |
185 | | if (!sourceSize) { |
186 | | ZSTD_memset(count, 0, maxCount * sizeof(*count)); |
187 | | *maxSymbolValuePtr = 0; |
188 | | return 0; |
189 | | } |
190 | | |
191 | | { const svbool_t vl128 = svptrue_pat_b8(SV_VL16); |
192 | | const svuint8_t c0 = svreinterpret_u8(svindex_u32(0x0C040800, 0x01010101)); |
193 | | const svuint8_t c1 = svadd_n_u8_x(vl128, c0, 16); |
194 | | const svuint8_t c2 = svadd_n_u8_x(vl128, c0, 32); |
195 | | const svuint8_t c3 = svadd_n_u8_x(vl128, c1, 32); |
196 | | |
197 | | svuint8_t symbolMax = svdup_n_u8(0); |
198 | | svuint16_t hh0 = svdup_n_u16(0); |
199 | | svuint16_t hh1 = svdup_n_u16(0); |
200 | | svuint16_t hh2 = svdup_n_u16(0); |
201 | | svuint16_t hh3 = svdup_n_u16(0); |
202 | | svuint16_t hh4 = svdup_n_u16(0); |
203 | | svuint16_t hh5 = svdup_n_u16(0); |
204 | | svuint16_t hh6 = svdup_n_u16(0); |
205 | | svuint16_t hh7 = svdup_n_u16(0); |
206 | | svuint16_t max; |
207 | | size_t maxSymbolValue; |
208 | | |
209 | | size_t i = 0; |
210 | | while (i < sourceSize) { |
211 | | /* We can only accumulate 15 (15 * 16 <= 255) iterations of |
212 | | * histogram in 8-bit accumulators! */ |
213 | | const size_t size240 = min_size(i + 240, sourceSize); |
214 | | |
215 | | svbool_t pred = svwhilelt_b8_u64(i, sourceSize); |
216 | | svuint8_t c = svld1rq_u8(pred, ip + i); |
217 | | svuint8_t h0 = svhistseg_u8(c0, c); |
218 | | svuint8_t h1 = svhistseg_u8(c1, c); |
219 | | svuint8_t h2 = svhistseg_u8(c2, c); |
220 | | svuint8_t h3 = svhistseg_u8(c3, c); |
221 | | symbolMax = svmax_u8_x(vl128, symbolMax, c); |
222 | | |
223 | | for (i += 16; i < size240; i += 16) { |
224 | | pred = svwhilelt_b8_u64(i, sourceSize); |
225 | | c = svld1rq_u8(pred, ip + i); |
226 | | h0 = svadd_u8_x(vl128, h0, svhistseg_u8(c0, c)); |
227 | | h1 = svadd_u8_x(vl128, h1, svhistseg_u8(c1, c)); |
228 | | h2 = svadd_u8_x(vl128, h2, svhistseg_u8(c2, c)); |
229 | | h3 = svadd_u8_x(vl128, h3, svhistseg_u8(c3, c)); |
230 | | symbolMax = svmax_u8_x(vl128, symbolMax, c); |
231 | | } |
232 | | |
233 | | hh0 = svaddwb_u16(hh0, h0); |
234 | | hh1 = svaddwt_u16(hh1, h0); |
235 | | hh2 = svaddwb_u16(hh2, h1); |
236 | | hh3 = svaddwt_u16(hh3, h1); |
237 | | hh4 = svaddwb_u16(hh4, h2); |
238 | | hh5 = svaddwt_u16(hh5, h2); |
239 | | hh6 = svaddwb_u16(hh6, h3); |
240 | | hh7 = svaddwt_u16(hh7, h3); |
241 | | } |
242 | | maxSymbolValue = svmaxv_u8(vl128, symbolMax); |
243 | | |
244 | | if (check && maxSymbolValue > *maxSymbolValuePtr) return ERROR(maxSymbolValue_tooSmall); |
245 | | *maxSymbolValuePtr = maxSymbolValue; |
246 | | |
247 | | /* If the buffer size is not divisible by 16, the last elements of the final |
248 | | * vector register read will be zeros, and these elements must be subtracted |
249 | | * from the histogram. |
250 | | */ |
251 | | hh0 = svsub_n_u16_m(svptrue_pat_b32(SV_VL1), hh0, -sourceSize & 15); |
252 | | |
253 | | svst1_u32(svwhilelt_b32_u64( 0, maxCount), count + 0, svshllb_n_u32(hh0, 0)); |
254 | | svst1_u32(svwhilelt_b32_u64( 4, maxCount), count + 4, svshllt_n_u32(hh0, 0)); |
255 | | svst1_u32(svwhilelt_b32_u64( 8, maxCount), count + 8, svshllb_n_u32(hh1, 0)); |
256 | | svst1_u32(svwhilelt_b32_u64(12, maxCount), count + 12, svshllt_n_u32(hh1, 0)); |
257 | | svst1_u32(svwhilelt_b32_u64(16, maxCount), count + 16, svshllb_n_u32(hh2, 0)); |
258 | | svst1_u32(svwhilelt_b32_u64(20, maxCount), count + 20, svshllt_n_u32(hh2, 0)); |
259 | | svst1_u32(svwhilelt_b32_u64(24, maxCount), count + 24, svshllb_n_u32(hh3, 0)); |
260 | | svst1_u32(svwhilelt_b32_u64(28, maxCount), count + 28, svshllt_n_u32(hh3, 0)); |
261 | | svst1_u32(svwhilelt_b32_u64(32, maxCount), count + 32, svshllb_n_u32(hh4, 0)); |
262 | | svst1_u32(svwhilelt_b32_u64(36, maxCount), count + 36, svshllt_n_u32(hh4, 0)); |
263 | | svst1_u32(svwhilelt_b32_u64(40, maxCount), count + 40, svshllb_n_u32(hh5, 0)); |
264 | | svst1_u32(svwhilelt_b32_u64(44, maxCount), count + 44, svshllt_n_u32(hh5, 0)); |
265 | | svst1_u32(svwhilelt_b32_u64(48, maxCount), count + 48, svshllb_n_u32(hh6, 0)); |
266 | | svst1_u32(svwhilelt_b32_u64(52, maxCount), count + 52, svshllt_n_u32(hh6, 0)); |
267 | | svst1_u32(svwhilelt_b32_u64(56, maxCount), count + 56, svshllb_n_u32(hh7, 0)); |
268 | | svst1_u32(svwhilelt_b32_u64(60, maxCount), count + 60, svshllt_n_u32(hh7, 0)); |
269 | | |
270 | | hh0 = svmax_u16_x(vl128, hh0, hh1); |
271 | | hh2 = svmax_u16_x(vl128, hh2, hh3); |
272 | | hh4 = svmax_u16_x(vl128, hh4, hh5); |
273 | | hh6 = svmax_u16_x(vl128, hh6, hh7); |
274 | | hh0 = svmax_u16_x(vl128, hh0, hh2); |
275 | | hh4 = svmax_u16_x(vl128, hh4, hh6); |
276 | | max = svmax_u16_x(vl128, hh0, hh4); |
277 | | |
278 | | maxSymbolValue = min_size(maxSymbolValue, maxCount); |
279 | | if (maxSymbolValue >= 64) { |
280 | | const svuint8_t c4 = svadd_n_u8_x(vl128, c0, 64); |
281 | | const svuint8_t c5 = svadd_n_u8_x(vl128, c1, 64); |
282 | | const svuint8_t c6 = svadd_n_u8_x(vl128, c2, 64); |
283 | | const svuint8_t c7 = svadd_n_u8_x(vl128, c3, 64); |
284 | | const svuint8_t c8 = svadd_n_u8_x(vl128, c0, 128); |
285 | | const svuint8_t c9 = svadd_n_u8_x(vl128, c1, 128); |
286 | | |
287 | | max = HIST_count_6_sve2(ip, sourceSize, count + 64, c4, c5, c6, c7, |
288 | | c8, c9, max, maxCount - 64); |
289 | | |
290 | | if (maxSymbolValue >= 160) { |
291 | | const svuint8_t ca = svadd_n_u8_x(vl128, c2, 128); |
292 | | const svuint8_t cb = svadd_n_u8_x(vl128, c3, 128); |
293 | | const svuint8_t cc = svadd_n_u8_x(vl128, c4, 128); |
294 | | const svuint8_t cd = svadd_n_u8_x(vl128, c5, 128); |
295 | | const svuint8_t ce = svadd_n_u8_x(vl128, c6, 128); |
296 | | const svuint8_t cf = svadd_n_u8_x(vl128, c7, 128); |
297 | | |
298 | | max = HIST_count_6_sve2(ip, sourceSize, count + 160, ca, cb, cc, |
299 | | cd, ce, cf, max, maxCount - 160); |
300 | | } else if (maxCount > 160) { |
301 | | ZSTD_memset(count + 160, 0, (maxCount - 160) * sizeof(*count)); |
302 | | } |
303 | | } else if (maxCount > 64) { |
304 | | ZSTD_memset(count + 64, 0, (maxCount - 64) * sizeof(*count)); |
305 | | } |
306 | | |
307 | | return svmaxv_u16(vl128, max); |
308 | | } |
309 | | } |
310 | | #endif |
311 | | |
312 | | /* HIST_count_parallel_wksp() : |
313 | | * store histogram into 4 intermediate tables, recombined at the end. |
314 | | * this design makes better use of OoO cpus, |
315 | | * and is noticeably faster when some values are heavily repeated. |
316 | | * But it needs some additional workspace for intermediate tables. |
317 | | * `workSpace` must be a U32 table of size >= HIST_WKSP_SIZE_U32. |
318 | | * @return : largest histogram frequency, |
319 | | * or an error code (notably when histogram's alphabet is larger than *maxSymbolValuePtr) */ |
320 | | static UNUSED_ATTR |
321 | | size_t HIST_count_parallel_wksp(unsigned* count, unsigned* maxSymbolValuePtr, |
322 | | const void* source, size_t sourceSize, |
323 | | HIST_checkInput_e check, |
324 | | U32* const workSpace) |
325 | 80.7k | { |
326 | 80.7k | const BYTE* ip = (const BYTE*)source; |
327 | 80.7k | const BYTE* const iend = ip+sourceSize; |
328 | 80.7k | size_t const countSize = (*maxSymbolValuePtr + 1) * sizeof(*count); |
329 | 80.7k | unsigned max=0; |
330 | 80.7k | U32* const Counting1 = workSpace; |
331 | 80.7k | U32* const Counting2 = Counting1 + 256; |
332 | 80.7k | U32* const Counting3 = Counting2 + 256; |
333 | 80.7k | U32* const Counting4 = Counting3 + 256; |
334 | | |
335 | | /* safety checks */ |
336 | 80.7k | assert(*maxSymbolValuePtr <= 255); |
337 | 80.7k | if (!sourceSize) { |
338 | 0 | ZSTD_memset(count, 0, countSize); |
339 | 0 | *maxSymbolValuePtr = 0; |
340 | 0 | return 0; |
341 | 0 | } |
342 | 80.7k | ZSTD_memset(workSpace, 0, 4*256*sizeof(unsigned)); |
343 | | |
344 | | /* by stripes of 16 bytes */ |
345 | 80.7k | { U32 cached = MEM_read32(ip); ip += 4; |
346 | 37.2M | while (ip < iend-15) { |
347 | 37.1M | U32 c = cached; cached = MEM_read32(ip); ip += 4; |
348 | 37.1M | Counting1[(BYTE) c ]++; |
349 | 37.1M | Counting2[(BYTE)(c>>8) ]++; |
350 | 37.1M | Counting3[(BYTE)(c>>16)]++; |
351 | 37.1M | Counting4[ c>>24 ]++; |
352 | 37.1M | c = cached; cached = MEM_read32(ip); ip += 4; |
353 | 37.1M | Counting1[(BYTE) c ]++; |
354 | 37.1M | Counting2[(BYTE)(c>>8) ]++; |
355 | 37.1M | Counting3[(BYTE)(c>>16)]++; |
356 | 37.1M | Counting4[ c>>24 ]++; |
357 | 37.1M | c = cached; cached = MEM_read32(ip); ip += 4; |
358 | 37.1M | Counting1[(BYTE) c ]++; |
359 | 37.1M | Counting2[(BYTE)(c>>8) ]++; |
360 | 37.1M | Counting3[(BYTE)(c>>16)]++; |
361 | 37.1M | Counting4[ c>>24 ]++; |
362 | 37.1M | c = cached; cached = MEM_read32(ip); ip += 4; |
363 | 37.1M | Counting1[(BYTE) c ]++; |
364 | 37.1M | Counting2[(BYTE)(c>>8) ]++; |
365 | 37.1M | Counting3[(BYTE)(c>>16)]++; |
366 | 37.1M | Counting4[ c>>24 ]++; |
367 | 37.1M | } |
368 | 80.7k | ip-=4; |
369 | 80.7k | } |
370 | | |
371 | | /* finish last symbols */ |
372 | 1.02M | while (ip<iend) Counting1[*ip++]++; |
373 | | |
374 | 80.7k | { U32 s; |
375 | 20.7M | for (s=0; s<256; s++) { |
376 | 20.6M | Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s]; |
377 | 20.6M | if (Counting1[s] > max) max = Counting1[s]; |
378 | 20.6M | } } |
379 | | |
380 | 80.7k | { unsigned maxSymbolValue = 255; |
381 | 7.15M | while (!Counting1[maxSymbolValue]) maxSymbolValue--; |
382 | 80.7k | if (check && maxSymbolValue > *maxSymbolValuePtr) return ERROR(maxSymbolValue_tooSmall); |
383 | 80.7k | *maxSymbolValuePtr = maxSymbolValue; |
384 | 80.7k | ZSTD_memmove(count, Counting1, countSize); /* in case count & Counting1 are overlapping */ |
385 | 80.7k | } |
386 | 0 | return (size_t)max; |
387 | 80.7k | } |
388 | | |
389 | | /* HIST_countFast_wksp() : |
390 | | * Same as HIST_countFast(), but using an externally provided scratch buffer. |
391 | | * `workSpace` is a writable buffer which must be 4-bytes aligned, |
392 | | * `workSpaceSize` must be >= HIST_WKSP_SIZE |
393 | | */ |
394 | | size_t HIST_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr, |
395 | | const void* source, size_t sourceSize, |
396 | | void* workSpace, size_t workSpaceSize) |
397 | 2.99M | { |
398 | 2.99M | if (sourceSize < HIST_FAST_THRESHOLD) /* heuristic threshold */ |
399 | 2.91M | return HIST_count_simple(count, maxSymbolValuePtr, source, sourceSize); |
400 | | #if defined(ZSTD_ARCH_ARM_SVE2) |
401 | | (void)workSpace; |
402 | | (void)workSpaceSize; |
403 | | return HIST_count_sve2(count, maxSymbolValuePtr, source, sourceSize, trustInput); |
404 | | #else |
405 | 80.7k | if ((size_t)workSpace & 3) return ERROR(GENERIC); /* must be aligned on 4-bytes boundaries */ |
406 | 80.7k | if (workSpaceSize < HIST_WKSP_SIZE) return ERROR(workSpace_tooSmall); |
407 | 80.7k | return HIST_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, trustInput, (U32*)workSpace); |
408 | 80.7k | #endif |
409 | 80.7k | } |
410 | | |
411 | | /* HIST_count_wksp() : |
412 | | * Same as HIST_count(), but using an externally provided scratch buffer. |
413 | | * `workSpace` size must be table of >= HIST_WKSP_SIZE_U32 unsigned */ |
414 | | size_t HIST_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr, |
415 | | const void* source, size_t sourceSize, |
416 | | void* workSpace, size_t workSpaceSize) |
417 | 492k | { |
418 | | #if defined(ZSTD_ARCH_ARM_SVE2) |
419 | | if (*maxSymbolValuePtr < 255) |
420 | | return HIST_count_sve2(count, maxSymbolValuePtr, source, sourceSize, checkMaxSymbolValue); |
421 | | #else |
422 | 492k | if ((size_t)workSpace & 3) return ERROR(GENERIC); /* must be aligned on 4-bytes boundaries */ |
423 | 492k | if (workSpaceSize < HIST_WKSP_SIZE) return ERROR(workSpace_tooSmall); |
424 | 492k | if (*maxSymbolValuePtr < 255) |
425 | 0 | return HIST_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, checkMaxSymbolValue, (U32*)workSpace); |
426 | 492k | #endif |
427 | 492k | *maxSymbolValuePtr = 255; |
428 | 492k | return HIST_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace, workSpaceSize); |
429 | 492k | } |
430 | | |
431 | | #ifndef ZSTD_NO_UNUSED_FUNCTIONS |
432 | | /* fast variant (unsafe : won't check if src contains values beyond count[] limit) */ |
433 | | size_t HIST_countFast(unsigned* count, unsigned* maxSymbolValuePtr, |
434 | | const void* source, size_t sourceSize) |
435 | 0 | { |
436 | 0 | unsigned tmpCounters[HIST_WKSP_SIZE_U32]; |
437 | 0 | return HIST_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters, sizeof(tmpCounters)); |
438 | 0 | } |
439 | | |
440 | | size_t HIST_count(unsigned* count, unsigned* maxSymbolValuePtr, |
441 | | const void* src, size_t srcSize) |
442 | 0 | { |
443 | 0 | unsigned tmpCounters[HIST_WKSP_SIZE_U32]; |
444 | 0 | return HIST_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters, sizeof(tmpCounters)); |
445 | 0 | } |
446 | | #endif |