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
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
|
/* Optimized strchr implementation for PowerPC64/POWER8.
Copyright (C) 2016-2019 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
<https://www.gnu.org/licenses/>. */
#include <sysdep.h>
#ifdef USE_AS_STRCHRNUL
# ifndef STRCHRNUL
# define FUNC_NAME __strchrnul
# else
# define FUNC_NAME STRCHRNUL
# endif
#else
# ifndef STRCHR
# define FUNC_NAME strchr
# else
# define FUNC_NAME STRCHR
# endif
#endif /* !USE_AS_STRCHRNUL */
/* int [r3] strchr (char *s [r3], int c [r4]) */
.machine power8
ENTRY_TOCLESS (FUNC_NAME)
CALL_MCOUNT 2
dcbt 0,r3
clrrdi r8,r3,3 /* Align the address to doubleword boundary. */
cmpdi cr7,r4,0
ld r12,0(r8) /* Load doubleword from memory. */
li r0,0 /* Doubleword with null chars to use
with cmpb. */
rlwinm r6,r3,3,26,28 /* Calculate padding. */
beq cr7,L(null_match)
/* Replicate byte to doubleword. */
insrdi r4,r4,8,48
insrdi r4,r4,16,32
insrdi r4,r4,32,0
/* Now r4 has a doubleword of c bytes and r0 has
a doubleword of null bytes. */
cmpb r10,r12,r4 /* Compare each byte against c byte. */
cmpb r11,r12,r0 /* Compare each byte against null byte. */
/* Move the doublewords left and right to discard the bits that are
not part of the string and bring them back as zeros. */
#ifdef __LITTLE_ENDIAN__
srd r10,r10,r6
srd r11,r11,r6
sld r10,r10,r6
sld r11,r11,r6
#else
sld r10,r10,r6
sld r11,r11,r6
srd r10,r10,r6
srd r11,r11,r6
#endif
or r5,r10,r11 /* OR the results to speed things up. */
cmpdi cr7,r5,0 /* If r5 == 0, no c or null bytes
have been found. */
bne cr7,L(done)
mtcrf 0x01,r8
/* Are we now aligned to a doubleword boundary? If so, skip to
the main loop. Otherwise, go through the alignment code. */
bt 28,L(loop)
/* Handle WORD2 of pair. */
ldu r12,8(r8)
cmpb r10,r12,r4
cmpb r11,r12,r0
or r5,r10,r11
cmpdi cr7,r5,0
bne cr7,L(done)
b L(loop) /* We branch here (rather than falling through)
to skip the nops due to heavy alignment
of the loop below. */
.p2align 5
L(loop):
/* Load two doublewords, compare and merge in a
single register for speed. This is an attempt
to speed up the null-checking process for bigger strings. */
ld r12,8(r8)
ldu r9,16(r8)
cmpb r10,r12,r4
cmpb r11,r12,r0
cmpb r6,r9,r4
cmpb r7,r9,r0
or r5,r10,r11
or r9,r6,r7
or r12,r5,r9
cmpdi cr7,r12,0
beq cr7,L(vector)
/* OK, one (or both) of the doublewords contains a c/null byte. Check
the first doubleword and decrement the address in case the first
doubleword really contains a c/null byte. */
cmpdi cr6,r5,0
addi r8,r8,-8
bne cr6,L(done)
/* The c/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 pointer. */
mr r10,r6
mr r11,r7
addi r8,r8,8
#ifdef USE_AS_STRCHRNUL
mr r5, r9
#endif
/* r10/r11 have the output of the cmpb instructions, that is,
0xff in the same position as the c/null byte in the original
doubleword from the string. Use that to calculate the pointer. */
L(done):
#ifdef USE_AS_STRCHRNUL
mr r10, r5
#endif
#ifdef __LITTLE_ENDIAN__
addi r3,r10,-1
andc r3,r3,r10
popcntd r0,r3
# ifndef USE_AS_STRCHRNUL
addi r4,r11,-1
andc r4,r4,r11
cmpld cr7,r3,r4
bgt cr7,L(no_match)
# endif
#else
cntlzd r0,r10 /* Count leading zeros before c matches. */
# ifndef USE_AS_STRCHRNUL
cmpld cr7,r11,r10
bgt cr7,L(no_match)
# endif
#endif
srdi r0,r0,3 /* Convert leading zeros to bytes. */
add r3,r8,r0 /* Return address of the matching c byte
or null in case c was not found. */
blr
/* Check the first 32B in GPR's and move to vectorized loop. */
.p2align 5
L(vector):
addi r3, r8, 8
andi. r10, r3, 31
bne cr0, L(loop)
vspltisb v0, 0
/* Precompute vbpermq constant. */
vspltisb v10, 3
lvsl v11, r0, r0
vslb v10, v11, v10
mtvrd v1, r4
li r5, 16
vspltb v1, v1, 7
/* Compare 32 bytes in each loop. */
L(continue):
lvx v4, 0, r3
lvx v5, r3, r5
vcmpequb v2, v0, v4
vcmpequb v3, v0, v5
vcmpequb v6, v1, v4
vcmpequb v7, v1, v5
vor v8, v2, v3
vor v9, v6, v7
vor v11, v8, v9
vcmpequb. v11, v0, v11
addi r3, r3, 32
blt cr6, L(continue)
/* One (or both) of the quadwords contains a c/null byte. */
addi r3, r3, -32
#ifndef USE_AS_STRCHRNUL
vcmpequb. v11, v0, v9
blt cr6, L(no_match)
#endif
/* Permute the first bit of each byte into bits 48-63. */
vbpermq v2, v2, v10
vbpermq v3, v3, v10
vbpermq v6, v6, v10
vbpermq v7, v7, v10
/* Shift each component into its correct position for merging. */
#ifdef __LITTLE_ENDIAN__
vsldoi v3, v3, v3, 2
vsldoi v7, v7, v7, 2
#else
vsldoi v2, v2, v2, 6
vsldoi v3, v3, v3, 4
vsldoi v6, v6, v6, 6
vsldoi v7, v7, v7, 4
#endif
/* Merge the results and move to a GPR. */
vor v1, v3, v2
vor v2, v6, v7
vor v4, v1, v2
mfvrd r5, v4
#ifdef __LITTLE_ENDIAN__
addi r6, r5, -1
andc r6, r6, r5
popcntd r6, r6
#else
cntlzd r6, r5 /* Count leading zeros before the match. */
#endif
add r3, r3, r6 /* Compute final length. */
/* Return NULL if null found before c. */
#ifndef USE_AS_STRCHRNUL
lbz r4, 0(r3)
cmpdi cr7, r4, 0
beq cr7, L(no_match)
#endif
blr
#ifndef USE_AS_STRCHRNUL
.align 4
L(no_match):
li r3,0
blr
#endif
/* We are here because strchr was called with a null byte. */
.align 4
L(null_match):
/* r0 has a doubleword of null bytes. */
cmpb r5,r12,r0 /* Compare each byte against null bytes. */
/* Move the doublewords left and right to discard the bits that are
not part of the string and bring them back as zeros. */
#ifdef __LITTLE_ENDIAN__
srd r5,r5,r6
sld r5,r5,r6
#else
sld r5,r5,r6
srd r5,r5,r6
#endif
cmpdi cr7,r5,0 /* If r10 == 0, no c or null bytes
have been found. */
bne cr7,L(done_null)
mtcrf 0x01,r8
/* Are we now aligned to a quadword boundary? If so, skip to
the main loop. Otherwise, go through the alignment code. */
bt 28,L(loop_null)
/* Handle WORD2 of pair. */
ldu r12,8(r8)
cmpb r5,r12,r0
cmpdi cr7,r5,0
bne cr7,L(done_null)
b L(loop_null) /* We branch here (rather than falling through)
to skip the nops due to heavy alignment
of the loop below. */
/* Main loop to look for the end of the string. Since it's a
small loop (< 8 instructions), align it to 32-bytes. */
.p2align 5
L(loop_null):
/* Load two doublewords, compare and merge in a
single register for speed. This is an attempt
to speed up the null-checking process for bigger strings. */
ld r12,8(r8)
ldu r11,16(r8)
cmpb r5,r12,r0
cmpb r10,r11,r0
or r6,r5,r10
cmpdi cr7,r6,0
beq cr7,L(vector1)
/* 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,r5,0
addi r8,r8,-8
bne cr6,L(done_null)
/* 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
pointer. */
mr r5,r10
addi r8,r8,8
/* r5 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 pointer. */
L(done_null):
#ifdef __LITTLE_ENDIAN__
addi r0,r5,-1
andc r0,r0,r5
popcntd r0,r0
#else
cntlzd r0,r5 /* Count leading zeros before the match. */
#endif
srdi r0,r0,3 /* Convert leading zeros to bytes. */
add r3,r8,r0 /* Return address of the matching null byte. */
blr
.p2align 5
L(vector1):
addi r3, r8, 8
andi. r10, r3, 31
bne cr0, L(loop_null)
vspltisb v8, -1
vspltisb v0, 0
vspltisb v10, 3
lvsl v11, r0, r0
vslb v10, v11, v10
li r5, 16
L(continue1):
lvx v4, 0, r3
lvx v5, r3, r5
vcmpequb v2, v0, v4
vcmpequb v3, v0, v5
vor v8, v2, v3
vcmpequb. v11, v0, v8
addi r3, r3, 32
blt cr6, L(continue1)
addi r3, r3, -32
L(end1):
vbpermq v2, v2, v10
vbpermq v3, v3, v10
/* Shift each component into its correct position for merging. */
#ifdef __LITTLE_ENDIAN__
vsldoi v3, v3, v3, 2
#else
vsldoi v2, v2, v2, 6
vsldoi v3, v3, v3, 4
#endif
/* Merge the results and move to a GPR. */
vor v4, v3, v2
mfvrd r5, v4
#ifdef __LITTLE_ENDIAN__
addi r6, r5, -1
andc r6, r6, r5
popcntd r6, r6
#else
cntlzd r6, r5 /* Count leading zeros before the match. */
#endif
add r3, r3, r6 /* Compute final length. */
blr
END (FUNC_NAME)
#ifndef USE_AS_STRCHRNUL
weak_alias (strchr, index)
libc_hidden_builtin_def (strchr)
#endif
|
