Subversion Repositories HelenOS

Rev

Rev 3186 | Rev 4231 | 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 <mm/frame.h>
  35. #include <memstr.h>
  36. #include <synch/condvar.h>
  37. #include <synch/mutex.h>
  38.  
  39. #define ITEM_SIZE  256
  40.  
  41. /** Fill memory with 2 caches, when allocation fails,
  42.  *  free one of the caches. We should have everything in magazines,
  43.  *  now allocation should clean magazines and allow for full allocation.
  44.  */
  45. static void totalmemtest(void)
  46. {
  47.     slab_cache_t *cache1;
  48.     slab_cache_t *cache2;
  49.     int i;
  50.    
  51.     void *data1, *data2;
  52.     void *olddata1 = NULL, *olddata2 = NULL;
  53.    
  54.     cache1 = slab_cache_create("cache1_tst", ITEM_SIZE, 0, NULL, NULL, 0);
  55.     cache2 = slab_cache_create("cache2_tst", ITEM_SIZE, 0, NULL, NULL, 0);
  56.    
  57.     TPRINTF("Allocating...");
  58.    
  59.     /* Use atomic alloc, so that we find end of memory */
  60.     do {
  61.         data1 = slab_alloc(cache1, FRAME_ATOMIC);
  62.         data2 = slab_alloc(cache2, FRAME_ATOMIC);
  63.         if ((!data1) || (!data2)) {
  64.             if (data1)
  65.                 slab_free(cache1, data1);
  66.             if (data2)
  67.                 slab_free(cache2, data2);
  68.             break;
  69.         }
  70.         memsetb(data1, ITEM_SIZE, 0);
  71.         memsetb(data2, ITEM_SIZE, 0);
  72.         *((void **) data1) = olddata1;
  73.         *((void **) data2) = olddata2;
  74.         olddata1 = data1;
  75.         olddata2 = data2;
  76.     } while (true);
  77.    
  78.     TPRINTF("done.\n");
  79.    
  80.     TPRINTF("Deallocating cache2...");
  81.    
  82.     /* We do not have memory - now deallocate cache2 */
  83.     while (olddata2) {
  84.         data2 = *((void **) olddata2);
  85.         slab_free(cache2, olddata2);
  86.         olddata2 = data2;
  87.     }
  88.    
  89.     TPRINTF("done.\n");
  90.    
  91.     TPRINTF("Allocating to cache1...\n");
  92.    
  93.     for (i = 0; i < 30; i++) {
  94.         data1 = slab_alloc(cache1, FRAME_ATOMIC);
  95.         if (!data1) {
  96.             TPRINTF("Incorrect memory size - use another test.");
  97.             return;
  98.         }
  99.         memsetb(data1, ITEM_SIZE, 0);
  100.         *((void **) data1) = olddata1;
  101.         olddata1 = data1;
  102.     }
  103.     while (true) {
  104.         data1 = slab_alloc(cache1, FRAME_ATOMIC);
  105.         if (!data1)
  106.             break;
  107.         memsetb(data1, ITEM_SIZE, 0);
  108.         *((void **) data1) = olddata1;
  109.         olddata1 = data1;
  110.     }
  111.    
  112.     TPRINTF("Deallocating cache1...");
  113.    
  114.     while (olddata1) {
  115.         data1 = *((void **) olddata1);
  116.         slab_free(cache1, olddata1);
  117.         olddata1 = data1;
  118.     }
  119.    
  120.     TPRINTF("done.\n");
  121.    
  122.     slab_print_list();
  123.    
  124.     slab_cache_destroy(cache1);
  125.     slab_cache_destroy(cache2);
  126. }
  127.  
  128. static slab_cache_t *thr_cache;
  129. static semaphore_t thr_sem;
  130. static condvar_t thread_starter;
  131. static mutex_t starter_mutex;
  132.  
  133. #define THREADS  8
  134.  
  135. static void slabtest(void *priv)
  136. {
  137.     void *data = NULL, *new;
  138.    
  139.     thread_detach(THREAD);
  140.    
  141.     mutex_lock(&starter_mutex);
  142.     condvar_wait(&thread_starter,&starter_mutex);
  143.     mutex_unlock(&starter_mutex);
  144.    
  145.     TPRINTF("Starting thread #%" PRIu64 "...\n", THREAD->tid);
  146.  
  147.     /* Alloc all */
  148.     TPRINTF("Thread #%" PRIu64 " allocating...\n", THREAD->tid);
  149.    
  150.     while (true) {
  151.         /* Call with atomic to detect end of memory */
  152.         new = slab_alloc(thr_cache, FRAME_ATOMIC);
  153.         if (!new)
  154.             break;
  155.         *((void **) new) = data;
  156.         data = new;
  157.     }
  158.    
  159.     TPRINTF("Thread #%" PRIu64 " releasing...\n", THREAD->tid);
  160.    
  161.     while (data) {
  162.         new = *((void **)data);
  163.         *((void **) data) = NULL;
  164.         slab_free(thr_cache, data);
  165.         data = new;
  166.     }
  167.    
  168.     TPRINTF("Thread #%" PRIu64 " allocating...\n", THREAD->tid);
  169.    
  170.     while (true) {
  171.         /* Call with atomic to detect end of memory */
  172.         new = slab_alloc(thr_cache, FRAME_ATOMIC);
  173.         if (!new)
  174.             break;
  175.         *((void **) new) = data;
  176.         data = new;
  177.     }
  178.    
  179.     TPRINTF("Thread #%" PRIu64 " releasing...\n", THREAD->tid);
  180.    
  181.     while (data) {
  182.         new = *((void **)data);
  183.         *((void **) data) = NULL;
  184.         slab_free(thr_cache, data);
  185.         data = new;
  186.     }
  187.    
  188.     TPRINTF("Thread #%" PRIu64 " finished\n", THREAD->tid);
  189.    
  190.     slab_print_list();
  191.     semaphore_up(&thr_sem);
  192. }
  193.  
  194. static void multitest(int size)
  195. {
  196.     /* Start 8 threads that just allocate as much as possible,
  197.      * then release everything, then again allocate, then release
  198.      */
  199.     thread_t *t;
  200.     int i;
  201.    
  202.     TPRINTF("Running stress test with size %d\n", size);
  203.    
  204.     condvar_initialize(&thread_starter);
  205.     mutex_initialize(&starter_mutex, MUTEX_PASSIVE);
  206.    
  207.     thr_cache = slab_cache_create("thread_cache", size, 0, NULL, NULL, 0);
  208.     semaphore_initialize(&thr_sem,0);
  209.     for (i = 0; i < THREADS; i++) {  
  210.         if (!(t = thread_create(slabtest, NULL, TASK, 0, "slabtest", false))) {
  211.             TPRINTF("Could not create thread %d\n", i);
  212.         } else
  213.             thread_ready(t);
  214.     }
  215.     thread_sleep(1);
  216.     condvar_broadcast(&thread_starter);
  217.    
  218.     for (i = 0; i < THREADS; i++)
  219.         semaphore_down(&thr_sem);
  220.    
  221.     slab_cache_destroy(thr_cache);
  222.     TPRINTF("Stress test complete.\n");
  223. }
  224.  
  225. char *test_slab2(void)
  226. {
  227.     TPRINTF("Running reclaim single-thread test .. pass 1\n");
  228.     totalmemtest();
  229.    
  230.     TPRINTF("Running reclaim single-thread test .. pass 2\n");
  231.     totalmemtest();
  232.    
  233.     TPRINTF("Reclaim test OK.\n");
  234.    
  235.     multitest(128);
  236.     multitest(2048);
  237.     multitest(8192);
  238.    
  239.     return NULL;
  240. }
  241.