1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
//
// Copyright 2018-2020, Intel Corporation
//
// Modified to test pmem::obj containers
//
#include "unittest.hpp"
#include <libpmemobj++/container/array.hpp>
#include <libpmemobj++/make_persistent.hpp>
#include <libpmemobj++/persistent_ptr.hpp>
#include <libpmemobj++/pool.hpp>
#include <libpmemobj++/transaction.hpp>
using pmem::obj::get;
struct Testcase1 {
typedef std::unique_ptr<double> T;
typedef pmem::obj::array<T, 1> C;
const C c = {{std::unique_ptr<double>(new double(3.5))}};
void
run()
{
static_assert(
std::is_same<const T &&,
decltype(get<0>(std::move(c)))>::value,
"");
static_assert(noexcept(get<0>(std::move(c))), "");
const T &&t = get<0>(std::move(c));
UT_ASSERT(*t == 3.5);
}
};
struct root {
pmem::obj::persistent_ptr<Testcase1> r1;
};
void
run(pmem::obj::pool<root> &pop)
{
try {
pmem::obj::transaction::run(pop, [&] {
pop.root()->r1 =
pmem::obj::make_persistent<Testcase1>();
});
pmem::obj::transaction::run(pop,
[&] { pop.root()->r1->run(); });
} catch (...) {
UT_ASSERT(0);
}
}
static void
test(int argc, char *argv[])
{
if (argc != 2)
UT_FATAL("usage: %s file-name", argv[0]);
const char *path = argv[1];
pmem::obj::pool<root> pop;
try {
pop = pmem::obj::pool<root>::create(path, "get_cons_rv.pass",
PMEMOBJ_MIN_POOL,
S_IWUSR | S_IRUSR);
} catch (...) {
UT_FATAL("!pmemobj_create: %s", path);
}
run(pop);
}
int
main(int argc, char *argv[])
{
return run_test([&] { test(argc, argv); });
}
|