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/.
31 #ifdef GLIB_COMPILATION
32 #undef GLIB_COMPILATION
46 #include <io.h> /* For read(), write() etc */
49 static int array
[10000];
50 static gboolean failed
= FALSE
;
52 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
55 g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
57 g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
60 g_print ("."); fflush (stdout); \
63 #define C2P(c) ((gpointer) ((long) (c)))
64 #define P2C(p) ((gchar) ((long) (p)))
66 #define GLIB_TEST_STRING "el dorado "
67 #define GLIB_TEST_STRING_5 "el do"
70 node_build_string (GNode
*node
,
77 c
[0] = P2C (node
->data
);
79 string
= g_strconcat (*p
? *p
: "", c
, NULL
);
96 gchar
*tstring
, *cstring
;
98 g_print ("checking n-way trees: ");
101 root
= g_node_new (C2P ('A'));
102 TEST (NULL
, g_node_depth (root
) == 1 && g_node_max_height (root
) == 1);
104 node_B
= g_node_new (C2P ('B'));
105 g_node_append (root
, node_B
);
106 TEST (NULL
, root
->children
== node_B
);
108 g_node_append_data (node_B
, C2P ('E'));
109 g_node_prepend_data (node_B
, C2P ('C'));
110 g_node_insert (node_B
, 1, g_node_new (C2P ('D')));
112 node_F
= g_node_new (C2P ('F'));
113 g_node_append (root
, node_F
);
114 TEST (NULL
, root
->children
->next
== node_F
);
116 node_G
= g_node_new (C2P ('G'));
117 g_node_append (node_F
, node_G
);
118 node_J
= g_node_new (C2P ('J'));
119 g_node_prepend (node_G
, node_J
);
120 g_node_insert (node_G
, 42, g_node_new (C2P ('K')));
121 g_node_insert_data (node_G
, 0, C2P ('H'));
122 g_node_insert (node_G
, 1, g_node_new (C2P ('I')));
124 TEST (NULL
, g_node_depth (root
) == 1);
125 TEST (NULL
, g_node_max_height (root
) == 4);
126 TEST (NULL
, g_node_depth (node_G
->children
->next
) == 4);
127 TEST (NULL
, g_node_n_nodes (root
, G_TRAVERSE_LEAFS
) == 7);
128 TEST (NULL
, g_node_n_nodes (root
, G_TRAVERSE_NON_LEAFS
) == 4);
129 TEST (NULL
, g_node_n_nodes (root
, G_TRAVERSE_ALL
) == 11);
130 TEST (NULL
, g_node_max_height (node_F
) == 3);
131 TEST (NULL
, g_node_n_children (node_G
) == 4);
132 TEST (NULL
, g_node_find_child (root
, G_TRAVERSE_ALL
, C2P ('F')) == node_F
);
133 TEST (NULL
, g_node_find (root
, G_LEVEL_ORDER
, G_TRAVERSE_NON_LEAFS
, C2P ('I')) == NULL
);
134 TEST (NULL
, g_node_find (root
, G_IN_ORDER
, G_TRAVERSE_LEAFS
, C2P ('J')) == node_J
);
136 for (i
= 0; i
< g_node_n_children (node_B
); i
++)
138 node
= g_node_nth_child (node_B
, i
);
139 TEST (NULL
, P2C (node
->data
) == ('C' + i
));
142 for (i
= 0; i
< g_node_n_children (node_G
); i
++)
143 TEST (NULL
, g_node_child_position (node_G
, g_node_nth_child (node_G
, i
)) == i
);
153 * for in-order traversal, 'G' is considered to be the "left"
154 * child of 'F', which will cause 'F' to be the last node visited.
158 g_node_traverse (root
, G_PRE_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &tstring
);
159 TEST (tstring
, strcmp (tstring
, "ABCDEFGHIJK") == 0);
160 g_free (tstring
); tstring
= NULL
;
161 g_node_traverse (root
, G_POST_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &tstring
);
162 TEST (tstring
, strcmp (tstring
, "CDEBHIJKGFA") == 0);
163 g_free (tstring
); tstring
= NULL
;
164 g_node_traverse (root
, G_IN_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &tstring
);
165 TEST (tstring
, strcmp (tstring
, "CBDEAHGIJKF") == 0);
166 g_free (tstring
); tstring
= NULL
;
167 g_node_traverse (root
, G_LEVEL_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &tstring
);
168 TEST (tstring
, strcmp (tstring
, "ABFCDEGHIJK") == 0);
169 g_free (tstring
); tstring
= NULL
;
171 g_node_traverse (root
, G_LEVEL_ORDER
, G_TRAVERSE_LEAFS
, -1, node_build_string
, &tstring
);
172 TEST (tstring
, strcmp (tstring
, "CDEHIJK") == 0);
173 g_free (tstring
); tstring
= NULL
;
174 g_node_traverse (root
, G_PRE_ORDER
, G_TRAVERSE_NON_LEAFS
, -1, node_build_string
, &tstring
);
175 TEST (tstring
, strcmp (tstring
, "ABFG") == 0);
176 g_free (tstring
); tstring
= NULL
;
178 g_node_reverse_children (node_B
);
179 g_node_reverse_children (node_G
);
181 g_node_traverse (root
, G_LEVEL_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &tstring
);
182 TEST (tstring
, strcmp (tstring
, "ABFEDCGKJIH") == 0);
183 g_free (tstring
); tstring
= NULL
;
186 node
= g_node_copy (root
);
187 TEST (NULL
, g_node_n_nodes (root
, G_TRAVERSE_ALL
) == g_node_n_nodes (node
, G_TRAVERSE_ALL
));
188 TEST (NULL
, g_node_max_height (root
) == g_node_max_height (node
));
189 g_node_traverse (root
, G_IN_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &tstring
);
190 g_node_traverse (node
, G_IN_ORDER
, G_TRAVERSE_ALL
, -1, node_build_string
, &cstring
);
191 TEST (cstring
, strcmp (tstring
, cstring
) == 0);
192 g_free (tstring
); tstring
= NULL
;
193 g_free (cstring
); cstring
= NULL
;
194 g_node_destroy (node
);
196 g_node_destroy (root
);
198 /* allocation tests */
200 root
= g_node_new (NULL
);
203 for (i
= 0; i
< 2048; i
++)
205 g_node_append (node
, g_node_new (NULL
));
207 node
= node
->children
->next
;
209 TEST (NULL
, g_node_max_height (root
) > 100);
210 TEST (NULL
, g_node_n_nodes (root
, G_TRAVERSE_ALL
) == 1 + 2048);
212 g_node_destroy (root
);
219 my_hash_callback_remove (gpointer key
,
232 my_hash_callback_remove_test (gpointer key
,
243 my_hash_callback (gpointer key
,
252 my_hash (gconstpointer key
)
254 return (guint
) *((const gint
*) key
);
258 my_hash_equal (gconstpointer a
,
261 return *((const gint
*) a
) == *((const gint
*) b
);
265 my_list_compare_one (gconstpointer a
, gconstpointer b
)
267 gint one
= *((const gint
*)a
);
268 gint two
= *((const gint
*)b
);
273 my_list_compare_two (gconstpointer a
, gconstpointer b
)
275 gint one
= *((const gint
*)a
);
276 gint two
= *((const gint
*)b
);
281 my_list_print (gpointer a, gpointer b)
283 gint three = *((gint*)a);
284 g_print("%d", three);
288 my_compare (gconstpointer a
,
298 my_traverse (gpointer key
,
303 g_print ("%c ", *ch
);
313 GHashTable
*hash_table
;
314 GMemChunk
*mem_chunk
;
315 GStringChunk
*string_chunk
;
317 gint nums
[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
318 gint morenums
[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6};
321 gchar
*mem
[10000], *tmp_string
= NULL
, *tmp_string_2
;
326 GString
*string1
, *string2
;
335 } dirname_checks
[] = {
347 { ".\\\\\\\\", "." },
349 { "..\\\\\\\\", ".." },
351 { "a\\b\\", "a\\b" },
355 { "//server/share///x", "//server/share" },
361 guint n_dirname_checks
= G_N_ELEMENTS (dirname_checks
);
366 } skip_root_checks
[] = {
376 { "\\\\server\\foo", "" },
377 { "\\\\server\\foo\\bar", "bar" },
381 { "//server/share///x", "//x" },
386 guint n_skip_root_checks
= G_N_ELEMENTS (skip_root_checks
);
388 guint16 gu16t1
= 0x44afU
, gu16t2
= 0xaf44U
;
389 guint32 gu32t1
= 0x02a7f109U
, gu32t2
= 0x09f1a702U
;
391 guint64 gu64t1
= G_GINT64_CONSTANT(0x1d636b02300a7aa7U
),
392 gu64t2
= G_GINT64_CONSTANT(0xa77a0a30026b631dU
);
394 const char hello
[] = "Hello, World";
395 const int hellolen
= sizeof (hello
) - 1;
401 gchar
*glib_dll
= g_strdup_printf ("glib-%d.%d.dll",
406 gchar
*glib_dll
= g_strdup_printf ("cygglib-%d.%d.dll",
411 g_print ("TestGLib v%u.%u.%u (i:%u b:%u)\n",
418 string
= g_get_current_dir ();
419 g_print ("cwd: %s\n", string
);
421 g_print ("user: %s\n", g_get_user_name ());
422 g_print ("real: %s\n", g_get_real_name ());
423 g_print ("home: %s\n", g_get_home_dir ());
424 g_print ("tmp-dir: %s\n", g_get_tmp_dir ());
427 g_print ("checking size of gint8: %d", (int)sizeof (gint8
));
428 TEST (NULL
, sizeof (gint8
) == 1);
429 g_print ("\nchecking size of gint16: %d", (int)sizeof (gint16
));
430 TEST (NULL
, sizeof (gint16
) == 2);
431 g_print ("\nchecking size of gint32: %d", (int)sizeof (gint32
));
432 TEST (NULL
, sizeof (gint32
) == 4);
433 g_print ("\nchecking size of gsize: %d", (int)sizeof (gsize
));
435 g_print ("\nchecking size of gint64: %d", (int)sizeof (gint64
));
436 TEST (NULL
, sizeof (gint64
) == 8);
437 #endif /* G_HAVE_GINT64 */
440 g_print ("checking g_path_get_dirname()...");
441 for (i
= 0; i
< n_dirname_checks
; i
++)
445 dirname
= g_path_get_dirname (dirname_checks
[i
].filename
);
446 if (strcmp (dirname
, dirname_checks
[i
].dirname
) != 0)
448 g_print ("\nfailed for \"%s\"==\"%s\" (returned: \"%s\")\n",
449 dirname_checks
[i
].filename
,
450 dirname_checks
[i
].dirname
,
452 n_dirname_checks
= 0;
456 if (n_dirname_checks
)
459 g_print ("checking g_path_skip_root()...");
460 for (i
= 0; i
< n_skip_root_checks
; i
++)
462 const gchar
*skipped
;
464 skipped
= g_path_skip_root (skip_root_checks
[i
].filename
);
465 if ((skipped
&& !skip_root_checks
[i
].without_root
) ||
466 (!skipped
&& skip_root_checks
[i
].without_root
) ||
467 ((skipped
&& skip_root_checks
[i
].without_root
) &&
468 strcmp (skipped
, skip_root_checks
[i
].without_root
)))
470 g_print ("\nfailed for \"%s\"==\"%s\" (returned: \"%s\")\n",
471 skip_root_checks
[i
].filename
,
472 (skip_root_checks
[i
].without_root
?
473 skip_root_checks
[i
].without_root
: "<NULL>"),
474 (skipped
? skipped
: "<NULL>"));
475 n_skip_root_checks
= 0;
478 if (n_skip_root_checks
)
481 g_print ("checking doubly linked lists...");
484 for (i
= 0; i
< 10; i
++)
485 list
= g_list_append (list
, &nums
[i
]);
486 list
= g_list_reverse (list
);
488 for (i
= 0; i
< 10; i
++)
490 t
= g_list_nth (list
, i
);
491 if (*((gint
*) t
->data
) != (9 - i
))
492 g_error ("Regular insert failed");
495 for (i
= 0; i
< 10; i
++)
496 if(g_list_position(list
, g_list_nth (list
, i
)) != i
)
497 g_error("g_list_position does not seem to be the inverse of g_list_nth\n");
502 for (i
= 0; i
< 10; i
++)
503 list
= g_list_insert_sorted (list
, &morenums
[i
], my_list_compare_one
);
507 g_list_foreach (list, my_list_print, NULL);
510 for (i
= 0; i
< 10; i
++)
512 t
= g_list_nth (list
, i
);
513 if (*((gint
*) t
->data
) != i
)
514 g_error ("Sorted insert failed");
520 for (i
= 0; i
< 10; i
++)
521 list
= g_list_insert_sorted (list
, &morenums
[i
], my_list_compare_two
);
525 g_list_foreach (list, my_list_print, NULL);
528 for (i
= 0; i
< 10; i
++)
530 t
= g_list_nth (list
, i
);
531 if (*((gint
*) t
->data
) != (9 - i
))
532 g_error ("Sorted insert failed");
538 for (i
= 0; i
< 10; i
++)
539 list
= g_list_prepend (list
, &morenums
[i
]);
541 list
= g_list_sort (list
, my_list_compare_two
);
545 g_list_foreach (list, my_list_print, NULL);
548 for (i
= 0; i
< 10; i
++)
550 t
= g_list_nth (list
, i
);
551 if (*((gint
*) t
->data
) != (9 - i
))
552 g_error ("Merge sort failed");
560 g_print ("checking singly linked lists...");
563 for (i
= 0; i
< 10; i
++)
564 slist
= g_slist_append (slist
, &nums
[i
]);
565 slist
= g_slist_reverse (slist
);
567 for (i
= 0; i
< 10; i
++)
569 st
= g_slist_nth (slist
, i
);
570 if (*((gint
*) st
->data
) != (9 - i
))
574 g_slist_free (slist
);
577 for (i
= 0; i
< 10; i
++)
578 slist
= g_slist_insert_sorted (slist
, &morenums
[i
], my_list_compare_one
);
582 g_slist_foreach (slist, my_list_print, NULL);
585 for (i
= 0; i
< 10; i
++)
587 st
= g_slist_nth (slist
, i
);
588 if (*((gint
*) st
->data
) != i
)
589 g_error ("Sorted insert failed");
595 for (i
= 0; i
< 10; i
++)
596 slist
= g_slist_insert_sorted (slist
, &morenums
[i
], my_list_compare_two
);
600 g_slist_foreach (slist, my_list_print, NULL);
603 for (i
= 0; i
< 10; i
++)
605 st
= g_slist_nth (slist
, i
);
606 if (*((gint
*) st
->data
) != (9 - i
))
607 g_error("Sorted insert failed");
613 for (i
= 0; i
< 10; i
++)
614 slist
= g_slist_prepend (slist
, &morenums
[i
]);
616 slist
= g_slist_sort (slist
, my_list_compare_two
);
620 g_slist_foreach (slist, my_list_print, NULL);
623 for (i
= 0; i
< 10; i
++)
625 st
= g_slist_nth (slist
, i
);
626 if (*((gint
*) st
->data
) != (9 - i
))
627 g_error("Sorted insert failed");
635 g_print ("checking binary trees...\n");
637 tree
= g_tree_new (my_compare
);
639 for (j
= 0; j
< 10; j
++, i
++)
642 g_tree_insert (tree
, &chars
[i
], &chars
[i
]);
644 for (j
= 0; j
< 26; j
++, i
++)
647 g_tree_insert (tree
, &chars
[i
], &chars
[i
]);
649 for (j
= 0; j
< 26; j
++, i
++)
652 g_tree_insert (tree
, &chars
[i
], &chars
[i
]);
655 g_print ("tree height: %d\n", g_tree_height (tree
));
656 g_print ("tree nnodes: %d\n", g_tree_nnodes (tree
));
659 g_tree_traverse (tree
, my_traverse
, G_IN_ORDER
, NULL
);
662 for (i
= 0; i
< 10; i
++)
663 g_tree_remove (tree
, &chars
[i
]);
665 g_print ("tree height: %d\n", g_tree_height (tree
));
666 g_print ("tree nnodes: %d\n", g_tree_nnodes (tree
));
669 g_tree_traverse (tree
, my_traverse
, G_IN_ORDER
, NULL
);
675 /* check n-way trees */
678 g_print ("checking mem chunks...");
680 mem_chunk
= g_mem_chunk_new ("test mem chunk", 50, 100, G_ALLOC_AND_FREE
);
682 for (i
= 0; i
< 10000; i
++)
684 mem
[i
] = g_chunk_new (gchar
, mem_chunk
);
686 for (j
= 0; j
< 50; j
++)
690 for (i
= 0; i
< 10000; i
++)
692 g_mem_chunk_free (mem_chunk
, mem
[i
]);
698 g_print ("checking hash tables...");
700 hash_table
= g_hash_table_new (my_hash
, my_hash_equal
);
701 for (i
= 0; i
< 10000; i
++)
704 g_hash_table_insert (hash_table
, &array
[i
], &array
[i
]);
706 g_hash_table_foreach (hash_table
, my_hash_callback
, NULL
);
708 for (i
= 0; i
< 10000; i
++)
712 for (i
= 0; i
< 10000; i
++)
713 g_hash_table_remove (hash_table
, &array
[i
]);
715 for (i
= 0; i
< 10000; i
++)
718 g_hash_table_insert (hash_table
, &array
[i
], &array
[i
]);
721 if (g_hash_table_foreach_remove (hash_table
, my_hash_callback_remove
, NULL
) != 5000 ||
722 g_hash_table_size (hash_table
) != 5000)
725 g_hash_table_foreach (hash_table
, my_hash_callback_remove_test
, NULL
);
728 g_hash_table_destroy (hash_table
);
733 g_print ("checking string chunks...");
735 string_chunk
= g_string_chunk_new (1024);
737 for (i
= 0; i
< 100000; i
++)
739 tmp_string
= g_string_chunk_insert (string_chunk
, "hi pete");
741 if (strcmp ("hi pete", tmp_string
) != 0)
742 g_error ("string chunks are broken.\n");
745 tmp_string_2
= g_string_chunk_insert_const (string_chunk
, tmp_string
);
747 g_assert (tmp_string_2
!= tmp_string
&&
748 strcmp(tmp_string_2
, tmp_string
) == 0);
750 tmp_string
= g_string_chunk_insert_const (string_chunk
, tmp_string
);
752 g_assert (tmp_string_2
== tmp_string
);
754 g_string_chunk_free (string_chunk
);
759 g_print ("checking arrays...");
761 garray
= g_array_new (FALSE
, FALSE
, sizeof (gint
));
762 for (i
= 0; i
< 10000; i
++)
763 g_array_append_val (garray
, i
);
765 for (i
= 0; i
< 10000; i
++)
766 if (g_array_index (garray
, gint
, i
) != i
)
767 g_print ("uh oh: %d ( %d )\n", g_array_index (garray
, gint
, i
), i
);
769 g_array_free (garray
, TRUE
);
771 garray
= g_array_new (FALSE
, FALSE
, sizeof (gint
));
772 for (i
= 0; i
< 100; i
++)
773 g_array_prepend_val (garray
, i
);
775 for (i
= 0; i
< 100; i
++)
776 if (g_array_index (garray
, gint
, i
) != (100 - i
- 1))
777 g_print ("uh oh: %d ( %d )\n", g_array_index (garray
, gint
, i
), 100 - i
- 1);
779 g_array_free (garray
, TRUE
);
784 g_print ("checking strings...");
786 string1
= g_string_new ("hi pete!");
787 string2
= g_string_new ("");
789 g_assert (strcmp ("hi pete!", string1
->str
) == 0);
791 for (i
= 0; i
< 10000; i
++)
792 g_string_append_c (string1
, 'a'+(i
%26));
795 /* MSVC, mingw32 and LCC use the same run-time C library, which doesn't like
796 the %10000.10000f format... */
797 g_string_sprintf (string2
, "%s|%0100d|%s|%s|%0*d|%*.*f|%10000.10000f",
798 "this pete guy sure is a wuss, like he's the number ",
800 " wuss. everyone agrees.\n",
802 10, 666, 15, 15, 666.666666666, 666.666666666);
804 g_string_sprintf (string2
, "%s|%0100d|%s|%s|%0*d|%*.*f|%100.100f",
805 "this pete guy sure is a wuss, like he's the number ",
807 " wuss. everyone agrees.\n",
809 10, 666, 15, 15, 666.666666666, 666.666666666);
812 g_print ("string2 length = %d...\n", string2
->len
);
813 string2
->str
[70] = '\0';
814 g_print ("first 70 chars:\n%s\n", string2
->str
);
815 string2
->str
[141] = '\0';
816 g_print ("next 70 chars:\n%s\n", string2
->str
+71);
817 string2
->str
[212] = '\0';
818 g_print ("and next 70:\n%s\n", string2
->str
+142);
819 g_print ("last 70 chars:\n%s\n", string2
->str
+string2
->len
- 70);
821 g_string_free (string1
, TRUE
);
822 g_string_free (string2
, TRUE
);
825 string1
= g_string_new ("firsthalf");
826 g_string_append (string1
, "lasthalf");
827 g_assert (strcmp (string1
->str
, "firsthalflasthalf") == 0);
828 g_string_free (string1
, TRUE
);
832 string1
= g_string_new ("firsthalf");
833 g_string_append_len (string1
, "lasthalfjunkjunk", strlen ("lasthalf"));
834 g_assert (strcmp (string1
->str
, "firsthalflasthalf") == 0);
835 g_string_free (string1
, TRUE
);
838 string1
= g_string_new ("lasthalf");
839 g_string_prepend (string1
, "firsthalf");
840 g_assert (strcmp (string1
->str
, "firsthalflasthalf") == 0);
841 g_string_free (string1
, TRUE
);
844 string1
= g_string_new ("lasthalf");
845 g_string_prepend_len (string1
, "firsthalfjunkjunk", strlen ("firsthalf"));
846 g_assert (strcmp (string1
->str
, "firsthalflasthalf") == 0);
847 g_string_free (string1
, TRUE
);
850 string1
= g_string_new ("firstlast");
851 g_string_insert (string1
, 5, "middle");
852 g_assert (strcmp (string1
->str
, "firstmiddlelast") == 0);
853 g_string_free (string1
, TRUE
);
855 /* insert with pos == end of the string */
856 string1
= g_string_new ("firstmiddle");
857 g_string_insert (string1
, strlen ("firstmiddle"), "last");
858 g_assert (strcmp (string1
->str
, "firstmiddlelast") == 0);
859 g_string_free (string1
, TRUE
);
863 string1
= g_string_new ("firstlast");
864 g_string_insert_len (string1
, 5, "middlejunkjunk", strlen ("middle"));
865 g_assert (strcmp (string1
->str
, "firstmiddlelast") == 0);
866 g_string_free (string1
, TRUE
);
868 /* insert_len with magic -1 pos for append */
869 string1
= g_string_new ("first");
870 g_string_insert_len (string1
, -1, "lastjunkjunk", strlen ("last"));
871 g_assert (strcmp (string1
->str
, "firstlast") == 0);
872 g_string_free (string1
, TRUE
);
874 /* insert_len with magic -1 len for strlen-the-string */
875 string1
= g_string_new ("first");
876 g_string_insert_len (string1
, 5, "last", -1);
877 g_assert (strcmp (string1
->str
, "firstlast") == 0);
878 g_string_free (string1
, TRUE
);
883 string1
= g_string_new ("test");
884 string2
= g_string_new ("te");
885 g_assert (! g_string_equal(string1
, string2
));
886 g_string_append (string2
, "st");
887 g_assert (g_string_equal(string1
, string2
));
888 g_string_free (string1
, TRUE
);
889 g_string_free (string2
, TRUE
);
891 /* Check handling of embedded ASCII 0 (NUL) characters in GString. */
892 string1
= g_string_new ("fiddle");
893 string2
= g_string_new ("fiddle");
894 g_assert (g_string_equal(string1
, string2
));
895 g_string_append_c(string1
, '\0');
896 g_assert (! g_string_equal(string1
, string2
));
897 g_string_append_c(string2
, '\0');
898 g_assert (g_string_equal(string1
, string2
));
899 g_string_append_c(string1
, 'x');
900 g_string_append_c(string2
, 'y');
901 g_assert (! g_string_equal(string1
, string2
));
902 g_assert (string1
->len
== 8);
903 g_string_append(string1
, "yzzy");
904 g_assert (string1
->len
== 12);
905 g_assert ( memcmp(string1
->str
, "fiddle\0xyzzy", 13) == 0);
906 g_string_insert(string1
, 1, "QED");
907 g_assert ( memcmp(string1
->str
, "fQEDiddle\0xyzzy", 16) == 0);
908 g_string_free (string1
, TRUE
);
909 g_string_free (string2
, TRUE
);
911 g_print ("test positional printf formats (not supported): ");
912 string
= g_strdup_printf ("%.*s%s", 5, "a", "b");
913 tmp_string
= g_strdup_printf ("%2$*1$s", 5, "c");
914 g_print ("%s%s\n", string
, tmp_string
);
918 g_print ("checking timers...\n");
920 timer
= g_timer_new ();
921 g_print (" spinning for 3 seconds...\n");
923 g_timer_start (timer
);
924 while (g_timer_elapsed (timer
, NULL
) < 3)
927 g_timer_stop (timer
);
928 g_timer_destroy (timer
);
932 g_print ("checking g_strcasecmp...");
933 g_assert (g_strcasecmp ("FroboZZ", "frobozz") == 0);
934 g_assert (g_strcasecmp ("frobozz", "frobozz") == 0);
935 g_assert (g_strcasecmp ("frobozz", "FROBOZZ") == 0);
936 g_assert (g_strcasecmp ("FROBOZZ", "froboz") != 0);
937 g_assert (g_strcasecmp ("", "") == 0);
938 g_assert (g_strcasecmp ("!#%&/()", "!#%&/()") == 0);
939 g_assert (g_strcasecmp ("a", "b") < 0);
940 g_assert (g_strcasecmp ("a", "B") < 0);
941 g_assert (g_strcasecmp ("A", "b") < 0);
942 g_assert (g_strcasecmp ("A", "B") < 0);
943 g_assert (g_strcasecmp ("b", "a") > 0);
944 g_assert (g_strcasecmp ("b", "A") > 0);
945 g_assert (g_strcasecmp ("B", "a") > 0);
946 g_assert (g_strcasecmp ("B", "A") > 0);
950 g_print ("checking g_strdup...");
951 g_assert(g_strdup(NULL
) == NULL
);
952 string
= g_strdup(GLIB_TEST_STRING
);
953 g_assert(string
!= NULL
);
954 g_assert(strcmp(string
, GLIB_TEST_STRING
) == 0);
959 g_print ("checking g_strconcat...");
960 string
= g_strconcat(GLIB_TEST_STRING
, NULL
);
961 g_assert(string
!= NULL
);
962 g_assert(strcmp(string
, GLIB_TEST_STRING
) == 0);
964 string
= g_strconcat(GLIB_TEST_STRING
, GLIB_TEST_STRING
,
965 GLIB_TEST_STRING
, NULL
);
966 g_assert(string
!= NULL
);
967 g_assert(strcmp(string
, GLIB_TEST_STRING GLIB_TEST_STRING
968 GLIB_TEST_STRING
) == 0);
973 g_print("checking g_strlcpy/g_strlcat...");
974 /* The following is a torture test for strlcpy/strlcat, with lots of
975 * checking; normal users wouldn't use them this way!
977 string
= g_malloc (6);
978 *(string
+ 5) = 'Z'; /* guard value, shouldn't change during test */
980 g_assert (g_strlcpy(string
, "" , 5) == 0);
981 g_assert ( *string
== '\0' );
983 g_assert (g_strlcpy(string
, "abc" , 5) == 3);
984 g_assert ( *(string
+ 3) == '\0' );
985 g_assert (g_str_equal(string
, "abc"));
986 g_assert (g_strlcpy(string
, "abcd" , 5) == 4);
987 g_assert ( *(string
+ 4) == '\0' );
988 g_assert ( *(string
+ 5) == 'Z' );
989 g_assert (g_str_equal(string
, "abcd"));
990 g_assert (g_strlcpy(string
, "abcde" , 5) == 5);
991 g_assert ( *(string
+ 4) == '\0' );
992 g_assert ( *(string
+ 5) == 'Z' );
993 g_assert (g_str_equal(string
, "abcd"));
994 g_assert (g_strlcpy(string
, "abcdef" , 5) == 6);
995 g_assert ( *(string
+ 4) == '\0' );
996 g_assert ( *(string
+ 5) == 'Z' );
997 g_assert (g_str_equal(string
, "abcd"));
1000 g_assert (g_strlcpy(string
, "Hello" , 0) == 5);
1001 g_assert (*string
== 'Y');
1003 g_assert (g_strlcat(string
, "123" , 5) == 3);
1004 g_assert ( *(string
+ 3) == '\0' );
1005 g_assert (g_str_equal(string
, "123"));
1006 g_assert (g_strlcat(string
, "" , 5) == 3);
1007 g_assert ( *(string
+ 3) == '\0' );
1008 g_assert (g_str_equal(string
, "123"));
1009 g_assert (g_strlcat(string
, "4", 5) == 4);
1010 g_assert (g_str_equal(string
, "1234"));
1011 g_assert (g_strlcat(string
, "5", 5) == 5);
1012 g_assert ( *(string
+ 4) == '\0' );
1013 g_assert (g_str_equal(string
, "1234"));
1014 g_assert ( *(string
+ 5) == 'Z' );
1016 *(string
+ 1)= '\0';
1017 g_assert (g_strlcat(string
, "123" , 0) == 3);
1018 g_assert (*string
== 'Y');
1020 /* A few more tests, demonstrating more "normal" use */
1021 g_assert (g_strlcpy(string
, "hi", 5) == 2);
1022 g_assert (g_str_equal(string
, "hi"));
1023 g_assert (g_strlcat(string
, "t", 5) == 3);
1024 g_assert (g_str_equal(string
, "hit"));
1030 g_print ("checking g_strdup_printf...");
1031 string
= g_strdup_printf ("%05d %-5s", 21, "test");
1032 g_assert (string
!= NULL
);
1033 g_assert (strcmp(string
, "00021 test ") == 0);
1038 /* g_debug (argv[0]); */
1040 /* Relation tests */
1042 g_print ("checking relations...");
1044 relation
= g_relation_new (2);
1046 g_relation_index (relation
, 0, g_int_hash
, g_int_equal
);
1047 g_relation_index (relation
, 1, g_int_hash
, g_int_equal
);
1049 for (i
= 0; i
< 1024; i
+= 1)
1052 for (i
= 1; i
< 1023; i
+= 1)
1054 g_relation_insert (relation
, data
+ i
, data
+ i
+ 1);
1055 g_relation_insert (relation
, data
+ i
, data
+ i
- 1);
1058 for (i
= 2; i
< 1022; i
+= 1)
1060 g_assert (! g_relation_exists (relation
, data
+ i
, data
+ i
));
1061 g_assert (! g_relation_exists (relation
, data
+ i
, data
+ i
+ 2));
1062 g_assert (! g_relation_exists (relation
, data
+ i
, data
+ i
- 2));
1065 for (i
= 1; i
< 1023; i
+= 1)
1067 g_assert (g_relation_exists (relation
, data
+ i
, data
+ i
+ 1));
1068 g_assert (g_relation_exists (relation
, data
+ i
, data
+ i
- 1));
1071 for (i
= 2; i
< 1022; i
+= 1)
1073 g_assert (g_relation_count (relation
, data
+ i
, 0) == 2);
1074 g_assert (g_relation_count (relation
, data
+ i
, 1) == 2);
1077 g_assert (g_relation_count (relation
, data
, 0) == 0);
1079 g_assert (g_relation_count (relation
, data
+ 42, 0) == 2);
1080 g_assert (g_relation_count (relation
, data
+ 43, 1) == 2);
1081 g_assert (g_relation_count (relation
, data
+ 41, 1) == 2);
1082 g_relation_delete (relation
, data
+ 42, 0);
1083 g_assert (g_relation_count (relation
, data
+ 42, 0) == 0);
1084 g_assert (g_relation_count (relation
, data
+ 43, 1) == 1);
1085 g_assert (g_relation_count (relation
, data
+ 41, 1) == 1);
1087 tuples
= g_relation_select (relation
, data
+ 200, 0);
1089 g_assert (tuples
->len
== 2);
1092 for (i
= 0; i
< tuples
->len
; i
+= 1)
1095 *(gint
*) g_tuples_index (tuples
, i
, 0),
1096 *(gint
*) g_tuples_index (tuples
, i
, 1));
1100 g_assert (g_relation_exists (relation
, data
+ 300, data
+ 301));
1101 g_relation_delete (relation
, data
+ 300, 0);
1102 g_assert (!g_relation_exists (relation
, data
+ 300, data
+ 301));
1104 g_tuples_destroy (tuples
);
1106 g_relation_destroy (relation
);
1112 g_print ("checking pointer arrays...");
1114 gparray
= g_ptr_array_new ();
1115 for (i
= 0; i
< 10000; i
++)
1116 g_ptr_array_add (gparray
, GINT_TO_POINTER (i
));
1118 for (i
= 0; i
< 10000; i
++)
1119 if (g_ptr_array_index (gparray
, i
) != GINT_TO_POINTER (i
))
1120 g_print ("array fails: %p ( %p )\n", g_ptr_array_index (gparray
, i
), GINT_TO_POINTER (i
));
1122 g_ptr_array_free (gparray
, TRUE
);
1127 g_print ("checking byte arrays...");
1129 gbarray
= g_byte_array_new ();
1130 for (i
= 0; i
< 10000; i
++)
1131 g_byte_array_append (gbarray
, (guint8
*) "abcd", 4);
1133 for (i
= 0; i
< 10000; i
++)
1135 g_assert (gbarray
->data
[4*i
] == 'a');
1136 g_assert (gbarray
->data
[4*i
+1] == 'b');
1137 g_assert (gbarray
->data
[4*i
+2] == 'c');
1138 g_assert (gbarray
->data
[4*i
+3] == 'd');
1141 g_byte_array_free (gbarray
, TRUE
);
1144 g_printerr ("g_log tests:");
1145 g_warning ("harmless warning with parameters: %d %s %#x", 42, "Boo", 12345);
1146 g_message ("the next warning is a test:");
1150 g_print ("checking endian macros (host is ");
1151 #if G_BYTE_ORDER == G_BIG_ENDIAN
1152 g_print ("big endian)...");
1154 g_print ("little endian)...");
1156 g_assert (GUINT16_SWAP_LE_BE (gu16t1
) == gu16t2
);
1157 g_assert (GUINT32_SWAP_LE_BE (gu32t1
) == gu32t2
);
1158 #ifdef G_HAVE_GINT64
1159 g_assert (GUINT64_SWAP_LE_BE (gu64t1
) == gu64t2
);
1164 #ifdef G_PLATFORM_WIN32
1165 g_print ("current locale: %s\n", g_win32_getlocale ());
1167 g_print ("GLib installation directory, from Registry entry for %s if available: %s\n",
1169 g_win32_get_package_installation_directory (GETTEXT_PACKAGE
, NULL
));
1170 g_print ("Ditto, or from GLib DLL name: %s\n",
1171 g_win32_get_package_installation_directory (GETTEXT_PACKAGE
, glib_dll
));
1172 g_print ("Ditto, only from GLib DLL name: %s\n",
1173 g_win32_get_package_installation_directory (NULL
, glib_dll
));
1174 g_print ("locale subdirectory of GLib installation directory: %s\n",
1175 g_win32_get_package_installation_subdirectory (NULL
, glib_dll
, "locale"));
1176 g_print ("GTK+ 2.0 installation directory, if available: %s\n",
1177 g_win32_get_package_installation_directory ("gtk20", NULL
));
1179 g_print ("found more.com as %s\n", g_find_program_in_path ("more.com"));
1180 g_print ("found regedit as %s\n", g_find_program_in_path ("regedit"));
1184 g_print ("checking file functions...\n");
1186 strcpy (template, "foobar");
1187 fd
= g_mkstemp (template);
1189 g_print ("g_mkstemp works even if template doesn't end in XXXXXX\n");
1191 strcpy (template, "fooXXXXXX");
1192 fd
= g_mkstemp (template);
1194 g_print ("g_mkstemp didn't work for template %s\n", template);
1195 i
= write (fd
, hello
, hellolen
);
1197 g_print ("write() failed: %s\n", g_strerror (errno
));
1198 else if (i
!= hellolen
)
1199 g_print ("write() should have written %d bytes, wrote %d\n", hellolen
, i
);
1202 i
= read (fd
, chars
, sizeof (chars
));
1204 g_print ("read() failed: %s\n", g_strerror (errno
));
1205 else if (i
!= hellolen
)
1206 g_print ("read() should have read %d bytes, got %d\n", hellolen
, i
);
1209 if (strcmp (chars
, hello
) != 0)
1210 g_print ("wrote '%s', but got '%s'\n", hello
, chars
);
1216 strcpy (template, "zap" G_DIR_SEPARATOR_S
"barXXXXXX");
1217 fd
= g_file_open_tmp (template, &name_used
, &error
);
1219 g_print ("g_file_open_tmp works even if template contains '%s'\n",
1222 g_print ("g_file_open_tmp correctly returns error: %s\n",
1225 g_clear_error (&error
);
1227 strcpy (template, "zapXXXXXX");
1228 fd
= g_file_open_tmp (template, &name_used
, &error
);
1230 g_print ("g_file_open_tmp didn't work for template '%s': %s\n",
1231 template, error
->message
);
1233 g_print ("g_file_open_tmp for template '%s' used name '%s'\n",
1234 template, name_used
);
1236 g_clear_error (&error
);
1239 fd
= g_file_open_tmp (NULL
, &name_used
, &error
);
1241 g_print ("g_file_open_tmp didn't work for a NULL template: %s\n",
1244 g_print ("g_file_open_tmp for NULL template used name '%s'\n",
1247 g_clear_error (&error
);