merge_node *
make_merge_node_with_children (size_t num)
{
merge_node *node = make_merge_node ();
merge_list list = merge_node_get_children (node);
size_t i;
for (i = 0; i < num; i++)
{
gl_list_nx_add_last (list, make_merge_node ());
}
}
static gl_list_t
merge_ctxt_create_default_priorities ()
{
gl_list_t list =
gl_list_nx_create_empty (GL_ARRAY_LIST, NULL, NULL, NULL, true);
int i = 0;
for (i = 0; i < default_priorities_count; i++)
{
gl_list_nx_add_last (list, default_priorities[i]);
}
return list;
}
gl_list_t
upmf_list_init_from_doc (xmlDocPtr doc, xmlNodePtr node, ustring_t children)
{
gl_list_t list = gl_list_nx_create_empty (GL_LINKED_LIST, NULL, NULL,
UCPOINTER (xmlFree), FALSE);
xmlNodePtr cnode = node->xmlChildrenNode;
while (cnode != NULL)
{
if (!xmlStrcmp (cnode->name, children))
{
gl_list_nx_add_last (list, UCPOINTER (upmf_get_xstring (doc, cnode)));
}
cnode = cnode->next;
}
xmlFree (cnode);
return list;
}
int l_img_load_bta(lua_State *L)
{
btstring_t *fname;
l_anim *a;
bta_cell_t *c;
uint32_t i;
fname = _l_getFilePath(L, 1);
l_anim_new(L);
a = l_checkAnim(L, -1);
a->bta = bta_read_bta(fname);
c = bta_get_base(a->bta);
a->loopData = gl_list_nx_create_empty(GL_ARRAY_LIST,
NULL, NULL, l_loop_free, 1);
if (a->loopData == NULL) {
luaL_error(L, "Error creating loop data");
}
for (i = 0; i < bta_getNumLoops(a->bta); i++) {
l_loop_t *l;
l = xzalloc(sizeof(l_loop_t));
l->anim = a;
l->c_cell = 0;
l->loopNumber = i;
l->timer = 0;
if (gl_list_nx_add_last(a->loopData, l) == NULL) {
luaL_error(L, "Out of memory");
}
}
a->s = SDL_CreateRGBSurface(SDL_SWSURFACE, c->width, c->height,
32, 0x000000ff, 0x0000ff00, 0x00ff0000, 0xff000000);
debug("a->s->format = %s\n", SDL_GetPixelFormatName(a->s->format->format));
return 1;
}
int
main (int argc, char *argv[])
{
gl_list_t list1, list2, list3;
set_program_name (argv[0]);
/* Allow the user to provide a non-default random seed on the command line. */
if (argc > 1)
srand (atoi (argv[1]));
{
size_t initial_size = RANDOM (50);
const void **contents =
(const void **) malloc (initial_size * sizeof (const void *));
size_t i;
unsigned int repeat;
for (i = 0; i < initial_size; i++)
contents[i] = RANDOM_OBJECT ();
/* Create list1. */
list1 = gl_list_nx_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
initial_size, contents);
ASSERT (list1 != NULL);
/* Create list2. */
list2 = gl_list_nx_create_empty (GL_RBTREE_LIST, NULL, NULL, NULL, true);
ASSERT (list2 != NULL);
for (i = 0; i < initial_size; i++)
ASSERT (gl_list_nx_add_last (list2, contents[i]) != NULL);
/* Create list3. */
list3 = gl_list_nx_create (GL_RBTREE_LIST, NULL, NULL, NULL, true,
initial_size, contents);
ASSERT (list3 != NULL);
check_all (list1, list2, list3);
for (repeat = 0; repeat < 10000; repeat++)
{
unsigned int operation = RANDOM (16);
switch (operation)
{
case 0:
if (gl_list_size (list1) > 0)
{
size_t index = RANDOM (gl_list_size (list1));
const char *obj = RANDOM_OBJECT ();
gl_list_node_t node1, node2, node3;
node1 = gl_list_nx_set_at (list1, index, obj);
ASSERT (node1 != NULL);
ASSERT (gl_list_get_at (list1, index) == obj);
ASSERT (gl_list_node_value (list1, node1) == obj);
node2 = gl_list_nx_set_at (list2, index, obj);
ASSERT (node2 != NULL);
ASSERT (gl_list_get_at (list2, index) == obj);
ASSERT (gl_list_node_value (list2, node2) == obj);
node3 = gl_list_nx_set_at (list3, index, obj);
ASSERT (node3 != NULL);
ASSERT (gl_list_get_at (list3, index) == obj);
ASSERT (gl_list_node_value (list3, node3) == obj);
if (index > 0)
{
ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
== gl_list_get_at (list1, index - 1));
ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
== gl_list_get_at (list2, index - 1));
ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
== gl_list_get_at (list2, index - 1));
}
if (index + 1 < gl_list_size (list1))
{
ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
== gl_list_get_at (list1, index + 1));
ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
== gl_list_get_at (list2, index + 1));
ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
== gl_list_get_at (list2, index + 1));
}
}
break;
case 1:
{
const char *obj = RANDOM_OBJECT ();
gl_list_node_t node1, node2, node3;
node1 = gl_list_search (list1, obj);
node2 = gl_list_search (list2, obj);
node3 = gl_list_search (list3, obj);
if (node1 == NULL)
{
ASSERT (node2 == NULL);
ASSERT (node3 == NULL);
}
else
{
ASSERT (node2 != NULL);
ASSERT (node3 != NULL);
ASSERT (gl_list_node_value (list1, node1) == obj);
ASSERT (gl_list_node_value (list2, node2) == obj);
ASSERT (gl_list_node_value (list3, node3) == obj);
}
}
break;
case 2:
{
const char *obj = RANDOM_OBJECT ();
size_t index1, index2, index3;
index1 = gl_list_indexof (list1, obj);
index2 = gl_list_indexof (list2, obj);
index3 = gl_list_indexof (list3, obj);
if (index1 == (size_t)(-1))
{
ASSERT (index2 == (size_t)(-1));
ASSERT (index3 == (size_t)(-1));
}
else
{
ASSERT (index2 != (size_t)(-1));
ASSERT (index3 != (size_t)(-1));
ASSERT (gl_list_get_at (list1, index1) == obj);
ASSERT (gl_list_get_at (list2, index2) == obj);
ASSERT (gl_list_get_at (list3, index3) == obj);
ASSERT (index2 == index1);
ASSERT (index3 == index1);
}
}
break;
case 3: /* add 1 element */
{
const char *obj = RANDOM_OBJECT ();
gl_list_node_t node1, node2, node3;
node1 = gl_list_nx_add_first (list1, obj);
ASSERT (node1 != NULL);
node2 = gl_list_nx_add_first (list2, obj);
ASSERT (node2 != NULL);
node3 = gl_list_nx_add_first (list3, obj);
ASSERT (node3 != NULL);
ASSERT (gl_list_node_value (list1, node1) == obj);
ASSERT (gl_list_node_value (list2, node2) == obj);
ASSERT (gl_list_node_value (list3, node3) == obj);
ASSERT (gl_list_get_at (list1, 0) == obj);
ASSERT (gl_list_get_at (list2, 0) == obj);
ASSERT (gl_list_get_at (list3, 0) == obj);
}
break;
case 4: /* add 1 element */
{
const char *obj = RANDOM_OBJECT ();
gl_list_node_t node1, node2, node3;
node1 = gl_list_nx_add_last (list1, obj);
ASSERT (node1 != NULL);
node2 = gl_list_nx_add_last (list2, obj);
ASSERT (node2 != NULL);
node3 = gl_list_nx_add_last (list3, obj);
ASSERT (node3 != NULL);
ASSERT (gl_list_node_value (list1, node1) == obj);
ASSERT (gl_list_node_value (list2, node2) == obj);
ASSERT (gl_list_node_value (list3, node3) == obj);
ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
}
break;
case 5: /* add 3 elements */
{
const char *obj0 = RANDOM_OBJECT ();
const char *obj1 = RANDOM_OBJECT ();
const char *obj2 = RANDOM_OBJECT ();
gl_list_node_t node1, node2, node3;
node1 = gl_list_nx_add_first (list1, obj2);
ASSERT (node1 != NULL);
node1 = gl_list_nx_add_before (list1, node1, obj0);
ASSERT (node1 != NULL);
node1 = gl_list_nx_add_after (list1, node1, obj1);
ASSERT (node1 != NULL);
node2 = gl_list_nx_add_first (list2, obj2);
ASSERT (node2 != NULL);
node2 = gl_list_nx_add_before (list2, node2, obj0);
ASSERT (node2 != NULL);
node2 = gl_list_nx_add_after (list2, node2, obj1);
ASSERT (node2 != NULL);
node3 = gl_list_nx_add_first (list3, obj2);
ASSERT (node3 != NULL);
node3 = gl_list_nx_add_before (list3, node3, obj0);
ASSERT (node3 != NULL);
node3 = gl_list_nx_add_after (list3, node3, obj1);
ASSERT (node3 != NULL);
ASSERT (gl_list_node_value (list1, node1) == obj1);
ASSERT (gl_list_node_value (list2, node2) == obj1);
ASSERT (gl_list_node_value (list3, node3) == obj1);
ASSERT (gl_list_get_at (list1, 0) == obj0);
ASSERT (gl_list_get_at (list1, 1) == obj1);
ASSERT (gl_list_get_at (list1, 2) == obj2);
ASSERT (gl_list_get_at (list2, 0) == obj0);
ASSERT (gl_list_get_at (list2, 1) == obj1);
ASSERT (gl_list_get_at (list2, 2) == obj2);
ASSERT (gl_list_get_at (list3, 0) == obj0);
ASSERT (gl_list_get_at (list3, 1) == obj1);
ASSERT (gl_list_get_at (list3, 2) == obj2);
}
break;
case 6: /* add 1 element */
{
size_t index = RANDOM (gl_list_size (list1) + 1);
const char *obj = RANDOM_OBJECT ();
gl_list_node_t node1, node2, node3;
node1 = gl_list_nx_add_at (list1, index, obj);
ASSERT (node1 != NULL);
node2 = gl_list_nx_add_at (list2, index, obj);
ASSERT (node2 != NULL);
node3 = gl_list_nx_add_at (list3, index, obj);
ASSERT (node3 != NULL);
ASSERT (gl_list_get_at (list1, index) == obj);
ASSERT (gl_list_node_value (list1, node1) == obj);
ASSERT (gl_list_get_at (list2, index) == obj);
ASSERT (gl_list_node_value (list2, node2) == obj);
ASSERT (gl_list_get_at (list3, index) == obj);
ASSERT (gl_list_node_value (list3, node3) == obj);
if (index > 0)
{
ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
== gl_list_get_at (list1, index - 1));
ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
== gl_list_get_at (list2, index - 1));
ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
== gl_list_get_at (list2, index - 1));
}
if (index + 1 < gl_list_size (list1))
{
ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
== gl_list_get_at (list1, index + 1));
ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
== gl_list_get_at (list2, index + 1));
ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
== gl_list_get_at (list2, index + 1));
}
}
break;
case 7: case 8: /* remove 1 element */
if (gl_list_size (list1) > 0)
{
size_t n = gl_list_size (list1);
const char *obj = gl_list_get_at (list1, RANDOM (n));
gl_list_node_t node1, node2, node3;
node1 = gl_list_search (list1, obj);
node2 = gl_list_search (list2, obj);
node3 = gl_list_search (list3, obj);
ASSERT (node1 != NULL);
ASSERT (node2 != NULL);
ASSERT (node3 != NULL);
ASSERT (gl_list_remove_node (list1, node1));
ASSERT (gl_list_remove_node (list2, node2));
ASSERT (gl_list_remove_node (list3, node3));
ASSERT (gl_list_size (list1) == n - 1);
}
break;
case 9: case 10: /* remove 1 element */
if (gl_list_size (list1) > 0)
{
size_t n = gl_list_size (list1);
size_t index = RANDOM (n);
ASSERT (gl_list_remove_at (list1, index));
ASSERT (gl_list_remove_at (list2, index));
ASSERT (gl_list_remove_at (list3, index));
ASSERT (gl_list_size (list1) == n - 1);
}
break;
case 11: case 12: /* remove 1 element */
if (gl_list_size (list1) > 0)
{
size_t n = gl_list_size (list1);
const char *obj = gl_list_get_at (list1, RANDOM (n));
ASSERT (gl_list_remove (list1, obj));
ASSERT (gl_list_remove (list2, obj));
ASSERT (gl_list_remove (list3, obj));
ASSERT (gl_list_size (list1) == n - 1);
}
break;
case 13:
if (gl_list_size (list1) > 0)
{
size_t n = gl_list_size (list1);
const char *obj = "xyzzy";
ASSERT (!gl_list_remove (list1, obj));
ASSERT (!gl_list_remove (list2, obj));
ASSERT (!gl_list_remove (list3, obj));
ASSERT (gl_list_size (list1) == n);
}
break;
case 14:
{
size_t n = gl_list_size (list1);
gl_list_iterator_t iter1, iter2, iter3;
const void *elt;
iter1 = gl_list_iterator (list1);
iter2 = gl_list_iterator (list2);
iter3 = gl_list_iterator (list3);
for (i = 0; i < n; i++)
{
ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
ASSERT (gl_list_get_at (list1, i) == elt);
ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
ASSERT (gl_list_get_at (list2, i) == elt);
ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
ASSERT (gl_list_get_at (list3, i) == elt);
}
ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
gl_list_iterator_free (&iter1);
gl_list_iterator_free (&iter2);
gl_list_iterator_free (&iter3);
}
break;
case 15:
{
size_t end = RANDOM (gl_list_size (list1) + 1);
size_t start = RANDOM (end + 1);
gl_list_iterator_t iter1, iter2, iter3;
const void *elt;
iter1 = gl_list_iterator_from_to (list1, start, end);
iter2 = gl_list_iterator_from_to (list2, start, end);
iter3 = gl_list_iterator_from_to (list3, start, end);
for (i = start; i < end; i++)
{
ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
ASSERT (gl_list_get_at (list1, i) == elt);
ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
ASSERT (gl_list_get_at (list2, i) == elt);
ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
ASSERT (gl_list_get_at (list3, i) == elt);
}
ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
gl_list_iterator_free (&iter1);
gl_list_iterator_free (&iter2);
gl_list_iterator_free (&iter3);
}
break;
}
check_all (list1, list2, list3);
}
gl_list_free (list1);
gl_list_free (list2);
gl_list_free (list3);
free (contents);
}
return 0;
}
