summaryrefslogtreecommitdiff
path: root/include/my_bit.h
diff options
context:
space:
mode:
authorluz.paz <luzpaz@users.noreply.github.com>2018-02-24 12:42:13 -0500
committerSergey Vojtovich <svoj@mariadb.org>2018-04-05 15:26:57 +0400
commit3dd01669b41bfad75f4a785d6263eb0f729b0213 (patch)
tree5305ec00d62be464b111583d32618bf4c0371000 /include/my_bit.h
parent7c689300317793d1396b7a24f86452882d3180c2 (diff)
downloadmariadb-git-3dd01669b41bfad75f4a785d6263eb0f729b0213.tar.gz
Misc. typos
Found via `codespell -i 3 -w --skip="./debian/po" -I ../mariadb-server-word-whitelist.txt ./cmake/ ./debian/ ./Docs/ ./include/ ./man/ ./plugin/ ./strings/`
Diffstat (limited to 'include/my_bit.h')
-rw-r--r--include/my_bit.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/include/my_bit.h b/include/my_bit.h
index 221e7d274ea..36764d8253d 100644
--- a/include/my_bit.h
+++ b/include/my_bit.h
@@ -45,7 +45,7 @@ Count bits in 32bit integer
http://graphics.stanford.edu/~seander/bithacks.html
under "Counting bits set, in parallel"
- (Orignal code public domain).
+ (Original code public domain).
*/
static inline uint my_count_bits_uint32(uint32 v)
{
@@ -77,7 +77,7 @@ static inline uint my_count_bits(ulonglong x)
NOTES
Algorithm by Sean Anderson, according to:
http://graphics.stanford.edu/~seander/bithacks.html
- (Orignal code public domain)
+ (Original code public domain)
Comments shows how this works with 01100000000000000000000000001011
*/