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