sl@0: /* GLIB sliced memory - fast threaded memory chunk allocator
sl@0:  * Copyright (C) 2005 Tim Janik
sl@0:  * Portions copyright (c) 2009 Nokia Corporation.  All rights reserved.
sl@0:  * This library is free software; you can redistribute it and/or
sl@0:  * modify it under the terms of the GNU Lesser General Public
sl@0:  * License as published by the Free Software Foundation; either
sl@0:  * version 2 of the License, or (at your option) any later version.
sl@0:  *
sl@0:  * This library is distributed in the hope that it will be useful,
sl@0:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
sl@0:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
sl@0:  * Lesser General Public License for more details.
sl@0:  *
sl@0:  * You should have received a copy of the GNU Lesser General Public
sl@0:  * License along with this library; if not, write to the
sl@0:  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
sl@0:  * Boston, MA 02111-1307, USA.
sl@0:  */
sl@0: #include <glib.h>
sl@0: #include <string.h>
sl@0: 
sl@0: #define ALIGN(size, base)       ((base) * (gsize) (((size) + (base) - 1) / (base)))
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: #include "mrt2_glib2_test.h"
sl@0: #endif //__SYMBIAN32__
sl@0: 
sl@0: static gdouble parse_memsize (const gchar *cstring);
sl@0: static void    usage         (void);
sl@0: 
sl@0: static void
sl@0: fill_memory (guint **mem,
sl@0:              guint   n,
sl@0:              guint   val)
sl@0: {
sl@0:   guint j, o = 0;
sl@0:   for (j = 0; j < n; j++)
sl@0:     mem[j][o] = val;
sl@0: }
sl@0: 
sl@0: static guint64
sl@0: access_memory3 (guint  **mema,
sl@0:                 guint  **memb,
sl@0:                 guint  **memd,
sl@0:                 guint    n,
sl@0:                 guint64  repeats)
sl@0: {
sl@0:   guint64 accu = 0, i, j;
sl@0:   const guint o = 0;
sl@0:   for (i = 0; i < repeats; i++)
sl@0:     {
sl@0:       for (j = 1; j < n; j += 2)
sl@0:         memd[j][o] = mema[j][o] + memb[j][o];
sl@0:     }
sl@0:   for (i = 0; i < repeats; i++)
sl@0:     for (j = 0; j < n; j++)
sl@0:       accu += memd[j][o];
sl@0:   return accu;
sl@0: }
sl@0: 
sl@0: static void
sl@0: touch_mem (guint64 block_size,
sl@0:            guint64 n_blocks,
sl@0:            guint64 repeats)
sl@0: {
sl@0:   guint64 j, accu, n = n_blocks;
sl@0:   GTimer *timer;
sl@0:   guint **memc;
sl@0:   guint **memb;
sl@0:   guint **mema = g_new (guint*, n);
sl@0:   for (j = 0; j < n; j++)
sl@0:     mema[j] = g_slice_alloc (block_size);
sl@0:   memb = g_new (guint*, n);
sl@0:   for (j = 0; j < n; j++)
sl@0:     memb[j] = g_slice_alloc (block_size);
sl@0:   memc = g_new (guint*, n);
sl@0:   for (j = 0; j < n; j++)
sl@0:     memc[j] = g_slice_alloc (block_size);
sl@0: 
sl@0:   timer = g_timer_new();
sl@0:   fill_memory (mema, n, 2);
sl@0:   fill_memory (memb, n, 3);
sl@0:   fill_memory (memc, n, 4);
sl@0:   access_memory3 (mema, memb, memc, n, 3);
sl@0:   g_timer_start (timer);
sl@0:   accu = access_memory3 (mema, memb, memc, n, repeats);
sl@0:   g_timer_stop (timer);
sl@0: 
sl@0:   g_print ("Access-time = %fs\n", g_timer_elapsed (timer, NULL));
sl@0:   g_assert (accu / repeats == (2 + 3) * n / 2 + 4 * n / 2);
sl@0: 
sl@0:   for (j = 0; j < n; j++)
sl@0:     {
sl@0:       g_slice_free1 (block_size, mema[j]);
sl@0:       g_slice_free1 (block_size, memb[j]);
sl@0:       g_slice_free1 (block_size, memc[j]);
sl@0:     }
sl@0:   g_timer_destroy (timer);
sl@0:   g_free (mema);
sl@0:   g_free (memb);
sl@0:   g_free (memc);
sl@0: }
sl@0: 
sl@0: static void
sl@0: usage (void)
sl@0: {
sl@0:   g_print ("Usage: slice-color <block-size> [memory-size] [repeats] [colorization]\n");
sl@0: }
sl@0: 
sl@0: int
sl@0: main (int   argc,
sl@0:       char *argv[])
sl@0: {
sl@0:   guint64 block_size = 512, area_size = 1024, n_blocks, repeats = 10;
sl@0: 
sl@0:   #ifdef __SYMBIAN32__
sl@0:   g_log_set_handler (NULL,  G_LOG_FLAG_FATAL| G_LOG_FLAG_RECURSION | G_LOG_LEVEL_CRITICAL | G_LOG_LEVEL_WARNING | G_LOG_LEVEL_MESSAGE | G_LOG_LEVEL_INFO | G_LOG_LEVEL_DEBUG, &mrtLogHandler, NULL);
sl@0:   g_set_print_handler(mrtPrintHandler);
sl@0:   #endif /*__SYMBIAN32__*/
sl@0:   
sl@0:   if (argc > 1)
sl@0:     block_size = parse_memsize (argv[1]);
sl@0:   else
sl@0:     {
sl@0:       usage();
sl@0:       block_size = 512;
sl@0:     }
sl@0:   if (argc > 2)
sl@0:     area_size = parse_memsize (argv[2]);
sl@0:   if (argc > 3)
sl@0:     repeats = parse_memsize (argv[3]);
sl@0:   if (argc > 4)
sl@0:     g_slice_set_config (G_SLICE_CONFIG_COLOR_INCREMENT, parse_memsize (argv[4]));
sl@0: 
sl@0:   /* figure number of blocks from block and area size.
sl@0:    * divide area by 3 because touch_mem() allocates 3 areas
sl@0:    */
sl@0:   n_blocks = area_size / 3 / ALIGN (block_size, sizeof (gsize) * 2);
sl@0: 
sl@0:   /* basic sanity checks */
sl@0:   if (!block_size || !n_blocks || block_size >= area_size)
sl@0:     {
sl@0:       g_printerr ("Invalid arguments: block-size=%llu memory-size=%llu\n", block_size, area_size);
sl@0:       usage();
sl@0:       return 1;
sl@0:     }
sl@0: 
sl@0:   g_print ("Will allocate and touch %llu blocks of %llu bytes (= %llu bytes) %llu times with color increment: 0x%08llx\n",
sl@0:               n_blocks, block_size, n_blocks * block_size, repeats, g_slice_get_config (G_SLICE_CONFIG_COLOR_INCREMENT));
sl@0:   touch_mem (block_size, n_blocks, repeats);
sl@0:   
sl@0:   
sl@0:   #ifdef __SYMBIAN32__
sl@0:   testResultXml("slice-color");
sl@0:   #endif //__SYMBIAN32__
sl@0:   
sl@0:   
sl@0:   
sl@0:   return 0;
sl@0: }
sl@0: 
sl@0: static gdouble
sl@0: parse_memsize (const gchar *cstring)
sl@0: {
sl@0:   gchar *mem = g_strdup (cstring);
sl@0:   gchar *string = g_strstrip (mem);
sl@0:   guint l = strlen (string);
sl@0:   gdouble f = 0;
sl@0:   gchar *derr = NULL;
sl@0:   gdouble msize;
sl@0: 
sl@0:   switch (l ? string[l - 1] : 0)
sl@0:     {
sl@0:     case 'k':   f = 1000;               break;
sl@0:     case 'K':   f = 1024;               break;
sl@0:     case 'm':   f = 1000000;            break;
sl@0:     case 'M':   f = 1024 * 1024;        break;
sl@0:     case 'g':   f = 1000000000;         break;
sl@0:     case 'G':   f = 1024 * 1024 * 1024; break;
sl@0:     }
sl@0:   if (f)
sl@0:     string[l - 1] = 0;
sl@0:   msize = g_ascii_strtod (string, &derr);
sl@0:   g_free (mem);
sl@0: /*  
sl@0:   if (derr && *derr)
sl@0:     {
sl@0:       g_printerr ("failed to parse number at: %s\n", derr);
sl@0:       msize = 0;
sl@0:     }*/
sl@0:   if (f)
sl@0:     msize *= f;
sl@0:   return msize;
sl@0: }