/* GLIB - Library of useful routines for C programming

 * Copyright (C) 1995-1997  Peter Mattis, Spencer Kimball and Josh MacDonald

 *

 * This library is free software; you can redistribute it and/or

 * modify it under the terms of the GNU Lesser General Public

 * License as published by the Free Software Foundation; either

 * version 2 of the License, or (at your option) any later version.

 *

 * This library is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

 * Lesser General Public License for more details.

 *

 * You should have received a copy of the GNU Lesser General Public

 * License along with this library; if not, write to the

 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,

 * Boston, MA 02111-1307, USA.

 */

/*

 * Modified by the GLib Team and others 1997-2000.  See the AUTHORS

 * file for a list of people on the GLib Team.  See the ChangeLog

 * files for a list of changes.  These files are distributed with

 * GLib at ftp://ftp.gtk.org/pub/gtk/. 

 */

#include "config.h"

#undef G_DISABLE_ASSERT

#undef G_LOG_DOMAIN

#ifdef GLIB_COMPILATION

#undef GLIB_COMPILATION

#endif

#include <stdio.h>

#include <string.h>

#include <errno.h>

#include "glib.h"

#include "gstdio.h"

#ifdef SYMBIAN

#include "stat.h"

#include <glib_global.h>

#include "mrt2_glib2_test.h"

#endif /*SYMBIAN*/

#ifdef HAVE_UNISTD_H

#include <unistd.h>

#endif

#ifdef G_OS_WIN32

#include <io.h>			/* For read(), write() etc */

#endif

static int array[10000];

static gboolean failed = FALSE;

/* We write (m ? m : "") even in the m != NULL case to suppress a warning with GCC-3.1

 */

#define	TEST(m,cond)	G_STMT_START { failed = !(cond); \

if (failed) \

  { assert_failed = TRUE; \

  	if (!m) \

      g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \

    else \

      g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)(m ? m : "")); \

  } \

} G_STMT_END

#define	C2P(c)		((gpointer) ((long) (c)))

#define	P2C(p)		((gchar) ((long) (p)))

#define GLIB_TEST_STRING "el dorado "

#define GLIB_TEST_STRING_5 "el do"

static gboolean

node_build_string (GNode    *node,

		   gpointer  data)

{

  gchar **p = data;

  gchar *string;

  gchar c[2] = "_";

  c[0] = P2C (node->data);

  string = g_strconcat (*p ? *p : "", c, NULL);

  g_free (*p);

  *p = string;

  return FALSE;

}

static void

g_node_test (void)

