2023-03-06 14:42:04 +01:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
|
|
// Copyright The Music Player Daemon Project
|
2012-03-21 08:44:43 +01:00
|
|
|
|
2020-02-05 19:49:18 +01:00
|
|
|
#ifndef MPD_BIT_REVERSE_HXX
|
|
|
|
#define MPD_BIT_REVERSE_HXX
|
2012-03-21 08:44:43 +01:00
|
|
|
|
2020-03-13 01:08:53 +01:00
|
|
|
#include <cstdint>
|
2012-03-21 08:44:43 +01:00
|
|
|
|
2020-02-05 19:51:46 +01:00
|
|
|
/**
|
|
|
|
* @see http://graphics.stanford.edu/~seander/bithacks.html#ReverseByteWith64BitsDiv
|
|
|
|
*/
|
|
|
|
constexpr uint8_t
|
|
|
|
BitReverseMultiplyModulus(uint8_t _in) noexcept
|
|
|
|
{
|
|
|
|
uint64_t in = _in;
|
|
|
|
return uint8_t((in * 0x0202020202ULL & 0x010884422010ULL) % 1023);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* in order to avoid including <array> in this header, this `struct`
|
|
|
|
is a workaround for GenerateBitReverseTable() being able to return
|
|
|
|
the plain array */
|
|
|
|
struct BitReverseTable {
|
|
|
|
uint8_t data[256];
|
|
|
|
};
|
|
|
|
|
|
|
|
extern const BitReverseTable bit_reverse_table;
|
2012-03-21 08:44:43 +01:00
|
|
|
|
2021-10-13 11:28:04 +02:00
|
|
|
[[gnu::const]]
|
2012-03-21 08:44:43 +01:00
|
|
|
static inline uint8_t
|
2020-02-05 19:49:18 +01:00
|
|
|
bit_reverse(uint8_t x) noexcept
|
2012-03-21 08:44:43 +01:00
|
|
|
{
|
2020-02-05 19:51:46 +01:00
|
|
|
return bit_reverse_table.data[x];
|
2012-03-21 08:44:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|