-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathILM_bfloat16.cpp
More file actions
265 lines (232 loc) · 8.4 KB
/
ILM_bfloat16.cpp
File metadata and controls
265 lines (232 loc) · 8.4 KB
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <limits.h>
#include <inttypes.h>
#define FLOAT_MANT_BITS (23)
#define FLOAT_EXPO_BITS (8)
#define FLOAT_EXPO_BIAS (127)
#define FLOAT_MANT_MASK (~((~0u) << (FLOAT_MANT_BITS+1))) /* incl. integer bit */
#define EXPO_ADJUST (1) /* adjustment for performance reasons */
#define MIN_NORM_EXPO (1) /* minimum biased exponent of normals */
#define MAX_NORM_EXPO (254) /* maximum biased exponent of normals */
#define INF_EXPO (255) /* biased exponent of infinities */
#define EXPO_MASK (~((~0u) << FLOAT_EXPO_BITS))
#define FLOAT_SIGN_MASK (0x80000000u)
#define FLOAT_IMPLICIT_BIT (1 << FLOAT_MANT_BITS)
#define RND_BIT_SHIFT (31)
#define RND_BIT_MASK (1u << RND_BIT_SHIFT)
#define FLOAT_INFINITY (0x7f800000)
#define FLOAT_INDEFINITE (0xffc00000u)
#define MANT_LSB (0x00000001)
#define FLOAT_QNAN_BIT (0x00400000)
#define MAX_SHIFT (FLOAT_MANT_BITS + 2)
void float2bfloat(const float src, float& dst) {
const uint16_t* p = reinterpret_cast<const uint16_t*>(&src);
uint16_t* q = reinterpret_cast<uint16_t*>(&dst);
#if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
q[0] = p[0];
q[1] = 0;
#else
q[0] = 0;
q[1] = p[1];
#endif
}
uint8_t LOD(uint8_t val){
uint32_t n = 0, x;
x = val;
if (x <= 0x0000ffff) n += 16, x <<= 16;
if (x <= 0x00ffffff) n += 8, x <<= 8;
if (x <= 0x0fffffff) n += 4, x <<= 4;
if (x <= 0x3fffffff) n += 2, x <<= 2;
if (x <= 0x7fffffff) n++;
return 31 - n;
}
uint16_t ILM(uint8_t a, uint8_t b, uint8_t iter){
/*
a, b -> input operands,
iter -> number of iterations
only two iterations supported
*/
if (a == 0 || b == 0) return 0;
uint8_t Ka, Kb;
Ka = LOD(a);
Kb = LOD(b);
uint8_t ResA, ResB, Res2B;
ResA = a ^ (1 << Ka);
ResB = b ^ (1 << Kb);
uint16_t prod0, prod1;
prod0 = a * (1<<Kb) + ResB * (1<<Ka);
prod1 = 0;
if(iter == 2){
Ka = LOD(ResA);
Kb = LOD(ResB);
Res2B = ResB ^ (1 << Kb);
prod1 = ResA * (1<<Kb) + Res2B * (1<<Ka);
}
return prod0 + prod1;
}
uint32_t fp32_mul_core (uint32_t a, uint32_t b, uint8_t iter)
{
uint64_t prod;
uint32_t expoa, expob, manta, mantb, shift;
uint32_t r, signr, expor, mantr_hi, mantr_lo;
/* split arguments into sign, exponent, significand */
expoa = ((a >> FLOAT_MANT_BITS) & EXPO_MASK) - EXPO_ADJUST;
expob = ((b >> FLOAT_MANT_BITS) & EXPO_MASK) - EXPO_ADJUST;
manta = (a | FLOAT_IMPLICIT_BIT) & FLOAT_MANT_MASK;
mantb = (b | FLOAT_IMPLICIT_BIT) & FLOAT_MANT_MASK;
/* result sign bit: XOR sign argument signs */
signr = (a ^ b) & FLOAT_SIGN_MASK;
if ((expoa >= (MAX_NORM_EXPO - EXPO_ADJUST)) || /* at least one argument is special */
(expob >= (MAX_NORM_EXPO - EXPO_ADJUST))) {
if ((a & ~FLOAT_SIGN_MASK) > FLOAT_INFINITY) { /* a is NaN */
/* return quietened NaN */
return a | FLOAT_QNAN_BIT;
}
if ((b & ~FLOAT_SIGN_MASK) > FLOAT_INFINITY) { /* b is NaN */
/* return quietened NaN */
return b | FLOAT_QNAN_BIT;
}
if ((a & ~FLOAT_SIGN_MASK) == 0) { /* a is zero */
/* return NaN if b is infinity, else zero */
return (expob != (INF_EXPO - EXPO_ADJUST)) ? signr : FLOAT_INDEFINITE;
}
if ((b & ~FLOAT_SIGN_MASK) == 0) { /* b is zero */
/* return NaN if a is infinity, else zero */
return (expoa != (INF_EXPO - EXPO_ADJUST)) ? signr : FLOAT_INDEFINITE;
}
if (((a & ~FLOAT_SIGN_MASK) == FLOAT_INFINITY) || /* a or b infinity */
((b & ~FLOAT_SIGN_MASK) == FLOAT_INFINITY)) {
return signr | FLOAT_INFINITY;
}
if ((int32_t)expoa < (MIN_NORM_EXPO - EXPO_ADJUST)) { /* a is subnormal */
/* normalize significand of a */
manta = a & FLOAT_MANT_MASK;
expoa++;
do {
manta = 2 * manta;
expoa--;
} while (manta < FLOAT_IMPLICIT_BIT);
} else if ((int32_t)expob < (MIN_NORM_EXPO - EXPO_ADJUST)) { /* b is subnormal */
/* normalize significand of b */
mantb = b & FLOAT_MANT_MASK;
expob++;
do {
mantb = 2 * mantb;
expob--;
} while (mantb < FLOAT_IMPLICIT_BIT);
}
}
/* result exponent: add argument exponents and adjust for biasing */
expor = expoa + expob - FLOAT_EXPO_BIAS + 2 * EXPO_ADJUST;
mantb = mantb ; /* preshift to align result signficand */
/* result significand: multiply argument signficands */
uint8_t mantA_short = manta >> 16; // Take only 8 bits (1 plus 7 bits of mantissa)
uint8_t mantB_short = mantb >> 16; // Take only 8 bits (1 plus 7 bits of mantissa)
uint16_t p_short = ILM(mantA_short,mantB_short,iter);
prod = (uint64_t)p_short << 32;
prod = prod << FLOAT_EXPO_BITS;
mantr_hi = (uint32_t)(prod >> 32);
mantr_lo = (uint32_t)(prod >> 0);
/* normalize significand */
if (mantr_hi < FLOAT_IMPLICIT_BIT) {
mantr_hi = (mantr_hi << 1) | (mantr_lo >> (32 - 1));
mantr_lo = (mantr_lo << 1);
expor--;
}
if (expor <= (MAX_NORM_EXPO - EXPO_ADJUST)) { /* normal, may overflow to infinity during rounding */
/* combine biased exponent, sign and signficand */
r = (expor << FLOAT_MANT_BITS) + signr + mantr_hi;
/* round result to nearest or even; overflow to infinity possible */
r = r + ((mantr_lo == RND_BIT_MASK) ? (mantr_hi & MANT_LSB) : (mantr_lo >> RND_BIT_SHIFT));
} else if ((int32_t)expor > (MAX_NORM_EXPO - EXPO_ADJUST)) { /* overflow */
/* return infinity */
r = signr | FLOAT_INFINITY;
} else { /* underflow */
/* return zero, normal, or smallest subnormal */
shift = 0 - expor;
if (shift > MAX_SHIFT) shift = MAX_SHIFT;
/* denormalize significand */
mantr_lo = mantr_hi << (32 - shift) | (mantr_lo ? 1 : 0);
mantr_hi = mantr_hi >> shift;
/* combine sign and signficand; biased exponent known to be zero */
r = mantr_hi + signr;
/* round result to nearest or even */
r = r + ((mantr_lo == RND_BIT_MASK) ? (mantr_hi & MANT_LSB) : (mantr_lo >> RND_BIT_SHIFT));
}
return r;
}
uint32_t float_as_uint (float a)
{
uint32_t r;
memcpy (&r, &a, sizeof r);
return r;
}
float uint_as_float (uint32_t a)
{
float r;
memcpy (&r, &a, sizeof r);
return r;
}
float fp32_mul (float a, float b, uint8_t iter)
{
return uint_as_float (fp32_mul_core (float_as_uint (a), float_as_uint (b),iter));
}
/*
Strategija:
1. Konverzija iz Floating pointa v BFloat16 - f-ja float2bfloat
Slabosti: Groba konverzija v BFloat16, samo daje stran spodnjih 16 bitov
2. Mnozenje Bfloat16 stevil s pomocjo single precision mnozilnika.
Prednosti: Super koda. Dragac pa pri mnozenju ne smemo pozabiti da so spodnjih 16 bitov vedno enaki 0
Slabosti: Overkill za CNNove, prevec se ukvarja z nedovoljenim slucaji da je noro. Za simulacijsko verzijo je OK,
za CNN pa ne vem.
*/
#define NUM_RAND 10000
// F-ja za generiranje floating point števil
float RandomFloat(float min, float max){
return ((max - min) * ((float)rand() / RAND_MAX)) + min;
}
int main (void)
{
float a = 2.5;
float b = 3.1245;
float tmp_b,tmp_a;
FILE *log;
char p;
float2bfloat(b,tmp_b);
float2bfloat(a,tmp_a);
printf("True product %f\n", a*b);
printf("Reduced precision product %f\n", tmp_a*tmp_b);
printf("Reduced precision product %f\n", fp32_mul(tmp_a,tmp_b,2));
float p_exact, p_approx;
float RE = 0;
int i;
for(i=0;i<RAND_MAX;i++){
float2bfloat(RandomFloat(-10000,10000),tmp_a);
float2bfloat(RandomFloat(-10000,10000),tmp_b);
p_exact = tmp_a * tmp_b;
p_approx = fp32_mul(tmp_a,tmp_b,2);
if(p_exact == 0){
RE += 0;
}
else{
RE += abs(p_exact - p_approx)/abs(p_exact);
}
}
printf("Relative error %f\n ", RE/RAND_MAX/RAND_MAX);
log = fopen("log/EX_log.txt", "a");
if (log != NULL)
{
char str0[] = "--------------------------------- \n \n";
char str1[80];
fputs(str0, log);
sprintf(str1, "Exact floating point \n" );
fputs(str1, log);
sprintf(str1, "Average RE %2.10g %% \n", (RE/RAND_MAX/RAND_MAX));
fputs(str1, log);
fclose(log);
}
return 0;
}