sd-journal: properly parse cursor strings

[elogind.git] / src / journal / lookup3.c

diff --git a/src/journal/lookup3.c b/src/journal/lookup3.c
index b90093a5e2fb976f6ec90a5dc3a0cce16715dfb8..ee9a1834cfff122ac6469e95bb41f8706fa173e3 100644 (file)
--- a/src/journal/lookup3.c
+++ b/src/journal/lookup3.c
@@ -14,7 +14,7 @@ if SELF_TEST is defined.  You can use this free for any purpose.  It's in
 the public domain.  It has no warranty.
 
 You probably want to use hashlittle().  hashlittle() and hashbig()
 the public domain.  It has no warranty.
 
 You probably want to use hashlittle().  hashlittle() and hashbig()

-hash byte arrays.  hashlittle() is is faster than hashbig() on
+hash byte arrays.  hashlittle() is faster than hashbig() on

 little-endian machines.  Intel and AMD are little-endian machines.
 On second thought, you probably want hashlittle2(), which is identical to
 hashlittle() except it returns two 32-bit hashes for the price of one.
 little-endian machines.  Intel and AMD are little-endian machines.
 On second thought, you probably want hashlittle2(), which is identical to
 hashlittle() except it returns two 32-bit hashes for the price of one.


@@ -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
      * 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
 
      */
 #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
      * 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
 
      */
 #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
      * 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
 
      */
 #ifndef VALGRIND