add test for task queue and barrier

Author: toschmidt

test/cpp-utility/task/BarrierTest.cpp

@@ -0,0 +1,33 @@
+#include <catch2/catch.hpp>
+#include <cpp-utility/task/TaskQueue.hpp>
+#include <unistd.h>
+
+using namespace utility::task;
+
+TEST_CASE("Barrier") {
+   std::atomic_int counter{0};
+   TaskQueue queue(2);
+
+   queue.add_task([&counter](size_t) { counter += 10; });
+   queue.add_task([&counter](size_t) {
+      usleep(1000);
+      if (counter == 10) {
+         counter += 10;
+      }
+   });
+   auto func = [&counter](size_t) { counter--; };
+
+   SECTION("with barrier [correct result]") {
+      queue.add_barrier();
+      queue.add_task(func);
+      queue.add_task(func);
+      queue.execute_tasks();
+      REQUIRE(counter == 18);
+   }
+   SECTION("without barrier [incorrect result]") {
+      queue.add_task(func);
+      queue.add_task(func);
+      queue.execute_tasks();
+      REQUIRE(counter == 8);
+   }
+}

test/cpp-utility/task/TaskQueueTest.cpp

@@ -0,0 +1,34 @@
+#include <catch2/catch.hpp>
+#include <cpp-utility/task/TaskQueue.hpp>
+
+using namespace utility::task;
+
+int atomic_add(size_t n_threads, size_t n_tasks) {
+   std::atomic_int counter{0};
+   TaskQueue queue(n_threads);
+
+   auto f = [&counter](size_t) { counter++; };
+
+   for (size_t i = 0; i < n_tasks; i++) {
+      queue.add_task(f);
+   }
+   queue.execute_tasks();
+
+   return counter;
+}
+
+TEST_CASE("Task Queue") {
+   SECTION("no threads") {
+      REQUIRE(atomic_add(0, 0) == 0);
+      REQUIRE(atomic_add(0, 1) == 0);
+   }
+   SECTION("one thread") {
+      REQUIRE(atomic_add(1, 0) == 0);
+      REQUIRE(atomic_add(1, 1) == 1);
+   }
+   SECTION("multiple threads") {
+      REQUIRE(atomic_add(2, 2) == 2);
+      REQUIRE(atomic_add(2, 8) == 8);
+      REQUIRE(atomic_add(64, 16) == 16);
+   }
+}