source: mainline/kernel/test/fpu/fpu1_x86.c@ beb368f5

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

avoid ugly ifdefs in fpu1 test

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