1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/* $OpenBSD: preemption_float.c,v 1.5 2010/12/26 13:50:20 miod Exp $ */
/*
* Copyright (c) 1993, 1994, 1995, 1996 by Chris Provenzano and contributors,
* proven@mit.edu All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Chris Provenzano,
* the University of California, Berkeley, and contributors.
* 4. Neither the name of Chris Provenzano, the University, nor the names of
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY CHRIS PROVENZANO AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL CHRIS PROVENZANO, THE REGENTS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* Test to see if floating point state is being properly maintained
for each thread. Different threads doing floating point operations
simultaneously should not interfere with one another. This
includes operations that might change some FPU flags, such as
rounding modes, at least implicitly. */
#include <pthread.h>
#include <math.h>
#include <stdio.h>
#include "test.h"
int limit = 2;
int float_passed = 0;
int float_failed = 1;
static void *
log_loop (void *x) {
int i;
double d, d1, d2;
/* sleep (1); */
for (i = 0; i < limit; i++) {
d = 42.0;
d = log (exp (d));
d = (d + 39.0) / d;
if (i == 0)
d1 = d;
else {
d2 = d;
d = sin(d);
/* if (d2 != d1) { */
if (memcmp (&d2, &d1, sizeof(double))) {
printf("log loop: %f != %f\n", d1, d2);
pthread_exit(&float_failed);
}
}
}
pthread_exit(&float_passed);
}
static void *
trig_loop (void *x) {
int i;
double d, d1, d2;
/* sleep (1); */
for (i = 0; i < limit; i++) {
d = 35.0;
d *= M_PI;
d /= M_LN2;
d = sin (d);
d = cos (1 / d);
if (i == 0)
d1 = d;
else {
d2 = d;
d = sin(d);
/* if (d2 != d1) { */
if (memcmp (&d2, &d1, sizeof(double))) {
printf("trig loop: %f != %f\n", d1, d2);
pthread_exit(&float_failed);
}
}
}
pthread_exit(&float_passed);
}
static int
floatloop(void)
{
pthread_t thread[2];
int *x, *y;
CHECKr(pthread_create (&thread[0], NULL, trig_loop, NULL));
CHECKr(pthread_create (&thread[1], NULL, log_loop, NULL));
CHECKr(pthread_join(thread[0], (void **) &x));
CHECKr(pthread_join(thread[1], (void **) &y));
/* Return 0 for success */
return ((*y == float_failed)?2:0) |
((*x == float_failed)?1:0);
}
int
main(int argc, char *argv[])
{
pthread_t thread;
int *result;
/* single active thread, trig test */
for(limit = 2; limit < 100000; limit *=4) {
CHECKr(pthread_create (&thread, NULL, trig_loop, NULL));
CHECKr(pthread_join(thread, (void **) &result));
ASSERT(*result == 0);
}
/* single active thread, log test */
for(limit = 2; limit < 100000; limit *=4) {
CHECKr(pthread_create (&thread, NULL, log_loop, NULL));
CHECKr(pthread_join(thread, (void **) &result));
ASSERT(*result == 0);
}
/* run both threads concurrently using a higher limit */
limit *= 4;
ASSERT(floatloop() == 0);
SUCCEED;
}
|
