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 Lesser 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 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser 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.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
42 #include <io.h> /* For read(), write() etc */
46 gboolean failed = FALSE;
48 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
51 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
53 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
56 g_print ("."); fflush (stdout); \
59 #define C2P(c) ((gpointer) ((long) (c)))
60 #define P2C(p) ((gchar) ((long) (p)))
62 #define GLIB_TEST_STRING "el dorado "
63 #define GLIB_TEST_STRING_5 "el do"
66 node_build_string (GNode *node,
73 c[0] = P2C (node->data);
75 string = g_strconcat (*p ? *p : "", c, NULL);
92 gchar *tstring, *cstring;
94 g_print ("checking n-way trees: ");
97 root = g_node_new (C2P ('A'));
98 TEST (NULL, g_node_depth (root) == 1 && g_node_max_height (root) == 1);
100 node_B = g_node_new (C2P ('B'));
101 g_node_append (root, node_B);
102 TEST (NULL, root->children == node_B);
104 g_node_append_data (node_B, C2P ('E'));
105 g_node_prepend_data (node_B, C2P ('C'));
106 g_node_insert (node_B, 1, g_node_new (C2P ('D')));
108 node_F = g_node_new (C2P ('F'));
109 g_node_append (root, node_F);
110 TEST (NULL, root->children->next == node_F);
112 node_G = g_node_new (C2P ('G'));
113 g_node_append (node_F, node_G);
114 node_J = g_node_new (C2P ('J'));
115 g_node_prepend (node_G, node_J);
116 g_node_insert (node_G, 42, g_node_new (C2P ('K')));
117 g_node_insert_data (node_G, 0, C2P ('H'));
118 g_node_insert (node_G, 1, g_node_new (C2P ('I')));
120 TEST (NULL, g_node_depth (root) == 1);
121 TEST (NULL, g_node_max_height (root) == 4);
122 TEST (NULL, g_node_depth (node_G->children->next) == 4);
123 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);
124 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);
125 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);
126 TEST (NULL, g_node_max_height (node_F) == 3);
127 TEST (NULL, g_node_n_children (node_G) == 4);
128 TEST (NULL, g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);
129 TEST (NULL, g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);
130 TEST (NULL, g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);
132 for (i = 0; i < g_node_n_children (node_B); i++)
134 node = g_node_nth_child (node_B, i);
135 TEST (NULL, P2C (node->data) == ('C' + i));
138 for (i = 0; i < g_node_n_children (node_G); i++)
139 TEST (NULL, g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i);
149 * for in-order traversal, 'G' is considered to be the "left"
150 * child of 'F', which will cause 'F' to be the last node visited.
154 g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
155 TEST (tstring, strcmp (tstring, "ABCDEFGHIJK") == 0);
156 g_free (tstring); tstring = NULL;
157 g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
158 TEST (tstring, strcmp (tstring, "CDEBHIJKGFA") == 0);
159 g_free (tstring); tstring = NULL;
160 g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
161 TEST (tstring, strcmp (tstring, "CBDEAHGIJKF") == 0);
162 g_free (tstring); tstring = NULL;
163 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
164 TEST (tstring, strcmp (tstring, "ABFCDEGHIJK") == 0);
165 g_free (tstring); tstring = NULL;
167 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring);
168 TEST (tstring, strcmp (tstring, "CDEHIJK") == 0);
169 g_free (tstring); tstring = NULL;
170 g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring);
171 TEST (tstring, strcmp (tstring, "ABFG") == 0);
172 g_free (tstring); tstring = NULL;
174 g_node_reverse_children (node_B);
175 g_node_reverse_children (node_G);
177 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
178 TEST (tstring, strcmp (tstring, "ABFEDCGKJIH") == 0);
179 g_free (tstring); tstring = NULL;
182 node = g_node_copy (root);
183 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == g_node_n_nodes (node, G_TRAVERSE_ALL));
184 TEST (NULL, g_node_max_height (root) == g_node_max_height (node));
185 g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
186 g_node_traverse (node, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &cstring);
187 TEST (cstring, strcmp (tstring, cstring) == 0);
188 g_free (tstring); tstring = NULL;
189 g_free (cstring); cstring = NULL;
190 g_node_destroy (node);
192 g_node_destroy (root);
194 /* allocation tests */
196 root = g_node_new (NULL);
199 for (i = 0; i < 2048; i++)
201 g_node_append (node, g_node_new (NULL));
203 node = node->children->next;
205 TEST (NULL, g_node_max_height (root) > 100);
206 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048);
208 g_node_destroy (root);
215 my_hash_callback_remove (gpointer key,
228 my_hash_callback_remove_test (gpointer key,
239 my_hash_callback (gpointer key,
248 my_hash (gconstpointer key)
250 return (guint) *((const gint*) key);
254 my_hash_equal (gconstpointer a,
257 return *((const gint*) a) == *((const gint*) b);
261 my_list_compare_one (gconstpointer a, gconstpointer b)
263 gint one = *((const gint*)a);
264 gint two = *((const gint*)b);
269 my_list_compare_two (gconstpointer a, gconstpointer b)
271 gint one = *((const gint*)a);
272 gint two = *((const gint*)b);
277 my_list_print (gpointer a, gpointer b)
279 gint three = *((gint*)a);
280 g_print("%d", three);
284 my_compare (gconstpointer a,
294 my_traverse (gpointer key,
299 g_print ("%c ", *ch);
309 GHashTable *hash_table;
310 GMemChunk *mem_chunk;
311 GStringChunk *string_chunk;
313 gint nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
314 gint morenums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6};
317 gchar *mem[10000], *tmp_string = NULL, *tmp_string_2;
322 GString *string1, *string2;
331 } dirname_checks[] = {
343 { ".\\\\\\\\", "." },
345 { "..\\\\\\\\", ".." },
347 { "a\\b\\", "a\\b" },
354 guint n_dirname_checks = G_N_ELEMENTS (dirname_checks);
359 } skip_root_checks[] = {
369 { "\\\\server\\foo", "" },
370 { "\\\\server\\foo\\bar", "bar" },
376 guint n_skip_root_checks = G_N_ELEMENTS (skip_root_checks);
378 guint16 gu16t1 = 0x44afU, gu16t2 = 0xaf44U;
379 guint32 gu32t1 = 0x02a7f109U, gu32t2 = 0x09f1a702U;
381 guint64 gu64t1 = G_GINT64_CONSTANT(0x1d636b02300a7aa7U),
382 gu64t2 = G_GINT64_CONSTANT(0xa77a0a30026b631dU);
384 const char hello[] = "Hello, World";
385 const int hellolen = sizeof (hello) - 1;
392 g_print ("TestGLib v%u.%u.%u (i:%u b:%u)\n",
399 string = g_get_current_dir ();
400 g_print ("cwd: %s\n", string);
402 g_print ("user: %s\n", g_get_user_name ());
403 g_print ("real: %s\n", g_get_real_name ());
404 g_print ("home: %s\n", g_get_home_dir ());
405 g_print ("tmp-dir: %s\n", g_get_tmp_dir ());
408 g_print ("checking size of gint8: %d", (int)sizeof (gint8));
409 TEST (NULL, sizeof (gint8) == 1);
410 g_print ("\nchecking size of gint16: %d", (int)sizeof (gint16));
411 TEST (NULL, sizeof (gint16) == 2);
412 g_print ("\nchecking size of gint32: %d", (int)sizeof (gint32));
413 TEST (NULL, sizeof (gint32) == 4);
414 g_print ("\nchecking size of gsize: %d", (int)sizeof (gsize));
416 g_print ("\nchecking size of gint64: %d", (int)sizeof (gint64));
417 TEST (NULL, sizeof (gint64) == 8);
418 #endif /* G_HAVE_GINT64 */
421 g_print ("checking g_path_get_dirname()...");
422 for (i = 0; i < n_dirname_checks; i++)
426 dirname = g_path_get_dirname (dirname_checks[i].filename);
427 if (strcmp (dirname, dirname_checks[i].dirname) != 0)
429 g_print ("\nfailed for \"%s\"==\"%s\" (returned: \"%s\")\n",
430 dirname_checks[i].filename,
431 dirname_checks[i].dirname,
433 n_dirname_checks = 0;
437 if (n_dirname_checks)
440 g_print ("checking g_path_skip_root()...");
441 for (i = 0; i < n_skip_root_checks; i++)
445 skipped = g_path_skip_root (skip_root_checks[i].filename);
446 if ((skipped && !skip_root_checks[i].without_root) ||
447 (!skipped && skip_root_checks[i].without_root) ||
448 ((skipped && skip_root_checks[i].without_root) &&
449 strcmp (skipped, skip_root_checks[i].without_root)))
451 g_print ("\nfailed for \"%s\"==\"%s\" (returned: \"%s\")\n",
452 skip_root_checks[i].filename,
453 (skip_root_checks[i].without_root ?
454 skip_root_checks[i].without_root : "<NULL>"),
455 (skipped ? skipped : "<NULL>"));
456 n_skip_root_checks = 0;
459 if (n_skip_root_checks)
462 g_print ("checking doubly linked lists...");
465 for (i = 0; i < 10; i++)
466 list = g_list_append (list, &nums[i]);
467 list = g_list_reverse (list);
469 for (i = 0; i < 10; i++)
471 t = g_list_nth (list, i);
472 if (*((gint*) t->data) != (9 - i))
473 g_error ("Regular insert failed");
476 for (i = 0; i < 10; i++)
477 if(g_list_position(list, g_list_nth (list, i)) != i)
478 g_error("g_list_position does not seem to be the inverse of g_list_nth\n");
483 for (i = 0; i < 10; i++)
484 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_one);
488 g_list_foreach (list, my_list_print, NULL);
491 for (i = 0; i < 10; i++)
493 t = g_list_nth (list, i);
494 if (*((gint*) t->data) != i)
495 g_error ("Sorted insert failed");
501 for (i = 0; i < 10; i++)
502 list = g_list_insert_sorted (list, &morenums[i], my_list_compare_two);
506 g_list_foreach (list, my_list_print, NULL);
509 for (i = 0; i < 10; i++)
511 t = g_list_nth (list, i);
512 if (*((gint*) t->data) != (9 - i))
513 g_error ("Sorted insert failed");
519 for (i = 0; i < 10; i++)
520 list = g_list_prepend (list, &morenums[i]);
522 list = g_list_sort (list, my_list_compare_two);
526 g_list_foreach (list, my_list_print, NULL);
529 for (i = 0; i < 10; i++)
531 t = g_list_nth (list, i);
532 if (*((gint*) t->data) != (9 - i))
533 g_error ("Merge sort failed");
541 g_print ("checking singly linked lists...");
544 for (i = 0; i < 10; i++)
545 slist = g_slist_append (slist, &nums[i]);
546 slist = g_slist_reverse (slist);
548 for (i = 0; i < 10; i++)
550 st = g_slist_nth (slist, i);
551 if (*((gint*) st->data) != (9 - i))
555 g_slist_free (slist);
558 for (i = 0; i < 10; i++)
559 slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_one);
563 g_slist_foreach (slist, my_list_print, NULL);
566 for (i = 0; i < 10; i++)
568 st = g_slist_nth (slist, i);
569 if (*((gint*) st->data) != i)
570 g_error ("Sorted insert failed");
576 for (i = 0; i < 10; i++)
577 slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_two);
581 g_slist_foreach (slist, my_list_print, NULL);
584 for (i = 0; i < 10; i++)
586 st = g_slist_nth (slist, i);
587 if (*((gint*) st->data) != (9 - i))
588 g_error("Sorted insert failed");
594 for (i = 0; i < 10; i++)
595 slist = g_slist_prepend (slist, &morenums[i]);
597 slist = g_slist_sort (slist, my_list_compare_two);
601 g_slist_foreach (slist, my_list_print, NULL);
604 for (i = 0; i < 10; i++)
606 st = g_slist_nth (slist, i);
607 if (*((gint*) st->data) != (9 - i))
608 g_error("Sorted insert failed");
616 g_print ("checking binary trees...\n");
618 tree = g_tree_new (my_compare);
620 for (j = 0; j < 10; j++, i++)
623 g_tree_insert (tree, &chars[i], &chars[i]);
625 for (j = 0; j < 26; j++, i++)
628 g_tree_insert (tree, &chars[i], &chars[i]);
630 for (j = 0; j < 26; j++, i++)
633 g_tree_insert (tree, &chars[i], &chars[i]);
636 g_print ("tree height: %d\n", g_tree_height (tree));
637 g_print ("tree nnodes: %d\n", g_tree_nnodes (tree));
640 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);
643 for (i = 0; i < 10; i++)
644 g_tree_remove (tree, &chars[i]);
646 g_print ("tree height: %d\n", g_tree_height (tree));
647 g_print ("tree nnodes: %d\n", g_tree_nnodes (tree));
650 g_tree_traverse (tree, my_traverse, G_IN_ORDER, NULL);
656 /* check n-way trees */
659 g_print ("checking mem chunks...");
661 mem_chunk = g_mem_chunk_new ("test mem chunk", 50, 100, G_ALLOC_AND_FREE);
663 for (i = 0; i < 10000; i++)
665 mem[i] = g_chunk_new (gchar, mem_chunk);
667 for (j = 0; j < 50; j++)
671 for (i = 0; i < 10000; i++)
673 g_mem_chunk_free (mem_chunk, mem[i]);
679 g_print ("checking hash tables...");
681 hash_table = g_hash_table_new (my_hash, my_hash_equal);
682 for (i = 0; i < 10000; i++)
685 g_hash_table_insert (hash_table, &array[i], &array[i]);
687 g_hash_table_foreach (hash_table, my_hash_callback, NULL);
689 for (i = 0; i < 10000; i++)
693 for (i = 0; i < 10000; i++)
694 g_hash_table_remove (hash_table, &array[i]);
696 for (i = 0; i < 10000; i++)
699 g_hash_table_insert (hash_table, &array[i], &array[i]);
702 if (g_hash_table_foreach_remove (hash_table, my_hash_callback_remove, NULL) != 5000 ||
703 g_hash_table_size (hash_table) != 5000)
706 g_hash_table_foreach (hash_table, my_hash_callback_remove_test, NULL);
709 g_hash_table_destroy (hash_table);
714 g_print ("checking string chunks...");
716 string_chunk = g_string_chunk_new (1024);
718 for (i = 0; i < 100000; i ++)
720 tmp_string = g_string_chunk_insert (string_chunk, "hi pete");
722 if (strcmp ("hi pete", tmp_string) != 0)
723 g_error ("string chunks are broken.\n");
726 tmp_string_2 = g_string_chunk_insert_const (string_chunk, tmp_string);
728 g_assert (tmp_string_2 != tmp_string &&
729 strcmp(tmp_string_2, tmp_string) == 0);
731 tmp_string = g_string_chunk_insert_const (string_chunk, tmp_string);
733 g_assert (tmp_string_2 == tmp_string);
735 g_string_chunk_free (string_chunk);
740 g_print ("checking arrays...");
742 garray = g_array_new (FALSE, FALSE, sizeof (gint));
743 for (i = 0; i < 10000; i++)
744 g_array_append_val (garray, i);
746 for (i = 0; i < 10000; i++)
747 if (g_array_index (garray, gint, i) != i)
748 g_print ("uh oh: %d ( %d )\n", g_array_index (garray, gint, i), i);
750 g_array_free (garray, TRUE);
752 garray = g_array_new (FALSE, FALSE, sizeof (gint));
753 for (i = 0; i < 100; i++)
754 g_array_prepend_val (garray, i);
756 for (i = 0; i < 100; i++)
757 if (g_array_index (garray, gint, i) != (100 - i - 1))
758 g_print ("uh oh: %d ( %d )\n", g_array_index (garray, gint, i), 100 - i - 1);
760 g_array_free (garray, TRUE);
765 g_print ("checking strings...");
767 string1 = g_string_new ("hi pete!");
768 string2 = g_string_new ("");
770 g_assert (strcmp ("hi pete!", string1->str) == 0);
772 for (i = 0; i < 10000; i++)
773 g_string_append_c (string1, 'a'+(i%26));
776 /* MSVC, mingw32 and LCC use the same run-time C library, which doesn't like
777 the %10000.10000f format... */
778 g_string_sprintf (string2, "%s|%0100d|%s|%s|%0*d|%*.*f|%10000.10000f",
779 "this pete guy sure is a wuss, like he's the number ",
781 " wuss. everyone agrees.\n",
783 10, 666, 15, 15, 666.666666666, 666.666666666);
785 g_string_sprintf (string2, "%s|%0100d|%s|%s|%0*d|%*.*f|%100.100f",
786 "this pete guy sure is a wuss, like he's the number ",
788 " wuss. everyone agrees.\n",
790 10, 666, 15, 15, 666.666666666, 666.666666666);
793 g_print ("string2 length = %d...\n", string2->len);
794 string2->str[70] = '\0';
795 g_print ("first 70 chars:\n%s\n", string2->str);
796 string2->str[141] = '\0';
797 g_print ("next 70 chars:\n%s\n", string2->str+71);
798 string2->str[212] = '\0';
799 g_print ("and next 70:\n%s\n", string2->str+142);
800 g_print ("last 70 chars:\n%s\n", string2->str+string2->len - 70);
802 g_string_free (string1, TRUE);
803 g_string_free (string2, TRUE);
806 string1 = g_string_new ("firsthalf");
807 g_string_append (string1, "lasthalf");
808 g_assert (strcmp (string1->str, "firsthalflasthalf") == 0);
809 g_string_free (string1, TRUE);
813 string1 = g_string_new ("firsthalf");
814 g_string_append_len (string1, "lasthalfjunkjunk", strlen ("lasthalf"));
815 g_assert (strcmp (string1->str, "firsthalflasthalf") == 0);
816 g_string_free (string1, TRUE);
819 string1 = g_string_new ("lasthalf");
820 g_string_prepend (string1, "firsthalf");
821 g_assert (strcmp (string1->str, "firsthalflasthalf") == 0);
822 g_string_free (string1, TRUE);
825 string1 = g_string_new ("lasthalf");
826 g_string_prepend_len (string1, "firsthalfjunkjunk", strlen ("firsthalf"));
827 g_assert (strcmp (string1->str, "firsthalflasthalf") == 0);
828 g_string_free (string1, TRUE);
831 string1 = g_string_new ("firstlast");
832 g_string_insert (string1, 5, "middle");
833 g_assert (strcmp (string1->str, "firstmiddlelast") == 0);
834 g_string_free (string1, TRUE);
836 /* insert with pos == end of the string */
837 string1 = g_string_new ("firstmiddle");
838 g_string_insert (string1, strlen ("firstmiddle"), "last");
839 g_assert (strcmp (string1->str, "firstmiddlelast") == 0);
840 g_string_free (string1, TRUE);
844 string1 = g_string_new ("firstlast");
845 g_string_insert_len (string1, 5, "middlejunkjunk", strlen ("middle"));
846 g_assert (strcmp (string1->str, "firstmiddlelast") == 0);
847 g_string_free (string1, TRUE);
849 /* insert_len with magic -1 pos for append */
850 string1 = g_string_new ("first");
851 g_string_insert_len (string1, -1, "lastjunkjunk", strlen ("last"));
852 g_assert (strcmp (string1->str, "firstlast") == 0);
853 g_string_free (string1, TRUE);
855 /* insert_len with magic -1 len for strlen-the-string */
856 string1 = g_string_new ("first");
857 g_string_insert_len (string1, 5, "last", -1);
858 g_assert (strcmp (string1->str, "firstlast") == 0);
859 g_string_free (string1, TRUE);
864 string1 = g_string_new ("test");
865 string2 = g_string_new ("te");
866 g_assert (! g_string_equal(string1, string2));
867 g_string_append (string2, "st");
868 g_assert (g_string_equal(string1, string2));
869 g_string_free (string1, TRUE);
870 g_string_free (string2, TRUE);
872 /* Check handling of embedded ASCII 0 (NUL) characters in GString. */
873 string1 = g_string_new ("fiddle");
874 string2 = g_string_new ("fiddle");
875 g_assert (g_string_equal(string1, string2));
876 g_string_append_c(string1, '\0');
877 g_assert (! g_string_equal(string1, string2));
878 g_string_append_c(string2, '\0');
879 g_assert (g_string_equal(string1, string2));
880 g_string_append_c(string1, 'x');
881 g_string_append_c(string2, 'y');
882 g_assert (! g_string_equal(string1, string2));
883 g_assert (string1->len == 8);
884 g_string_append(string1, "yzzy");
885 g_assert (string1->len == 12);
886 g_assert ( memcmp(string1->str, "fiddle\0xyzzy", 13) == 0);
887 g_string_insert(string1, 1, "QED");
888 g_assert ( memcmp(string1->str, "fQEDiddle\0xyzzy", 16) == 0);
889 g_string_free (string1, TRUE);
890 g_string_free (string2, TRUE);
892 g_print ("test positional printf formats (not supported): ");
893 string = g_strdup_printf ("%.*s%s", 5, "a", "b");
894 tmp_string = g_strdup_printf ("%2$*1$s", 5, "c");
895 g_print ("%s%s\n", string, tmp_string);
899 g_print ("checking timers...\n");
901 timer = g_timer_new ();
902 g_print (" spinning for 3 seconds...\n");
904 g_timer_start (timer);
905 while (g_timer_elapsed (timer, NULL) < 3)
908 g_timer_stop (timer);
909 g_timer_destroy (timer);
913 g_print ("checking g_strcasecmp...");
914 g_assert (g_strcasecmp ("FroboZZ", "frobozz") == 0);
915 g_assert (g_strcasecmp ("frobozz", "frobozz") == 0);
916 g_assert (g_strcasecmp ("frobozz", "FROBOZZ") == 0);
917 g_assert (g_strcasecmp ("FROBOZZ", "froboz") != 0);
918 g_assert (g_strcasecmp ("", "") == 0);
919 g_assert (g_strcasecmp ("!#%&/()", "!#%&/()") == 0);
920 g_assert (g_strcasecmp ("a", "b") < 0);
921 g_assert (g_strcasecmp ("a", "B") < 0);
922 g_assert (g_strcasecmp ("A", "b") < 0);
923 g_assert (g_strcasecmp ("A", "B") < 0);
924 g_assert (g_strcasecmp ("b", "a") > 0);
925 g_assert (g_strcasecmp ("b", "A") > 0);
926 g_assert (g_strcasecmp ("B", "a") > 0);
927 g_assert (g_strcasecmp ("B", "A") > 0);
931 g_print ("checking g_strdup...");
932 g_assert(g_strdup(NULL) == NULL);
933 string = g_strdup(GLIB_TEST_STRING);
934 g_assert(string != NULL);
935 g_assert(strcmp(string, GLIB_TEST_STRING) == 0);
940 g_print ("checking g_strconcat...");
941 string = g_strconcat(GLIB_TEST_STRING, NULL);
942 g_assert(string != NULL);
943 g_assert(strcmp(string, GLIB_TEST_STRING) == 0);
945 string = g_strconcat(GLIB_TEST_STRING, GLIB_TEST_STRING,
946 GLIB_TEST_STRING, NULL);
947 g_assert(string != NULL);
948 g_assert(strcmp(string, GLIB_TEST_STRING GLIB_TEST_STRING
949 GLIB_TEST_STRING) == 0);
954 g_print("checking g_strlcpy/g_strlcat...");
955 /* The following is a torture test for strlcpy/strlcat, with lots of
956 * checking; normal users wouldn't use them this way!
958 string = g_malloc (6);
959 *(string + 5) = 'Z'; /* guard value, shouldn't change during test */
961 g_assert (g_strlcpy(string, "" , 5) == 0);
962 g_assert ( *string == '\0' );
964 g_assert (g_strlcpy(string, "abc" , 5) == 3);
965 g_assert ( *(string + 3) == '\0' );
966 g_assert (g_str_equal(string, "abc"));
967 g_assert (g_strlcpy(string, "abcd" , 5) == 4);
968 g_assert ( *(string + 4) == '\0' );
969 g_assert ( *(string + 5) == 'Z' );
970 g_assert (g_str_equal(string, "abcd"));
971 g_assert (g_strlcpy(string, "abcde" , 5) == 5);
972 g_assert ( *(string + 4) == '\0' );
973 g_assert ( *(string + 5) == 'Z' );
974 g_assert (g_str_equal(string, "abcd"));
975 g_assert (g_strlcpy(string, "abcdef" , 5) == 6);
976 g_assert ( *(string + 4) == '\0' );
977 g_assert ( *(string + 5) == 'Z' );
978 g_assert (g_str_equal(string, "abcd"));
981 g_assert (g_strlcpy(string, "Hello" , 0) == 5);
982 g_assert (*string == 'Y');
984 g_assert (g_strlcat(string, "123" , 5) == 3);
985 g_assert ( *(string + 3) == '\0' );
986 g_assert (g_str_equal(string, "123"));
987 g_assert (g_strlcat(string, "" , 5) == 3);
988 g_assert ( *(string + 3) == '\0' );
989 g_assert (g_str_equal(string, "123"));
990 g_assert (g_strlcat(string, "4", 5) == 4);
991 g_assert (g_str_equal(string, "1234"));
992 g_assert (g_strlcat(string, "5", 5) == 5);
993 g_assert ( *(string + 4) == '\0' );
994 g_assert (g_str_equal(string, "1234"));
995 g_assert ( *(string + 5) == 'Z' );
998 g_assert (g_strlcat(string, "123" , 0) == 3);
999 g_assert (*string == 'Y');
1001 /* A few more tests, demonstrating more "normal" use */
1002 g_assert (g_strlcpy(string, "hi", 5) == 2);
1003 g_assert (g_str_equal(string, "hi"));
1004 g_assert (g_strlcat(string, "t", 5) == 3);
1005 g_assert (g_str_equal(string, "hit"));
1011 g_print ("checking g_strdup_printf...");
1012 string = g_strdup_printf ("%05d %-5s", 21, "test");
1013 g_assert (string != NULL);
1014 g_assert (strcmp(string, "00021 test ") == 0);
1019 /* g_debug (argv[0]); */
1021 /* Relation tests */
1023 g_print ("checking relations...");
1025 relation = g_relation_new (2);
1027 g_relation_index (relation, 0, g_int_hash, g_int_equal);
1028 g_relation_index (relation, 1, g_int_hash, g_int_equal);
1030 for (i = 0; i < 1024; i += 1)
1033 for (i = 1; i < 1023; i += 1)
1035 g_relation_insert (relation, data + i, data + i + 1);
1036 g_relation_insert (relation, data + i, data + i - 1);
1039 for (i = 2; i < 1022; i += 1)
1041 g_assert (! g_relation_exists (relation, data + i, data + i));
1042 g_assert (! g_relation_exists (relation, data + i, data + i + 2));
1043 g_assert (! g_relation_exists (relation, data + i, data + i - 2));
1046 for (i = 1; i < 1023; i += 1)
1048 g_assert (g_relation_exists (relation, data + i, data + i + 1));
1049 g_assert (g_relation_exists (relation, data + i, data + i - 1));
1052 for (i = 2; i < 1022; i += 1)
1054 g_assert (g_relation_count (relation, data + i, 0) == 2);
1055 g_assert (g_relation_count (relation, data + i, 1) == 2);
1058 g_assert (g_relation_count (relation, data, 0) == 0);
1060 g_assert (g_relation_count (relation, data + 42, 0) == 2);
1061 g_assert (g_relation_count (relation, data + 43, 1) == 2);
1062 g_assert (g_relation_count (relation, data + 41, 1) == 2);
1063 g_relation_delete (relation, data + 42, 0);
1064 g_assert (g_relation_count (relation, data + 42, 0) == 0);
1065 g_assert (g_relation_count (relation, data + 43, 1) == 1);
1066 g_assert (g_relation_count (relation, data + 41, 1) == 1);
1068 tuples = g_relation_select (relation, data + 200, 0);
1070 g_assert (tuples->len == 2);
1073 for (i = 0; i < tuples->len; i += 1)
1076 *(gint*) g_tuples_index (tuples, i, 0),
1077 *(gint*) g_tuples_index (tuples, i, 1));
1081 g_assert (g_relation_exists (relation, data + 300, data + 301));
1082 g_relation_delete (relation, data + 300, 0);
1083 g_assert (!g_relation_exists (relation, data + 300, data + 301));
1085 g_tuples_destroy (tuples);
1087 g_relation_destroy (relation);
1093 g_print ("checking pointer arrays...");
1095 gparray = g_ptr_array_new ();
1096 for (i = 0; i < 10000; i++)
1097 g_ptr_array_add (gparray, GINT_TO_POINTER (i));
1099 for (i = 0; i < 10000; i++)
1100 if (g_ptr_array_index (gparray, i) != GINT_TO_POINTER (i))
1101 g_print ("array fails: %p ( %p )\n", g_ptr_array_index (gparray, i), GINT_TO_POINTER (i));
1103 g_ptr_array_free (gparray, TRUE);
1108 g_print ("checking byte arrays...");
1110 gbarray = g_byte_array_new ();
1111 for (i = 0; i < 10000; i++)
1112 g_byte_array_append (gbarray, (guint8*) "abcd", 4);
1114 for (i = 0; i < 10000; i++)
1116 g_assert (gbarray->data[4*i] == 'a');
1117 g_assert (gbarray->data[4*i+1] == 'b');
1118 g_assert (gbarray->data[4*i+2] == 'c');
1119 g_assert (gbarray->data[4*i+3] == 'd');
1122 g_byte_array_free (gbarray, TRUE);
1125 g_printerr ("g_log tests:");
1126 g_warning ("harmless warning with parameters: %d %s %#x", 42, "Boo", 12345);
1127 g_message ("the next warning is a test:");
1131 g_print ("checking endian macros (host is ");
1132 #if G_BYTE_ORDER == G_BIG_ENDIAN
1133 g_print ("big endian)...");
1135 g_print ("little endian)...");
1137 g_assert (GUINT16_SWAP_LE_BE (gu16t1) == gu16t2);
1138 g_assert (GUINT32_SWAP_LE_BE (gu32t1) == gu32t2);
1139 #ifdef G_HAVE_GINT64
1140 g_assert (GUINT64_SWAP_LE_BE (gu64t1) == gu64t2);
1146 g_print ("current locale: %s\n", g_win32_getlocale ());
1149 g_print ("checking file functions...\n");
1151 strcpy (template, "foobar");
1152 fd = g_mkstemp (template);
1154 g_print ("g_mkstemp works even if template doesn't end in XXXXXX\n");
1156 strcpy (template, "fooXXXXXX");
1157 fd = g_mkstemp (template);
1159 g_print ("g_mkstemp didn't work for template %s\n", template);
1160 i = write (fd, hello, hellolen);
1162 g_print ("write() failed: %s\n", g_strerror (errno));
1163 else if (i != hellolen)
1164 g_print ("write() should have written %d bytes, wrote %d\n", hellolen, i);
1167 i = read (fd, chars, sizeof (chars));
1169 g_print ("read() failed: %s\n", g_strerror (errno));
1170 else if (i != hellolen)
1171 g_print ("read() should have read %d bytes, got %d\n", hellolen, i);
1174 if (strcmp (chars, hello) != 0)
1175 g_print ("wrote '%s', but got '%s'\n", hello, chars);
1180 strcpy (template, "zap" G_DIR_SEPARATOR_S "barXXXXXX");
1181 fd = g_file_open_tmp (template, &name_used, &error);
1183 g_print ("g_file_open_tmp works even if template contains '%s'\n",
1186 g_print ("g_file_open_tmp correctly returns error: %s\n",
1189 g_clear_error (&error);
1191 strcpy (template, "zapXXXXXX");
1192 fd = g_file_open_tmp (template, &name_used, &error);
1194 g_print ("g_file_open_tmp didn't work for template '%s': %s\n",
1195 template, error->message);
1197 g_print ("g_file_open_tmp for template '%s' used name '%s'\n",
1198 template, name_used);
1200 g_clear_error (&error);
1203 fd = g_file_open_tmp (NULL, &name_used, &error);
1205 g_print ("g_file_open_tmp didn't work for a NULL template: %s\n",
1208 g_print ("g_file_open_tmp for NULL template used name '%s'\n",
1211 g_clear_error (&error);