Subversion Repositories HelenOS-historic

Rev

Rev 764 | Rev 768 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2006 Ondrej Palkovsky
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. #include <test.h>
  30. #include <mm/slab.h>
  31. #include <print.h>
  32. #include <proc/thread.h>
  33. #include <arch.h>
  34. #include <panic.h>
  35.  
  36. #define VAL_COUNT   1024
  37.  
  38. void * data[VAL_COUNT];
  39.  
  40. static void testit(int size, int count)
  41. {
  42.     slab_cache_t *cache;
  43.     int i;
  44.    
  45.     printf("Creating cache, object size: %d.\n", size);
  46.     cache = slab_cache_create("test_cache", size, 0, NULL, NULL,
  47.                   SLAB_CACHE_NOMAGAZINE);
  48.     slab_print_list();
  49.    
  50.     printf("Allocating %d items...", count);
  51.     for (i=0; i < count; i++) {
  52.         data[i] = slab_alloc(cache, 0);
  53.     }
  54.     printf("done.\n");
  55.     printf("Freeing %d items...", count);
  56.     for (i=0; i < count; i++) {
  57.         slab_free(cache, data[i]);
  58.     }
  59.     printf("done.\n");
  60.  
  61.     printf("Allocating %d items...", count);
  62.     for (i=0; i < count; i++) {
  63.         data[i] = slab_alloc(cache, 0);
  64.     }
  65.     printf("done.\n");
  66.  
  67.     slab_print_list();
  68.     printf("Freeing %d items...", count/2);
  69.     for (i=count-1; i >= count/2; i--) {
  70.         slab_free(cache, data[i]);
  71.     }
  72.     printf("done.\n"); 
  73.  
  74.     printf("Allocating %d items...", count/2);
  75.     for (i=count/2; i < count; i++) {
  76.         data[i] = slab_alloc(cache, 0);
  77.     }
  78.     printf("done.\n");
  79.     printf("Freeing %d items...", count);
  80.     for (i=0; i < count; i++) {
  81.         slab_free(cache, data[i]);
  82.     }
  83.     printf("done.\n"); 
  84.     slab_cache_destroy(cache);
  85.  
  86.     printf("Test complete.\n");
  87. }
  88.  
  89. static void testsimple(void)
  90. {
  91.     testit(100, VAL_COUNT);
  92.     testit(200, VAL_COUNT);
  93.     testit(1024, VAL_COUNT);
  94.     testit(2048, 512);
  95.     testit(4000, 128);
  96.     testit(8192, 128);
  97.     testit(16384, 128);
  98.     testit(16385, 128);
  99. }
  100.  
  101.  
  102. #define THREADS     6
  103. #define THR_MEM_COUNT   1024
  104. #define THR_MEM_SIZE    128
  105.  
  106. void * thr_data[THREADS][THR_MEM_COUNT];
  107. slab_cache_t *thr_cache;
  108. semaphore_t thr_sem;
  109.  
  110. static void thread(void *data)
  111. {
  112.     int offs = (int)(__native) data;
  113.     int i,j;
  114.  
  115.     printf("Starting thread #%d...\n",THREAD->tid);
  116.     for (j=0; j<10; j++) {
  117.         for (i=0; i<THR_MEM_COUNT; i++)
  118.             thr_data[offs][i] = slab_alloc(thr_cache,0);
  119.         for (i=0; i<THR_MEM_COUNT/2; i++)
  120.             slab_free(thr_cache, thr_data[offs][i]);
  121.         for (i=0; i< THR_MEM_COUNT/2; i++)
  122.             thr_data[offs][i] = slab_alloc(thr_cache, 0);
  123.         for (i=0; i<THR_MEM_COUNT;i++)
  124.             slab_free(thr_cache, thr_data[offs][i]);
  125.     }
  126.     printf("Thread #%d finished\n", THREAD->tid);
  127.     slab_print_list();
  128.     semaphore_up(&thr_sem);
  129. }
  130.  
  131. static void testthreads(void)
  132. {
  133.     thread_t *t;
  134.     int i;
  135.  
  136.     thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0,
  137.                       NULL, NULL,
  138.                       SLAB_CACHE_NOMAGAZINE);
  139.     semaphore_initialize(&thr_sem,0);
  140.     for (i=0; i<THREADS; i++) {  
  141.         if (!(t = thread_create(thread, (void *)(__native)i, TASK, 0)))
  142.             panic("could not create thread\n");
  143.         thread_ready(t);
  144.     }
  145.  
  146.     for (i=0; i<THREADS; i++)
  147.         semaphore_down(&thr_sem);
  148.    
  149.     slab_cache_destroy(thr_cache);
  150.     printf("Test complete.\n");
  151.    
  152. }
  153.  
  154. void test(void)
  155. {
  156.     testsimple();
  157.     testthreads();
  158. }
  159.