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