sl@0: /* test for gslice cross thread allocation/free
sl@0:  * Copyright (C) 2006 Stefan Westerfeld
sl@0:  * Copyright (C) 2007 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 <stdlib.h>
sl@0: #include <unistd.h>
sl@0: #ifdef __SYMBIAN32__
sl@0: #include <glib_global.h>
sl@0: #include "mrt2_glib2_test.h"
sl@0: #endif /*__SYMBIAN32__*/
sl@0: #define N_THREADS	2
sl@0: #define N_ALLOCS	500
sl@0: #define MAX_BLOCK_SIZE  64
sl@0: 
sl@0: 
sl@0: struct ThreadData
sl@0: {
sl@0:   int	   thread_id;
sl@0:   GThread* gthread;
sl@0: 
sl@0:   GMutex*  to_free_mutex;
sl@0:   void*    to_free [N_THREADS * N_ALLOCS];
sl@0:   int      bytes_to_free [N_THREADS * N_ALLOCS];
sl@0:   int      n_to_free;
sl@0:   int      n_freed;
sl@0: } tdata[N_THREADS];
sl@0: 
sl@0: void*
sl@0: thread_func (void *arg)
sl@0: {
sl@0:   struct ThreadData *td = arg;
sl@0:   int i, bytes, f, t;
sl@0:   char *mem;
sl@0:   // g_print ("Thread %d starting\n", td->thread_id);
sl@0:   for (i = 0; i < N_ALLOCS; i++)
sl@0:     {
sl@0:       if (rand() % (N_ALLOCS / 20) == 0)
sl@0: 	g_print ("%c", 'a' - 1 + td->thread_id);
sl@0: 
sl@0:       /* allocate block of random size and randomly fill */
sl@0:         bytes = rand() % MAX_BLOCK_SIZE + 1;
sl@0: /*      char **/mem = g_slice_alloc (bytes);
sl@0: //      int f;
sl@0:       for (f = 0; f < bytes; f++)
sl@0: 	mem[f] = rand();
sl@0: 
sl@0:       /* associate block with random thread */
sl@0:       /*int*/ t = rand() % N_THREADS;
sl@0:       g_mutex_lock (tdata[t].to_free_mutex);
sl@0:       tdata[t].to_free[tdata[t].n_to_free] = mem;
sl@0:       tdata[t].bytes_to_free[tdata[t].n_to_free] = bytes;
sl@0:       tdata[t].n_to_free++;
sl@0:       g_mutex_unlock (tdata[t].to_free_mutex);
sl@0: 
sl@0:       /* shuffle thread execution order every once in a while */
sl@0:       if (rand() % 97 == 0)
sl@0:         {
sl@0:           if (rand() % 2)
sl@0:             g_thread_yield();   /* concurrent shuffling for single core */
sl@0:           else
sl@0:             g_usleep (1000);    /* concurrent shuffling for multi core */
sl@0:         }
sl@0: 
sl@0:       /* free a block associated with this thread */
sl@0:       g_mutex_lock (td->to_free_mutex);
sl@0:       if (td->n_to_free > 0)
sl@0: 	{
sl@0: 	  td->n_to_free--;
sl@0: 	  g_slice_free1 (td->bytes_to_free[td->n_to_free], td->to_free[td->n_to_free]);
sl@0: 	  td->n_freed++;
sl@0: 	}
sl@0:       g_mutex_unlock (td->to_free_mutex);
sl@0:     }
sl@0: 
sl@0:   return NULL;
sl@0: }
sl@0: 
sl@0: int
sl@0: main()
sl@0: {
sl@0:   int t;
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:   g_thread_init (NULL);
sl@0: 
sl@0:   for (t = 0; t < N_THREADS; t++)
sl@0:     {
sl@0:       tdata[t].thread_id = t + 1;
sl@0:       tdata[t].n_to_free = 0;
sl@0:       tdata[t].n_freed = 0;
sl@0:       tdata[t].to_free_mutex = g_mutex_new();
sl@0:     }
sl@0:   g_print ("Starting %d threads for concurrent GSlice usage...\n", N_THREADS);
sl@0:   for (t = 0; t < N_THREADS; t++)
sl@0:     {
sl@0:       tdata[t].gthread   = g_thread_create (thread_func, &tdata[t], TRUE, NULL);
sl@0:       g_assert (tdata[t].gthread != NULL);
sl@0:     }
sl@0:   for (t = 0; t < N_THREADS; t++)
sl@0:     {
sl@0:       g_thread_join (tdata[t].gthread);
sl@0:     }
sl@0:   g_print ("\n");
sl@0:   for (t = 0; t < N_THREADS; t++)
sl@0:     {
sl@0:       g_print ("Thread %d: %d blocks freed, %d blocks not freed\n",
sl@0: 		    tdata[t].thread_id, tdata[t].n_freed, tdata[t].n_to_free);
sl@0:     }
sl@0: #if __SYMBIAN32__
sl@0:   testResultXml("slice-concurrent");
sl@0:   #endif /* EMULATOR */	
sl@0:   return 0;
sl@0: }