From be1c7e50e1e8809ea56f2c9d472eccd8ffd73a97 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Fri, 19 Apr 2024 04:57:58 +0200 Subject: Adding upstream version 1.44.3. Signed-off-by: Daniel Baumann --- .../h2o/libh2o/deps/brotli/enc/static_dict.h | 32 ++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 web/server/h2o/libh2o/deps/brotli/enc/static_dict.h (limited to 'web/server/h2o/libh2o/deps/brotli/enc/static_dict.h') diff --git a/web/server/h2o/libh2o/deps/brotli/enc/static_dict.h b/web/server/h2o/libh2o/deps/brotli/enc/static_dict.h new file mode 100644 index 00000000..d293934d --- /dev/null +++ b/web/server/h2o/libh2o/deps/brotli/enc/static_dict.h @@ -0,0 +1,32 @@ +/* Copyright 2013 Google Inc. All Rights Reserved. + + Distributed under MIT license. + See file LICENSE for detail or copy at https://opensource.org/licenses/MIT +*/ + +// Class to model the static dictionary. + +#ifndef BROTLI_ENC_STATIC_DICT_H_ +#define BROTLI_ENC_STATIC_DICT_H_ + +#include "./types.h" + +namespace brotli { + +static const size_t kMaxDictionaryMatchLen = 37; +static const uint32_t kInvalidMatch = 0xfffffff; + +// Matches data against static dictionary words, and for each length l, +// for which a match is found, updates matches[l] to be the minimum possible +// (distance << 5) + len_code. +// Prerequisites: +// matches array is at least kMaxDictionaryMatchLen + 1 long +// all elements are initialized to kInvalidMatch +bool FindAllStaticDictionaryMatches(const uint8_t* data, + size_t min_length, + size_t max_length, + uint32_t* matches); + +} // namespace brotli + +#endif // BROTLI_ENC_STATIC_DICT_H_ -- cgit v1.2.3