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
|
/* strchr (str, ch) -- Return pointer to first occurrence of CH in STR.
For AMD x86-64.
Copyright (C) 2002, 2005 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>
#include "asm-syntax.h"
#include "bp-sym.h"
#include "bp-asm.h"
.text
ENTRY (BP_SYM (strchr))
/* Before we start with the main loop we process single bytes
until the source pointer is aligned. This has two reasons:
1. aligned 64-bit memory access is faster
and (more important)
2. we process in the main loop 64 bit in one step although
we don't know the end of the string. But accessing at
8-byte alignment guarantees that we never access illegal
memory if this would not also be done by the trivial
implementation (this is because all processor inherent
boundaries are multiples of 8). */
movq %rdi, %rdx
andl $7, %edx /* Mask alignment bits */
movq %rdi, %rax /* duplicate destination. */
jz 1f /* aligned => start loop */
neg %edx
addl $8, %edx /* Align to 8 bytes. */
/* Search the first bytes directly. */
0: movb (%rax), %cl /* load byte */
cmpb %cl,%sil /* compare byte. */
je 6f /* target found */
testb %cl,%cl /* is byte NUL? */
je 7f /* yes => return NULL */
incq %rax /* increment pointer */
decl %edx
jnz 0b
1:
/* At the moment %rsi contains C. What we need for the
algorithm is C in all bytes of the register. Avoid
operations on 16 bit words because these require an
prefix byte (and one more cycle). */
/* Populate 8 bit data to full 64-bit. */
movabs $0x0101010101010101,%r9
movzbl %sil,%edx
imul %rdx,%r9
movq $0xfefefefefefefeff, %r8 /* Save magic. */
/* We exit the loop if adding MAGIC_BITS to LONGWORD fails to
change any of the hole bits of LONGWORD.
1) Is this safe? Will it catch all the zero bytes?
Suppose there is a byte with all zeros. Any carry bits
propagating from its left will fall into the hole at its
least significant bit and stop. Since there will be no
carry from its most significant bit, the LSB of the
byte to the left will be unchanged, and the zero will be
detected.
2) Is this worthwhile? Will it ignore everything except
zero bytes? Suppose every byte of QUARDWORD has a bit set
somewhere. There will be a carry into bit 8. If bit 8
is set, this will carry into bit 16. If bit 8 is clear,
one of bits 9-15 must be set, so there will be a carry
into bit 16. Similarly, there will be a carry into bit
24 tec.. If one of bits 54-63 is set, there will be a carry
into bit 64 (=carry flag), so all of the hole bits will
be changed.
3) But wait! Aren't we looking for C, not zero?
Good point. So what we do is XOR LONGWORD with a longword,
each of whose bytes is C. This turns each byte that is C
into a zero. */
.p2align 4
4:
/* Main Loop is unrolled 4 times. */
/* First unroll. */
movq (%rax), %rcx /* get double word (= 8 bytes) in question */
addq $8,%rax /* adjust pointer for next word */
movq %r8, %rdx /* magic value */
xorq %r9, %rcx /* XOR with qword c|...|c => bytes of str == c
are now 0 */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 3f /* highest byte is NUL => return pointer */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 3f /* found c => return pointer */
/* The quadword we looked at does not contain the value we're looking
for. Let's search now whether we have reached the end of the
string. */
xorq %r9, %rcx /* restore original dword without reload */
movq %r8, %rdx /* magic value */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 7f /* highest byte is NUL => return NULL */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 7f /* found NUL => return NULL */
/* Second unroll. */
movq (%rax), %rcx /* get double word (= 8 bytes) in question */
addq $8,%rax /* adjust pointer for next word */
movq %r8, %rdx /* magic value */
xorq %r9, %rcx /* XOR with qword c|...|c => bytes of str == c
are now 0 */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 3f /* highest byte is NUL => return pointer */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 3f /* found c => return pointer */
/* The quadword we looked at does not contain the value we're looking
for. Let's search now whether we have reached the end of the
string. */
xorq %r9, %rcx /* restore original dword without reload */
movq %r8, %rdx /* magic value */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 7f /* highest byte is NUL => return NULL */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 7f /* found NUL => return NULL */
/* Third unroll. */
movq (%rax), %rcx /* get double word (= 8 bytes) in question */
addq $8,%rax /* adjust pointer for next word */
movq %r8, %rdx /* magic value */
xorq %r9, %rcx /* XOR with qword c|...|c => bytes of str == c
are now 0 */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 3f /* highest byte is NUL => return pointer */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 3f /* found c => return pointer */
/* The quadword we looked at does not contain the value we're looking
for. Let's search now whether we have reached the end of the
string. */
xorq %r9, %rcx /* restore original dword without reload */
movq %r8, %rdx /* magic value */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 7f /* highest byte is NUL => return NULL */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 7f /* found NUL => return NULL */
/* Fourth unroll. */
movq (%rax), %rcx /* get double word (= 8 bytes) in question */
addq $8,%rax /* adjust pointer for next word */
movq %r8, %rdx /* magic value */
xorq %r9, %rcx /* XOR with qword c|...|c => bytes of str == c
are now 0 */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 3f /* highest byte is NUL => return pointer */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jnz 3f /* found c => return pointer */
/* The quadword we looked at does not contain the value we're looking
for. Let's search now whether we have reached the end of the
string. */
xorq %r9, %rcx /* restore original dword without reload */
movq %r8, %rdx /* magic value */
addq %rcx, %rdx /* add the magic value to the word. We get
carry bits reported for each byte which
is *not* 0 */
jnc 7f /* highest byte is NUL => return NULL */
xorq %rcx, %rdx /* (word+magic)^word */
orq %r8, %rdx /* set all non-carry bits */
incq %rdx /* add 1: if one carry bit was *not* set
the addition will not result in 0. */
jz 4b /* no NUL found => restart loop */
7: /* Return NULL. */
xorl %eax, %eax
retq
/* We now scan for the byte in which the character was matched.
But we have to take care of the case that a NUL char is
found before this in the dword. Note that we XORed %rcx
with the byte we're looking for, therefore the tests below look
reversed. */
.p2align 4 /* Align, it's a jump target. */
3: movq %r9,%rdx /* move to %rdx so that we can access bytes */
subq $8,%rax /* correct pointer increment. */
testb %cl, %cl /* is first byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %cl /* is first byte NUL? */
je 7b /* yes => return NULL */
incq %rax /* increment pointer */
testb %ch, %ch /* is second byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %ch /* is second byte NUL? */
je 7b /* yes => return NULL? */
incq %rax /* increment pointer */
shrq $16, %rcx /* make upper bytes accessible */
testb %cl, %cl /* is third byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %cl /* is third byte NUL? */
je 7b /* yes => return NULL */
incq %rax /* increment pointer */
testb %ch, %ch /* is fourth byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %ch /* is fourth byte NUL? */
je 7b /* yes => return NULL? */
incq %rax /* increment pointer */
shrq $16, %rcx /* make upper bytes accessible */
testb %cl, %cl /* is fifth byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %cl /* is fifth byte NUL? */
je 7b /* yes => return NULL */
incq %rax /* increment pointer */
testb %ch, %ch /* is sixth byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %ch /* is sixth byte NUL? */
je 7b /* yes => return NULL? */
incq %rax /* increment pointer */
shrq $16, %rcx /* make upper bytes accessible */
testb %cl, %cl /* is seventh byte C? */
jz 6f /* yes => return pointer */
cmpb %dl, %cl /* is seventh byte NUL? */
je 7b /* yes => return NULL */
/* It must be in the eigth byte and it cannot be NUL. */
incq %rax
6:
nop
retq
END (BP_SYM (strchr))
weak_alias (BP_SYM (strchr), BP_SYM (index))
libc_hidden_builtin_def (strchr)
|
