seq_tests.h File Reference

#include <stdio.h>
#include <serene/rt/context.h>
#include <serene/rt/impl/seq.h>
#include "base.h"

Include dependency graph for seq_tests.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	seq_dummy

Macros
#define	SEQ_TESTS(X)
#define	SEQ_TEST_LOG(...)

Typedefs
typedef struct seq_dummy	seq_dummy

Functions
static void	test_seq_empty ()
void	test_seq_push_less_than_32 ()
void	test_seq_push_more_than_32 ()

Macro Definition Documentation

SEQ_TEST_LOG

#define SEQ_TEST_LOG

(

...

)

Definition at line 36 of file seq_tests.h.

SEQ_TESTS

#define SEQ_TESTS

(

X

)

Value:

  X("seq::empty", test_seq_empty),                             \
      X("seq::push_less_than_32", test_seq_push_less_than_32), \
      X("seq::push_more_than_32", test_seq_push_more_than_32)

Definition at line 28 of file seq_tests.h.

#define SEQ_TESTS(X)                                           \
  X("seq::empty", test_seq_empty),                             \
      X("seq::push_less_than_32", test_seq_push_less_than_32), \
      X("seq::push_more_than_32", test_seq_push_more_than_32)

Typedef Documentation

seq_dummy

typedef struct seq_dummy seq_dummy

Function Documentation

test_seq_empty()

static void test_seq_empty ( )

static

Definition at line 44 of file seq_tests.h.

                             {
  MAKE_ENGINE(mm, engine);
  MAKE_CONTEXT(engine, ctx);
  auto s = seq_empty(ctx);
 
  TEST_CHECK(s.len == 0);
  TEST_CHECK(s.tail_len == 0);
  TEST_CHECK(s.root == nullptr);
  TEST_CHECK(s.maybe_error == nullptr);
 
  RELEASE_CONTEXT(ctx);
  SHUTDOWN_ENGINE(mm, engine);
}

Here is the call graph for this function:

test_seq_push_less_than_32()

void test_seq_push_less_than_32

(

)

Definition at line 58 of file seq_tests.h.

                                  {
  MAKE_ENGINE(mm, engine);
  MAKE_CONTEXT(engine, ctx);
 
  seq_dummy d = {.foo = 10, .bar = 20}; // NOLINT
  auto s      = seq_empty(ctx);
  auto s1     = seq_push(ctx, &s, (seq_elem_t)&d);
  TEST_CHECK(s.len == 0);
  TEST_CHECK(s.tail_len == 0);
  TEST_CHECK(s.root == nullptr);
  TEST_CHECK(s.maybe_error == nullptr);
 
  TEST_CHECK(s1.len == 1);
  TEST_CHECK(s1.tail_len == 1);
  TEST_CHECK(s1.root == nullptr);
  TEST_CHECK(s1.maybe_error == nullptr);
  seq_dummy *d1 = (seq_dummy *)s1.tail[0];
  TEST_CHECK(d1->foo == 10);
  TEST_CHECK(d1->bar == 20);
 
  RELEASE_CONTEXT(ctx);
  SHUTDOWN_ENGINE(mm, engine);
}

Here is the call graph for this function:

test_seq_push_more_than_32()

void test_seq_push_more_than_32

(

)

Definition at line 82 of file seq_tests.h.

                                  {
  MAKE_ENGINE(mm, engine);
  MAKE_CONTEXT(engine, ctx);
 
  seq_t s = seq_empty(ctx);
 
  for (int i = 0; i < 2000; i++) {
 
    seq_dummy *d = ALLOC(ctx, seq_dummy);
    d->foo       = i;
    d->bar       = 3000 - i;
    s            = seq_push(ctx, &s, (seq_elem_t)d);
  }
 
  TEST_CHECK(s.len == 2000);
  TEST_CHECK(s.tail_len == 16);
  TEST_CHECK(s.root != nullptr);
  TEST_CHECK(s.maybe_error == nullptr);
 
  seq_dummy *d1 = (seq_dummy *)s.tail[0];
 
  ASSERT_NOT_NULL(d1);
  TEST_CHECK(d1->foo == 1984);
  TEST_CHECK(d1->bar == 3000 - d1->foo);
 
  seq_dummy *d2 = (seq_dummy *)s.tail[s.tail_len - 1];
  ASSERT_NOT_NULL(d2);
  TEST_CHECK(d2->foo == 1999);
  TEST_CHECK(d2->bar == 3000 - d2->foo);
 
  for (int i = 0; i < 2000; i++) {
    seq_lookup_result_t res = seq_get(ctx, &s, (size_t)i);
    TEST_CHECK(res.maybe_error == nullptr);
    ASSERT_NOT_NULL(res.data);
    seq_dummy *d = (seq_dummy *)res.data;
 
    SEQ_TEST_LOG("%d %d %d", i, d->foo, d->bar);
    TEST_CHECK(d->foo == i);
    TEST_CHECK(d->bar == 3000 - i);
  };
 
  RELEASE_CONTEXT(ctx);
  SHUTDOWN_ENGINE(mm, engine);
}

Here is the call graph for this function: