Restoring authorship annotation for <derrior@yandex-team.ru>. Commit 1 of 2.

1 files changed, 9 insertions, 9 deletions

diff --git a/contrib/libs/brotli/enc/hash_forgetful_chain_inc.h b/contrib/libs/brotli/enc/hash_forgetful_chain_inc.h
index 41cb3ff03a..201334624a 100644
--- a/contrib/libs/brotli/enc/hash_forgetful_chain_inc.h
+++ b/contrib/libs/brotli/enc/hash_forgetful_chain_inc.h
@@ -28,8 +28,8 @@ static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }
 static BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }
 
 /* HashBytes is the function that chooses the bucket to place the address in.*/
-static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* data) {
-  const uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;
+static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* data) { 
+  const uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32; 
   /* The higher bits contain more mixture from the multiplication,
      so we take our results from there. */
   return h >> (32 - BUCKET_BITS);
@@ -115,7 +115,7 @@ static BROTLI_INLINE void FN(Store)(HasherHandle BROTLI_RESTRICT handle,
 }
 
 static BROTLI_INLINE void FN(StoreRange)(HasherHandle handle,
-    const uint8_t* data, const size_t mask, const size_t ix_start,
+    const uint8_t* data, const size_t mask, const size_t ix_start, 
     const size_t ix_end) {
   size_t i;
   for (i = ix_start; i < ix_end; ++i) {
@@ -154,12 +154,12 @@ static BROTLI_INLINE void FN(PrepareDistanceCache)(
    Writes the best match into |out|.
    |out|->score is updated only if a better match is found. */
 static BROTLI_INLINE void FN(FindLongestMatch)(HasherHandle handle,
-    const BrotliEncoderDictionary* dictionary,
+    const BrotliEncoderDictionary* dictionary, 
     const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,
     const int* BROTLI_RESTRICT distance_cache,
     const size_t cur_ix, const size_t max_length, const size_t max_backward,
-    const size_t gap, const size_t max_distance,
-    HasherSearchResult* BROTLI_RESTRICT out) {
+    const size_t gap, const size_t max_distance, 
+    HasherSearchResult* BROTLI_RESTRICT out) { 
   HashForgetfulChain* self = FN(Self)(handle);
   const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
   /* Don't accept a short copy from far away. */
@@ -241,9 +241,9 @@ static BROTLI_INLINE void FN(FindLongestMatch)(HasherHandle handle,
     FN(Store)(handle, data, ring_buffer_mask, cur_ix);
   }
   if (out->score == min_score) {
-    SearchInStaticDictionary(dictionary,
-        handle, &data[cur_ix_masked], max_length, max_backward + gap,
-        max_distance, out, BROTLI_FALSE);
+    SearchInStaticDictionary(dictionary, 
+        handle, &data[cur_ix_masked], max_length, max_backward + gap, 
+        max_distance, out, BROTLI_FALSE); 
   }
 }