Subversion Repositories HelenOS

Rev

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