Subversion Repositories HelenOS-historic

Rev

Rev 762 | Rev 766 | 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.  
  33. #define VAL_SIZE    128
  34. #define VAL_COUNT   1024
  35.  
  36. void * data[16384];
  37.  
  38. void test(void)
  39. {
  40.     slab_cache_t *cache;
  41.     int i;
  42.    
  43.  
  44.     printf("Creating cache.\n");
  45.     cache = slab_cache_create("test_cache", VAL_SIZE, 0, NULL, NULL, SLAB_CACHE_NOMAGAZINE);
  46.     printf("Destroying cache.\n");
  47.     slab_cache_destroy(cache);
  48.  
  49.     printf("Creating cache.\n");
  50.     cache = slab_cache_create("test_cache", VAL_SIZE, 0, NULL, NULL,
  51.                   SLAB_CACHE_NOMAGAZINE);
  52.    
  53.     printf("Allocating %d items...", VAL_COUNT);
  54.     for (i=0; i < VAL_COUNT; i++) {
  55.         data[i] = slab_alloc(cache, 0);
  56.     }
  57.     printf("done.\n");
  58.     printf("Freeing %d items...", VAL_COUNT);
  59.     for (i=0; i < VAL_COUNT; i++) {
  60.         slab_free(cache, data[i]);
  61.     }
  62.     printf("done.\n");
  63.  
  64.     printf("Allocating %d items...", VAL_COUNT);
  65.     for (i=0; i < VAL_COUNT; i++) {
  66.         data[i] = slab_alloc(cache, 0);
  67.     }
  68.     printf("done.\n");
  69.  
  70.     slab_print_list();
  71.     printf("Freeing %d items...", VAL_COUNT/2);
  72.     for (i=VAL_COUNT-1; i >= VAL_COUNT/2; i--) {
  73.         slab_free(cache, data[i]);
  74.     }
  75.     printf("done.\n"); 
  76.  
  77.     printf("Allocating %d items...", VAL_COUNT/2);
  78.     for (i=VAL_COUNT/2; i < VAL_COUNT; i++) {
  79.         data[i] = slab_alloc(cache, 0);
  80.     }
  81.     printf("done.\n");
  82.     printf("Freeing %d items...", VAL_COUNT);
  83.     for (i=0; i < VAL_COUNT; i++) {
  84.         slab_free(cache, data[i]);
  85.     }
  86.     printf("done.\n"); 
  87.     slab_print_list();
  88.     slab_cache_destroy(cache);
  89.  
  90.     printf("Test complete.\n");
  91. }
  92.