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
|
/*******************************************************************************
* Copyright (c) 2008, 2012 Wind River Systems, Inc. and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Wind River Systems - initial API and implementation
*******************************************************************************/
package org.eclipse.tcf.internal.debug.ui.model;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;
public class TCFNumberFormat {
public static String isValidHexNumber(String s) {
int l = s.length();
if (l == 0) return "Need at least one digit";
for (int i = 0; i < l; i++) {
char ch = s.charAt(i);
if (ch >= '0' && ch <= '9') continue;
if (ch >= 'A' && ch <= 'F') continue;
if (ch >= 'a' && ch <= 'f') continue;
return "Hex digit expected";
}
return null;
}
public static String isValidDecNumber(boolean fp, String s) {
int i = 0;
int l = s.length();
if (l == 0) return "Need at least one digit";
char ch = s.charAt(i++);
if (ch == '-' || ch == '+') {
if (i >= l) return "Need at least one digit";
ch = s.charAt(i++);
}
if (fp) {
String n = s.substring(i - 1);
if (n.equals("NaN")) return null;
if (n.equals("Infinity")) return null;
}
while (ch >= '0' && ch <= '9') {
if (i >= l) return null;
ch = s.charAt(i++);
}
if (fp) {
if (ch == '.') {
if (i >= l) return null;
ch = s.charAt(i++);
while (ch >= '0' && ch <= '9') {
if (i >= l) return null;
ch = s.charAt(i++);
}
}
if (ch == 'e' || ch == 'E') {
if (i >= l) return "Invalid exponent: need at least one digit";
ch = s.charAt(i++);
if (ch == '-' || ch == '+') {
if (i >= l) return "Invalid exponent: need at least one digit";
ch = s.charAt(i++);
}
while (ch >= '0' && ch <= '9') {
if (i >= l) return null;
ch = s.charAt(i++);
}
return "Invalid exponent: decimal digit expected";
}
}
return "Decimal digit expected";
}
public static byte[] toByteArray(String s, int radix, boolean fp, int size, boolean signed, boolean big_endian) throws Exception {
byte[] bf = null;
if (!fp) {
bf = new BigInteger(s, radix).toByteArray();
}
else if (size == 4) {
int n = Float.floatToIntBits(Float.parseFloat(s));
bf = new byte[size];
for (int i = 0; i < size; i++) {
bf[i] = (byte)((n >> ((size - 1 - i) * 8)) & 0xff);
}
}
else if (size == 8) {
long n = Double.doubleToLongBits(Double.parseDouble(s));
bf = new byte[size];
for (int i = 0; i < size; i++) {
bf[i] = (byte)((n >> ((size - 1 - i) * 8)) & 0xff);
}
}
else {
throw new Exception("Unsupported floating point format");
}
byte[] rs = new byte[size];
if (signed && rs.length > bf.length && (bf[0] & 0x80) != 0) {
// Sign extension
for (int i = 0; i < rs.length; i++) rs[i] = (byte)0xff;
}
for (int i = 0; i < bf.length; i++) {
// i == 0 -> least significant byte
byte b = bf[bf.length - i - 1];
int j = big_endian ? rs.length - i - 1 : i;
if (j >= 0 && j < rs.length) rs[j] = b;
}
return rs;
}
public static String toFPString(byte[] data, boolean big_endian) {
return toFPString(data, 0, data.length, big_endian);
}
public static String toFPString(byte[] data, int offs, int size, boolean big_endian) {
assert offs + size <= data.length;
byte[] arr = new byte[size];
if (big_endian) {
System.arraycopy(data, offs, arr, 0, size);
}
else {
for (int i = 0; i < size; i++) {
arr[arr.length - i - 1] = data[offs + i];
}
}
boolean neg = (arr[0] & 0x80) != 0;
arr[0] &= 0x7f;
int precision = 0;
int exponent = 0;
boolean nan = false;
switch (size) {
case 2:
precision = 3;
exponent = (arr[0] & 0x7c) >> 2;
nan = exponent == 0x1f;
arr[0] &= 0x03;
if (exponent == 0) exponent = 1;
else arr[0] |= 0x04;
exponent -= 10; // Significand
exponent -= 15; // Exponent bias
break;
case 4:
precision = 7;
exponent = ((arr[0] & 0x7f) << 1) | ((arr[1] & 0x80) >> 7);
nan = exponent == 0xff;
arr[0] = 0;
arr[1] &= 0x7f;
if (exponent == 0) exponent = 1;
else arr[1] |= 0x80;
exponent -= 23; // Significand
exponent -= 127; // Exponent bias
break;
case 8:
precision = 16;
exponent = ((arr[0] & 0x7f) << 4) | ((arr[1] & 0xf0) >> 4);
nan = exponent == 0x7ff;
arr[0] = 0;
arr[1] &= 0x0f;
if (exponent == 0) exponent = 1;
else arr[1] |= 0x10;
exponent -= 52; // Significand
exponent -= 1023; // Exponent bias
break;
case 10:
case 16:
precision = 34;
exponent = ((arr[0] & 0x7f) << 8) | (arr[1] & 0xff);
nan = exponent == 0x7fff;
arr[0] = arr[1] = 0;
if (size == 10) {
exponent -= 63; // Significand
}
else {
if (exponent == 0) exponent = 1;
else arr[1] = 1;
exponent -= 112; // Significand
}
exponent -= 16383; // Exponent bias
break;
default:
return null;
}
if (nan) {
for (int i = 0; i < arr.length; i++) {
int n = arr[i] & 0xff;
if (size == 10 && i == 2) n &= 0x7f;
if (n != 0) return neg ? "-NaN" : "+NaN";
}
return neg ? "-Infinity" : "+Infinity";
}
BigDecimal a = new BigDecimal(new BigInteger(arr), 0);
if (a.signum() != 0 && exponent != 0) {
BigDecimal p = new BigDecimal(BigInteger.valueOf(2), 0);
if (exponent > 0) {
a = a.multiply(p.pow(exponent));
}
else {
BigDecimal b = p.pow(-exponent);
a = a.divide(b, b.precision(), RoundingMode.HALF_DOWN);
}
if (precision != 0 && a.precision() > precision) {
int scale = a.scale() - a.precision() + precision;
a = a.setScale(scale, RoundingMode.HALF_DOWN);
}
}
String s = a.toString();
if (neg) s = "-" + s;
return s;
}
public static BigInteger toBigInteger(byte[] data, boolean big_endian, boolean sign_extension) {
return toBigInteger(data, 0, data.length, big_endian, sign_extension);
}
public static BigInteger toBigInteger(byte[] data, int offs, int size, boolean big_endian, boolean sign_extension) {
assert offs + size <= data.length;
byte[] temp = null;
if (sign_extension) {
temp = new byte[size];
}
else {
temp = new byte[size + 1];
temp[0] = 0; // Extra byte to avoid sign extension by BigInteger
}
if (big_endian) {
System.arraycopy(data, offs, temp, sign_extension ? 0 : 1, size);
}
else {
for (int i = 0; i < size; i++) {
temp[temp.length - i - 1] = data[i + offs];
}
}
return new BigInteger(temp);
}
}
|