{

  GNode *root;

  GNode *node;

  GNode *node_B;

  GNode *node_F;

  GNode *node_G;

  GNode *node_J;

  guint i;

  gchar *tstring, *cstring;

  //g_print ("checking n-way trees: ");

  failed = FALSE;

  root = g_node_new (C2P ('A'));

  TEST (NULL, g_node_depth (root) == 1 && g_node_max_height (root) == 1);

  node_B = g_node_new (C2P ('B'));

  g_node_append (root, node_B);

  TEST (NULL, root->children == node_B);

  g_node_append_data (node_B, C2P ('E'));

  g_node_prepend_data (node_B, C2P ('C'));

  g_node_insert (node_B, 1, g_node_new (C2P ('D')));

  node_F = g_node_new (C2P ('F'));

  g_node_append (root, node_F);

  TEST (NULL, root->children->next == node_F);

  node_G = g_node_new (C2P ('G'));

  g_node_append (node_F, node_G);

  node_J = g_node_new (C2P ('J'));

  g_node_prepend (node_G, node_J);

  g_node_insert (node_G, 42, g_node_new (C2P ('K')));

  g_node_insert_data (node_G, 0, C2P ('H'));

  g_node_insert (node_G, 1, g_node_new (C2P ('I')));

  TEST (NULL, g_node_depth (root) == 1);

  TEST (NULL, g_node_max_height (root) == 4);

  TEST (NULL, g_node_depth (node_G->children->next) == 4);

  TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);

  TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);

  TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);

  TEST (NULL, g_node_max_height (node_F) == 3);

  TEST (NULL, g_node_n_children (node_G) == 4);

  TEST (NULL, g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);

  TEST (NULL, g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);

  TEST (NULL, g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);

  for (i = 0; i < g_node_n_children (node_B); i++)

    {

      node = g_node_nth_child (node_B, i);

      TEST (NULL, P2C (node->data) == ('C' + i));

    }

  for (i = 0; i < g_node_n_children (node_G); i++)

    TEST (NULL, g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i);

  /* we have built:                    A

   *                                 /   \

   *                               B       F

   *                             / | \       \

   *                           C   D   E       G

   *                                         / /\ \

   *                                       H  I  J  K

   *

   * for in-order traversal, 'G' is considered to be the "left"

   * child of 'F', which will cause 'F' to be the last node visited.

   */

  tstring = NULL;

  g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "ABCDEFGHIJK") == 0);

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "CDEBHIJKGFA") == 0);

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "CBDEAHGIJKF") == 0);

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "ABFCDEGHIJK") == 0);

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "CDEHIJK") == 0);

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "ABFG") == 0);

  g_free (tstring); tstring = NULL;

  g_node_reverse_children (node_B);

  g_node_reverse_children (node_G);

  g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  TEST (tstring, strcmp (tstring, "ABFEDCGKJIH") == 0);

  g_free (tstring); tstring = NULL;

  cstring = NULL;

  node = g_node_copy (root);

  TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == g_node_n_nodes (node, G_TRAVERSE_ALL));

  TEST (NULL, g_node_max_height (root) == g_node_max_height (node));

  g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_node_traverse (node, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &cstring);

  TEST (cstring, strcmp (tstring, cstring) == 0);

  g_free (tstring); tstring = NULL;

  g_free (cstring); cstring = NULL;

  g_node_destroy (node);

  g_node_destroy (root);

  /* allocation tests */

  root = g_node_new (NULL);

  node = root;

  for (i = 0; i < 2048; i++)

    {

      g_node_append (node, g_node_new (NULL));

      if ((i%5) == 4)

	node = node->children->next;

    }

  TEST (NULL, g_node_max_height (root) > 100);

  TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048);

  g_node_destroy (root);

  if (failed)

    g_print ("g_node_test failed\n");

}

static gboolean

my_hash_callback_remove (gpointer key,

			 gpointer value,

			 gpointer user_data)

{

  int *d = value;

  if ((*d) % 2)

    return TRUE;

  return FALSE;

}

static void

my_hash_callback_remove_test (gpointer key,

			      gpointer value,

			      gpointer user_data)

{

  int *d = value;

  if ((*d) % 2)

    g_print ("bad!\n");

}

static void

my_hash_callback (gpointer key,

		  gpointer value,

		  gpointer user_data)

{

  int *d = value;

  *d = 1;

}

static guint

my_hash (gconstpointer key)

{

  return (guint) *((const gint*) key);

}

static gboolean

my_hash_equal (gconstpointer a,

	       gconstpointer b)

{

  return *((const gint*) a) == *((const gint*) b);

}

static gint

my_list_compare_one (gconstpointer a, gconstpointer b)

{

  gint one = *((const gint*)a);

  gint two = *((const gint*)b);

  return one-two;

}

static gint

my_list_compare_two (gconstpointer a, gconstpointer b)

{

  gint one = *((const gint*)a);

  gint two = *((const gint*)b);

  return two-one;

}

/* static void

my_list_print (gpointer a, gpointer b)

{

  gint three = *((gint*)a);

  g_print("%d", three);

}; */

static gint

my_compare (gconstpointer a,

	    gconstpointer b)

{

  const char *cha = a;

  const char *chb = b;

  return *cha - *chb;

}

static gint

my_traverse (gpointer key,

	     gpointer value,

	     gpointer data)

{

  char *ch = key;

  g_print ("%c ", *ch);

  return FALSE;

}

static gboolean 

find_first_that(gpointer key, 

		gpointer value, 

		gpointer user_data)

{

  gint *v = value;

  gint *test = user_data;

  return (*v == *test);

}

static gboolean

test_g_mkdir_with_parents_1 (const gchar *base)

