mirror of
https://gitea.invidious.io/iv-org/litespeed-quic.git
synced 2024-08-15 00:53:43 +00:00
06b2a2363e
- [API] New knob to set outgoing packet batch size. - Aborted connection now become tickable immediately. - Abort connection when HTTP/3 frame cannot be opened (can only happen when malloc fails).
120 lines
2.6 KiB
C
120 lines
2.6 KiB
C
/* Copyright (c) 2017 - 2021 LiteSpeed Technologies Inc. See LICENSE. */
|
|
#include <assert.h>
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
|
|
#include "lsquic_varint.h"
|
|
|
|
#define MAX_INPUT_SZ 8
|
|
|
|
struct test_read_varint
|
|
{
|
|
/* Input: */
|
|
unsigned char input[MAX_INPUT_SZ];
|
|
size_t in_sz;
|
|
/* Output: */
|
|
int rv;
|
|
uint64_t val;
|
|
};
|
|
|
|
static const struct test_read_varint read_tests[] =
|
|
{
|
|
{
|
|
.input = "\x25",
|
|
.in_sz = 0,
|
|
.rv = -1,
|
|
},
|
|
{
|
|
.input = "\x25",
|
|
.in_sz = 2,
|
|
.rv = 1,
|
|
.val = 0x25,
|
|
},
|
|
{
|
|
.input = "\x40\x25",
|
|
.in_sz = 1,
|
|
.rv = -1,
|
|
},
|
|
{
|
|
.input = "\x40\x25",
|
|
.in_sz = 2,
|
|
.rv = 2,
|
|
.val = 0x25,
|
|
},
|
|
{
|
|
.input = "\x9d\x7f\x3e\x7d",
|
|
.in_sz = 2,
|
|
.rv = -1,
|
|
},
|
|
{
|
|
.input = "\x9d\x7f\x3e\x7d",
|
|
.in_sz = 4,
|
|
.rv = 4,
|
|
.val = 494878333,
|
|
},
|
|
{
|
|
.input = "\xc2\x19\x7c\x5e\xff\x14\xe8\x8c",
|
|
.in_sz = 7,
|
|
.rv = -1,
|
|
},
|
|
{
|
|
.input = "\xc2\x19\x7c\x5e\xff\x14\xe8\x8c",
|
|
.in_sz = 8,
|
|
.rv = 8,
|
|
.val = 151288809941952652ull,
|
|
},
|
|
};
|
|
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
const struct test_read_varint *test;
|
|
const struct test_read_varint *const end
|
|
= read_tests + sizeof(read_tests) / sizeof(read_tests[0]);
|
|
size_t input_sz, avail;
|
|
struct varint_read_state state;
|
|
const unsigned char *p, *endp;
|
|
int s;
|
|
|
|
for (test = read_tests; test < end; ++test)
|
|
{
|
|
uint64_t val;
|
|
const int rv = vint_read(test->input, test->input + test->in_sz, &val);
|
|
assert(rv == test->rv);
|
|
if (test->rv > 0)
|
|
assert(val == test->val);
|
|
|
|
/* Test non-blocking read */
|
|
for (input_sz = MAX_INPUT_SZ; input_sz > 0; --input_sz)
|
|
{
|
|
state.pos = 0;
|
|
p = test->input;
|
|
endp = p + test->in_sz;
|
|
while (p < endp)
|
|
{
|
|
avail = (uintptr_t) (endp - p);
|
|
if (avail > input_sz)
|
|
avail = input_sz;
|
|
s = lsquic_varint_read_nb(&p, p + avail, &state);
|
|
if (0 == s)
|
|
{
|
|
assert(state.val == test->val);
|
|
assert(p <= endp);
|
|
break;
|
|
}
|
|
else if (p == endp)
|
|
{
|
|
assert(test->rv == -1);
|
|
break;
|
|
}
|
|
else
|
|
{
|
|
assert(p < endp);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|