Coverage Report

Created: 2026-02-14 07:09

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/libjxl/lib/jxl/enc_group.cc
Line
Count
Source
1
// Copyright (c) the JPEG XL Project Authors. All rights reserved.
2
//
3
// Use of this source code is governed by a BSD-style
4
// license that can be found in the LICENSE file.
5
6
#include "lib/jxl/enc_group.h"
7
8
#include <jxl/memory_manager.h>
9
10
#include <algorithm>
11
#include <cmath>
12
#include <cstddef>
13
#include <cstdint>
14
#include <cstdlib>
15
16
#include "lib/jxl/base/common.h"
17
#include "lib/jxl/base/status.h"
18
#include "lib/jxl/chroma_from_luma.h"
19
#include "lib/jxl/coeff_order_fwd.h"
20
#include "lib/jxl/enc_ans.h"
21
#include "lib/jxl/enc_bit_writer.h"
22
#include "lib/jxl/frame_dimensions.h"
23
#include "lib/jxl/memory_manager_internal.h"
24
25
#undef HWY_TARGET_INCLUDE
26
#define HWY_TARGET_INCLUDE "lib/jxl/enc_group.cc"
27
#include <hwy/foreach_target.h>
28
#include <hwy/highway.h>
29
30
#include "lib/jxl/ac_strategy.h"
31
#include "lib/jxl/base/bits.h"
32
#include "lib/jxl/base/compiler_specific.h"
33
#include "lib/jxl/base/rect.h"
34
#include "lib/jxl/common.h"  // kMaxNumPasses
35
#include "lib/jxl/dct_util.h"
36
#include "lib/jxl/dec_transforms-inl.h"
37
#include "lib/jxl/enc_aux_out.h"
38
#include "lib/jxl/enc_cache.h"
39
#include "lib/jxl/enc_params.h"
40
#include "lib/jxl/enc_transforms-inl.h"
41
#include "lib/jxl/image.h"
42
#include "lib/jxl/quantizer-inl.h"
43
#include "lib/jxl/quantizer.h"
44
#include "lib/jxl/simd_util.h"
45
HWY_BEFORE_NAMESPACE();
46
namespace jxl {
47
namespace HWY_NAMESPACE {
48
49
// These templates are not found via ADL.
50
using hwy::HWY_NAMESPACE::Abs;
51
using hwy::HWY_NAMESPACE::Ge;
52
using hwy::HWY_NAMESPACE::IfThenElse;
53
using hwy::HWY_NAMESPACE::IfThenElseZero;
54
using hwy::HWY_NAMESPACE::MaskFromVec;
55
using hwy::HWY_NAMESPACE::Round;
56
57
// NOTE: caller takes care of extracting quant from rect of RawQuantField.
58
void QuantizeBlockAC(const Quantizer& quantizer, const bool error_diffusion,
59
                     size_t c, float qm_multiplier, AcStrategyType quant_kind,
60
                     size_t xsize, size_t ysize, float* thresholds,
61
                     const float* JXL_RESTRICT block_in, const int32_t* quant,
62
0
                     int32_t* JXL_RESTRICT block_out) {
63
0
  const float* JXL_RESTRICT qm = quantizer.InvDequantMatrix(quant_kind, c);
64
0
  float qac = quantizer.Scale() * (*quant);
65
  // Not SIMD-ified for now.
66
0
  if (c != 1 && xsize * ysize >= 4) {
67
0
    for (int i = 0; i < 4; ++i) {
68
0
      thresholds[i] -= 0.00744f * xsize * ysize;
69
0
      if (thresholds[i] < 0.5) {
70
0
        thresholds[i] = 0.5;
71
0
      }
72
0
    }
73
0
  }
74
0
  HWY_CAPPED(float, kBlockDim) df;
75
0
  HWY_CAPPED(int32_t, kBlockDim) di;
76
0
  HWY_CAPPED(uint32_t, kBlockDim) du;
77
0
  const auto quantv = Set(df, qac * qm_multiplier);
78
0
  for (size_t y = 0; y < ysize * kBlockDim; y++) {
79
0
    size_t yfix = static_cast<size_t>(y >= ysize * kBlockDim / 2) * 2;
80
0
    const size_t off = y * kBlockDim * xsize;
81
0
    for (size_t x = 0; x < xsize * kBlockDim; x += Lanes(df)) {
82
0
      auto threshold = Zero(df);
83
0
      if (xsize == 1) {
84
0
        HWY_ALIGN uint32_t kMask[kBlockDim] = {0, 0, 0, 0, ~0u, ~0u, ~0u, ~0u};
85
0
        const auto mask = MaskFromVec(BitCast(df, Load(du, kMask + x)));
86
0
        threshold = IfThenElse(mask, Set(df, thresholds[yfix + 1]),
87
0
                               Set(df, thresholds[yfix]));
88
0
      } else {
89
        // Same for all lanes in the vector.
90
0
        threshold = Set(
91
0
            df,
92
0
            thresholds[yfix + static_cast<size_t>(x >= xsize * kBlockDim / 2)]);
93
0
      }
94
0
      const auto q = Mul(Load(df, qm + off + x), quantv);
95
0
      const auto in = Load(df, block_in + off + x);
96
0
      const auto val = Mul(q, in);
97
0
      const auto nzero_mask = Ge(Abs(val), threshold);
98
0
      const auto v = ConvertTo(di, IfThenElseZero(nzero_mask, Round(val)));
99
0
      Store(v, di, block_out + off + x);
100
0
    }
101
0
  }
102
0
}
103
104
void AdjustQuantBlockAC(const Quantizer& quantizer, size_t c,
105
                        float qm_multiplier, AcStrategyType quant_kind,
106
                        size_t xsize, size_t ysize, float* thresholds,
107
0
                        const float* JXL_RESTRICT block_in, int32_t* quant) {
108
  // No quantization adjusting for these small blocks.
109
  // Quantization adjusting attempts to fix some known issues
110
  // with larger blocks and on the 8x8 dct's emerging 8x8 blockiness
111
  // when there are not many non-zeros.
112
0
  constexpr size_t kPartialBlockKinds =
113
0
      (1 << static_cast<size_t>(AcStrategyType::IDENTITY)) |
114
0
      (1 << static_cast<size_t>(AcStrategyType::DCT2X2)) |
115
0
      (1 << static_cast<size_t>(AcStrategyType::DCT4X4)) |
116
0
      (1 << static_cast<size_t>(AcStrategyType::DCT4X8)) |
117
0
      (1 << static_cast<size_t>(AcStrategyType::DCT8X4)) |
118
0
      (1 << static_cast<size_t>(AcStrategyType::AFV0)) |
119
0
      (1 << static_cast<size_t>(AcStrategyType::AFV1)) |
120
0
      (1 << static_cast<size_t>(AcStrategyType::AFV2)) |
121
0
      (1 << static_cast<size_t>(AcStrategyType::AFV3));
122
0
  if ((1 << static_cast<size_t>(quant_kind)) & kPartialBlockKinds) {
123
0
    return;
124
0
  }
125
126
0
  const float* JXL_RESTRICT qm = quantizer.InvDequantMatrix(quant_kind, c);
127
0
  float qac = quantizer.Scale() * (*quant);
128
0
  if (xsize > 1 || ysize > 1) {
129
0
    for (int i = 0; i < 4; ++i) {
130
0
      thresholds[i] -= Clamp1(0.003f * xsize * ysize, 0.f, 0.08f);
131
0
      if (thresholds[i] < 0.54) {
132
0
        thresholds[i] = 0.54;
133
0
      }
134
0
    }
135
0
  }
136
0
  float sum_of_highest_freq_row_and_column = 0;
137
0
  float sum_of_error = 0;
138
0
  float sum_of_vals = 0;
139
0
  float hfNonZeros[4] = {};
140
0
  float hfMaxError[4] = {};
141
142
0
  for (size_t y = 0; y < ysize * kBlockDim; y++) {
143
0
    for (size_t x = 0; x < xsize * kBlockDim; x++) {
144
0
      const size_t pos = y * kBlockDim * xsize + x;
145
0
      if (x < xsize && y < ysize) {
146
0
        continue;
147
0
      }
148
0
      const size_t hfix = (static_cast<size_t>(y >= ysize * kBlockDim / 2) * 2 +
149
0
                           static_cast<size_t>(x >= xsize * kBlockDim / 2));
150
0
      const float val = block_in[pos] * (qm[pos] * qac * qm_multiplier);
151
0
      const float v = (std::abs(val) < thresholds[hfix]) ? 0 : rintf(val);
152
0
      const float error = std::abs(val - v);
153
0
      sum_of_error += error;
154
0
      sum_of_vals += std::abs(v);
155
0
      if (c == 1 && v == 0) {
156
0
        if (hfMaxError[hfix] < error) {
157
0
          hfMaxError[hfix] = error;
158
0
        }
159
0
      }
160
0
      if (v != 0.0f) {
161
0
        hfNonZeros[hfix] += std::abs(v);
162
0
        bool in_corner = y >= 7 * ysize && x >= 7 * xsize;
163
0
        bool on_border =
164
0
            y == ysize * kBlockDim - 1 || x == xsize * kBlockDim - 1;
165
0
        bool in_larger_corner = x >= 4 * xsize && y >= 4 * ysize;
166
0
        if (in_corner || (on_border && in_larger_corner)) {
167
0
          sum_of_highest_freq_row_and_column += std::abs(val);
168
0
        }
169
0
      }
170
0
    }
171
0
  }
172
0
  if (c == 1 && sum_of_vals * 8 < xsize * ysize) {
173
0
    static const double kLimit[4] = {
174
0
        0.46,
175
0
        0.46,
176
0
        0.46,
177
0
        0.46,
178
0
    };
179
0
    static const double kMul[4] = {
180
0
        0.9999,
181
0
        0.9999,
182
0
        0.9999,
183
0
        0.9999,
184
0
    };
185
0
    const int32_t orig_quant = *quant;
186
0
    int32_t new_quant = *quant;
187
0
    for (int i = 1; i < 4; ++i) {
188
0
      if (hfNonZeros[i] == 0.0 && hfMaxError[i] > kLimit[i]) {
189
0
        new_quant = orig_quant + 1;
190
0
        break;
191
0
      }
192
0
    }
193
0
    *quant = new_quant;
194
0
    if (hfNonZeros[3] == 0.0 && hfMaxError[3] > kLimit[3]) {
195
0
      thresholds[3] = kMul[3] * hfMaxError[3] * new_quant / orig_quant;
196
0
    } else if ((hfNonZeros[1] == 0.0 && hfMaxError[1] > kLimit[1]) ||
197
0
               (hfNonZeros[2] == 0.0 && hfMaxError[2] > kLimit[2])) {
198
0
      thresholds[1] = kMul[1] * std::max(hfMaxError[1], hfMaxError[2]) *
199
0
                      new_quant / orig_quant;
200
0
      thresholds[2] = thresholds[1];
201
0
    } else if (hfNonZeros[0] == 0.0 && hfMaxError[0] > kLimit[0]) {
202
0
      thresholds[0] = kMul[0] * hfMaxError[0] * new_quant / orig_quant;
203
0
    }
204
0
  }
205
  // Heuristic for improving accuracy of high-frequency patterns
206
  // occurring in an environment with no medium-frequency masking
207
  // patterns.
208
0
  {
209
0
    float all =
210
0
        hfNonZeros[0] + hfNonZeros[1] + hfNonZeros[2] + hfNonZeros[3] + 1;
211
0
    float mul[3] = {70, 30, 60};
212
0
    if (mul[c] * sum_of_highest_freq_row_and_column >= all) {
213
0
      *quant += mul[c] * sum_of_highest_freq_row_and_column / all;
214
0
      if (*quant >= Quantizer::kQuantMax) {
215
0
        *quant = Quantizer::kQuantMax - 1;
216
0
      }
217
0
    }
218
0
  }
219
0
  if (quant_kind == AcStrategyType::DCT) {
220
    // If this 8x8 block is too flat, increase the adaptive quantization level
221
    // a bit to reduce visible block boundaries and requantize the block.
222
0
    if (hfNonZeros[0] + hfNonZeros[1] + hfNonZeros[2] + hfNonZeros[3] < 11) {
223
0
      *quant += 1;
224
0
      if (*quant >= Quantizer::kQuantMax) {
225
0
        *quant = Quantizer::kQuantMax - 1;
226
0
      }
227
0
    }
228
0
  }
229
0
  {
230
0
    static const double kMul1[4][3] = {
231
0
        {
232
0
            0.22080615753848404,
233
0
            0.45797479824262011,
234
0
            0.29859235095977965,
235
0
        },
236
0
        {
237
0
            0.70109486510286834,
238
0
            0.16185281305512639,
239
0
            0.14387691730035473,
240
0
        },
241
0
        {
242
0
            0.114985964456218638,
243
0
            0.44656840441027695,
244
0
            0.10587658215149048,
245
0
        },
246
0
        {
247
0
            0.46849665264409396,
248
0
            0.41239077937781954,
249
0
            0.088667407767185444,
250
0
        },
251
0
    };
252
0
    static const double kMul2[4][3] = {
253
0
        {
254
0
            0.27450281941822197,
255
0
            1.1255766549984996,
256
0
            0.98950459134128388,
257
0
        },
258
0
        {
259
0
            0.4652168675598285,
260
0
            0.40945807983455818,
261
0
            0.36581899811751367,
262
0
        },
263
0
        {
264
0
            0.28034972424715715,
265
0
            0.9182653201929738,
266
0
            1.5581531543057416,
267
0
        },
268
0
        {
269
0
            0.26873118114033728,
270
0
            0.68863712390392484,
271
0
            1.2082185408666786,
272
0
        },
273
0
    };
274
0
    static const double kQuantNormalizer = 2.2942708343284721;
275
0
    sum_of_error *= kQuantNormalizer;
276
0
    sum_of_vals *= kQuantNormalizer;
277
0
    if (quant_kind >= AcStrategyType::DCT16X16) {
278
0
      int ix = 3;
279
0
      if (quant_kind == AcStrategyType::DCT32X16 ||
280
0
          quant_kind == AcStrategyType::DCT16X32) {
281
0
        ix = 1;
282
0
      } else if (quant_kind == AcStrategyType::DCT16X16) {
283
0
        ix = 0;
284
0
      } else if (quant_kind == AcStrategyType::DCT32X32) {
285
0
        ix = 2;
286
0
      }
287
0
      int step =
288
0
          sum_of_error / (kMul1[ix][c] * xsize * ysize * kBlockDim * kBlockDim +
289
0
                          kMul2[ix][c] * sum_of_vals);
290
0
      if (step >= 2) {
291
0
        step = 2;
292
0
      }
293
0
      if (step < 0) {
294
0
        step = 0;
295
0
      }
296
0
      if (sum_of_error > kMul1[ix][c] * xsize * ysize * kBlockDim * kBlockDim +
297
0
                             kMul2[ix][c] * sum_of_vals) {
298
0
        *quant += step;
299
0
        if (*quant >= Quantizer::kQuantMax) {
300
0
          *quant = Quantizer::kQuantMax - 1;
301
0
        }
302
0
      }
303
0
    }
304
0
  }
305
0
  {
306
    // Reduce quant in highly active areas.
307
0
    int32_t div = (xsize * ysize);
308
0
    float min_hf_non_zeros =
309
0
        std::min({hfNonZeros[0], hfNonZeros[1], hfNonZeros[2], hfNonZeros[3]});
310
0
    int32_t activity = 15;
311
0
    if (min_hf_non_zeros < 15.0f * div) {
312
0
      activity = (static_cast<int32_t>(min_hf_non_zeros) + div / 2) / div;
313
0
    }
314
0
    int32_t qp = *quant - activity;
315
0
    if (c == 1) {
316
0
      for (int i = 1; i < 4; ++i) {
317
0
        thresholds[i] += 0.01 * activity;
318
0
      }
319
0
    }
320
0
    int32_t orig_qp_limit = std::max(4, *quant / 2);
321
0
    if (qp < orig_qp_limit) {
322
0
      qp = orig_qp_limit;
323
0
    }
324
0
    *quant = qp;
325
0
  }
326
0
}
327
328
// NOTE: caller takes care of extracting quant from rect of RawQuantField.
329
void QuantizeRoundtripYBlockAC(PassesEncoderState* enc_state, const size_t size,
330
                               const Quantizer& quantizer,
331
                               const bool error_diffusion,
332
                               AcStrategyType quant_kind, size_t xsize,
333
                               size_t ysize, const float* JXL_RESTRICT biases,
334
                               int32_t* quant, float* JXL_RESTRICT inout,
335
0
                               int32_t* JXL_RESTRICT quantized) {
336
0
  float thres_y[4] = {0.58f, 0.64f, 0.64f, 0.64f};
337
0
  if (enc_state->cparams.speed_tier <= SpeedTier::kHare) {
338
0
    int32_t max_quant = 0;
339
0
    int quant_orig = *quant;
340
0
    float val[3] = {enc_state->x_qm_multiplier, 1.0f,
341
0
                    enc_state->b_qm_multiplier};
342
0
    for (int c : {1, 0, 2}) {
343
0
      float thres[4] = {0.58f, 0.64f, 0.64f, 0.64f};
344
0
      *quant = quant_orig;
345
0
      AdjustQuantBlockAC(quantizer, c, val[c], quant_kind, xsize, ysize,
346
0
                         &thres[0], inout + c * size, quant);
347
      // Dead zone adjustment
348
0
      if (c == 1) {
349
0
        for (int k = 0; k < 4; ++k) {
350
0
          thres_y[k] = thres[k];
351
0
        }
352
0
      }
353
0
      max_quant = std::max(*quant, max_quant);
354
0
    }
355
0
    *quant = max_quant;
356
0
  } else {
357
0
    thres_y[0] = 0.56;
358
0
    thres_y[1] = 0.62;
359
0
    thres_y[2] = 0.62;
360
0
    thres_y[3] = 0.62;
361
0
  }
362
363
0
  QuantizeBlockAC(quantizer, error_diffusion, 1, 1.0f, quant_kind, xsize, ysize,
364
0
                  &thres_y[0], inout + size, quant, quantized + size);
365
366
0
  const float* JXL_RESTRICT dequant_matrix =
367
0
      quantizer.DequantMatrix(quant_kind, 1);
368
369
0
  HWY_CAPPED(float, kDCTBlockSize) df;
370
0
  HWY_CAPPED(int32_t, kDCTBlockSize) di;
371
0
  const auto inv_qac = Set(df, quantizer.inv_quant_ac(*quant));
372
0
  for (size_t k = 0; k < kDCTBlockSize * xsize * ysize; k += Lanes(df)) {
373
0
    const auto oquant = Load(di, quantized + size + k);
374
0
    const auto adj_quant = AdjustQuantBias(di, 1, oquant, biases);
375
0
    const auto dequantm = Load(df, dequant_matrix + k);
376
0
    Store(Mul(Mul(adj_quant, dequantm), inv_qac), df, inout + size + k);
377
0
  }
378
0
}
379
380
Status ComputeCoefficients(size_t group_idx, PassesEncoderState* enc_state,
381
                           const Image3F& opsin, const Rect& rect,
382
0
                           Image3F* dc) {
383
0
  JxlMemoryManager* memory_manager = opsin.memory_manager();
384
0
  const Rect block_group_rect =
385
0
      enc_state->shared.frame_dim.BlockGroupRect(group_idx);
386
0
  const Rect cmap_rect(
387
0
      block_group_rect.x0() / kColorTileDimInBlocks,
388
0
      block_group_rect.y0() / kColorTileDimInBlocks,
389
0
      DivCeil(block_group_rect.xsize(), kColorTileDimInBlocks),
390
0
      DivCeil(block_group_rect.ysize(), kColorTileDimInBlocks));
391
0
  const Rect group_rect =
392
0
      enc_state->shared.frame_dim.GroupRect(group_idx).Translate(rect.x0(),
393
0
                                                                 rect.y0());
394
395
0
  const size_t xsize_blocks = block_group_rect.xsize();
396
0
  const size_t ysize_blocks = block_group_rect.ysize();
397
398
0
  const size_t dc_stride = static_cast<size_t>(dc->PixelsPerRow());
399
0
  const size_t opsin_stride = static_cast<size_t>(opsin.PixelsPerRow());
400
401
0
  ImageI& full_quant_field = enc_state->shared.raw_quant_field;
402
0
  const CompressParams& cparams = enc_state->cparams;
403
404
0
  const size_t dct_scratch_size =
405
0
      3 * (MaxVectorSize() / sizeof(float)) * AcStrategy::kMaxBlockDim;
406
407
  // TODO(veluca): consider strategies to reduce this memory.
408
0
  size_t mem_bytes = 3 * AcStrategy::kMaxCoeffArea * sizeof(int32_t);
409
0
  JXL_ASSIGN_OR_RETURN(auto mem,
410
0
                       AlignedMemory::Create(memory_manager, mem_bytes));
411
0
  size_t fmem_bytes =
412
0
      (5 * AcStrategy::kMaxCoeffArea + dct_scratch_size) * sizeof(float);
413
0
  JXL_ASSIGN_OR_RETURN(auto fmem,
414
0
                       AlignedMemory::Create(memory_manager, fmem_bytes));
415
0
  float* JXL_RESTRICT scratch_space =
416
0
      fmem.address<float>() + 3 * AcStrategy::kMaxCoeffArea;
417
0
  {
418
    // Only use error diffusion in Squirrel mode or slower.
419
0
    const bool error_diffusion = cparams.speed_tier <= SpeedTier::kSquirrel;
420
0
    constexpr HWY_CAPPED(float, kDCTBlockSize) d;
421
422
0
    int32_t* JXL_RESTRICT coeffs[3][kMaxNumPasses] = {};
423
0
    size_t num_passes = enc_state->progressive_splitter.GetNumPasses();
424
0
    JXL_ENSURE(num_passes > 0);
425
0
    for (size_t i = 0; i < num_passes; i++) {
426
      // TODO(veluca): 16-bit quantized coeffs are not implemented yet.
427
0
      JXL_ENSURE(enc_state->coeffs[i]->Type() == ACType::k32);
428
0
      for (size_t c = 0; c < 3; c++) {
429
0
        coeffs[c][i] = enc_state->coeffs[i]->PlaneRow(c, group_idx, 0).ptr32;
430
0
      }
431
0
    }
432
433
0
    HWY_ALIGN float* coeffs_in = fmem.address<float>();
434
0
    HWY_ALIGN int32_t* quantized = mem.address<int32_t>();
435
436
0
    for (size_t by = 0; by < ysize_blocks; ++by) {
437
0
      int32_t* JXL_RESTRICT row_quant_ac =
438
0
          block_group_rect.Row(&full_quant_field, by);
439
0
      size_t ty = by / kColorTileDimInBlocks;
440
0
      const int8_t* JXL_RESTRICT row_cmap[3] = {
441
0
          cmap_rect.ConstRow(enc_state->shared.cmap.ytox_map, ty),
442
0
          nullptr,
443
0
          cmap_rect.ConstRow(enc_state->shared.cmap.ytob_map, ty),
444
0
      };
445
0
      const float* JXL_RESTRICT opsin_rows[3] = {
446
0
          group_rect.ConstPlaneRow(opsin, 0, by * kBlockDim),
447
0
          group_rect.ConstPlaneRow(opsin, 1, by * kBlockDim),
448
0
          group_rect.ConstPlaneRow(opsin, 2, by * kBlockDim),
449
0
      };
450
0
      float* JXL_RESTRICT dc_rows[3] = {
451
0
          block_group_rect.PlaneRow(dc, 0, by),
452
0
          block_group_rect.PlaneRow(dc, 1, by),
453
0
          block_group_rect.PlaneRow(dc, 2, by),
454
0
      };
455
0
      AcStrategyRow ac_strategy_row =
456
0
          enc_state->shared.ac_strategy.ConstRow(block_group_rect, by);
457
0
      for (size_t tx = 0; tx < DivCeil(xsize_blocks, kColorTileDimInBlocks);
458
0
           tx++) {
459
0
        const auto x_factor =
460
0
            Set(d, enc_state->shared.cmap.base().YtoXRatio(row_cmap[0][tx]));
461
0
        const auto b_factor =
462
0
            Set(d, enc_state->shared.cmap.base().YtoBRatio(row_cmap[2][tx]));
463
0
        for (size_t bx = tx * kColorTileDimInBlocks;
464
0
             bx < xsize_blocks && bx < (tx + 1) * kColorTileDimInBlocks; ++bx) {
465
0
          const AcStrategy acs = ac_strategy_row[bx];
466
0
          if (!acs.IsFirstBlock()) continue;
467
468
0
          size_t xblocks = acs.covered_blocks_x();
469
0
          size_t yblocks = acs.covered_blocks_y();
470
471
0
          CoefficientLayout(&yblocks, &xblocks);
472
473
0
          size_t size = kDCTBlockSize * xblocks * yblocks;
474
475
          // DCT Y channel, roundtrip-quantize it and set DC.
476
0
          int32_t quant_ac = row_quant_ac[bx];
477
0
          for (size_t c : {0, 1, 2}) {
478
0
            TransformFromPixels(acs.Strategy(), opsin_rows[c] + bx * kBlockDim,
479
0
                                opsin_stride, coeffs_in + c * size,
480
0
                                scratch_space);
481
0
          }
482
0
          DCFromLowestFrequencies(acs.Strategy(), coeffs_in + size,
483
0
                                  dc_rows[1] + bx, dc_stride, scratch_space);
484
485
0
          QuantizeRoundtripYBlockAC(
486
0
              enc_state, size, enc_state->shared.quantizer, error_diffusion,
487
0
              acs.Strategy(), xblocks, yblocks, kDefaultQuantBias, &quant_ac,
488
0
              coeffs_in, quantized);
489
490
          // Unapply color correlation
491
0
          for (size_t k = 0; k < size; k += Lanes(d)) {
492
0
            const auto in_x = Load(d, coeffs_in + k);
493
0
            const auto in_y = Load(d, coeffs_in + size + k);
494
0
            const auto in_b = Load(d, coeffs_in + 2 * size + k);
495
0
            const auto out_x = NegMulAdd(x_factor, in_y, in_x);
496
0
            const auto out_b = NegMulAdd(b_factor, in_y, in_b);
497
0
            Store(out_x, d, coeffs_in + k);
498
0
            Store(out_b, d, coeffs_in + 2 * size + k);
499
0
          }
500
501
          // Quantize X and B channels and set DC.
502
0
          for (size_t c : {0, 2}) {
503
0
            float thres[4] = {0.58f, 0.62f, 0.62f, 0.62f};
504
0
            QuantizeBlockAC(enc_state->shared.quantizer, error_diffusion, c,
505
0
                            c == 0 ? enc_state->x_qm_multiplier
506
0
                                   : enc_state->b_qm_multiplier,
507
0
                            acs.Strategy(), xblocks, yblocks, &thres[0],
508
0
                            coeffs_in + c * size, &quant_ac,
509
0
                            quantized + c * size);
510
0
            DCFromLowestFrequencies(acs.Strategy(), coeffs_in + c * size,
511
0
                                    dc_rows[c] + bx, dc_stride, scratch_space);
512
0
          }
513
0
          row_quant_ac[bx] = quant_ac;
514
0
          for (size_t c = 0; c < 3; c++) {
515
0
            enc_state->progressive_splitter.SplitACCoefficients(
516
0
                quantized + c * size, acs, bx, by, coeffs[c]);
517
0
            for (size_t p = 0; p < num_passes; p++) {
518
0
              coeffs[c][p] += size;
519
0
            }
520
0
          }
521
0
        }
522
0
      }
523
0
    }
524
0
  }
525
0
  return true;
526
0
}
527
528
// NOLINTNEXTLINE(google-readability-namespace-comments)
529
}  // namespace HWY_NAMESPACE
530
}  // namespace jxl
531
HWY_AFTER_NAMESPACE();
532
533
#if HWY_ONCE
534
namespace jxl {
535
HWY_EXPORT(ComputeCoefficients);
536
Status ComputeCoefficients(size_t group_idx, PassesEncoderState* enc_state,
537
                           const Image3F& opsin, const Rect& rect,
538
0
                           Image3F* dc) {
539
0
  return HWY_DYNAMIC_DISPATCH(ComputeCoefficients)(group_idx, enc_state, opsin,
540
0
                                                   rect, dc);
541
0
}
542
543
Status EncodeGroupTokenizedCoefficients(size_t group_idx, size_t pass_idx,
544
                                        size_t histogram_idx,
545
                                        const PassesEncoderState& enc_state,
546
0
                                        BitWriter* writer, AuxOut* aux_out) {
547
  // Select which histogram to use among those of the current pass.
548
0
  const size_t num_histograms = enc_state.shared.num_histograms;
549
  // num_histograms is 0 only for lossless.
550
0
  JXL_ENSURE(num_histograms == 0 || histogram_idx < num_histograms);
551
0
  size_t histo_selector_bits = CeilLog2Nonzero(num_histograms);
552
553
0
  if (histo_selector_bits != 0) {
554
0
    JXL_RETURN_IF_ERROR(
555
0
        writer->WithMaxBits(histo_selector_bits, LayerType::Ac, aux_out, [&] {
556
0
          writer->Write(histo_selector_bits, histogram_idx);
557
0
          return true;
558
0
        }));
559
0
  }
560
0
  size_t context_offset =
561
0
      histogram_idx * enc_state.shared.block_ctx_map.NumACContexts();
562
0
  JXL_RETURN_IF_ERROR(
563
0
      WriteTokens(enc_state.passes[pass_idx].ac_tokens[group_idx],
564
0
                  enc_state.passes[pass_idx].codes, context_offset, writer,
565
0
                  LayerType::AcTokens, aux_out));
566
567
0
  return true;
568
0
}
569
570
}  // namespace jxl
571
#endif  // HWY_ONCE