data_structures_test.cpp 6.73 KB
Newer Older
1 2 3 4 5 6
#include <catch.hpp>

#include <pls/internal/base/system_details.h>

#include <pls/internal/data_structures/aligned_stack.h>
#include <pls/internal/data_structures/deque.h>
7
#include <pls/internal/data_structures/work_stealing_deque.h>
8 9 10 11 12 13 14 15

#include <vector>
#include <mutex>

using namespace pls::internal::data_structures;
using namespace pls::internal::base;
using namespace std;

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
TEST_CASE("aligned stack stores objects correctly", "[internal/data_structures/aligned_stack.h]") {
  constexpr long data_size = 1024;
  char data[data_size];
  aligned_stack stack{data, data_size};

  SECTION("stack correctly pushes sub linesize objects") {
    std::array<char, 5> small_data_one{'a', 'b', 'c', 'd', 'e'};
    std::array<char, 64> small_data_two{};
    std::array<char, 1> small_data_three{'A'};

    auto pointer_one = stack.push(small_data_one);
    auto pointer_two = stack.push(small_data_two);
    auto pointer_three = stack.push(small_data_three);

    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_one) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_two) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_three) % system_details::CACHE_LINE_SIZE == 0);
  }

  SECTION("stack correctly pushes above linesize objects") {
    std::array<char, 5> small_data_one{'a', 'b', 'c', 'd', 'e'};
    std::array<char, system_details::CACHE_LINE_SIZE + 10> big_data_one{};

    auto big_pointer_one = stack.push(big_data_one);
    auto small_pointer_one = stack.push(small_data_one);

    REQUIRE(reinterpret_cast<std::uintptr_t>(big_pointer_one) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(small_pointer_one) % system_details::CACHE_LINE_SIZE == 0);
  }

  SECTION("stack correctly stores and retrieves objects") {
    std::array<char, 5> data_one{'a', 'b', 'c', 'd', 'e'};

    stack.push(data_one);
    auto retrieved_data = stack.pop<std::array<char, 5>>();

    REQUIRE(retrieved_data == std::array<char, 5>{'a', 'b', 'c', 'd', 'e'});
  }

  SECTION("stack can push and pop multiple times with correct alignment") {
    std::array<char, 5> small_data_one{'a', 'b', 'c', 'd', 'e'};
    std::array<char, 64> small_data_two{};
    std::array<char, 1> small_data_three{'A'};

    auto pointer_one = stack.push(small_data_one);
    auto pointer_two = stack.push(small_data_two);
    auto pointer_three = stack.push(small_data_three);
    stack.pop<typeof(small_data_three)>();
    stack.pop<typeof(small_data_two)>();
    auto pointer_four = stack.push(small_data_two);
    auto pointer_five = stack.push(small_data_three);

    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_one) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_two) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_three) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_four) % system_details::CACHE_LINE_SIZE == 0);
    REQUIRE(reinterpret_cast<std::uintptr_t>(pointer_five) % system_details::CACHE_LINE_SIZE == 0);

    REQUIRE(pointer_four == pointer_two);
    REQUIRE(pointer_five == pointer_three);
  }
77 78
}

79 80
TEST_CASE("deque stores objects correctly", "[internal/data_structures/deque.h]") {
  class my_item : public deque_item {
81

82
  };
83

84 85
  deque<my_item> deque;
  my_item one, two, three;
86

87 88 89 90
  SECTION("add and remove items form the tail") {
    deque.push_tail(&one);
    deque.push_tail(&two);
    deque.push_tail(&three);
91

92 93 94 95
    REQUIRE(deque.pop_tail() == &three);
    REQUIRE(deque.pop_tail() == &two);
    REQUIRE(deque.pop_tail() == &one);
  }
96

97 98 99
  SECTION("handles getting empty by popping the tail correctly") {
    deque.push_tail(&one);
    REQUIRE(deque.pop_tail() == &one);
100

101 102 103
    deque.push_tail(&two);
    REQUIRE(deque.pop_tail() == &two);
  }
104

105 106 107 108
  SECTION("remove items form the head") {
    deque.push_tail(&one);
    deque.push_tail(&two);
    deque.push_tail(&three);
109

110 111 112 113
    REQUIRE(deque.pop_head() == &one);
    REQUIRE(deque.pop_head() == &two);
    REQUIRE(deque.pop_head() == &three);
  }
114

115 116 117
  SECTION("handles getting empty by popping the head correctly") {
    deque.push_tail(&one);
    REQUIRE(deque.pop_head() == &one);
118

119 120 121
    deque.push_tail(&two);
    REQUIRE(deque.pop_head() == &two);
  }
122

123 124 125
  SECTION("handles getting empty by popping the head and tail correctly") {
    deque.push_tail(&one);
    REQUIRE(deque.pop_tail() == &one);
126

127 128
    deque.push_tail(&two);
    REQUIRE(deque.pop_head() == &two);
129

130 131 132
    deque.push_tail(&three);
    REQUIRE(deque.pop_tail() == &three);
  }
133
}
134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220

TEST_CASE("work stealing deque stores objects correctly", "[internal/data_structures/aligned_stack.h]") {
  constexpr long data_size = 2 << 14;
  char data[data_size];
  aligned_stack stack{data, data_size};
  work_stealing_deque<int> deque{&stack};

  int one = 1, two = 2, three = 3, four = 4;

  SECTION("add and remove items form the tail") {
    deque.push_tail(one);
    deque.push_tail(two);
    deque.push_tail(three);

    REQUIRE(*deque.pop_tail() == three);
    REQUIRE(*deque.pop_tail() == two);
    REQUIRE(*deque.pop_tail() == one);
  }

  SECTION("handles getting empty by popping the tail correctly") {
    deque.push_tail(one);
    REQUIRE(*deque.pop_tail() == one);

    deque.push_tail(two);
    REQUIRE(*deque.pop_tail() == two);
  }

  SECTION("remove items form the head") {
    deque.push_tail(one);
    deque.push_tail(two);
    deque.push_tail(three);

    REQUIRE(*deque.pop_head() == one);
    REQUIRE(*deque.pop_head() == two);
    REQUIRE(*deque.pop_head() == three);
  }

  SECTION("handles getting empty by popping the head correctly") {
    deque.push_tail(one);
    REQUIRE(*deque.pop_head() == one);

    deque.push_tail(two);
    REQUIRE(*deque.pop_head() == two);
  }

  SECTION("handles getting empty by popping the head and tail correctly") {
    deque.push_tail(one);
    REQUIRE(*deque.pop_tail() == one);

    deque.push_tail(two);
    REQUIRE(*deque.pop_head() == two);

    deque.push_tail(three);
    REQUIRE(*deque.pop_tail() == three);
  }

  SECTION("handles jumps bigger 1 correctly") {
    deque.push_tail(one);
    deque.push_tail(two);
    REQUIRE(*deque.pop_tail() == two);

    deque.push_tail(three);
    deque.push_tail(four);
    REQUIRE(*deque.pop_head() == one);
    REQUIRE(*deque.pop_head() == three);
    REQUIRE(*deque.pop_head() == four);
  }

  SECTION("handles stack reset 1 correctly when emptied by tail") {
    deque.push_tail(one);
    deque.push_tail(two);
    auto tmp_result = deque.pop_tail();
    REQUIRE(*tmp_result == two);

    deque.release_memory_until(tmp_result);
    REQUIRE(*deque.pop_tail() == one);

    deque.push_tail(three);
    deque.push_tail(four);
    REQUIRE(*deque.pop_head() == three);
    REQUIRE(*deque.pop_tail() == four);
  }

  SECTION("synces correctly") {

  }
}