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 | 9976 | 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 | 9976 | const int max_sfb = sce->ics.max_sfb; | |
66 |
2/2✓ Branch 0 taken 9173 times.
✓ Branch 1 taken 803 times.
|
9976 | const int run_bits = sce->ics.num_windows == 1 ? 5 : 3; |
67 | 9976 | const int run_esc = (1 << run_bits) - 1; | |
68 | int idx, ppos, count; | ||
69 | int stackrun[120], stackcb[120], stack_len; | ||
70 | 9976 | float next_minbits = INFINITY; | |
71 | 9976 | int next_mincb = 0; | |
72 | |||
73 | 9976 | s->aacdsp.abs_pow34(s->scoefs, sce->coeffs, 1024); | |
74 | 9976 | start = win*128; | |
75 |
2/2✓ Branch 0 taken 149640 times.
✓ Branch 1 taken 9976 times.
|
159616 | for (cb = 0; cb < CB_TOT_ALL; cb++) { |
76 | 149640 | path[0][cb].cost = run_bits+4; | |
77 | 149640 | path[0][cb].prev_idx = -1; | |
78 | 149640 | path[0][cb].run = 0; | |
79 | } | ||
80 |
2/2✓ Branch 0 taken 446946 times.
✓ Branch 1 taken 9976 times.
|
456922 | for (swb = 0; swb < max_sfb; swb++) { |
81 | 446946 | size = sce->ics.swb_sizes[swb]; | |
82 |
2/2✓ Branch 0 taken 2909 times.
✓ Branch 1 taken 444037 times.
|
446946 | if (sce->zeroes[win*16 + swb]) { |
83 | 2909 | float cost_stay_here = path[swb][0].cost; | |
84 | 2909 | float cost_get_here = next_minbits + run_bits + 4; | |
85 | 2909 | if ( run_value_bits[sce->ics.num_windows == 8][path[swb][0].run] | |
86 |
2/2✓ Branch 0 taken 20 times.
✓ Branch 1 taken 2889 times.
|
2909 | != run_value_bits[sce->ics.num_windows == 8][path[swb][0].run+1]) |
87 | 20 | cost_stay_here += run_bits; | |
88 |
2/2✓ Branch 0 taken 431 times.
✓ Branch 1 taken 2478 times.
|
2909 | if (cost_get_here < cost_stay_here) { |
89 | 431 | path[swb+1][0].prev_idx = next_mincb; | |
90 | 431 | path[swb+1][0].cost = cost_get_here; | |
91 | 431 | path[swb+1][0].run = 1; | |
92 | } else { | ||
93 | 2478 | path[swb+1][0].prev_idx = 0; | |
94 | 2478 | path[swb+1][0].cost = cost_stay_here; | |
95 | 2478 | path[swb+1][0].run = path[swb][0].run + 1; | |
96 | } | ||
97 | 2909 | next_minbits = path[swb+1][0].cost; | |
98 | 2909 | next_mincb = 0; | |
99 |
2/2✓ Branch 0 taken 40726 times.
✓ Branch 1 taken 2909 times.
|
43635 | for (cb = 1; cb < CB_TOT_ALL; cb++) { |
100 | 40726 | path[swb+1][cb].cost = 61450; | |
101 | 40726 | path[swb+1][cb].prev_idx = -1; | |
102 | 40726 | path[swb+1][cb].run = 0; | |
103 | } | ||
104 | } else { | ||
105 | 444037 | float minbits = next_minbits; | |
106 | 444037 | int mincb = next_mincb; | |
107 | 444037 | int startcb = sce->band_type[win*16+swb]; | |
108 | 444037 | startcb = aac_cb_in_map[startcb]; | |
109 | 444037 | next_minbits = INFINITY; | |
110 | 444037 | next_mincb = 0; | |
111 |
2/2✓ Branch 0 taken 2195253 times.
✓ Branch 1 taken 444037 times.
|
2639290 | for (cb = 0; cb < startcb; cb++) { |
112 | 2195253 | path[swb+1][cb].cost = 61450; | |
113 | 2195253 | path[swb+1][cb].prev_idx = -1; | |
114 | 2195253 | path[swb+1][cb].run = 0; | |
115 | } | ||
116 |
2/2✓ Branch 0 taken 4465302 times.
✓ Branch 1 taken 444037 times.
|
4909339 | for (cb = startcb; cb < CB_TOT_ALL; cb++) { |
117 | float cost_stay_here, cost_get_here; | ||
118 | 4465302 | float bits = 0.0f; | |
119 |
4/4✓ Branch 0 taken 1317259 times.
✓ Branch 1 taken 3148043 times.
✓ Branch 2 taken 1302100 times.
✓ Branch 3 taken 15159 times.
|
4465302 | if (cb >= 12 && sce->band_type[win*16+swb] != aac_cb_out_map[cb]) { |
120 | 1302100 | path[swb+1][cb].cost = 61450; | |
121 | 1302100 | path[swb+1][cb].prev_idx = -1; | |
122 | 1302100 | path[swb+1][cb].run = 0; | |
123 | 1302100 | continue; | |
124 | } | ||
125 |
2/2✓ Branch 0 taken 3221199 times.
✓ Branch 1 taken 3163202 times.
|
6384401 | for (w = 0; w < group_len; w++) { |
126 | 3221199 | bits += quantize_band_cost_bits(s, &sce->coeffs[start + w*128], | |
127 | 3221199 | &s->scoefs[start + w*128], size, | |
128 | 3221199 | sce->sf_idx[win*16+swb], | |
129 | 3221199 | aac_cb_out_map[cb], | |
130 | 0, INFINITY, NULL, NULL); | ||
131 | } | ||
132 | 3163202 | cost_stay_here = path[swb][cb].cost + bits; | |
133 | 3163202 | cost_get_here = minbits + bits + run_bits + 4; | |
134 | 3163202 | if ( run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run] | |
135 |
2/2✓ Branch 0 taken 3017 times.
✓ Branch 1 taken 3160185 times.
|
3163202 | != run_value_bits[sce->ics.num_windows == 8][path[swb][cb].run+1]) |
136 | 3017 | cost_stay_here += run_bits; | |
137 |
2/2✓ Branch 0 taken 2004328 times.
✓ Branch 1 taken 1158874 times.
|
3163202 | if (cost_get_here < cost_stay_here) { |
138 | 2004328 | path[swb+1][cb].prev_idx = mincb; | |
139 | 2004328 | path[swb+1][cb].cost = cost_get_here; | |
140 | 2004328 | path[swb+1][cb].run = 1; | |
141 | } else { | ||
142 | 1158874 | path[swb+1][cb].prev_idx = cb; | |
143 | 1158874 | path[swb+1][cb].cost = cost_stay_here; | |
144 | 1158874 | path[swb+1][cb].run = path[swb][cb].run + 1; | |
145 | } | ||
146 |
2/2✓ Branch 0 taken 942473 times.
✓ Branch 1 taken 2220729 times.
|
3163202 | if (path[swb+1][cb].cost < next_minbits) { |
147 | 942473 | next_minbits = path[swb+1][cb].cost; | |
148 | 942473 | next_mincb = cb; | |
149 | } | ||
150 | } | ||
151 | } | ||
152 | 446946 | start += sce->ics.swb_sizes[swb]; | |
153 | } | ||
154 | |||
155 | //convert resulting path from backward-linked list | ||
156 | 9976 | stack_len = 0; | |
157 | 9976 | idx = 0; | |
158 |
2/2✓ Branch 0 taken 139664 times.
✓ Branch 1 taken 9976 times.
|
149640 | for (cb = 1; cb < CB_TOT_ALL; cb++) |
159 |
2/2✓ Branch 0 taken 14827 times.
✓ Branch 1 taken 124837 times.
|
139664 | if (path[max_sfb][cb].cost < path[max_sfb][idx].cost) |
160 | 14827 | idx = cb; | |
161 | 9976 | ppos = max_sfb; | |
162 |
2/2✓ Branch 0 taken 55104 times.
✓ Branch 1 taken 9976 times.
|
65080 | while (ppos > 0) { |
163 | av_assert1(idx >= 0); | ||
164 | 55104 | cb = idx; | |
165 | 55104 | stackrun[stack_len] = path[ppos][cb].run; | |
166 | 55104 | stackcb [stack_len] = cb; | |
167 | 55104 | idx = path[ppos-path[ppos][cb].run+1][cb].prev_idx; | |
168 | 55104 | ppos -= path[ppos][cb].run; | |
169 | 55104 | stack_len++; | |
170 | } | ||
171 | //perform actual band info encoding | ||
172 | 9976 | start = 0; | |
173 |
2/2✓ Branch 0 taken 55104 times.
✓ Branch 1 taken 9976 times.
|
65080 | for (i = stack_len - 1; i >= 0; i--) { |
174 | 55104 | cb = aac_cb_out_map[stackcb[i]]; | |
175 | 55104 | put_bits(&s->pb, 4, cb); | |
176 | 55104 | count = stackrun[i]; | |
177 | 55104 | memset(sce->zeroes + win*16 + start, !cb, count); | |
178 | //XXX: memset when band_type is also uint8_t | ||
179 |
2/2✓ Branch 0 taken 446946 times.
✓ Branch 1 taken 55104 times.
|
502050 | for (j = 0; j < count; j++) { |
180 | 446946 | sce->band_type[win*16 + start] = cb; | |
181 | 446946 | start++; | |
182 | } | ||
183 |
2/2✓ Branch 0 taken 1336 times.
✓ Branch 1 taken 55104 times.
|
56440 | while (count >= run_esc) { |
184 | 1336 | put_bits(&s->pb, run_bits, run_esc); | |
185 | 1336 | count -= run_esc; | |
186 | } | ||
187 | 55104 | put_bits(&s->pb, run_bits, count); | |
188 | } | ||
189 | 9976 | } | |
190 | |||
191 | |||
192 | #endif /* AVCODEC_AACCODER_TRELLIS_H */ | ||
193 |