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
|
#include "test.h"
#include "../aligned.h"
#include "../avx2_gemm.h"
#include "../avx512_gemm.h"
#include "../sse2_gemm.h"
#include "../ssse3_gemm.h"
#include <cstring>
#include <iostream>
#include <math.h>
namespace intgemm {
namespace {
void QuantizeRef(const float *input, int16_t *output, float quant_mult, std::size_t size) {
for (std::size_t i = 0; i < size; ++i) {
float value = roundf(input[i] * quant_mult);
value = std::max(-32768.0f, value);
value = std::min(32767.0f, value);
output[i] = value;
}
}
void QuantizeRef(const float *input, int8_t *output, float quant_mult, std::size_t size) {
for (std::size_t i = 0; i < size; ++i) {
float value = roundf(input[i] * quant_mult);
value = std::max(-127.0f, value);
value = std::min(127.0f, value);
output[i] = value;
}
}
MeanStd EuclideanNorm(AlignedVector<float>& vals, int num_items, bool absolute) {
float normal_sums = 0;
float squares_sum = 0;
if (absolute) {
std::for_each(vals.begin(), vals.end(), [&] (float n) {normal_sums+=abs(n);});
} else {
std::for_each(vals.begin(), vals.end(), [&] (float n) {normal_sums+=n;});
}
std::for_each(vals.begin(), vals.end(), [&] (float n) {squares_sum+=n*n;});
MeanStd ret;
ret.mean = normal_sums/num_items;
ret.stddev = std::sqrt((squares_sum/num_items) - (ret.mean*ret.mean));
return ret;
}
template <MeanStd (*Backend) (const float *, const float *, bool)>
void testEuclideanNorm(int num_items, bool absolute=false) {
std::mt19937 gen;
std::uniform_real_distribution<float> dist(-1.0f, 1.0f);
AlignedVector<float> inputVec(num_items);
for (auto&& it : inputVec) {
it = dist(gen);
}
MeanStd reference = EuclideanNorm(inputVec, num_items, absolute);
MeanStd fast = Backend(inputVec.begin(), inputVec.end(), absolute);
float meanDifference = fabs(reference.mean - fast.mean);
float stdDifference = fabs(reference.stddev - fast.stddev);
float eps = 0.00002; //Accumulating horizontal sums can lead to errors.
CHECK_MESSAGE(meanDifference <= eps, "Items: " << num_items << " Absolute: " << absolute << " Reference mean: " << reference.mean << " actual: " << fast.mean);
CHECK_MESSAGE(stdDifference <= eps, "Items: " << num_items << " Absolute: " << absolute << " Reference mean: " << reference.stddev << " actual: " << fast.stddev);
}
template <class I> bool IsOff(float from, I ref, I test) {
if (ref == test) return false;
if (ref - test > 1 && test - ref > 1) return true;
float off_test = fabs((float)test - from);
float off_ref = fabs((float)ref - from);
// Allow 0.5 to round either way.
if (off_test > 0.49 && off_test < 0.51 && off_ref > 0.49 && off_ref < 0.51) return false;
return true;
}
template <class Backend> bool Test(const float *input_unaligned, float quant_mult, std::size_t size) {
typedef typename Backend::Integer Integer;
bool success = true;
AlignedVector<float> input(size);
std::memcpy(input.begin(), input_unaligned, sizeof(float) * size);
AlignedVector<Integer> ref(size);
AlignedVector<Integer> test(size);
QuantizeRef(input.begin(), ref.begin(), quant_mult, size);
Backend::Quantize(input.begin(), test.begin(), quant_mult, size);
for (std::size_t i = 0; i < size; ++i) {
if (IsOff(input[i] * quant_mult, ref[i], test[i])) {
UNSCOPED_INFO("Error at " << i << " from " << input[i] << '*' << quant_mult << '=' << (input[i]*quant_mult) << " ref = " << static_cast<int>(ref[i]) << " test = " << static_cast<int>(test[i]));
success = false;
}
}
return success;
}
template <class Backend> void TestMany(std::size_t grow) {
float input[33] = {0, 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};
float corners[33] = {-32769, -32768, -32767, -129, -128, -127, -1, 0, 1, 126, 127, 128, 129, 32766, 32768, 32769, -1.9, -1.5, -1.1, -1, -0.9, -0.5, -0.1, 0.0, 0.1, 0.5, 0.9, 1.0, 1.1, 1.5, 1.9, 16056.8, 2.5};
for (std::size_t len = 0; len <= 33; len += grow) {
CHECK(Test<Backend>(input, 1.0, len));
CHECK(Test<Backend>(input, 32.0, len));
CHECK(Test<Backend>(corners, 1.0, len));
CHECK(Test<Backend>(corners, -1.0, len));
CHECK(Test<Backend>(corners, -0.49, len));
}
}
TEST_CASE ("Quantize SSE2", "[quantize]") {
if (kCPU < CPUType::SSE2) return;
TestMany<SSE2_16bit>(8);
}
TEST_CASE ("Quantize SSSE3", "[quantize]") {
if (kCPU < CPUType::SSSE3) return;
TestMany<SSSE3_8bit>(1);
}
TEST_CASE ("Quantize AVX2", "[quantize]") {
if (kCPU < CPUType::AVX2) return;
TestMany<AVX2_8bit>(1);
TestMany<AVX2_16bit>(16);
}
#ifdef INTGEMM_COMPILER_SUPPORTS_AVX512BW
TEST_CASE ("Quantize AVX512", "[quantize]") {
if (kCPU < CPUType::AVX512BW) return;
TestMany<AVX512_8bit>(1);
TestMany<AVX512_16bit>(16);
}
#endif
TEST_CASE("QuantizeStd SSSE3", "[EuclideanNorm]") {
if (kCPU < CPUType::SSSE3) return;
testEuclideanNorm<sse2::EuclideanNorm>(64);
testEuclideanNorm<sse2::EuclideanNorm>(64, true);
testEuclideanNorm<sse2::EuclideanNorm>(256);
testEuclideanNorm<sse2::EuclideanNorm>(256, true);
testEuclideanNorm<sse2::EuclideanNorm>(2048);
testEuclideanNorm<sse2::EuclideanNorm>(2048, true);
testEuclideanNorm<sse2::EuclideanNorm>(65536);
testEuclideanNorm<sse2::EuclideanNorm>(65536, true);
testEuclideanNorm<sse2::EuclideanNorm>(81920);
testEuclideanNorm<sse2::EuclideanNorm>(81920, true);
testEuclideanNorm<sse2::EuclideanNorm>(120832);
testEuclideanNorm<sse2::EuclideanNorm>(120832, true);
}
TEST_CASE("QuantizeStd AVX2", "[EuclideanNorm]") {
if (kCPU < CPUType::AVX2) return;
testEuclideanNorm<avx2::EuclideanNorm>(64);
testEuclideanNorm<avx2::EuclideanNorm>(64, true);
testEuclideanNorm<avx2::EuclideanNorm>(256);
testEuclideanNorm<avx2::EuclideanNorm>(256, true);
testEuclideanNorm<avx2::EuclideanNorm>(2048);
testEuclideanNorm<avx2::EuclideanNorm>(2048, true);
testEuclideanNorm<avx2::EuclideanNorm>(65536);
testEuclideanNorm<avx2::EuclideanNorm>(65536, true);
testEuclideanNorm<avx2::EuclideanNorm>(81920);
testEuclideanNorm<avx2::EuclideanNorm>(81920, true);
testEuclideanNorm<avx2::EuclideanNorm>(120832);
testEuclideanNorm<avx2::EuclideanNorm>(120832, true);
}
#ifdef INTGEMM_COMPILER_SUPPORTS_AVX512BW
TEST_CASE("QuantizeStd AVX512", "[EuclideanNorm]") {
if (kCPU < CPUType::AVX512BW) return;
testEuclideanNorm<avx512f::EuclideanNorm>(64);
testEuclideanNorm<avx512f::EuclideanNorm>(64, true);
testEuclideanNorm<avx512f::EuclideanNorm>(256);
testEuclideanNorm<avx512f::EuclideanNorm>(256, true);
testEuclideanNorm<avx512f::EuclideanNorm>(2048);
testEuclideanNorm<avx512f::EuclideanNorm>(2048, true);
testEuclideanNorm<avx512f::EuclideanNorm>(65536);
testEuclideanNorm<avx512f::EuclideanNorm>(65536, true);
testEuclideanNorm<avx512f::EuclideanNorm>(81920);
testEuclideanNorm<avx512f::EuclideanNorm>(81920, true);
testEuclideanNorm<avx512f::EuclideanNorm>(120832);
testEuclideanNorm<avx512f::EuclideanNorm>(120832, true);
}
#endif
} // namespace
} // namespace intgemm
|
