Searched refs:BROTLI_RESTRICT (Results 1 – 12 of 12) sorted by relevance
/external/brotli/c/enc/ |
D | hash_composite_inc.h | 88 static BROTLI_INLINE void FN(Store)(HasherHandle BROTLI_RESTRICT handle, in FN() 89 const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) { in FN() 114 HasherHandle handle, int* BROTLI_RESTRICT distance_cache) { in FN() 122 const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, in FN() 123 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN() 126 HasherSearchResult* BROTLI_RESTRICT out) { in FN()
|
D | hash_rolling_inc.h | 105 static BROTLI_INLINE void FN(Store)(HasherHandle BROTLI_RESTRICT handle, in FN() 106 const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) { in FN() 149 HasherHandle handle, int* BROTLI_RESTRICT distance_cache) { in FN() 156 const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, in FN() 157 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN() 160 HasherSearchResult* BROTLI_RESTRICT out) { in FN()
|
D | hash_forgetful_chain_inc.h | 102 static BROTLI_INLINE void FN(Store)(HasherHandle BROTLI_RESTRICT handle, in FN() 103 const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) { in FN() 140 HasherHandle handle, int* BROTLI_RESTRICT distance_cache) { in FN() 158 const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, in FN() 159 const int* BROTLI_RESTRICT distance_cache, in FN() 162 HasherSearchResult* BROTLI_RESTRICT out) { in FN()
|
D | brotli_bit_stream.h | 76 BROTLI_BOOL is_final_block, const uint8_t* BROTLI_RESTRICT input, 78 size_t* BROTLI_RESTRICT storage_ix, uint8_t* BROTLI_RESTRICT storage);
|
D | hash_longest_match64_inc.h | 144 HasherHandle handle, int* BROTLI_RESTRICT distance_cache) { in FN() 162 const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, in FN() 163 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN() 166 HasherSearchResult* BROTLI_RESTRICT out) { in FN() 221 uint32_t* BROTLI_RESTRICT bucket = in FN()
|
D | hash_longest_match_inc.h | 137 HasherHandle handle, int* BROTLI_RESTRICT distance_cache) { in FN() 155 const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, in FN() 156 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN() 159 HasherSearchResult* BROTLI_RESTRICT out) { in FN() 214 uint32_t* BROTLI_RESTRICT bucket = in FN()
|
D | write_bits.h | 38 size_t* BROTLI_RESTRICT pos, in BrotliWriteBits() 39 uint8_t* BROTLI_RESTRICT array) { in BrotliWriteBits()
|
D | hash_longest_match_quickly_inc.h | 114 HasherHandle handle, int* BROTLI_RESTRICT distance_cache) { in FN() 129 const uint8_t* BROTLI_RESTRICT data, in FN() 130 const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, in FN() 133 HasherSearchResult* BROTLI_RESTRICT out) { in FN()
|
D | hash_to_binary_tree_inc.h | 116 HashToBinaryTree* self, const uint8_t* const BROTLI_RESTRICT data, in FN() 118 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in FN() 119 BackwardMatch* BROTLI_RESTRICT matches) { in FN()
|
D | brotli_bit_stream.c | 239 size_t* BROTLI_RESTRICT storage_ix, uint8_t* BROTLI_RESTRICT storage) { in BrotliStoreHuffmanTreeToBitMask() 610 static void MoveToFrontTransform(const uint32_t* BROTLI_RESTRICT v_in, in MoveToFrontTransform() 645 uint32_t* BROTLI_RESTRICT v, size_t* BROTLI_RESTRICT out_size, in RunLengthCodeZeros() 646 uint32_t* BROTLI_RESTRICT max_run_length_prefix) { in RunLengthCodeZeros() 1297 const uint8_t* BROTLI_RESTRICT input, in BrotliStoreUncompressedMetaBlock() 1300 size_t* BROTLI_RESTRICT storage_ix, in BrotliStoreUncompressedMetaBlock() 1301 uint8_t* BROTLI_RESTRICT storage) { in BrotliStoreUncompressedMetaBlock()
|
D | hash.h | 92 int* BROTLI_RESTRICT distance_cache, const int num_distances) { in PrepareDistanceCache()
|
/external/brotli/c/common/ |
D | platform.h | 88 #define BROTLI_RESTRICT restrict macro 98 #define BROTLI_RESTRICT __restrict macro 100 #define BROTLI_RESTRICT _Restrict macro 102 #define BROTLI_RESTRICT macro
|