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 <atomic.h>
|
---|
36 | #include <debug.h>
|
---|
37 | #include <proc/thread.h>
|
---|
38 | #include <memstr.h>
|
---|
39 | #include <arch.h>
|
---|
40 |
|
---|
41 | #ifdef CONFIG_BENCH
|
---|
42 | #include <arch/cycle.h>
|
---|
43 | #endif
|
---|
44 |
|
---|
45 | #define MAX_FRAMES 256
|
---|
46 | #define MAX_ORDER 8
|
---|
47 |
|
---|
48 | #define THREAD_RUNS 1
|
---|
49 | #define THREADS 8
|
---|
50 |
|
---|
51 | static void falloc(void * arg);
|
---|
52 | static void failed(void);
|
---|
53 |
|
---|
54 | static atomic_t thread_count;
|
---|
55 |
|
---|
56 | void falloc(void * arg)
|
---|
57 | {
|
---|
58 | int order, run, allocated, i;
|
---|
59 | uint8_t val = THREAD->tid % THREADS;
|
---|
60 | index_t k;
|
---|
61 |
|
---|
62 | uintptr_t * frames = (uintptr_t *) malloc(MAX_FRAMES * sizeof(uintptr_t), FRAME_ATOMIC);
|
---|
63 | ASSERT(frames != NULL);
|
---|
64 |
|
---|
65 | thread_detach(THREAD);
|
---|
66 |
|
---|
67 | for (run = 0; run < THREAD_RUNS; run++) {
|
---|
68 | for (order = 0; order <= MAX_ORDER; order++) {
|
---|
69 | printf("Thread #%d (cpu%d): Allocating %d frames blocks ... \n", THREAD->tid, CPU->id, 1 << order);
|
---|
70 | allocated = 0;
|
---|
71 | for (i = 0; i < (MAX_FRAMES >> order); i++) {
|
---|
72 | frames[allocated] = (uintptr_t)frame_alloc(order, FRAME_ATOMIC | FRAME_KA);
|
---|
73 | if (frames[allocated]) {
|
---|
74 | memsetb(frames[allocated], FRAME_SIZE << order, val);
|
---|
75 | allocated++;
|
---|
76 | } else {
|
---|
77 | break;
|
---|
78 | }
|
---|
79 | }
|
---|
80 | printf("Thread #%d (cpu%d): %d blocks allocated.\n", THREAD->tid, CPU->id, allocated);
|
---|
81 |
|
---|
82 | printf("Thread #%d (cpu%d): Deallocating ... \n", THREAD->tid, CPU->id);
|
---|
83 | for (i = 0; i < allocated; i++) {
|
---|
84 | for (k = 0; k <= ((FRAME_SIZE << order) - 1); k++) {
|
---|
85 | if (((uint8_t *) frames[i])[k] != val) {
|
---|
86 | 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);
|
---|
87 | failed();
|
---|
88 | }
|
---|
89 | }
|
---|
90 | frame_free(KA2PA(frames[i]));
|
---|
91 | }
|
---|
92 | printf("Thread #%d (cpu%d): Finished run.\n", THREAD->tid, CPU->id);
|
---|
93 | }
|
---|
94 | }
|
---|
95 |
|
---|
96 | free(frames);
|
---|
97 | printf("Thread #%d (cpu%d): Exiting\n", THREAD->tid, CPU->id);
|
---|
98 | atomic_dec(&thread_count);
|
---|
99 | }
|
---|
100 |
|
---|
101 |
|
---|
102 | void failed(void)
|
---|
103 | {
|
---|
104 | panic("Test failed.\n");
|
---|
105 | }
|
---|
106 |
|
---|
107 |
|
---|
108 | void test_falloc2(void)
|
---|
109 | {
|
---|
110 | #ifdef CONFIG_BENCH
|
---|
111 | uint64_t t0 = get_cycle();
|
---|
112 | #endif
|
---|
113 | int i;
|
---|
114 |
|
---|
115 | atomic_set(&thread_count, THREADS);
|
---|
116 |
|
---|
117 | for (i = 0; i < THREADS; i++) {
|
---|
118 | thread_t * thrd;
|
---|
119 | thrd = thread_create(falloc, NULL, TASK, 0, "falloc");
|
---|
120 | if (thrd)
|
---|
121 | thread_ready(thrd);
|
---|
122 | else
|
---|
123 | failed();
|
---|
124 | }
|
---|
125 |
|
---|
126 | while (thread_count.count)
|
---|
127 | ;
|
---|
128 |
|
---|
129 | printf("Test passed.\n");
|
---|
130 | #ifdef CONFIG_BENCH
|
---|
131 | uint64_t dt = get_cycle() - t0;
|
---|
132 | printf("Time: %.*d cycles\n", sizeof(dt) * 2, dt);
|
---|
133 | #endif
|
---|
134 | }
|
---|