source: mainline/kernel/test/fpu/fpu1_x86.c@ 7b213f2

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

make sure that all statically allocated strings are declared as "const char *"
and are treated as read-only

  • Property mode set to 100644
File size: 3.9 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;
63
64static void e(void *data)
65{
66 int i;
67 double e, d, le, f;
68
69 thread_detach(THREAD);
70
71 waitq_sleep(&can_start);
72
73 for (i = 0; i<ATTEMPTS; i++) {
74 le = -1;
75 e = 0;
76 f = 1;
77
78 for (d = 1; e != le; d *= f, f += 1) {
79 le = e;
80 e = e + 1 / d;
81 }
82
83 if ((int) (100000000 * e) != E_10e8) {
84 TPRINTF("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8);
85 atomic_inc(&threads_fault);
86 break;
87 }
88 }
89 atomic_inc(&threads_ok);
90}
91
92static void pi(void *data)
93{
94 int i;
95 double lpi, pi;
96 double n, ab, ad;
97
98 thread_detach(THREAD);
99
100 waitq_sleep(&can_start);
101
102 for (i = 0; i < ATTEMPTS; i++) {
103 lpi = -1;
104 pi = 0;
105
106 for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) {
107 double sc, cd;
108
109 sc = sqrt(1 - (ab * ab / 4));
110 cd = 1 - sc;
111 ad = sqrt(ab * ab / 4 + cd * cd);
112 lpi = pi;
113 pi = 2 * n * ad;
114 }
115
116 if ((int) (100000000 * pi) != PI_10e8) {
117 TPRINTF("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * pi), (unative_t) PI_10e8);
118 atomic_inc(&threads_fault);
119 break;
120 }
121 }
122 atomic_inc(&threads_ok);
123}
124
125const char *test_fpu1(void)
126{
127 unsigned int i;
128 atomic_count_t total = 0;
129
130 waitq_initialize(&can_start);
131 atomic_set(&threads_ok, 0);
132 atomic_set(&threads_fault, 0);
133
134 TPRINTF("Creating %u threads... ", 2 * THREADS);
135
136 for (i = 0; i < THREADS; i++) {
137 thread_t *t;
138
139 if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) {
140 TPRINTF("could not create thread %u\n", 2 * i);
141 break;
142 }
143 thread_ready(t);
144 total++;
145
146 if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) {
147 TPRINTF("could not create thread %u\n", 2 * i + 1);
148 break;
149 }
150 thread_ready(t);
151 total++;
152 }
153
154 TPRINTF("ok\n");
155
156 thread_sleep(1);
157 waitq_wakeup(&can_start, WAKEUP_ALL);
158
159 while (atomic_get(&threads_ok) != total) {
160 TPRINTF("Threads left: %d\n", total - atomic_get(&threads_ok));
161 thread_sleep(1);
162 }
163
164 if (atomic_get(&threads_fault) == 0)
165 return NULL;
166
167 return "Test failed";
168}
Note: See TracBrowser for help on using the repository browser.