mirror of
https://gitea.invidious.io/iv-org/litespeed-quic.git
synced 2024-08-15 00:53:43 +00:00
Release 2.13.0
- [API] Use lsxpack_header structure to process incoming headers. - [BUGFIX] Fix assertion when zero-padding Initial packet. - [BUGFIX] Use idle timeout before we learn of peer's value. - Use ls-hpack 2.0.0 -- has lsxpack_header changes. - Use ls-qpack 0.14.0 -- new, common with ls-hpack, XXH seed (not used yet). - Code cleanup: prefix exported functions with "lsquic_".
This commit is contained in:
Dmitri Tikhonov
parent
5289ebd2fd
commit
a5fa05f958
77 changed files with 1168 additions and 73475 deletions
165
include/lsxpack_header.h
Normal file
165
include/lsxpack_header.h
Normal file
|
|
@ -0,0 +1,165 @@
|
|||
/* Copyright (c) 2017 - 2020 LiteSpeed Technologies Inc. See LICENSE. */
|
||||
#ifndef LSXPACK_HEADER_H_v203
|
||||
#define LSXPACK_HEADER_H_v203
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <assert.h>
|
||||
#include <stdint.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifndef LSXPACK_MAX_STRLEN
|
||||
#define LSXPACK_MAX_STRLEN UINT16_MAX
|
||||
#endif
|
||||
|
||||
#if LSXPACK_MAX_STRLEN == UINT16_MAX
|
||||
typedef uint16_t lsxpack_strlen_t;
|
||||
#elif LSXPACK_MAX_STRLEN == UINT32_MAX
|
||||
typedef uint32_t lsxpack_strlen_t;
|
||||
#else
|
||||
#error unexpected LSXPACK_MAX_STRLEN
|
||||
#endif
|
||||
|
||||
enum lsxpack_flag
|
||||
{
|
||||
LSXPACK_HPACK_IDX = 1,
|
||||
LSXPACK_QPACK_IDX = 2,
|
||||
LSXPACK_APP_IDX = 4,
|
||||
LSXPACK_NAME_HASH = 8,
|
||||
LSXPACK_NAMEVAL_HASH = 16,
|
||||
LSXPACK_VAL_MATCHED = 32,
|
||||
LSXPACK_NEVER_INDEX = 64,
|
||||
};
|
||||
|
||||
/**
|
||||
* When header are decoded, it should be stored to @buf starting from @name_offset,
|
||||
* <name>: <value>\r\n
|
||||
* So, it can be used directly as HTTP/1.1 header. there are 4 extra characters
|
||||
* added.
|
||||
*
|
||||
* limitation: we currently does not support total header size > 64KB.
|
||||
*/
|
||||
|
||||
struct lsxpack_header
|
||||
{
|
||||
char *buf; /* the buffer for headers */
|
||||
const char *name_ptr; /* the name pointer can be optionally set for encoding */
|
||||
uint32_t name_hash; /* hash value for name */
|
||||
uint32_t nameval_hash; /* hash value for name + value */
|
||||
lsxpack_strlen_t name_offset; /* the offset for name in the buffer */
|
||||
lsxpack_strlen_t name_len; /* the length of name */
|
||||
lsxpack_strlen_t val_offset; /* the offset for value in the buffer */
|
||||
lsxpack_strlen_t val_len; /* the length of value */
|
||||
uint8_t hpack_index; /* HPACK static table index */
|
||||
uint8_t qpack_index; /* QPACK static table index */
|
||||
uint8_t app_index; /* APP header index */
|
||||
enum lsxpack_flag flags:8; /* combination of lsxpack_flag */
|
||||
uint8_t indexed_type; /* control to disable index or not */
|
||||
uint8_t dec_overhead; /* num of extra bytes written to decoded buffer */
|
||||
};
|
||||
|
||||
typedef struct lsxpack_header lsxpack_header_t;
|
||||
|
||||
|
||||
static inline void
|
||||
lsxpack_header_set_idx(lsxpack_header_t *hdr, int hpack_idx,
|
||||
const char *val, size_t val_len)
|
||||
{
|
||||
memset(hdr, 0, sizeof(*hdr));
|
||||
hdr->buf = (char *)val;
|
||||
hdr->hpack_index = hpack_idx;
|
||||
assert(hpack_idx != 0);
|
||||
hdr->flags = LSXPACK_HPACK_IDX;
|
||||
assert(val_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->val_len = val_len;
|
||||
}
|
||||
|
||||
|
||||
static inline void
|
||||
lsxpack_header_set_ptr(lsxpack_header_t *hdr,
|
||||
const char *name, size_t name_len,
|
||||
const char *val, size_t val_len)
|
||||
{
|
||||
memset(hdr, 0, sizeof(*hdr));
|
||||
hdr->buf = (char *)val;
|
||||
assert(val_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->val_len = val_len;
|
||||
hdr->name_ptr = name;
|
||||
assert(name_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->name_len = name_len;
|
||||
}
|
||||
|
||||
|
||||
static inline void
|
||||
lsxpack_header_set_offset(lsxpack_header_t *hdr, const char *buf,
|
||||
size_t name_offset, size_t name_len,
|
||||
size_t val_len)
|
||||
{
|
||||
memset(hdr, 0, sizeof(*hdr));
|
||||
hdr->buf = (char *)buf;
|
||||
hdr->name_offset = name_offset;
|
||||
assert(name_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->name_len = name_len;
|
||||
assert(name_offset + name_len + 2 <= LSXPACK_MAX_STRLEN);
|
||||
hdr->val_offset = name_offset + name_len + 2;
|
||||
assert(val_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->val_len = val_len;
|
||||
}
|
||||
|
||||
|
||||
static inline void
|
||||
lsxpack_header_set_offset2(lsxpack_header_t *hdr, const char *buf,
|
||||
size_t name_offset, size_t name_len,
|
||||
size_t val_offset, size_t val_len)
|
||||
{
|
||||
memset(hdr, 0, sizeof(*hdr));
|
||||
hdr->buf = (char *)buf;
|
||||
hdr->name_offset = name_offset;
|
||||
assert(name_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->name_len = name_len;
|
||||
assert(val_offset <= LSXPACK_MAX_STRLEN);
|
||||
hdr->val_offset = val_offset;
|
||||
assert(val_len <= LSXPACK_MAX_STRLEN);
|
||||
hdr->val_len = val_len;
|
||||
}
|
||||
|
||||
|
||||
static inline void
|
||||
lsxpack_header_prepare_decode(lsxpack_header_t *hdr,
|
||||
char *out, size_t offset, size_t len)
|
||||
{
|
||||
memset(hdr, 0, sizeof(*hdr));
|
||||
hdr->buf = out;
|
||||
assert(offset <= LSXPACK_MAX_STRLEN);
|
||||
hdr->name_offset = offset;
|
||||
if (len > LSXPACK_MAX_STRLEN)
|
||||
hdr->val_len = LSXPACK_MAX_STRLEN;
|
||||
else
|
||||
hdr->val_len = len;
|
||||
}
|
||||
|
||||
|
||||
static inline const char *
|
||||
lsxpack_header_get_name(const lsxpack_header_t *hdr)
|
||||
{
|
||||
return hdr->name_ptr ? hdr->name_ptr
|
||||
: (hdr->name_len) ? hdr->buf + hdr->name_offset
|
||||
: NULL;
|
||||
}
|
||||
|
||||
|
||||
static inline const char *
|
||||
lsxpack_header_get_value(const lsxpack_header_t *hdr)
|
||||
{ return hdr->buf + hdr->val_offset; }
|
||||
|
||||
static inline size_t
|
||||
lsxpack_header_get_dec_size(const lsxpack_header_t *hdr)
|
||||
{ return hdr->name_len + hdr->val_len + hdr->dec_overhead; }
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif //LSXPACK_HEADER_H_v203
|
||||
Loading…
Add table
Add a link
Reference in a new issue