Skip to content

Check HPACK Huffman code strictly #2200

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
zwoop merged 2 commits into from
Jun 27, 2017
Merged

Check HPACK Huffman code strictly #2200

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3dc89c1
Check padding length of Huffman code strictly
maskit Jun 21, 2017
5e69e2f
Check padding bits of Huffman code strictly
maskit Jun 21, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion proxy/http2/HPACK.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -708,7 +708,7 @@ decode_string(Arena &arena, char **str, uint32_t &str_length, const uint8_t *buf
*str = arena.str_alloc(encoded_string_len * 2);

len = huffman_decode(*str, p, encoded_string_len);
if (len == HPACK_ERROR_COMPRESSION_ERROR) {
if (len < 0) {
return HPACK_ERROR_COMPRESSION_ERROR;
}
str_length = len;
Expand Down
25 changes: 20 additions & 5 deletions proxy/http2/HuffmanCodec.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -151,29 +151,44 @@ hpack_huffman_fin()
int64_t
huffman_decode(char *dst_start, const uint8_t *src, uint32_t src_len)
{
char *dst_end = dst_start;
uint8_t shift = 7;
Node *current = HUFFMAN_TREE_ROOT;
char *dst_end = dst_start;
uint8_t shift = 7;
Node *current = HUFFMAN_TREE_ROOT;
int byte_boundary_crossed = 0;
bool includes_zero = false;

while (src_len) {
if (*src & (1 << shift)) {
current = current->right;
} else {
current = current->left;
current = current->left;
includes_zero = true;
}

if (current->leaf_node == true) {
*dst_end = current->ascii_code;
++dst_end;
current = HUFFMAN_TREE_ROOT;
current = HUFFMAN_TREE_ROOT;
byte_boundary_crossed = 0;
includes_zero = false;
}
if (shift) {
--shift;
} else {
shift = 7;
++src;
--src_len;
++byte_boundary_crossed;
}
if (byte_boundary_crossed > 3) {
return -1;
}
}
if (byte_boundary_crossed > 1) {
return -1;
}
if (includes_zero) {
return -1;
}

return dst_end - dst_start;
Expand Down