source: mainline/kernel/test/fpu/fpu1.c@ 8a72a9a

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 8a72a9a was 8a72a9a, checked in by Martin Decky <martin@…>, 17 years ago

add empty tests for platforms which don't support them
  • Property mode set to 100644
File size: 4.7 KB
Line 
1/*
2 * Copyright (c) 2005 Jakub Vana
3 * Copyright (c) 2005 Jakub Jermar
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * - Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * - Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
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
16 * derived from this software without specific prior written permission.
17 *
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
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30#include <print.h>
31#include <debug.h>
32
33#include <test.h>
34#include <atomic.h>
35#include <proc/thread.h>
36
37#include <arch.h>
38#include <arch/arch.h>
39
40
41#define THREADS 150
42#define ATTEMPTS 100
43
44#define E_10e8 271828182
45#define PI_10e8 314159265
46
47
48#ifdef KERN_ia32_ARCH_H_
49static inline double sqrt(double x)
50{
51 double v;
52
53 asm (
54 "fsqrt\n"
55 : "=t" (v)
56 : "0" (x)
57 );
58
59 return v;
60}
61#endif
62
63#ifdef KERN_amd64_ARCH_H_
64static inline double sqrt(double x)
65{
66 double v;
67
68 asm (
69 "fsqrt\n"
70 : "=t" (v)
71 : "0" (x)
72 );
73
74 return v;
75}
76#endif
77
78#ifdef KERN_ia64_ARCH_H_
79
80#undef PI_10e8
81#define PI_10e8 3141592
82
83static inline long double sqrt(long double a)
84{
85 long double x = 1;
86 long double lx = 0;
87
88 if (a < 0.00000000000000001)
89 return 0;
90
91 while(x != lx) {
92 lx = x;
93 x = (x + (a / x)) / 2;
94 }
95
96 return x;
97}
98#endif
99
100
101static atomic_t threads_ok;
102static atomic_t threads_fault;
103static waitq_t can_start;
104static bool sh_quiet;
105
106static void e(void *data)
107{
108 int i;
109 double e, d, le, f;
110
111 thread_detach(THREAD);
112
113 waitq_sleep(&can_start);
114
115 for (i = 0; i<ATTEMPTS; i++) {
116 le = -1;
117 e = 0;
118 f = 1;
119
120 for (d = 1; e != le; d *= f, f += 1) {
121 le = e;
122 e = e + 1 / d;
123 }
124
125 if ((int) (100000000 * e) != E_10e8) {
126 if (!sh_quiet)
127 printf("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8);
128 atomic_inc(&threads_fault);
129 break;
130 }
131 }
132 atomic_inc(&threads_ok);
133}
134
135static void pi(void *data)
136{
137 int i;
138 double lpi, pi;
139 double n, ab, ad;
140
141 thread_detach(THREAD);
142
143 waitq_sleep(&can_start);
144
145 for (i = 0; i < ATTEMPTS; i++) {
146 lpi = -1;
147 pi = 0;
148
149 for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) {
150 double sc, cd;
151
152 sc = sqrt(1 - (ab * ab / 4));
153 cd = 1 - sc;
154 ad = sqrt(ab * ab / 4 + cd * cd);
155 lpi = pi;
156 pi = 2 * n * ad;
157 }
158
159#ifdef KERN_ia64_ARCH_H_
160 if ((int) (1000000 * pi) != PI_10e8) {
161 if (!sh_quiet)
162 printf("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (1000000 * pi), (unative_t) (PI_10e8 / 100));
163 atomic_inc(&threads_fault);
164 break;
165 }
166#else
167 if ((int) (100000000 * pi) != PI_10e8) {
168 if (!sh_quiet)
169 printf("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * pi), (unative_t) PI_10e8);
170 atomic_inc(&threads_fault);
171 break;
172 }
173#endif
174 }
175 atomic_inc(&threads_ok);
176}
177
178char * test_fpu1(bool quiet)
179{
180 unsigned int i, total = 0;
181 sh_quiet = quiet;
182
183 waitq_initialize(&can_start);
184 atomic_set(&threads_ok, 0);
185 atomic_set(&threads_fault, 0);
186
187 if (!quiet)
188 printf("Creating %u threads... ", 2 * THREADS);
189
190 for (i = 0; i < THREADS; i++) {
191 thread_t *t;
192
193 if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) {
194 if (!quiet)
195 printf("could not create thread %u\n", 2 * i);
196 break;
197 }
198 thread_ready(t);
199 total++;
200
201 if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) {
202 if (!quiet)
203 printf("could not create thread %u\n", 2 * i + 1);
204 break;
205 }
206 thread_ready(t);
207 total++;
208 }
209
210 if (!quiet)
211 printf("ok\n");
212
213 thread_sleep(1);
214 waitq_wakeup(&can_start, WAKEUP_ALL);
215
216 while (atomic_get(&threads_ok) != (long) total) {
217 if (!quiet)
218 printf("Threads left: %d\n", total - atomic_get(&threads_ok));
219 thread_sleep(1);
220 }
221
222 if (atomic_get(&threads_fault) == 0)
223 return NULL;
224
225 return "Test failed";
226}
Note: See TracBrowser for help on using the repository browser.