Coverage Report

Created: 2026-02-14 07:11

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/libjxl/lib/jxl/epf.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
// Edge-preserving smoothing: weighted average based on L1 patch similarity.
7
8
#include "lib/jxl/epf.h"
9
10
#include <algorithm>
11
#include <cstddef>
12
#include <cstdint>
13
#include <cstring>
14
15
#include "lib/jxl/ac_strategy.h"
16
#include "lib/jxl/base/compiler_specific.h"
17
#include "lib/jxl/base/rect.h"
18
#include "lib/jxl/base/status.h"
19
#include "lib/jxl/dec_cache.h"
20
#include "lib/jxl/loop_filter.h"
21
#include "lib/jxl/quantizer.h"
22
23
namespace jxl {
24
25
// Mirror n floats starting at *p and store them before p.
26
264k
JXL_INLINE void LeftMirror(float* p, size_t n) {
27
528k
  for (size_t i = 0; i < n; i++) {
28
264k
    *(p - 1 - i) = p[i];
29
264k
  }
30
264k
}
31
32
// Mirror n floats starting at *(p - n) and store them at *p.
33
264k
JXL_INLINE void RightMirror(float* p, size_t n) {
34
528k
  for (size_t i = 0; i < n; i++) {
35
264k
    p[i] = *(p - 1 - i);
36
264k
  }
37
264k
}
38
39
Status ComputeSigma(const LoopFilter& lf, const Rect& block_rect,
40
21.5k
                    PassesDecoderState* state) {
41
21.5k
  JXL_ENSURE(lf.epf_iters > 0);
42
21.5k
  const AcStrategyImage& ac_strategy = state->shared->ac_strategy;
43
21.5k
  const float quant_scale = state->shared->quantizer.Scale();
44
45
21.5k
  const size_t sigma_stride = state->sigma.PixelsPerRow();
46
21.5k
  const size_t sharpness_stride = state->shared->epf_sharpness.PixelsPerRow();
47
48
494k
  for (size_t by = 0; by < block_rect.ysize(); ++by) {
49
472k
    float* JXL_RESTRICT sigma_row = block_rect.Row(&state->sigma, by);
50
472k
    const uint8_t* JXL_RESTRICT sharpness_row =
51
472k
        block_rect.ConstRow(state->shared->epf_sharpness, by);
52
472k
    AcStrategyRow acs_row = ac_strategy.ConstRow(block_rect, by);
53
472k
    const int32_t* const JXL_RESTRICT row_quant =
54
472k
        block_rect.ConstRow(state->shared->raw_quant_field, by);
55
56
12.3M
    for (size_t bx = 0; bx < block_rect.xsize(); bx++) {
57
11.9M
      AcStrategy acs = acs_row[bx];
58
11.9M
      size_t llf_x = acs.covered_blocks_x();
59
11.9M
      if (!acs.IsFirstBlock()) continue;
60
      // quant_scale is smaller for low quality.
61
      // quant_scale is roughly 0.08 / butteraugli score.
62
      //
63
      // row_quant is smaller for low quality.
64
      // row_quant is a quantization multiplier of form 1.0 /
65
      // row_quant[bx]
66
      //
67
      // lf.epf_quant_mul is a parameter in the format
68
      // kInvSigmaNum is a constant
69
5.58M
      float sigma_quant =
70
5.58M
          lf.epf_quant_mul / (quant_scale * row_quant[bx] * kInvSigmaNum);
71
12.3M
      for (size_t iy = 0; iy < acs.covered_blocks_y(); iy++) {
72
18.7M
        for (size_t ix = 0; ix < acs.covered_blocks_x(); ix++) {
73
11.9M
          float sigma =
74
11.9M
              sigma_quant *
75
11.9M
              lf.epf_sharp_lut[sharpness_row[bx + ix + iy * sharpness_stride]];
76
          // Avoid infinities.
77
11.9M
          sigma = std::min(-1e-4f, sigma);  // TODO(veluca): remove this.
78
11.9M
          sigma_row[bx + ix + kSigmaPadding +
79
11.9M
                    (iy + kSigmaPadding) * sigma_stride] = 1.0f / sigma;
80
11.9M
        }
81
6.80M
      }
82
      // TODO(veluca): remove this padding.
83
      // Left padding with mirroring.
84
5.58M
      if (bx + block_rect.x0() == 0) {
85
417k
        for (size_t iy = 0; iy < acs.covered_blocks_y(); iy++) {
86
264k
          LeftMirror(
87
264k
              sigma_row + kSigmaPadding + (iy + kSigmaPadding) * sigma_stride,
88
264k
              kSigmaBorder);
89
264k
        }
90
153k
      }
91
      // Right padding with mirroring.
92
5.58M
      if (bx + block_rect.x0() + llf_x ==
93
5.58M
          state->shared->frame_dim.xsize_blocks) {
94
460k
        for (size_t iy = 0; iy < acs.covered_blocks_y(); iy++) {
95
264k
          RightMirror(sigma_row + kSigmaPadding + bx + llf_x +
96
264k
                          (iy + kSigmaPadding) * sigma_stride,
97
264k
                      kSigmaBorder);
98
264k
        }
99
196k
      }
100
      // Offsets for row copying, in blocks.
101
5.58M
      size_t offset_before = bx + block_rect.x0() == 0 ? 1 : bx + kSigmaPadding;
102
5.58M
      size_t offset_after =
103
5.58M
          bx + block_rect.x0() + llf_x == state->shared->frame_dim.xsize_blocks
104
5.58M
              ? kSigmaPadding + llf_x + bx + kSigmaBorder
105
5.58M
              : kSigmaPadding + llf_x + bx;
106
5.58M
      size_t num = offset_after - offset_before;
107
      // Above
108
5.58M
      if (by + block_rect.y0() == 0) {
109
244k
        for (size_t iy = 0; iy < kSigmaBorder; iy++) {
110
122k
          memcpy(
111
122k
              sigma_row + offset_before +
112
122k
                  (kSigmaPadding - 1 - iy) * sigma_stride,
113
122k
              sigma_row + offset_before + (kSigmaPadding + iy) * sigma_stride,
114
122k
              num * sizeof(*sigma_row));
115
122k
        }
116
122k
      }
117
      // Below
118
5.58M
      if (by + block_rect.y0() + acs.covered_blocks_y() ==
119
5.58M
          state->shared->frame_dim.ysize_blocks) {
120
296k
        for (size_t iy = 0; iy < kSigmaBorder; iy++) {
121
148k
          memcpy(
122
148k
              sigma_row + offset_before +
123
148k
                  sigma_stride * (acs.covered_blocks_y() + kSigmaPadding + iy),
124
148k
              sigma_row + offset_before +
125
148k
                  sigma_stride *
126
148k
                      (acs.covered_blocks_y() + kSigmaPadding - 1 - iy),
127
148k
              num * sizeof(*sigma_row));
128
148k
        }
129
148k
      }
130
5.58M
    }
131
472k
  }
132
21.5k
  return true;
133
21.5k
}
134
135
}  // namespace jxl