nghttp2/lib/nghttp2_hd_huffman.c

213 lines
5.9 KiB
C
Raw Normal View History

/*
2014-03-30 12:09:21 +02:00
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2013 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include "nghttp2_hd_huffman.h"
#include <string.h>
#include <assert.h>
2013-12-19 14:54:34 +01:00
#include <stdio.h>
#include "nghttp2_hd.h"
extern const nghttp2_huff_sym huff_sym_table[];
extern const nghttp2_huff_decode huff_decode_table[][16];
/*
2013-12-19 14:54:34 +01:00
* Encodes huffman code |sym| into |*dest_ptr|, whose least |rembits|
* bits are not filled yet. The |rembits| must be in range [1, 8],
* inclusive. At the end of the process, the |*dest_ptr| is updated
* and points where next output should be placed. The number of
* unfilled bits in the pointed location is returned.
*/
2014-03-13 14:11:02 +01:00
static ssize_t huff_encode_sym(nghttp2_bufs *bufs, size_t *avail_ptr,
2014-11-27 15:39:04 +01:00
size_t rembits, const nghttp2_huff_sym *sym) {
2014-03-13 14:11:02 +01:00
int rv;
2014-12-18 17:28:21 +01:00
uint32_t nbits = sym->nbits;
uint32_t code = sym->code;
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
/* We assume that sym->nbits <= 32 */
if (rembits > nbits) {
nghttp2_bufs_fast_orb_hold(bufs, code << (rembits - nbits));
return (ssize_t)(rembits - nbits);
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
if (rembits == nbits) {
nghttp2_bufs_fast_orb(bufs, code);
--*avail_ptr;
return 8;
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
nghttp2_bufs_fast_orb(bufs, code >> (nbits - rembits));
--*avail_ptr;
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
nbits -= rembits;
if (nbits & 0x7) {
/* align code to MSB byte boundary */
code <<= 8 - (nbits & 0x7);
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
/* we lose at most 3 bytes, but it is not critical in practice */
if (*avail_ptr < (nbits + 7) / 8) {
rv = nghttp2_bufs_advance(bufs);
if (rv != 0) {
return rv;
2014-03-13 14:11:02 +01:00
}
2014-12-18 17:28:21 +01:00
*avail_ptr = nghttp2_bufs_cur_avail(bufs);
/* we assume that we at least 3 buffer space available */
assert(*avail_ptr >= 3);
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
/* fast path, since most code is less than 8 */
if (nbits < 8) {
nghttp2_bufs_fast_addb_hold(bufs, code);
*avail_ptr = nghttp2_bufs_cur_avail(bufs);
return (ssize_t)(8 - nbits);
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
/* handle longer code path */
if (nbits > 24) {
nghttp2_bufs_fast_addb(bufs, code >> 24);
nbits -= 8;
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
if (nbits > 16) {
nghttp2_bufs_fast_addb(bufs, code >> 16);
nbits -= 8;
}
2014-03-13 14:11:02 +01:00
2014-12-18 17:28:21 +01:00
if (nbits > 8) {
nghttp2_bufs_fast_addb(bufs, code >> 8);
nbits -= 8;
}
2014-12-18 17:28:21 +01:00
if (nbits == 8) {
nghttp2_bufs_fast_addb(bufs, code);
*avail_ptr = nghttp2_bufs_cur_avail(bufs);
return 8;
}
nghttp2_bufs_fast_addb_hold(bufs, code);
*avail_ptr = nghttp2_bufs_cur_avail(bufs);
return (ssize_t)(8 - nbits);
}
2014-11-27 15:39:04 +01:00
size_t nghttp2_hd_huff_encode_count(const uint8_t *src, size_t len) {
size_t i;
size_t nbits = 0;
2014-11-27 15:39:04 +01:00
for (i = 0; i < len; ++i) {
nbits += huff_sym_table[src[i]].nbits;
}
/* pad the prefix of EOS (256) */
return (nbits + 7) / 8;
}
2014-11-27 15:39:04 +01:00
int nghttp2_hd_huff_encode(nghttp2_bufs *bufs, const uint8_t *src,
size_t srclen) {
2014-03-13 14:11:02 +01:00
int rv;
ssize_t rembits = 8;
size_t i;
2014-03-13 14:11:02 +01:00
size_t avail;
avail = nghttp2_bufs_cur_avail(bufs);
2014-11-27 15:39:04 +01:00
for (i = 0; i < srclen; ++i) {
const nghttp2_huff_sym *sym = &huff_sym_table[src[i]];
2014-11-27 15:39:04 +01:00
if (rembits == 8) {
if (avail) {
2014-03-13 14:11:02 +01:00
nghttp2_bufs_fast_addb_hold(bufs, 0);
} else {
rv = nghttp2_bufs_addb_hold(bufs, 0);
2014-11-27 15:39:04 +01:00
if (rv != 0) {
2014-03-13 14:11:02 +01:00
return rv;
}
avail = nghttp2_bufs_cur_avail(bufs);
}
}
rembits = huff_encode_sym(bufs, &avail, rembits, sym);
2014-11-27 15:39:04 +01:00
if (rembits < 0) {
return (int)rembits;
2013-12-19 14:54:34 +01:00
}
}
/* 256 is special terminal symbol, pad with its prefix */
2014-11-27 15:39:04 +01:00
if (rembits < 8) {
2014-12-18 17:28:21 +01:00
/* if rembits < 8, we should have at least 1 buffer space
available */
2013-12-19 14:54:34 +01:00
const nghttp2_huff_sym *sym = &huff_sym_table[256];
2014-12-18 17:28:21 +01:00
assert(avail);
2014-03-13 14:11:02 +01:00
/* Caution we no longer adjust avail here */
2014-12-18 17:28:21 +01:00
nghttp2_bufs_fast_orb(bufs, sym->code >> (sym->nbits - rembits));
}
2014-03-13 14:11:02 +01:00
return 0;
}
2014-11-27 15:39:04 +01:00
void nghttp2_hd_huff_decode_context_init(nghttp2_hd_huff_decode_context *ctx) {
ctx->state = 0;
ctx->accept = 1;
}
ssize_t nghttp2_hd_huff_decode(nghttp2_hd_huff_decode_context *ctx,
2014-11-27 15:39:04 +01:00
nghttp2_bufs *bufs, const uint8_t *src,
size_t srclen, int final) {
size_t i, j;
int rv;
2014-03-13 14:11:02 +01:00
size_t avail;
avail = nghttp2_bufs_cur_avail(bufs);
/* We use the decoding algorithm described in
http://graphics.ics.uci.edu/pub/Prefix.pdf */
2014-11-27 15:39:04 +01:00
for (i = 0; i < srclen; ++i) {
2014-01-24 13:56:19 +01:00
uint8_t in = src[i] >> 4;
2014-11-27 15:39:04 +01:00
for (j = 0; j < 2; ++j) {
const nghttp2_huff_decode *t;
t = &huff_decode_table[ctx->state][in];
2014-11-27 15:39:04 +01:00
if (t->flags & NGHTTP2_HUFF_FAIL) {
return NGHTTP2_ERR_HEADER_COMP;
}
2014-11-27 15:39:04 +01:00
if (t->flags & NGHTTP2_HUFF_SYM) {
if (avail) {
2014-03-13 14:11:02 +01:00
nghttp2_bufs_fast_addb(bufs, t->sym);
--avail;
} else {
rv = nghttp2_bufs_addb(bufs, t->sym);
2014-11-27 15:39:04 +01:00
if (rv != 0) {
2014-03-13 14:11:02 +01:00
return rv;
}
avail = nghttp2_bufs_cur_avail(bufs);
2014-01-24 13:56:19 +01:00
}
}
ctx->state = t->state;
ctx->accept = (t->flags & NGHTTP2_HUFF_ACCEPTED) != 0;
2014-01-24 13:56:19 +01:00
in = src[i] & 0xf;
}
2014-01-24 13:56:19 +01:00
}
2014-11-27 15:39:04 +01:00
if (final && !ctx->accept) {
return NGHTTP2_ERR_HEADER_COMP;
}
return (ssize_t)i;
}