Subversion Repositories HelenOS

Rev

Rev 2029 | Rev 2050 | 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 <memstr.h>
  35.  
  36. #define VAL_COUNT   1024
  37.  
  38. static 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.     printf("Allocating %d items...", count);
  49.     for (i = 0; i < count; i++) {
  50.         data[i] = slab_alloc(cache, 0);
  51.         memsetb((uintptr_t) data[i], size, 0);
  52.     }
  53.     printf("done.\n");
  54.     printf("Freeing %d items...", count);
  55.     for (i = 0; i < count; i++) {
  56.         slab_free(cache, data[i]);
  57.     }
  58.     printf("done.\n");
  59.  
  60.     printf("Allocating %d items...", count);
  61.     for (i = 0; i < count; i++) {
  62.         data[i] = slab_alloc(cache, 0);
  63.         memsetb((uintptr_t) data[i], size, 0);
  64.     }
  65.     printf("done.\n");
  66.  
  67.     printf("Freeing %d items...", count / 2);
  68.     for (i = count - 1; i >= count / 2; i--) {
  69.         slab_free(cache, data[i]);
  70.     }
  71.     printf("done.\n"); 
  72.  
  73.     printf("Allocating %d items...", count / 2);
  74.     for (i = count / 2; i < count; i++) {
  75.         data[i] = slab_alloc(cache, 0);
  76.         memsetb((uintptr_t) data[i], size, 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. #define THREADS     6
  102. #define THR_MEM_COUNT   1024
  103. #define THR_MEM_SIZE    128
  104.  
  105. static void * thr_data[THREADS][THR_MEM_COUNT];
  106. static slab_cache_t *thr_cache;
  107. static semaphore_t thr_sem;
  108.  
  109. static void slabtest(void *data)
  110. {
  111.     int offs = (int) (unative_t) data;
  112.     int i, j;
  113.    
  114.     thread_detach(THREAD);
  115.    
  116.     printf("Starting thread #%d...\n",THREAD->tid);
  117.     for (j = 0; j < 10; j++) {
  118.         for (i = 0; i < THR_MEM_COUNT; i++)
  119.             thr_data[offs][i] = slab_alloc(thr_cache,0);
  120.         for (i = 0; i < THR_MEM_COUNT / 2; i++)
  121.             slab_free(thr_cache, thr_data[offs][i]);
  122.         for (i = 0; i < THR_MEM_COUNT / 2; i++)
  123.             thr_data[offs][i] = slab_alloc(thr_cache, 0);
  124.         for (i = 0; i < THR_MEM_COUNT; i++)
  125.             slab_free(thr_cache, thr_data[offs][i]);
  126.     }
  127.     printf("Thread #%d finished\n", THREAD->tid);
  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(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest", false)))
  142.             printf("Could not create thread %d\n", i);
  143.         else
  144.             thread_ready(t);
  145.     }
  146.  
  147.     for (i = 0; i < THREADS; i++)
  148.         semaphore_down(&thr_sem);
  149.    
  150.     slab_cache_destroy(thr_cache);
  151.     printf("Test complete.\n");
  152.    
  153. }
  154.  
  155. char * test_slab1(void)
  156. {
  157.     testsimple();
  158.     testthreads();
  159.    
  160.     return NULL;
  161. }
  162.