6525451489
Summary: Start removing `is_remote` from `Address` Remove `GlobalAddress` Remove `GlobalizedAddress` Remove bitmasks from `Address` Remove `is_local` from `Address` Remove `is_local` from `RecordAccessor` Remove `worker_id` from `Address` Remove `worker_id` from `GidGenerator` Unfriend `IndexRpcServer` from `Storage` Remove `LocalizedAddressIfPossible` Make member private Remove `worker_id` from `Storage` Copy function to ease removal of distributed logic Remove `worker_id` from `WriteAheadLog` Remove `worker_id` from `GraphDb` Remove `worker_id` from durability Remove nonexistant function Remove `gid` from `Address` Remove usage of `Address` Remove `Address` Remove `VertexAddress` and `EdgeAddress` Fix Id test Remove `cypher_id` from `VersionList` Remove `cypher_id` from durability Remove `cypher_id` member from `VersionList` Remove `cypher_id` from database Fix recovery (revert D1142) Remove unnecessary functions from `GraphDbAccessor` Revert `InsertEdge` implementation to the way it was in/before D1142 Remove leftover `VertexAddress` from `Edge` Remove `PostCreateIndex` and `PopulateIndexFromBuildIndex` Split durability paths into single node and distributed Fix `TransactionIdFromWalFilename` implementation Fix tests Remove `cypher_id` from `snapshooter` and `durability` test Reviewers: msantl, teon.banek Reviewed By: msantl Subscribers: msantl, pullbot Differential Revision: https://phabricator.memgraph.io/D1647
76 lines
2.0 KiB
C++
76 lines
2.0 KiB
C++
#include <vector>
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include "mvcc/common/version.hpp"
|
|
#include "mvcc/single_node/record.hpp"
|
|
#include "mvcc/single_node/version_list.hpp"
|
|
#include "transactions/single_node/engine.hpp"
|
|
#include "transactions/transaction.hpp"
|
|
#include "utils/thread/sync.hpp"
|
|
|
|
#include "mvcc_gc_common.hpp"
|
|
|
|
TEST(MVCC, Deadlock) {
|
|
tx::Engine engine;
|
|
|
|
auto t0 = engine.Begin();
|
|
mvcc::VersionList<Prop> version_list1(*t0, 0);
|
|
mvcc::VersionList<Prop> version_list2(*t0, 1);
|
|
engine.Commit(*t0);
|
|
|
|
auto t1 = engine.Begin();
|
|
auto t2 = engine.Begin();
|
|
|
|
version_list1.update(*t1);
|
|
version_list2.update(*t2);
|
|
EXPECT_THROW(version_list1.update(*t2), utils::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<DestrCountRec> version_list(*t1, 0, count);
|
|
engine.Commit(*t1);
|
|
|
|
auto t2 = engine.Begin();
|
|
version_list.update(*t2);
|
|
engine.Abort(*t2);
|
|
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?
|
|
engine.Commit(*t3);
|
|
}
|
|
EXPECT_EQ(count, 3);
|
|
}
|
|
|
|
// Check that we get the oldest record.
|
|
TEST(MVCC, Oldest) {
|
|
tx::Engine engine;
|
|
auto t1 = engine.Begin();
|
|
mvcc::VersionList<Prop> version_list(*t1, 0);
|
|
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?
|