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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/* $XConsortium: pl_convert.c,v 1.2 94/04/17 20:22:27 mor Exp $ */
/*
Copyright (c) 1992 X Consortium
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of the X Consortium shall
not be used in advertising or otherwise to promote the sale, use or
other dealings in this Software without prior written authorization
from the X Consortium.
*/
/******************************************************************************
FOR VAX/IEEE conversions:
Copyright 1988-1991
Center for Information Technology Integration (CITI)
Information Technology Division
University of Michigan
Ann Arbor, Michigan
All Rights Reserved
Permission to use, copy, modify, and distribute this software and
its documentation for any purpose and without fee is hereby
granted, provided that the above copyright notice appear in all
copies and that both that copyright notice and this permission
notice appear in supporting documentation, and that the names of
CITI or THE UNIVERSITY OF MICHIGAN not be used in advertising or
publicity pertaining to distribution of the software without
specific, written prior permission.
THE SOFTWARE IS PROVIDED "AS IS." CITI AND THE UNIVERSITY OF
MICHIGAN DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN
NO EVENT SHALL CITI OR THE UNIVERSITY OF MICHIGAN BE LIABLE FOR ANY
SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
******************************************************************************/
#include "PEXlib.h"
#include "PEXlibint.h"
void _PEXIEEE32toDECF (srcVal, dstVal)
INPUT char *srcVal;
OUTPUT char *dstVal;
{
register CARD32 IEEEnum = *(CARD32 *) srcVal;
CARD32 *IEEEnumP = (CARD32 *) dstVal;
CARD32 result;
if ((IEEE_SIGN_MASK & IEEEnum) == MAX_IEEE_POSITIVE)
{
*IEEEnumP = MAX_VAX_POSITIVE | (0x80000000&IEEEnum)>>16;
return;
};
if ((IEEE_SIGN_MASK & IEEEnum) == MIN_IEEE_POSITIVE)
{
*IEEEnumP = MIN_VAX_POSITIVE;
return;
};
/*
* these bitfields should OR into mutually exclusive fields in
* result field.
*/
result = ((((BITMASK(8)<<23) & IEEEnum)>>23)+IEEE_TO_VAX_BIAS)<<7;
result |= ((BITMASK(7)<<16)&IEEEnum)>>16;
result |= (BITMASK(16)&IEEEnum)<<16;
result |= (0x80000000&IEEEnum)>>16;
*IEEEnumP = result;
}
void _PEXDECFtoIEEE32 (srcVal, dstVal)
INPUT char *srcVal;
OUTPUT char *dstVal;
{
register CARD32 Vaxnum = *(CARD32 *) srcVal;
CARD32 *VaxnumP = (CARD32 *) dstVal;
CARD32 result;
if ((VAX_SIGN_MASK & Vaxnum) == MAX_VAX_POSITIVE)
{
*VaxnumP = MAX_IEEE_POSITIVE |
(((0x00008000)&Vaxnum) ? 0x80000000 : 0L);
return;
}
if ((VAX_SIGN_MASK & Vaxnum) == MIN_VAX_POSITIVE)
{
*VaxnumP = MIN_IEEE_POSITIVE;
return;
}
/*
* these bitfields should OR into mutually exclusive fields in
* result field.
*/
result = ((((BITMASK(8)<<7) & Vaxnum)>>7)+VAX_TO_IEEE_BIAS)<<23;
result |= (((BITMASK(7) & Vaxnum)<<16) |
(((BITMASK(16)<<16) & Vaxnum)>>16));
result |= ( (0x00008000 & Vaxnum) ? 0x80000000 : 0L);
*VaxnumP = result;
}
#ifdef CRAY
void _PEXIEEE32toCRAY (srcVal, dstVal)
INPUT char *srcVal;
OUTPUT char *dstVal;
{
unsigned char *PC = (unsigned char *) srcVal;
float *result = (float *) dstVal;
union {
struct ieee_single is;
long l;
} c;
union {
struct cray_single vc;
float iis;
} ieee;
c.l = PC[0] << 24 | PC[1] << 16 | PC[2] << 8 | PC[3];
if (PC[0] & 0x80)
c.l |= ~0xffffffff;
if (c.is.exp == 0)
{
ieee.iis = 0.0;
}
else if (c.is.exp == 0xff)
{
/*
* If the IEEE float we are decoding indicates
* an IEEE overflow condition, we manufacture
* a Cray overflow condition.
*/
SET_MAX_SNG_CRAY (ieee.vc);
}
else
{
ieee.vc.sign = c.is.sign;
ieee.vc.exp = c.is.exp - IEEE_SNG_BIAS + CRAY_BIAS;
ieee.vc.mantissa = c.is.mantissa | (1 << 23);
ieee.vc.mantissa2 = 0;
}
*result = ieee.iis;
}
void _PEXCRAYtoIEEE32 (srcVal, dstVal)
INPUT char *srcVal;
OUTPUT char *dstVal;
{
unsigned char *PC = (unsigned char *) dstVal;
struct cray_single vc;
float *fptr;
struct ieee_single ais;
union {
struct ieee_single is;
unsigned iis;
} ieee;
fptr = (float *) &vc;
*fptr = *((float *) srcVal);
if (vc.exp >= MAX_CRAY_SNG)
{
SET_MAX_SNG_IEEE (ieee.is);
}
else if (vc.exp < MIN_CRAY_SNG ||
(vc.mantissa == 0 && vc.mantissa2 == 0))
{
/*
* On the Cray, there is no hidden mantissa bit.
* So, if the mantissa is zero, the number is zero.
*/
SET_MIN_SNG_IEEE (ieee.is);
}
else
{
ieee.is.exp = vc.exp - CRAY_BIAS + IEEE_SNG_BIAS;
ieee.is.mantissa = vc.mantissa;
/* Hidden bit removed by truncation */
}
ieee.is.sign = vc.sign;
PC[0] = ieee.iis >> 24;
PC[1] = ieee.iis >> 16;
PC[2] = ieee.iis >> 8;
PC[3] = ieee.iis;
}
#endif /* CRAY */
|
