Scarfski/basis_universal
1
0
Fork 0
mirror of https://github.com/BinomialLLC/basis_universal.git synced 2026-06-08 08:33:53 +00:00
Code Issues Packages Projects Releases Wiki Activity

Another fuzz testing fix

Browse Source
This commit is contained in:
Rich Geldreich
2019-05-09 21:49:07 -07:00
parent 8c9d814bb9
commit 9af44e629f
1 changed files with 22 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
transcoder/basisu_transcoder_internal.h
View File

@@ -137,31 +137,43 @@ namespace basist
tree_next -= 2;
}
if (tree_cur >= 0)
{
// Supplied codesizes can't create a valid prefix code.
return false;
}
rev_code >>= (basisu::cHuffmanFastLookupBits - 1);
for (int j = code_size; j > (basisu::cHuffmanFastLookupBits + 1); j--)
{
tree_cur -= ((rev_code >>= 1) & 1);
if ((-tree_cur - 1) >= (int)m_tree.size())
m_tree.resize((-tree_cur - 1) + 1);
if (!m_tree[-tree_cur - 1])
int idx = -tree_cur - 1;
if (idx < 0)
return false;
else if (idx >= (int)m_tree.size())
m_tree.resize(idx + 1);
if (!m_tree[idx])
{
m_tree[-tree_cur - 1] = (int16_t)tree_next;
m_tree[idx] = (int16_t)tree_next;
tree_cur = tree_next;
tree_next -= 2;
}
else
tree_cur = m_tree[-tree_cur - 1];
tree_cur = m_tree[idx];
}
tree_cur -= ((rev_code >>= 1) & 1);
if ((-tree_cur - 1) >= (int)m_tree.size())
m_tree.resize((-tree_cur - 1) + 1);
m_tree[-tree_cur - 1] = (int16_t)sym_index;
int idx = -tree_cur - 1;
if (idx < 0)
return false;
else if (idx >= (int)m_tree.size())
m_tree.resize(idx + 1);
m_tree[idx] = (int16_t)sym_index;
}
return true;