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
|
/* Optimized strlen implementation for PowerPC64/POWER8 using a vectorized
loop.
Copyright (C) 2016-2017 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#include <sysdep.h>
/* TODO: change these to the actual instructions when the minimum required
binutils allows it. */
#define MFVRD(r,v) .long (0x7c000067 | ((v)<<(32-11)) | ((r)<<(32-16)))
#define VBPERMQ(t,a,b) .long (0x1000054c \
| ((t)<<(32-11)) \
| ((a)<<(32-16)) \
| ((b)<<(32-21)) )
/* int [r3] strlen (char *s [r3]) */
#ifndef STRLEN
# define STRLEN strlen
#endif
/* TODO: change this to .machine power8 when the minimum required binutils
allows it. */
.machine power7
EALIGN (STRLEN, 4, 0)
CALL_MCOUNT 1
dcbt 0,r3
clrrdi r4,r3,3 /* Align the address to doubleword boundary. */
rlwinm r6,r3,3,26,28 /* Calculate padding. */
li r0,0 /* Doubleword with null chars to use
with cmpb. */
li r5,-1 /* MASK = 0xffffffffffffffff. */
ld r12,0(r4) /* Load doubleword from memory. */
#ifdef __LITTLE_ENDIAN__
sld r5,r5,r6
#else
srd r5,r5,r6 /* MASK = MASK >> padding. */
#endif
orc r9,r12,r5 /* Mask bits that are not part of the string. */
cmpb r10,r9,r0 /* Check for null bytes in DWORD1. */
cmpdi cr7,r10,0 /* If r10 == 0, no null's have been found. */
bne cr7,L(done)
/* For shorter strings (< 64 bytes), we will not use vector registers,
as the overhead isn't worth it. So, let's use GPRs instead. This
will be done the same way as we do in the POWER7 implementation.
Let's see if we are aligned to a quadword boundary. If so, we can
jump to the first (non-vectorized) loop. Otherwise, we have to
handle the next DWORD first. */
mtcrf 0x01,r4
mr r9,r4
addi r9,r9,8
bt 28,L(align64)
/* Handle the next 8 bytes so we are aligned to a quadword
boundary. */
ldu r5,8(r4)
cmpb r10,r5,r0
cmpdi cr7,r10,0
addi r9,r9,8
bne cr7,L(done)
L(align64):
/* Proceed to the old (POWER7) implementation, checking two doublewords
per iteraction. For the first 56 bytes, we will just check for null
characters. After that, we will also check if we are 64-byte aligned
so we can jump to the vectorized implementation. We will unroll
these loops to avoid excessive branching. */
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
bne cr7,L(dword_zero)
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
bne cr7,L(dword_zero)
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
bne cr7,L(dword_zero)
/* Are we 64-byte aligned? If so, jump to the vectorized loop.
Note: aligning to 64-byte will necessarily slow down performance for
strings around 64 bytes in length due to the extra comparisons
required to check alignment for the vectorized loop. This is a
necessary tradeoff we are willing to take in order to speed up the
calculation for larger strings. */
andi. r10,r9,63
beq cr0,L(preloop)
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
bne cr7,L(dword_zero)
andi. r10,r9,63
beq cr0,L(preloop)
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
bne cr7,L(dword_zero)
andi. r10,r9,63
beq cr0,L(preloop)
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
bne cr7,L(dword_zero)
andi. r10,r9,63
beq cr0,L(preloop)
ld r6,8(r4)
ldu r5,16(r4)
cmpb r10,r6,r0
cmpb r11,r5,r0
or r5,r10,r11
cmpdi cr7,r5,0
addi r9,r9,16
/* At this point, we are necessarily 64-byte aligned. If no zeroes were
found, jump to the vectorized loop. */
beq cr7,L(preloop)
L(dword_zero):
/* OK, one (or both) of the doublewords contains a null byte. Check
the first doubleword and decrement the address in case the first
doubleword really contains a null byte. */
cmpdi cr6,r10,0
addi r4,r4,-8
bne cr6,L(done)
/* The null byte must be in the second doubleword. Adjust the address
again and move the result of cmpb to r10 so we can calculate the
length. */
mr r10,r11
addi r4,r4,8
/* If the null byte was found in the non-vectorized code, compute the
final length. r10 has the output of the cmpb instruction, that is,
it contains 0xff in the same position as the null byte in the
original doubleword from the string. Use that to calculate the
length. */
L(done):
#ifdef __LITTLE_ENDIAN__
addi r9, r10,-1 /* Form a mask from trailing zeros. */
andc r9, r9,r10
popcntd r0, r9 /* Count the bits in the mask. */
#else
cntlzd r0,r10 /* Count leading zeros before the match. */
#endif
subf r5,r3,r4
srdi r0,r0,3 /* Convert leading/trailing zeros to bytes. */
add r3,r5,r0 /* Compute final length. */
blr
/* Vectorized implementation starts here. */
.p2align 4
L(preloop):
/* Set up for the loop. */
mr r4,r9
li r7, 16 /* Load required offsets. */
li r8, 32
li r9, 48
li r12, 8
vxor v0,v0,v0 /* VR with null chars to use with
vcmpequb. */
/* Main loop to look for the end of the string. We will read in
64-byte chunks. Align it to 32 bytes and unroll it 3 times to
leverage the icache performance. */
.p2align 5
L(loop):
lvx v1,r4,r0 /* Load 4 quadwords. */
lvx v2,r4,r7
lvx v3,r4,r8
lvx v4,r4,r9
vminub v5,v1,v2 /* Compare and merge into one VR for speed. */
vminub v6,v3,v4
vminub v7,v5,v6
vcmpequb. v7,v7,v0 /* Check for NULLs. */
addi r4,r4,64 /* Adjust address for the next iteration. */
bne cr6,L(vmx_zero)
lvx v1,r4,r0 /* Load 4 quadwords. */
lvx v2,r4,r7
lvx v3,r4,r8
lvx v4,r4,r9
vminub v5,v1,v2 /* Compare and merge into one VR for speed. */
vminub v6,v3,v4
vminub v7,v5,v6
vcmpequb. v7,v7,v0 /* Check for NULLs. */
addi r4,r4,64 /* Adjust address for the next iteration. */
bne cr6,L(vmx_zero)
lvx v1,r4,r0 /* Load 4 quadwords. */
lvx v2,r4,r7
lvx v3,r4,r8
lvx v4,r4,r9
vminub v5,v1,v2 /* Compare and merge into one VR for speed. */
vminub v6,v3,v4
vminub v7,v5,v6
vcmpequb. v7,v7,v0 /* Check for NULLs. */
addi r4,r4,64 /* Adjust address for the next iteration. */
beq cr6,L(loop)
L(vmx_zero):
/* OK, we found a null byte. Let's look for it in the current 64-byte
block and mark it in its corresponding VR. */
vcmpequb v1,v1,v0
vcmpequb v2,v2,v0
vcmpequb v3,v3,v0
vcmpequb v4,v4,v0
/* We will now 'compress' the result into a single doubleword, so it
can be moved to a GPR for the final calculation. First, we
generate an appropriate mask for vbpermq, so we can permute bits into
the first halfword. */
vspltisb v10,3
lvsl v11,r0,r0
vslb v10,v11,v10
/* Permute the first bit of each byte into bits 48-63. */
VBPERMQ(v1,v1,v10)
VBPERMQ(v2,v2,v10)
VBPERMQ(v3,v3,v10)
VBPERMQ(v4,v4,v10)
/* Shift each component into its correct position for merging. */
#ifdef __LITTLE_ENDIAN__
vsldoi v2,v2,v2,2
vsldoi v3,v3,v3,4
vsldoi v4,v4,v4,6
#else
vsldoi v1,v1,v1,6
vsldoi v2,v2,v2,4
vsldoi v3,v3,v3,2
#endif
/* Merge the results and move to a GPR. */
vor v1,v2,v1
vor v2,v3,v4
vor v4,v1,v2
MFVRD(r10,v4)
/* Adjust address to the begninning of the current 64-byte block. */
addi r4,r4,-64
#ifdef __LITTLE_ENDIAN__
addi r9, r10,-1 /* Form a mask from trailing zeros. */
andc r9, r9,r10
popcntd r0, r9 /* Count the bits in the mask. */
#else
cntlzd r0,r10 /* Count leading zeros before the match. */
#endif
subf r5,r3,r4
add r3,r5,r0 /* Compute final length. */
blr
END (STRLEN)
libc_hidden_builtin_def (strlen)
|
