Subversion Repositories HelenOS

Rev

Rev 3343 | 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 <arch/asm.h>
  35. #include <memstr.h>
  36.  
  37. #define VAL_COUNT   1024
  38.  
  39. static void * data[VAL_COUNT];
  40.  
  41. static void testit(int size, int count, bool quiet)
  42. {
  43.     slab_cache_t *cache;
  44.     int i;
  45.    
  46.     if (!quiet)
  47.         printf("Creating cache, object size: %d.\n", size);
  48.    
  49.     cache = slab_cache_create("test_cache", size, 0, NULL, NULL,
  50.                 SLAB_CACHE_NOMAGAZINE);
  51.    
  52.     if (!quiet)
  53.         printf("Allocating %d items...", count);
  54.    
  55.     for (i = 0; i < count; i++) {
  56.         data[i] = slab_alloc(cache, 0);
  57.         memsetb(data[i], size, 0);
  58.     }
  59.    
  60.     if (!quiet) {
  61.         printf("done.\n");
  62.         printf("Freeing %d items...", count);
  63.     }
  64.    
  65.     for (i = 0; i < count; i++)
  66.         slab_free(cache, data[i]);
  67.    
  68.     if (!quiet) {
  69.         printf("done.\n");
  70.         printf("Allocating %d items...", count);
  71.     }
  72.    
  73.     for (i = 0; i < count; i++) {
  74.         data[i] = slab_alloc(cache, 0);
  75.         memsetb(data[i], size, 0);
  76.     }
  77.    
  78.     if (!quiet) {
  79.         printf("done.\n");
  80.         printf("Freeing %d items...", count / 2);
  81.     }
  82.    
  83.     for (i = count - 1; i >= count / 2; i--)
  84.         slab_free(cache, data[i]);
  85.    
  86.     if (!quiet) {
  87.         printf("done.\n"); 
  88.         printf("Allocating %d items...", count / 2);
  89.     }
  90.    
  91.     for (i = count / 2; i < count; i++) {
  92.         data[i] = slab_alloc(cache, 0);
  93.         memsetb(data[i], size, 0);
  94.     }
  95.    
  96.     if (!quiet) {
  97.         printf("done.\n");
  98.         printf("Freeing %d items...", count);
  99.     }
  100.    
  101.     for (i = 0; i < count; i++)
  102.         slab_free(cache, data[i]);
  103.    
  104.     if (!quiet)
  105.         printf("done.\n"); 
  106.     slab_cache_destroy(cache);
  107.    
  108.     if (!quiet)
  109.         printf("Test complete.\n");
  110. }
  111.  
  112. static void testsimple(bool quiet)
  113. {
  114.     testit(100, VAL_COUNT, quiet);
  115.     testit(200, VAL_COUNT, quiet);
  116.     testit(1024, VAL_COUNT, quiet);
  117.     testit(2048, 512, quiet);
  118.     testit(4000, 128, quiet);
  119.     testit(8192, 128, quiet);
  120.     testit(16384, 128, quiet);
  121.     testit(16385, 128, quiet);
  122. }
  123.  
  124. #define THREADS     6
  125. #define THR_MEM_COUNT   1024
  126. #define THR_MEM_SIZE    128
  127.  
  128. static void * thr_data[THREADS][THR_MEM_COUNT];
  129. static slab_cache_t *thr_cache;
  130. static semaphore_t thr_sem;
  131. static bool sh_quiet;
  132.  
  133. static void slabtest(void *data)
  134. {
  135.     int offs = (int) (unative_t) data;
  136.     int i, j;
  137.    
  138.     thread_detach(THREAD);
  139.    
  140.     if (!sh_quiet)
  141.         printf("Starting thread #%" PRIu64 "...\n", THREAD->tid);
  142.    
  143.     for (j = 0; j < 10; j++) {
  144.         for (i = 0; i < THR_MEM_COUNT; i++)
  145.             thr_data[offs][i] = slab_alloc(thr_cache,0);
  146.         for (i = 0; i < THR_MEM_COUNT / 2; i++)
  147.             slab_free(thr_cache, thr_data[offs][i]);
  148.         for (i = 0; i < THR_MEM_COUNT / 2; i++)
  149.             thr_data[offs][i] = slab_alloc(thr_cache, 0);
  150.         for (i = 0; i < THR_MEM_COUNT; i++)
  151.             slab_free(thr_cache, thr_data[offs][i]);
  152.     }
  153.    
  154.     if (!sh_quiet)
  155.         printf("Thread #%" PRIu64 " finished\n", THREAD->tid);
  156.    
  157.     semaphore_up(&thr_sem);
  158. }
  159.  
  160. static void testthreads(bool quiet)
  161. {
  162.     thread_t *t;
  163.     int i;
  164.  
  165.     thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0, NULL, NULL,
  166.                     SLAB_CACHE_NOMAGAZINE);
  167.     semaphore_initialize(&thr_sem, 0);
  168.     for (i = 0; i < THREADS; i++) {  
  169.         if (!(t = thread_create(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest", false))) {
  170.             if (!quiet)
  171.                 printf("Could not create thread %d\n", i);
  172.         } else
  173.             thread_ready(t);
  174.     }
  175.  
  176.     for (i = 0; i < THREADS; i++)
  177.         semaphore_down(&thr_sem);
  178.    
  179.     slab_cache_destroy(thr_cache);
  180.    
  181.     if (!quiet)
  182.         printf("Test complete.\n");
  183. }
  184.  
  185. char * test_slab1(bool quiet)
  186. {
  187.     sh_quiet = quiet;
  188.    
  189.     testsimple(quiet);
  190.     testthreads(quiet);
  191.    
  192.     return NULL;
  193. }
  194.