diff options
| author | dvorkanton <dvorkanton@yandex-team.ru> | 2022-02-10 16:46:04 +0300 |
|---|---|---|
| committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:46:04 +0300 |
| commit | ce1ca0f8ad5b8231d32b35629f85bb09beea1bfb (patch) | |
| tree | 19b21fdcf9ef01e0c94a15434fb08a4a555a79e9 /contrib/libs/libbz2/decompress.c | |
| parent | fc361854fd6ee8d747229b090f0b8018e260d1fb (diff) | |
| download | ydb-ce1ca0f8ad5b8231d32b35629f85bb09beea1bfb.tar.gz | |
Restoring authorship annotation for <dvorkanton@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'contrib/libs/libbz2/decompress.c')
| -rw-r--r-- | contrib/libs/libbz2/decompress.c | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/contrib/libs/libbz2/decompress.c b/contrib/libs/libbz2/decompress.c index a1a0bac892..c0b39c7363 100644 --- a/contrib/libs/libbz2/decompress.c +++ b/contrib/libs/libbz2/decompress.c @@ -8,8 +8,8 @@ This file is part of bzip2/libbzip2, a program and library for lossless, block-sorting data compression. - bzip2/libbzip2 version 1.0.8 of 13 July 2019 - Copyright (C) 1996-2019 Julian Seward <jseward@acm.org> + bzip2/libbzip2 version 1.0.8 of 13 July 2019 + Copyright (C) 1996-2019 Julian Seward <jseward@acm.org> Please read the WARNING, DISCLAIMER and PATENTS sections in the README file. @@ -285,9 +285,9 @@ Int32 BZ2_decompress ( DState* s ) /*--- Now the selectors ---*/ GET_BITS(BZ_X_SELECTOR_1, nGroups, 3); - if (nGroups < 2 || nGroups > BZ_N_GROUPS) RETURN(BZ_DATA_ERROR); + if (nGroups < 2 || nGroups > BZ_N_GROUPS) RETURN(BZ_DATA_ERROR); GET_BITS(BZ_X_SELECTOR_2, nSelectors, 15); - if (nSelectors < 1) RETURN(BZ_DATA_ERROR); + if (nSelectors < 1) RETURN(BZ_DATA_ERROR); for (i = 0; i < nSelectors; i++) { j = 0; while (True) { @@ -296,14 +296,14 @@ Int32 BZ2_decompress ( DState* s ) j++; if (j >= nGroups) RETURN(BZ_DATA_ERROR); } - /* Having more than BZ_MAX_SELECTORS doesn't make much sense - since they will never be used, but some implementations might - "round up" the number of selectors, so just ignore those. */ - if (i < BZ_MAX_SELECTORS) - s->selectorMtf[i] = j; + /* Having more than BZ_MAX_SELECTORS doesn't make much sense + since they will never be used, but some implementations might + "round up" the number of selectors, so just ignore those. */ + if (i < BZ_MAX_SELECTORS) + s->selectorMtf[i] = j; } - if (nSelectors > BZ_MAX_SELECTORS) - nSelectors = BZ_MAX_SELECTORS; + if (nSelectors > BZ_MAX_SELECTORS) + nSelectors = BZ_MAX_SELECTORS; /*--- Undo the MTF values for the selectors. ---*/ { |