FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/aaccoder_trellis.h
Date: 2026-10-04 22:42:07
Exec Total Coverage
Lines: 98 98 100.0%
Functions: 1 1 100.0%
Branches: 42 42 100.0%
Line Branch Exec Source
1 /*
2 * AAC encoder trellis codebook selector
3 * Copyright (C) 2008-2009 Konstantin Shishkov
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * AAC encoder trellis codebook selector
25 * @author Konstantin Shishkov
26 */
27
28 /**
29 * This file contains a template for the codebook_trellis_rate selector function.
30 * It needs to be provided, externally, as an already included declaration,
31 * the following functions from aacenc_quantization/util.h. They're not included
32 * explicitly here to make it possible to provide alternative implementations:
33 * - quantize_band_cost_bits
34 * - abs_pow34_v
35 */
36
37 #ifndef AVCODEC_AACCODER_TRELLIS_H
38 #define AVCODEC_AACCODER_TRELLIS_H
39
40 #include <float.h>
41 #include "libavutil/mathematics.h"
42 #include "avcodec.h"
43 #include "put_bits.h"
44 #include "aac.h"
45 #include "aacenc.h"
46 #include "aactab.h"
47 #include "aacenctab.h"
48
49 /**
50 * structure used in optimal codebook search
51 */
52 typedef struct TrellisBandCodingPath {
53 int prev_idx; ///< pointer to the previous path point
54 float cost; ///< path cost
55 int run;
56 } TrellisBandCodingPath;
57
58
59 12089 static void codebook_trellis_rate(AACEncContext *s, SingleChannelElement *sce,
60 int win, int group_len, const float lambda)
61 {
62 TrellisBandCodingPath path[120][CB_TOT_ALL];
63 int w, swb, cb, start, size;
64 int i, j;
65 12089 const int max_sfb = sce->ics.max_sfb;
66
2/2
✓ Branch 0 taken 10849 times.
✓ Branch 1 taken 1240 times.
 12089 const int run_bits = sce->ics.num_windows == 1 ? 5 : 3;
67 12089 const int run_esc = (1 << run_bits) - 1;
68 int idx, ppos, count;
69 int stackrun[120], stackcb[120], stack_len;
70 12089 float next_minbits = INFINITY;
71 12089 int next_mincb = 0;
72
73 12089 s->aacdsp.abs_pow34(s->scoefs, sce->coeffs, 1024);
74 12089 start = win*128;
75
2/2
✓ Branch 0 taken 181335 times.
✓ Branch 1 taken 12089 times.
 193424 for (cb = 0; cb < CB_TOT_ALL; cb++) {
76 181335 path[0][cb].cost = run_bits+4;
77 181335 path[0][cb].prev_idx = -1;
78 181335 path[0][cb].run = 0;
79 }
80
2/2
✓ Branch 0 taken 525643 times.
✓ Branch 1 taken 12089 times.
 537732 for (swb = 0; swb < max_sfb; swb++) {
81 525643 size = sce->ics.swb_sizes[swb];
82
2/2
✓ Branch 0 taken 7613 times.
✓ Branch 1 taken 518030 times.
 525643 if (sce->zeroes[win*16 + swb]) {
83 7613 float cost_stay_here = path[swb][0].cost;
84 7613 float cost_get_here = next_minbits + run_bits + 4;
85 7613 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][0].run]
86
2/2
✓ Branch 0 taken 104 times.
✓ Branch 1 taken 7509 times.
 7613 != run_value_bits[sce->ics.num_windows == 8][path[swb][0].run+1])
