1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
26 gboolean failed = FALSE;
28 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
31 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
33 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
36 g_print ("."); fflush (stdout); \
39 #define C2P(c) ((gpointer) ((long) (c)))
40 #define P2C(p) ((gchar) ((long) (p)))
43 node_build_string (GNode *node,
50 c[0] = P2C (node->data);
52 string = g_strconcat (*p ? *p : "", c, NULL);
71 g_print ("checking n-way trees: ");
74 root = g_node_new (C2P ('A'));
75 TEST (NULL, g_node_depth (root) == 1 && g_node_max_height (root) == 1);
77 node_B = g_node_new (C2P ('B'));
78 g_node_append (root, node_B);
79 TEST (NULL, root->children == node_B);
81 g_node_append_data (node_B, C2P ('E'));
82 g_node_prepend_data (node_B, C2P ('C'));
83 g_node_insert (node_B, 1, g_node_new (C2P ('D')));
85 node_F = g_node_new (C2P ('F'));
86 g_node_append (root, node_F);
87 TEST (NULL, root->children->next == node_F);
89 node_G = g_node_new (C2P ('G'));
90 g_node_append (node_F, node_G);
91 node_J = g_node_new (C2P ('J'));
92 g_node_prepend (node_G, node_J);
93 g_node_insert (node_G, 42, g_node_new (C2P ('K')));
94 g_node_insert_data (node_G, 0, C2P ('H'));
95 g_node_insert (node_G, 1, g_node_new (C2P ('I')));
97 TEST (NULL, g_node_depth (root) == 1);
98 TEST (NULL, g_node_max_height (root) == 4);
99 TEST (NULL, g_node_depth (node_G->children->next) == 4);
100 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);
101 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);
102 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);
103 TEST (NULL, g_node_max_height (node_F) == 3);
104 TEST (NULL, g_node_n_children (node_G) == 4);
105 TEST (NULL, g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);
106 TEST (NULL, g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);
107 TEST (NULL, g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);
109 for (i = 0; i < g_node_n_children (node_B); i++)
111 node = g_node_nth_child (node_B, i);
112 TEST (NULL, P2C (node->data) == ('C' + i));
115 for (i = 0; i < g_node_n_children (node_G); i++)
116 TEST (NULL, g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i);
126 * for in-order traversal, 'G' is considered to be the "left"
127 * child of 'F', which will cause 'F' to be the last node visited.
131 g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
132 TEST (tstring, strcmp (tstring, "ABCDEFGHIJK") == 0);
133 g_free (tstring); tstring = NULL;
134 g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
135 TEST (tstring, strcmp (tstring, "CDEBHIJKGFA") == 0);
136 g_free (tstring); tstring = NULL;
137 g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
138 TEST (tstring, strcmp (tstring, "CBDEAHGIJKF") == 0);
139 g_free (tstring); tstring = NULL;
140 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
141 TEST (tstring, strcmp (tstring, "ABFCDEGHIJK") == 0);
142 g_free (tstring); tstring = NULL;
144 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring);
145 TEST (tstring, strcmp (tstring, "CDEHIJK") == 0);
146 g_free (tstring); tstring = NULL;
147 g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring);
148 TEST (tstring, strcmp (tstring, "ABFG") == 0);
149 g_free (tstring); tstring = NULL;
151 g_node_reverse_children (node_B);
152 g_node_reverse_children (node_G);
154 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
155 TEST (tstring, strcmp (tstring, "ABFEDCGKJIH") == 0);
156 g_free (tstring); tstring = NULL;
158 g_node_destroy (root);
160 /* allocation tests */
162 root = g_node_new (NULL);
165 for (i = 0; i < 2048; i++)
167 g_node_append (node, g_node_new (NULL));
169 node = node->children->next;
171 TEST (NULL, g_node_max_height (root) > 100);
172 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048);
174 g_node_destroy (root);
181 my_hash_callback_remove (gpointer key,
194 my_hash_callback_remove_test (gpointer key,
205 my_hash_callback (gpointer key,
214 my_hash (gconstpointer key)
216 return (guint) *((const gint*) key);
220 my_hash_compare (gconstpointer a,
223 return *((const gint*) a) == *((const gint*) b);
227 my_list_compare_one (gconstpointer a, gconstpointer b)
229 gint one = *((const gint*)a);
230 gint two = *((const gint*)b);
235 my_list_compare_two (gconstpointer a, gconstpointer b)
237 gint one = *((const gint*)a);
238 gint two = *((const gint*)b);
243 my_list_print (gpointer a, gpointer b)
245 gint three = *((gint*)a);
246 g_print("%d", three);
250 my_compare (gconstpointer a,
260 my_traverse (gpointer key,
265 g_print ("%c ", *ch);
275 GHashTable *hash_table;
276 GMemChunk *mem_chunk;
277 GStringChunk *string_chunk;
279 gint nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
280 gint morenums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6};
283 gchar *mem[10000], *tmp_string, *tmp_string_2;
288 GString *string1, *string2;
297 } dirname_checks[] = {
310 guint n_dirname_checks = sizeof (dirname_checks) / sizeof (dirname_checks[0]);
312 g_print ("TestGLib v%u.%u.%u (i:%u b:%u)\n",
319 string = g_get_current_dir ();
320 g_print ("cwd: %s\n", string);
324 g_print ("checking size of gint8: %d", (int)sizeof (gint8));
325 TEST (NULL, sizeof (gint8) == 1);
326 g_print ("\nchecking size of gint16: %d", (int)sizeof (gint16));
327 TEST (NULL, sizeof (gint16) == 2);
328 g_print ("\nchecking size of gint32: %d", (int)sizeof (gint32));
329 TEST (NULL, sizeof (gint32) == 4);
331 g_print ("\nchecking size of gint64: %d", (int)sizeof (gint64));
332 TEST (NULL, sizeof (gint64) == 8);
333 #endif /* HAVE_GINT64 */
336 g_print ("checking g_dirname()...");
337 for (i = 0; i < n_dirname_checks; i++)
341 dirname = g_dirname (dirname_checks[i].filename);
342 if (strcmp (dirname, dirname_checks[i].dirname) != 0)
344 g_print ("\nfailed for \"%s\"==\"%s\" (returned: \"%s\")\n",
345 dirname_checks[i].filename,
346 dirname_checks[i].dirname,
348 n_dirname_checks = 0;
352 if (n_dirname_checks)
355 g_print ("checking doubly linked lists...");
358 for (i = 0; i < 10; i++)
359 list = g_list_append (list, &nums[i]);
360 list = g_list_reverse (list);
362 for (i = 0; i < 10; i++)
364 t = g_list_nth (list, i);
365 if (*((gint*) t->data) != (9 - i))
366 g_error ("Regular insert failed");
369 for (i = 0; i < 10; i++)
370 if(g_list_position(list, g_list_nth (list, i)) != i)
371 g_error("g_list_position does not seem to be the inverse of g_list_nth\n");
376 for (i = 0; i < 10; i++)
377 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_one);
381 g_list_foreach (list, my_list_print, NULL);
384 for (i = 0; i < 10; i++)
386 t = g_list_nth (list, i);
387 if (*((gint*) t->data) != i)
388 g_error ("Sorted insert failed");
394 for (i = 0; i < 10; i++)
395 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_two);
399 g_list_foreach (list, my_list_print, NULL);
402 for (i = 0; i < 10; i++)
404 t = g_list_nth (list, i);
405 if (*((gint*) t->data) != (9 - i))
406 g_error ("Sorted insert failed");
414 g_print ("checking singly linked lists...");
417 for (i = 0; i < 10; i++)
418 slist = g_slist_append (slist, &nums[i]);
419 slist = g_slist_reverse (slist);
421 for (i = 0; i < 10; i++)
423 st = g_slist_nth (slist, i);
424 if (*((gint*) st->data) != (9 - i))
428 g_slist_free (slist);
431 for (i = 0; i < 10; i++)
432 slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_one);
436 g_slist_foreach (slist, my_list_print, NULL);
439 for (i = 0; i < 10; i++)
441 st = g_slist_nth (slist, i);
442 if (*((gint*) st->data) != i)
443 g_error ("Sorted insert failed");
449 for (i = 0; i < 10; i++)
450 slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_two);
454 g_slist_foreach (slist, my_list_print, NULL);
457 for (i = 0; i < 10; i++)
459 st = g_slist_nth (slist, i);
460 if (*((gint*) st->data) != (9 - i))
461 g_error("Sorted insert failed");
469 g_print ("checking binary trees...\n");
471 tree = g_tree_new (my_compare);
473 for (j = 0; j < 10; j++, i++)
476 g_tree_insert (tree, &chars[i], &chars[i]);
478 for (j = 0; j < 26; j++, i++)
481 g_tree_insert (tree, &chars[i], &chars[i]);
483 for (j = 0; j < 26; j++, i++)
486 g_tree_insert (tree, &chars[i], &chars[i]);
489 g_print ("tree height: %d\n", g_tree_height (tree));
490 g_print ("tree nnodes: %d\n", g_tree_nnodes (tree));
493 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);
496 for (i = 0; i < 10; i++)
497 g_tree_remove (tree, &chars[i]);
499 g_print ("tree height: %d\n", g_tree_height (tree));
500 g_print ("tree nnodes: %d\n", g_tree_nnodes (tree));
503 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);
509 /* check n-way trees */
512 g_print ("checking mem chunks...");
514 mem_chunk = g_mem_chunk_new ("test mem chunk", 50, 100, G_ALLOC_AND_FREE);
516 for (i = 0; i < 10000; i++)
518 mem[i] = g_chunk_new (gchar, mem_chunk);
520 for (j = 0; j < 50; j++)
524 for (i = 0; i < 10000; i++)
526 g_mem_chunk_free (mem_chunk, mem[i]);
532 g_print ("checking hash tables...");
534 hash_table = g_hash_table_new (my_hash, my_hash_compare);
535 for (i = 0; i < 10000; i++)
538 g_hash_table_insert (hash_table, &array[i], &array[i]);
540 g_hash_table_foreach (hash_table, my_hash_callback, NULL);
542 for (i = 0; i < 10000; i++)
546 for (i = 0; i < 10000; i++)
547 g_hash_table_remove (hash_table, &array[i]);
549 for (i = 0; i < 10000; i++)
552 g_hash_table_insert (hash_table, &array[i], &array[i]);
555 if (g_hash_table_foreach_remove (hash_table, my_hash_callback_remove, NULL) != 5000 ||
556 g_hash_table_size (hash_table) != 5000)
559 g_hash_table_foreach (hash_table, my_hash_callback_remove_test, NULL);
562 g_hash_table_destroy (hash_table);
567 g_print ("checking string chunks...");
569 string_chunk = g_string_chunk_new (1024);
571 for (i = 0; i < 100000; i ++)
573 tmp_string = g_string_chunk_insert (string_chunk, "hi pete");
575 if (strcmp ("hi pete", tmp_string) != 0)
576 g_error ("string chunks are broken.\n");
579 tmp_string_2 = g_string_chunk_insert_const (string_chunk, tmp_string);
581 g_assert (tmp_string_2 != tmp_string &&
582 strcmp(tmp_string_2, tmp_string) == 0);
584 tmp_string = g_string_chunk_insert_const (string_chunk, tmp_string);
586 g_assert (tmp_string_2 == tmp_string);
588 g_string_chunk_free (string_chunk);
593 g_print ("checking arrays...");
595 garray = g_array_new (FALSE, FALSE, sizeof (gint));
596 for (i = 0; i < 10000; i++)
597 g_array_append_val (garray, i);
599 for (i = 0; i < 10000; i++)
600 if (g_array_index (garray, gint, i) != i)
601 g_print ("uh oh: %d ( %d )\n", g_array_index (garray, gint, i), i);
603 g_array_free (garray, TRUE);
605 garray = g_array_new (FALSE, FALSE, sizeof (gint));
606 for (i = 0; i < 100; i++)
607 g_array_prepend_val (garray, i);
609 for (i = 0; i < 100; i++)
610 if (g_array_index (garray, gint, i) != (100 - i - 1))
611 g_print ("uh oh: %d ( %d )\n", g_array_index (garray, gint, i), 100 - i - 1);
613 g_array_free (garray, TRUE);
618 g_print ("checking strings...");
620 string1 = g_string_new ("hi pete!");
621 string2 = g_string_new ("");
623 g_assert (strcmp ("hi pete!", string1->str) == 0);
625 for (i = 0; i < 10000; i++)
626 g_string_append_c (string1, 'a'+(i%26));
628 g_string_sprintf (string2, "%s|%0100d|%s|%s|%0*d|%*.*f|%10000.10000f",
629 "this pete guy sure is a wuss, like he's the number ",
631 " wuss. everyone agrees.\n",
633 10, 666, 15, 15, 666.666666666, 666.666666666);
637 g_print ("checking timers...\n");
639 timer = g_timer_new ();
640 g_print (" spinning for 3 seconds...\n");
642 g_timer_start (timer);
643 while (g_timer_elapsed (timer, NULL) < 3)
646 g_timer_stop (timer);
647 g_timer_destroy (timer);
651 g_print ("checking g_strcasecmp...\n");
653 /* g_debug (argv[0]); */
657 g_print ("checking relations...");
659 relation = g_relation_new (2);
661 g_relation_index (relation, 0, g_int_hash, g_int_equal);
662 g_relation_index (relation, 1, g_int_hash, g_int_equal);
664 for (i = 0; i < 1024; i += 1)
667 for (i = 1; i < 1023; i += 1)
669 g_relation_insert (relation, data + i, data + i + 1);
670 g_relation_insert (relation, data + i, data + i - 1);
673 for (i = 2; i < 1022; i += 1)
675 g_assert (! g_relation_exists (relation, data + i, data + i));
676 g_assert (! g_relation_exists (relation, data + i, data + i + 2));
677 g_assert (! g_relation_exists (relation, data + i, data + i - 2));
680 for (i = 1; i < 1023; i += 1)
682 g_assert (g_relation_exists (relation, data + i, data + i + 1));
683 g_assert (g_relation_exists (relation, data + i, data + i - 1));
686 for (i = 2; i < 1022; i += 1)
688 g_assert (g_relation_count (relation, data + i, 0) == 2);
689 g_assert (g_relation_count (relation, data + i, 1) == 2);
692 g_assert (g_relation_count (relation, data, 0) == 0);
694 g_assert (g_relation_count (relation, data + 42, 0) == 2);
695 g_assert (g_relation_count (relation, data + 43, 1) == 2);
696 g_assert (g_relation_count (relation, data + 41, 1) == 2);
697 g_relation_delete (relation, data + 42, 0);
698 g_assert (g_relation_count (relation, data + 42, 0) == 0);
699 g_assert (g_relation_count (relation, data + 43, 1) == 1);
700 g_assert (g_relation_count (relation, data + 41, 1) == 1);
702 tuples = g_relation_select (relation, data + 200, 0);
704 g_assert (tuples->len == 2);
707 for (i = 0; i < tuples->len; i += 1)
710 *(gint*) g_tuples_index (tuples, i, 0),
711 *(gint*) g_tuples_index (tuples, i, 1));
715 g_assert (g_relation_exists (relation, data + 300, data + 301));
716 g_relation_delete (relation, data + 300, 0);
717 g_assert (!g_relation_exists (relation, data + 300, data + 301));
719 g_tuples_destroy (tuples);
721 g_relation_destroy (relation);
727 g_print ("checking pointer arrays...");
729 gparray = g_ptr_array_new ();
730 for (i = 0; i < 10000; i++)
731 g_ptr_array_add (gparray, GINT_TO_POINTER (i));
733 for (i = 0; i < 10000; i++)
734 if (g_ptr_array_index (gparray, i) != GINT_TO_POINTER (i))
735 g_print ("array fails: %p ( %p )\n", g_ptr_array_index (gparray, i), GINT_TO_POINTER (i));
737 g_ptr_array_free (gparray, TRUE);
742 g_print ("checking byte arrays...");
744 gbarray = g_byte_array_new ();
745 for (i = 0; i < 10000; i++)
746 g_byte_array_append (gbarray, (guint8*) "abcd", 4);
748 for (i = 0; i < 10000; i++)
750 g_assert (gbarray->data[4*i] == 'a');
751 g_assert (gbarray->data[4*i+1] == 'b');
752 g_assert (gbarray->data[4*i+2] == 'c');
753 g_assert (gbarray->data[4*i+3] == 'd');
756 g_byte_array_free (gbarray, TRUE);
759 g_printerr ("g_log tests:");
760 g_warning ("harmless warning");
761 g_message ("the next warning is a test:");