Rev 735 | Rev 759 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 735 | Rev 745 | ||
|---|---|---|---|
| 1 | /* |
1 | /* |
| 2 | * Copyright (C) 2006 Sergey Bondari |
2 | * Copyright (C) 2006 Sergey Bondari |
| 3 | * All rights reserved. |
3 | * All rights reserved. |
| 4 | * |
4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
| 7 | * are met: |
7 | * are met: |
| 8 | * |
8 | * |
| 9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
| 11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
| 12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
| 13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
| 16 | * |
16 | * |
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
27 | */ |
| 28 | #include <print.h> |
28 | #include <print.h> |
| 29 | #include <test.h> |
29 | #include <test.h> |
| 30 | #include <mm/page.h> |
30 | #include <mm/page.h> |
| 31 | #include <mm/frame.h> |
31 | #include <mm/frame.h> |
| 32 | #include <mm/heap.h> |
32 | #include <mm/heap.h> |
| 33 | #include <arch/mm/page.h> |
33 | #include <arch/mm/page.h> |
| 34 | #include <arch/types.h> |
34 | #include <arch/types.h> |
| 35 | #include <arch/atomic.h> |
35 | #include <arch/atomic.h> |
| 36 | #include <debug.h> |
36 | #include <debug.h> |
| 37 | #include <proc/thread.h> |
37 | #include <proc/thread.h> |
| 38 | #include <memstr.h> |
38 | #include <memstr.h> |
| - | 39 | #include <arch.h> |
|
| 39 | 40 | ||
| 40 | #define MAX_FRAMES 256 |
41 | #define MAX_FRAMES 256 |
| 41 | #define MAX_ORDER 8 |
42 | #define MAX_ORDER 8 |
| 42 | 43 | ||
| 43 | #define THREAD_RUNS 1 |
44 | #define THREAD_RUNS 1 |
| 44 | #define THREADS 8 |
45 | #define THREADS 8 |
| 45 | 46 | ||
| 46 | static void thread(void * arg); |
47 | static void thread(void * arg); |
| 47 | static void failed(void); |
48 | static void failed(void); |
| 48 | 49 | ||
| 49 | static atomic_t thread_count; |
50 | static atomic_t thread_count; |
| 50 | 51 | ||
| 51 | void thread(void * arg) { |
52 | void thread(void * arg) |
| - | 53 | { |
|
| 52 | int status, order, run, allocated,i; |
54 | int status, order, run, allocated, i; |
| 53 | - | ||
| 54 | __u8 val = *((__u8 *) arg); |
55 | __u8 val = THREAD->tid % THREADS; |
| 55 | index_t k; |
56 | index_t k; |
| 56 | 57 | ||
| 57 | __address * frames = (__address *) malloc(MAX_FRAMES * sizeof(__address)); |
58 | __address * frames = (__address *) malloc(MAX_FRAMES * sizeof(__address)); |
| - | 59 | ASSERT(frames != NULL); |
|
| 58 | 60 | ||
| 59 | for (run=0;run<THREAD_RUNS;run++) { |
61 | for (run = 0; run < THREAD_RUNS; run++) { |
| 60 | - | ||
| 61 | for (order=0;order<=MAX_ORDER;order++) { |
62 | for (order = 0; order <= MAX_ORDER; order++) { |
| 62 | printf("Thread #%d: Allocating %d frames blocks ... \n",val, 1<<order); |
63 | printf("Thread #%d: Allocating %d frames blocks ... \n", THREAD->tid, 1 << order); |
| 63 | allocated = 0; |
64 | allocated = 0; |
| 64 | for (i=0;i < (MAX_FRAMES >> order);i++) { |
65 | for (i = 0; i < (MAX_FRAMES >> order); i++) { |
| 65 | frames[allocated] = frame_alloc(FRAME_NON_BLOCKING | FRAME_KA,order, &status); |
66 | frames[allocated] = frame_alloc(FRAME_NON_BLOCKING | FRAME_KA, order, &status); |
| 66 | if (status == 0) { |
67 | if (status == 0) { |
| 67 | memsetb(frames[allocated], (1 << order) * FRAME_SIZE, val); |
68 | memsetb(frames[allocated], FRAME_SIZE << order, val); |
| 68 | allocated++; |
69 | allocated++; |
| 69 | } else { |
70 | } else { |
| 70 | break; |
71 | break; |
| 71 | } |
72 | } |
| 72 | } |
73 | } |
| 73 | - | ||
| 74 | printf("Thread #%d: %d blocks alocated.\n",val, allocated); |
74 | printf("Thread #%d: %d blocks allocated.\n", THREAD->tid, allocated); |
| 75 | 75 | ||
| 76 | printf("Thread #%d: Deallocating ... \n", val); |
76 | printf("Thread #%d: Deallocating ... \n", THREAD->tid); |
| 77 | for (i=0;i<allocated;i++) { |
77 | for (i = 0; i < allocated; i++) { |
| 78 | - | ||
| 79 | for (k=0;k<=((FRAME_SIZE << order) - 1);k++) { |
78 | for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) { |
| 80 | if ( ((char *) frames[i])[k] != val ) { |
79 | if (((__u8 *) frames[i])[k] != val) { |
| 81 | printf("Thread #%d: Unexpected data in block %P offset %X\n",val, frames[i], k); |
80 | printf("Thread #%d: Unexpected data (%d) in block %P offset %X\n", THREAD->tid, ((char *) frames[i])[k], frames[i], k); |
| 82 | failed(); |
81 | failed(); |
| 83 | } |
82 | } |
| 84 | - | ||
| 85 | } |
83 | } |
| 86 | - | ||
| 87 | frame_free(frames[i]); |
84 | frame_free(frames[i]); |
| 88 | } |
85 | } |
| 89 | printf("Thread #%d: Finished run.\n", val); |
86 | printf("Thread #%d: Finished run.\n", val); |
| 90 | } |
87 | } |
| 91 | } |
88 | } |
| 92 | 89 | ||
| - | 90 | free(frames); |
|
| 93 | 91 | ||
| 94 | atomic_dec(&thread_count); |
92 | atomic_dec(&thread_count); |
| 95 | - | ||
| 96 | } |
93 | } |
| 97 | 94 | ||
| 98 | 95 | ||
| 99 | void failed(void) { |
96 | void failed(void) |
| - | 97 | { |
|
| 100 | panic("Test failed.\n"); |
98 | panic("Test failed.\n"); |
| 101 | } |
99 | } |
| 102 | 100 | ||
| 103 | 101 | ||
| 104 | void test(void) { |
102 | void test(void) |
| - | 103 | { |
|
| 105 | int i; |
104 | int i; |
| 106 | 105 | ||
| 107 | atomic_set(&thread_count, THREADS); |
106 | atomic_set(&thread_count, THREADS); |
| 108 | 107 | ||
| 109 | for (i=1;i<=THREADS;i++) { |
108 | for (i = 0; i < THREADS; i++) { |
| 110 | thread_t * thrd; |
109 | thread_t * thrd; |
| 111 | thrd = thread_create(thread, &i, TASK, 0); |
110 | thrd = thread_create(thread, NULL, TASK, 0); |
| - | 111 | if (thrd) |
|
| 112 | if (thrd) thread_ready(thrd); else failed(); |
112 | thread_ready(thrd); |
| - | 113 | else |
|
| - | 114 | failed(); |
|
| 113 | } |
115 | } |
| 114 | 116 | ||
| 115 | while (thread_count.count); |
117 | while (thread_count.count) |
| - | 118 | ; |
|
| 116 | 119 | ||
| 117 | printf("Test passed\n"); |
120 | printf("Test passed.\n"); |
| 118 | } |
121 | } |
| 119 | - | ||
| 120 | 122 | ||