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
|
/* Copyright (c) 2014, 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 "unittest/gunit/strnxfrm.h"
#include <algorithm>
#include "my_inttypes.h"
#include "my_macros.h"
namespace strnxfrm_unittest {
// A copy of the original my_strnxfrm_simple
size_t strnxfrm_orig(const CHARSET_INFO *cs, uchar *dst, size_t dstlen,
uint nweights, const uchar *src, size_t srclen,
uint flags) {
const uchar *map = cs->sort_order;
uchar *d0 = dst;
size_t frmlen;
if ((frmlen = std::min<size_t>(dstlen, nweights)) > srclen) frmlen = srclen;
if (dst != src) {
const uchar *end;
for (end = src + frmlen; src < end;) *dst++ = map[*src++];
} else {
const uchar *end;
for (end = dst + frmlen; dst < end; dst++) *dst = map[(uchar)*dst];
}
return my_strxfrm_pad(cs, d0, dst, d0 + dstlen, (uint)(nweights - frmlen),
flags);
}
size_t strnxfrm_orig_unrolled(const CHARSET_INFO *cs, uchar *dst, size_t dstlen,
uint nweights, const uchar *src, size_t srclen,
uint flags) {
const uchar *map = cs->sort_order;
uchar *d0 = dst;
size_t frmlen;
const uchar *end;
const uchar *remainder;
if ((frmlen = std::min<size_t>(dstlen, nweights)) > srclen) frmlen = srclen;
end = src + frmlen;
remainder = src + (frmlen % 8);
if (dst != src) {
for (; src < remainder;) *dst++ = map[*src++];
for (; src < end;) {
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
}
} else /* dst == src */
{
for (; dst < remainder;) {
*dst = map[*dst];
++dst;
}
for (; dst < end;) {
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
*dst = map[*dst];
++dst;
}
}
return my_strxfrm_pad(cs, d0, dst, d0 + dstlen, (uint)(nweights - frmlen),
flags);
}
// An alternative implementation, skipping the (dst != src) test.
size_t strnxfrm_new(const CHARSET_INFO *cs, uchar *dst, size_t dstlen,
uint nweights, const uchar *src, size_t srclen,
uint flags) {
const uchar *map = cs->sort_order;
uchar *d0 = dst;
const uchar *end;
size_t frmlen;
if ((frmlen = std::min<size_t>(dstlen, nweights)) > srclen) frmlen = srclen;
for (end = src + frmlen; src < end;) *dst++ = map[*src++];
return my_strxfrm_pad(cs, d0, dst, d0 + dstlen, (uint)(nweights - frmlen),
flags);
}
size_t strnxfrm_new_unrolled(const CHARSET_INFO *cs, uchar *dst, size_t dstlen,
uint nweights, const uchar *src, size_t srclen,
uint flags) {
const uchar *map = cs->sort_order;
uchar *d0 = dst;
const uchar *end;
const uchar *remainder;
size_t frmlen;
if ((frmlen = std::min<size_t>(dstlen, nweights)) > srclen) frmlen = srclen;
end = src + frmlen;
remainder = src + (frmlen % 8);
for (; src < remainder;) *dst++ = map[*src++];
for (; src < end;) {
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
*dst++ = map[*src++];
}
return my_strxfrm_pad(cs, d0, dst, d0 + dstlen, (uint)(nweights - frmlen),
flags);
}
} // namespace strnxfrm_unittest
|
