/src/brunsli/c/common/predict.cc
Line | Count | Source |
1 | | // Copyright (c) Google LLC 2019 |
2 | | // |
3 | | // Use of this source code is governed by an MIT-style |
4 | | // license that can be found in the LICENSE file or at |
5 | | // https://opensource.org/licenses/MIT. |
6 | | |
7 | | #include "./predict.h" |
8 | | |
9 | | #include <brunsli/jpeg_data.h> |
10 | | |
11 | | namespace brunsli { |
12 | | |
13 | | namespace { |
14 | | |
15 | 20.8M | int AdaptiveMedian(int w, int n, int nw) { |
16 | 20.8M | const int mx = (w > n) ? w : n; |
17 | 20.8M | const int mn = w + n - mx; |
18 | 20.8M | if (nw > mx) { |
19 | 5.85k | return mn; |
20 | 20.8M | } else if (nw < mn) { |
21 | 7.60k | return mx; |
22 | 20.8M | } else { |
23 | 20.8M | return n + w - nw; |
24 | 20.8M | } |
25 | 20.8M | } |
26 | | |
27 | | } // namespace |
28 | | |
29 | 22.1M | int PredictWithAdaptiveMedian(const coeff_t* coeffs, int x, int y, int stride) { |
30 | 22.1M | const int offset1 = -kDCTBlockSize; |
31 | 22.1M | const int offset2 = -stride; |
32 | 22.1M | const int offset3 = offset2 + offset1; |
33 | 22.1M | if (y != 0) { |
34 | 21.2M | if (x != 0) { |
35 | 20.8M | return AdaptiveMedian(coeffs[offset1], coeffs[offset2], coeffs[offset3]); |
36 | 20.8M | } else { |
37 | 467k | return coeffs[offset2]; |
38 | 467k | } |
39 | 21.2M | } else { |
40 | 830k | return x ? coeffs[offset1] : 0; |
41 | 830k | } |
42 | 22.1M | } |
43 | | |
44 | | } // namespace brunsli |