Subversion Repositories HelenOS

Rev

Rev 2029 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2029 Rev 2042
1
/*
1
/*
2
 * Copyright (C) 2005 Jakub Vana
2
 * Copyright (C) 2005 Jakub Vana
3
 * Copyright (C) 2005 Jakub Jermar
3
 * Copyright (C) 2005 Jakub Jermar
4
 * All rights reserved.
4
 * All rights reserved.
5
 *
5
 *
6
 * Redistribution and use in source and binary forms, with or without
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions
7
 * modification, are permitted provided that the following conditions
8
 * are met:
8
 * are met:
9
 *
9
 *
10
 * - Redistributions of source code must retain the above copyright
10
 * - Redistributions of source code must retain the above copyright
11
 *   notice, this list of conditions and the following disclaimer.
11
 *   notice, this list of conditions and the following disclaimer.
12
 * - Redistributions in binary form must reproduce the above copyright
12
 * - Redistributions in binary form must reproduce the above copyright
13
 *   notice, this list of conditions and the following disclaimer in the
13
 *   notice, this list of conditions and the following disclaimer in the
14
 *   documentation and/or other materials provided with the distribution.
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
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.
16
 *   derived from this software without specific prior written permission.
17
 *
17
 *
18
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
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
19
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
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
24
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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
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.
27
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
 */
28
 */
29
 
29
 
30
#if (defined(ia32) || defined(amd64) || defined(ia64) || defined(ia32xen))
30
#if (defined(ia32) || defined(amd64) || defined(ia64) || defined(ia32xen))
31
 
31
 
32
#include <print.h>
32
#include <print.h>
33
#include <debug.h>
33
#include <debug.h>
34
 
34
 
35
#include <test.h>
35
#include <test.h>
36
#include <atomic.h>
36
#include <atomic.h>
37
#include <proc/thread.h>
37
#include <proc/thread.h>
38
 
38
 
39
#include <arch.h>
39
#include <arch.h>
40
#include <arch/arch.h>
40
#include <arch/arch.h>
41
 
41
 
42
 
42
 
43
#define THREADS     150
43
#define THREADS     150
44
#define ATTEMPTS    100
44
#define ATTEMPTS    100
45
 
45
 
46
#define E_10e8  271828182
46
#define E_10e8  271828182
47
#define PI_10e8 314159265
47
#define PI_10e8 314159265
48
 
48
 
49
 
49
 
50
#ifdef KERN_ia32_ARCH_H_
50
#ifdef KERN_ia32_ARCH_H_
51
static inline double sqrt(double x)
51
static inline double sqrt(double x)
52
{
52
{
53
    double v;
53
    double v;
54
   
54
   
55
    asm (
55
    asm (
56
        "fsqrt\n"
56
        "fsqrt\n"
57
        : "=t" (v)
57
        : "=t" (v)
58
        : "0" (x)
58
        : "0" (x)
59
    );
59
    );
60
   
60
   
61
    return v;
61
    return v;
62
}
62
}
63
#endif
63
#endif
64
 
64
 
65
#ifdef KERN_amd64_ARCH_H_
65
#ifdef KERN_amd64_ARCH_H_
66
static inline double sqrt(double x)
66
static inline double sqrt(double x)
67
{
67
{
68
    double v;
68
    double v;
69
   
69
   
70
    asm (
70
    asm (
71
        "fsqrt\n"
71
        "fsqrt\n"
72
        : "=t" (v)
72
        : "=t" (v)
73
        : "0" (x)
73
        : "0" (x)
74
    );
74
    );
75
   
75
   
76
    return v;
76
    return v;
77
}
77
}
78
#endif
78
#endif
79
 
79
 
80
#ifdef KERN_ia64_ARCH_H_
80
#ifdef KERN_ia64_ARCH_H_
81
 
81
 
82
#undef PI_10e8  
82
#undef PI_10e8  
83
#define PI_10e8 3141592
83
#define PI_10e8 3141592
84
 
