diff options
Diffstat (limited to '')
| -rw-r--r-- | src/liblzma/lz/lz_encoder.c | 2 | ||||
| -rw-r--r-- | src/liblzma/lz/lz_encoder.h | 2 | ||||
| -rw-r--r-- | src/liblzma/lzma/lzma2_encoder.c | 2 | ||||
| -rw-r--r-- | src/liblzma/lzma/lzma_decoder.c | 4 | ||||
| -rw-r--r-- | src/liblzma/lzma/lzma_decoder.h | 2 | ||||
| -rw-r--r-- | src/liblzma/lzma/lzma_encoder_optimum_fast.c | 2 | ||||
| -rw-r--r-- | src/liblzma/lzma/lzma_encoder_optimum_normal.c | 2 | ||||
| -rw-r--r-- | src/liblzma/lzma/lzma_encoder_private.h | 2 |
8 files changed, 9 insertions, 9 deletions
diff --git a/src/liblzma/lz/lz_encoder.c b/src/liblzma/lz/lz_encoder.c index bf6327d8..757e5374 100644 --- a/src/liblzma/lz/lz_encoder.c +++ b/src/liblzma/lz/lz_encoder.c @@ -229,7 +229,7 @@ lz_encoder_prepare(lzma_mf *mf, lzma_allocator *allocator, mf->nice_len = lz_options->nice_len; // cyclic_size has to stay smaller than 2 Gi. Note that this doesn't - // mean limitting dictionary size to less than 2 GiB. With a match + // mean limiting dictionary size to less than 2 GiB. With a match // finder that uses multibyte resolution (hashes start at e.g. every // fourth byte), cyclic_size would stay below 2 Gi even when // dictionary size is greater than 2 GiB. diff --git a/src/liblzma/lz/lz_encoder.h b/src/liblzma/lz/lz_encoder.h index 401185ef..f6352a47 100644 --- a/src/liblzma/lz/lz_encoder.h +++ b/src/liblzma/lz/lz_encoder.h @@ -182,7 +182,7 @@ typedef struct { // TODO: Maybe this could be changed by making the LZ-based encoders to // store the actual literals as they do with length-distance pairs. // -// Alrogithms such as LZMA2 first try to compress a chunk, and then check +// Algorithms such as LZMA2 first try to compress a chunk, and then check // if the encoded result is smaller than the uncompressed one. If the chunk // was uncompressible, it is better to store it in uncompressed form in // the output stream. To do this, the whole uncompressed chunk has to be diff --git a/src/liblzma/lzma/lzma2_encoder.c b/src/liblzma/lzma/lzma2_encoder.c index eda4aa9f..1e0569a4 100644 --- a/src/liblzma/lzma/lzma2_encoder.c +++ b/src/liblzma/lzma/lzma2_encoder.c @@ -169,7 +169,7 @@ lzma2_encode(lzma_coder *restrict coder, lzma_mf *restrict mf, uint32_t limit; if (left < mf->match_len_max) { - // Must flush immediatelly since the next LZMA symbol + // Must flush immediately since the next LZMA symbol // could make the uncompressed size of the chunk too // big. limit = 0; diff --git a/src/liblzma/lzma/lzma_decoder.c b/src/liblzma/lzma/lzma_decoder.c index 92c127f1..4329e019 100644 --- a/src/liblzma/lzma/lzma_decoder.c +++ b/src/liblzma/lzma/lzma_decoder.c @@ -195,7 +195,7 @@ struct lzma_coder_s { /// 2 (i.e. MATCH_LEN_MIN), 3, 4, and [5, 273]. probability pos_slot[LEN_TO_POS_STATES][POS_SLOTS]; - /// Probility trees for additional bits for match distance when the + /// Probability trees for additional bits for match distance when the /// distance is in the range [4, 127]. probability pos_special[FULL_DISTANCES - END_POS_MODEL_INDEX]; @@ -600,7 +600,7 @@ lzma_decode(lzma_coder *restrict coder, lzma_dict *restrict dictptr, } #endif } else { - // The distace is >= 128. Decode the + // The distance is >= 128. Decode the // lower bits without probabilities // except the lowest four bits. assert(symbol >= 14); diff --git a/src/liblzma/lzma/lzma_decoder.h b/src/liblzma/lzma/lzma_decoder.h index 147208dc..a463a76f 100644 --- a/src/liblzma/lzma/lzma_decoder.h +++ b/src/liblzma/lzma/lzma_decoder.h @@ -30,7 +30,7 @@ extern lzma_ret lzma_lzma_props_decode( /// \brief Decodes the LZMA Properties byte (lc/lp/pb) /// -/// \return true if error occorred, false on success +/// \return true if error occurred, false on success /// extern bool lzma_lzma_lclppb_decode( lzma_options_lzma *options, uint8_t byte); diff --git a/src/liblzma/lzma/lzma_encoder_optimum_fast.c b/src/liblzma/lzma/lzma_encoder_optimum_fast.c index 61aaf3b9..4ca55b60 100644 --- a/src/liblzma/lzma/lzma_encoder_optimum_fast.c +++ b/src/liblzma/lzma/lzma_encoder_optimum_fast.c @@ -62,7 +62,7 @@ lzma_lzma_optimum_fast(lzma_coder *restrict coder, lzma_mf *restrict mf, && buf[len] == buf_back[len]; ++len) ; // If we have found a repeated match that is at least - // nice_len long, return it immediatelly. + // nice_len long, return it immediately. if (len >= nice_len) { *back_res = i; *len_res = len; diff --git a/src/liblzma/lzma/lzma_encoder_optimum_normal.c b/src/liblzma/lzma/lzma_encoder_optimum_normal.c index 5772b449..9284c8a2 100644 --- a/src/liblzma/lzma/lzma_encoder_optimum_normal.c +++ b/src/liblzma/lzma/lzma_encoder_optimum_normal.c @@ -838,7 +838,7 @@ lzma_lzma_optimum_normal(lzma_coder *restrict coder, lzma_mf *restrict mf, } // TODO: This needs quite a bit of cleaning still. But splitting - // the oroginal function to two pieces makes it at least a little + // the original function into two pieces makes it at least a little // more readable, since those two parts don't share many variables. uint32_t len_end = helper1(coder, mf, back_res, len_res, position); diff --git a/src/liblzma/lzma/lzma_encoder_private.h b/src/liblzma/lzma/lzma_encoder_private.h index 3895de2d..68474523 100644 --- a/src/liblzma/lzma/lzma_encoder_private.h +++ b/src/liblzma/lzma/lzma_encoder_private.h @@ -85,7 +85,7 @@ struct lzma_coder_s { /// Number of match candidates in matches[] uint32_t matches_count; - /// Varibale to hold the length of the longest match between calls + /// Variable to hold the length of the longest match between calls /// to lzma_lzma_optimum_*(). uint32_t longest_match_length; |