aboutsummaryrefslogtreecommitdiff
path: root/archival
diff options
context:
space:
mode:
Diffstat (limited to 'archival')
-rw-r--r--archival/ar.c2
-rw-r--r--archival/gzip.c4
2 files changed, 3 insertions, 3 deletions
diff --git a/archival/ar.c b/archival/ar.c
index f5a379fb8..e7973af94 100644
--- a/archival/ar.c
+++ b/archival/ar.c
@@ -82,7 +82,7 @@ static void output_ar_header(archive_handle_t *handle)
82} 82}
83 83
84/* 84/*
85 * when replacing files in an existing archive, copy from the the 85 * when replacing files in an existing archive, copy from the
86 * original archive those files that are to be left intact 86 * original archive those files that are to be left intact
87 */ 87 */
88static void FAST_FUNC copy_data(archive_handle_t *handle) 88static void FAST_FUNC copy_data(archive_handle_t *handle)
diff --git a/archival/gzip.c b/archival/gzip.c
index 7686e1adb..a9b216afe 100644
--- a/archival/gzip.c
+++ b/archival/gzip.c
@@ -1674,7 +1674,7 @@ static ulg flush_block(char *buf, ulg stored_len, int eof)
1674 1674
1675/* =========================================================================== 1675/* ===========================================================================
1676 * Update a hash value with the given input byte 1676 * Update a hash value with the given input byte
1677 * IN assertion: all calls to to UPDATE_HASH are made with consecutive 1677 * IN assertion: all calls to UPDATE_HASH are made with consecutive
1678 * input characters, so that a running hash key can be computed from the 1678 * input characters, so that a running hash key can be computed from the
1679 * previous key instead of complete recalculation each time. 1679 * previous key instead of complete recalculation each time.
1680 */ 1680 */
@@ -1705,7 +1705,7 @@ static ulg flush_block(char *buf, ulg stored_len, int eof)
1705/* Insert string s in the dictionary and set match_head to the previous head 1705/* Insert string s in the dictionary and set match_head to the previous head
1706 * of the hash chain (the most recent string with same hash key). Return 1706 * of the hash chain (the most recent string with same hash key). Return
1707 * the previous length of the hash chain. 1707 * the previous length of the hash chain.
1708 * IN assertion: all calls to to INSERT_STRING are made with consecutive 1708 * IN assertion: all calls to INSERT_STRING are made with consecutive
1709 * input characters and the first MIN_MATCH bytes of s are valid 1709 * input characters and the first MIN_MATCH bytes of s are valid
1710 * (except for the last MIN_MATCH-1 bytes of the input file). */ 1710 * (except for the last MIN_MATCH-1 bytes of the input file). */
1711#define INSERT_STRING(s, match_head) \ 1711#define INSERT_STRING(s, match_head) \