Subversion Repositories HelenOS

Rev

Rev 4055 | 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.     if (!test_quiet)
  123.         slab_print_list();
  124.    
  125.     slab_cache_destroy(cache1);
  126.     slab_cache_destroy(cache2);
  127. }
  128.  
  129. static slab_cache_t *thr_cache;
  130. static semaphore_t thr_sem;
  131. static condvar_t thread_starter;
  132. static mutex_t starter_mutex;
  133.  
  134. #define THREADS  8
  135.  
  136. static void slabtest(void *priv)
  137. {
  138.     void *data = NULL, *new;
  139.    
  140.     thread_detach(THREAD);
  141.    
  142.     mutex_lock(&starter_mutex);
  143.     condvar_wait(&thread_starter,&starter_mutex);
  144.     mutex_unlock(&starter_mutex);
  145.    
  146.     TPRINTF("Starting thread #%" PRIu64 "...\n", THREAD->tid);
  147.  
  148.     /* Alloc all */
  149.     TPRINTF("Thread #%" PRIu64 " allocating...\n", THREAD->tid);
  150.    
  151.     while (true) {
  152.         /* Call with atomic to detect end of memory */
  153.         new = slab_alloc(thr_cache, FRAME_ATOMIC);
  154.         if (!new)
  155.             break;
  156.         *((void **) new) = data;
  157.         data = new;
  158.     }
  159.    
  160.     TPRINTF("Thread #%" PRIu64 " releasing...\n", THREAD->tid);
  161.    
  162.     while (data) {
  163.         new = *((void **)data);
  164.         *((void **) data) = NULL;
  165.         slab_free(thr_cache, data);
  166.         data = new;
  167.     }
  168.    
  169.     TPRINTF("Thread #%" PRIu64 " allocating...\n", THREAD->tid);
  170.    
  171.     while (true) {
  172.         /* Call with atomic to detect end of memory */
  173.         new = slab_alloc(thr_cache, FRAME_ATOMIC);
  174.         if (!new)
  175.             break;
  176.         *((void **) new) = data;
  177.         data = new;
  178.     }
  179.    
  180.     TPRINTF("Thread #%" PRIu64 " releasing...\n", THREAD->tid);
  181.    
  182.     while (data) {
  183.         new = *((void **)data);
  184.         *((void **) data) = NULL;
  185.         slab_free(thr_cache, data);
  186.         data = new;
  187.     }
  188.    
  189.     TPRINTF("Thread #%" PRIu64 " finished\n", THREAD->tid);
  190.    
  191.     if (!test_quiet)
  192.         slab_print_list();
  193.    
  194.     semaphore_up(&thr_sem);
  195. }
  196.  
  197. static void multitest(int size)
  198. {
  199.     /* Start 8 threads that just allocate as much as possible,
  200.      * then release everything, then again allocate, then release
  201.      */
  202.     thread_t *t;
  203.     int i;
  204.    
  205.     TPRINTF("Running stress test with size %d\n", size);
  206.    
  207.     condvar_initialize(&thread_starter);
  208.     mutex_initialize(&starter_mutex, MUTEX_PASSIVE);
  209.    
  210.     thr_cache = slab_cache_create("thread_cache", size, 0, NULL, NULL, 0);
  211.     semaphore_initialize(&thr_sem,0);
  212.     for (i = 0; i < THREADS; i++) {  
  213.         if (!(t = thread_create(slabtest, NULL, TASK, 0, "slabtest", false))) {
  214.             TPRINTF("Could not create thread %d\n", i);
  215.         } else
  216.             thread_ready(t);
  217.     }
  218.     thread_sleep(1);
  219.     condvar_broadcast(&thread_starter);
  220.    
  221.     for (i = 0; i < THREADS; i++)
  222.         semaphore_down(&thr_sem);
  223.    
  224.     slab_cache_destroy(thr_cache);
  225.     TPRINTF("Stress test complete.\n");
  226. }
  227.  
  228. char *test_slab2(void)
  229. {
  230.     TPRINTF("Running reclaim single-thread test .. pass 1\n");
  231.     totalmemtest();
  232.    
  233.     TPRINTF("Running reclaim single-thread test .. pass 2\n");
  234.     totalmemtest();
  235.    
  236.     TPRINTF("Reclaim test OK.\n");
  237.    
  238.     multitest(128);
  239.     multitest(2048);
  240.     multitest(8192);
  241.    
  242.     return NULL;
  243. }
  244.