84
 
85
static inline long double sqrt(long double a)
85
static inline long double sqrt(long double a)
86
{  
86
{  
87
    long double x = 1;
87
    long double x = 1;
88
    long double lx = 0;
88
    long double lx = 0;
89
 
89
 
90
    if (a < 0.00000000000000001)
90
    if (a < 0.00000000000000001)
91
        return 0;
91
        return 0;
92
       
92
       
93
    while(x != lx) {
93
    while(x != lx) {
94
        lx = x;
94
        lx = x;
95
        x = (x + (a / x)) / 2;
95
        x = (x + (a / x)) / 2;
96
    }
96
    }
97
   
97
   
98
    return x;
98
    return x;
99
}
99
}
100
#endif
100
#endif
101
 
101
 
102
 
102
 
103
static atomic_t threads_ok;
103
static atomic_t threads_ok;
104
static atomic_t threads_fault;
104
static atomic_t threads_fault;
105
static waitq_t can_start;
105
static waitq_t can_start;
106
 
106
 
107
static void e(void *data)
107
static void e(void *data)
108
{
108
{
109
    int i;
109
    int i;
110
    double e,d,le,f;
110
    double e,d,le,f;
111
 
111
 
112
    thread_detach(THREAD);
112
    thread_detach(THREAD);
113
 
113
 
114
    waitq_sleep(&can_start);
114
    waitq_sleep(&can_start);
115
 
115
 
116
    for (i = 0; i<ATTEMPTS; i++) {
116
    for (i = 0; i<ATTEMPTS; i++) {
117
        le = -1;
117
        le = -1;
118
        e = 0;
118
        e = 0;
119
        f = 1;
119
        f = 1;
120
 
120
 
121
        for (d = 1; e != le; d *= f, f += 1) {
121
        for (d = 1; e != le; d *= f, f += 1) {
122
            le = e;
122
            le = e;
123
            e = e + 1 / d;
123
            e = e + 1 / d;
124
        }
124
        }
125
 
125
 
126
        if ((int) (100000000 * e) != E_10e8) {
126
        if ((int) (100000000 * e) != E_10e8) {
127
            printf("tid%d: e*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8);
127
            printf("tid%d: e*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8);
128
            atomic_inc(&threads_fault);
128
            atomic_inc(&threads_fault);
129
            break;
129
            break;
130
        }
130
        }
131
    }
131
    }
132
    atomic_inc(&threads_ok);
132
    atomic_inc(&threads_ok);
133
}
133
}
134
 
134
 
135
static void pi(void *data)
135
static void pi(void *data)
136
{
136
{
137
    int i;
137
    int i;
138
    double lpi, pi;
138
    double lpi, pi;
139
    double n, ab, ad;
139
    double n, ab, ad;
140
   
140
   
141
    thread_detach(THREAD);
141
    thread_detach(THREAD);
142
 
142
 
143
    waitq_sleep(&can_start);
143
    waitq_sleep(&can_start);
144
 
144
 
145
    for (i = 0; i < ATTEMPTS; i++) {
145
    for (i = 0; i < ATTEMPTS; i++) {
146
        lpi = -1;
146
        lpi = -1;
147
        pi = 0;
147
        pi = 0;
148
 
148
 
149
        for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) {
149
        for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) {
150
            double sc, cd;
150
            double sc, cd;
151
 
151
 
152
            sc = sqrt(1 - (ab * ab / 4));
152
            sc = sqrt(1 - (ab * ab / 4));
153
            cd = 1 - sc;
153
            cd = 1 - sc;
154
            ad = sqrt(ab * ab / 4 + cd * cd);
154
            ad = sqrt(ab * ab / 4 + cd * cd);
155
            lpi = pi;
155
            lpi = pi;
156
            pi = 2 * n * ad;
156
            pi = 2 * n * ad;
157
        }
157
        }
158
 
158
 
159
#ifdef KERN_ia64_ARCH_H_
159
#ifdef KERN_ia64_ARCH_H_
160
        if ((int) (1000000 * pi) != PI_10e8) {
160
        if ((int) (1000000 * pi) != PI_10e8) {
161
            printf("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (1000000 * pi), (unative_t) (PI_10e8 / 100));
161
            printf("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (1000000 * pi), (unative_t) (PI_10e8 / 100));
162
            atomic_inc(&threads_fault);
162
            atomic_inc(&threads_fault);
163
            break;
163
            break;
164
        }
164
        }
165
#else
165
#else
166
        if ((int) (100000000 * pi) != PI_10e8) {
166
        if ((int) (100000000 * pi) != PI_10e8) {
167
            printf("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000 * pi), (unative_t) PI_10e8);
167
            printf("tid%d: pi*10e8=%zd should be %zd\n", THREAD->tid, (unative_t) (100000000 * pi), (unative_t) PI_10e8);
168
            atomic_inc(&threads_fault);
168
            atomic_inc(&threads_fault);
169
            break;
169
            break;
170
        }
170
        }
171
#endif
171
#endif
172
    }
172
    }
173
    atomic_inc(&threads_ok);
173
    atomic_inc(&threads_ok);
174
}
174
}
175
 
175
 
176
char * test_fpu1(void)
176
char * test_fpu1(void)
177
{
177
{
178
    unsigned int i, total = 0;
178
    unsigned int i, total = 0;
179
 
179
 
180
    waitq_initialize(&can_start);
180
    waitq_initialize(&can_start);
181
    atomic_set(&threads_ok, 0);
181
    atomic_set(&threads_ok, 0);
182
    atomic_set(&threads_fault, 0);
182
    atomic_set(&threads_fault, 0);
183
    printf("Creating %d threads... ", 2 * THREADS);
183
    printf("Creating %d threads... ", 2 * THREADS);
184
 
184
 
185
    for (i = 0; i < THREADS; i++) {  
185
    for (i = 0; i < THREADS; i++) {  
186
        thread_t *t;
186
        thread_t *t;
187
       
187
       
188
        if (!(t = thread_create(e, NULL, TASK, 0, "e"))) {
188
        if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) {
189
            printf("could not create thread %d\n", 2 * i);
189
            printf("could not create thread %d\n", 2 * i);
190
            break;
190
            break;
191
        }
191
        }
192
        thread_ready(t);
192
        thread_ready(t);
193
        total++;
193
        total++;
194
       
194
       
195
        if (!(t = thread_create(pi, NULL, TASK, 0, "pi"))) {
195
        if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) {
196
            printf("could not create thread %d\n", 2 * i + 1);
196
            printf("could not create thread %d\n", 2 * i + 1);
197
            break;
197
            break;
198
        }
198
        }
199
        thread_ready(t);
199
        thread_ready(t);
200
        total++;
200
        total++;
201
    }
201
    }
202
    printf("ok\n");
202
    printf("ok\n");
203
   
203
   
204
    thread_sleep(1);
204
    thread_sleep(1);
205
    waitq_wakeup(&can_start, WAKEUP_ALL);
205
    waitq_wakeup(&can_start, WAKEUP_ALL);
206
   
206
   
207
    while (atomic_get(&threads_ok) != total) {
207
    while (atomic_get(&threads_ok) != total) {
208
        printf("Threads left: %d\n", total - atomic_get(&threads_ok));
208
        printf("Threads left: %d\n", total - atomic_get(&threads_ok));
209
        thread_sleep(1);
209
        thread_sleep(1);
210
    }
210
    }
211
   
211
   
212
    if (atomic_get(&threads_fault) == 0)
212
    if (atomic_get(&threads_fault) == 0)
213
        return NULL;
213
        return NULL;
214
   
214
   
215
    return "Test failed";
215
    return "Test failed";
216
}
216
}
217
 
217
 
218
#endif
218
#endif
219
 
219