Rev 4153 | Go to most recent revision | 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 3141592 |
45 | #define PI_10e8 3141592 |
46 | 46 | ||
47 | static inline long double sqrt(long double a) |
47 | static inline long double sqrt(long double a) |
48 | { |
48 | { |
49 | long double x = 1; |
49 | long double x = 1; |
50 | long double lx = 0; |
50 | long double lx = 0; |
51 | 51 | ||
52 | if (a < 0.00000000000000001) |
52 | if (a < 0.00000000000000001) |
53 | return 0; |
53 | return 0; |
54 | 54 | ||
55 | while (x != lx) { |
55 | while (x != lx) { |
56 | lx = x; |
56 | lx = x; |
57 | x = (x + (a / x)) / 2; |
57 | x = (x + (a / x)) / 2; |
58 | } |
58 | } |
59 | 59 | ||
60 | return x; |
60 | return x; |
61 | } |
61 | } |
62 | 62 | ||
63 | static atomic_t threads_ok; |
63 | static atomic_t threads_ok; |
64 | static atomic_t threads_fault; |
64 | static atomic_t threads_fault; |
65 | static waitq_t can_start; |
65 | static waitq_t can_start; |
66 | static bool sh_quiet; |
- | |
67 | 66 | ||
68 | static void e(void *data) |
67 | static void e(void *data) |
69 | { |
68 | { |
70 | int i; |
69 | int i; |
71 | double e, d, le, f; |
70 | double e, d, le, f; |
72 | 71 | ||
73 | thread_detach(THREAD); |
72 | thread_detach(THREAD); |
74 | 73 | ||
75 | waitq_sleep(&can_start); |
74 | waitq_sleep(&can_start); |
76 | 75 | ||
77 | for (i = 0; i<ATTEMPTS; i++) { |
76 | for (i = 0; i<ATTEMPTS; i++) { |
78 | le = -1; |
77 | le = -1; |
79 | e = 0; |
78 | e = 0; |
80 | f = 1; |
79 | f = 1; |
81 | 80 | ||
82 | for (d = 1; e != le; d *= f, f += 1) { |
81 | for (d = 1; e != le; d *= f, f += 1) { |
83 | le = e; |
82 | le = e; |
84 | e = e + 1 / d; |
83 | e = e + 1 / d; |
85 | } |
84 | } |
86 | 85 | ||
87 | if ((int) (100000000 * e) != E_10e8) { |
86 | if ((int) (100000000 * e) != E_10e8) { |
88 | if (!sh_quiet) |
- | |
89 | printf("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8); |
87 | TPRINTF("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8); |
90 | atomic_inc(&threads_fault); |
88 | atomic_inc(&threads_fault); |
91 | break; |
89 | break; |
92 | } |
90 | } |
93 | } |
91 | } |
94 | atomic_inc(&threads_ok); |
92 | atomic_inc(&threads_ok); |
95 | } |
93 | } |
96 | 94 | ||
97 | static void pi(void *data) |
95 | static void pi(void *data) |
98 | { |
96 | { |
99 | int i; |
97 | int i; |
100 | double lpi, pi; |
98 | double lpi, pi; |
101 | double n, ab, ad; |
99 | double n, ab, ad; |
102 | 100 | ||
103 | thread_detach(THREAD); |
101 | thread_detach(THREAD); |
104 | 102 | ||
105 | waitq_sleep(&can_start); |
103 | waitq_sleep(&can_start); |
106 | 104 | ||
107 | for (i = 0; i < ATTEMPTS; i++) { |
105 | for (i = 0; i < ATTEMPTS; i++) { |
108 | lpi = -1; |
106 | lpi = -1; |
109 | pi = 0; |
107 | pi = 0; |
110 | 108 | ||
111 | for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
109 | for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
112 | double sc, cd; |
110 | double sc, cd; |
113 | 111 | ||
114 | sc = sqrt(1 - (ab * ab / 4)); |
112 | sc = sqrt(1 - (ab * ab / 4)); |
115 | cd = 1 - sc; |
113 | cd = 1 - sc; |
116 | ad = sqrt(ab * ab / 4 + cd * cd); |
114 | ad = sqrt(ab * ab / 4 + cd * cd); |
117 | lpi = pi; |
115 | lpi = pi; |
118 | pi = 2 * n * ad; |
116 | pi = 2 * n * ad; |
119 | } |
117 | } |
120 | 118 | ||
121 | if ((int) (1000000 * pi) != PI_10e8) { |
119 | if ((int) (1000000 * pi) != PI_10e8) { |
122 | if (!sh_quiet) |
- | |
123 | printf("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (1000000 * pi), (unative_t) (PI_10e8 / 100)); |
120 | TPRINTF("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (1000000 * pi), (unative_t) (PI_10e8 / 100)); |
124 | atomic_inc(&threads_fault); |
121 | atomic_inc(&threads_fault); |
125 | break; |
122 | break; |
126 | } |
123 | } |
127 | } |
124 | } |
128 | atomic_inc(&threads_ok); |
125 | atomic_inc(&threads_ok); |
129 | } |
126 | } |
130 | 127 | ||
131 | char * test_fpu1(bool quiet) |
128 | char *test_fpu1(void) |
132 | { |
129 | { |
133 | unsigned int i, total = 0; |
130 | unsigned int i, total = 0; |
134 | sh_quiet = quiet; |
- | |
135 | 131 | ||
136 | waitq_initialize(&can_start); |
132 | waitq_initialize(&can_start); |
137 | atomic_set(&threads_ok, 0); |
133 | atomic_set(&threads_ok, 0); |
138 | atomic_set(&threads_fault, 0); |
134 | atomic_set(&threads_fault, 0); |
139 | 135 | ||
140 | if (!quiet) |
- | |
141 | printf("Creating %u threads... ", 2 * THREADS); |
136 | TPRINTF("Creating %u threads... ", 2 * THREADS); |
142 | 137 | ||
143 | for (i = 0; i < THREADS; i++) { |
138 | for (i = 0; i < THREADS; i++) { |
144 | thread_t *t; |
139 | thread_t *t; |
145 | 140 | ||
146 | if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) { |
141 | if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) { |
147 | if (!quiet) |
- | |
148 | printf("could not create thread %u\n", 2 * i); |
142 | TPRINTF("could not create thread %u\n", 2 * i); |
149 | break; |
143 | break; |
150 | } |
144 | } |
151 | thread_ready(t); |
145 | thread_ready(t); |
152 | total++; |
146 | total++; |
153 | 147 | ||
154 | if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) { |
148 | if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) { |
155 | if (!quiet) |
- | |
156 | printf("could not create thread %u\n", 2 * i + 1); |
149 | TPRINTF("could not create thread %u\n", 2 * i + 1); |
157 | break; |
150 | break; |
158 | } |
151 | } |
159 | thread_ready(t); |
152 | thread_ready(t); |
160 | total++; |
153 | total++; |
161 | } |
154 | } |
162 | 155 | ||
163 | if (!quiet) |
- | |
164 | printf("ok\n"); |
156 | TPRINTF("ok\n"); |
165 | 157 | ||
166 | thread_sleep(1); |
158 | thread_sleep(1); |
167 | waitq_wakeup(&can_start, WAKEUP_ALL); |
159 | waitq_wakeup(&can_start, WAKEUP_ALL); |
168 | 160 | ||
169 | while (atomic_get(&threads_ok) != (long) total) { |
161 | while (atomic_get(&threads_ok) != (long) total) { |
170 | if (!quiet) |
- | |
171 | printf("Threads left: %d\n", total - atomic_get(&threads_ok)); |
162 | TPRINTF("Threads left: %d\n", total - atomic_get(&threads_ok)); |
172 | thread_sleep(1); |
163 | thread_sleep(1); |
173 | } |
164 | } |
174 | 165 | ||
175 | if (atomic_get(&threads_fault) == 0) |
166 | if (atomic_get(&threads_fault) == 0) |
176 | return NULL; |
167 | return NULL; |
177 | 168 | ||
178 | return "Test failed"; |
169 | return "Test failed"; |
179 | } |
170 | } |
180 | 171 |