mirror of
https://github.com/dolphin-emu/dolphin.git
synced 2024-12-28 03:55:19 +01:00
df82adca43
This one verifies bitmasks where low bits are set to 1 (hence the name). Any stray 0 among the lower ones or any stray 1 among the higher zeros renders the mask invalid. The edge cases of all zeros and all ones are considered valid masks. It uses an efficient implementation. It's the counterpart of https://graphics.stanford.edu/~seander/bithacks.html#DetermineIfPowerOf2 |
||
|---|---|---|
| .. | ||
| BitFieldTest.cpp | ||
| BitSetTest.cpp | ||
| BitUtilsTest.cpp | ||
| BlockingLoopTest.cpp | ||
| BusyLoopTest.cpp | ||
| CMakeLists.txt | ||
| CommonFuncsTest.cpp | ||
| EventTest.cpp | ||
| FifoQueueTest.cpp | ||
| FixedSizeQueueTest.cpp | ||
| FlagTest.cpp | ||
| MathUtilTest.cpp | ||
| NandPathsTest.cpp | ||
| StringUtilTest.cpp | ||
| SwapTest.cpp | ||
| x64EmitterTest.cpp | ||