Rev 827 | Rev 1023 | 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> |
| 39 | |||
| 91 | jermar | 40 | #define THREADS 150*2 |
| 283 | palkovsky | 41 | #define ATTEMPTS 100 |
| 91 | jermar | 42 | |
| 43 | #define E_10e8 271828182 |
||
| 44 | #define PI_10e8 314159265 |
||
| 45 | |||
| 46 | static inline double sqrt(double x) { double v; __asm__ ("fsqrt\n" : "=t" (v) : "0" (x)); return v; } |
||
| 47 | |||
| 483 | jermar | 48 | static atomic_t threads_ok; |
| 91 | jermar | 49 | static waitq_t can_start; |
| 50 | |||
| 86 | jermar | 51 | static void e(void *data) |
| 84 | vana | 52 | { |
| 92 | jermar | 53 | int i; |
| 91 | jermar | 54 | double e,d,le,f; |
| 55 | |||
| 56 | waitq_sleep(&can_start); |
||
| 57 | |||
| 92 | jermar | 58 | for (i = 0; i<ATTEMPTS; i++) { |
| 59 | le=-1; |
||
| 60 | e=0; |
||
| 61 | f=1; |
||
| 62 | |||
| 63 | for(d=1;e!=le;d*=f,f+=1) { |
||
| 64 | le=e; |
||
| 65 | e=e+1/d; |
||
| 66 | } |
||
| 67 | |||
| 68 | if((int)(100000000*e)!=E_10e8) |
||
| 1020 | vana | 69 | panic("tid%d: e*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*e),(__native) E_10e8); |
| 86 | jermar | 70 | } |
| 91 | jermar | 71 | |
| 1020 | vana | 72 | printf("tid%d: e*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*e),(__native) E_10e8); |
| 119 | jermar | 73 | atomic_inc(&threads_ok); |
| 84 | vana | 74 | } |
| 75 | |||
| 91 | jermar | 76 | static void pi(void *data) |
| 77 | { |
||
| 92 | jermar | 78 | int i; |
| 125 | jermar | 79 | double lpi, pi; |
| 80 | double n, ab, ad; |
||
| 84 | vana | 81 | |
| 91 | jermar | 82 | waitq_sleep(&can_start); |
| 84 | vana | 83 | |
| 91 | jermar | 84 | |
| 92 | jermar | 85 | for (i = 0; i<ATTEMPTS; i++) { |
| 86 | lpi = -1; |
||
| 87 | pi = 0; |
||
| 91 | jermar | 88 | |
| 125 | jermar | 89 | for (n=2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
| 90 | double sc, cd; |
||
| 92 | jermar | 91 | |
| 125 | jermar | 92 | sc = sqrt(1 - (ab*ab/4)); |
| 93 | cd = 1 - sc; |
||
| 94 | ad = sqrt(ab*ab/4 + cd*cd); |
||
| 95 | lpi = pi; |
||
| 96 | pi = 2 * n * ad; |
||
| 97 | } |
||
| 92 | jermar | 98 | |
| 99 | if((int)(100000000*pi)!=PI_10e8) |
||
| 1020 | vana | 100 | panic("tid%d: pi*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*pi),(__native) PI_10e8); |
| 91 | jermar | 101 | } |
| 92 | jermar | 102 | |
| 1020 | vana | 103 | printf("tid%d: pi*10e8=%d should be %d\n", THREAD->tid, (__native) (100000000*pi),(__native) PI_10e8); |
| 119 | jermar | 104 | atomic_inc(&threads_ok); |
| 91 | jermar | 105 | } |
| 106 | |||
| 107 | |||
| 84 | vana | 108 | void test(void) |
| 109 | { |
||
| 86 | jermar | 110 | thread_t *t; |
| 111 | int i; |
||
| 84 | vana | 112 | |
| 91 | jermar | 113 | waitq_initialize(&can_start); |
| 114 | |||
| 115 | printf("FPU test #1\n"); |
||
| 116 | printf("Creating %d threads... ", THREADS); |
||
| 117 | |||
| 118 | for (i=0; i<THREADS/2; i++) { |
||
| 119 | if (!(t = thread_create(e, NULL, TASK, 0))) |
||
| 120 | panic("could not create thread\n"); |
||
| 86 | jermar | 121 | thread_ready(t); |
| 91 | jermar | 122 | if (!(t = thread_create(pi, NULL, TASK, 0))) |
| 123 | panic("could not create thread\n"); |
||
| 124 | thread_ready(t); |
||
| 86 | jermar | 125 | } |
| 91 | jermar | 126 | printf("ok\n"); |
| 90 | vana | 127 | |
| 91 | jermar | 128 | thread_sleep(1); |
| 129 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
| 84 | vana | 130 | |
| 827 | palkovsky | 131 | while (atomic_get(&threads_ok) != THREADS) |
| 91 | jermar | 132 | ; |
| 133 | |||
| 134 | printf("Test passed.\n"); |
||
| 84 | vana | 135 | } |