Subversion Repositories HelenOS

Rev

Rev 4055 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
3918 decky 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  3141592
46 
 
47 
static inline long double sqrt(long double a)
48 
{
49 
    long double x = 1;
50 
    long double lx = 0;
51 
 
52 
    if (a < 0.00000000000000001)
53 
        return 0;
54 
 
55 
    while (x != lx) {
56 
        lx = x;
57 
        x = (x + (a / x)) / 2;
58 
    }
59 
 
60 
    return x;
61 
}
62 
 
63 
static atomic_t threads_ok;
64 
static atomic_t threads_fault;
65 
static waitq_t can_start;
66 
 
67 
static void e(void *data)
68 
{
69 
    int i;
70 
    double e, d, le, f;
71 
 
72 
    thread_detach(THREAD);
73 
 
74 
    waitq_sleep(&can_start);
75 
 
76 
    for (i = 0; i<ATTEMPTS; i++) {
77 
        le = -1;
78 
        e = 0;
79 
        f = 1;
80 
 
81 
        for (d = 1; e != le; d *= f, f += 1) {
82 
            le = e;
83 
            e = e + 1 / d;
84 
        }
85 
 
86 
        if ((int) (100000000 * e) != E_10e8) {
4296 trochtova 87 
            TPRINTF("tid%" PRIu64 ": e*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (100000000 * e), (unative_t) E_10e8);
3918 decky 88 
            atomic_inc(&threads_fault);
89 
            break;
90 
        }
91 
    }
92 
    atomic_inc(&threads_ok);
93 
}
94 
 
95 
static void pi(void *data)
96 
{
97 
    int i;
98 
    double lpi, pi;
99 
    double n, ab, ad;
100 
 
101 
    thread_detach(THREAD);
102 
 
103 
    waitq_sleep(&can_start);
104 
 
105 
    for (i = 0; i < ATTEMPTS; i++) {
106 
        lpi = -1;
107 
        pi = 0;
108 
 
109 
        for (n = 2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) {
110 
            double sc, cd;
111 
 
112 
            sc = sqrt(1 - (ab * ab / 4));
113 
            cd = 1 - sc;
114 
            ad = sqrt(ab * ab / 4 + cd * cd);
115 
            lpi = pi;
116 
            pi = 2 * n * ad;
117 
        }
118 
 
119 
        if ((int) (1000000 * pi) != PI_10e8) {
4296 trochtova 120 
            TPRINTF("tid%" PRIu64 ": pi*10e8=%zd should be %" PRIun "\n", THREAD->tid, (unative_t) (1000000 * pi), (unative_t) (PI_10e8 / 100));
3918 decky 121 
            atomic_inc(&threads_fault);
122 
            break;
123 
        }
124 
    }
125 
    atomic_inc(&threads_ok);
126 
}
127 
 
4296 trochtova 128 
char *test_fpu1(void)
3918 decky 129 
{
130 
    unsigned int i, total = 0;
131 
 
132 
    waitq_initialize(&can_start);
133 
    atomic_set(&threads_ok, 0);
134 
    atomic_set(&threads_fault, 0);
135 
 
4296 trochtova 136 
    TPRINTF("Creating %u threads... ", 2 * THREADS);
3918 decky 137 
 
4296 trochtova 138 
    for (i = 0; i < THREADS; i++) {
3918 decky 139 
        thread_t *t;
140 
 
141 
        if (!(t = thread_create(e, NULL, TASK, 0, "e", false))) {
4296 trochtova 142 
            TPRINTF("could not create thread %u\n", 2 * i);
3918 decky 143 
            break;
144 
        }
145 
        thread_ready(t);
146 
        total++;
147 
 
148 
        if (!(t = thread_create(pi, NULL, TASK, 0, "pi", false))) {
4296 trochtova 149 
            TPRINTF("could not create thread %u\n", 2 * i + 1);
3918 decky 150 
            break;
151 
        }
152 
        thread_ready(t);
153 
        total++;
154 
    }
155 
 
4296 trochtova 156 
    TPRINTF("ok\n");
3918 decky 157 
 
158 
    thread_sleep(1);
159 
    waitq_wakeup(&can_start, WAKEUP_ALL);
160 
 
161 
    while (atomic_get(&threads_ok) != (long) total) {
4296 trochtova 162 
        TPRINTF("Threads left: %d\n", total - atomic_get(&threads_ok));
3918 decky 163 
        thread_sleep(1);
164 
    }
165 
 
166 
    if (atomic_get(&threads_fault) == 0)
167 
        return NULL;
168 
 
169 
    return "Test failed";
170 
}