Subversion Repositories HelenOS

/*

 * Copyright (C) 2006 Sergey Bondari

 * 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 <print.h>

#include <test.h>

#include <mm/page.h>

#include <mm/frame.h>

#include <mm/slab.h>

#include <arch/mm/page.h>

#include <arch/types.h>

#include <atomic.h>

#include <debug.h>

#include <proc/thread.h>

#include <memstr.h>

#include <arch.h>

#define MAX_FRAMES 256

#define MAX_ORDER 8

#define THREAD_RUNS 1

#define THREADS 8

static atomic_t thread_count;

static atomic_t thread_fail;

static void falloc(void * arg)

{

    int order, run, allocated, i;

    uint8_t val = THREAD->tid % THREADS;

    index_t k;

    uintptr_t * frames =  (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), FRAME_ATOMIC);

    if (frames == NULL) {

        printf("Thread #%d (cpu%d): Unable to allocate frames\n", THREAD->tid, CPU->id);

        atomic_inc(&thread_fail);

        atomic_dec(&thread_count);

        return;

    }

    thread_detach(THREAD);

    for (run = 0; run < THREAD_RUNS; run++) {

        for (order = 0; order <= MAX_ORDER; order++) {

            printf("Thread #%d (cpu%d): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);

            allocated = 0;

            for (i = 0; i < (MAX_FRAMES >> order); i++) {

                frames[allocated] = (uintptr_t)frame_alloc(order, FRAME_ATOMIC | FRAME_KA);

                if (frames[allocated]) {

                    memsetb(frames[allocated], FRAME_SIZE << order, val);

                    allocated++;

                } else

                    break;

            }

            printf("Thread #%d (cpu%d): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);

            printf("Thread #%d (cpu%d): Deallocating ... \n", THREAD->tid, CPU->id);

            for (i = 0; i < allocated; i++) {

                for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) {

                    if (((uint8_t *) frames[i])[k] != val) {

                        printf("Thread #%d (cpu%d): Unexpected data (%d) in block %p offset %#zx\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);

                        atomic_inc(&thread_fail);

                        goto cleanup;

                    }

                }

                frame_free(KA2PA(frames[i]));

            }

            printf("Thread #%d (cpu%d): Finished run.\n", THREAD->tid, CPU->id);

        }

    }

cleanup:   

    free(frames);

    printf("Thread #%d (cpu%d): Exiting\n", THREAD->tid, CPU->id);

    atomic_dec(&thread_count);

}

char * test_falloc2(void)

{

    unsigned int i;

    atomic_set(&thread_count, THREADS);

    atomic_set(&thread_fail, 0);

    for (i = 0; i < THREADS; i++) {

        thread_t * thrd = thread_create(falloc, NULL, TASK, 0, "falloc");

        if (!thrd) {

            printf("Could not create thread %d\n", i);

            break;

        }

        thread_ready(thrd);

    }

    while (atomic_get(&thread_count) > 0) {

        printf("Threads left: %d\n", atomic_get(&thread_count));

        thread_sleep(1);

    }

    if (atomic_get(&thread_fail) == 0)

        return NULL;

    return "Test failed";

}