1 /* Copyright (c) 2014, 2021, Oracle and/or its affiliates.
2 
3    This program is free software; you can redistribute it and/or modify
4    it under the terms of the GNU General Public License, version 2.0,
5    as published by the Free Software Foundation.
6 
7    This program is also distributed with certain software (including
8    but not limited to OpenSSL) that is licensed under separate terms,
9    as designated in a particular file or component or in included license
10    documentation.  The authors of MySQL hereby grant you an additional
11    permission to link the program and your derivative works with the
12    separately licensed software that they have included with MySQL.
13 
14    This program is distributed in the hope that it will be useful,
15    but WITHOUT ANY WARRANTY; without even the implied warranty of
16    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
17    GNU General Public License, version 2.0, for more details.
18 
19    You should have received a copy of the GNU General Public License
20    along with this program; if not, write to the Free Software
21    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA */
22 
23 #include "strnxfrm.h"
24 
25 namespace strnxfrm_unittest {
26 
27 // A copy of the original my_strnxfrm_simple
28 size_t
strnxfrm_orig(const CHARSET_INFO * cs,uchar * dst,size_t dstlen,uint nweights,const uchar * src,size_t srclen,uint flags)29 strnxfrm_orig(const CHARSET_INFO *cs,
30               uchar *dst, size_t dstlen, uint nweights,
31               const uchar *src, size_t srclen, uint flags)
32 {
33   const uchar *map= cs->sort_order;
34   uchar *d0= dst;
35   size_t frmlen;
36   if ((frmlen= MY_MIN(dstlen, nweights)) > srclen)
37     frmlen= srclen;
38   if (dst != src)
39   {
40     const uchar *end;
41     for (end= src + frmlen; src < end;)
42       *dst++= map[*src++];
43   }
44   else
45   {
46     const uchar *end;
47     for (end= dst + frmlen; dst < end; dst++)
48       *dst= map[(uchar) *dst];
49   }
50   return my_strxfrm_pad_desc_and_reverse(cs, d0, dst, d0 + dstlen,
51                                          (uint)(nweights - frmlen), flags, 0);
52 }
53 
54 
55 size_t
strnxfrm_orig_unrolled(const CHARSET_INFO * cs,uchar * dst,size_t dstlen,uint nweights,const uchar * src,size_t srclen,uint flags)56 strnxfrm_orig_unrolled(const CHARSET_INFO *cs,
57                        uchar *dst, size_t dstlen, uint nweights,
58                        const uchar *src, size_t srclen, uint flags)
59 {
60   const uchar *map= cs->sort_order;
61   uchar *d0= dst;
62   size_t frmlen;
63   const uchar *end;
64   const uchar *remainder;
65   if ((frmlen= MY_MIN(dstlen, nweights)) > srclen)
66     frmlen= srclen;
67   end= src + frmlen;
68   remainder= src + (frmlen % 8);
69   if (dst != src)
70   {
71     for (; src < remainder;)
72       *dst++= map[*src++];
73     for (; src < end;)
74     {
75       *dst++= map[*src++];
76       *dst++= map[*src++];
77       *dst++= map[*src++];
78       *dst++= map[*src++];
79       *dst++= map[*src++];
80       *dst++= map[*src++];
81       *dst++= map[*src++];
82       *dst++= map[*src++];
83     }
84   }
85   else /* dst == src */
86   {
87     for (; dst < remainder;)
88     {
89       *dst= map[*dst]; ++dst;
90     }
91     for (; dst < end;)
92     {
93       *dst= map[*dst]; ++dst;
94       *dst= map[*dst]; ++dst;
95       *dst= map[*dst]; ++dst;
96       *dst= map[*dst]; ++dst;
97       *dst= map[*dst]; ++dst;
98       *dst= map[*dst]; ++dst;
99       *dst= map[*dst]; ++dst;
100       *dst= map[*dst]; ++dst;
101     }
102   }
103   return my_strxfrm_pad_desc_and_reverse(cs, d0, dst, d0 + dstlen,
104                                          (uint)(nweights - frmlen), flags, 0);
105 }
106 
107 
108 // An alternative implementation, skipping the (dst != src) test.
109 size_t
strnxfrm_new(const CHARSET_INFO * cs,uchar * dst,size_t dstlen,uint nweights,const uchar * src,size_t srclen,uint flags)110 strnxfrm_new(const CHARSET_INFO *cs,
111              uchar *dst, size_t dstlen, uint nweights,
112              const uchar *src, size_t srclen, uint flags)
113 {
114   const uchar *map= cs->sort_order;
115   uchar *d0= dst;
116   const uchar *end;
117   size_t frmlen;
118   if ((frmlen= MY_MIN(dstlen, nweights)) > srclen)
119     frmlen= srclen;
120   for (end= src + frmlen; src < end;)
121     *dst++= map[*src++];
122   return my_strxfrm_pad_desc_and_reverse(cs, d0, dst, d0 + dstlen,
123                                          (uint)(nweights - frmlen), flags, 0);
124 }
125 
126 
127 size_t
strnxfrm_new_unrolled(const CHARSET_INFO * cs,uchar * dst,size_t dstlen,uint nweights,const uchar * src,size_t srclen,uint flags)128 strnxfrm_new_unrolled(const CHARSET_INFO *cs,
129                       uchar *dst, size_t dstlen, uint nweights,
130                       const uchar *src, size_t srclen, uint flags)
131 {
132   const uchar *map= cs->sort_order;
133   uchar *d0= dst;
134   const uchar *end;
135   const uchar *remainder;
136   size_t frmlen;
137   if ((frmlen= MY_MIN(dstlen, nweights)) > srclen)
138     frmlen= srclen;
139   end= src + frmlen;
140   remainder= src + (frmlen % 8);
141   for (; src < remainder;)
142     *dst++= map[*src++];
143   for (; src < end;)
144   {
145     *dst++= map[*src++];
146     *dst++= map[*src++];
147     *dst++= map[*src++];
148     *dst++= map[*src++];
149     *dst++= map[*src++];
150     *dst++= map[*src++];
151     *dst++= map[*src++];
152     *dst++= map[*src++];
153   }
154   return my_strxfrm_pad_desc_and_reverse(cs, d0, dst, d0 + dstlen,
155                                          (uint)(nweights - frmlen), flags, 0);
156 }
157 
158 
159 }
160