Rev 1020 | Rev 1053 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
86 | jermar | 1 | /* |
2 | * Copyright (C) 2005 Jakub Vana |
||
91 | jermar | 3 | * Copyright (C) 2005 Jakub Jermar |
86 | 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 | */ |
||
84 | vana | 29 | |
30 | #include <print.h> |
||
31 | #include <debug.h> |
||
32 | #include <panic.h> |
||
33 | |||
34 | #include <test.h> |
||
111 | palkovsky | 35 | #include <arch/atomic.h> |
84 | vana | 36 | #include <proc/thread.h> |
37 | |||
94 | jermar | 38 | #include <arch.h> |
1023 | vana | 39 | #include <arch/arch.h> |
94 | jermar | 40 | |
1023 | vana | 41 | #define THREADS 15*2 |
42 | #define ATTEMPTS 10 |
||
91 | jermar | 43 | |
44 | #define E_10e8 271828182 |
||
45 | #define PI_10e8 314159265 |
||
46 | |||
1023 | vana | 47 | |
48 | #ifdef __ia32_ARCH_H__ |
||
91 | jermar | 49 | static inline double sqrt(double x) { double v; __asm__ ("fsqrt\n" : "=t" (v) : "0" (x)); return v; } |
1023 | vana | 50 | #endif |
91 | jermar | 51 | |
1023 | vana | 52 | #ifdef __amd64_ARCH_H__ |
53 | static inline double sqrt(double x) { double v; __asm__ ("fsqrt\n" : "=t" (v) : "0" (x)); return v; } |
||
54 | #endif |
||
55 | |||
56 | #ifdef __ia64_ARCH_H__ |
||
57 | static inline long double sqrt(long double a) |
||
58 | { |
||
59 | long double x = 1; |
||
60 | long double lx = 0; |
||
61 | |||
62 | if(a<0.00000000000000001) return 0; |
||
63 | |||
64 | while(x!=lx) |
||
65 | { |
||
66 | lx=x; |
||
67 | x=(x+(a/x))/2; |
||
68 | } |
||
69 | return x; |
||
70 | } |
||
71 | #endif |
||
72 | |||
73 | |||
74 | |||
483 | jermar | 75 | static atomic_t threads_ok; |
91 | jermar | 76 | static waitq_t can_start; |
77 | |||
86 | jermar | 78 | static void e(void *data) |
84 | vana | 79 | { |
92 | jermar | 80 | int i; |
91 | jermar | 81 | double e,d,le,f; |
82 | |||
83 | waitq_sleep(&can_start); |
||
84 | |||
92 | jermar | 85 | for (i = 0; i<ATTEMPTS; i++) { |
86 | le=-1; |
||
87 | e=0; |
||
88 | f=1; |
||
89 | |||
90 | for(d=1;e!=le;d*=f,f+=1) { |
||
91 | le=e; |
||
92 | e=e+1/d; |
||
93 | } |
||
94 | |||
95 | if((int)(100000000*e)!=E_10e8) |
||
1020 | vana | 96 | panic("tid%d: e*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*e),(__native) E_10e8); |
86 | jermar | 97 | } |
91 | jermar | 98 | |
1020 | vana | 99 | printf("tid%d: e*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*e),(__native) E_10e8); |
119 | jermar | 100 | atomic_inc(&threads_ok); |
84 | vana | 101 | } |
102 | |||
91 | jermar | 103 | static void pi(void *data) |
104 | { |
||
1023 | vana | 105 | |
106 | #ifdef __ia64_ARCH_H__ |
||
107 | #undef PI_10e8 |
||
108 | #define PI_10e8 3141592 |
||
109 | #endif |
||
110 | |||
92 | jermar | 111 | int i; |
125 | jermar | 112 | double lpi, pi; |
113 | double n, ab, ad; |
||
84 | vana | 114 | |
91 | jermar | 115 | waitq_sleep(&can_start); |
84 | vana | 116 | |
91 | jermar | 117 | |
92 | jermar | 118 | for (i = 0; i<ATTEMPTS; i++) { |
119 | lpi = -1; |
||
120 | pi = 0; |
||
91 | jermar | 121 | |
125 | jermar | 122 | for (n=2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
123 | double sc, cd; |
||
92 | jermar | 124 | |
125 | jermar | 125 | sc = sqrt(1 - (ab*ab/4)); |
126 | cd = 1 - sc; |
||
127 | ad = sqrt(ab*ab/4 + cd*cd); |
||
128 | lpi = pi; |
||
129 | pi = 2 * n * ad; |
||
130 | } |
||
92 | jermar | 131 | |
1023 | vana | 132 | #ifdef __ia64_ARCH_H__ |
133 | if((int)(1000000*pi)!=PI_10e8) |
||
134 | panic("tid%d: pi*10e8=%d should be %d\n", THREAD->tid, (__native) (1000000*pi),(__native) (PI_10e8/100)); |
||
135 | #else |
||
92 | jermar | 136 | if((int)(100000000*pi)!=PI_10e8) |
1020 | vana | 137 | panic("tid%d: pi*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*pi),(__native) PI_10e8); |
1023 | vana | 138 | #endif |
139 | |||
91 | jermar | 140 | } |
92 | jermar | 141 | |
1020 | vana | 142 | printf("tid%d: pi*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*pi),(__native) PI_10e8); |
119 | jermar | 143 | atomic_inc(&threads_ok); |
91 | jermar | 144 | } |
145 | |||
146 | |||
84 | vana | 147 | void test(void) |
148 | { |
||
86 | jermar | 149 | thread_t *t; |
150 | int i; |
||
84 | vana | 151 | |
91 | jermar | 152 | waitq_initialize(&can_start); |
153 | |||
154 | printf("FPU test #1\n"); |
||
155 | printf("Creating %d threads... ", THREADS); |
||
156 | |||
157 | for (i=0; i<THREADS/2; i++) { |
||
158 | if (!(t = thread_create(e, NULL, TASK, 0))) |
||
159 | panic("could not create thread\n"); |
||
86 | jermar | 160 | thread_ready(t); |
91 | jermar | 161 | if (!(t = thread_create(pi, NULL, TASK, 0))) |
162 | panic("could not create thread\n"); |
||
163 | thread_ready(t); |
||
86 | jermar | 164 | } |
91 | jermar | 165 | printf("ok\n"); |
90 | vana | 166 | |
91 | jermar | 167 | thread_sleep(1); |
168 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
84 | vana | 169 | |
827 | palkovsky | 170 | while (atomic_get(&threads_ok) != THREADS) |
91 | jermar | 171 | ; |
172 | |||
173 | printf("Test passed.\n"); |
||
84 | vana | 174 | } |
1023 | vana | 175 | |
176 | /* |
||
177 | static void pi(void *data) |
||
178 | { |
||
179 | #undef PI_10e8 |
||
180 | #define PI_10e8 3141592 |
||
181 | |||
182 | |||
183 | int i; |
||
184 | double lpi, pi; |
||
185 | double n, ab, ad; |
||
186 | |||
187 | |||
188 | printf("pi test\n"); |
||
189 | |||
190 | waitq_sleep(&can_start); |
||
191 | |||
192 | |||
193 | for (i = 0; i<ATTEMPTS; i++) { |
||
194 | lpi = -1; |
||
195 | pi = 0; |
||
196 | |||
197 | for (n=2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
||
198 | double sc, cd; |
||
199 | |||
200 | sc = sqrt(1 - (ab*ab/4)); |
||
201 | cd = 1 - sc; |
||
202 | ad = sqrt(ab*ab/4 + cd*cd); |
||
203 | lpi = pi; |
||
204 | pi = 2 * n * ad; |
||
205 | } |
||
206 | |||
207 | atomic_inc(&threads_ok); |
||
208 | if((int)(1000000*pi)!=PI_10e8) |
||
209 | panic("tid%d: pi*10e6=%d\n", THREAD->tid, (int) 1000000*pi); |
||
210 | } |
||
211 | |||
212 | printf("tid%d: pi*10e6=%d\n", THREAD->tid, (int) 1000000*pi); |
||
213 | } |
||
214 | */ |