summaryrefslogtreecommitdiff
path: root/lib/hash.c
diff options
context:
space:
mode:
authorSimon Josefsson <simon@josefsson.org>2011-08-03 01:16:03 +0200
committerSimon Josefsson <simon@josefsson.org>2011-08-03 01:54:47 +0200
commitae155d81b9b0282e1fe2fdfc18f3bfa3ec6a5074 (patch)
treee66003dc5af9746fbe3b652414362cc704bc6de8 /lib/hash.c
parent5ca16d756ababb14e31d09ac4f1c1514de2ff5b9 (diff)
downloadgnutls-ae155d81b9b0282e1fe2fdfc18f3bfa3ec6a5074.tar.gz
Update gnulib files. Fix syntax-check usage.
Diffstat (limited to 'lib/hash.c')
-rw-r--r--lib/hash.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/hash.c b/lib/hash.c
index 208a055f91..b3ef338907 100644
--- a/lib/hash.c
+++ b/lib/hash.c
@@ -33,7 +33,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()
-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.