RepoMirrors/ffmpeg
1
0
Fork 0
mirror of https://git.ffmpeg.org/ffmpeg.git synced 2025-04-01 22:49:21 +00:00
Code Issues Projects Releases Wiki Activity

avcodec/huffyuv: Speed up generating Huffman codes

Browse Source 
The codes here have the property that the long codes
are to the left of the tree (each zero bit child node
is by definition to the left of its one bit sibling);
they also have the property that among codes of the same length,
the symbol is ascending from left to right.

These properties can be used to create the codes from
the lengths in only two passes over the array of lengths
(the current code uses one pass for each length, i.e. 32):
First one counts how many nodes of each length there are.
Then one calculates the range of codes of each length
(possible because the codes are ordered by length in the tree).
This enables one to calculate the actual codes with only
one further traversal of the length array.

Signed-off-by: Andreas Rheinhardt <andreas.rheinhardt@outlook.com>
This commit is contained in:
Andreas Rheinhardt 2022-10-02 00:46:11 +02:00
parent 566280c3f4
commit cad1593330
1 changed files with 13 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
libavcodec/huffyuv.c
View File

@ -39,19 +39,23 @@
int ff_huffyuv_generate_bits_table(uint32_t *dst, const uint8_t *len_table, int n)
{
int len, index;
uint32_t bits = 0;
int lens[33] = { 0 };
uint32_t codes[33];
for (len = 32; len > 0; len--) {
for (index = 0; index < n; index++) {
if (len_table[index] == len)
dst[index] = bits++;
}
if (bits & 1) {
for (int i = 0; i < n; i++)
lens[len_table[i]]++;
codes[32] = 0;
for (int i = FF_ARRAY_ELEMS(lens) - 1; i > 0; i--) {
if ((lens[i] + codes[i]) & 1) {
av_log(NULL, AV_LOG_ERROR, "Error generating huffman table\n");
return -1;
}
bits >>= 1;
codes[i - 1] = (lens[i] + codes[i]) >> 1;
}
for (int i = 0; i < n; i++) {
if (len_table[i])
dst[i] = codes[len_table[i]]++;
}
return 0;
}