aboutsummaryrefslogtreecommitdiff
path: root/sys/libkern
diff options
context:
space:
mode:
authorRebecca Cran <brucec@FreeBSD.org>2011-02-23 09:22:33 +0000
committerRebecca Cran <brucec@FreeBSD.org>2011-02-23 09:22:33 +0000
commit974206cf705867f4eff213841d85545e7fad4117 (patch)
tree85bb88826874fdc9f92823b778817c385497da0d /sys/libkern
parent8f382a1fd081e9c1f643b052a39f0587d78a90f9 (diff)
Notes
Diffstat (limited to 'sys/libkern')
-rw-r--r--sys/libkern/jenkins.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/sys/libkern/jenkins.h b/sys/libkern/jenkins.h
index 9a02e43eeee0..0846ae8c913d 100644
--- a/sys/libkern/jenkins.h
+++ b/sys/libkern/jenkins.h
@@ -16,7 +16,7 @@
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.