79e0733c20
test/std/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp Silence MSVC warning C4244. This is expected when passing floating-point values for size. test/std/utilities/template.bitset/bitset.members/to_ullong.pass.cpp test/std/utilities/template.bitset/bitset.members/to_ulong.pass.cpp Avoid MSVC "warning C4293: '<<': shift count negative or too big, undefined behavior". MSVC sees (1ULL << N) and warns - being guarded by const bool canFit is insufficient. A small change to the code avoids the warning without the need for a pragma. Remove a spurious printf() declaration from to_ullong.pass.cpp. Change ULL to UL in to_ulong.pass.cpp. The ULL suffix was probably copy-pasted. test/std/utilities/tuple/tuple.general/ignore.pass.cpp Use LIBCPP_STATIC_ASSERT for consistency with other files. test/support/container_test_types.h Fix a null pointer dereference, found by MSVC /analyze warning C6011 "Dereferencing NULL pointer 'm_expected_args'." Fixes D41030. llvm-svn: 320535
60 lines
2.2 KiB
C++
60 lines
2.2 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// test unsigned long long to_ullong() const;
|
|
|
|
#include <bitset>
|
|
#include <algorithm>
|
|
#include <type_traits>
|
|
#include <climits>
|
|
#include <cassert>
|
|
|
|
template <std::size_t N>
|
|
void test_to_ullong()
|
|
{
|
|
const std::size_t M = sizeof(unsigned long long) * CHAR_BIT < N ? sizeof(unsigned long long) * CHAR_BIT : N;
|
|
const bool is_M_zero = std::integral_constant<bool, M == 0>::value; // avoid compiler warnings
|
|
const std::size_t X = is_M_zero ? sizeof(unsigned long long) * CHAR_BIT - 1 : sizeof(unsigned long long) * CHAR_BIT - M;
|
|
const unsigned long long max = is_M_zero ? 0 : (unsigned long long)(-1) >> X;
|
|
unsigned long long tests[] = {0,
|
|
std::min<unsigned long long>(1, max),
|
|
std::min<unsigned long long>(2, max),
|
|
std::min<unsigned long long>(3, max),
|
|
std::min(max, max-3),
|
|
std::min(max, max-2),
|
|
std::min(max, max-1),
|
|
max};
|
|
for (std::size_t i = 0; i < sizeof(tests)/sizeof(tests[0]); ++i)
|
|
{
|
|
unsigned long long j = tests[i];
|
|
std::bitset<N> v(j);
|
|
assert(j == v.to_ullong());
|
|
}
|
|
{ // test values bigger than can fit into the bitset
|
|
const unsigned long long val = 0x55AAAAFFFFAAAA55ULL;
|
|
const bool canFit = N < sizeof(unsigned long long) * CHAR_BIT;
|
|
const unsigned long long mask = canFit ? (1ULL << (canFit ? N : 0)) - 1 : (unsigned long long)(-1); // avoid compiler warnings
|
|
std::bitset<N> v(val);
|
|
assert(v.to_ullong() == (val & mask)); // we shouldn't return bit patterns from outside the limits of the bitset.
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
// test_to_ullong<0>();
|
|
test_to_ullong<1>();
|
|
test_to_ullong<31>();
|
|
test_to_ullong<32>();
|
|
test_to_ullong<33>();
|
|
test_to_ullong<63>();
|
|
test_to_ullong<64>();
|
|
test_to_ullong<65>();
|
|
test_to_ullong<1000>();
|
|
}
|