This file provides implementation of list_test(). It tests the functionality of the linked-list API.
Scope of the Test
API tested:
This file is pjlib-test/list.c
#include "test.h"
#if INCLUDE_LIST_TEST
#include <pjlib.h>
typedef struct list_node
{
PJ_DECL_LIST_MEMBER(struct list_node);
int value;
} list_node;
static int compare_node(void *value, const pj_list_type *nd)
{
list_node *node = (list_node*)nd;
return ((long)value == node->value) ? 0 : -1;
}
#define PJ_SIGNED_ARRAY_SIZE(a) ((int)PJ_ARRAY_SIZE(a))
int list_test()
{
list_node nodes[4];
list_node list;
list_node list2;
list_node *p;
int i;
list.value = (unsigned)-1;
pj_list_init(&list);
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
nodes[i].value = i;
pj_list_insert_before(&list, &nodes[i]);
}
for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) {
pj_assert(p->value == i);
if (p->value != i) {
return -1;
}
}
pj_list_init(&list);
for (i=PJ_SIGNED_ARRAY_SIZE(nodes)-1; i>=0; --i) {
pj_list_insert_after(&list, &nodes[i]);
}
for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) {
pj_assert(p->value == i);
if (p->value != i) {
return -1;
}
}
pj_list_init(&list);
pj_list_init(&list2);
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes)/2; ++i) {
pj_list_insert_before(&list, &nodes[i]);
}
for (i=PJ_SIGNED_ARRAY_SIZE(nodes)/2; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
pj_list_insert_before(&list2, &nodes[i]);
}
pj_list_merge_last(&list, &list2);
for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) {
pj_assert(p->value == i);
if (p->value != i) {
return -1;
}
}
pj_assert( pj_list_empty(&list2) );
if (!pj_list_empty(&list2)) {
return -1;
}
pj_list_init(&list);
pj_list_init(&list2);
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes)/2; ++i) {
pj_list_insert_before(&list, &nodes[i]);
}
for (i=PJ_SIGNED_ARRAY_SIZE(nodes)/2; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
pj_list_insert_before(&list2, &nodes[i]);
}
pj_list_merge_first(&list2, &list);
for (i=0, p=list2.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) {
pj_assert(p->value == i);
if (p->value != i) {
return -1;
}
}
pj_assert( pj_list_empty(&list) );
if (!pj_list_empty(&list)) {
return -1;
}
pj_list_init(&list);
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes)/2; ++i) {
pj_list_insert_before(&list, &nodes[i]);
}
pj_list_init(&nodes[PJ_SIGNED_ARRAY_SIZE(nodes)/2]);
for (i=PJ_SIGNED_ARRAY_SIZE(nodes)/2+1; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
pj_list_insert_before(&nodes[PJ_SIGNED_ARRAY_SIZE(nodes)/2], &nodes[i]);
}
pj_list_insert_nodes_before(&list, &nodes[PJ_SIGNED_ARRAY_SIZE(nodes)/2]);
for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) {
pj_assert(p->value == i);
if (p->value != i) {
return -1;
}
}
pj_list_init(&list);
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
nodes[i].value = i;
pj_list_insert_before(&list, &nodes[i]);
}
for (i=PJ_SIGNED_ARRAY_SIZE(nodes)-1; i>=0; --i) {
int j;
pj_list_erase(&nodes[i]);
for (j=0, p=list.next; j<i; ++j, p=p->next) {
pj_assert(p->value == j);
if (p->value != j) {
return -1;
}
}
}
pj_list_init(&list);
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
nodes[i].value = i;
pj_list_insert_before(&list, &nodes[i]);
}
for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) {
p = (list_node*) pj_list_find_node(&list, &nodes[i]);
pj_assert( p == &nodes[i] );
if (p != &nodes[i]) {
return -1;
}
p = (list_node*) pj_list_search(&list, (void*)(long)i, &compare_node);
pj_assert( p == &nodes[i] );
if (p != &nodes[i]) {
return -1;
}
}
return 0;
}
#else
int dummy_list_test;
#endif