1*eca53ba6SRoland Levillain // Copyright 2017 Google LLC
2*eca53ba6SRoland Levillain //
3*eca53ba6SRoland Levillain // Licensed under the Apache License, Version 2.0 (the "License");
4*eca53ba6SRoland Levillain // you may not use this file except in compliance with the License.
5*eca53ba6SRoland Levillain // You may obtain a copy of the License at
6*eca53ba6SRoland Levillain //
7*eca53ba6SRoland Levillain // http://www.apache.org/licenses/LICENSE-2.0
8*eca53ba6SRoland Levillain //
9*eca53ba6SRoland Levillain // Unless required by applicable law or agreed to in writing, software
10*eca53ba6SRoland Levillain // distributed under the License is distributed on an "AS IS" BASIS,
11*eca53ba6SRoland Levillain // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12*eca53ba6SRoland Levillain // See the License for the specific language governing permissions and
13*eca53ba6SRoland Levillain // limitations under the License.
14*eca53ba6SRoland Levillain
15*eca53ba6SRoland Levillain #include "internal/bit_utils.h"
16*eca53ba6SRoland Levillain
17*eca53ba6SRoland Levillain #include "gtest/gtest.h"
18*eca53ba6SRoland Levillain
19*eca53ba6SRoland Levillain namespace cpu_features {
20*eca53ba6SRoland Levillain namespace {
21*eca53ba6SRoland Levillain
TEST(UtilsTest,IsBitSet)22*eca53ba6SRoland Levillain TEST(UtilsTest, IsBitSet) {
23*eca53ba6SRoland Levillain for (size_t bit_set = 0; bit_set < 32; ++bit_set) {
24*eca53ba6SRoland Levillain const uint32_t value = 1UL << bit_set;
25*eca53ba6SRoland Levillain for (uint32_t i = 0; i < 32; ++i) {
26*eca53ba6SRoland Levillain EXPECT_EQ(IsBitSet(value, i), i == bit_set);
27*eca53ba6SRoland Levillain }
28*eca53ba6SRoland Levillain }
29*eca53ba6SRoland Levillain
30*eca53ba6SRoland Levillain // testing 0, all bits should be 0.
31*eca53ba6SRoland Levillain for (uint32_t i = 0; i < 32; ++i) {
32*eca53ba6SRoland Levillain EXPECT_FALSE(IsBitSet(0, i));
33*eca53ba6SRoland Levillain }
34*eca53ba6SRoland Levillain
35*eca53ba6SRoland Levillain // testing ~0, all bits should be 1.
36*eca53ba6SRoland Levillain for (uint32_t i = 0; i < 32; ++i) {
37*eca53ba6SRoland Levillain EXPECT_TRUE(IsBitSet(-1, i));
38*eca53ba6SRoland Levillain }
39*eca53ba6SRoland Levillain }
40*eca53ba6SRoland Levillain
TEST(UtilsTest,ExtractBitRange)41*eca53ba6SRoland Levillain TEST(UtilsTest, ExtractBitRange) {
42*eca53ba6SRoland Levillain // Extracting all bits gives the same number.
43*eca53ba6SRoland Levillain EXPECT_EQ(ExtractBitRange(123, 31, 0), 123);
44*eca53ba6SRoland Levillain // Extracting 1 bit gives parity.
45*eca53ba6SRoland Levillain EXPECT_EQ(ExtractBitRange(123, 0, 0), 1);
46*eca53ba6SRoland Levillain EXPECT_EQ(ExtractBitRange(122, 0, 0), 0);
47*eca53ba6SRoland Levillain
48*eca53ba6SRoland Levillain EXPECT_EQ(ExtractBitRange(0xF0, 7, 4), 0xF);
49*eca53ba6SRoland Levillain EXPECT_EQ(ExtractBitRange(0x42 << 2, 10, 2), 0x42);
50*eca53ba6SRoland Levillain }
51*eca53ba6SRoland Levillain
52*eca53ba6SRoland Levillain } // namespace
53*eca53ba6SRoland Levillain } // namespace cpu_features
54