sbin: Remove repeated words

Signed-off-by: Elyes Haouas <ehaouas@noos.fr>
Reviewed by: imp
Pull Request: https://github.com/freebsd/freebsd-src/pull/887
This commit is contained in:
Elyes Haouas 2024-04-11 11:46:59 -06:00 committed by Warner Losh
parent 5e2a419256
commit f7cee4fa57
4 changed files with 4 additions and 4 deletions

View File

@ -252,7 +252,7 @@ fsck_readdir(struct inodesc *idesc)
dp = (struct direct *)(bp->b_un.b_buf + idesc->id_loc);
/*
* Only need to check current entry if it is the first in the
* the block, as later entries will have been checked in the
* block, as later entries will have been checked in the
* previous call to this function.
*/
if (idesc->id_loc % DIRBLKSIZ != 0 || dircheck(idesc, bp, dp) != 0) {

View File

@ -118,7 +118,7 @@ lzf_compress (const void *const in_data, unsigned int in_len,
/* off requires a type wide enough to hold a general pointer difference.
* ISO C doesn't have that (size_t might not be enough and ptrdiff_t only
* works for differences within a single object). We also assume that no
* no bit pattern traps. Since the only platform that is both non-POSIX
* bit pattern traps. Since the only platform that is both non-POSIX
* and fails to support both assumptions is windows 64 bit, we make a
* special workaround for it.
*/

View File

@ -86,7 +86,7 @@ struct bpf_stat {
* bpf understands a program iff kernel_major == filter_major &&
* kernel_minor >= filter_minor, that is, if the value returned by the
* running kernel has the same major number and a minor number equal
* equal to or less than the filter being downloaded. Otherwise, the
* to or less than the filter being downloaded. Otherwise, the
* results are undefined, meaning an error may be returned or packets
* may be accepted haphazardly.
* It has nothing to do with the source code version.

View File

@ -685,7 +685,7 @@ emitGroup(int num, int dir, void *v, frentry_t *fr, char *group,
if (n) {
/*
* Calculate the indentation interval upto the last common
* common comparison being made.
* comparison being made.
*/
for (i = 0, in = 1; i < FRC_MAX; i++) {
if (n[i].c != m[i].c)