5406882bde
Summary: Merge branch 'dev' into mvcc_visibility_tests visibility added Reviewers: dgleich, florijan Reviewed By: dgleich Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D377
77 lines
2.0 KiB
C++
77 lines
2.0 KiB
C++
#include <vector>
|
|
#include "gc_common.hpp"
|
|
#include "gtest/gtest.h"
|
|
|
|
#include "mvcc/id.hpp"
|
|
#include "mvcc/record.hpp"
|
|
#include "mvcc/version.hpp"
|
|
#include "mvcc/version_list.hpp"
|
|
#include "threading/sync/lock_timeout_exception.hpp"
|
|
#include "transactions/engine.hpp"
|
|
#include "transactions/transaction.cpp"
|
|
|
|
class TestClass : public mvcc::Record<TestClass> {};
|
|
|
|
TEST(MVCC, Deadlock) {
|
|
tx::Engine engine;
|
|
|
|
auto t0 = engine.begin();
|
|
mvcc::VersionList<TestClass> version_list1(*t0);
|
|
mvcc::VersionList<TestClass> version_list2(*t0);
|
|
t0->commit();
|
|
|
|
auto t1 = engine.begin();
|
|
auto t2 = engine.begin();
|
|
|
|
version_list1.update(*t1);
|
|
version_list2.update(*t2);
|
|
EXPECT_THROW(version_list1.update(*t2), LockTimeoutException);
|
|
}
|
|
|
|
// TODO Gleich: move this test to mvcc_gc???
|
|
// check that we don't delete records when we re-link
|
|
TEST(MVCC, UpdateDontDelete) {
|
|
std::atomic<int> count{0};
|
|
{
|
|
tx::Engine engine;
|
|
auto t1 = engine.begin();
|
|
mvcc::VersionList<PropCount> version_list(*t1, count);
|
|
t1->commit();
|
|
|
|
auto t2 = engine.begin();
|
|
version_list.update(*t2);
|
|
t2->abort();
|
|
EXPECT_EQ(count, 0);
|
|
|
|
auto t3 = engine.begin();
|
|
|
|
// Update re-links the node and shouldn't clear it yet.
|
|
version_list.update(*t3);
|
|
EXPECT_EQ(count, 0);
|
|
|
|
// TODO Gleich: why don't we also test that remove doesn't delete?
|
|
t3->commit();
|
|
}
|
|
EXPECT_EQ(count, 3);
|
|
}
|
|
|
|
// Check that we get the oldest record.
|
|
TEST(MVCC, Oldest) {
|
|
tx::Engine engine;
|
|
auto t1 = engine.begin();
|
|
mvcc::VersionList<TestClass> version_list(*t1);
|
|
auto first = version_list.Oldest();
|
|
EXPECT_NE(first, nullptr);
|
|
// TODO Gleich: no need to do 10 checks of the same thing
|
|
for (int i = 0; i < 10; ++i) {
|
|
engine.advance(t1->id);
|
|
version_list.update(*t1);
|
|
EXPECT_EQ(version_list.Oldest(), first);
|
|
}
|
|
// TODO Gleich: what about remove?
|
|
// TODO Gleich: here it might make sense to write a concurrent test
|
|
// since these ops rely heavily on linkage atomicity?
|
|
}
|
|
|
|
// TODO Gleich: perhaps some concurrent VersionList::find tests?
|