emo/busybox
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix double words in comments. No code changes

Browse Source 
Signed-off-by: Marek Polacek <mpolacek@redhat.com>
Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
This commit is contained in:
Marek Polacek
2011-04-16 17:33:43 +02:00
committed by Denys Vlasenko
parent 88d3cfdb75
commit b0b8884009
8 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
archival/ar.c
View File

@@ -82,7 +82,7 @@ static void output_ar_header(archive_handle_t *handle)
}
/*
* when replacing files in an existing archive, copy from the the
* when replacing files in an existing archive, copy from the
* original archive those files that are to be left intact
*/
static void FAST_FUNC copy_data(archive_handle_t *handle)

4
archival/gzip.c
View File

@@ -1674,7 +1674,7 @@ static ulg flush_block(char *buf, ulg stored_len, int eof)
/* ===========================================================================
* Update a hash value with the given input byte
* IN assertion: all calls to to UPDATE_HASH are made with consecutive
* IN assertion: all calls to UPDATE_HASH are made with consecutive
* input characters, so that a running hash key can be computed from the
* previous key instead of complete recalculation each time.
*/
@@ -1705,7 +1705,7 @@ static ulg flush_block(char *buf, ulg stored_len, int eof)
/* Insert string s in the dictionary and set match_head to the previous head
* of the hash chain (the most recent string with same hash key). Return
* the previous length of the hash chain.
* IN assertion: all calls to to INSERT_STRING are made with consecutive
* IN assertion: all calls to INSERT_STRING are made with consecutive
* input characters and the first MIN_MATCH bytes of s are valid
* (except for the last MIN_MATCH-1 bytes of the input file). */
#define INSERT_STRING(s, match_head) \