diff options
Diffstat (limited to 'src/journal')
| -rw-r--r-- | src/journal/lookup3.c | 6 | ||||
| -rw-r--r-- | src/journal/sd-journal.c | 2 |
2 files changed, 4 insertions, 4 deletions
diff --git a/src/journal/lookup3.c b/src/journal/lookup3.c index b90093a5e2..31eac8c543 100644 --- a/src/journal/lookup3.c +++ b/src/journal/lookup3.c @@ -315,7 +315,7 @@ uint32_t jenkins_hashlittle( const void *key, size_t length, uint32_t initval) * rest of the string. Every machine with memory protection I've seen * does it on word boundaries, so is OK with this. But VALGRIND will * still catch it and complain. The masking trick does make the hash - * noticably faster for short strings (like English words). + * noticeably faster for short strings (like English words). */ #ifndef VALGRIND @@ -499,7 +499,7 @@ void jenkins_hashlittle2( * rest of the string. Every machine with memory protection I've seen * does it on word boundaries, so is OK with this. But VALGRIND will * still catch it and complain. The masking trick does make the hash - * noticably faster for short strings (like English words). + * noticeably faster for short strings (like English words). */ #ifndef VALGRIND @@ -675,7 +675,7 @@ uint32_t jenkins_hashbig( const void *key, size_t length, uint32_t initval) * rest of the string. Every machine with memory protection I've seen * does it on word boundaries, so is OK with this. But VALGRIND will * still catch it and complain. The masking trick does make the hash - * noticably faster for short strings (like English words). + * noticeably faster for short strings (like English words). */ #ifndef VALGRIND diff --git a/src/journal/sd-journal.c b/src/journal/sd-journal.c index a2900fbee9..6befd8b3ce 100644 --- a/src/journal/sd-journal.c +++ b/src/journal/sd-journal.c @@ -745,7 +745,7 @@ static int next_with_matches( return journal_file_next_entry(f, c, cp, direction, ret, offset); /* If we have a match then we look for the next matching entry - * wiht an offset at least one step larger */ + * with an offset at least one step larger */ return next_for_match(j, j->level0, f, direction == DIRECTION_DOWN ? cp+1 : cp-1, direction, ret, offset); } |