{

  char *p0 = g_build_filename (base, "fum", NULL);

  char *p1 = g_build_filename (p0, "tem", NULL);

  char *p2 = g_build_filename (p1, "zap", NULL);

  FILE *f;

  g_remove (p2);

  g_remove (p1);

  g_remove (p0);

  if (g_file_test (p0, G_FILE_TEST_EXISTS))

    {

      g_print ("failed, %s exists, cannot test g_mkdir_with_parents\n", p0);

      return FALSE;

    }

  if (g_file_test (p1, G_FILE_TEST_EXISTS))

    {

      g_print ("failed, %s exists, cannot test g_mkdir_with_parents\n", p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  if (g_file_test (p2, G_FILE_TEST_EXISTS))

    {

      g_print ("failed, %s exists, cannot test g_mkdir_with_parents\n", p2);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#ifdef SYMBIAN

  if (g_mkdir_with_parents (p2, S_IWUSR) == -1)

    {

      g_print ("failed, g_mkdir_with_parents(%s) failed: %s\n", p2, g_strerror (errno));

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#else

  if (g_mkdir_with_parents (p2,  0666) == -1)

    {

      g_print ("failed, g_mkdir_with_parents(%s) failed: %s\n", p2, g_strerror (errno));

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#endif

  if (!g_file_test (p2, G_FILE_TEST_IS_DIR))

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, but %s is not a directory\n", p2, p2);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  if (!g_file_test (p1, G_FILE_TEST_IS_DIR))

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, but %s is not a directory\n", p2, p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  if (!g_file_test (p0, G_FILE_TEST_IS_DIR))

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, but %s is not a directory\n", p2, p0);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  g_rmdir (p2);

  if (g_file_test (p2, G_FILE_TEST_EXISTS))

    {

      g_print ("failed, did g_rmdir(%s), but %s is still there\n", p2, p2);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  g_rmdir (p1);

  if (g_file_test (p1, G_FILE_TEST_EXISTS))

    {

      g_print ("failed, did g_rmdir(%s), but %s is still there\n", p1, p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  f = g_fopen (p1, "w");

  if (f == NULL)

    {

      g_print ("failed, couldn't create file %s\n", p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

  fclose (f);

  #ifdef SYMBIAN

  if (g_mkdir_with_parents (p1,S_IWUSR) == 0)

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, even if %s is a file\n", p1, p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#else

  if (g_mkdir_with_parents (p1,  0666) == 0)

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, even if %s is a file\n", p1, p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#endif

#ifdef SYMBIAN

  if (g_mkdir_with_parents (p2, S_IWUSR) == 0)

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, even if %s is a file\n", p2, p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#else

  if (g_mkdir_with_parents (p2, 0666) == 0)

    {

      g_print ("failed, g_mkdir_with_parents(%s) succeeded, even if %s is a file\n", p2, p1);

      g_assert(FALSE && "testglib");

      return FALSE;

    }

#endif

  g_remove (p2);

  g_remove (p1);

  g_remove (p0);

  return TRUE;

}

static gboolean

test_g_mkdir_with_parents (void)

{

  #ifdef SYMBIAN

  if (!test_g_mkdir_with_parents_1 ("c:\\hum")) 

    return FALSE;

  g_remove ("c:\\hum"); 

#else

  if (!test_g_mkdir_with_parents_1 ("hum")) 

    return FALSE;

  g_remove ("hum"); 

#endif

  #ifndef SYMBIAN 

  if (!test_g_mkdir_with_parents_1 ("hii///haa/hee"))

    return FALSE;

  g_remove ("hii/haa/hee");

  g_remove ("hii/haa");

  g_remove ("hii");

  #endif

  if (!test_g_mkdir_with_parents_1 (g_get_current_dir ()))

    return FALSE;

  return TRUE;

}

static void

test_g_parse_debug_string (void)

{

  GDebugKey keys[3] = { 

    { "foo", 1 },

    { "bar", 2 },

    { "baz", 4 }

  };

  guint n_keys = 3;

  guint result;

  result = g_parse_debug_string ("bar:foo:blubb", keys, n_keys);

  g_assert (result == 3);

  result = g_parse_debug_string (":baz::_E@~!_::", keys, n_keys);

  g_assert (result == 4);

  result = g_parse_debug_string ("", keys, n_keys);

  g_assert (result == 0);

  result = g_parse_debug_string (" : ", keys, n_keys);

  g_assert (result == 0);

}

int

main (int   argc,

      char *argv[])

{

  const gchar *s;

  gchar **sv;

  GList *list, *t;

  GSList *slist, *st;

  GHashTable *hash_table;

  GMemChunk *mem_chunk;

  GStringChunk *string_chunk;