mirror of
https://github.com/MoleskiCoder/EightBit.git
synced 2024-11-20 08:32:00 +00:00
60 lines
1.3 KiB
C++
60 lines
1.3 KiB
C++
#pragma once
|
|
|
|
namespace EightBit {
|
|
int countBits(uint8_t value);
|
|
bool oddParity(uint8_t value);
|
|
}
|
|
|
|
/*
|
|
Published in 1988, the C Programming Language 2nd Ed.
|
|
(by Brian W.Kernighan and Dennis M.Ritchie) mentions
|
|
this in exercise 2 - 9. On April 19, 2006 Don Knuth pointed
|
|
out to me that this method "was first published by Peter
|
|
Wegner in CACM 3 (1960), 322.
|
|
(Also discovered independently by Derrick Lehmer and published
|
|
in 1964 in a book edited by Beckenbach.)"
|
|
*/
|
|
inline int EightBit::countBits(uint8_t value) {
|
|
int count; // c accumulates the total bits set in value
|
|
for (count = 0; value; ++count)
|
|
value &= value - 1; // clear the least significant bit set
|
|
return count;
|
|
}
|
|
|
|
inline bool EightBit::oddParity(uint8_t value) {
|
|
return countBits(value) % 2;
|
|
}
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
# include <intrin.h>
|
|
|
|
# define LIKELY(x) (x)
|
|
# define UNLIKELY(x) (x)
|
|
|
|
# define EIGHTBIT_PARITY(x) (__popcnt(x) % 2)
|
|
|
|
# define UNREACHABLE __assume(0)
|
|
|
|
#elif defined(__GNUG__)
|
|
|
|
# include <x86intrin.h>
|
|
|
|
# define LIKELY(x) __builtin_expect(!!(x), 1)
|
|
# define UNLIKELY(x) __builtin_expect(!!(x), 0)
|
|
|
|
# define EIGHTBIT_PARITY(x) __builtin_parity(value)
|
|
|
|
# define UNREACHABLE __builtin_unreachable();
|
|
|
|
#else
|
|
|
|
# define LIKELY(x) (x)
|
|
# define UNLIKELY(x) (x)
|
|
|
|
# define EIGHTBIT_PARITY(x) EightBit::oddParity(x)
|
|
|
|
# define UNREACHABLE
|
|
|
|
#endif
|