[b312247] | 1 | /*
|
---|
| 2 | * Copyright (C) 2005 Jakub Vana
|
---|
[c01bd280] | 3 | * Copyright (C) 2005 Jakub Jermar
|
---|
[b312247] | 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 | */
|
---|
[6de2480e] | 29 |
|
---|
| 30 | #include <print.h>
|
---|
| 31 | #include <debug.h>
|
---|
| 32 | #include <panic.h>
|
---|
| 33 |
|
---|
| 34 | #include <test.h>
|
---|
[23684b7] | 35 | #include <atomic.h>
|
---|
[6de2480e] | 36 | #include <proc/thread.h>
|
---|
| 37 |
|
---|
[32a89bf] | 38 | #include <arch.h>
|
---|
[9e1c942] | 39 | #include <arch/arch.h>
|
---|
[32a89bf] | 40 |
|
---|
[41fa6f2] | 41 | #define THREADS 150*2
|
---|
| 42 | #define ATTEMPTS 100
|
---|
[c01bd280] | 43 |
|
---|
| 44 | #define E_10e8 271828182
|
---|
| 45 | #define PI_10e8 314159265
|
---|
| 46 |
|
---|
[9e1c942] | 47 |
|
---|
| 48 | #ifdef __ia32_ARCH_H__
|
---|
| 49 | static inline double sqrt(double x) { double v; __asm__ ("fsqrt\n" : "=t" (v) : "0" (x)); return v; }
|
---|
| 50 | #endif
|
---|
| 51 |
|
---|
| 52 | #ifdef __amd64_ARCH_H__
|
---|
[c01bd280] | 53 | static inline double sqrt(double x) { double v; __asm__ ("fsqrt\n" : "=t" (v) : "0" (x)); return v; }
|
---|
[9e1c942] | 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 |
|
---|
[c01bd280] | 74 |
|
---|
[e507afa] | 75 | static atomic_t threads_ok;
|
---|
[c01bd280] | 76 | static waitq_t can_start;
|
---|
| 77 |
|
---|
[b312247] | 78 | static void e(void *data)
|
---|
[6de2480e] | 79 | {
|
---|
[54ca3523] | 80 | int i;
|
---|
[c01bd280] | 81 | double e,d,le,f;
|
---|
| 82 |
|
---|
[8d6d76a] | 83 | thread_detach(THREAD);
|
---|
| 84 |
|
---|
[c01bd280] | 85 | waitq_sleep(&can_start);
|
---|
| 86 |
|
---|
[54ca3523] | 87 | for (i = 0; i<ATTEMPTS; i++) {
|
---|
| 88 | le=-1;
|
---|
| 89 | e=0;
|
---|
| 90 | f=1;
|
---|
[c01bd280] | 91 |
|
---|
[54ca3523] | 92 | for(d=1;e!=le;d*=f,f+=1) {
|
---|
| 93 | le=e;
|
---|
| 94 | e=e+1/d;
|
---|
| 95 | }
|
---|
| 96 |
|
---|
| 97 | if((int)(100000000*e)!=E_10e8)
|
---|
[7f1c620] | 98 | panic("tid%d: e*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000*e),(unative_t) E_10e8);
|
---|
[c01bd280] | 99 | }
|
---|
[54ca3523] | 100 |
|
---|
[7f1c620] | 101 | printf("tid%d: e*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000*e),(unative_t) E_10e8);
|
---|
[992bbb97] | 102 | atomic_inc(&threads_ok);
|
---|
[6de2480e] | 103 | }
|
---|
| 104 |
|
---|
[c01bd280] | 105 | static void pi(void *data)
|
---|
| 106 | {
|
---|
[9e1c942] | 107 |
|
---|
| 108 | #ifdef __ia64_ARCH_H__
|
---|
| 109 | #undef PI_10e8
|
---|
| 110 | #define PI_10e8 3141592
|
---|
| 111 | #endif
|
---|
| 112 |
|
---|
[8d6d76a] | 113 |
|
---|
[54ca3523] | 114 | int i;
|
---|
[76cec1e] | 115 | double lpi, pi;
|
---|
| 116 | double n, ab, ad;
|
---|
[8d6d76a] | 117 |
|
---|
| 118 | thread_detach(THREAD);
|
---|
[c01bd280] | 119 |
|
---|
| 120 | waitq_sleep(&can_start);
|
---|
| 121 |
|
---|
| 122 |
|
---|
[54ca3523] | 123 | for (i = 0; i<ATTEMPTS; i++) {
|
---|
| 124 | lpi = -1;
|
---|
| 125 | pi = 0;
|
---|
| 126 |
|
---|
[76cec1e] | 127 | for (n=2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) {
|
---|
| 128 | double sc, cd;
|
---|
[c01bd280] | 129 |
|
---|
[76cec1e] | 130 | sc = sqrt(1 - (ab*ab/4));
|
---|
| 131 | cd = 1 - sc;
|
---|
| 132 | ad = sqrt(ab*ab/4 + cd*cd);
|
---|
| 133 | lpi = pi;
|
---|
| 134 | pi = 2 * n * ad;
|
---|
| 135 | }
|
---|
[54ca3523] | 136 |
|
---|
[9e1c942] | 137 | #ifdef __ia64_ARCH_H__
|
---|
| 138 | if((int)(1000000*pi)!=PI_10e8)
|
---|
[7f1c620] | 139 | panic("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (1000000*pi),(unative_t) (PI_10e8/100));
|
---|
[9e1c942] | 140 | #else
|
---|
[54ca3523] | 141 | if((int)(100000000*pi)!=PI_10e8)
|
---|
[7f1c620] | 142 | panic("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000*pi),(unative_t) PI_10e8);
|
---|
[9e1c942] | 143 | #endif
|
---|
| 144 |
|
---|
[c01bd280] | 145 | }
|
---|
[54ca3523] | 146 |
|
---|
[7f1c620] | 147 | printf("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000*pi),(unative_t) PI_10e8);
|
---|
[992bbb97] | 148 | atomic_inc(&threads_ok);
|
---|
[c01bd280] | 149 | }
|
---|
[6de2480e] | 150 |
|
---|
| 151 | void test(void)
|
---|
| 152 | {
|
---|
[b312247] | 153 | thread_t *t;
|
---|
| 154 | int i;
|
---|
[6de2480e] | 155 |
|
---|
[c01bd280] | 156 | waitq_initialize(&can_start);
|
---|
| 157 |
|
---|
| 158 | printf("FPU test #1\n");
|
---|
| 159 | printf("Creating %d threads... ", THREADS);
|
---|
| 160 |
|
---|
| 161 | for (i=0; i<THREADS/2; i++) {
|
---|
[ff14c520] | 162 | if (!(t = thread_create(e, NULL, TASK, 0, "e")))
|
---|
[c01bd280] | 163 | panic("could not create thread\n");
|
---|
| 164 | thread_ready(t);
|
---|
[ff14c520] | 165 | if (!(t = thread_create(pi, NULL, TASK, 0, "pi")))
|
---|
[c01bd280] | 166 | panic("could not create thread\n");
|
---|
[b312247] | 167 | thread_ready(t);
|
---|
| 168 | }
|
---|
[c01bd280] | 169 | printf("ok\n");
|
---|
[af22f158] | 170 |
|
---|
[c01bd280] | 171 | thread_sleep(1);
|
---|
| 172 | waitq_wakeup(&can_start, WAKEUP_ALL);
|
---|
[6de2480e] | 173 |
|
---|
[a3eeceb6] | 174 | while (atomic_get(&threads_ok) != THREADS)
|
---|
[c01bd280] | 175 | ;
|
---|
| 176 |
|
---|
| 177 | printf("Test passed.\n");
|
---|
[6de2480e] | 178 | }
|
---|