summaryrefslogtreecommitdiff
path: root/src/journal/lookup3.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/journal/lookup3.c')
-rw-r--r--src/journal/lookup3.c6
1 files changed, 3 insertions, 3 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