87 104 cost_stay_here += run_bits;
88
2/2
✓ Branch 0 taken 1075 times.
✓ Branch 1 taken 6538 times.
 7613 if (cost_get_here < cost_stay_here) {
89 1075 path[swb+1][0].prev_idx = next_mincb;
90 1075 path[swb+1][0].cost = cost_get_here;
91 1075 path[swb+1][0].run = 1;
92 } else {
93 6538 path[swb+1][0].prev_idx = 0;
94 6538 path[swb+1][0].cost = cost_stay_here;
95 6538 path[swb+1][0].run = path[swb][0].run + 1;
96 }
97 7613 next_minbits = path[swb+1][0].cost;
98 7613 next_mincb = 0;
99
2/2
✓ Branch 0 taken 106582 times.
✓ Branch 1 taken 7613 times.
 114195 for (cb = 1; cb < CB_TOT_ALL; cb++) {
100 106582 path[swb+1][cb].cost = 61450;
101 106582 path[swb+1][cb].prev_idx = -1;
102 106582 path[swb+1][cb].run = 0;
103 }
104 } else {
105 518030 float minbits = next_minbits;
106 518030 int mincb = next_mincb;
107 518030 int startcb = sce->band_type[win*16+swb];
108 518030 startcb = aac_cb_in_map[startcb];
109 518030 next_minbits = INFINITY;
110 518030 next_mincb = 0;
111
2/2
✓ Branch 0 taken 2539862 times.
✓ Branch 1 taken 518030 times.
 3057892 for (cb = 0; cb < startcb; cb++) {
112 2539862 path[swb+1][cb].cost = 61450;
113 2539862 path[swb+1][cb].prev_idx = -1;
114 2539862 path[swb+1][cb].run = 0;
115 }
116
2/2
✓ Branch 0 taken 5230588 times.
✓ Branch 1 taken 518030 times.
 5748618 for (cb = startcb; cb < CB_TOT_ALL; cb++) {
117 float cost_stay_here, cost_get_here;
118 5230588 float bits = 0.0f;
119
4/4
✓ Branch 0 taken 1510908 times.
✓ Branch 1 taken 3719680 times.
✓ Branch 2 taken 1484706 times.
✓ Branch 3 taken 26202 times.
 5230588 if (cb >= 12 && sce->band_type[win*16+swb] != aac_cb_out_map[cb]) {
120 1484706 path[swb+1][cb].cost = 61450;
121 1484706 path[swb+1][cb].prev_idx = -1;
122 1484706 path[swb+1][cb].run = 0;
123 1484706 continue;
124 }
125
2/2
✓ Branch 0 taken 3980614 times.
✓ Branch 1 taken 3745882 times.
 7726496 for (w = 0; w < group_len; w++) {
126 3980614 bits += quantize_band_cost_bits(s, &sce->coeffs[start + w*128],
127 3980614 &s->scoefs[start + w*128], size,
128 3980614 sce->sf_idx[win*16+swb],
129 3980614 aac_cb_out_map[cb],
130 0, INFINITY, NULL, NULL);
131 }
132 3745882 cost_stay_here = path[swb][cb].cost + bits;
133 3745882 cost_get_here = minbits + bits + run_bits + 4;
134 3745882 if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run]
135
2/2
✓ Branch 0 taken 4387 times.
✓ Branch 1 taken 3741495 times.
 3745882 != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1])
136 4387 cost_stay_here += run_bits;
137
2/2
✓ Branch 0 taken 2338405 times.
✓ Branch 1 taken 1407477 times.
 3745882 if (cost_get_here < cost_stay_here) {
138 2338405 path[swb+1][cb].prev_idx = mincb;
139 2338405 path[swb+1][cb].cost = cost_get_here;
140 2338405 path[swb+1][cb].run = 1;
141 } else {
142 1407477 path[swb+1][cb].prev_idx = cb;
143 1407477 path[swb+1][cb].cost = cost_stay_here;
144 1407477 path[swb+1][cb].run = path[swb][cb].run + 1;
145 }
146
2/2
✓ Branch 0 taken 1071341 times.
✓ Branch 1 taken 2674541 times.
 3745882 if (path[swb+1][cb].cost < next_minbits) {
147 1071341 next_minbits = path[swb+1][cb].cost;
148 1071341 next_mincb = cb;
149 }
150 }
151 }
152 525643 start += sce->ics.swb_sizes[swb];
153 }
154
155 //convert resulting path from backward-linked list
156 12089 stack_len = 0;
157 12089 idx = 0;
158
2/2
✓ Branch 0 taken 169246 times.
✓ Branch 1 taken 12089 times.
 181335 for (cb = 1; cb < CB_TOT_ALL; cb++)
159
2/2
✓ Branch 0 taken 17316 times.
✓ Branch 1 taken 151930 times.
 169246 if (path[max_sfb][cb].cost < path[max_sfb][idx].cost)
160 17316 idx = cb;
161 12089 ppos = max_sfb;
162
2/2
✓ Branch 0 taken 66582 times.
✓ Branch 1 taken 12089 times.
 78671 while (ppos > 0) {
163 av_assert1(idx >= 0);
164 66582 cb = idx;
165 66582 stackrun[stack_len] = path[ppos][cb].run;
166 66582 stackcb [stack_len] = cb;
167 66582 idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx;
168 66582 ppos -= path[ppos][cb].run;
169 66582 stack_len++;
170 }
171 //perform actual band info encoding
172 12089 start = 0;
173
2/2
✓ Branch 0 taken 66582 times.
✓ Branch 1 taken 12089 times.
 78671 for (i = stack_len - 1; i >= 0; i--) {
174 66582 cb = aac_cb_out_map[stackcb[i]];
175 66582 put_bits(&s->pb, 4, cb);
176 66582 count = stackrun[i];
177 66582 memset(sce->zeroes + win*16 + start, !cb, count);
178 //XXX: memset when band_type is also uint8_t
179
2/2
✓ Branch 0 taken 525643 times.
✓ Branch 1 taken 66582 times.
 592225 for (j = 0; j < count; j++) {
180 525643 sce->band_type[win*16 + start] = cb;
181 525643 start++;
182 }
183
2/2
✓ Branch 0 taken 2493 times.
✓ Branch 1 taken 66582 times.
 69075 while (count >= run_esc) {
184 2493 put_bits(&s->pb, run_bits, run_esc);
185 2493 count -= run_esc;
186 }
187 66582 put_bits(&s->pb, run_bits, count);
188 }
189 12089 }
190
191
192 #endif /* AVCODEC_AACCODER_TRELLIS_H */
193