thin-provisioning-tools/unit-tests/endian_t.cc

77 lines
2.1 KiB
C++
Raw Normal View History

2011-12-16 00:04:31 +05:30
// Copyright (C) 2011 Red Hat, Inc. All rights reserved.
2011-12-06 19:23:05 +05:30
//
2011-12-06 19:13:56 +05:30
// This file is part of the thin-provisioning-tools source.
//
// thin-provisioning-tools is free software: you can redistribute it
// and/or modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// thin-provisioning-tools is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty
// of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with thin-provisioning-tools. If not, see
// <http://www.gnu.org/licenses/>.
2013-03-22 20:23:53 +05:30
#include "gmock/gmock.h"
2013-10-23 16:09:31 +05:30
#include "persistent-data/endian_utils.h"
2011-07-22 20:39:56 +05:30
using namespace base;
using namespace std;
2013-03-22 20:23:53 +05:30
using namespace testing;
2011-07-22 20:39:56 +05:30
//----------------------------------------------------------------
2013-03-22 20:23:53 +05:30
TEST(EndianTests, bitmaps)
2011-07-22 20:39:56 +05:30
{
unsigned NR_BITS = 10247;
vector<uint64_t> data((NR_BITS + 63) / 64, 0);
// check all bits are zero
void *bits = &data[0];
for (unsigned i = 0; i < NR_BITS; i++)
2013-03-22 20:23:53 +05:30
ASSERT_FALSE(test_bit_le(bits, i));
2011-07-22 20:39:56 +05:30
// set all bits to one
for (unsigned i = 0; i < NR_BITS; i++)
set_bit_le(bits, i);
// check they're all 1 now
for (unsigned i = 0; i < NR_BITS; i++)
2013-03-22 20:23:53 +05:30
ASSERT_TRUE(test_bit_le(bits, i));
2011-07-22 20:39:56 +05:30
// clear every third bit
for (unsigned i = 0; i < NR_BITS; i += 3)
clear_bit_le(bits, i);
// check everything is as we expect
for (unsigned i = 0; i < NR_BITS; i++) {
if ((i % 3) == 0)
2013-03-22 20:23:53 +05:30
ASSERT_FALSE(test_bit_le(bits, i));
2011-07-22 20:39:56 +05:30
else
2013-03-22 20:23:53 +05:30
ASSERT_TRUE(test_bit_le(bits, i));
2011-07-22 20:39:56 +05:30
}
}
2013-03-22 20:23:53 +05:30
TEST(EndianTests, bitmaps_alternate_words)
2011-07-22 20:39:56 +05:30
{
unsigned NR_BITS = 10247;
vector<uint64_t> data((NR_BITS + 63) / 64, 0);
// check all bits are zero
void *bits = &data[0];
for (unsigned i = 0; i < 128; i++)
2013-03-22 20:23:53 +05:30
ASSERT_FALSE(test_bit_le(bits, i));
2011-07-22 20:39:56 +05:30
for (unsigned i = 0; i < 64; i++)
set_bit_le(bits, i);
for (unsigned i = 64; i < 128; i++)
2013-03-22 20:23:53 +05:30
ASSERT_FALSE(test_bit_le(bits, i));
2011-07-22 20:39:56 +05:30
}
//----------------------------------------------------------------