Rev 90 | Rev 92 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 90 | Rev 91 | ||
---|---|---|---|
Line 1... | Line 1... | ||
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Jakub Vana |
2 | * Copyright (C) 2005 Jakub Vana |
- | 3 | * Copyright (C) 2005 Jakub Jermar |
|
3 | * All rights reserved. |
4 | * All rights reserved. |
4 | * |
5 | * |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
7 | * are met: |
8 | * are met: |
Line 39... | Line 40... | ||
39 | #include <test.h> |
40 | #include <test.h> |
40 | #include <arch.h> |
41 | #include <arch.h> |
41 | #include <arch/smp/atomic.h> |
42 | #include <arch/smp/atomic.h> |
42 | #include <proc/thread.h> |
43 | #include <proc/thread.h> |
43 | 44 | ||
- | 45 | #define THREADS 150*2 |
|
- | 46 | ||
- | 47 | #define E_10e8 271828182 |
|
- | 48 | #define PI_10e8 314159265 |
|
- | 49 | ||
- | 50 | static inline double sqrt(double x) { double v; __asm__ ("fsqrt\n" : "=t" (v) : "0" (x)); return v; } |
|
- | 51 | ||
- | 52 | static volatile int threads_ok; |
|
- | 53 | static waitq_t can_start; |
|
- | 54 | ||
44 | static void e(void *data) |
55 | static void e(void *data) |
45 | { |
56 | { |
46 | int i; |
- | |
47 | while(1) |
- | |
48 | { |
- | |
49 | double e,d,le,f; |
57 | double e,d,le,f; |
50 | le=-1; |
58 | le=-1; |
51 | e=0; |
59 | e=0; |
52 | f=1; |
60 | f=1; |
- | 61 | ||
53 | for(i=0,d=1;e!=le;d*=f,f+=1,i++) |
62 | waitq_sleep(&can_start); |
54 | { |
63 | |
- | 64 | for(d=1;e!=le;d*=f,f+=1) { |
|
55 | le=e; |
65 | le=e; |
56 | e=e+1/d; |
66 | e=e+1/d; |
57 | if (i>20000000) |
- | |
58 | { |
- | |
59 | // printf("tid%d: e LOOPING\n", THREAD->tid); |
- | |
60 | putchar('!'); |
- | |
61 | i = 0; |
- | |
62 | } |
- | |
63 | - | ||
64 | } |
67 | } |
65 | 68 | ||
66 | if((int)(100000000*e)==271828182) printf("tid%d: e OK\n", THREAD->tid); |
69 | if((int)(100000000*e)==E_10e8) { |
67 | else panic("tid%d: e FAILED (100000000*e=%d)\n", THREAD->tid, (int) 100000000*e); |
70 | atomic_inc((int *) &threads_ok); |
68 | } |
71 | } |
- | 72 | else |
|
- | 73 | printf("tid%d: e*10e8=%d)\n", THREAD->tid, (int) 100000000*e); |
|
69 | } |
74 | } |
70 | 75 | ||
- | 76 | static void pi(void *data) |
|
- | 77 | { |
|
- | 78 | double lpi = -1, pi = 0; |
|
- | 79 | double ab, ad; |
|
- | 80 | int n; |
|
- | 81 | ||
- | 82 | waitq_sleep(&can_start); |
|
- | 83 | ||
- | 84 | for (n=2, ab = sqrt(2); lpi != pi; n *= 2, ab = ad) { |
|
- | 85 | double sc, cd; |
|
- | 86 | ||
- | 87 | sc = sqrt(1 - (ab*ab/4)); |
|
- | 88 | cd = 1 - sc; |
|
- | 89 | ad = sqrt(ab*ab/4 + cd*cd); |
|
- | 90 | lpi = pi; |
|
- | 91 | pi = 2 * n * ad; |
|
- | 92 | } |
|
- | 93 | ||
- | 94 | if((int)(100000000*pi)==PI_10e8) { |
|
- | 95 | atomic_inc((int *) &threads_ok); |
|
- | 96 | } |
|
- | 97 | else |
|
- | 98 | printf("tid%d: pi*10e8=%d)\n", THREAD->tid, (int) 100000000*pi); |
|
- | 99 | } |
|
71 | 100 | ||
72 | 101 | ||
73 | void test(void) |
102 | void test(void) |
74 | { |
103 | { |
75 | thread_t *t; |
104 | thread_t *t; |
76 | int i; |
105 | int i; |
77 | 106 | ||
- | 107 | waitq_initialize(&can_start); |
|
- | 108 | ||
- | 109 | printf("FPU test #1\n"); |
|
- | 110 | printf("Creating %d threads... ", THREADS); |
|
- | 111 | ||
78 | for (i=0; i<4; i++) { |
112 | for (i=0; i<THREADS/2; i++) { |
79 | t = thread_create(e, NULL, TASK, 0); |
113 | if (!(t = thread_create(e, NULL, TASK, 0))) |
- | 114 | panic("could not create thread\n"); |
|
- | 115 | thread_ready(t); |
|
- | 116 | if (!(t = thread_create(pi, NULL, TASK, 0))) |
|
- | 117 | panic("could not create thread\n"); |
|
80 | thread_ready(t); |
118 | thread_ready(t); |
81 | } |
119 | } |
- | 120 | printf("ok\n"); |
|
82 | 121 | ||
83 | while(1); |
122 | thread_sleep(1); |
- | 123 | waitq_wakeup(&can_start, WAKEUP_ALL); |
|
84 | 124 | ||
- | 125 | while (threads_ok != THREADS) |
|
- | 126 | ; |
|
- | 127 | ||
- | 128 | printf("Test passed.\n"); |
|
85 | } |
129 | } |