-
-
Notifications
You must be signed in to change notification settings - Fork 847
Expand file tree
/
Copy pathcpu_ops.h
More file actions
334 lines (296 loc) · 9.78 KB
/
cpu_ops.h
File metadata and controls
334 lines (296 loc) · 9.78 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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
#ifndef BITSANDBYTES_CPU_OPS_H
#define BITSANDBYTES_CPU_OPS_H
#include "common.h"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <thread>
#include <type_traits>
#if defined(_OPENMP)
#include <omp.h>
#endif
// amx-bf16
#define TILE_M 16
#define TILE_N 16
#define TILE_K 32
// work around compiler internal error
#define BLOCK_K 128 // 4 * TILE_K
// block size for AMX gemm
constexpr int block_size_m() { return 2 * TILE_M; }
constexpr int block_size_n() { return 2 * TILE_N; }
template <typename T> inline int get_cache_blocks(int chunk_size) {
// L2 2MB and ratio of 50%
const int L2_size = 2048 * 1024 >> 1;
return std::max(1, int(L2_size / (chunk_size * sizeof(T))));
}
// forced unroll for perf critical path
#if __has_attribute(always_inline)
#define ALWAYS_INLINE __attribute__((__always_inline__)) inline
#else
#define ALWAYS_INLINE inline
#endif
template <int n> struct Unroll {
template <typename Func, typename... Args> ALWAYS_INLINE void operator()(const Func& f, Args... args) const {
Unroll<n - 1>{}(f, args...);
f(std::integral_constant<int, n - 1>{}, args...);
}
};
template <> struct Unroll<1> {
template <typename Func, typename... Args> ALWAYS_INLINE void operator()(const Func& f, Args... args) const {
f(std::integral_constant<int, 0>{}, args...);
}
};
template <typename T, typename std::enable_if<std::is_integral<T>::value, int>::type = 0> inline T div_up(T x, T y) {
return (x + y - 1) / y;
}
inline int get_max_threads() {
#if defined(_OPENMP)
return omp_get_max_threads();
#else
unsigned hc = std::thread::hardware_concurrency();
return hc == 0 ? 1 : int(hc);
#endif
}
inline int adjust_num_threads(int m) {
int actual_nth = get_max_threads();
if (m == 1)
return actual_nth;
return std::max(1, (actual_nth >> 1) * 2);
}
template <typename func_t> inline void parallel_2d(int m, int n, const func_t& f) {
// make sure we have even num_threads
int nth = adjust_num_threads(m);
// [NOTE] thread blocking:
//
// 1) prefer square block per thread
// 2) use even number of CPU cores
// 3) use all `num_threads` cores
//
// we have:
// TM * TN = T
// BM / TM = BN / TN
// then:
// TM = ((BM / BN) * T) ^ 0.5
//
float r = float(m) / n;
int nth_m = std::ceil(std::sqrt(r * nth));
int nth_n = 1;
for (; nth_m > 0; --nth_m) {
nth_n = nth / nth_m;
if (nth_m * nth_n == nth) {
break;
}
}
#if defined(_OPENMP)
#pragma omp parallel num_threads(nth)
{
int ith = omp_get_thread_num();
int ith_m = ith / nth_n;
int ith_n = ith % nth_n;
int thread_block_m = div_up(m, nth_m);
int thread_block_n = div_up(n, nth_n);
int begin_m = ith_m * thread_block_m;
int end_m = std::min(m, begin_m + thread_block_m);
int begin_n = ith_n * thread_block_n;
int end_n = std::min(n, begin_n + thread_block_n);
f(begin_m, end_m, begin_n, end_n);
}
#else
f(0, m, 0, n);
#endif
}
void quantize_cpu(float* code, float* A, float* absmax, unsigned char* out, long long blocksize, long long n);
struct fp16_t {
uint16_t v;
};
struct bf16_t {
uint16_t v;
};
static inline bf16_t float_to_bf16(float x) {
uint32_t bits;
std::memcpy(&bits, &x, 4);
uint32_t r = bits + 0x7FFF + ((bits >> 16) & 1);
return bf16_t{static_cast<uint16_t>(r >> 16)};
}
static float bf16_to_float(uint16_t bf16) {
uint32_t bits = (uint32_t)bf16 << 16;
float f;
std::memcpy(&f, &bits, sizeof(f));
return f;
}
static inline fp16_t float_to_fp16(float x) {
uint32_t bits;
std::memcpy(&bits, &x, 4);
uint32_t sign = (bits >> 31) & 0x1;
uint32_t exp = (bits >> 23) & 0xFF;
uint32_t mant = bits & 0x7FFFFF;
uint16_t h;
if (exp == 0xFF) { // Inf / NaN
uint16_t mant16 = mant ? 0x200 : 0; // quiet NaN: set MSB of mantissa
h = (sign << 15) | (0x1F << 10) | mant16;
} else if (exp > 0x70 + 0x1E) { // overflow: exp_f -127 +15 > 30 (exp_f > 142)
h = (sign << 15) | (0x1F << 10); // Inf
} else if (exp < 0x71) { // subnormal or zero (exp_f < 113)
if (exp < 0x67) { // too small -> zero (exp_f < 103)
h = (sign << 15);
} else {
// subnormal: implicit leading 1
uint32_t shift = 0x71 - exp;
uint32_t mant_with_hidden = mant | 0x800000;
// add rounding bias before shifting (23-10 =13 bits to drop + shift)
uint32_t rounded = (mant_with_hidden + (1u << (shift + 12))) >> (shift + 13);
h = (sign << 15) | (uint16_t)rounded;
}
} else {
// normalized
uint32_t exp_h = exp - 127 + 15;
// round mantissa: add 2^(23-10-1) = 0x1000
uint32_t mant_rounded = mant + 0x00001000;
if (mant_rounded & 0x00800000) { // mantissa overflow after rounding
mant_rounded = 0;
++exp_h;
if (exp_h >= 0x1F) { // overflow to Inf
h = (sign << 15) | (0x1F << 10);
return fp16_t{h};
}
}
h = (sign << 15) | ((uint16_t)exp_h << 10) | ((uint16_t)(mant_rounded >> 13));
}
return fp16_t{h};
}
inline float dDequantizeFP4(unsigned char val) {
if ((val & 0b1000) == 8)
if ((val & 0b0100) == 4)
if ((val & 0b0010) == 2)
if ((val & 0b0001) == 1)
return -0.25000000f;
else
return -0.16666667f;
else if ((val & 0b0001) == 1)
return -0.50000000f;
else
return -0.33333333f;
else if ((val & 0b0010) == 2)
if ((val & 0b0001) == 1)
return -1.00000000f;
else
return -0.66666667f;
else if ((val & 0b0001) == 1)
return -5.208333333e-03f;
else
return 0.00000000f;
else if ((val & 0b0100) == 4)
if ((val & 0b0010) == 2)
if ((val & 0b0001) == 1)
return 0.25000000f;
else
return 0.16666667f;
else if ((val & 0b0001) == 1)
return 0.50000000f;
else
return 0.33333333f;
else if ((val & 0b0010) == 2)
if ((val & 0b0001) == 1)
return 1.00000000f;
else
return 0.66666667f;
else if ((val & 0b0001) == 1)
return 5.208333333e-03f;
else
return 0.00000000f;
}
inline float dDequantizeNF4(unsigned char val) {
// the values for this tree was generated by test_normal_map_tree
// in the file tests/test_functional.py
if ((val & 0b1000) == 8)
if ((val & 0b0100) == 4) // 1
if ((val & 0b0010) == 2) // 11
if ((val & 0b0001) == 1) // 111
return 1.0f; //*1111
else
return 0.7229568362236023f; //*1110
else if ((val & 0b0001) == 1) // 110
return 0.5626170039176941f; //*1101
else
return 0.44070982933044434f; //*1100
else if ((val & 0b0010) == 2) // 10
if ((val & 0b0001) == 1) // 101
return 0.33791524171829224f; //*1011
else
return 0.24611230194568634f; //*1010
else if ((val & 0b0001) == 1) // 100
return 0.16093020141124725f; //*1001
else
return 0.07958029955625534f; //*1000
else if ((val & 0b0100) == 4) // 0
if ((val & 0b0010) == 2) // 01
if ((val & 0b0001) == 1) // 011
return 0.0f; //*0111
else
return -0.09105003625154495f; //*0110
else if ((val & 0b0001) == 1) // 010
return -0.18477343022823334f; //*0101
else
return -0.28444138169288635f; //*0100
else if ((val & 0b0010) == 2) // 00
if ((val & 0b0001) == 1) // 001
return -0.39491748809814453f; //*0011
else
return -0.5250730514526367f; //*0010
else if ((val & 0b0001) == 1) // 000
return -0.6961928009986877f; //*0001
else
return -1.0f; //*0000
}
template <typename T>
void dequantizeBlockwise8bitCpu(
float* code, unsigned char* A, const float* absmax, T* out, long long blocksize, long long n
);
template <typename T, int DATA_TYPE>
void dequantizeBlockwise4bitCpu(
unsigned char* A, const float* absmax, T* out, long long blocksize, long long m, long long n
);
#if defined(__AVX512F__)
#include <immintrin.h>
#ifdef _MSC_VER
#include <intrin.h>
static inline bool has_avx512f() {
static bool v = [] {
int info[4];
__cpuidex(info, 7, 0);
return (info[1] & (1 << 16)) != 0; // EBX bit16 AVX512F
}();
return v;
}
#if defined(__AVX512BF16__)
static inline bool has_avx512bf16() {
static bool v = [] {
int info[4];
__cpuidex(info, 7, 1);
return (info[0] & (1 << 5)) != 0; // EAX bit5 AVX512_BF16
}();
return v;
}
#endif
#else
static inline bool has_avx512f() {
static const bool supported_avx512f = __builtin_cpu_supports("avx512f");
return supported_avx512f;
}
#if defined(__AVX512BF16__)
static inline bool has_avx512bf16() {
static const bool supported_avx512bf16 = __builtin_cpu_supports("avx512bf16");
return supported_avx512bf16;
}
#endif
#endif
#endif
#if defined(__AVX512F__) && defined(__AVX512BF16__)
template <typename T, int DATA_TYPE>
void gemv_4bit_inference(
int64_t M, int64_t N, int64_t K, const T* __restrict__ x, const unsigned char* __restrict__ w,
const T* __restrict__ absmax, T* __restrict__ out, int64_t blocksize, int64_t x_stride, int64_t out_stride
);
#endif
#endif