BaseTools: Make brotli a submodule

[mirror_edk2.git] / BaseTools / Source / C / BrotliCompress / enc / static_dict.h

diff --git a/BaseTools/Source/C/BrotliCompress/enc/static_dict.h b/BaseTools/Source/C/BrotliCompress/enc/static_dict.h
deleted file mode 100644 (file)
index aafc68f..0000000
--- a/BaseTools/Source/C/BrotliCompress/enc/static_dict.h
+++ /dev/null
@@ -1,40 +0,0 @@
-/* Copyright 2013 Google Inc. All Rights Reserved.\r
-\r
-   Distributed under MIT license.\r
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\r
-*/\r
-\r
-/* Class to model the static dictionary. */\r
-\r
-#ifndef BROTLI_ENC_STATIC_DICT_H_\r
-#define BROTLI_ENC_STATIC_DICT_H_\r
-\r
-#include "../common/dictionary.h"\r
-#include "../common/platform.h"\r
-#include <brotli/types.h>\r
-#include "./encoder_dict.h"\r
-\r
-#if defined(__cplusplus) || defined(c_plusplus)\r
-extern "C" {\r
-#endif\r
-\r
-#define BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN 37\r
-static const uint32_t kInvalidMatch = 0xFFFFFFF;\r
-\r
-/* Matches data against static dictionary words, and for each length l,\r
-   for which a match is found, updates matches[l] to be the minimum possible\r
-     (distance << 5) + len_code.\r
-   Returns 1 if matches have been found, otherwise 0.\r
-   Prerequisites:\r
-     matches array is at least BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1 long\r
-     all elements are initialized to kInvalidMatch */\r
-BROTLI_INTERNAL BROTLI_BOOL BrotliFindAllStaticDictionaryMatches(\r
-    const BrotliEncoderDictionary* dictionary,\r
-    const uint8_t* data, size_t min_length, size_t max_length,\r
-    uint32_t* matches);\r
-\r
-#if defined(__cplusplus) || defined(c_plusplus)\r
-}  /* extern "C" */\r
-#endif\r
-\r
-#endif  /* BROTLI_ENC_STATIC_DICT_H_ */\r