Subversion Repositories HelenOS-historic

Rev

Rev 767 | Rev 773 | 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. #include <mm/frame.h>
  36. #include <memstr.h>
  37.  
  38. #define ITEM_SIZE 256
  39.  
  40. /** Fill memory with 2 caches, when allocation fails,
  41.  *  free one of the caches. We should have everything in magazines,
  42.  *  now allocation should clean magazines and allow for full allocation.
  43.  */
  44. static void totalmemtest(void)
  45. {
  46.     slab_cache_t *cache1;
  47.     slab_cache_t *cache2;
  48.     int i;
  49.  
  50.     void *data1, *data2;
  51.     void *olddata1=NULL, *olddata2=NULL;
  52.    
  53.     cache1 = slab_cache_create("cache1_tst", ITEM_SIZE, 0, NULL, NULL, 0);
  54.     cache2 = slab_cache_create("cache2_tst", ITEM_SIZE, 0, NULL, NULL, 0);
  55.  
  56.     printf("Allocating...");
  57.     /* Use atomic alloc, so that we find end of memory */
  58.     do {
  59.         data1 = slab_alloc(cache1, FRAME_ATOMIC);
  60.         data2 = slab_alloc(cache2, FRAME_ATOMIC);
  61.         if (!data1 || !data2) {
  62.             if (data1)
  63.                 slab_free(cache1,data1);
  64.             if (data2)
  65.                 slab_free(cache2,data2);
  66.             break;
  67.         }
  68.         memsetb((__address)data1, ITEM_SIZE, 0);
  69.         memsetb((__address)data2, ITEM_SIZE, 0);
  70.         *((void **)data1) = olddata1;
  71.         *((void **)data2) = olddata2;
  72.         olddata1 = data1;
  73.         olddata2 = data2;
  74.     }while(1);
  75.     printf("done.\n");
  76.     slab_print_list();
  77.     /* We do not have memory - now deallocate cache2 */
  78.     printf("Deallocating cache2...");
  79.     while (olddata2) {
  80.         data2 = *((void **)olddata2);
  81.         slab_free(cache2, olddata2);
  82.         olddata2 = data2;
  83.     }
  84.     printf("done.\n");
  85.  
  86.     slab_print_list();
  87.     printf("Allocating to cache1...\n");
  88.     for (i=0; i<30; i++) {
  89.         data1 = slab_alloc(cache1, FRAME_ATOMIC);
  90.         if (!data1) {
  91.             panic("Incorrect memory size - use another test.");
  92.         }
  93.         memsetb((__address)data1, ITEM_SIZE, 0);
  94.         *((void **)data1) = olddata1;
  95.         olddata1 = data1;
  96.     }
  97.     slab_print_list();
  98.     while (1) {
  99.         data1 = slab_alloc(cache1, FRAME_ATOMIC);
  100.         if (!data1) {
  101.             break;
  102.         }
  103.         memsetb((__address)data1, ITEM_SIZE, 0);
  104.         *((void **)data1) = olddata1;
  105.         olddata1 = data1;
  106.     }
  107.     slab_print_list();
  108.     printf("Deallocating cache1...");
  109.     while (olddata1) {
  110.         data1 = *((void **)olddata1);
  111.         slab_free(cache1, olddata1);
  112.         olddata1 = data1;
  113.     }
  114.     printf("done.\n");
  115.     slab_print_list();
  116.     slab_cache_destroy(cache1);
  117.     slab_cache_destroy(cache2);
  118. }
  119.  
  120. void test(void)
  121. {
  122.     printf("Running reclaim test .. pass1\n");
  123.     totalmemtest();
  124.     printf("Running reclaim test .. pass2\n");
  125.     totalmemtest();
  126.     printf("Reclaim test OK.\n");
  127. }
  128.