Return to buffer_test.c CVS log

Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / bird2 / lib

bird2 ver 2.0.7

/*
 *	BIRD Library -- Buffer Tests
 *
 *	(c) 2015 CZ.NIC z.s.p.o.
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
 */

#include <stdlib.h>

#include "test/birdtest.h"

#include "lib/buffer.h"

#define MAX_NUM 33

typedef BUFFER(int) buffer_int;
static int expected[MAX_NUM];
static buffer_int buf;
static struct pool *buffer_pool;

static void
show_buf(buffer_int *b)
{
  uint i;
  bt_debug(".used = %d, .size = %d\n", b->used, b->size);

  for (i = 0; i < b->used; i++)
    bt_debug("  .data[%3u] = %-16d  expected %-16d  %s\n", i, b->data[i], expected[i], (b->data[i] == expected[i] ? "OK" : "FAIL!"));
}

static void
fill_expected_array(void)
{
  int i;

  for (i = 0; i < MAX_NUM; i++)
    expected[i] = bt_random();
}

static void
init_buffer(void)
{
  resource_init();
  buffer_pool = &root_pool;
  BUFFER_INIT(buf, buffer_pool, MAX_NUM);
}

static int
is_buffer_as_expected(buffer_int *b)
{
  show_buf(b);

  int i;
  for (i = 0; i < MAX_NUM; i++)
    bt_assert(b->data[i] == expected[i]);
  return 1;
}

static int
t_buffer_push(void)
{
  int i;

  init_buffer();
  fill_expected_array();

  for (i = 0; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i];
  is_buffer_as_expected(&buf);

  return 1;
}

static int
t_buffer_pop(void)
{
  int i;

  init_buffer();
  fill_expected_array();

  /* POP a half of elements */
  for (i = 0; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i];
  for (i = MAX_NUM-1; i >= MAX_NUM/2; i--)
    BUFFER_POP(buf);
  for (i = MAX_NUM/2; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i] = bt_random();
  is_buffer_as_expected(&buf);

  /* POP all of elements */
  for (i = MAX_NUM-1; i >= 0; i--)
    BUFFER_POP(buf);
  bt_assert(buf.used == 0);
  for (i = 0; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i];
  is_buffer_as_expected(&buf);

  return 1;
}

static int
t_buffer_resize(void)
{
  int i;

  init_buffer();
  BUFFER_INIT(buf, buffer_pool, 0);
  fill_expected_array();

  for (i = 0; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i];
  is_buffer_as_expected(&buf);
  bt_assert(buf.size >= MAX_NUM);

  return 1;
}

static int
t_buffer_flush(void)
{
  int i;

  init_buffer();
  fill_expected_array();
  for (i = 0; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i];

  BUFFER_FLUSH(buf);
  bt_assert(buf.used == 0);

  return 1;
}

static int
t_buffer_walk(void)
{
  int i;

  init_buffer();
  fill_expected_array();
  for (i = 0; i < MAX_NUM; i++)
    BUFFER_PUSH(buf) = expected[i];

  i = 0;
  BUFFER_WALK(buf, v)
    bt_assert(v == expected[i++]);

  bt_assert(i == MAX_NUM);

  return 1;
}

int
main(int argc, char *argv[])
{
  bt_init(argc, argv);

  bt_test_suite(t_buffer_push, "Pushing new elements");
  bt_test_suite(t_buffer_pop, "Fill whole buffer (PUSH), a half of elements POP and PUSH new elements");
  bt_test_suite(t_buffer_resize, "Init a small buffer and try overfill");
  bt_test_suite(t_buffer_flush, "Fill and flush all elements");
  bt_test_suite(t_buffer_walk, "Fill and walk through buffer");

  return bt_exit_value();
}