Rev 1658 | Rev 1767 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 692 | bondari | 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> |
||
| 814 | palkovsky | 32 | #include <mm/slab.h> |
| 692 | bondari | 33 | #include <arch/mm/page.h> |
| 34 | #include <arch/types.h> |
||
| 1104 | jermar | 35 | #include <atomic.h> |
| 692 | bondari | 36 | #include <debug.h> |
| 37 | #include <proc/thread.h> |
||
| 38 | #include <memstr.h> |
||
| 745 | jermar | 39 | #include <arch.h> |
| 692 | bondari | 40 | |
| 735 | bondari | 41 | #define MAX_FRAMES 256 |
| 42 | #define MAX_ORDER 8 |
||
| 692 | bondari | 43 | |
| 733 | bondari | 44 | #define THREAD_RUNS 1 |
| 735 | bondari | 45 | #define THREADS 8 |
| 692 | bondari | 46 | |
| 1062 | jermar | 47 | static void falloc(void * arg); |
| 692 | bondari | 48 | static void failed(void); |
| 49 | |||
| 50 | static atomic_t thread_count; |
||
| 51 | |||
| 1062 | jermar | 52 | void falloc(void * arg) |
| 745 | jermar | 53 | { |
| 54 | int status, order, run, allocated, i; |
||
| 55 | __u8 val = THREAD->tid % THREADS; |
||
| 733 | bondari | 56 | index_t k; |
| 692 | bondari | 57 | |
| 822 | palkovsky | 58 | __address * frames = (__address *) malloc(MAX_FRAMES * sizeof(__address), FRAME_ATOMIC); |
| 745 | jermar | 59 | ASSERT(frames != NULL); |
| 1658 | vana | 60 | |
| 61 | thread_detach(THREAD); |
||
| 692 | bondari | 62 | |
| 745 | jermar | 63 | for (run = 0; run < THREAD_RUNS; run++) { |
| 64 | for (order = 0; order <= MAX_ORDER; order++) { |
||
| 786 | bondari | 65 | printf("Thread #%d (cpu%d): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order); |
| 692 | bondari | 66 | allocated = 0; |
| 745 | jermar | 67 | for (i = 0; i < (MAX_FRAMES >> order); i++) { |
| 1760 | palkovsky | 68 | frames[allocated] = frame_alloc_rc(order, FRAME_ATOMIC | FRAME_KA, &status); |
| 692 | bondari | 69 | if (status == 0) { |
| 745 | jermar | 70 | memsetb(frames[allocated], FRAME_SIZE << order, val); |
| 692 | bondari | 71 | allocated++; |
| 72 | } else { |
||
| 73 | break; |
||
| 74 | } |
||
| 75 | } |
||
| 786 | bondari | 76 | printf("Thread #%d (cpu%d): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated); |
| 692 | bondari | 77 | |
| 786 | bondari | 78 | printf("Thread #%d (cpu%d): Deallocating ... \n", THREAD->tid, CPU->id); |
| 745 | jermar | 79 | for (i = 0; i < allocated; i++) { |
| 80 | for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) { |
||
| 81 | if (((__u8 *) frames[i])[k] != val) { |
||
| 1221 | decky | 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); |
| 733 | bondari | 83 | failed(); |
| 84 | } |
||
| 85 | } |
||
| 1760 | palkovsky | 86 | frame_free(KA2PA(frames[i])); |
| 692 | bondari | 87 | } |
| 786 | bondari | 88 | printf("Thread #%d (cpu%d): Finished run.\n", THREAD->tid, CPU->id); |
| 692 | bondari | 89 | } |
| 90 | } |
||
| 91 | |||
| 745 | jermar | 92 | free(frames); |
| 786 | bondari | 93 | printf("Thread #%d (cpu%d): Exiting\n", THREAD->tid, CPU->id); |
| 692 | bondari | 94 | atomic_dec(&thread_count); |
| 95 | } |
||
| 96 | |||
| 97 | |||
| 745 | jermar | 98 | void failed(void) |
| 99 | { |
||
| 692 | bondari | 100 | panic("Test failed.\n"); |
| 101 | } |
||
| 102 | |||
| 103 | |||
| 745 | jermar | 104 | void test(void) |
| 105 | { |
||
| 692 | bondari | 106 | int i; |
| 107 | |||
| 108 | atomic_set(&thread_count, THREADS); |
||
| 109 | |||
| 745 | jermar | 110 | for (i = 0; i < THREADS; i++) { |
| 692 | bondari | 111 | thread_t * thrd; |
| 1062 | jermar | 112 | thrd = thread_create(falloc, NULL, TASK, 0, "falloc"); |
| 745 | jermar | 113 | if (thrd) |
| 114 | thread_ready(thrd); |
||
| 115 | else |
||
| 116 | failed(); |
||
| 692 | bondari | 117 | } |
| 118 | |||
| 745 | jermar | 119 | while (thread_count.count) |
| 120 | ; |
||
| 692 | bondari | 121 | |
| 745 | jermar | 122 | printf("Test passed.\n"); |
| 692 | bondari | 123 | } |