source: mainline/kernel/test/mm/slab1.c@ beb368f5

/*
 * Copyright (c) 2006 Ondrej Palkovsky
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <test.h>
#include <mm/slab.h>
#include <print.h>
#include <proc/thread.h>
#include <arch.h>
#include <memstr.h>

#define VAL_COUNT   1024

static void * data[VAL_COUNT];

static void testit(int size, int count, bool quiet) 
{
        slab_cache_t *cache;
        int i;
        
        if (!quiet)
                printf("Creating cache, object size: %d.\n", size);
        
        cache = slab_cache_create("test_cache", size, 0, NULL, NULL,
                                SLAB_CACHE_NOMAGAZINE);
        
        if (!quiet)
                printf("Allocating %d items...", count);
        
        for (i = 0; i < count; i++) {
                data[i] = slab_alloc(cache, 0);
                memsetb(data[i], size, 0);
        }
        
        if (!quiet) {
                printf("done.\n");
                printf("Freeing %d items...", count);
        }
        
        for (i = 0; i < count; i++)
                slab_free(cache, data[i]);
        
        if (!quiet) {
                printf("done.\n");
                printf("Allocating %d items...", count);
        }
        
        for (i = 0; i < count; i++) {
                data[i] = slab_alloc(cache, 0);
                memsetb(data[i], size, 0);
        }
        
        if (!quiet) {
                printf("done.\n");
                printf("Freeing %d items...", count / 2);
        }
        
        for (i = count - 1; i >= count / 2; i--)
                slab_free(cache, data[i]);
        
        if (!quiet) {
                printf("done.\n");      
                printf("Allocating %d items...", count / 2);
        }
        
        for (i = count / 2; i < count; i++) {
                data[i] = slab_alloc(cache, 0);
                memsetb(data[i], size, 0);
        }
        
        if (!quiet) {
                printf("done.\n");
                printf("Freeing %d items...", count);
        }
        
        for (i = 0; i < count; i++)
                slab_free(cache, data[i]);
        
        if (!quiet)
                printf("done.\n");      
        slab_cache_destroy(cache);
        
        if (!quiet)
                printf("Test complete.\n");
}

static void testsimple(bool quiet)
{
        testit(100, VAL_COUNT, quiet);
        testit(200, VAL_COUNT, quiet);
        testit(1024, VAL_COUNT, quiet);
        testit(2048, 512, quiet);
        testit(4000, 128, quiet);
        testit(8192, 128, quiet);
        testit(16384, 128, quiet);
        testit(16385, 128, quiet);
}

#define THREADS     6
#define THR_MEM_COUNT   1024
#define THR_MEM_SIZE    128

static void * thr_data[THREADS][THR_MEM_COUNT];
static slab_cache_t *thr_cache;
static semaphore_t thr_sem;
static bool sh_quiet;

static void slabtest(void *data)
{
        int offs = (int) (unative_t) data;
        int i, j;
        
        thread_detach(THREAD);
        
        if (!sh_quiet)
                printf("Starting thread #%" PRIu64 "...\n", THREAD->tid);
        
        for (j = 0; j < 10; j++) {
                for (i = 0; i < THR_MEM_COUNT; i++)
                        thr_data[offs][i] = slab_alloc(thr_cache,0);
                for (i = 0; i < THR_MEM_COUNT / 2; i++)
                        slab_free(thr_cache, thr_data[offs][i]);
                for (i = 0; i < THR_MEM_COUNT / 2; i++)
                        thr_data[offs][i] = slab_alloc(thr_cache, 0);
                for (i = 0; i < THR_MEM_COUNT; i++)
                        slab_free(thr_cache, thr_data[offs][i]);
        }
        
        if (!sh_quiet)
                printf("Thread #%" PRIu64 " finished\n", THREAD->tid);
        
        semaphore_up(&thr_sem);
}

static void testthreads(bool quiet)
{
        thread_t *t;
        int i;

        thr_cache = slab_cache_create("thread_cache", THR_MEM_SIZE, 0, NULL, NULL,
                                        SLAB_CACHE_NOMAGAZINE);
        semaphore_initialize(&thr_sem, 0);
        for (i = 0; i < THREADS; i++) {  
                if (!(t = thread_create(slabtest, (void *) (unative_t) i, TASK, 0, "slabtest", false))) {
                        if (!quiet)
                                printf("Could not create thread %d\n", i);
                } else
                        thread_ready(t);
        }

        for (i = 0; i < THREADS; i++)
                semaphore_down(&thr_sem);
        
        slab_cache_destroy(thr_cache);
        
        if (!quiet)
                printf("Test complete.\n");
}

char * test_slab1(bool quiet)
{
        sh_quiet = quiet;
        
        testsimple(quiet);
        testthreads(quiet);
        
        return NULL;
}