memgraph/tests/unit/deferred_deleter.cpp

#include "gtest/gtest.h"

#include "mvcc/record.hpp"
#include "storage/deferred_deleter.hpp"
#include "storage/vertex.hpp"

#include "gc_common.hpp"

// Add and count objects.
TEST(DeferredDeleter, AddObjects) {
  DeferredDeleter<Vertex> deleter;
  for (int i = 0; i < 10; ++i) {
    std::vector<Vertex *> V;
    V.push_back(new Vertex());
    V.push_back(new Vertex());
    deleter.AddObjects(V, Id(5));
    EXPECT_EQ(deleter.Count(), (i + 1) * 2);
  }
  deleter.FreeExpiredObjects(Id::MaximalId());
}

// Check that the deleter can't be destroyed while it still has objects.
TEST(DeferredDeleter, Destructor) {
  std::atomic<int> count{0};
  DeferredDeleter<PropCount> *deleter = new DeferredDeleter<PropCount>;
  for (int i = 0; i < 10; ++i) {
    std::vector<PropCount *> V;
    V.push_back(new PropCount(count));
    V.push_back(new PropCount(count));
    deleter->AddObjects(V, Id(5));
    EXPECT_EQ(deleter->Count(), (i + 1) * 2);
  }
  EXPECT_EQ(0, count);
  EXPECT_DEATH(delete deleter, "");
  // We shouldn't leak memory.
  deleter->FreeExpiredObjects(Id::MaximalId());
  delete deleter;
}

// Check if deleter frees objects.
TEST(DeferredDeleter, FreeExpiredObjects) {
  DeferredDeleter<PropCount> deleter;
  std::vector<PropCount *> V;
  std::atomic<int> count{0};
  V.push_back(new PropCount(count));
  V.push_back(new PropCount(count));
  deleter.AddObjects(V, Id(5));

  deleter.FreeExpiredObjects(Id(5));
  EXPECT_EQ(deleter.Count(), 2);
  EXPECT_EQ(count, 0);

  deleter.FreeExpiredObjects(Id(6));
  EXPECT_EQ(deleter.Count(), 0);
  EXPECT_EQ(count, 2);
}

int main(int argc, char **argv) {
  ::testing::InitGoogleTest(&argc, argv);
  return RUN_ALL_TESTS();
}