Rev 4153 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4153 | Rev 4263 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2005 Jakub Vana |
2 | * Copyright (c) 2005 Jakub Vana |
3 | * Copyright (c) 2005 Jakub Jermar |
3 | * Copyright (c) 2005 Jakub Jermar |
4 | * All rights reserved. |
4 | * All rights reserved. |
5 | * |
5 | * |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
8 | * are met: |
8 | * are met: |
9 | * |
9 | * |
10 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
14 | * documentation and/or other materials provided with the distribution. |
15 | * - The name of the author may not be used to endorse or promote products |
15 | * - The name of the author may not be used to endorse or promote products |
16 | * derived from this software without specific prior written permission. |
16 | * derived from this software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
28 | */ |
29 | 29 | ||
30 | #include <print.h> |
30 | #include <print.h> |
31 | #include <debug.h> |
31 | #include <debug.h> |
32 | 32 | ||
33 | #include <test.h> |
33 | #include <test.h> |
34 | #include <atomic.h> |
34 | #include <atomic.h> |
35 | #include <proc/thread.h> |
35 | #include <proc/thread.h> |
36 | 36 | ||
37 | #include <arch.h> |
37 | #include <arch.h> |
38 | #include <arch/arch.h> |
38 | #include <arch/arch.h> |
39 | 39 | ||
40 | 40 | ||
41 | #define THREADS 150 |
41 | #define THREADS 150 |
42 | #define ATTEMPTS 100 |
42 | #define ATTEMPTS 100 |
43 | 43 | ||
44 | #define E_10e8 271828182 |
44 | #define E_10e8 271828182 |
45 | #define PI_10e8 314159265 |
45 | #define PI_10e8 314159265 |
46 | 46 | ||
47 | static inline double sqrt(double x) |
47 | static inline double sqrt(double x) |
48 | { |
48 | { |
49 | double v; |
49 | double v; |
50 | 50 | ||
51 | asm ( |
51 | asm ( |
52 | "fsqrt\n" |
52 | "fsqrt\n" |
53 | : "=t" (v) |
53 | : "=t" (v) |
54 | : "0" (x) |
54 | : "0" (x) |
55 | ); |
55 | ); |
56 | 56 | ||
57 | return v; |
57 | return v; |
58 | } |
58 | } |
59 | 59 | ||
60 | static atomic_t threads_ok; |
60 | static atomic_t threads_ok; |
61 | static atomic_t threads_fault; |
61 | static atomic_t threads_fault; |
62 | static waitq_t can_start; |
62 | static waitq_t can_start; |
63 | static bool sh_quiet; |
- | |
64 | 63 | ||
65 | static void e(void *data) |
64 | static void e(void *data) |
66 | { |
65 | { |
67 | int i; |
66 | int i; |
68 | double e, d, le, f; |
67 | double e, d, le, f; |
69 | 68 | ||
70 | thread_detach(THREAD); |
69 | thread_detach(THREAD); |
71 | 70 | ||
72 | waitq_sleep(&can_start); |
71 | waitq_sleep(&can_start); |
73 | 72 | ||
74 | for (i = 0; i<ATTEMPTS; i++) { |
73 | for (i = 0; i<ATTEMPTS; i++) { |
75 | le = -1; |
74 | le = -1; |
76 | e = 0; |
75 | e = 0; |
77 | f = 1; |
76 | f = 1; |
78 | 77 | ||
79 | for (d = 1; e != le; d *= f, f += 1) { |
78 | for (d = 1; e != le; d *= f, f += 1) { |
80 | le = e; |
79 | le = e; |
81 | e = e + 1 / d; |
80 | e = e + 1 / d; |
82 | } |
81 | } |
83 | 82 | ||
84 | if ((int) (100000000 * e) != E_10e8) { |
83 | if ((int) (100000000 * e) != E_10e8) { |
85 | if (!sh_quiet) |
- | |
86 | printf("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8); |
84 | TPRINTF("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8); |
87 | atomic_inc(&threads_fault); |
85 | atomic_inc(&threads_fault); |
88 | break; |
86 | break; |
89 | } |
87 | } |
90 | } |
88 | } |
91 | atomic_inc(&threads_ok); |
89 | atomic_inc(&threads_ok); |
92 | } |
90 | } |
93 | 91 | ||
94 | static void pi(void *data) |
92 | static void pi(void *data) |
95 | { |
93 | { |
96 | int i; |
94 | int i; |
97 | double lpi, pi; |
95 | double lpi, pi; |
98 | double n, ab, ad; |
96 | double n, ab, ad; |
99 | 97 | ||
100 | thread_detach(THREAD); |
98 | thread_detach(THREAD); |
101 | 99 | ||
102 | waitq_sleep(&can_start); |
100 | waitq_sleep(&can_start); |
103 | 101 | ||
104 | for (i = 0; i < ATTEMPTS; i++) { |
102 | for (i = 0; i < ATTEMPTS; i++) { |
105 | lpi = -1; |
103 | lpi = -1; |
106 | pi = 0; |
104 | pi = 0; |
107 | 105 | ||
108 | for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
106 | for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
109 | double sc, cd; |
107 | double sc, cd; |
110 | 108 | ||
111 | sc = sqrt(1 - (ab * ab / 4)); |
109 | sc = sqrt(1 - (ab * ab / 4)); |
112 | cd = 1 - sc; |
110 | cd = 1 - sc; |
113 | ad = sqrt(ab * ab / 4 + cd * cd); |
111 | ad = sqrt(ab * ab / 4 + cd * cd); |
114 | lpi = pi; |
112 | lpi = pi; |
115 | pi = 2 * n * ad; |
113 | pi = 2 * n * ad; |
116 | } |
114 | } |
117 | 115 | ||
118 | if ((int) (100000000 * pi) != PI_10e8) { |
116 | if ((int) (100000000 * pi) != PI_10e8) { |
119 | if (!sh_quiet) |
- | |
120 | printf("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * pi), (unative_t) PI_10e8); |
117 | TPRINTF("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * pi), (unative_t) PI_10e8); |
121 | atomic_inc(&threads_fault); |
118 | atomic_inc(&threads_fault); |
122 | break; |
119 | break; |
123 | } |
120 | } |
124 | } |
121 | } |
125 | atomic_inc(&threads_ok); |
122 | atomic_inc(&threads_ok); |
126 | } |
123 | } |
127 | 124 | ||
128 | char * test_fpu1(bool quiet) |
125 | char *test_fpu1(void) |
129 | { |
126 | { |
130 | unsigned int i, total = 0; |
127 | unsigned int i, total = 0; |
131 | sh_quiet = quiet; |
- | |
132 | 128 | ||
133 | waitq_initialize(&can_start); |
129 | waitq_initialize(&can_start); |
134 | atomic_set(&threads_ok, 0); |
130 | atomic_set(&threads_ok, 0); |
135 | atomic_set(&threads_fault, 0); |
131 | atomic_set(&threads_fault, 0); |
136 | 132 | ||
137 | if (!quiet) |
- | |
138 | printf("Creating %u threads... ", 2 * THREADS); |
133 | TPRINTF("Creating %u threads... ", 2 * THREADS); |
139 | 134 | ||
140 | for (i = 0; i < THREADS; i++) { |
135 | for (i = 0; i < THREADS; i++) { |
141 | thread_t *t; |
136 | thread_t *t; |
142 | 137 | ||
143 | if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) { |
138 | if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) { |
144 | if (!quiet) |
- | |
145 | printf("could not create thread %u\n", 2 * i); |
139 | TPRINTF("could not create thread %u\n", 2 * i); |
146 | break; |
140 | break; |
147 | } |
141 | } |
148 | thread_ready(t); |
142 | thread_ready(t); |
149 | total++; |
143 | total++; |
150 | 144 | ||
151 | if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) { |
145 | if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) { |
152 | if (!quiet) |
- | |
153 | printf("could not create thread %u\n", 2 * i + 1); |
146 | TPRINTF("could not create thread %u\n", 2 * i + 1); |
154 | break; |
147 | break; |
155 | } |
148 | } |
156 | thread_ready(t); |
149 | thread_ready(t); |
157 | total++; |
150 | total++; |
158 | } |
151 | } |
159 | 152 | ||
160 | if (!quiet) |
- | |
161 | printf("ok\n"); |
153 | TPRINTF("ok\n"); |
162 | 154 | ||
163 | thread_sleep(1); |
155 | thread_sleep(1); |
164 | waitq_wakeup(&can_start, WAKEUP_ALL); |
156 | waitq_wakeup(&can_start, WAKEUP_ALL); |
165 | 157 | ||
166 | while (atomic_get(&threads_ok) != (long) total) { |
158 | while (atomic_get(&threads_ok) != (long) total) { |
167 | if (!quiet) |
- | |
168 | printf("Threads left: %d\n", total - atomic_get(&threads_ok)); |
159 | TPRINTF("Threads left: %d\n", total - atomic_get(&threads_ok)); |
169 | thread_sleep(1); |
160 | thread_sleep(1); |
170 | } |
161 | } |
171 | 162 | ||
172 | if (atomic_get(&threads_fault) == 0) |
163 | if (atomic_get(&threads_fault) == 0) |
173 | return NULL; |
164 | return NULL; |
174 | 165 | ||
175 | return "Test failed"; |
166 | return "Test failed"; |
176 | } |
167 | } |
177 | 168 |