| 1 | /*
|
|---|
| 2 | * Copyright (C) 2006 Sergey Bondari
|
|---|
| 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 | #include <print.h>
|
|---|
| 29 | #include <test.h>
|
|---|
| 30 | #include <mm/page.h>
|
|---|
| 31 | #include <mm/frame.h>
|
|---|
| 32 | #include <mm/slab.h>
|
|---|
| 33 | #include <arch/mm/page.h>
|
|---|
| 34 | #include <arch/types.h>
|
|---|
| 35 | #include <arch/atomic.h>
|
|---|
| 36 | #include <debug.h>
|
|---|
| 37 | #include <proc/thread.h>
|
|---|
| 38 | #include <memstr.h>
|
|---|
| 39 | #include <arch.h>
|
|---|
| 40 |
|
|---|
| 41 | #define MAX_FRAMES 256
|
|---|
| 42 | #define MAX_ORDER 8
|
|---|
| 43 |
|
|---|
| 44 | #define THREAD_RUNS 1
|
|---|
| 45 | #define THREADS 8
|
|---|
| 46 |
|
|---|
| 47 | static void thread(void * arg);
|
|---|
| 48 | static void failed(void);
|
|---|
| 49 |
|
|---|
| 50 | static atomic_t thread_count;
|
|---|
| 51 |
|
|---|
| 52 | void thread(void * arg)
|
|---|
| 53 | {
|
|---|
| 54 | int status, order, run, allocated, i;
|
|---|
| 55 | __u8 val = THREAD->tid % THREADS;
|
|---|
| 56 | index_t k;
|
|---|
| 57 |
|
|---|
| 58 | __address * frames = (__address *) malloc(MAX_FRAMES * sizeof(__address), FRAME_ATOMIC);
|
|---|
| 59 | ASSERT(frames != NULL);
|
|---|
| 60 |
|
|---|
| 61 | for (run = 0; run < THREAD_RUNS; run++) {
|
|---|
| 62 | for (order = 0; order <= MAX_ORDER; order++) {
|
|---|
| 63 | printf("Thread #%d (cpu%d): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
|
|---|
| 64 | allocated = 0;
|
|---|
| 65 | for (i = 0; i < (MAX_FRAMES >> order); i++) {
|
|---|
| 66 | frames[allocated] = PA2KA(PFN2ADDR(frame_alloc_rc(order, FRAME_ATOMIC | FRAME_KA, &status)));
|
|---|
| 67 | if (status == 0) {
|
|---|
| 68 | memsetb(frames[allocated], FRAME_SIZE << order, val);
|
|---|
| 69 | allocated++;
|
|---|
| 70 | } else {
|
|---|
| 71 | break;
|
|---|
| 72 | }
|
|---|
| 73 | }
|
|---|
| 74 | printf("Thread #%d (cpu%d): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
|
|---|
| 75 |
|
|---|
| 76 | printf("Thread #%d (cpu%d): Deallocating ... \n", THREAD->tid, CPU->id);
|
|---|
| 77 | for (i = 0; i < allocated; i++) {
|
|---|
| 78 | for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) {
|
|---|
| 79 | if (((__u8 *) frames[i])[k] != val) {
|
|---|
| 80 | printf("Thread #%d (cpu%d): Unexpected data (%d) in block %P offset %X\n", THREAD->tid, CPU->id, ((char *) frames[i])[k], frames[i], k);
|
|---|
| 81 | failed();
|
|---|
| 82 | }
|
|---|
| 83 | }
|
|---|
| 84 | frame_free(ADDR2PFN(KA2PA(frames[i])));
|
|---|
| 85 | }
|
|---|
| 86 | printf("Thread #%d (cpu%d): Finished run.\n", THREAD->tid, CPU->id);
|
|---|
| 87 | }
|
|---|
| 88 | }
|
|---|
| 89 |
|
|---|
| 90 | free(frames);
|
|---|
| 91 | printf("Thread #%d (cpu%d): Exiting\n", THREAD->tid, CPU->id);
|
|---|
| 92 | atomic_dec(&thread_count);
|
|---|
| 93 | }
|
|---|
| 94 |
|
|---|
| 95 |
|
|---|
| 96 | void failed(void)
|
|---|
| 97 | {
|
|---|
| 98 | panic("Test failed.\n");
|
|---|
| 99 | }
|
|---|
| 100 |
|
|---|
| 101 |
|
|---|
| 102 | void test(void)
|
|---|
| 103 | {
|
|---|
| 104 | int i;
|
|---|
| 105 |
|
|---|
| 106 | atomic_set(&thread_count, THREADS);
|
|---|
| 107 |
|
|---|
| 108 | for (i = 0; i < THREADS; i++) {
|
|---|
| 109 | thread_t * thrd;
|
|---|
| 110 | thrd = thread_create(thread, NULL, TASK, 0);
|
|---|
| 111 | if (thrd)
|
|---|
| 112 | thread_ready(thrd);
|
|---|
| 113 | else
|
|---|
| 114 | failed();
|
|---|
| 115 | }
|
|---|
| 116 |
|
|---|
| 117 | while (thread_count.count)
|
|---|
| 118 | ;
|
|---|
| 119 |
|
|---|
| 120 | printf("Test passed.\n");
|
|---|
| 121 | }
|
|---|