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
|
/* Copyright (c) 2012, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License, version 2.0, for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
#include "my_config.h"
#include <gtest/gtest.h>
#include <algorithm>
#include <random>
#include <vector>
#include "my_byteorder.h"
#include "my_compiler.h"
#include "my_inttypes.h"
namespace alignment_unittest {
/*
Testing performance penalty of accessing un-aligned data.
Seems to about 2% on my desktop machine.
*/
class AlignmentTest : public ::testing::Test {
protected:
// Increase num_iterations for actual benchmarking!
static const int num_iterations = 1;
static const int num_records = 100 * 1000;
static int *aligned_data;
static uchar *unaligned_data;
static void SetUpTestCase() {
aligned_data = new int[num_records];
unaligned_data = new uchar[(num_records + 1) * sizeof(int)];
for (int ix = 0; ix < num_records; ++ix) {
aligned_data[ix] = ix / 10;
}
std::random_device rng;
std::mt19937 urng(rng());
std::shuffle(aligned_data, aligned_data + num_records, urng);
memcpy(unaligned_data + 1, aligned_data, num_records * sizeof(int));
}
static void TearDownTestCase() {
delete[] aligned_data;
delete[] unaligned_data;
}
void SetUp() override {
aligned_keys = new uchar *[num_records];
unaligned_keys = new uchar *[num_records];
for (int ix = 0; ix < num_records; ++ix) {
aligned_keys[ix] =
static_cast<uchar *>(static_cast<void *>(&aligned_data[ix]));
unaligned_keys[ix] = &unaligned_data[1 + (ix * sizeof(int))];
}
}
void TearDown() override {
delete[] aligned_keys;
delete[] unaligned_keys;
}
uchar **aligned_keys;
uchar **unaligned_keys;
};
int *AlignmentTest::aligned_data;
uchar *AlignmentTest::unaligned_data;
// A copy of the generic, byte-by-byte getter.
#define sint4korrgeneric(A) \
(int32)(((int32)((uchar)(A)[0])) + (((int32)((uchar)(A)[1]) << 8)) + \
(((int32)((uchar)(A)[2]) << 16)) + (((int32)((int16)(A)[3]) << 24)))
class Mem_compare_uchar_int {
public:
// SUPPRESS_UBSAN: only executed on intel, misaligned read works OK.
bool operator()(const uchar *s1, const uchar *s2) SUPPRESS_UBSAN {
return *pointer_cast<const int *>(s1) < *pointer_cast<const int *>(s2);
}
};
class Mem_compare_sint4 {
public:
bool operator()(const uchar *s1, const uchar *s2) {
return sint4korr(s1) < sint4korr(s2);
}
};
class Mem_compare_sint4_generic {
public:
bool operator()(const uchar *s1, const uchar *s2) {
return sint4korrgeneric(s1) < sint4korrgeneric(s2);
}
};
#if defined(__i386__) || defined(__x86_64__) || defined(_WIN32)
TEST_F(AlignmentTest, AlignedSort) {
for (int ix = 0; ix < num_iterations; ++ix) {
std::vector<uchar *> keys(aligned_keys, aligned_keys + num_records);
std::sort(keys.begin(), keys.end(), Mem_compare_uchar_int());
}
}
TEST_F(AlignmentTest, UnAlignedSort) {
for (int ix = 0; ix < num_iterations; ++ix) {
std::vector<uchar *> keys(unaligned_keys, unaligned_keys + num_records);
std::sort(keys.begin(), keys.end(), Mem_compare_uchar_int());
}
}
TEST_F(AlignmentTest, Sint4Sort) {
for (int ix = 0; ix < num_iterations; ++ix) {
std::vector<uchar *> keys(unaligned_keys, unaligned_keys + num_records);
std::sort(keys.begin(), keys.end(), Mem_compare_sint4());
}
}
TEST_F(AlignmentTest, Sint4SortGeneric) {
for (int ix = 0; ix < num_iterations; ++ix) {
std::vector<uchar *> keys(unaligned_keys, unaligned_keys + num_records);
std::sort(keys.begin(), keys.end(), Mem_compare_sint4_generic());
}
}
#endif
} // namespace alignment_unittest
|
